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

DOI10.1002/1521-3870(200204)48:3%3C357::AID-MALQ357%3E3.0.CO;2-LMaRDI QIDQ4530146zbMATH OpenFDO

Authors Karim Nour

Publication date 13 November 2002

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

zbMATH Keywords

confluencedata typesextension of \(\lambda\mu\)-calculusnondeterministic classical logicparallel-orstrong normalizationsubject reduction

Mathematics Subject Classification ID

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

Abstract: In this paper, we present an extension of $lambdamu$-calculus called $lambdam{u}^{++}$-calculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on data types. This calculus allows also to program the parallel-or.

Recommendations

• scientific article; zbMATH DE number 2038177
• scientific article; zbMATH DE number 2024631
• Non-clausal connection calculi for non-classical logics
• Multi-valued Calculi for Logics Based on Non-determinism
• A Note on Calculi for Non-deterministic Many-valued Logics
• Non-deterministic semantics for logics with a consistency operator
• Quantifier-free logic for nondeterministic theories
• Nondeterministic extensions of untyped \(\lambda\)-calculus
• Sequent calculus for classical logic probabilized
• Modal nonassociative Lambek calculus with assumptions: complexity and context-freeness

Cited in

(11)

• A lambda calculus for Gödel-Dummett logic capturing waitfreedom
• Classical proofs as parallel programs
• scientific article; zbMATH DE number 1222571 (Why is no real title available?)
• Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
• scientific article; zbMATH DE number 2038177 (Why is no real title available?)
• An estimation for the lengths of reduction sequences of the \(\lambda\mu\rho\theta\)-calculus
• Some properties of the \(\lambda\mu^{\wedge\vee}\)-calculus
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Normalization in the simply typed -calculus
• On the semantics of classical disjunction
• Resource approximation for the -calculus

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

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