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


The Weak Normalization of the Simply Typed {lambda}se-calculus
Authors:Arbiser, Ariel   Kamareddine, Fairouz   Rios, Alejandro
Affiliation:Department of Computer Science, University of Buenos Aires, Pabellón I - Ciudad Universitaria (1428) Buenos Aires, Argentina. E-mail: arbiser{at}dc.uba.ar
Abstract:In this paper, we show the weak normalization (WN) of the simply-typed{lambda}se-calculus with open terms where abstractions are decoratedwith types, and metavariables, de Bruijn indices and updatingoperators are decorated with environments. We show a proof ofWN using the {lambda}{omega}e-calculus, a calculus isomorphic to Formula. This proof is strongly influenced by Goubault-Larrecq'sproof of WN for the {lambda} {sigma}-calculus but with subtle differences whichshow that the two styles require different attention. Furthermore,we give a new calculus {lambda} {omega}'e which works like {lambda}se but which iscloser to {lambda} {sigma} than {lambda}{omega}e. For both {lambda}{omega}e and {lambda} {omega}'e we prove WN for typedsemi-open terms (i.e. those which allow term variables but nosubstitution variables), unlike the result of Goubault-Larrecqwhich covered all {lambda} {sigma} open terms.
Keywords:lambda calculus    explicit substitution    weak normalization    simple typing
本文献已被 Oxford 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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