Type checking records and variants in a natural extension of ML

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Type checking records and variants in a natural extension of ML

Full text

Pdf (948 KB)

Source

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

Austin, Texas, United States

Pages: 77 - 88

Year of Publication: 1989

ISBN:0-89791-294-2

Author

D. Rémy

INRIA, Rocquencourt, 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): 35, Citation Count: 57

Additional Information:

abstract 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/75277.75284 What is a DOI?

ABSTRACT

Strongly typed languages with records may have inclusion rules so that records with more fields can be used instead of records with less fields. But these rules lead to a global treatment of record types as a special case. We solve this problem by giving an ordinary status to records without any ad hoc assertions, replacing inclusion rules by extra information in record types. With this encoding ML naturally extends its polymorphism to records but any other host language will also transmit its power.

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.

	CAMLr	Pierre Weis. "The CAML Reference Manual". INRIA 1987.
	CAMLp	Guy Cousineau and G~rard Huet. "The CAML Primer". INRIA 1987.
	Car84	Luca Cardelli, A semantics of multiple inheritance., Proc. of the international symposium on Semantics of data types, p.51-67, July 1984, Sophia-Antipolis, France
	Car86	L Cardelli, Amber, Proc. of the thirteenth spring school of the LITP on Combinators and functional programming languages, p.21-47, October 1986, Val d'Ajol, France
	Car88	L. Cardelli, Structural subtyping and the notion of power type, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.70-79, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73566]
	Coppo	Mario Coppo, An Extended Polymorphic Type System for Applicative Languages, Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science, p.194-204, September 01-05, 1980
	CW85	Luca Cardelli , Peter Wegner, On understanding types, data abstraction, and polymorphism, ACM Computing Surveys (CSUR), v.17 n.4, p.471-523, Dec. 1985 [doi>10.1145/6041.6042]
	FM88	You-Chin Fuh , Prateek Mishra, Type inference with subtypes, Proceedings of the Second European Symposium on Programming, p.155-175, January 1988, Nancy, France
	Huet	G~rard ttuet. "R~solution d'~quations dans les langages d'ordre 1, 2, ...,~". Th~se de doctorat d'~tat, Universit~ Paris 7, 1976.
	JM88	Lalita Jategaonkar , John Mitchell, ML with extended pattern matching and subtypes, Proceedings of the 1988 ACM conference on LISP and functional programming, p.198-211, July 25-27, 1988, Snowbird, Utah, United States [doi>10.1145/62678.62702]
	KTU88	A.J. Kfoury, J. Tiuryn and P. Urzyczyn. "On The Computational Power of Universally Polymorphic Recursion". In Proceedings of the Third Symposium on Logic In Computer Science, 1988.
	Mit84	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]
	Mit88	John C. Mitchell, Polymorphic type inference and containment, Information and Computation, v.76 n.2-3, p.211-249, February/March 1988 [doi>10.1016/0890-5401(88)90009-0]
	Sta88	R. Stansifer, Type inference with subtypes, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.88-97, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73568]
	Wand87	Mitchell Wand. "Complete type inference for simple objects". In Proceedings of the Second Symposium on Logic In Computer Science, 1987.
	Wand88	Mitchell Wand. "Corrigendum: Complete type inference for simple objects". In Proceedings of the Third Symposium on Logic In Computer Science, 1988.

CITED BY 57

	Andrew K. Wright , Robert Cartwright, A practical soft type system for Scheme, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.250-262, July-Sept. 1994
	Stefan Kaes, Type inference in the presence of overloading, subtyping and recursive types, ACM SIGPLAN Lisp Pointers, v.V n.1, p.193-204, Jan. 1992
	Jeffrey R. Lewis , John Launchbury , Erik Meijer , Mark B. Shields, Implicit parameters: dynamic scoping with static types, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.108-118, January 19-21, 2000, Boston, MA, USA
	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
	Martin Odersky , Philip Wadler , Martin Wehr, A second look at overloading, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.135-146, June 26-28, 1995, La Jolla, California, United States
	Phillip M. Yelland, A compositional account of the Java virtual machine, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.57-69, January 20-22, 1999, San Antonio, Texas, United States
	Ryan Stansifer , Dan Wetklow, Type reconstruction for coercion polymorphism, Proceedings of the 1994 ACM symposium on Applied computing, p.420-424, March 06-08, 1994, Phoenix, Arizona, United States
	Martin Odersky , Christoph Zenger , Matthias Zenger, Colored local type inference, ACM SIGPLAN Notices, v.36 n.3, p.41-53, March 2001
	John Mitchell , Sigurd Meldal , Neel Madhav, An extension of standard ML modules with subtyping and inheritance, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.270-278, January 21-23, 1991, Orlando, Florida, United States
	Atsushi Ohori , Keishi Tajima, A polymorphic calculus for views and object sharing (extended abstract), Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.255-266, May 24-27, 1994, Minneapolis, Minnesota, United States
	William R. Cook , Walter Hill , Peter S. Canning, Inheritance is not subtyping, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.125-135, December 1989, San Francisco, California, United States
	Harry G. Mairson, A constructive logic of multiple subtyping, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.313-324, March 1993, Charleston, South Carolina, United States
	John C. Mitchell, Toward a typed foundation for method specialization and inheritance, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.109-124, December 1989, San Francisco, California, United States
	Atsushi Ohori, A polymorphic record calculus and its compilation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.6, p.844-895, Nov. 1995
	Xavier Leroy , François Pessaux, Type-based analysis of uncaught exceptions, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.2, p.340-377, March 2000
	Robert Harper , Benjamin Pierce, A record calculus based on symmetric concatenation, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.131-142, January 21-23, 1991, Orlando, Florida, United States
	A. Ohori , P. Buneman, Static type inference for parametric classes, ACM SIGPLAN Notices, v.24 n.10, p.445-450, Oct. 1989
	Susumu Nishimura, Static typing for dynamic messages, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.266-278, January 19-21, 1998, San Diego, California, United States
	Mads Tofte , Lars Birkedal, A region inference algorithm, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.4, p.724-767, July 1998
	Limsoon Wong, The functional guts of the Kleisli query system, ACM SIGPLAN Notices, v.35 n.9, p.1-10, Sept. 2000
	Benjamin C. Pierce , David N. Turner, Object-oriented programming without recursive types, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.299-312, March 1993, Charleston, South Carolina, United States
	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
	François Pessaux , Xavier Leroy, Type-based analysis of uncaught exceptions, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.276-290, January 20-22, 1999, San Antonio, Texas, United States
	Matthias Neubauer , Peter Thiemann, Discriminative sum types locate the source of type errors, ACM SIGPLAN Notices, v.38 n.9, p.15-26, September 2003
	Mark P. Jones, Simplifying and improving qualified types, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.160-169, June 26-28, 1995, La Jolla, California, United States
	Atsushi Ohori , Kiyoshi Yamatodani, An interoperable calculus for external object access, ACM SIGPLAN Notices, v.37 n.9, p.60-71, September 2002
	Benjamin C. Pierce , David N. Turner, Local type inference, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.252-265, January 19-21, 1998, San Diego, California, United States
	Jens Palsberg , Michael I. Schwartzbach, Object-oriented type inference, ACM SIGPLAN Notices, v.26 n.11, p.146-161, Nov. 1991
	Benjamin C. Pierce , David N. Turner, Local type inference, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.1, p.1-44, Jan. 2000
	Mads Tofte, Principal signatures for higher-order program modules, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.189-199, January 19-22, 1992, Albuquerque, New Mexico, United States
	Ryan Stansifer , Dan Wetklow, Method reuse in typed object-oriented languages, Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, p.63-70, February 14-16, 1993, Indianapolis, Indiana, United States
	Peter Canning , William Cook , Walter Hill , Walter Olthoff , John C. Mitchell, F-bounded polymorphism for object-oriented programming, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.273-280, September 11-13, 1989, Imperial College, London, United Kingdom
	S. Danforth , P. Valduriez, A FAD for Data Intensive Applications, IEEE Transactions on Knowledge and Data Engineering, v.4 n.1, p.34-51, February 1992
	Benjamin C. Pierce, Type systems, Programming methodology, Springer-Verlag New York, Inc., New York, NY, 2003
	Atsushi Ohori, A compilation method for ML-style polymorphic record calculi, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.154-165, January 19-22, 1992, Albuquerque, New Mexico, United States
	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
	Jacques Garrigue , Hassan Aït-Kaci, The typed polymorphic label-selective λ-calculus, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.35-47, January 16-19, 1994, Portland, Oregon, United States
	Robert Cartwright , Mike Fagan, Soft typing, ACM SIGPLAN Notices, v.26 n.6, p.278-292, June 1991
	Robert Cartwright , Mike Fagan, Soft typing, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Robert Cartwright , Mike Fagan, Soft typing, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Dimitrios Vytiniotis , Geoffrey Washburn , Stephanie Weirich, An open and shut typecase, Proceedings of the 2005 ACM SIGPLAN international workshop on Types in languages design and implementation, p.13-24, January 10-10, 2005, Long Beach, California, USA
	Atsushi Ohori, Register allocation by proof transformation, Science of Computer Programming, v.50 n.1-3, p.161-187, March 2004
	Shin-Ya Nishizaki, A Polymorphic Environment Calculus and its Type-Inference Algorithm, Higher-Order and Symbolic Computation, v.13 n.3, p.239-278, Sept. 2000
	Michael Furr , Jeffrey S. Foster, Checking type safety of foreign function calls, ACM SIGPLAN Notices, v.40 n.6, June 2005
	Clara Murdaca , C. Barry Jay, A relational account of objects, Proceedings of the 29th Australasian Computer Science Conference, p.297-302, January 16-19, 2006, Hobart, Australia
	Francois Rouaix, Safe run-time overloading, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.355-366, December 1989, San Francisco, California, United States
	Pieter H. Hartel , Luc Moreau, Formalizing the safety of Java, the Java virtual machine, and Java card, ACM Computing Surveys (CSUR), v.33 n.4, p.517-558, December 2001
	Shan Shan Huang , David Zook , Yannis Smaragdakis, cJ: enhancing java with safe type conditions, Proceedings of the 6th international conference on Aspect-oriented software development, March 12-16, 2007, Vancouver, British Columbia, Canada
	Koji Kagawa, Polymorphic variants in Haskell, Proceedings of the 2006 ACM SIGPLAN workshop on Haskell, September 17-17, 2006, Portland, Oregon, USA
	Michael Furr , Jeffrey S. Foster, Checking type safety of foreign function calls, ACM Transactions on Programming Languages and Systems (TOPLAS), v.30 n.4, p.1-63, July 2008
	Matthew Fluet , Riccardo Pucella, Phantom types and subtyping, Journal of Functional Programming, v.16 n.6, p.751-791, November 2006
	Jukka Paakki , Anssi Karhinen , Tomi Silander, Orthogonal type extensions and reductions, ACM SIGPLAN Notices, v.25 n.7, p.28-38, July 1990
	Limsoon Wong, Polymorphic queries across sets, bags, and lists, ACM SIGPLAN Notices, v.30 n.4, p.39-44, April 1995
	Limsoon Wong, An introduction to Remy's fast polymorphic record projection, ACM SIGMOD Record, v.24 n.3, p.34-39, Sept. 1995
	Peter Buneman , Leonid Libkin , Dan Suciu , Val Tannen , Limsoon Wong, Comprehension syntax, ACM SIGMOD Record, v.23 n.1, p.87-96, March 1994
	Limsoon Wong, Kleisli, a functional query system, Journal of Functional Programming, v.10 n.1, p.19-56, January 2000
	Sam Lindley, Many holes in hindley-milner, Proceedings of the 2008 ACM SIGPLAN workshop on ML, September 21-21, 2008, Victoria, BC, Canada