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

DOI10.1007/978-3-540-87531-4_13zbMath1156.03317OpenAlexW56376262MaRDI QIDQ3540177

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

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

Related Items (6)

Normalization in the simply typed -calculus ⋮ Adding Negation to Lambda Mu ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus ⋮ A Filter Model for the λμ-Calculus ⋮ The approximation theorem for the Λμ-calculus

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