J. Cretin and D. Rémy, On the power of coercion abstraction, Principles of Programming Languages (POPL), pp.361-372, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00582570

L. Damas and R. Milner, Principal type-schemes for functional programs, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '82, pp.207-212, 1982.
DOI : 10.1145/582153.582176

J. Garrigue, Relaxing the Value Restriction, Functional and Logic Programming, pp.196-213, 2004.
DOI : 10.1007/978-3-540-24754-8_15

J. Garrigue and D. Rémy, Semi-Explicit First-Class Polymorphism for ML, Information and Computation, vol.155, issue.1-2, pp.134-169, 1999.
DOI : 10.1006/inco.1999.2830

J. Garrigue and D. Rémy, Ambivalent Types for Principal Type Inference with GADTs, Asian Symposium on Programming Languages and Systems (APLAS), 2013.
DOI : 10.1007/978-3-319-03542-0_19

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

A. Gundry, Type Inference, Haskell and Dependent Types, 2013.

J. Gustavsson and J. Svenningsson, Constraint Abstractions, Symposium on Programs as Data Objects, 2001.
DOI : 10.1007/3-540-44978-7_5

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

J. and R. Hindley, The principal type-scheme of an object in combinatory logic. Transactions of the, pp.29-60, 1969.

G. Huet, Résolution d'équations dans des langages d'ordre 1, 1976.

J. Hughes, Generalising monads to arrows, Science of Computer Programming, vol.37, issue.1-3, pp.67-111, 2000.
DOI : 10.1016/S0167-6423(99)00023-4

G. Kuan and D. Macqueen, Efficient type inference using ranked type variables, Proceedings of the 2007 workshop on Workshop on ML , ML '07, pp.3-14, 2007.
DOI : 10.1145/1292535.1292538

D. Mcallester, A Logical Algorithm for ML Type Inference, Rewriting Techniques and Applications (RTA), volume 2706 of Lecture Notes in Computer Science, pp.436-451, 2003.
DOI : 10.1007/3-540-44881-0_31

C. Mcbride and R. Paterson, Applicative programming with effects, Journal of Functional Programming, vol.18, issue.01, pp.1-13, 2008.
DOI : 10.1017/S0956796800003658

D. Miller, Unification under a mixed prefix, Journal of Symbolic Computation, vol.14, issue.4, pp.321-358, 1992.
DOI : 10.1016/0747-7171(92)90011-R

R. Milner, A theory of type polymorphism in programming, Journal of Computer and System Sciences, vol.17, issue.3, pp.348-375, 1978.
DOI : 10.1016/0022-0000(78)90014-4

D. Simon-peyton-jones, S. Vytiniotis, M. Weirich, and . Shields, Practical type inference for arbitrary-rank types, Journal of Functional Programming, vol.17, issue.01, pp.1-82, 2007.
DOI : 10.1017/S0956796806006034

F. Pottier, Inferno: a library for Hindley-Milner type inference and elaboration, 2014.

F. Pottier and D. Rémy, The essence of ML type inference. Draft of an extended version. Unpublished, 2003.

F. Pottier and D. Rémy, The essence of ML type inference, Advanced Topics in Types and Programming Languages, pp.389-489, 2005.

D. Rémy, Extending ML type system with a sorted equational theory, 1992.

D. Rémy and B. Yakobowski, A church-style intermediate language for MLF, Theoretical Computer Science, vol.435, issue.1, pp.77-105, 2012.
DOI : 10.1016/j.tcs.2012.02.026

S. , D. Swierstra, and L. Duponcheel, Deterministic, errorcorrecting combinator parsers, Advanced Functional Programming, pp.184-207, 1996.

. Robert-endre-tarjan, Efficiency of a Good But Not Linear Set Union Algorithm, Journal of the ACM, vol.22, issue.2, pp.215-225, 1975.
DOI : 10.1145/321879.321884

D. Vytiniotis, S. L. Jones, T. Schrijvers, and M. Sulzmann, OutsideIn(X) Modular type inference with local assumptions, Journal of Functional Programming, vol.21, issue.4-5, pp.4-5333, 2011.
DOI : 10.1016/0890-5401(90)90018-D

M. Wand, A simple algorithm and proof for type inference, Fundamenta Informaticae, vol.10, pp.115-122, 1987.