2 search results - page 1 / 1 » A Semantic Proof of Polytime Soundness of Light Affine Logic |
CSR
2008
Springer
13 years 6 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...
FSTTCS
2005
Springer
13 years 10 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...