A. Asperti, W. Ricciotti, C. Sacerdoti-coen, and E. Tassi, A bidirectional refinement algorithm for the calculus of (co)inductive constructions, In Logical Methods in Computer Science, vol.8, 2017.

F. Barbanera, M. Dezani-ciancaglini, and U. Liguoro, Intersection and Union Types: Syntax and Semantics, Information and Computation, vol.119, issue.2, 1995.
DOI : 10.1006/inco.1995.1086

URL : https://doi.org/10.1006/inco.1995.1086

F. Barbanera and S. Martini, Proof-functional connectives and realizability, Archive for Mathematical Logic, vol.1, issue.1, pp.189-211, 1994.
DOI : 10.1007/BF01203032

H. Barendregt, The ?-Calculus with types, 2013.
DOI : 10.1017/CBO9781139032636

H. Barendregt, M. Coppo, and M. Dezani-ciancaglini, A filter lambda model and the completeness of type assignment, The Journal of Symbolic Logic, vol.37, issue.04, pp.931-940, 1983.
DOI : 10.1002/malq.19800261902

J. Bessai, Extracting a formally veri ed Subtyping Algorithm for Intersection Types from Ideals and Filters. Talk at COST Types, slides, 2016.

M. Coppo, M. Dezani-ciancaglini, F. Honsell, and G. Longo, Extended Type Structures and Filter Lambda Models, Logic Colloquium '82, pp.241-262, 1983.
DOI : 10.1016/S0049-237X(08)71819-6

D. J. Dougherty, U. De-'liguoro, L. Liquori, and C. Stolze, A Realizability Interpretation for Intersection and Union Types, In APLAS (Lecture Notes in Computer Science), vol.12, issue.3, pp.187-205, 2016.
DOI : 10.1007/3-540-45927-8_9

URL : https://hal.archives-ouvertes.fr/hal-01317213

J. Daniel, L. Dougherty, and . Liquori, Logic and Computation in a Lambda Calculus with Intersection and Union Types, LPAR, pp.173-191, 2010.

J. Dunfield, Elaborating Intersection and Union Types, ICFP '12, pp.17-28, 2012.

A. Frisch, G. Castagna, and V. Benzaken, Semantic subtyping, Journal of the ACM, vol.55, issue.4, pp.1-1964, 2008.
DOI : 10.1145/1391289.1391293

URL : https://hal.archives-ouvertes.fr/hal-00152690

R. Harper, F. Honsell, and G. Plotkin, A framework for defining logics, Journal of the ACM, vol.40, issue.1, pp.143-184, 1993.
DOI : 10.1145/138027.138060

URL : http://www.cs.cmu.edu/~rwh/papers/lf/jacm93.ps

R. Harper and D. R. Licata, Mechanizing metatheory in a logical framework, Journal of Functional Programming, vol.40, issue.4-5, pp.4-5, 2007.
DOI : 10.1006/inco.2001.2951

J. and R. Hindley, The simple semantics for Coppo-Dezani-Sall?? types, International Symposium on Programming, pp.212-226, 1992.
DOI : 10.1007/3-540-11494-7_15

F. Honsell and M. Lenisa, Semantical Analysis of Perpetual Strategies in lambda-Calculus, Theor. Comput. Sci, vol.212, pp.1-2, 1993.

L. Liquori, Andreas Nuyts and Claude Stolze Private communications, 2017.

L. Liquori and S. Rocca, Intersection Typed System à la Church, Information and Computation, vol.9, issue.205, pp.1371-1386, 2007.
DOI : 10.1016/j.ic.2007.03.005

URL : https://hal.archives-ouvertes.fr/hal-01149611

L. Liquori and C. Stolze, A Decidable Subtyping Logic for Intersection and Union Types, In TTCS (Lecture Notes in Computer Science, vol.19, issue.3, 2017.
DOI : 10.1016/S0019-9958(86)80019-5

URL : https://hal.archives-ouvertes.fr/hal-01560681

G. K. Edgar and . Lopez-escobar, Proof functional connectives, Methods in Mathematical Logic, pp.208-221, 1985.

D. B. Macqueen, G. D. Plotkin, and R. Sethi, An ideal model for recursive polymorphic types, Information and Control, vol.71, issue.1-2, pp.95-130, 1986.
DOI : 10.1016/S0019-9958(86)80019-5

K. Robert, R. Meyer, and . Routley, Algebraic analysis of entailment I, Logique et Analyse, vol.15, pp.407-428, 1972.

G. Mints, The completeness of provable realizability., Notre Dame Journal of Formal Logic, vol.30, issue.3, pp.420-441, 1989.
DOI : 10.1305/ndjfl/1093635158

A. Miquel, The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping, In TLCA. (Lecture Notes in Computer Science), vol.2044, pp.344-359, 2001.
DOI : 10.1007/3-540-45413-6_27

F. Pfenning, Refinement types for logical frameworks, Types, pp.285-299, 1993.

C. Benjamin and . Pierce, Programming with intersection types, union types, and bounded polymorphism, 1991.

G. Pottinger, A Type Assignment for the Strongly Normalizable ?terms, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp.561-577, 1980.

C. John and . Reynolds, Preliminary Design of the Programming Language Forsythe, Report CMU?, pp.88-159, 1988.

V. Siles and H. Herbelin, Equality Is Typable in Semi-full Pure Type Systems, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.21-30, 2010.
DOI : 10.1109/LICS.2010.19

URL : https://hal.archives-ouvertes.fr/inria-00496988

C. Stolze, L. Liquori, F. Honsell, and I. Scagnetto, Towards a Logical Framework with Intersection and Union Types, Proceedings of the Workshop on Logical Frameworks and Meta-Languages: Theory and Practice , LFMTP '17, pp.1-9, 2017.
DOI : 10.1007/3-540-45927-8_9

URL : https://hal.archives-ouvertes.fr/hal-01534035

J. B. Wells and C. Haack, Branching Types, In ESOP (Lecture Notes in Computer Science), vol.2305, pp.115-132, 2002.
DOI : 10.1007/3-540-45927-8_9