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

DOI10.1016/J.TCS.2012.02.027MaRDI QIDQ428894zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Standardization and Böhm trees for \(\Lambda \mu \)-calculus
• \(\lambda\mu\)-calculus and Böhm's theorem
• The untyped stack calculus and Böhm's theorem
• Typing streams in the \({\Lambda}{\mu}\)-calculus
• On the Relations between the Syntactic Theories of λμ-Calculi

Cites work

• scientific article; zbMATH DE number 3730111 (Why is no real title available?)
• scientific article; zbMATH DE number 46869 (Why is no real title available?)
• scientific article; zbMATH DE number 1324438 (Why is no real title available?)
• scientific article; zbMATH DE number 1330448 (Why is no real title available?)
• scientific article; zbMATH DE number 1337625 (Why is no real title available?)
• scientific article; zbMATH DE number 482822 (Why is no real title available?)
• scientific article; zbMATH DE number 2038761 (Why is no real title available?)
• scientific article; zbMATH DE number 1479632 (Why is no real title available?)
• scientific article; zbMATH DE number 937379 (Why is no real title available?)
• A hierarchy for delimited continuations in call-by-name
• A new constructive logic: classic logic
• A symmetric lambda calculus for classical program extraction
• A syntactic theory of sequential control
• An analysis of Böhm's theorem
• An approach to call-by-name delimited continuations
• An environment machine for the λμ-calculus
• Correspondence between ALGOL 60 and Church's Lambda-notation
• Definitional interpreters for higher-order programming languages
• Infinitary lambda calculi and böhm models
• Infinitary lambda calculus
• Infinitary lambda calculus and discrimination of Berarducci trees.
• Infinite \(\lambda\)-calculus and types
• Locus solum: From the rules of logic to the logic of rules.
• Non deterministic classical logic: the $\lambda\mu^{++}$-calculus
• On the Relations between the Syntactic Theories of λμ-Calculi
• Parallel reduction in type free lambda/mu-calculus
• Proofs of strong normalisation for second order classical natural deduction
• Representing Control: a Study of the CPS Transformation
• Standardization and Böhm trees for \(\Lambda \mu \)-calculus
• The Typed Böhm Theorem
• The duality of computation
• The maximality of the typed lambda calculus and of cartesian closed categories
• Typing streams in the \({\Lambda}{\mu}\)-calculus
• \(\lambda\mu\)-calculus and Böhm's theorem
• λ-definable functionals andβη conversion

Cited in

(9)

• The approximation theorem for the \(\Lambda_{\mu}\)-calculus
• 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
• Standardization and Böhm trees for \(\Lambda \mu \)-calculus
• Normalization in the simply typed -calculus
• Resource approximation for the \(\lambda \mu \)-calculus
• The untyped stack calculus and Böhm's theorem
• Abstract Böhm trees

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)