Habilitation à diriger les recherches en Informatique:
Logique linéaire, Types et Complexité Implicite

soutenue par Patrick Baillot


le mardi 11 mars 2008, à 14h
Amphi EULER, Institut Galilée, Université Paris 13
  • P. Baillot. Stratified coherence spaces: a denotational semantics for Light Linear Logic ( ps.gz)
    Theoretical Computer Science , 318 (1-2), pp.29-55, 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, 2004.
  • 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, K. Terui. Light types for polynomial time computation in lambda-calculus ,
    in Proceedings of     LICS 2004, pp. 266-275, IEEE Computer Society Press, 2004.
    (long version, 35 pp., 2007, .pdf,.ps )
  • 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, 2005.
  • V. Atassi, P. Baillot, K. Terui. Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic. ( here ).
    Logical Methods in Computer Science , 3(4:10), pp.1-32, Special issue on CSL'06, 2007.
  • P. Baillot, P. Coppola, U. 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.
    • Ce document a été traduit de LATEX par HEVEA