An algebraic view of the Böhm-out technique

DOI10.1016/S0304-3975(98)00142-XzbMath0913.68033OpenAlexW1994780573MaRDI QIDQ1275631

Adolfo Piperno

Publication date: 12 January 1999

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00142-x

zbMATH Keywords

separabilityBöhm treeslambda-calculuscombinatory equations

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• A discrimination algorithm inside \(\lambda -\beta\)-calculus
• An analysis of Böhm's theorem
• Head linear reduction and pure proof net extraction
• REGULAR SYSTEMS OF EQUATIONS IN λ-CALCULUS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algebraic view of the Böhm-out technique