首页 | 本学科首页   官方微博 | 高级检索  
     


On polymorphic types of untyped terms
Authors:Rick Statman
Affiliation:Carnegie Mellon University, Department of Mathematical Sciences, Pittsburgh, PA 15213, United States
Abstract:Let S be a finite set of β normal closed terms and M and N a pair of β normal, η   distinct, closed terms. Then there exist polymorphic types a,ba,b such that every member of S can be typed as a, and M and N have η expansions which can be typed as b; where, in the resulting typings, the members of S can be simultaneously consistently identified, and the η expansions of M and N are βη inconsistent (no model with more than one element of any type). A similar result holds in the presence of surjective pairing.
Keywords:Lambda calculus   Lambda calculus with surjective pairing   Polymorphic typings    hm's theorem
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号