Non deterministic classical logic: the λμ⁺⁺-calculus
classification
🧮 math.LO
keywords
calculuslambdadataallowscalledclassicalconfluencedeterministic
read the original abstract
In this paper, we present an extension of $\lambda\mu$-calculus called $\lambda\mu^{++}$-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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.