Abstract
Variants of Herbelin’s λ-calculus, here collectively named Herbelin calculi, have proved useful both in foundational studies and as internal languages for the efficient representation of λ-terms.
An obvious requirement of both these two kinds of applications is a clear understanding of the relationship between cut-elimination in Herbelin calculi and normalisation in the λ-calculus. However, this understanding is not complete so far. Our previous work showed that λ is isomorphic to a Herbelin calculus, here named λP,only admitting cuts that are both left- and right-permuted. In this paper we consider a generalisation λPh admitting any kind of right-permuted cut.
We show that there is a natural deduction system λNh which conservatively extends I and is isomorphic to λPh. The idea is to build in the natural deduction system a distinction between applicative term and application, together with a distinction between head and tail application. This is suggested by examining how natural deduction proofs are mapped to sequent calculus derivations according to a translation due to Prawitz.
In addition to β, λNh includes a reduction rule that mirrors left permutation of cuts, but without performing any append of lists/spines.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H.P. Barendregt. The Lambda Calculus. North-Holland, 1984.
I. Cervesato and F. Pfenning. A linear spine calculus. Technical Report CMU-CS-97-125, Department of Computer Science, Carnegie Mellon University, 1997.
V. Danos, J-B. Joinet, and H. Schellinx. A new deconstructive logic: linear logic. The Journal of Symbolic Logic, 62(2):755–807, 1997.
R. Dyckhoff and L. Pinto. Cut-elimination and a permutation-free sequent calculus for intuitionistic logic. Studia Logica, 60:107–118, 1998.
R. Dyckhoff and L. Pinto. Permutability of proofs in intuitionistic sequent calculi. Theoretical Computer Science, 212:141–155, 1999.
J. Espírito Santo. Revisiting the correspondence between cut-elimination and normalisation. In Proceedings of ICALP’2000, volume 1853 of Lecture Notes in Computer Science. Springer-Verlag, 2000.
J. Espírito Santo. Conservative extensions of the λ-calculus for the computational interpretation of sequent calculus. PhD thesis, University of Edinburgh, 2002.
G. Gentzen. Investigations into logical deduction. In M. E. Szabo, editor, The collected papers of Gerhard Gentzen. North Holland, 1969.
H. Herbelin. A λ-calculus structure isomorphic to a Gentzen-style sequent calculus structure. In L. Pacholski and J. Tiuryn, editors, Proceedings of CSL’94, volume 933 of Lecture Notes in Computer Science, pages 61–75. Springer-Verlag, 1995.
G. Mints. Normal forms for sequent derivations. In P. Odifreddi, editor, Kreiseliana, pages 469–492. A. K. Peters, Wellesley, Massachusetts, 1996.
D. Prawitz. Natural Deduction. A Proof-Theoretical Study. Almquist and Wiksell0, Stockholm, 1965.
H. Schwichtenberg. Termination of permutative conversions in intuitionistic Gentzen calculi. Theoretical Computer Science, 212, 1999.
A. Troelstra and H. Schwitchtenberg. Basic Proof Theory. Cambridge University Press, second edition, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Santo, J.E. (2002). An Isomorphism between a Fragment of Sequent Calculus and an Extension of Natural Deduction. In: Baaz, M., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2002. Lecture Notes in Computer Science(), vol 2514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36078-6_24
Download citation
DOI: https://doi.org/10.1007/3-540-36078-6_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00010-5
Online ISBN: 978-3-540-36078-0
eBook Packages: Springer Book Archive