27 search results - page 1 / 6 » On light logics, uniform encodings and polynomial time |
MSCS
2006
13 years 7 months ago
2006
CORR
2004
Springer
13 years 7 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 7 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...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...