Standardization and Böhm trees for -calculus

DOI10.1007/978-3-642-12251-4_11MaRDI QIDQ3558334zbMATH OpenOpenAlexFDO

Authors Alexis Saurin

Publication date 4 May 2010

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12251-4_11

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(7)

• The approximation theorem for the \(\Lambda_{\mu}\)-calculus
• Reduction system for extensional lambda-mu calculus
• Strong reduction of combinatory calculus with streams
• Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
• \(\lambda\mu\)-calculus and Böhm's theorem
• Typing streams in the \({\Lambda}{\mu}\)-calculus
• Resource approximation for the \(\lambda \mu \)-calculus

This page was built for publication: Standardization and Böhm trees for \(\Lambda \mu \)-calculus

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