First-class polymorphism with type inference

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

First-class polymorphism with type inference

Full text

Pdf (1.31 MB)

Source

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

Paris, France

Pages: 483 - 496

Year of Publication: 1997

ISBN:0-89791-853-3

Author

Mark P. Jones

Department of Computer Science, University of Nottingham, University Park, Nottingham NG7 2RD, England

Sponsors

L'Ecole des Mines de Paris : L'Ecole des Mines de Paris
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Ctr Natl de la Recherche Sci :
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

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

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/263699.263765 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	H..J. Boehm. Partial polymorphic type inference is undeeidable. In #6th Annual Symposium on Foundations of Computer Science, pages 339-345. IEEE, October 1985.
	2	L. Duponeheel and E. Meijer. On the expressive power of constructor classes. In Proceedings of the 199# Glasgow Functional Programming Workshop, Ayr, September 1994.
	3	Andrew Gill , John Launchbury , Simon L. Peyton Jones, A short cut to deforestation, Proceedings of the conference on Functional programming languages and computer architecture, p.223-232, June 09-11, 1993, Copenhagen, Denmark [doi>10.1145/165180.165214]
	4	J.-Y. Girard. Une extension de l'interpr#tation de G#Sdel # l'analyse et son application # l'#limination des coupures dans l'analyse et la th#orie de types. In Fenstad, editor, Proceedings of the Scandanavian logic symposium. North Holland, 1971.
	5	Cordelia V. Hall , Kevin Hammond , Will Partain , Simon L. Peyton Jones , Philip Wadler, The Glasgow Haskell Compiler: A Retrospective, Proceedings of the 1992 Glasgow Workshop on Functional Programming, p.62-71, July 06-08, 1992
	6	It. ttindley. The principal type-scheme of an object in eombinatory logic. Transactions of the American Mathematical Society, 146:29-60, December 1969.
	7	W. Howard. The formulas-as-types notion of construetion. In To H.B. Curry: Essays on Combinatory Logic, Lambda.Calculus and Formalism, pages 479-490. Academic Press, 1980.
	8	Paul Hudak , Simon Peyton Jones , Philip Wadler , Brian Boutel , Jon Fairbairn , Joseph Fasel , María M. Guzmán , Kevin Hammond , John Hughes , Thomas Johnsson , Dick Kieburtz , Rishiyur Nikhil , Will Partain , John Peterson, Report on the programming language Haskell: a non-strict, purely functional language version 1.2, ACM SIGPLAN Notices, v.27 n.5, p.1-164, May 1992 [doi>10.1145/130697.130699]
	9	P. Hudak and P. Wadler (editors). Report on the Programming Language Haskell, A Non-strict Purely Functional Language (Version 1.0). Technical report, University of Glasgow, April 1990.
	10	M. P. Jones. The implementation of the Gofer functional programming system. Research Report YALEU/DCS/RR-1030, Yale University, New Haven, Connecticut, USA, May 1994.
	11	M. P. Jones. A system of constructor classes" overloading and implicit higher-order polymorphism. Journal of Functional Programming, 5(1), January 1995 .... #
	12	M. P. Jones. Hugs 1.3 user manual. Technical Report NOTTCS-TR-96;2, Department of Computer Science, University of Nottingham, August 1996.
	13	Stefan Kaes, Parametric Overloading in Polymorphic Programming Languages, Proceedings of the 2nd European Symposium on Programming, p.131-144, March 21-24, 1988
	14	K. L#iufer. Polymorphic Type Inference and Abstract Data Types. PhD thesis, New York University, July 1992.
	15	K. L#iufer. Type classes with existential types. Journal of Functional Programming, 6(3):485-517, May 1996,
	16	Konstantin Läfer , Martin Odersky, Polymorphic type inference and abstract data types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.5, p.1411-1430, Sept. 1994 [doi>10.1145/186025.186031]
	17	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
	18	Sheng Liang , Paul Hudak , Mark Jones, Monad transformers and modular interpreters, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.333-343, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199528]
	19	R. Milner, A theory of type polymorphism in programming. Journal of Comput;er and-System Sci. ences, 17(3), 1978.
	20	Robin Milner , Mads Tofte , Robert Harper, The definition of Standard ML, MIT Press, Cambridge, MA, 1990
	21	John C. Mitchell , Gordon D. Plotkin, Abstract types have existential type, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.3, p.470-502, July 1988 [doi>10.1145/44501.45065]
	22	Martin Odersky , Konstantin Läufer, Putting type annotations to work, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.54-67, January 21-24, 1996, St. Petersburg Beach, Florida, United States [doi>10.1145/237721.237729]
	23	N. Perry. The implementation #:of practical func. tional programming languages. PhD thesis, Impe- #rial College, 1991.
	24	J. Peterson and K. Hammond (editors)., Report on the Programming Language Haskell, A Nonstrict Purely Functional Language (Version 1.0). Research Report YALEU/DCS/RR-1106, Department of Computer Science, Yale University, May 1996.
	25	Simon L. Peyton Jones, The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science), Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	26	Frank Pfenning, On the undecidability of partial polymorphic type reconstruction, Fundamenta Informaticae, v.19 n.1-2, p.185-199, Sept./Oct. 1993
	27	B' C. Pierce and D. N. Turner. Simple typetheoretic foundations for object-oriented programming. Journal of Functional Programming, 4(2):207-247, April 1994. : .....
	28	Didier Rémy, Programming Objects with ML-ART, an Extension to ML with Abstract and Record Types, Proceedings of the International Conference on Theoretical Aspects of Computer Software, p.321-346, April 19-22, 1994
	29	John C. Reynolds, Towards a theory of type structure, Programming Symposium, Proceedings Colloque sur la Programmation, p.408-423, April 09-11, 1974
	30	J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM (JACM), v.12 n.1, p.23-41, Jan. 1965 [doi>10.1145/321250.321253]
	31	Guy L. Steele, Jr., Building interpreters by composing monads, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.472-492, January 16-19, 1994, Portland, Oregon, United States [doi>10.1145/174675.178068]
	32	Philip Wadler, The essence of functional programming, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-14, January 19-22, 1992, Albuquerque, New Mexico, United States [doi>10.1145/143165.143169]
	33	P. Wadler , S. Blott, How to make ad-hoc polymorphism less ad hoc, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.60-76, January 11-13, 1989, Austin, Texas, United States [doi>10.1145/75277.75283]
	34	J. B. Wells. Typability and type checking in the second-order ,#-calculus are equivalent and undeeidable, in Ninth Annual IEEE Symposium on Logic in Computer Science, p agesl 176-185, Paris, France, July 1994.

CITED BY 12

	Martin Odersky , Christoph Zenger , Matthias Zenger, Colored local type inference, ACM SIGPLAN Notices, v.36 n.3, p.41-53, March 2001
	Zhe Yang, Encoding types in ML-like languages, ACM SIGPLAN Notices, v.34 n.1, p.289-300, Jan. 1999
	Johan Nordlander, Pragmatic subtyping in polymorphic languages, ACM SIGPLAN Notices, v.34 n.1, p.216-227, Jan. 1999
	Matthias Neubauer , Peter Thiemann , Martin Gasbichler , Michael Sperber, Functional logic overloading, ACM SIGPLAN Notices, v.37 n.1, p.233-244, Jan. 2002
	Levent Erkök , John Launchbury, A recursive do for Haskell, Proceedings of the 2002 ACM SIGPLAN workshop on Haskell, p.29-37, October 03, 2002, Pittsburgh, Pennsylvania
	Jose Emilio Labra Gayo , Juan Manuel Cueva Lovelle , Maria Cándida Luengo Díez , Agustín Cernuda del Río, Modular development of interpreters from semantic building blocks, Nordic Journal of Computing, v.8 n.3, p.391-407, Fall 2001
	Chung-chieh Shan, Sexy types in action, ACM SIGPLAN Notices, v.39 n.5, May 2004
	Zhe Yang, Encoding types in ML-like languages, Theoretical Computer Science, v.315 n.1, p.151-190, 5 May 2004
	Dimitrios Vytiniotis , Stephanie Weirich , Simon Peyton Jones, Boxy types: inference for higher-rank types and impredicativity, ACM SIGPLAN Notices, v.41 n.9, September 2006
	Daan Leijen, Flexible types: robust type inference for first-class polymorphism, Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, January 21-23, 2009, Savannah, GA, USA
	Daan Leijen, A type directed translation of MLF to system F, ACM SIGPLAN Notices, v.42 n.9, September 2007
	Daan Leijen, HMF: simple type inference for first-class polymorphism, ACM SIGPLAN Notices, v.43 n.9, September 2008