On the \(\lambda Y\) calculus

DOI10.1016/J.APAL.2004.04.004zbMath1068.03013OpenAlexW2078285934MaRDI QIDQ1886326

Richard Statman

Publication date: 18 November 2004

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2004.04.004

zbMATH Keywords

word problemdecidability\(\lambda\)-calculusBöhm treesregister machinesfixed-point operator\(Y\)-combinatorhigher-type fixed-point operatorsweak normalisability

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

Cites Work

• The lambda calculus, its syntax and semantics
• The IO- and OI-hierarchies
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Edinburgh LCF. A mechanized logic of computation
• Completeness, invariance and λ-definability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the \(\lambda Y\) calculus