Sciweavers

Share
3 search results - page 1 / 1
» A Semantic Proof of Polytime Soundness of Light Affine Logic
Sort
View
CSR
2008
Springer
9 years 8 months ago
A Semantic Proof of Polytime Soundness of Light Affine Logic
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...
Ugo Dal Lago, Martin Hofmann
FSTTCS
2005
Springer
10 years 15 days ago
Quantitative Models and Implicit Complexity
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...
Ugo Dal Lago, Martin Hofmann
POPL
2016
ACM
4 years 3 months ago
Example-directed synthesis: a type-theoretic interpretation
Input-output examples have emerged as a practical and user-friendly specification mechanism for program synthesis in many environments. While example-driven tools have demonstrat...
Jonathan Frankle, Peter-Michael Osera, David Walke...
books