An ideal model for recursive polymorphic types

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An ideal model for recursive polymorphic types

Full text

Pdf (582 KB)

Source

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

Salt Lake City, Utah, United States

Pages: 165 - 174

Year of Publication: 1984

ISBN:0-89791-125-3

Authors

David MacQueen	Bell Laboratories, Murray Hill, New Jersey
Gordon Plotkin	Department of Computer Science, University of Edinburgh, Edinburgh EH9 3J2
Ravi Sethi	Bell Laboratories, Murray Hill, New Jersey

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGAPL: ACM Special Interest Group on APL Programming Language

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 60, Citation Count: 25

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/800017.800528 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. Arnold and M. Nivat, "Metric interpretations of finite trees and semantics of nondeterministic recursive programs," Theoretical Computer Science11, pp. 181-205 (1980).
	2	S. Banach, "Sur les opérations dans les ensembles abstraits et leurs applications aux équations intégrales," Fund. Math.3, pp. 7-33 (1922).
	3	R. M. Burstall , D. B. MacQueen , D. T. Sannella, HOPE: An experimental applicative language, Proceedings of the 1980 ACM conference on LISP and functional programming, p.136-143, August 25-27, 1980, Stanford University, California, United States [doi>10.1145/800087.802799]
	4	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]
	5	J. W. deBakker and J. I. Zucker, "Processes and the denotational semantics of concurrency," Information and Control54, pp. 70-120 (1982).
	6	M. J. Gordon, A. J. Milner, and C. P. Wadsworth, Edinburgh LCF, Lecture Notes in Computer Science 78 (1979).
	7	P. Henderson, "An approach to compile-time type checking," pp. 523-527 in Information Processing 77, ed. B. Gilchrist, North-Holland (1977).
	8	R. Hindley, "The principal type-scheme of an object in combinatory logic," Trans. AMS146, pp. 29-60 (December 1969).
	9	J. E. Hopcroft and R. M. Karp, "An algorithm for testing the equivalence of finite automata," TR-71-114, Dept. of Computer Science, Cornell Univ. (1971).
	10	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	11	D. B. MacQueen , Ravi Sethi, A semantic model of types for applicative languages, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.243-252, August 15-18, 1982, Pittsburgh, Pennsylvania, United States [doi>10.1145/800068.802156]
	12	Nancy Jean Mccracken, An investigation of a programming language with a polymorphic type structure., 1979
	13	R. Milner, "A theory of type polymorphism in programming," >JCSS17(3), pp. 348-375 (December 1978).
	14	F. L. Morris, "Automatic assignment of concrete type schemes to programs," unpublished (197?).
	15	F.L. Morris, "On list structures and their use in the programming of unification," Report 4-78, School of Computer and Information Science, Syracuse Univ. (August 1978). A fast algorithm for circular unification is credited to G. Huet, G. Kahn, and J. A. Robinson.
	16	J. H. Morris Jr., "Lambda-calculus models of programming languages," Ph.D. Thesis, Sloan School of Management, MIT (1968).
	17	G. Plotkin, "Advanced domains," Summer School, Pisa (1978).
	18	John C. Reynolds, Towards a theory of type structure, Programming Symposium, Proceedings Colloque sur la Programmation, p.408-423, April 09-11, 1974
	19	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]
	20	D. S. Scott, "Continuous lattices," pp. 97-136 in Lecture Notes in Mathematics274 (1972).
	21	Adi Shamir , William W. Wadge, Data Types as Objects, Proceedings of the Fourth Colloquium on Automata, Languages and Programming, p.465-479, July 18-22, 1977
	22	W. W. Wadge, Personal communication to R. Milner, March 1978.
	23	M. Wand, personal communication, January 1983.

CITED BY 25

	Luca Cardelli , Peter Wegner, On understanding types, data abstraction, and polymorphism, ACM Computing Surveys (CSUR), v.17 n.4, p.471-523, Dec. 1985
	Flemming Nielson , Hanne Riis Nielson, Operational semantics of termination types, Nordic Journal of Computing, v.3 n.2, p.144-187, Summer 1996
	Mark Shields , Erik Meijer, Type-indexed rows, ACM SIGPLAN Notices, v.36 n.3, p.261-275, March 2001
	Hans-Juergen Boehm , Alan Demers, Implementing RUSSELL, ACM SIGPLAN Notices, v.21 n.7, p.186-195, July 1986
	John C. Mitchell, A type-inference approach to reduction properties and semantics of polymorphic expressions (summary), Proceedings of the 1986 ACM conference on LISP and functional programming, p.308-319, August 1986, Cambridge, Massachusetts, United States
	Scott Danforth , Chris Tomlinson, Type theories and object-oriented programmimg, ACM Computing Surveys (CSUR), v.20 n.1, p.29-72, March 1988
	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
	Kevin Knight, Unification: a multidisciplinary survey, ACM Computing Surveys (CSUR), v.21 n.1, p.93-124, March 1989
	Alexander Aiken , Manuel Fähndrich, Dynamic typing and subtype inference, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.182-191, June 26-28, 1995, La Jolla, California, United States
	Alexander Aiken , John H. Williams , Edward L. Wimmers, Safe: a semantic technique for transforming programs in the presence of errors, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.1, p.63-84, Jan. 1995
	Erik Ruf , Daniel Weise, Using types to avoid redundant specialization, ACM SIGPLAN Notices, v.26 n.9, p.321-333, Sept. 1991
	Gregory F. Johnson , Janet A. Walz, A maximum-flow approach to anomaly isolation in unification-based incremental type inference, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.44-57, January 01, 1986, St. Petersburg Beach, Florida
	Alexander Aiken , Edward L. Wimmers , T. K. Lakshman, Soft typing with conditional types, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.163-173, January 16-19, 1994, Portland, Oregon, United States
	Takuya Katayama, Type inference and type checking for functional programming languages: A reduced computation approach, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.263-272, August 06-08, 1984, Austin, Texas, United States
	Kim B. Bruce , Peter Wegner, An algebraic model of sybtypes in object-oriented languages (draft), ACM SIGPLAN Notices, v.21 n.10, p.163-172, Oct. 1986
	T.-M. Kuo , P. Mishra, On strictness and its analysis, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.144-155, January 21-23, 1987, Munich, West Germany
	Robert Cartwright , Mike Fagan, Soft typing, ACM SIGPLAN Notices, v.26 n.6, p.278-292, June 1991
	David MacQueen, Modules for standard ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.198-207, August 06-08, 1984, Austin, Texas, United States
	Robert Cartwright , Mike Fagan, Soft typing, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Michael V. Mannino , In Jun Choi , Don S. Batory, The Object-Oriented Functional Data Language, IEEE Transactions on Software Engineering, v.16 n.11, p.1258-1272, November 1990
	Jeffrey Scott Vitter , Roger A. Simons, Parallel algorithms for unification and other complete problems in p, Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge, p.75-84, January 1984
	Injun Choi , Michael V. Mannino, Graph interpretation of methods: a unifying framework for polymorphism in object-oriented programming, ACM SIGPLAN OOPS Messenger, v.2 n.1, p.38-54, Jan. 1991
	Robert Cartwright, Types as intervals, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.22-36, January 14-16, 1985, New Orleans, Louisiana, United States
	Daniel Leivant, Logical and mathematical reasoning about imperative programs: preliminary report, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.132-140, January 14-16, 1985, New Orleans, Louisiana, United States
	Alexander Aiken , Edward L. Wimmers , Jens Palsberg, Optimal Representations of Polymorphic Types with Subtyping, Higher-Order and Symbolic Computation, v.12 n.3, p.237-282, October 1999