Paper: Type inference and logical relations (at LICS 1986)

Authors: Mario Coppo Maddalena Zacchi

Abstract

In this paper a new notion of type semantics for a type inference system with recursive and polymorphic types is introduced. Types are interpreted as (binary) relations over a type-free model and satisfy a sort of "representation independence" theorem (in the sense of Reynolds (1983)). The notion of types as subsets (and, in particular, that of types as ideals) is obtained as a particular case.

BibTeX

  @InProceedings{CoppoZacchi-Typeinferenceandlog,
    author = 	 {Mario Coppo and Maddalena Zacchi},
    title = 	 {Type inference and logical relations},
    booktitle =  {Proceedings of the First Annual IEEE Symposium on Logic in Computer Science (LICS 1986)},
    year =	 {1986},
    month =	 {June}, 
    pages =      {218--226},
    location =   {Cambridge, MA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }