A record calculus based on symmetric concatenation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A record calculus based on symmetric concatenation

Full text

Pdf (1.00 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: 131 - 142

Year of Publication: 1991

ISBN:0-89791-419-8

Authors

Robert Harper	Carnegie Mellon University
Benjamin Pierce	Carnegie Mellon University

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): 5, Downloads (12 Months): 20, Citation Count: 13

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.99603 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	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 [doi>10.1145/99370.99392]
	2	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
	3	Luca Cardelli, A semantics of multiple inheritance, Information and Computation, v.76 n.2-3, p.138-164, February/March 1988 [doi>10.1016/0890-5401(88)90007-7]
	4	Luca Cardelli , John C. Mitchell, Operations on records, Proceedings of the fifth international conference on Mathematical foundations of programming semantics, p.22-52, July 1990, New Orleans, Louisiana, United States
	5	Luca Cardelli .xnd John C. Mitchell. Operations on records. Research Report 48, Digital Equipment Corporation, Systems Research Center, August 1989.
	6	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]
	7	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 [doi>10.1145/96709.96721]
	8	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]
	9	Jean-Yves Girard. Interprdtation }onctionelle et dlimination des coupures de l'arithmdtique d'ordre supdrieur. PhD thesis, Universitd Paris VII, 1972.
	10	Robert Harper and Benjamin Pierce. A record calculus based oa symmetric concatenation. Technical Report CMU-CS-90-157, Carnegie Mellon University, August 1990.
	11	Robert W. Harper and Benjamin C. Pierce. ExtensibIe records without subsumption. Technical Report CMU-CS-90-102, School of Computer Science, Carnegie Melon University, Feburary 1990.
	12	Gérard Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems, Journal of the ACM (JACM), v.27 n.4, p.797-821, Oct. 1980 [doi>10.1145/322217.322230]
	13	Lalita A. Jategaonkar. ML with extended pattern matching and subtypes. Master's thesis, MIT, August 1989.
	14	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]
	15	R. Milner, A Calculus of Communicating Systems, Springer-Verlag New York, Inc., Secaucus, NJ, 1982
	16	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]
	17	A. Ohori , P. Buneman, Static type inference for parametric classes, Conference proceedings on Object-oriented programming systems, languages and applications, p.445-450, October 02-06, 1989, New Orleans, Louisiana, United States
	18	Atsushi Ohori , Peter Buneman, Type inference in a database programming language, Proceedings of the 1988 ACM conference on LISP and functional programming, p.174-183, July 25-27, 1988, Snowbird, Utah, United States [doi>10.1145/62678.62700]
	19	D. Rémy, Type checking records and variants in a natural extension of ML, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.77-88, January 11-13, 1989, Austin, Texas, United States [doi>10.1145/75277.75284]
	20	Didier R6my. Algebras Touffues. Application au Typage Polymorphe des Objets Enregistrements dans les Langages Fonctionnels. PhD thesis, Universit~ Paris VII, 1990.
	21	Didier R~my. Typechecldng records in a natural extension of ML. Submitted to TOPLAS, June 1990.
	22	John C. Reynolds, Towards a theory of type structure, Programming Symposium, Proceedings Colloque sur la Programmation, p.408-423, April 09-11, 1974
	23	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]
	24	Mitchell Wand. Complete type inference for simple objects. In Proceedings of the IEEE Symposium on Logic ~n Computer Science, Ithaca, NY, June 1987.
	25	Mitchell Wand. Corrigendum: Complete type inference for simple objects. In Proceedings of the IEEE Symposium on Logic in Computer Science, 1988.
	26	Mitchell Wand. Type inference for objects with instance variables and inheritance. Technical Report NU-CCS- 89-2, College of Computer Science, Northeastern University, November 1988.
	27	M. Wand, Type inference for record concatenatiOn and multiple inheritance, Proceedings of the Fourth Annual Symposium on Logic in computer science, p.92-97, June 1989, Pacific Grove, California, United States

CITED BY 13

	Antero Taivalsaari, On the notion of inheritance, ACM Computing Surveys (CSUR), v.28 n.3, p.438-479, Sept. 1996
	Martín Abadi , Luca Cardelli, On subtyping and matching, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.4, p.401-423, July 1996
	Mark Shields , Erik Meijer, Type-indexed rows, ACM SIGPLAN Notices, v.36 n.3, p.261-275, March 2001
	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
	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
	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
	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
	Jens Palsberg , Tian Zhao, Type inference for record concatenation and subtyping, Information and Computation, v.189 n.1, p.54-86, 25 February 2004
	François Pottier, A versatile constraint-based type inference system, Nordic Journal of Computing, v.7 n.4, p.312-347, Winter 2000
	Henning Makholm , J. B. Wells, Type inference, principal typings, and let-polymorphism for first-class mixin modules, ACM SIGPLAN Notices, v.40 n.9, September 2005
	Haruo Hosoya , Makoto Murata, Boolean operations and inclusion test for attribute-element constraints, Theoretical Computer Science, v.360 n.1, p.327-351, 21 August 2006
	Lajos Nagy , Ryan Stansifer, Polymorphic type inference for the relational algebra in the functional database programming language neon, Proceedings of the 44th annual southeast regional conference, March 10-12, 2006, Melbourne, Florida
	Gérard Boudol, The recursive record semantics of objects revisited, Journal of Functional Programming, v.14 n.3, p.263-315, May 2004