The following pages link to Virgile Mogbil (Q236817):
Displayed 12 items.
- Correctness of linear logic proof structures is NL-complete (Q534703) (← links)
- An interpretation of CCS into ludics (Q2333316) (← links)
- Rewritings for Polarized Multiplicative and Exponential Proof Structures (Q2870318) (← links)
- Proofs as Executions (Q2915176) (← links)
- A PolyTime Functional Language from Light Linear Logic (Q3558218) (← links)
- Rewriting Systems for Reachability in Vector Addition Systems with Pairs (Q3584966) (← links)
- Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete (Q3608429) (← links)
- (Q4783302) (← links)
- Foundations of Software Science and Computation Structures (Q5308440) (← links)
- Uniform Circuits, & Boolean Proof Nets (Q5434522) (← links)
- Non-deterministic Boolean Proof Nets (Q5747635) (← links)
- Encoding Hamiltonian circuits into multiplicative linear logic (Q5958784) (← links)