 | 2011 |
|---|
| 13 |       | Paulin Jacobé de Naurois,
Virgile Mogbil:
Correctness of linear logic proof structures is NL-complete.
Theor. Comput. Sci. 412(20): 1941-1957 (2011) |
| 2010 |
|---|
| 12 | | Patrick Baillot,
Marco Gaboardi,
Virgile Mogbil:
A PolyTime Functional Language from Light Linear Logic.
ESOP 2010: 104-124 |
| 11 | | Paulin Jacobé de Naurois,
Virgile Mogbil:
Rewriting Systems for Reachability in Vector Addition Systems with Pairs.
RP 2010: 133-145 |
| 2009 |
|---|
| 10 | | Virgile Mogbil:
Non-deterministic Boolean Proof Nets.
FOPARA 2009: 131-145 |
| 2008 |
|---|
| 9 | | Paulin Jacobé de Naurois,
Virgile Mogbil:
Correctness of Multiplicative Additive Proof Structures is NL-Complete.
LICS 2008: 476-485 |
| 8 | | Christophe Fouqueré,
Virgile Mogbil:
Rewritings for Polarized Multiplicative and Exponential Proof Structures.
Electr. Notes Theor. Comput. Sci. 203(1): 109-121 (2008) |
| 2007 |
|---|
| 7 | | Paulin Jacobé de Naurois,
Virgile Mogbil:
Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete.
CSL 2007: 435-450 |
| 6 | | Virgile Mogbil,
Vincent Rahli:
Uniform Circuits, & Boolean Proof Nets.
LFCS 2007: 401-421 |
| 2004 |
|---|
| 5 | | Patrick Baillot,
Virgile Mogbil:
Soft lambda-Calculus: A Language for Polynomial Time Computation.
FoSSaCS 2004: 27-41 |
| 4 | | Christophe Fouqueré,
Virgile Mogbil:
Modules and Logic Programming
CoRR cs.LO/0411029: (2004) |
| 2003 |
|---|
| 3 | | Patrick Baillot,
Virgile Mogbil:
Soft lambda-calculus: a language for polynomial time computation
CoRR cs.LO/0312015: (2003) |
| 2001 |
|---|
| 2 | | Virgile Mogbil:
Quadratic Correctness Criterion for Non-commutative Logic.
CSL 2001: 69-83 |
| 1 | | Thomas Krantz,
Virgile Mogbil:
Encoding Hamiltonian circuits into multiplicative linear logic.
Theor. Comput. Sci. 266(1-2): 987-996 (2001) |
Data released under the ODC-BY 1.0 license — See also our legal information page