A. Abel and G. Scherer, On Irrelevance and Algorithmic Equality in Predicative Type Theory, Logical Methods in Computer Science, vol.8, issue.1, p.136
DOI : 10.2168/LMCS-8(1:29)2012

B. Accattoli and D. Kesner, The structural lambda-calculus, Lecture Notes in Computer Science, vol.6247, p.381395, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00528228

R. Amadio and L. Cardelli, Subtyping recursive types, ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, vol.15, issue.4, p.575631, 1993.
URL : https://hal.archives-ouvertes.fr/inria-00070035

W. Andrew, D. Appel, and . Mcallester, An indexed model of recursive types for foundational proof-carrying code, ACM Transactions on Programming Languages and Systems, vol.23, issue.5, 2001.

P. Baldan, G. Ghelli, and A. Raaetà, Basic theory of F-bounded quantication, Inf. Comput, vol.153, p.173237, 1999.

B. Barras and B. Bernardo, The Implicit Calculus of Constructions as a Programming Language with Dependent Types, Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures, FOSSACS'08/ETAPS'08, p.365379, 2008.
DOI : 10.1007/978-3-540-78499-9_26

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

G. Barthe, Implicit coercions in type systems, Types for Proofs and Programs, p.115, 1996.
DOI : 10.1007/3-540-61780-9_58

T. Blanc, J. Lévy, and L. Maranget, Sharing in the weak lambdacalculus, Processes, Terms and Cycles: Steps on the Road to Innity, p.7087, 2005.

V. Breazu-tannen, T. Coquand, C. Gunter, and A. Scedrov, Inheritance as implicit coercion, Information and Computation, vol.93, issue.1, p.172221, 1991.
DOI : 10.1016/0890-5401(91)90055-7

URL : http://doi.org/10.1016/0890-5401(91)90055-7

L. Colson and V. Demange, Investigations on a pedagogical calculus of constructions . CoRR, abs/1203, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00678784

K. Crary, Typed compilation of inclusive subtyping, Proceedings of the fth ACM SIGPLAN international conference on Functional programming (ICFP), p.6881, 2000.

J. Cretin and D. Rémy, On the power of coercion abstraction, Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL '12, p.361372
URL : https://hal.archives-ouvertes.fr/inria-00582570

K. Donnelly and H. Xi, A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F, Electronic Notes in Theoretical Computer Science, vol.174, issue.5
DOI : 10.1016/j.entcs.2007.01.021

D. Dreyer, A. Ahmed, and L. Birkedal, Logical step-indexed logical relations, Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science, LICS '09, p.7180, 2009.
DOI : 10.2168/lmcs-7(2:16)2011

URL : http://arxiv.org/abs/1103.0510

H. Jean, J. H. Gallier, and . Gallier, On Girard's candidats de réductibilité, Logic and Computer Science. North, 1990.

D. Le-botlan and D. Rémy, Mlf: raising ml to the power of system f, Proceedings of the eighth ACM SIGPLAN international conference on Functional programming, ICFP '03, p.2738, 2003.

Y. Luo and Z. Luo, Combining incoherent coercions for sigma-types, Lecture Notes in Computer Science, vol.3085, p.276292, 2003.
DOI : 10.1007/978-3-540-24849-1_18

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

Z. Luo, S. Soloviev, and T. Xue, Coercive subtyping: Theory and implementation, Information and Computation, vol.223, p.1842, 2013.
DOI : 10.1016/j.ic.2012.10.020

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

J. Lévy and L. Maranget, Explicit Substitutions and Programming Languages, Foundations of Software Technology and Theoretical Computer Science, p.181200, 1999.
DOI : 10.1007/3-540-46691-6_14

R. Matthes, Monotone xed-point types and strong normalization, Proceedings of the 12th International Workshop on Computer Science Logic, p.298312, 1999.
DOI : 10.1007/10703163_20

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. Miquel, The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping, Proceedings of the 5th international conference on Typed lambda calculi and applications, TLCA'01, p.344359, 2001.
DOI : 10.1007/3-540-45413-6_27

C. John and . Mitchell, Polymorphic type inference and containment. Information and Computation, p.211249, 1988.

M. Odersky, M. Sulzmann, and M. Wehr, Type inference with constrained types, Theory and Practice of Object Systems, vol.X, issue.1, p.3555, 1999.
DOI : 10.1002/(SICI)1096-9942(199901/03)5:1<35::AID-TAPO4>3.0.CO;2-4

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Palsberg, O. Patrick, and . Keefe, A type system equivalent to ow analysis, ACM Trans. Program. Lang. Syst, vol.17, issue.4, p.576599, 1995.

C. Benjamin and . Pierce, Types and programming languages, 2002.

C. Benjamin and . Pierce, Advanced Topics in Types and Programming Languages, 2004.

F. Pottier, Simplifying subtyping constraints, Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, p.122133, 1996.
DOI : 10.1145/232627.232642

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

D. Rémy and B. Yakobowski, A church-style intermediate language for MLF, Functional and Logic Programming, p.2439, 2010.
DOI : 10.1016/j.tcs.2012.02.026

C. Riba, On the Stability by Union of Reducibility Candidates, Proceedings of the 10th international conference on Foundations of software science and computational structures, FOSSACS'07, p.317331, 2007.
DOI : 10.1007/978-3-540-71389-0_23

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

M. Steen, Polarized higher-order subtyping, 1997.

N. Swamy, N. Guts, D. Leijen, and M. Hicks, Lightweight monadic programming in ML, Proceedings of the 16th ACM SIGPLAN international conference on Functional programming, p.1527, 2011.

N. Swamy, M. Hicks, and G. M. Bierman, A theory of typed coercions and its applications, Proceedings of the 14th ACM SIGPLAN international conference on Functional programming, ICFP '09, p.329340, 2009.

D. Vytiniotis and S. L. Jones, Evidence normalization in system fc (invited talk), LIPIcs, vol.21, p.2038

S. Weirich, J. Hsu, and R. A. Eisenberg, System fc with explicit kind equality, Proceedings of the 18th ACM SIGPLAN international conference on Functional programming, ICFP '13, p.275286, 2013.

J. B. Wells and C. Haack, Branching Types, Proc. of the European Symposium On Programming Languages and Systems, 2002.
DOI : 10.1007/3-540-45927-8_9

A. Brent, S. Yorgey, J. Weirich, S. P. Cretin, D. Jones et al., Giving Haskell a promotion, Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation, TLDI '12, p.5366, 2012.