Polymorphic type inference and assignment

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Polymorphic type inference and assignment

Full text

Pdf (1.16 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

Orlando, Florida, United States

Pages: 291 - 302

Year of Publication: 1991

ISBN:0-89791-419-8

Authors

Xavier Leroy	Ecole Normale Supérieure, B.P.105, 78153 Le Chesnay, France
Pierre Weis	INRIA Rocquencourt, B.P.105, 78153 Le Chesnay, France

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 23, Citation Count: 10

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/99583.99622 What is a DOI?

REFERENCES

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	A. W. Appei and D. B. MacQueen. Standard ML reference manual (preliminary). AT&T Bell Laboratories, 1989.
	2	L. Cardelli. TypefuI programming. Research report 45~ DEC Systems Research Center, 1989.
	3	G. Cousineau and G. ttuet. The CAML primer. Technical report 122, INRIA, 1990.
	4	L. Damas. Type assignment in programming languages. PhD thesis, University of Edinburgh, 1985.
	5	Luis Damas , Robin Milner, Principal type-schemes for functional programs, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.207-212, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582176]
	6	You-Chin Fuh , Prateek Mishra, Type Inference with Subtypes, Proceedings of the 2nd European Symposium on Programming, p.94-114, March 21-24, 1988
	7	J.-Y. Girard. Interprdtation fonctionnelle et ~- limination des coupures de l'arithmgtique d'ordre sup~rieur. Th~se d'Etat, Universit~ Paris VII, 1972.
	8	M. J. Gordon, A. J. Milner, and C. P. Wadsworth. Edinburgh L CF, volume 78 of Lecture Notes in Computer Science. Springer-Verlag, 1979.
	9	J. M. Lucassen , D. K. Gifford, Polymorphic effect systems, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.47-57, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73564]
	10	R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes" part 1. Research report ECS- LFCS-89-85, University of Edinburgh, 1989.
	11	Robin Milner , Mads Tofte , Robert Harper, The definition of Standard ML, MIT Press, Cambridge, MA, 1990
	12	John C. Mitchell, Coercion and type inference, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.175-185, January 15-18, 1984, Salt Lake City, Utah, United States [doi>10.1145/800017.800529]
	13	John H. Reppy, First-Class Synchronous Operations in Standard ML, Cornell University, Ithaca, NY, 1989
	14	John C. Reynolds, Towards a theory of type structure, Programming Symposium, Proceedings Colloque sur la Programmation, p.408-423, April 09-11, 1974
	15	G. Smolka. FRESH: a higher-order language with unification and multiple results. In Logic Programming: Functions, Relations, and Equations. Prentice-Hall, 1986.
	16	M. Torte. Operational semantics and polymorphic type inference. PhD thesis, University of Edinburgh, 1987.
	17	Mads Tofte, Type inference for polymorphic references, Information and Computation, v.89 n.1, p.1-34, Nov. 1990 [doi>10.1016/0890-5401(90)90018-D]

CITED BY 10

	Xavier Leroy, Polymorphism by name for references and continuations, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.220-231, March 1993, Charleston, South Carolina, United States
	Fritz Henglein, Global tagging optimization by type inference, ACM SIGPLAN Lisp Pointers, v.V n.1, p.205-215, Jan. 1992
	Robert Harper , Mark Lillibridge, Explicit polymorphism and CPS conversion, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.206-219, March 1993, Charleston, South Carolina, United States
	Peter Buneman , Atsushi Ohori, Polymorphism and type inference in database programming, ACM Transactions on Database Systems (TODS), v.21 n.1, p.30-76, March 1996
	Andrew K. Wright , Robert Cartwright, A practical soft type system for scheme, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.1, p.87-152, Jan. 1997
	Michel Mauny , Daniel de Rauglaudre, Parsers in ML, ACM SIGPLAN Lisp Pointers, v.V n.1, p.76-85, Jan. 1992
	Iliano Cervesato , Frank Pfenning, A linear logical framework, Information and Computation, v.179 n.1, p.19-75, November 25, 2002
	Geoffrey Smith , Dennis Volpano, Polymorphic typing of variables and references, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.3, p.254-267, May 1996
	George Kuan , David MacQueen, Efficient type inference using ranked type variables, Proceedings of the 2007 workshop on Workshop on ML, October 05-05, 2007, Freiburg, Germany
	Kohei Honda , Nobuko Yoshida, A uniform type structure for secure information flow, ACM Transactions on Programming Languages and Systems (TOPLAS), v.29 n.6, p.31-es, October 2007