Relational Semantics for Recursive Types and Bounded Quantification

The language Fun [Cardelli, Wegner, 1985] is a typed polymorphic lambda calculus with record types, quantification over subtypes of a given type and inheritance. In this paper it is extended with recursive types, and the consistency of the resulting language is proved by constructing an interpretation of its types as partial equivalence relations of a special kind, terms being interpreted as equivalence classes, modulo such relations, of elements of a model of the underlying language of untyped terms.

[1]  Mario Coppo,et al.  A Completeness Theorem for Recursively Defined Types , 1985, ICALP.

[2]  Gordon D. Plotkin,et al.  An Ideal Model for Recursive Polymorphic Types , 1986, Inf. Control..

[3]  Kim B. Bruce,et al.  A Modest Model of Records, Inheritance and Bounded Quantification , 1990, Inf. Comput..

[4]  Kim B. Bruce,et al.  A modest model of records, inheritance and bounded quantification , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[5]  Thierry Coquand,et al.  Extensional Models for Polymorphism , 1987, Theor. Comput. Sci..

[6]  John C. Mitchell,et al.  Polymorphic Type Inference and Containment , 1988, Inf. Comput..

[7]  J. Y. Girard,et al.  Interpretation fonctionelle et elimination des coupures dans l'aritmetique d'ordre superieur , 1972 .

[8]  Kristen Nygaard,et al.  SIMULA: an ALGOL-based simulation language , 1966, CACM.

[9]  John C. Mitchell.  A type-inference approach to reduction properties and semantics of polymorphic expressions (summary) , 1986, LFP '86.

[10]  John C. Reynolds,et al.  Towards a theory of type structure , 1974, Symposium on Programming.

[11]  Luca Cardelli,et al.  A Semantics of Multiple Inheritance , 1984, Information and Computation.

[12]  Gordon D. Plotkin,et al.  An ideal model for recursive polymorphic types , 1984, Inf. Control..

[13]  Thierry Coquand,et al.  Extensional Models for Polymorphism , 1988, Theor. Comput. Sci..

[14]  John C. Mitchell,et al.  The Semantics of Second-Order Lambda Calculus , 1990, Inf. Comput..

[15]  John C. Mitchell,et al.  Coercion and type inference , 1984, POPL.

[16]  Thierry Coquand,et al.  Inheritance and explicit coercion , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[17]  Luca Cardelli,et al.  On understanding types, data abstraction, and polymorphism , 1985, CSUR.

[18]  Roberto M. Amadio.  A fixed point extension of the second order lambda-calculus: observable equivalences and models , 1988, LICS 1988.

[19]  Dana S. Scott,et al.  Some Domain Theory and Denotational Semantics in Coq , 2009, TPHOLs.

[20]  David Robson,et al.  Smalltalk-80: The Language and Its Implementation , 1983 .

[21]  John C. Reynolds,et al.  On the Relation between Direct and Continuation Semantics , 1974, ICALP.

[22]  Mario Coppo,et al.  Type inference and logical relations , 1986, LICS.

[23]  John Mitchell,et al.  Type Inference and Type Containment , 1984, Semantics of Data Types.

[24]  Luca Cardelli,et al.  Structural subtyping and the notion of power type , 1988, POPL '88.

[25]  Roberto M. Amadio,et al.  Recursion over Realizability Structures , 1991, Inf. Comput..