Skip to main content Accessibility help

A proof-theoretic treatment of λ-reduction with cut-elimination: λ-calculus as a logic programming language

  • Michael Gabbay (a1)


We build on an existing a term-sequent logic for the λ-calculus. We formulate a general sequent system that fully integrates αβη-reductions between untyped λ-terms into first order logic.

We prove a cut-elimination result and then offer an application of cut-elimination by giving a notion of uniform proof for λ-terms. We suggest how this allows us to view the calculus of untyped αβ-reductions as a logic programming language (as well as a functional programming language, as it is traditionally seen).



Hide All
[1]Baader, Franz and Nipkow, Tobias, Term rewriting and all that, Cambridge University Press, Great Britain, 1998.
[2]Beeson, Michael, Lambda logic, Second international joint conference on automated reasoning (IJCAR 2004), Lecture Notes in Computer Science, vol. 3097, Springer, Berlin, 2004, pp. 460474.
[3]Deplagne, Eric and Kirchner, Claude, Deduction versus computation: the case of induction, AISC and Calculemos joint international conferences, Lecture Notes in Artificial Intelligence, vol. 2385, Springer, Berlin, 2002, pp. 46.
[4]Dowek, Gilles and Werner, Benjamin, Arithmetic as a theory modulo, Term rewriting and applications, Lecture Notes in Comput. Sci., vol. 3467, Springer, Berlin, 2005, pp. 423437.
[5]Dummett, Michael, Elements of intuitionism, 1 ed., Clarendon Press, Oxford, 1977.
[6]Gabbay, Michael and Gabbay, Murdoch J., Term sequent logic, Proceedings of the 17th international workshop on functional and (constraint) logic programming (WFLP 2008), Electronic Notes in Theoretical Computer Science, vol. 246, 08 2009, pp. 87106.
[7]Gabbay, Murdoch J. and Gabbay, Michael J., A simple class of Kripke-style models in which logic and computation have equal standing, International conference on logic for programming artificial intelligence and reasoning (LPAR 2010) (Clarke, Edmund M. and Voronkov, Andrei, editors), Lecture Notes in Computer Science, vol. 6355, Springer, 2010, pp. 231254.
[8]Gabbay, Murdoch J. and Gabbay, Michael J., a-logic with arrows, Proceedings of the 16th international workshop on functional and (constraint) logic programming (WFLP 2007) (Echahed, Rachid, editor), 06 2007, pp. 4762.
[9]Hacking, Ian, What is logic?. The Journal of Philosophy, vol. 76 (1979), pp. 285319.
[10]Hindley, J. Roger and Seldin, Jonathan P., Lambda-calculus and combinators, an introduction, 2 ed., Cambridge University Press, Cambridge, 2008.
[11]Kaplan, Stephane and Jouannaud, Jean-Pierre (editors), Conditional term rewriting systems, Lecture Notes in Computer Science, vol. 308, Berlin, Springer-Verlag, 07 1988.
[12]Liang, Zhi An and Miller, Dale, Focusing and polarization in intuitionistic logic, Computer science logic, CSL 2007 (Duparc, Jacques and Henzinger, Thomas A., editors), Lecture Notes in Computer Science, vol. 4646, Springer, 2007, pp. 451465.
[13]Martí-Oliet, N. and Meseguer, J., Rewriting logic as a logical and semantic framework, Electronic notes in theoretical computer science (Meseguer, J., editor), vol. 4, Elsevier Science Publishers, 2000.
[14]Miller, Dale, A logic programming language with lambda-abstraction, function variables, and simple unification, Journal of Logic and Computation, vol. 1 (1991), no. 4, pp. 497536.
[15]Miller, Dale, Nadathur, Gopalan, Pfenning, Frank, and Scedrov, Andre, Uniform proofs as a foundation for logic programming, Technical report, Durham, NC, USA, 1991.
[16]O'Hearn, Peter W. and Pym, David J., The logic of bunched implications, The Bulletin of Symbolic Logic, vol. 5 (1999), no. 2, pp. 215244.
[17]Selinger, Peter, Order-incompleteness andfinite lambda reduction models, Theoretical Computer Science, vol. 309 (2003), no. 1, pp. 4363.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed