What are principal typings and what are they good for?

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Shail Aditya , Rishiyur S. Nikhil, Incremental polymorphism, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.379-405, June 1991, Cambridge, Massachusetts, United States
	2	Alexander Aiken , Edward L. Wimmers, Type inclusion constraints and type inference, Proceedings of the conference on Functional programming languages and computer architecture, p.31-41, June 09-11, 1993, Copenhagen, Denmark [doi>10.1145/165180.165188]
	3	Roberto M. Amadio , Luca Cardelli, Subtyping recursive types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.4, p.575-631, Sept. 1993 [doi>10.1145/155183.155231]
	4	Henk Barendregt, Mario Coppo, and Mariangiola Dezani-Ciancaghni. A filter lambda model and the completeness of type assignment. J. Symbohc Logic, 48(4):931-940, December 1983.
	5	Felice Cardone , Mario Coppo, Type inference with recursive types: syntax and semantics, Information and Computation, v.92 n.1, p.48-80, May 1991 [doi>10.1016/0890-5401(91)90020-3]
	6	Luis Manuel Martins Damas. Type Asszgnment 'm Programmmg Languages. PhD thesis, University of Edinburgh, 1984.
	7	J. Eifrig, S. Smith, and V. Trifonov. Type inference for recursively constrained types and it application to OOP. In Proc. Mathematzcal Foundations of Programmzng Semantics, 1995. To appear.
	8	S. A. Gupta, AN INCREMENTAL TYPE INFERENCE SYSTEM FOR THE PROGRAMMING LANGUAGE ID, Massachusetts Institute of Technology, Cambridge, MA, 1990
	9	Fritz Henglein, Type inference with polymorphic recursion, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.2, p.253-289, April 1993 [doi>10.1145/169701.169692]
	10	M. R. Henzinger , V. King, Fully dynamic biconnectivity and transitive closure, Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), p.664, October 23-25, 1995
	11	T. Jim, Rank 2 Type Systems and Recursive Definitions, Massachusetts Institute of Technology, Cambridge, MA, 1995
	12	Mark P. Jones, Qualified types: theory and practice, Cambridge University Press, New York, NY, 1995
	13	jean-Pierre Jouannaud and Claude Kirchner Solving equations in abstract algebras: A rule-based survey of unification. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logzc: Essays zn Honor of Alan Robznson, chapter 8, pages 257-321. MIT Press, 1991.
	14	Stefan Kaes, Type inference in the presence of overloading, subtyping and recursive types, Proceedings of the 1992 ACM conference on LISP and functional programming, p.193-204, June 22-24, 1992, San Francisco, California, United States
	15	A. J. Kfoury , J. Tiuryn, Type reconstruction in finite rank fragments of the second-order &lgr;-calculus, Information and Computation, v.98 n.2, p.228-257, June 1992 [doi>10.1016/0890-5401(92)90020-G]
	16	A. J. Kfoury , J. Tiuryn , P. Urzyczyn, A proper extension of ML with an effective type-assignment, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.58-69, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73565]
	17	A. J. Kfoury , J. Tiuryn , P. Urzyczyn, Type reconstruction in the presence of polymorphic recursion, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.2, p.290-311, April 1993 [doi>10.1145/169701.169687]
	18	A. J. Kfoury , J. Tiuryn , P. Urzyczyn, An analysis of ML typability, Journal of the ACM (JACM), v.41 n.2, p.368-398, March 1994 [doi>10.1145/174652.174659]
	19	A. J. Kfoury , J. B. Wells, A direct algorithm for type inference in the rank-2 fragment of the second-order &lgr;-calculus, Proceedings of the 1994 ACM conference on LISP and functional programming, p.196-207, June 27-29, 1994, Orlando, Florida, United States
	20	John Launchbury , Simon L. Peyton Jones, Lazy functional state threads, Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, p.24-35, June 20-24, 1994, Orlando, Florida, United States
	21	Daniel Leivant, Polymorphic type inference, Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.88-98, January 24-26, 1983, Austin, Texas [doi>10.1145/567067.567077]
	22	Harry G. Mairson, Deciding ML typability is complete for deterministic exponential time, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.382-401, December 1989, San Francisco, California, United States [doi>10.1145/96709.96748]
	23	Alberto Marchetti-Spaccamela , Umberto Nanni , Hans Rohnert, On-line Graph Algorithms for Incremental Compilation, Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, p.70-86, June 16-18, 1993
	24	Nancy McCracken, The typechecking of programs with implicit type structure., Proc. of the international symposium on Semantics of data types, p.301-315, July 1984, Sophia-Antipolis, France
	25	John Mitchell. Type inference with simple subtypes. J. Functional Programming, 1(3):245-285, July 1991.
	26	Alan Mycroft, Polymorphic Type Schemes and Recursive Definitions, Proceedings of the 6th Colloquium on International Symposium on Programming, p.217-228, April 17-19, 1984
	27	Zhong Shao , Andrew W. Appel, Smartest recompilation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.439-450, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158702]
	28	Geoffrey S. Smith, Principal type schemes for functional programs with overloading and subtyping, Science of Computer Programming, v.23 n.2-3, p.197-226, Dec. 1994
	29	Steffen van Bakel. Intersection Type D#sczphnes #n Lambda Calculus and Apphcatwe Term Rewriting Systems. PhD thesis, Mathematlsch Centrum, Amsterdam, February 1993.
	30	Mitchell Wand. A rumple algorithm and proof for type inference. Fundamenta }nfomat#cae, 10:115-122, 1987.
	31	Hirofumi Yokouchi, Embedding a second-order type system into an intersection type system, Information and Computation, v.117 n.2, p.206-220, March 1995 [doi>10.1006/inco.1995.1040]