default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVirgile Mogbil
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2001
[b1]Virgile Mogbil:
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). University of the Mediterranean, Marseille, France, 2001
Journal Articles
- 2011
- [j2]Paulin Jacobé de Naurois, Virgile Mogbil:
Correctness of linear logic proof structures is NL-complete. Theor. Comput. Sci. 412(20): 1941-1957 (2011) - 2001
- [j1]Thomas Krantz, Virgile Mogbil:
Encoding Hamiltonian circuits into multiplicative linear logic. Theor. Comput. Sci. 266(1-2): 987-996 (2001)
Conference and Workshop Papers
- 2017
- [c11]Stefano Del Vecchio, Virgile Mogbil:
An Interpretation of CCS into Ludics. LSFA 2017: 97-114 - 2012
- [c10]Emmanuel Beffara, Virgile Mogbil:
Proofs as Executions. IFIP TCS 2012: 280-294 - 2010
- [c9]Patrick Baillot, Marco Gaboardi, Virgile Mogbil:
A PolyTime Functional Language from Light Linear Logic. ESOP 2010: 104-124 - [c8]Paulin Jacobé de Naurois, Virgile Mogbil:
Rewriting Systems for Reachability in Vector Addition Systems with Pairs. RP 2010: 133-145 - 2009
- [c7]Virgile Mogbil:
Non-deterministic Boolean Proof Nets. FOPARA 2009: 131-145 - 2008
- [c6]Paulin Jacobé de Naurois, Virgile Mogbil:
Correctness of Multiplicative Additive Proof Structures is NL-Complete. LICS 2008: 476-485 - 2007
- [c5]Paulin Jacobé de Naurois, Virgile Mogbil:
Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete. CSL 2007: 435-450 - [c4]Virgile Mogbil, Vincent Rahli:
Uniform Circuits, & Boolean Proof Nets. LFCS 2007: 401-421 - [c3]Christophe Fouqueré, Virgile Mogbil:
Rewritings for Polarized Multiplicative and Exponential Proof Structures. TERMGRAPH@ETAPS 2007: 109-121 - 2004
- [c2]Patrick Baillot, Virgile Mogbil:
Soft lambda-Calculus: A Language for Polynomial Time Computation. FoSSaCS 2004: 27-41 - 2001
- [c1]Virgile Mogbil:
Quadratic Correctness Criterion for Non-commutative Logic. CSL 2001: 69-83
Informal and Other Publications
- 2004
- [i2]Christophe Fouqueré, Virgile Mogbil:
Modules and Logic Programming. CoRR cs.LO/0411029 (2004) - 2003
- [i1]Patrick Baillot, Virgile Mogbil:
Soft lambda-calculus: a language for polynomial time computation. CoRR cs.LO/0312015 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
