The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Patrick Baillot: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexandru Suna, Amal El Fallah-Seghrouchni, Christophe Fouqueré, Patrick Baillot
    Mobile Multi-Agent Systems: A Programming Language and Its Semantics. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2004, pp:1386-1387 [Conf]
  2. Vincent Atassi, Patrick Baillot, Kazushige Terui
    Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:150-166 [Conf]
  3. Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier
    Timeless Games. [Citation Graph (0, 0)][DBLP]
    CSL, 1997, pp:56-77 [Conf]
  4. Patrick Baillot, Virgile Mogbil
    Soft lambda-Calculus: A Language for Polynomial Time Computation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:27-41 [Conf]
  5. Patrick Baillot
    Checking Polynomial Time Complexity with Types. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:370-382 [Conf]
  6. Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier
    Believe it or not, AJM's Games Model is a Model of Classical Linear Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:68-75 [Conf]
  7. Patrick Baillot, Kazushige Terui
    Light Types for Polynomial Time Computation in Lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:266-275 [Conf]
  8. Patrick Baillot, Marco Pedicini
    Elementary Complexity and Geometry of Interaction. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:25-39 [Conf]
  9. Patrick Baillot, Kazushige Terui
    A Feasible Algorithm for Typing in Elementary Affine Logic. [Citation Graph (0, 0)][DBLP]
    TLCA, 2005, pp:55-70 [Conf]
  10. Patrick Baillot, Virgile Mogbil
    Soft lambda-calculus: a language for polynomial time computation [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  11. Patrick Baillot, Kazushige Terui
    Light types for polynomial time computation in lambda-calculus [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  12. Patrick Baillot, Marco Pedicini
    Elementary Complexity and Geometry of Interaction. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:1-2, pp:1-31 [Journal]
  13. Patrick Baillot
    Stratified coherence spaces: a denotational semantics for light linear logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:318, n:1-2, pp:29-55 [Journal]
  14. Patrick Baillot, Paolo Coppola, Ugo Dal Lago
    Light Logics and Optimal Reduction: Completeness and Complexity. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:421-430 [Conf]
  15. Patrick Baillot
    From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing. [Citation Graph (0, 0)][DBLP]
    TLCA, 2007, pp:2-7 [Conf]
  16. Patrick Baillot, Paolo Coppola, Ugo Dal Lago
    Light Logics and Optimal Reduction: Completeness and Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  17. Vincent Atassi, Patrick Baillot, Kazushige Terui
    Verification of Ptime reducibility for system F terms via Dual Light Affine Logic [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  18. Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen
    On Quasi-Interpretations, Blind Abstractions and Implicit Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  19. Patrick Baillot, Marco Pedicini
    An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  20. Vincent Atassi, Patrick Baillot, Kazushige Terui
    Verification of Ptime Reducibility for system F Terms: Type Inference in<br> Dual Light Affine Logic [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  21. Patrick Baillot, Kazushige Terui
    A feasible algorithm for typing in Elementary Affine Logic [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]

  22. A PolyTime Functional Language from Light Linear Logic. [Citation Graph (, )][DBLP]


  23. Type inference in intuitionistic linear logic. [Citation Graph (, )][DBLP]


  24. Linear Logic by Levels and Bounded Time Complexity [Citation Graph (, )][DBLP]


  25. An affine-intuitionistic system of types and effects: confluence and termination [Citation Graph (, )][DBLP]


  26. Proceedings International Workshop on Developments in Implicit Computational complExity [Citation Graph (, )][DBLP]


  27. An affine-intuitionistic system of types and effects: confluence and termination [Citation Graph (, )][DBLP]


Search in 0.036secs, Finished in 0.038secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002