Patrick Baillot

Journal papers

• Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen. On Quasi-Interpretations, Blind Abstractions and Implicit Complexity. (.pdf)
  to appear in Mathematical Structures in Computer Science, 2012.
  
• Patrick Baillot, Paolo Coppola, Ugo Dal Lago. Light Logics and Optimal Reduction: Completeness and Complexity. (pdf),
  Information and Computation 209 (2011), pp. 118-142.
  
• Patrick Baillot, Damiano Mazza. Linear Logic by Levels and Bounded Time Complexity.
  Theoretical Computer Science, 411(2):470-503, 2010 (arXiv:0801.1253).
  
• P. Baillot, K. Terui. Light types for polynomial time computation in lambda calculus ( link, pdf),
  Information and Computation 207(1), pp. 41-62, Elsevier, 2009.
  
• V. Atassi, P. Baillot, K. Terui. Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic.
  Logical Methods in Computer Science , 3(4:10), pp.1--32, Special issue on CSL'06, 2007 ( here )
  (implementation by V. Atassi).
• U. Dal Lago, P. Baillot. On Light Logics, Uniform Encodings and Polynomial Time , (.pdf, .ps),
  Mathematical Structures in Computer Science, 16(4):713-733, 2006.
• P. Baillot. Type inference for light affine logic via constraints on words ( pdf)
  Theoretical Computer Science , 328(3):289-323, december 2004.
  
• P. Baillot. Stratified coherence spaces: a denotational semantics for Light Linear Logic ( ps.gz)
  Theoretical Computer Science , 318 (1-2), pp.29-55, 2004.
  (also as a technical report from the University of Edinburgh; and extended abstract)
• P. Baillot and Marco Pedicini. Elementary complexity and geometry of interaction (ps , pdf ),
  Fundamenta Informaticae vol. 45, no 1-2, pp.1-31, 2001.
  (extended abstract presented at TLCA'99 is available below).
  

Articles in conference proceedings

• Patrick Baillot . Elementary linear logic revisited for polynomial time and an exponential time hierarchy. (.pdf)
  in Proceedings of Asian Symposium on Programming Languages and Systems (APLAS 2011), LNCS 7078, pp. 337-352, Springer, 2011. See also the long version report (02/2012).
  
• Patrick Baillot, Martin Hofmann. Type Inference for Intuitionistic Linear Logic. (.pdf)
  in Proceedings of International Symposium on Principles and Practice of Declarative Programming (PPDP 2010), pp.219-230, ACM, 2010.
  
• Patrick Baillot, Marco Gaboardi, Virgile Mogbil. A PolyTime Functional Language from Light linear logic. (.pdf)
  in Proceedings of the 19th European Symposium on Programming (ESOP'10), LNCS 6012,pp.104-124, Springer, 2010 (long version HAL : hal-00443944 ).
  
• Patrick Baillot, Paolo Coppola, Ugo Dal Lago. Light Logics and Optimal Reduction: Completeness and Complexity. (.ps, .pdf),
  in Proceedings of LICS 2007 , pp 421--430. IEEE Computer Society Press, 2007.
  
• Patrick Baillot. From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing. (.pdf)
  Invited talk. Proceedings of International Conference on Typed Lambda Calculi and Applications (TLCA'07), volume 4583 of LNCS, pp. 2-7, 2007. Springer.
  (slides of the talk)
• Vincent Atassi , Patrick Baillot, Kazushige Terui. Verification of Ptime Reducibility for system F Terms via Dual Light Affine Logic.
  in the Proceedings of Computer Science Logic 2006 (CSL'06), volume 4207 of LNCS, pp.150-166, 2006. Springer.
  (implementation by V. Atassi).
• P. Baillot, K. Terui . A feasible algorithm for typing in Elementary Affine Logic. (.ps, .pdf),
  Proceedings of TLCA 2005, volume 3461 of LNCS, pp.55-70. Springer.
  (long version on arXiv , cs.LO/0412028,2004 ; see also an implementation by V. Atassi).
• P. Baillot, K. Terui. Light types for polynomial time computation in lambda-calculus ,
  in Proceedings of LICS 2004, pp. 266-275, IEEE Computer Society Press, 2004.
  also Prepublication (arXiv) available here , cs.LO/0402059, 25 pp., february 2004.
• P. Baillot, V. Mogbil . Soft lambda-calculus: a language for polynomial time computation , ( ps.gz, pdf ),
  Proceedings of FOSSACS 2004 , volume 2987 of LNCS, pp.27-41. Springer.
  
• P. Baillot. Checking polynomial time complexity with types (ps.gz),
  in Foundations of Information Technology in the Era of Network and Mobile Computing (proceedings of IFIP TCS2002), Kluwer 2002.
  ( Preliminary version appeared as preprint LIPN (2001-09), december 2001.)
  
• P. Baillot, M. Pedicini. Elementary complexity and geometry of interaction (extended abstract) (ps.gz) ,
  In Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99), volume 1581 of LNCS. Springer-Verlag.
  
• P. Baillot, V. Danos, T. Ehrhard, L. Regnier. Timeless games (ps.gz).
  In Proceedings of the 11th International Workshop on Computer Science Logic (CSL'97), volume 1414 of LNCS, 1997. Springer-Verlag.
  
• P. Baillot, V. Danos, T. Ehrhard, L. Regnier. Believe it or not, AJM games model is a model of classical linear logic (ps.gz) ,
  In Proceedings of the 12th symposium Logic in Computer Science (LICS '97), IEEE Computer Society Press, 1997.

Edition:

• P. Baillot, P.-L. Curien, L. Paolini (Ed.). Selected Papers of the Conference "Typed Lambda Calculi and Applications 2009".
  Special Issue of Logical Methods in Computer Science, 2012.
  
• P. Baillot (Ed.). Proceedings International Workshop on Developments in Implicit Computational complExity (DICE 2010).
  Electronic Proceedings in Theoretical Computer Science , volume 23, 2010.
  
• Special Issue on Implicit Computational Complexity. Guest editors: P. Baillot, J.-Y. Marion, Simona Ronchi Della Rocca. Editorial .
  ACM Transactions on Computational Logic , 10(4), 2009.

Other works:

• P. Baillot, U. Dal Lago. Higher-order Interpretations and Program Complexity (Long Version).
  Technical Report, HAL : hal-00667816, 2/2012.
  
• R.M. Amadio, P. Baillot, and A. Madet. An affine-intuitionistic system of types and effects: confluence and termination.
  Technical Report, Universit� Paris Diderot (Paris 7), Laboratoire PPS, HAL : hal-00438101, December 2009.
  
• Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen. On Quasi-Interpretations, Blind Abstractions and Implicit Complexity. (.pdf)
  8th International Workshop on Logic and Computational Complexity (LCC'06), August 2006 (Satellite of FLOC-LICS) (long version with proofs, 23 pp.: preprint HAL ccsd-00023668, here).
  
• Patrick Baillot and Marco Pedicini. An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus.
  8th International Workshop on Logic and Computational Complexity (LCC'06), August 2006 (Satellite of FLOC-LICS), preprint HAL ccsd-00085547 (here ) (Preliminary version was Research Report IAC CNR Roma N.57 (11/2004)).
• Ugo Dal Lago and Patrick Baillot. On Light Logics, Uniform Encodings and Polynomial Time (.pdf),
  (11 p.), presented at the Workshop on Logics for Resources, Processes, and Programs ( LRPP'04) affiliated with LICS 2004 and ICALP 2004 ), Turku, Finland, July 13, 2004 (subsumed by journal paper in MSCS).
  
• Patrick Baillot. Type inference for polynomial time complexity via constraints on words
  Prepublication LIPN Universite Paris Nord 2003-02, january 2003 (preprint) (subsumed by the article Type inference for light affine logic via constraints on words).
  
  
• Patrick Baillot. Linear Logic, Types and Implicit Computational Complexity ( pdf ), Habilitation thesis , University Paris 13, march 2008.
• Patrick Baillot. Approches dynamiques en s�mantique de la logique lineaire: jeux et g�ometrie de l'interaction (ps.gz)
  (PhD thesis Universite Aix-Marseille 2, january 1999, in french).
  
• Patrick Baillot. Abramsky-Jagadeesan-Malacaria strategies and the geometry of interaction , (ps.gz)
  memoire de DEA Universite Paris 7, manuscript, 1995.