M. Roberto, . Amadio, and C. Luca, Subtyping recursive types, ACM Transactions on Programming Languages and Systems, vol.15, issue.4, pp.575-631, 1993.

H. Pieter, B. Kim, B. Bruce, C. Luca, C. Giuseppe et al., de Studies in Logic and the Foundations of Mathematics PIERCE : On binary methods Cduce : an xml-centric general-purpose language, The Lambda Calculus ? Its Syntax and SemanticsBCC + 95] Proceedings of the eighth ACM SIGPLAN international conference on Functional programming, pp.221-242, 1984.

G. Berry-françois, B. Stephan, M. François, B. Stephan, and M. , Stable models of typed ??-calculi, Conference Record of the 24th Annual ACM Symposium on Principles of Programming Languages, pp.72-89, 1978.
DOI : 10.1007/3-540-08860-1_7

B. Daniel, Type-checking multi-methods in ML (a modular approach) Dans The Ninth International Workshop on Foundations of Object-Oriented Languages, 2002.

B. Daniel, B. François, V. Jean, and B. Gérard, Using kinds to type partially polymorphic multi-methods, Workshop on Types in Programming The 2z reference manual, 1994.

C. Giuseppe, Object-Oriented Programming : A Unified Foundation, Progress in Theoretical Computer Science Series. Birkäuser, 1997.

C. Giuseppe, G. Giorgio, and L. Giuseppe, A calculus for overloaded functions with subtyping, Proceedings of the ACM Conference on Lisp and Functional Programming, pp.182-192, 1992.

C. Craig, T. Gary, and . Leavens, Typechecking and modules for multimethods, ACM Transactions on Programming Languages and Systems, vol.17, issue.6, pp.805-843, 1995.

T. Coquand, C. Paulin-craig, C. , and T. Cecil, Inductively defined types The cecil language : Specification & rationale , version 3, Proceedings of the international conference on Computer logic, pp.50-66, 1990.

F. Alexandre, B. Gérard, B. Patrice, B. François, V. H. Jean et al., The jazz home page You-Chin FUH et Prateek MISHRA : Type inference with subtypes [FM89] You-Chin FUH et Prateek MISHRA : Polymorphic subtype inference : Closing the theory-practice gap, Proceedings of the European Symposium on Programming DÍAZ et F. OREJAS, éditeurs : Proceedings of the International Joint Conference on Theory and Practice of Software Development, pp.94-114, 1988.

F. Alexandre, Satisfying subtype inequalities in polynomial space, Pascal Van HENTENRYCK, éditeur : Proceedings of the Forth International Symposium on Static Analysis (SAS'97), numéro 1302 dans Lecture Notes in Computer Science, pp.265-277, 1997.

G. James, J. Bill, S. Guy, and B. Gilad, The Java Language Specification Second Edition, 2000.

J. R. Hindley, The Principal Type-Scheme of an Object in Combinatory Logic, Transactions of the American Mathematical Society, vol.146, pp.29-60, 1969.
DOI : 10.2307/1995158

K. Viktor, R. J. Martin, J. Kfoury, and . Tiuryn, On the theory of structural subtyping Rapport technique 879 URZYCZYN : Type reconstruction in the presence of polymorphic recursion, ACM Transactions on Programming Languages and Systems, vol.15, issue.2, pp.290-311, 1993.

L. Xavier, D. Damien, G. Jacques, R. Didier, and V. Jérôme, The Objective Caml system, 2003.

L. Vassily, Contraint-based polymorphism in cecil : towards a practical and static type system, Proceedings of the 13th ACM SIGPLAN conference on Objectoriented programming, systems, languages, and applications, pp.388-411, 1998.

M. Luc, Two techniques for compiling lazy pattern matching Rapport technique 2385, INRIA, Mey92] Bertrand MEYER : Eiffel : the language, 1992.

M. Robin, A theory of type polymorphism in programming, Mit84] J. MITCHELL : Coercion and type inference (summary). Dans Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, pp.348-375, 1978.

M. Robin, T. Mads, H. Robert, and M. David, The Definition of Standard ML (Revised) [Pae93] Andreas PAEPCKE, éditeur. Object-Oriented Programming : The CLOS Perspective, 1993.

P. Jens, [Pot98] Francois POTTIER : Synthèse de types en présence de sous-typage : de la théorie à la pratique VII, juillet 1998. [Pot01] François POTTIER : A semi-syntactic soundness proof for HM(X ), Thèse de doctorat, pp.198-209, 1995.

R. Didier, Programming objects with ML-ART : An extension to ML with abstract and record types, International Symposium on Theoretical Aspects of Computer Software (TACS), pp.321-346, 1994.

S. Andrew, The Dylan reference manual : the definitive guide to the new objectoriented dynamic language, 1996.

S. Vincent, Type inference with structural subtyping : A faithful formalization of an efficient constraint solver, Atsushi OHORI, éditeur : Proceedings of the Asian Symposium on Programming Languages and Systems (APLAS'03), p.2895

S. Martin, O. Martin, and W. Martin, Type inference with constrained types, 1996.

S. Vincent and P. François, Constraint-based type inference for guarded algebraic data types, 2003.

L. Guy and . Steele-jr, Common Lisp : The Language (second edition) Digital Press [Str67] Christopher STRACHEY : Fundamental Concepts in Programming Languages [Str91] B. STROUSTRUP : The C++ Programming Language First print of an unpublished manuscript written 1967, Lecture Notes for International Summer School in Computer Programming. CopenhagueStr00] Christopher STRACHEY : Fundamental concepts in programming languages. Higher- Order and Symbolic Computation, pp.11-49, 1967.

T. Jerzy, Subtype inequalities, Proceedings, Seventh Annual IEEE Symposium on Logic in Computer Science, pp.308-315

T. Valery and S. Scott, Subtyping constrained types, Static Analysis Symposium (SAS), volume 1145 de Lecture Notes in Computer Science, pp.349-365, 1996.

E. Jean and . Vuillemin, On circuits and numbers, IEEE Transactions on Computers, vol.43, issue.8, pp.868-879, 1994.

S. [. Wadler and . Blott, How to make ad-hoc polymorphism less ad hoc, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, pp.60-76, 1989.
DOI : 10.1145/75277.75283

W. Lyndon and M. Greg, An implementation of parallel pattern-matching via concurrent haskell, OUDSHOORN, éditeur : Twenty-Fifth Australasian Computer Science Conference (ACSC2002), 2002.