Add to ORKGInternational audienceIn this paper an implicit characterization of the complexity classes kEXP and kFEXP, for k >=0, is given, by a type assignment system for a stratified lambda-calculus, where types for programs are witnesses of the corresponding complexity class. Types are formulae of Elementary Linear Logic (ELL), and the hierarchy of complexity classes kEXP is characterized by a hierarchy of types
We propose to measure the efficiency of any implementation of the lambda-calculus as a function of a...
International audienceWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is...
We introduce an imperative programming language equipped with variables of higher types. Fragments o...
International audienceIn this paper an implicit characterization of the complexity classes kEXP and ...
Part 2: Track B: Logic, Semantics, Specification and VerificationInternational audienceIn this paper...
International audienceSeveral type systems have been proposed to statically control the time complex...
We describe some results inspired to Lafont’s Soft Linear Logic (SLL) which is a subsystem of second...
AbstractWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem o...
In this thesis we explore the linear logic approach to implicit computational complexity, through th...
Nombre de pages: 20. Une version courte de ce travail est à paraître dans les actes de: Asian Sympos...
International audienceElementary linear logic is a simple variant of linear logic, introduced by Gir...
International audienceElementary linear logic is a simple variant of linear logic due to Girard and ...
AbstractWe give a new characterization of elementary and deterministic polynomial time computation i...
We propose to measure the efficiency of any implementation of the lambda-calculus as a function of a...
International audienceWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is...
We introduce an imperative programming language equipped with variables of higher types. Fragments o...
International audienceIn this paper an implicit characterization of the complexity classes kEXP and ...
Part 2: Track B: Logic, Semantics, Specification and VerificationInternational audienceIn this paper...
International audienceSeveral type systems have been proposed to statically control the time complex...
We describe some results inspired to Lafont’s Soft Linear Logic (SLL) which is a subsystem of second...
AbstractWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem o...
In this thesis we explore the linear logic approach to implicit computational complexity, through th...
Nombre de pages: 20. Une version courte de ce travail est à paraître dans les actes de: Asian Sympos...
International audienceElementary linear logic is a simple variant of linear logic, introduced by Gir...
International audienceElementary linear logic is a simple variant of linear logic due to Girard and ...
AbstractWe give a new characterization of elementary and deterministic polynomial time computation i...
We propose to measure the efficiency of any implementation of the lambda-calculus as a function of a...
International audienceWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is...
We introduce an imperative programming language equipped with variables of higher types. Fragments o...