Non determinism through type isomorphism

Alejandro Díaz-Caro
Gilles Dowek

We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known non-deterministic and algebraic lambda-calculi.

In Delia Kesner and Petrucio Viana: Proceedings Seventh Workshop on Logical and Semantic Frameworks, with Applications (LSFA 2012), Rio de Janeiro, Brazil, September 29-30, 2012, Electronic Proceedings in Theoretical Computer Science 113, pp. 137–144.
Published: 28th March 2013.

ArXived at: http://dx.doi.org/10.4204/EPTCS.113.13 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org