The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II.

DOI10.1016/j.tcs.2016.12.016zbMath1418.03040OpenAlexW4205574221MaRDI QIDQ505454

Jonathan P. Seldin

Publication date: 23 January 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.12.016

zbMATH Keywords

normal form\(\lambda\)-calculusabstractioncombinatory logic\(\beta \eta\)-reduction\(\beta\)-reductionirreducible terms

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction
• Une nouvelle C\(\beta\)-réduction dans la logique combinatoire
• The lambda calculus. Its syntax and semantics. Rev. ed.
• On pseudo-c\(\beta\) normal form in combinatory logic
• Lambda-calculus terms that reduce to themselves
• Combinatory logic. Vol. II
• Combinatory Reductions and Lambda Reductions Compared
• The Undecidability of λK-Conversion

This page was built for publication: The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II.