Semantic parametricity in polymorphic lambda calculus Export

@proceedings{citeulike:315808, 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}, author = {Freyd, P. J. and Girard, J. Y. and Scedrov, A. and Scott, P. J.}, citeulike-article-id = {315808}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5126}, journal = {Logic in Computer Science, 1988. LICS '88., Proceedings of the Third Annual Symposium on}, keywords = {lambda-calculus, parametricity, polymorphism, types}, pages = {274--279}, posted-at = {2005-09-12 09:05:27}, priority = {3}, title = {Semantic parametricity in polymorphic lambda calculus}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5126}, year = {1988} }

TY - CONF ID - citeulike:315808 L3 - citeulike-article-id:315808 N2 - 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 JF - Logic in Computer Science, 1988. LICS '88., Proceedings of the Third Annual Symposium on EP - 279 TI - Semantic parametricity in polymorphic lambda calculus SP - 274 KW - lambda-calculus KW - parametricity KW - polymorphism KW - types AU - Freyd, PJ AU - Girard, JY AU - Scedrov, A AU - Scott, PJ PY - 1988/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5126 ER -