An algebraic correctness criterion for intuitionistic multiplicative proof-nets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 1999

An algebraic correctness criterion for intuitionistic multiplicative proof-nets

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.

Keywords

Domains

Other [cs.OH]

Dates and versions

inria-00098817 , version 1 (26-09-2006)

Identifiers

Cite

Philippe de Groote. An algebraic correctness criterion for intuitionistic multiplicative proof-nets. Theoretical Computer Science, 1999, 224 (1-2), pp.115-134. ⟨10.1016/S0304-3975(98)00309-0⟩. ⟨inria-00098817⟩
39 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More