Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus

DOI10.1016/j.tcs.2012.02.027zbMath1244.68027OpenAlexW2044279448MaRDI QIDQ428894

Alexis Saurin

Publication date: 25 June 2012

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.027

zbMATH Keywords

Böhm treesseparation property(delimited) control\(\lambda \mu \)-calculusBöhm theoremclassical \(\lambda \)-calculiinfinitary \(\lambda \)-calculusshift/resetstreams

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (3)

Normalization in the simply typed -calculus ⋮ Normalization proofs for the un-typed \(\mu\mu^\prime\)-calculus ⋮ The approximation theorem for the Λμ-calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A syntactic theory of sequential control
• Infinite \(\lambda\)-calculus and types
• Definitional interpreters for higher-order programming languages
• An analysis of Böhm's theorem
• Infinitary lambda calculus
• Infinitary lambda calculus and discrimination of Berarducci trees.
• A symmetric lambda calculus for classical program extraction
• Locus Solum: From the rules of logic to the logic of rules
• λμ-calculus and Böhm's theorem
• The duality of computation
• Typing streams in the Λμ-calculus
• An approach to call-by-name delimited continuations
• λ-definable functionals andβη conversion
• On the Relations between the Syntactic Theories of λμ-Calculi
• A Hierarchy for Delimited Continuations in Call-by-Name
• Standardization and Böhm Trees for Λμ-Calculus
• A new constructive logic: classic logic
• An environment machine for the λμ-calculus
• Representing Control: a Study of the CPS Transformation
• Proofs of strong normalisation for second order classical natural deduction
• Non deterministic classical logic: the $\lambda\mu^{++}$-calculus
• The Typed Böhm Theorem
• Infinitary lambda calculi and böhm models
• Correspondence between ALGOL 60 and Church's Lambda-notation

This page was built for publication: Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus