An estimation for the lengths of reduction sequences of the -calculus

DOI10.23638/LMCS-14(2:17)2018MaRDI QIDQ4580321zbMATH OpenFDO

Authors Péter Battyányi, Karim Nour

Publication date 15 August 2018

Full work available at URL https://arxiv.org/abs/1703.05930

zbMATH Keywords

standardizationclassical logic\(\lambda\mu\)-calculuslength of reduction sequence

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Abstract: Since it was realized that the Curry-Howard isomorphism can be extended to the case of classical logic as well, several calculi have appeared as candidates for the encodings of proofs in classical logic. One of the most extensively studied among them is the $lambdamu$-calculus of Parigot. In this paper, based on the result of Xi presented for the $lambda$-calculus Xi, we give an upper bound for the lengths of the reduction sequences in the $lambdamu$-calculus extended with the $ho$- and $heta$-rules. Surprisingly, our results show that the new terms and the new rules do not add to the computational complexity of the calculus despite the fact that $mu$-abstraction is able to consume an unbounded number of arguments by virtue of the $mu$-rule.

Recommendations

• scientific article; zbMATH DE number 1222571
• The Maximum Length of Mu-Reduction in Lambda Mu-Calculus
• Reduction system for extensional lambda-mu calculus
• Non deterministic classical logic: the $\lambda\mu^{++}$-calculus
• Some properties of the \(\lambda\mu^{\wedge\vee}\)-calculus

Cites work

• scientific article; zbMATH DE number 1722654 (Why is no real title available?)
• scientific article; zbMATH DE number 3961577 (Why is no real title available?)
• scientific article; zbMATH DE number 1324438 (Why is no real title available?)
• scientific article; zbMATH DE number 1337625 (Why is no real title available?)
• scientific article; zbMATH DE number 517083 (Why is no real title available?)
• scientific article; zbMATH DE number 1456954 (Why is no real title available?)
• A symmetric lambda calculus for classical program extraction
• An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types
• An environment machine for the λμ-calculus
• Arithmetical proofs of strong normalization results for symmetric lambda calculi
• Classical logic, storage operators and second-order lambda-calculus
• Intensional interpretations of functionals of finite type I
• Lambda-calcul, évaluation paresseuse et mise en mémoire
• Normalization without reducibility
• Proofs of strong normalisation for second order classical natural deduction
• The cost of usage in the \(\lambda\)-calculus
• Typed Lambda Calculi and Applications
• Upper bounds for standardizations and an application
• Why the usual candidates of reducibility do not work for the symmetric \(\lambda\mu\)-calculus

Cited in

(4)

• Reduction rules for intuitionistic \(\lambda\rho\)-calculus
• The Maximum Length of Mu-Reduction in Lambda Mu-Calculus
• An encoding of the \(\lambda \)-calculus in the string MultiSet rewriting calculus
• scientific article; zbMATH DE number 7155170 (Why is no real title available?)

This page was built for publication: An estimation for the lengths of reduction sequences of the \(\lambda\mu\rho\theta\)-calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580321)