Title :
Semantic parametricity in polymorphic lambda calculus
Author :
Freyd, P.J. ; Girard, J.-Y. ; Scedrov, A. ; Scott, P.J.
Author_Institution :
Dept. of Math., Paris VII Univ., France
Abstract :
A semantic condition necessary for the parametricity of polymorphic functions is considered. One of its instances is the stability condition for elements of variable type in the coherent domains semantics. A larger setting is presented that does not use retract pairs and keeps intact a basic feature of a certain function-type constructor. Polymorphic lambda terms are semantically parametric because of normalization.<>
Keywords :
data structures; formal logic; coherent domains semantics; function-type constructor; parametricity; polymorphic functions; polymorphic lambda calculus; semantically parametric; stability condition; typed programming languages; variable type; Calculus; Context modeling; Equations; Formal languages; Logic programming; Stability;
Conference_Titel :
Logic in Computer Science, 1988. LICS '88., Proceedings of the Third Annual Symposium on
Conference_Location :
Edinburgh, UK
Print_ISBN :
0-8186-0853-6
DOI :
10.1109/LICS.1988.5126
