122 search results - page 3 / 25 » Light types for polynomial time computation in lambda-calcul... |
IJISEC
2007
13 years 5 months ago
2007
This paper presents a language in which information flow is securely controlled by a type system, yet the security class of data can vary dynamically. Information flow policies ...
ICFP
2007
ACM
14 years 5 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
CSL
2006
Springer
13 years 9 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...
LICS
2007
IEEE
13 years 11 months ago
2007
IEEE
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
We provide the first polynomial time algorithm for the linear version of a market equilibrium model defined by Irving Fisher in 1891, thereby partially answering an open questio...