Simplified Reducibility Proofs of Church-Rosser for β- and βη-reduction
From MaRDI portal
Publication:5178963
DOI10.1016/j.entcs.2009.07.050zbMath1311.03030MaRDI QIDQ5178963
Vincent Rahli, Fairouz Kamareddine
Publication date: 18 March 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2009.07.050
03B40: Combinatory logic and lambda calculus
Related Items
Uses Software
Cites Work
- The lambda calculus. Its syntax and semantics. Rev. ed.
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- Church-Rosser theorem for typed functional systems
- Reductions of Residuals are Finite
- Reducibility Proofs in the λ-Calculus
- Intensional interpretations of functionals of finite type I
- Some Properties of Conversion
- A formulation of the simple theory of types
- On the interpretation of intuitionistic number theory
- Parallel reductions in \(\lambda\)-calculus
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item