Non deterministic classical logic: the $\lambda\mu^{++}$-calculus

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200204)48:3<357::AID-MALQ357>3.0.CO;2-L" /><357::AID-MALQ357>3.0.CO;2-L 10.1002/1521-3870(200204)48:3<357::AID-MALQ357>3.0.CO;2-LzbMath0997.03015arXiv0905.0456MaRDI QIDQ4530146

Karim Nour

Publication date: 13 November 2002

Full work available at URL: https://arxiv.org/abs/0905.0456

zbMATH Keywords

confluencestrong normalizationdata typessubject reductionextension of \(\lambda\mu\)-calculusnondeterministic classical logicparallel-or

Mathematics Subject Classification ID

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

Related Items (2)

Normalization in the simply typed -calculus ⋮ Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Non deterministic classical logic: the $\lambda\mu^{++}$-calculus