Böhm theorem and Böhm trees for the -calculus

DOI10.1016/J.TCS.2012.02.027zbMATH Open1244.68027OpenAlexW2044279448MaRDI QIDQ428894FDOQ428894

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

separation property(delimited) control\(\lambda \mu \)-calculusclassical \(\lambda \)-calculiinfinitary \(\lambda \)-calculusshift/resetstreamsBöhm treesBöhm theorem

Mathematics Subject Classification ID

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

Cites Work

• The maximality of the typed lambda calculus and of cartesian closed categories
• Title not available (Why is that?)
• Locus solum: From the rules of logic to the logic of rules.
• \(\lambda\mu\)-calculus and Böhm's theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new constructive logic: classic logic
• The duality of computation
• Title not available (Why is that?)
• Correspondence between ALGOL 60 and Church's Lambda-notation
• Title not available (Why is that?)
• 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
• Parallel reduction in type free lambda/mu-calculus
• 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
• An environment machine for the λμ-calculus
• Representing Control: a Study of the CPS Transformation
• Proofs of strong normalisation for second order classical natural deduction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non deterministic classical logic: the $\lambda\mu^{++}$-calculus
• The Typed Böhm Theorem
• Infinitary lambda calculi and böhm models

Cited In (7)

• Böhm trees as higher-order recursion schemes
• Normalization proofs for the un-typed \(\mu\mu^\prime\)-calculus
• \(\lambda\mu\)-calculus and Böhm's theorem
• Normalization in the simply typed -calculus
• Resource approximation for the \(\lambda \mu \)-calculus
• The approximation theorem for the Λμ-calculus
• Abstract Böhm trees

   Recommendations

• Standardization and Böhm trees for \(\Lambda \mu \)-calculus 👍 👎
• \(\lambda\mu\)-calculus and Böhm's theorem 👍 👎
• Title not available (Why is that?) 👍 👎
• Typing streams in the Λμ-calculus 👍 👎
• On the Relations between the Syntactic Theories of λμ-Calculi 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428894)