Term Sequent Logic

We consider a term sequent logic for the lambda-calculus. Term sequents are a judgement form similar to the logical judgement form of entailment between sentences, but denoting equality or reducibility between terms. Using term sequents, it is possible to treat lambda-terms almost like logical sentences, and to use proof-theoretic methods to establish their properties. We prove a cut-elimination result for untyped lambda-calculus and describe how this generalises the usual confluence result. We give a notion of uniform proof for lambda-terms, and suggest how this can be viewed as a mixed logic-programming/functional programming framework with the ability to assume arbitrary reductions. Finally, we discuss related and future work.

[1]  Peter W. O'Hearn,et al.  The Logic of Bunched Implications , 1999, Bulletin of Symbolic Logic.

[2]  Dale Miller,et al.  A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..

[3]  Ian Hacking,et al.  What is logic , 1979 .

[4]  Tobias Nipkow,et al.  Term Rewriting and All That by Franz Baader , 1998 .

[5]  Dale Miller,et al.  Logic programming in a fragment of intuitionistic linear logic , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[6]  J. Meseguer,et al.  Rewriting Logic as a Logical and Semantic Framework , 1996 .

[7]  Claude Kirchner,et al.  Deduction versus Computation: The Case of Induction , 2002, AISC.

[8]  Murdoch James Gabbay,et al.  a-Logic With Arrows , 2008, WFLP@RDP.

[9]  Andrew M. Pitts,et al.  A New Approach to Abstract Syntax with Variable Binding , 2002, Formal Aspects of Computing.

[10]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[11]  Simon Kaplan,et al.  Conditional Term Rewriting Systems , 1987, Lecture Notes in Computer Science.

[12]  Gilles Dowek,et al.  Arithmetic as a Theory Modulo , 2005, RTA.