The Typed Böhm Theorem

DOI10.1016/S1571-0661(04)00168-9zbMath1261.03075OpenAlexW2079012769MaRDI QIDQ4916173

Kosta Došen, Zoran Petrić

Publication date: 19 April 2013

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

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)00168-9

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (3)

Weak typed Böhm theorem on IMLL ⋮ Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus ⋮ The relational model is injective for multiplicative exponential linear logic (without weakenings)

Cites Work

• The lambda calculus, its syntax and semantics
• The category of finite sets and Cartesian closed categories
• Combinatory logic. Vol. II
• λ-definable functionals andβη conversion
• Completeness, invariance and λ-definability
• Definierbare Funktionen imλ-Kalkül mit Typen
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Typed Böhm Theorem