122 search results - page 1 / 25 » Light types for polynomial time computation in lambda-calcul... |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
POPL
2008
ACM
14 years 4 months ago
2008
ACM
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
FOSSACS
2004
Springer
13 years 10 months ago
2004
Springer
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
APAL
2000
13 years 4 months ago
2000
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a rami...