λμ-calculus and Böhm's theorem
From MaRDI portal
Publication:2732290
DOI10.2307/2694930zbMath0981.03019MaRDI QIDQ2732290
Publication date: 11 March 2002
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2694930
03B40: Combinatory logic and lambda calculus
Related Items
Unnamed Item, The approximation theorem for the Λμ-calculus, Call-by-name extensionality and confluence, Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus, Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus, The relational model is injective for multiplicative exponential linear logic (without weakenings), A type-theoretic foundation of delimited continuations, Polarized proof-nets and \(\lambda \mu\)-calculus, Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus, The differential \(\lambda \mu\)-calculus, Classical Call-by-Need and Duality, A Filter Model for the λμ-Calculus, A Complete, Co-inductive Syntactic Theory of Sequential Control and State, An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
Cites Work