Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Patrick Baillot
2010 – today
- 2012
[j9]Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen: On quasi-interpretations, blind abstractions and implicit complexity. Mathematical Structures in Computer Science 22(4): 549-580 (2012)- [c15]
- 2011
- [j8]Patrick Baillot, Paolo Coppola, Ugo Dal Lago: Light logics and optimal reduction: Completeness and complexity. Inf. Comput. 209(2): 118-142 (2011)
- [c14]Patrick Baillot: Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy. APLAS 2011: 337-352
- 2010
- [j7]Patrick Baillot, Damiano Mazza: Linear logic by levels and bounded time complexity. Theor. Comput. Sci. 411(2): 470-503 (2010)
- [c13]Patrick Baillot, Marco Gaboardi, Virgile Mogbil: A PolyTime Functional Language from Light Linear Logic. ESOP 2010: 104-124
- [c12]
- [e1]
- [i11]Roberto M. Amadio, Patrick Baillot, Antoine Madet: An affine-intuitionistic system of types and effects: confluence and termination. CoRR abs/1005.0835 (2010)
2000 – 2009
- 2009
- [j6]Patrick Baillot, Kazushige Terui: Light types for polynomial time computation in lambda calculus. Inf. Comput. 207(1): 41-62 (2009)
- [j5]Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca: Guest editorial: Special issue on implicit computational complexity. ACM Trans. Comput. Log. 10(4) (2009)
- [i10]Roberto M. Amadio, Patrick Baillot, Antoine Madet: An affine-intuitionistic system of types and effects: confluence and termination. CoRR abs/0912.0419 (2009)
- 2008
- [i9]Patrick Baillot, Damiano Mazza: Linear Logic by Levels and Bounded Time Complexity. CoRR abs/0801.1253 (2008)
- 2007
- [j4]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 3(4) (2007)
- [c11]Patrick Baillot, Paolo Coppola, Ugo Dal Lago: Light Logics and Optimal Reduction: Completeness and Complexity. LICS 2007: 421-430
- [c10]Patrick Baillot: From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing. TLCA 2007: 2-7
- [i8]Patrick Baillot, Paolo Coppola, Ugo Dal Lago: Light Logics and Optimal Reduction: Completeness and Complexity. CoRR abs/0704.2448 (2007)
- [i7]Vincent Atassi, Patrick Baillot, Kazushige Terui: Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic. CoRR abs/0710.1153 (2007)
- 2006
- [j3]Ugo Dal Lago, Patrick Baillot: On light logics, uniform encodings and polynomial time. Mathematical Structures in Computer Science 16(4): 713-733 (2006)
- [c9]Vincent Atassi, Patrick Baillot, Kazushige Terui: Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic. CSL 2006: 150-166
- [i6]Vincent Atassi, Patrick Baillot, Kazushige Terui: Verification of Ptime reducibility for system F terms via Dual Light Affine Logic. CoRR abs/cs/0603104 (2006)
- [i5]Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen: On Quasi-Interpretations, Blind Abstractions and Implicit Complexity. CoRR abs/cs/0608030 (2006)
- [i4]Patrick Baillot, Marco Pedicini: An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus. CoRR abs/cs/0608040 (2006)
- 2005
- [c8]Patrick Baillot, Kazushige Terui: A Feasible Algorithm for Typing in Elementary Affine Logic. TLCA 2005: 55-70
- 2004
- [j2]Patrick Baillot: Stratified coherence spaces: a denotational semantics for light linear logic. Theor. Comput. Sci. 318(1-2): 29-55 (2004)
- [c7]Alexandru Suna, Amal El Fallah-Seghrouchni, Christophe Fouqueré, Patrick Baillot: Mobile Multi-Agent Systems: A Programming Language and Its Semantics. AAMAS 2004: 1386-1387
- [c6]Patrick Baillot, Virgile Mogbil: Soft lambda-Calculus: A Language for Polynomial Time Computation. FoSSaCS 2004: 27-41
- [c5]Patrick Baillot, Kazushige Terui: Light Types for Polynomial Time Computation in Lambda-Calculus. LICS 2004: 266-275
- [i3]Patrick Baillot, Kazushige Terui: A feasible algorithm for typing in Elementary Affine Logic. CoRR abs/cs/0412028 (2004)
- [i2]Patrick Baillot, Kazushige Terui: Light types for polynomial time computation in lambda-calculus. CoRR cs.LO/0402059 (2004)
- 2003
- [i1]Patrick Baillot, Virgile Mogbil: Soft lambda-calculus: a language for polynomial time computation. CoRR cs.LO/0312015 (2003)
- 2002
- [c4]
- 2001
- [j1]Patrick Baillot, Marco Pedicini: Elementary Complexity and Geometry of Interaction. Fundam. Inform. 45(1-2): 1-31 (2001)
1990 – 1999
- 1999
- [c3]Patrick Baillot, Marco Pedicini: Elementary Complexity and Geometry of Interaction. TLCA 1999: 25-39
- 1997
- [c2]
- [c1]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: 68-75
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:19 CEST by the dblp team