Reduction system for extensional lambda-mu calculus

DOI10.1007/978-3-319-08918-8_24MaRDI QIDQ5170828zbMATH OpenOpenAlexFDO

Authors Koji Nakazawa, Tomoharu Nagai

Publication date 24 July 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08918-8_24

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• scientific article; zbMATH DE number 7340562
• Typing streams in the \({\Lambda}{\mu}\)-calculus
• The differential \(\lambda \mu\)-calculus
• Standardization and Böhm trees for -calculus
• On the Relations between the Syntactic Theories of λμ-Calculi

Cited in

(13)

• Strong reduction of combinatory calculus with streams
• Typing streams in the \({\Lambda}{\mu}\)-calculus
• On the Relations between the Syntactic Theories of λμ-Calculi
• Standardization and Böhm trees for -calculus
• scientific article; zbMATH DE number 32501 (Why is no real title available?)
• scientific article; zbMATH DE number 1303339 (Why is no real title available?)
• An estimation for the lengths of reduction sequences of the \(\lambda\mu\rho\theta\)-calculus
• Compositional Z: confluence proofs for permutative conversion
• Call-by-name extensionality and confluence
• The Maximum Length of Mu-Reduction in Lambda Mu-Calculus
• Z property for the shuffling calculus
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Adding Negation to Lambda Mu

This page was built for publication: Reduction system for extensional lambda-mu calculus

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