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


Investigation into Combinatory Systems with Dual Combinators
Authors:Bimbó   Katalin
Affiliation:(1) Automated Reasoning Group RSISE, The Australian National University, Building 115, Canberra, ACT, 0200, Australia
Abstract:Combinatory logic is known to be related to substructural logics. Algebraic considerations of the latter, in particular, algebraic considerations of two distinct implications (rarr, larr), led to the introduction of dual combinators in Dunn & Meyer 1997. Dual combinators are "mirror images" of the usual combinators and as such do not constitute an interesting subject of investigation by themselves. However, when combined with the usual combinators (e.g., in order to recover associativity in a sequent calculus), the whole system exhibits new features. A dual combinatory system with weak equality typically lacks the Church-Rosser property, and in general it is inconsistent. In many subsystems terms "unexpectedly" turn out to be weakly equivalent. The paper is a preliminary attempt to investigate some of these issues, as well as, briefly compare function application in symmetric lambda-calculus (cf. Barbanera & Berardi 1996) and dual combinatory logic.
Keywords:combinatory logic  dual combinators  Church-Rosser property  symmetric   /content/w5759n060l730473/xxlarge955.gif"   alt="  lambda"   align="  BASELINE"   BORDER="  0"  >-calculus  substructural logics
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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