Virgile Mogbil

According to our database1, Virgile Mogbil authored at least 15 papers between 2001 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
An Interpretation of CCS into Ludics.
Proceedings of the 12th Workshop on Logical and Semantic Frameworks, with Applications, 2017

2012
Proofs as Executions.
Proceedings of the Theoretical Computer Science, 2012

2011
Correctness of linear logic proof structures is NL-complete.
Theor. Comput. Sci., 2011

2010
Rewriting Systems for Reachability in Vector Addition Systems with Pairs.
Proceedings of the Reachability Problems, 4th International Workshop, 2010

A PolyTime Functional Language from Light Linear Logic.
Proceedings of the Programming Languages and Systems, 2010

2009
Non-deterministic Boolean Proof Nets.
Proceedings of the Foundational and Practical Aspects of Resource Analysis, 2009

2008
Correctness of Multiplicative Additive Proof Structures is NL-Complete.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007
Rewritings for Polarized Multiplicative and Exponential Proof Structures.
Proceedings of the Fourth International Workshop on Computing with Terms and Graphs, 2007

Uniform Circuits, & Boolean Proof Nets.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

Correctness of Multiplicative (and Exponential) Proof Structures is <i>NL</i> -Complete.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2004
Modules and Logic Programming
CoRR, 2004

Soft lambda-Calculus: A Language for Polynomial Time Computation.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

2001
Sémantique des phases, réseaux de preuve et divers problèmes de décision en logique linéaire. (Phase semantics, proof nets and some decision problems in linear logic).
PhD thesis, 2001

Encoding Hamiltonian circuits into multiplicative linear logic.
Theor. Comput. Sci., 2001

Quadratic Correctness Criterion for Non-commutative Logic.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001


  Loading...