International audienceWe show how to represent polynomial time computation in an untyped version of proof-nets for elementary linear logic. This follows previous work by P. Baillot but which was developed in a typed and affine setting. We describe how these two properties can be adapted
11 pages. A preliminary version appeared as Research Report IAC CNR Roma , N.57 (11/2004), november ...
AbstractWe present a subsystem of second-order linear logic with restricted rules for exponentials s...
Version préliminaire (longue) disponible comme ccsd-00012751 (2003)Soft linear logic ([Lafont02]) is...
International audienceWe show how to represent polynomial time computation in an untyped version of ...
We show how to represent polynomial time computation in an untyped version of proof-nets of elementa...
Nombre de pages: 20. Une version courte de ce travail est à paraître dans les actes de: Asian Sympos...
AbstractWe give a new characterization of elementary and deterministic polynomial time computation i...
International audienceElementary linear logic is a simple variant of linear logic due to Girard and ...
International audienceSeveral variants of linear logic have been proposed to characterize complexity...
AbstractWe present a polymorphic type system for lambda calculus ensuring that well-typed programs c...
AbstractWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem o...
International audienceWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is...
Implicit computational complexity is the characterization of complexity classes by syntactic restric...
International audienceElementary linear logic is a simple variant of linear logic, introduced by Gir...
International audienceSeveral type systems have been proposed to statically control the time complex...
11 pages. A preliminary version appeared as Research Report IAC CNR Roma , N.57 (11/2004), november ...
AbstractWe present a subsystem of second-order linear logic with restricted rules for exponentials s...
Version préliminaire (longue) disponible comme ccsd-00012751 (2003)Soft linear logic ([Lafont02]) is...
International audienceWe show how to represent polynomial time computation in an untyped version of ...
We show how to represent polynomial time computation in an untyped version of proof-nets of elementa...
Nombre de pages: 20. Une version courte de ce travail est à paraître dans les actes de: Asian Sympos...
AbstractWe give a new characterization of elementary and deterministic polynomial time computation i...
International audienceElementary linear logic is a simple variant of linear logic due to Girard and ...
International audienceSeveral variants of linear logic have been proposed to characterize complexity...
AbstractWe present a polymorphic type system for lambda calculus ensuring that well-typed programs c...
AbstractWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem o...
International audienceWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is...
Implicit computational complexity is the characterization of complexity classes by syntactic restric...
International audienceElementary linear logic is a simple variant of linear logic, introduced by Gir...
International audienceSeveral type systems have been proposed to statically control the time complex...
11 pages. A preliminary version appeared as Research Report IAC CNR Roma , N.57 (11/2004), november ...
AbstractWe present a subsystem of second-order linear logic with restricted rules for exponentials s...
Version préliminaire (longue) disponible comme ccsd-00012751 (2003)Soft linear logic ([Lafont02]) is...
DOI
Add to ORKG