A modest model of records, inheritance and bounded quantification

The authors give a formal semantics for the language Bounded Fun, which supports both parametric and subtype polymorphism. They show how to use partial equivalence relations to model inheritance in this language, which supports the notion of subtype and record types. A generalization of partial equivalence relations, known as omega -sets, is used in combination with modest sets to provide the first known model of Bounded Fun (with explicit polymorphism). Connections with previous work on the semantics of explicit parametric polymorphism is established by noting that the semantics of polymorphic types presented here (using dependent products) is isomorphic to that given by the intersection interpretation of polymorphism.<<ETX>>

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

[2]  John C. Reynolds,et al.  Using category theory to design implicit conversions and generic operators , 1980, Semantics-Directed Compiler Generation.

[3]  J. Hyland.  The Effective Topos , 1982 .

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

[5]  Luca Cardelli,et al.  A Semantics of Multiple Inheritance , 1984, Inf. Comput..

[6]  John C. Mitchell,et al.  Semantic Models for Second-Order Lambda Calculus , 1984, FOCS.

[7]  Thierry Coquand,et al.  Constructions: A Higher Order Proof System for Mechanizing Mathematics , 1985, European Conference on Computer Algebra.

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

[9]  Craig Schaffert,et al.  An introduction to Trellis/Owl , 1986, OOPLSA '86.

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

[11]  Alan Snyder.  Encapsulation and inheritance in object-oriented programming languages , 1986, OOPSLA 1986.

[12]  Bjarne Stroustrup,et al.  C++ Programming Language , 1986, IEEE Softw..

[13]  Andrew M. Pitts,et al.  The theory of constructions: Categorical semantics and topos-theoretic models , 1987 .

[14]  R. A. G. Seely,et al.  Categorical semantics for higher order polymorphic lambda calculus , 1987, Journal of Symbolic Logic.

[15]  Richard Statman,et al.  Empty types in polymorphic lambda calculus , 1987, POPL '87.

[16]  Andre Scedrov,et al.  A Categorical Approach to Realizability and Polymorphic Types , 1987, MFPS.

[17]  Kim B. Bruce,et al.  An Algebraic Model of Subtype and Inheritance , 1990, DBPL.

[18]  Andrew M. Pitts,et al.  Polymorphism is Set Theoretic, Constructively , 1987, Category Theory and Computer Science.

[19]  D. van Dalen,et al.  A SMALL COMPLETE CATEGORY , 1988 .

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

[21]  Thierry Coquand,et al.  INHERITANCE AND EXPLICIT COERCION (Preliminary Report) , 1989, LICS 1989.

[22]  John C. Mitchell,et al.  F-bounded quantification for object-oriented programming , 1989 .

[23]  Luca Cardelli,et al.  A semantic basis for quest , 1990, Journal of Functional Programming.

[24]  J. Hyland,et al.  The Discrete Objects in the Effective Topos , 1990 .

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