Martín Abadi, Luca Cardelli, Benjamin C. Pierce, and Didier Rémy.
Dynamic typing in polymorphic languages.
Journal of Functional Programming, 5(1):111--130, January 1995.
Alexander Aiken and Edward L. Wimmers.
Type inclusion constraints and type inference.
In Conference on Functional Programming Languages and Computer
Architecture, pages 31--41. ACM press, 1993.
Davide Ancona and Elena Zucca.
A theory of mixin modules: Basic and derived operators.
Mathematical Structures in Computer Science, 8(4):401--446,
August 1998.
Davide Ancona and Elena Zucca.
A primitive calculus for module systems.
In Gopalan Nadathur, editor, PPDP'99 - International
Conference on Principles and Practice of Declarative Programming,
volume 1702 of Lecture Notes in Computer Science, pages 62--79.
Springer-Verlag, 1999.
Hans P. Barendregt.
The Lambda-Calulus. Its Syntax and Semantics, volume 103 of
Studies in Logic and The Foundations of Mathematics.
North-Holland, 1984.
Sylvain Boulmé, Thérèse Hardin, and Renaud Rioboo.
Modules, objets et calcul formel.
In Actes des Journées Francophones des Langages
Applicatifs. INRIA, 1999.
François Bourdoncle and Stephan Merz.
Type checking higher-order polymorphic multi-methods.
In Proceedings of the 24th ACM Conference on Principles of
Programming Languages, pages 302--315, July 1997.
Kim B. Bruce, Luca Cardelli, Giuseppe Castagna, the Hopkins Objects
Group (Jonathan Eifrig, Scott Smith, Valery Trifonov), Gary T. Leavens, and
Benjamin Pierce.
On binary methods.
Theory and Practice of Object Systems, 1(3):221--242, 1996.
Kim B. Bruce, Martin Odersky, and Philip Wadler.
A statically safe alternative to virtual types.
In European Conference on Object-Oriented Programming (ECOOP),
Brussels, July 1998.
Dominique Clément, Joëlle Despeyroux, Thierry Despeyroux, and
Gilles Kahn.
A simple applicative language: Mini-ML.
In proceedings of the conference Lisp and Functional
Programming, LFP'86. ACM Press, August 1986.
Also appears as INRIA Research Report RR-529, May 1986.
Luis Damas and Robin Milner.
Principal type-schemes for functional programs.
In symposium Principles of Programming Languages, pages
207--212. ACM Press, 1982.
Catherine Dubois, François Rouaix, and Pierre Weis.
Extensional polymorphism.
In Proceedings of the 22th ACM Conference on Principles of
Programming Languages, January 1995.
J. Eifrig, S. Smith, and V. Trifonov.
Type inference for recursively constrained types and its application
to OOP.
In Mathematical Foundations of Programming Semantics, 1995.
Kathleen Fisher and John Reppy.
The design of a class mechanism for Moby.
In Proceedings of the ACM SIGPLAN '99 Conference on Programming
Languages, design and Implementations, pages 37--49, Atlanta, May 1999. ACM
SIGPLAN, acm press.
Kathleen Fisher and John Reppy.
Extending Moby with inheritance-based subtyping.
In Proceedings of the 14th European Conference on
Object-Oriented Programming, 2000.
Jacques Garrigue and Didier Rémy.
Extending ML with semi-explicit higher-order polymorphism.
In International Symposium on Theoretical Aspects of Computer
Software, volume 1281 of Lecture Notes in Computer Science, pages
20--46. Springer, September 1997.
Thérèse Accart Hardin and Véronique Donzeau-Gouge Viguié.
Concepts et outils de programmation --- Le style fonctionnel, le
style impératif avec CAML et Ada.
Interéditions, 1992.
Robert Harper and Mark Lillibridge.
A type-theoretic approach to higher-order modules with sharing.
In symposium Principles of Programming Languages, pages
123--137. ACM Press, 1994.
J. Roger Hindley and Jonathan P. Seldin.
Introduction to Combinators and l-calculus.
Volume 1 of London Mathematical Society Student texts. Cambridge
University Press, 1986.
Lalita A. Jategaonkar and John C. Mitchell.
ML with extended pattern matching and subtypes (preliminary
version).
In Proceedings of the ACM Conference on Lisp and Functional
Programming, pages 198--211, Snowbird, Utah, July 1988.
Claude Kirchner and Jean-Pierre Jouannaud.
Solving equations in abstract algebras: a rule-based survey of
unification.
Research Report 561, Université de Paris Sud, Orsay, France, April
1990.
Konstantin Läufer and Martin Odersky.
Polymorphic type inference and abstract data types.
ACM Transactions on Programming Languages and Systems,
16(5):1411--1430, September 1994.
David B. MacQueen and Mads Tofte.
A semantics for higher-order functors.
In D. Sannella, editor, Programming languages and systems --
ESOP '94, volume 788 of Lecture Notes in Computer Science, pages
409--423. Springer-Verlag, 1994.
Martin Odersky and Konstantin Läufer.
Putting type annotations to work.
In Proceedings of the 23th ACM Conference on Principles of
Programming Languages, pages 54--67, January 1996.
Martin Odersky, Philip Wadler, and Martin Wehr.
A second look at overloading.
In Proc. ACM Conf. on Functional Programming and Computer
Architecture, pages 135--146, June 1995.
Benjamin C. Pierce and David N. Turner.
Local type inference.
In Proceedings of the 25th ACM Conference on Principles of
Programming Languages, 1998.
Full version available as Indiana University CSCI Technical Report
493.
Didier Rémy.
Extending ML type system with a sorted equational theory.
Research Report 1766, Institut National de Recherche en Informatique
et Automatisme, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France, 1992.
Didier Rémy.
Programming objects with ML-ART: An extension to ML with abstract
and record types.
In Masami Hagiya and John C. Mitchell, editors, International
Symposium on Theoretical Aspects of Computer Software, number 789 in Lecture
Notes in Computer Science, pages 321--346, Sendai, Japan, April 1994.
Springer-Verlag.
Didier Rémy.
Type inference for records in a natural extension of ML.
In Carl A. Gunter and John C. Mitchell, editors, Theoretical
Aspects Of Object-Oriented Programming. Types, Semantics and Language
Design. MIT Press, 1994.
Didier Rémy and Jérôme Vouillon.
Objective ML: An effective object-oriented extension to ML.
Theory And Practice of Object Systems, 4(1):27--50, 1998.
A preliminary version appeared in the proceedings of the 24th ACM
Conference on Principles of Programming Languages, 1997.
Jérôme Vouillon.
Combining subsumption and binary methods: An object calculus with
views.
In symposium Principles of Programming Languages. ACM Press,
2000.
Mitchell Wand.
Complete type inference for simple objects.
In D. Gries, editor, Second Symposium on Logic In Computer
Science, pages 207--276, Ithaca, New York, June 1987. IEEE Computer
Society Press.
