Non deterministic classical logic: the $\lambda\mu^{++}$-calculus
Logic
2009-05-05 v1
Abstract
In this paper, we present an extension of -calculus called -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.
Cite
@article{arxiv.0905.0456,
title = {Non deterministic classical logic: the $\lambda\mu^{++}$-calculus},
author = {Karim Nour},
journal= {arXiv preprint arXiv:0905.0456},
year = {2009}
}