An analysis of Böhm's theorem

DOI10.1016/0304-3975(93)90087-AzbMath0794.03022MaRDI QIDQ1314351

Gérard Huet

Publication date: 28 August 1994

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

zbMATH Keywords

\(\lambda\)-calculusseparability theorem

Mathematics Subject Classification ID

Theory of programming languages (68N15) Combinatory logic and lambda calculus (03B40)

Related Items (5)

Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus ⋮ From Böhm's Theorem to Observational Equivalences ⋮ A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi ⋮ An algebraic view of the Böhm-out technique ⋮ SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi ★

Uses Software

• ML
• Caml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On sets of solutions to combinator equations
• The lambda calculus, its syntax and semantics
• Characterization of normal forms possessing inverse in the \(\lambda\)- \(\beta\)-\(\eta\)-calculus
• A discrimination algorithm inside \(\lambda -\beta\)-calculus
• REGULAR SYSTEMS OF EQUATIONS IN λ-CALCULUS

This page was built for publication: An analysis of Böhm's theorem