Non determinism through type isomorphism - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Non determinism through type isomorphism


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.

Dates and versions

hal-00925001 , version 1 (07-01-2014)



Alejandro Díaz-Caro, Gilles Dowek. Non determinism through type isomorphism. LSFA - 7th Workshop on Logical and Semantic Frameworks with Applications - 2012, Sep 2012, Rio de Janeiro, Brazil. pp.137-144, ⟨10.4204/EPTCS.113.13⟩. ⟨hal-00925001⟩
119 View
0 Download



Gmail Facebook Twitter LinkedIn More