An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types

DOI10.1007/978-3-540-73228-0_8zbMath1215.03022arXiv0905.1032OpenAlexW1578684710MaRDI QIDQ3612624

René David, Karim Nour

Publication date: 10 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Strong normalization results by translation ⋮ An estimation for the lengths of reduction sequences of the $\lambda\mu\rho\theta$-calculus

This page was built for publication: An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types