R. Amadio and L. Cardelli, Subtyping recursive types, ACM Transactions on Programming Languages and Systems, vol.15, issue.4, pp.575-631, 1993.
DOI : 10.1145/155183.155231

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

L. Cardelli, S. Martini, J. C. Mitchell, and A. Scedrov, An Extension of System F with Subtyping, Information and Computation, vol.109, issue.1-2, pp.4-56, 1994.
DOI : 10.1006/inco.1994.1013

C. S. Coen and E. Tassi, Nonuniform Coercions via Unification Hints, Electronic Proceedings in Theoretical Computer Science, vol.53, pp.16-29, 2009.
DOI : 10.4204/EPTCS.53.2

K. Crary, Typed compilation of inclusive subtyping, Proceedings of the International Conference on Functional Programming, 2000.

J. Cretin, Erasable coercions: a unified approach to type systems, 2014.
URL : https://hal.archives-ouvertes.fr/tel-00940511

J. Cretin and D. Rémy, On the power of coercion abstraction, Proceedings of the annual symposium on Principles Of Programming Languages, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00582570

J. Cretin and D. Rémy, System F with coercion constraints, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, 2014.
DOI : 10.1145/2603088.2603128

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

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

J. C. Mitchell, Polymorphic type inference and containment. Information and Computation, pp.890-540190009, 1988.
DOI : 10.1016/0890-5401(88)90009-0

URL : http://doi.org/10.1016/0890-5401(88)90009-0

M. Odersky, M. Sulzmann, and M. Wehr, Type inference with constrained types, Theory and Practice of Object Systems, vol.X, issue.1, pp.35-55, 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=10.1.1.40.1443

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

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

J. C. Vanderwaart, D. Dreyer, L. Petersen, K. Crary, R. Harper et al., Typed compilation of recursive datatypes, Workshop on Types in Language Design and Implementation (TLDI), 2003.

S. Weirich, D. Vytiniotis, S. P. Jones, and S. Zdancewic, Generative type abstraction and type-level computation, Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, 2011.
DOI : 10.1145/1925844.1926411

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

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