About systems of equations, X-separability, and left-invertibility in the \(\lambda\)-calculus

DOI10.1016/0890-5401(91)90057-9zbMath0716.03003OpenAlexW2031304364MaRDI QIDQ752684

Corrado Böhm, Enrico Tronci

Publication date: 1991

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(91)90057-9

zbMATH Keywords

solvability of systems of equations in lambda calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (2)

Equational programming in \(\lambda\)-calculus via SL-systems. Part 1 ⋮ Equational programming in \(\lambda\)-calculus via SL-systems. Part 2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatory logic. With two sections by William Craig.
• Invertible terms in the lambda calculus
• Characterization of normal forms possessing inverse in the \(\lambda\)- \(\beta\)-\(\eta\)-calculus
• A discrimination algorithm inside \(\lambda -\beta\)-calculus

This page was built for publication: About systems of equations, X-separability, and left-invertibility in the \(\lambda\)-calculus