Abstract : We consider intuitionistic fragments of multiplicative linear logic for which we define appropriate notions of proof-nets. These are based on a correctness criterion that consists of decorating the nodes of a proof-structure with monoidal terms that must obey constraints reminiscent of phase semantics.
https://hal.inria.fr/inria-00098817
Contributor : Publications Loria
<>
Submitted on : Tuesday, September 26, 2006 - 8:38:49 AM
Last modification on : Friday, April 12, 2019 - 10:18:09 AM
Philippe de Groote. An algebraic correctness criterion for intuitionistic multiplicative proof-nets. Theoretical Computer Science, Elsevier, 1999, 224 (1-2), pp.115-134. ⟨inria-00098817⟩
