Logic in Computer Science (LICS 1988)

Paper: A modest model of records, inheritance and bounded quantification (at LICS 1988)

Authors: Kim B. Bruce Giuseppe Longo

Abstract

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 ω-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

BibTeX

  @InProceedings{BruceLongo-Amodestmodelofrecor,
    author = 	 {Kim B. Bruce and Giuseppe Longo},
    title = 	 {A modest model of records, inheritance and bounded quantification },
    booktitle =  {Proceedings of the Third Annual IEEE Symp. on Logic in Computer Science, {LICS} 1988},
    year =	 1988,
    editor =	 {Yuri Gurevich},
    month =	 {July}, 
    pages =      {38--50},
    location =   {Edinburgh, Scotland, UK}, 
    publisher =	 {IEEE Computer Society Press}
  }