Title :
A PER model of polymorphism and recursive types
Author :
Abadi, M. ; Plotkin, G.D.
Author_Institution :
Digital Equipment Corp., Palo Alto, CA, USA
Abstract :
A model of Reynold´s polymorphic lambda calculus is provided, which also allows the recursive definition of elements and types. The techniques uses a good class of partial equivalence relations (PERs) over a certain CPO. This allows the combination of inverse-limits for recursion and intersection for polymorphism
Keywords :
equivalence classes; formal languages; recursive functions; CPO; O-category; PER model; intersection; inverse-limits; partial equivalence relations; partial orders; polymorphic lambda calculus; polymorphism; recursion; recursive definition; recursive types; Buildings; Computer science; Equations; Logic;
Conference_Titel :
Logic in Computer Science, 1990. LICS '90, Proceedings., Fifth Annual IEEE Symposium on e
Conference_Location :
Philadelphia, PA
Print_ISBN :
0-8186-2073-0
DOI :
10.1109/LICS.1990.113761
