Structural subtyping and the notion of power type

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Structural subtyping and the notion of power type

Full text

Pdf (969 KB)

Source

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

San Diego, California, United States

Pages: 70 - 79

Year of Publication: 1988

ISBN:0-89791-252-7

Author

L. Cardelli

Digital Equipment Corporation, Systems Research Center, 130 Lytton Avenue, Palo Alto, CA

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): 8, Downloads (12 Months): 49, Citation Count: 26

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/73560.73566 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.

	Burstall 84	R.M.BurstaU: Programming with modules as typed functional programming, International Conference on 5th Generation Computing Systems, Tokyo, Nov 1984.
	Burstall Lampson 84	R. Burstall , B. Lampson, A kernel language for abstract data types and modules., Proc. of the international symposium on Semantics of data types, p.1-50, July 1984, Sophia-Antipolis, France
	Cardelli 84	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
	Cardelli Wegner 85	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]
	Cardelli 86	L. Cardelli: A polymorphic X-calculus with Type:Type, Technical Report n.10, DEC Systems Research Center, May 1986.
	Cardelli 87	L. Cardelli, Typechecking dependent types and subtypes, Lecture notes in computer science on Foundations of logic and functional programming, p.45-57, June 1988, Trento, Italy
	Girard 71	J.-Y.Girard: Une extension de l'interpr~tation de G6del ~ l'analyse, et son application /l l'dlimination des coupures dans l'analyse et la th~orie des types, Proceedings of the second Scandinavian logic symposium, J.B.Fenstad Ed. pp. 63-92, North-Holland, 1971.
	Harper Honsell Plotkin 87	R.Harper, F.Honsell, G.Plotkin, A framework for defining logics, Proc. Symposium on Logic in Computer Science, Ithaca NY, June 22-25 1987, IEEE Computer Society Press, 1987.
	MacQueen 86	David B. MacQueen, Using dependent types to express modular structure, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.277-286, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512670]
	Martin-Löf 73	P.Martin-L6f, An intuitionistic theory of types: predicative part, in Logic Colloquium ill, F.Rose, J.Sheperdson Eds., pp 73-118, North-Holland, 1973.
	Meyer Reinhold 86	Albert R. Meyer , Mark B. Reinhold, "Type" is not a type, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.287-295, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512671]
	Mitchell Plotkin 85	John C. Mitchell , Gordon D. Plotkin, Abstract types have existential types, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.37-51, January 14-16, 1985, New Orleans, Louisiana, United States [doi>10.1145/318593.318606]
	Reynolds 85	J C Reynolds, Three approaches to type structure, Proc. of the international joint conference on theory and practice of software development (TAPSOFT) Berlin, March 25-29, 1985 on Mathematical foundations of software development, Vol. 1: Colloquium on trees in algebra and programming (CAAP'85), p.97-138, April 1985, Berlin, Germany
	Wand 87	M.Wand, Complete type inference for simple objects, Proc. Symposium on Logic in Computer Science, Ithaca NY, June 22-251987, IEEE Computer Society Press, 1987.

CITED BY 26

	Xavier Leroy, Manifest types, modules, and separate compilation, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.109-122, January 16-19, 1994, Portland, Oregon, United States
	David Aspinall , Adriana Compagnoni, Subtyping dependent types, Theoretical Computer Science, v.266 n.1-2, p.273-309, 09/06/2001
	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
	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
	Simon Martini, Bounded quantifiers have interval models, Proceedings of the 1988 ACM conference on LISP and functional programming, p.164-173, July 25-27, 1988, Snowbird, Utah, United States
	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
	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
	Robert Harper , John C. Mitchell, On the type structure of standard ML, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.2, p.211-252, April 1993
	Kim B. Bruce, Safe type checking in a statically-typed object-oriented programming language, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.285-298, March 1993, Charleston, South Carolina, United States
	Benjamin C. Pierce, Bounded quantification is undecidable, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.305-315, January 19-22, 1992, Albuquerque, New Mexico, United States
	Yan Mei Tang , Pierre Jouvelot, Effect systems with subtyping, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.45-53, June 21-23, 1995, La Jolla, California, United States
	Neal Glew , Greg Morrisett, Type-safe linking and modular assembly language, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.250-261, January 20-22, 1999, San Antonio, Texas, United States
	P. S. Canning , W. R. Cook , W. L. Hill , W. G. Olthoff, Interfaces for strongly-typed object-oriented programming, ACM SIGPLAN Notices, v.24 n.10, p.457-467, Oct. 1989
	Karl Crary, Foundations for the implementation of higher-order subtyping, ACM SIGPLAN Notices, v.32 n.8, p.125-135, Aug. 1997
	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
	István Zólyomi , Zoltán Porkoláb , Tamás Kozsik, An extension to the subtype relationship in C++ implemented with template metaprogramming, Proceedings of the second international conference on Generative programming and component engineering, p.209-227, September 22-25, 2003, Erfurt, Germany
	Véronique Benzaken , Anne Doucet, Thémis: a database programming language handling integrity constraints, The VLDB Journal — The International Journal on Very Large Data Bases, v.4 n.3, July 1995
	Carlos Mitidieri , Jörg Kaiser, Attribute-based filtering for embedded systems, Proceedings of the 2nd international workshop on Distributed event-based systems, June 08-08, 2003, San Diego, California
	Gary T. Leavens, Introduction to the literature on object-oriented design, programming, and languages, ACM SIGPLAN OOPS Messenger, v.2 n.4, p.40-53, Oct. 1991
	Marina Polishchuk , Ben Liblit , Chloë W. Schulze, Dynamic heap type inference for program understanding and debugging, ACM SIGPLAN Notices, v.42 n.1, January 2007
	Thomas Kuehne , Daniel Schreiber, Can programming be liberated from the two-level style: multi-level programming with deepjava, ACM SIGPLAN Notices, v.42 n.10, October 2007
	Andrew P. Black , Norman C. Hutchinson , Eric Jul , Henry M. Levy, The development of the Emerald programming language, Proceedings of the third ACM SIGPLAN conference on History of programming languages, p.11-1-11-51, June 09-10, 2007, San Diego, California
	Jukka Paakki , Anssi Karhinen , Tomi Silander, Orthogonal type extensions and reductions, ACM SIGPLAN Notices, v.25 n.7, p.28-38, July 1990
	Xavier Leroy, A modular module system, Journal of Functional Programming, v.10 n.3, p.269-303, May 2000
	Benjamin C. Pierce, Intersection types and bounded polymorphism, Mathematical Structures in Computer Science, v.7 n.2, p.129-193, April 1997
	Adriaan Moors , Frank Piessens , Martin Odersky, Generics of a higher kind, ACM SIGPLAN Notices, v.43 n.10, September 2008