Abstract
The study of models based on partial equivalence relations (per) and the analysis of the interpretation of inheritance that arises in these structures (Bruce&Longo[88]) leads us to reconsider the classical problem of type-assignment in this framework. Moreover we introduce:
-
(1)
A natural generalization of type-assignment systems to typed-equivalence systems that is suggested by the permodels.
-
(2)
A specialization of the type-assignment system to a type-containment system that is motivated by the search for a “complete” theory of inheritance.
In the last section we show that a fragment of such theory of inheritance can be fully automated.
Parts of this chapter appeared as TR 28/89 "Formal Theories of Inheritance for Typed Functional Languages", Dipartimento di Informatica, Universita' di Pisa and was presented at the EEC Jumelage meeting on typed λ-calculi (Nijmegen, November 1988) and at the Workshop on Conditional and Typed Rewriting Systems '90, Montreal.
Work done while on leave from Dipartimento di Informatica, Universita' di Pisa.
Preview
Unable to display preview. Download preview PDF.
References
Amadio R. [1988] "A fixed point extension of the second order lambda calculus: observable equivalences and models", 3rd IEEE LICS, Edinburgh.
Amadio R. [1988(a)] "Proof theoretic properties of a theory of inheritance", internal report, October '88, Universita' di Pisa, (presented at the EEC Jumelage meeting on Typed λ-calculi, Nijmegen, November 1988).
Amadio R. [1989] "Recursion over realizability structures", TR 1/89, Universita' di Pisa, to appear on Info.&Comp.
Amadio R. [1989(a)] "Formal theories of inheritance for typed functional languages", TR 28/89 Universita' di Pisa.
Amadio R. [1990] "Recursion and Subtyping in Lambda Calculi", PhD Thesis, Università di Pisa.
Amadio R., Cardelli L. [1990] "Subtyping Recursive Types", DEC-SRC TR #62, ext. abs in ACM-POPL91.
Barendregt H. [1984] "The lambda calculus; its syntax and semantics", Revised and expanded edition, North Holland.
Bethke I. [1988] "Notes on partial combinatory algebras", PhD thesis, University of Amsterdam.
Breazu-Tannen V., Coquand T., Gunter C., Scedrov A. [1989] "Inheritance and explicit coercion", 4th IEEE-LICS '89.
Bruce K., Longo G. [1988] "A modest model of records, inheritance and bounded quantification" 3rd IEEE LICS, Edinburgh (Expanded and improved version appeared in Info&Comp).
Bruce K., Meyer A. [1984] "The semantics of second order polymorphic lambda-calculus", in Semantics of data types, Kahn et al. (eds.), SLNCS 173.
Cardelli L. [1988] "A semantics of multiple inheritance", Info.&Comp., 76, (138–164).
Cardelli L., Longo G. [1990] "A semantic basis for Quest", LISP&FP90, Nice.
Cardone F., Coppo M. [1989] "Type inference with recursive types: syntax and semantics", preprint, Dipartimento di Informatica, Università di Torino.
Curien P.L., Ghelli G. [1990] "Coherence of Subsumption", CAAP90, Copenhagen.
Curry H., Feys R. [1958] "Combinatory Logic", vol. 1, North Holland.
Curry H., Hindley R., Seldin J. [1972] "Combinatory Logic", vol. 2, North Holland.
Girard J.Y. [1971] "Une extension de l'interpretation de Gödel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la theorie des types". In 2nd Scandinavian Logic Simposium, J.E. Festand ed., North-Holland, (63–92).
Henkin L. [1950] "Completeness in the theory of types", JSL, 15, 2, (81–91).
Hindley R. [1983] "The completeness theorm for typing λ-terms", TCS, 22, (1–17).
Hindley R., Seldin J. [1986] "Introduction to Combinators and λ-calculus", Cambridge University Press.
Hyland M. [1988] "A small complete category", APAL, 40, 2, (135–165).
Liskov B. [1988] "Data abstraction and hierarchy", Addendum Proc. OOPSLA '87, Sigplan notices, 23, 5, (17–34).
Longo G., Moggi E. [1988] "Constructive natural deduction and its modest interpretation", CMU TR CS-88-131.
Mac Queen D., Plotkin G., Sethi R. [1986] "An ideal model for recursive polymorphic types", Info.&Contr., 71, 1–2.
Mahr B., Makowski J. [1984] "Characterizing specification languages which admit initial semantics", TCS, 31, (49–59).
Martini S. [1988] "Bounded quantifiers have interval models", ACM Lisp and Funct. Progr. Conf., Snowbird.
Meyer A., Mitchell J., Moggi E., Statman R. [1987] "Empty types in polymorphic lambda calculus", 14th POPL '87, (253–262).
Mitchell J. [1986] "A type-inference approach to reduction properties and semantics of polymorphic expressions", Lisp and Functional Programming Conference.
Mitchell J. [1988] "Polymorphic type inference and containment", Info.&Comp., 76, (211–249).
Mitchell J., Moggi E. [1987] "Kripke-style models for typed lambda calculus", 2nd IEEE-LICS '87, (303–314).
Reynolds J. [1974] "Towards a theory of type structure", SLNCS19, (408–425).
Scott D. [1976] "Data types as lattices", SIAM J. Comp. 5, (522–587).
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amadio, R.M. (1991). Typed equivalence, type assignment, and type containment. In: Kaplan, S., Okada, M. (eds) Conditional and Typed Rewriting Systems. CTRS 1990. Lecture Notes in Computer Science, vol 516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54317-1_105
Download citation
DOI: https://doi.org/10.1007/3-540-54317-1_105
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54317-6
Online ISBN: 978-3-540-47558-3
eBook Packages: Springer Book Archive