An estimation for the lengths of reduction sequences of the $\lambda\mu\rho\theta$-calculus

DOI10.23638/LMCS-14(2:17)2018zbMath1453.03007arXiv1703.05930MaRDI QIDQ4580321

Péter Battyányi, Karim Nour

Publication date: 15 August 2018

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

zbMATH Keywords

classical logicstandardization\(\lambda\mu\)-calculuslength of reduction sequence

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items

Unnamed Item

Cites Work

• Classical logic, storage operators and second-order lambda-calculus
• Normalization without reducibility
• A symmetric lambda calculus for classical program extraction
• Why the usual candidates of reducibility do not work for the symmetric $\lambda\mu$-calculus
• Lambda-calcul, évaluation paresseuse et mise en mémoire
• Arithmetical proofs of strong normalization results for symmetric lambda calculi
• An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types
• An environment machine for the λμ-calculus
• Upper bounds for standardizations and an application
• Proofs of strong normalisation for second order classical natural deduction
• The Cost of Usage in the ?-Calculus
• Intensional interpretations of functionals of finite type I
• Typed Lambda Calculi and Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item