Subtyping recursive types

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Subtyping recursive types

Full text

Pdf (1.52 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: 104 - 118

Year of Publication: 1991

ISBN:0-89791-419-8

Authors

Roberto M. Amadio	LIENS, Ecole Normale Supérieure, Paris
Luca Cardelli	DEC, Systems Research Center

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): 6, Downloads (12 Months): 18, Citation Count: 18

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.99600 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.

	Amadio 89	Roberto M. Amadio, Recursion over realizability structures, Information and Computation, v.91 n.1, p.55-85, March 1991 [doi>10.1016/0890-5401(91)90074-C]
	Amadio 89b	R. Amadio: Formal theories of inheritance for typed functional languages, TR 28/89 Dipartimento di Inforrnatica, Universit~ di Pisa.
	Amadio 90	Roberto M. Amadio, Typed Equivalence, Type Assignment, and Type Containment, Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems, p.372-382, June 11-14, 1990
	Arnold Nivat 80	A.Arnold, M.Nivat: The metric space of infinite trees. Algebraic and topological properties, Fundamenta Informaticae III pp.445-476, 1980.
	Breazu-Tannen et al. 89	V. Breazu-Tannen, C. Gunter, A. Scedrov: Denotational semantics for subtyping between reeursive types, Report MS-CIS 89 63, Logic of Computation 12, Dept of Computer & Information Science, University of Pennsylvania.
	Bruce Longo 88	K. Bruce, G. Longo: A modest model of records, inheritance and bounded quantification, IEEE- LICS 88, Edinburgh.
	Cardelli 86	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
	Cardelli 88	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]
	Cardelli 89	L.Cardelli: Typeful programming, SRC Report #45, Digital Equipment Corporation, 1989.
	Cardelli Donahue Jordan Kalsow Nelson 89	L. Cardelli , J. Donahue , M. Jordan , B. Kalsow , G. Nelson, The Modula–3 type system, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.202-212, January 11-13, 1989, Austin, Texas, United States [doi>10.1145/75277.75295]
	Cardelli Longo 90	Luca Cardelli , Giuseppe Longo, A semantic basis for quest, Proceedings of the 1990 ACM conference on LISP and functional programming, p.30-43, June 27-29, 1990, Nice, France [doi>10.1145/91556.91586]
	Cardone Coppo 89	F.Cardone, M.Coppo: Type inference with recursive types: syntax and semantics, Dipartimento di Informatica, Universit& di Torino.
	Courcelle 83	B.Courcelle: Fundamental properties of infinite trees, Theoretical Computer Science, 25, pp.95- 169, 1983.
	Curien Ghelli 90	P.-L. Curien , G. Ghelli, Coherence of subsumption, Proceedings of the fifteenth colloquium on CAAP'90, p.132-146, May 1990, Copenhagen, Denmark
	Hyland 89	M. Hyland: A small complete category, APAL 40, 2, pp.135-165.
	MacQueen et al. 86	David MacQueen , Gordon Plotkin , Ravi Sethi, An ideal model for recursive polymorphic types, Information and Control, v.71 n.1-2, p.95-130, Oct/Nov. 1986 [doi>10.1016/S0019-9958(86)80019-5]
	Milner 84	R.Milner: A complete inference system for a class of regular behaviours, JCSS 28, pp. 439-466, 1984.
	Park 81	David Park, Concurrency and Automata on Infinite Sequences, Proceedings of the 5th GI-Conference on Theoretical Computer Science, p.167-183, March 23-25, 1981
	Salomaa 66	Arto Salomaa, Two Complete Axiom Systems for the Algebra of Regular Events, Journal of the ACM (JACM), v.13 n.1, p.158-169, Jan. 1966 [doi>10.1145/321312.321326]
	Scott 72	D. Scott : Continuous lattices, Toposes, Algebraic Geometry and Logic, Lawvere (ed.), LNM 274, pp.97-136, Springer-Verlag, 1972.
	Scott 76	D. Scott : Data types as lattices, SIAM J. of Comp., 5, pp.522-587.

CITED BY 18

	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
	Franz Puntigam , Christof Peter, Changeable interfaces and promised messages for concurrent components, Proceedings of the 1999 ACM symposium on Applied computing, p.141-145, February 28-March 02, 1999, San Antonio, Texas, United States
	Dexter Kozen , Jens Palsberg , Michael I. Schwartzbach, Efficient recursive subtyping, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.419-428, March 1993, Charleston, South Carolina, United States
	Ran Rinat , Menachem Magidor , Scott F. Smith, Correspondence polymorphism for object-oriented languages, ACM SIGPLAN Notices, v.34 n.10, p.167-186, Oct. 1999
	Gregor Kiczales , John Lamping, Issues in the design and specification of class libraries, ACM SIGPLAN Notices, v.27 n.10, p.435-451, Oct. 1992
	Satish R. Thatté, Automated synthesis of interface adapters for reusable classes, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.174-187, January 16-19, 1994, Portland, Oregon, 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
	Vassily Litvinov, Contraint-based polymorphism in Cecil: towards a practical and static type system, ACM SIGPLAN Notices, v.33 n.10, p.388-411, Oct. 1998
	Nevin Heintze , David McAllester, On the complexity of set-based analysis, ACM SIGPLAN Notices, v.32 n.8, p.150-163, Aug. 1997
	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 Pottier, Simplifying subtyping constraints, ACM SIGPLAN Notices, v.31 n.6, p.122-133, June 15, 1996
	Jonathan Eifrig , Scott Smith , Valery Trifonov , Amy Zwarico, Application of OOP type theory: state, decidability, integration, ACM SIGPLAN Notices, v.29 n.10, p.16-30, Oct. 1994
	Franz Puntigam , Christof Peter, Types for Active Objects with Static Deadlock Prevention, Fundamenta Informaticae, v.48 n.4, p.315-341, December 2001
	Carl Gould , Zhendong Su , Premkumar Devanbu, Static Checking of Dynamically Generated Queries in Database Applications, Proceedings of the 26th International Conference on Software Engineering, p.645-654, May 23-28, 2004
	Noemi de la Rocque Rodriguez , Roberto Ierusalimschy , José Lucas Rangel, Types in school, ACM SIGPLAN Notices, v.28 n.8, p.81-89, Aug. 1993
	Vladimir Gapeyev , Michael Y. Levin , Benjamin C. Pierce, Recursive subtyping revealed, Journal of Functional Programming, v.12 n.6, p.511-548, November 2002
	Gary Wassermann , Carl Gould , Zhendong Su , Premkumar Devanbu, Static checking of dynamically generated queries in database applications, ACM Transactions on Software Engineering and Methodology (TOSEM), v.16 n.4, p.14-es, September 2007