-
Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time...
International audience -
Light logics and optimal reduction: Completeness and complexity
International audience -
On quasi-interpretations, blind abstractions and implicit complexity.
International audience -
Stratified coherence spaces: a denotational semantics for light linear logic.
This dataset has no description
-
Type inference for light affine logic via constraints on words.
This dataset has no description
-
Soft lambda-calculus: a language for polynomial time computation.
Version préliminaire (longue) disponible comme ccsd-00012751 (2003) -
Type-based complexity analysis for fork processes
International audience -
ICC and Probabilistic Classes
The thesis applies the ICC tecniques to the probabilistic polinomial complexity classes in order to get an implicit characterization of them. The main contribution... -
On Context Semantics and Interaction Nets
International audience -
On paths-based criteria for polynomial time complexity in proof-nets
International audience
