-
Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time...
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
-
Checking polynomial time complexity with types.
This dataset has no description
-
Soft lambda-calculus: a language for polynomial time computation.
Version préliminaire (longue) disponible comme ccsd-00012751 (2003) -
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus.
11 pages. A preliminary version appeared as Research Report IAC CNR Roma , N.57 (11/2004), november 2004.
