Title :
Faithful ideal models for recursive polymorphic types
Author :
Abadi, Martin ; Pierce, Benjamin ; Plotkin, Gordon
Author_Institution :
Digital Equipment Corp., Palo Alto, CA, USA
Abstract :
Ideal models are explored for a programming language with recursive polymorphic types, variants of the model studied by D. MacQueen et al. (Inf. Control, vol.71, pp.95-130, 1986). The use of suitable ideals yields a close fit between models and programming language. Two of the authors´ semantics of type expressions are faithfully, in the sense that programs that behave identically in all contexts have exactly the same types
Keywords :
data structures; formal languages; formal logic; MacQueen; close fit; faithful ideal models; programming language; recursive polymorphic types; semantics; type expressions; Calculus; Computer languages; Computer science; Equations; Mathematical model;
Conference_Titel :
Logic in Computer Science, 1989. LICS '89, Proceedings., Fourth Annual Symposium on
Conference_Location :
Pacific Grove, CA
Print_ISBN :
0-8186-1954-6
DOI :
10.1109/LICS.1989.39176
