On the Relations between the Syntactic Theories of λμ-Calculi

DOI10.1007/978-3-540-87531-4_13MaRDI QIDQ3540177zbMATH OpenOpenAlexFDO

Authors Alexis Saurin

Publication date 20 November 2008

Published in Computer Science Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87531-4_13

zbMATH Keywords

confluencestrong normalizationtype systemsclassical \(\lambda \)-calculistreams\(\lambda \mu \)-calculi

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Functional programming and lambda calculus (68N18)

Recommendations

• The differential \(\lambda \mu\)-calculus
• Typed Lambda Calculi and Applications
• Term Rewriting and Applications
• Foundations of Software Science and Computation Structures
• Reduction system for extensional lambda-mu calculus

Cited in

(11)

• Adding Negation to Lambda Mu
• Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
• The approximation theorem for the \(\Lambda_{\mu}\)-calculus
• A Filter Model for the λμ-Calculus
• Reduction system for extensional lambda-mu calculus
• Why the usual candidates of reducibility do not work for the symmetric \(\lambda\mu\)-calculus
• Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
• De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case
• Standardization and Böhm trees for \(\Lambda \mu \)-calculus
• Normalization in the simply typed -calculus
• Exponentials as substitutions and the cost of cut elimination in linear logic

This page was built for publication: On the Relations between the Syntactic Theories of λμ-Calculi

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