BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Cyprus
1 × Denmark
1 × Finland
1 × Hungary
1 × Italy
1 × Japan
1 × Spain
2 × France
2 × Poland
Collaborated with:
K.Terui U.D.Lago V.Mogbil M.Hofmann ∅ M.Pedicini V.Danos T.Ehrhard L.Regnier A.D.0002 A.Ghyselen M.Gaboardi P.Coppola V.Atassi
Talks about:
logic (9) linear (6) type (5) complex (4) light (4) time (4) polynomi (3) comput (3) elementari (2) calculus (2)

Person: Patrick Baillot

DBLP DBLP: Baillot:Patrick

Contributed to:

CSL 20122012
ESOP 20102010
PPDP 20102010
LICS 20072007
TLCA 20072007
CSL 20062006
TLCA 20052005
FoSSaCS 20042004
LICS 20042004
TLCA 19991999
CSL 19971997
LICS 19971997
CSL 20162016
CSL 20182018

Wrote 14 papers:

CSL-2012-BaillotL #complexity #higher-order
Higher-Order Interpretations and Program Complexity (PB, UDL), pp. 62–76.
ESOP-2010-BaillotGM #functional #linear #logic
A PolyTime Functional Language from Light Linear Logic (PB, MG, VM), pp. 104–124.
PPDP-2010-BaillotH #linear #logic #type inference
Type inference in intuitionistic linear logic (PB, MH), pp. 219–230.
LICS-2007-BaillotCL #complexity #logic #reduction
Light Logics and Optimal Reduction: Completeness and Complexity (PB, PC, UDL), pp. 421–430.
TLCA-2007-Baillot #linear #logic #polynomial #type system
From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing (PB), pp. 2–7.
CSL-2006-AtassiBT #logic #system f #verification
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic (VA, PB, KT), pp. 150–166.
TLCA-2005-BaillotT #algorithm #logic #type system
A Feasible Algorithm for Typing in Elementary Affine Logic (PB, KT), pp. 55–70.
FoSSaCS-2004-BaillotM #polynomial #λ-calculus
Soft λ-Calculus: A Language for Polynomial Time Computation (PB, VM), pp. 27–41.
LICS-2004-BaillotT #polynomial #λ-calculus
Light Types for Polynomial Time Computation in λ-Calculus (PB, KT), pp. 266–275.
TLCA-1999-BaillotP #complexity #geometry #interactive
Elementary Complexity and Geometry of Interaction (PB, MP), pp. 25–39.
CSL-1997-BaillotDER #game studies
Timeless Games (PB, VD, TE, LR), pp. 56–77.
LICS-1997-BaillotDE #game studies #linear #logic
Believe it or not, AJM’s Games Model is a Model of Classical Linear Logic (PB, VD, TE, LR), pp. 68–75.
CSL-2016-BaillotD #linear #logic
Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic (PB, AD0), p. 18.
CSL-2018-BaillotG #complexity #linear #logic
Combining Linear Logic and Size Types for Implicit Complexity (PB, AG), p. 21.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.