|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1 occurrences of 1 keywords
|
|
|
|
|
Results
Found 34 publication records. Showing 34 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Patrick Baillot, Paolo Coppola, Ugo Dal Lago |
Light logics and optimal reduction: Completeness and complexity.  |
Inf. Comput.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot |
Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy. |
APLAS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot, Damiano Mazza |
Linear logic by levels and bounded time complexity. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot (eds.) |
Proceedings International Workshop on Developments in Implicit Computational complExity |
DICE |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto M. Amadio, Patrick Baillot, Antoine Madet |
An affine-intuitionistic system of types and effects: confluence and termination |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Patrick Baillot, Martin Hofmann |
Type inference in intuitionistic linear logic. |
PPDP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot, Marco Gaboardi, Virgile Mogbil |
A PolyTime Functional Language from Light Linear Logic. |
ESOP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot, Kazushige Terui |
Light types for polynomial time computation in lambda calculus. |
Inf. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto M. Amadio, Patrick Baillot, Antoine Madet |
An affine-intuitionistic system of types and effects: confluence and termination |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca |
Guest editorial: Special issue on implicit computational complexity. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot, Damiano Mazza |
Linear Logic by Levels and Bounded Time Complexity |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vincent Atassi, Patrick Baillot, Kazushige Terui |
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic. |
Logical Methods in Computer Science |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot, Paolo Coppola, Ugo Dal Lago |
Light Logics and Optimal Reduction: Completeness and Complexity |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vincent Atassi, Patrick Baillot, Kazushige Terui |
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Patrick Baillot |
From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing. |
TLCA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot, Paolo Coppola, Ugo Dal Lago |
Light Logics and Optimal Reduction: Completeness and Complexity. |
LICS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ugo Dal Lago, Patrick Baillot |
On light logics, uniform encodings and polynomial time. |
Mathematical Structures in Computer Science |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen |
On Quasi-Interpretations, Blind Abstractions and Implicit Complexity |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Patrick Baillot, Marco Pedicini |
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Vincent Atassi, Patrick Baillot, Kazushige Terui |
Verification of Ptime reducibility for system F terms via Dual Light Affine Logic |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Vincent Atassi, Patrick Baillot, Kazushige Terui |
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic. |
CSL |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot, Kazushige Terui |
A Feasible Algorithm for Typing in Elementary Affine Logic. |
TLCA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot |
Stratified coherence spaces: a denotational semantics for light linear logic. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot, Kazushige Terui |
Light types for polynomial time computation in lambda-calculus |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Patrick Baillot, Kazushige Terui |
A feasible algorithm for typing in Elementary Affine Logic |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Patrick Baillot, Kazushige Terui |
Light Types for Polynomial Time Computation in Lambda-Calculus. |
LICS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandru Suna, Amal El Fallah-Seghrouchni, Christophe Fouqueré, Patrick Baillot |
Mobile Multi-Agent Systems: A Programming Language and Its Semantics. |
AAMAS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot, Virgile Mogbil |
Soft lambda-Calculus: A Language for Polynomial Time Computation. |
FoSSaCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot, Virgile Mogbil |
Soft lambda-calculus: a language for polynomial time computation |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Patrick Baillot |
Checking Polynomial Time Complexity with Types. |
IFIP TCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Patrick Baillot, Marco Pedicini |
Elementary Complexity and Geometry of Interaction. |
Fundam. Inform. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Patrick Baillot, Marco Pedicini |
Elementary Complexity and Geometry of Interaction. |
TLCA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier |
Believe it or not, AJM's Games Model is a Model of Classical Linear Logic. |
LICS |
1997 |
DBLP DOI BibTeX RDF |
reduced order systems, AJM's games model, classical linear logic, general category, saturated strategies, copy games, codings |
| 1 | Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier |
Timeless Games. |
CSL |
1997 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #34 of 34 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")