103 search results - page 9 / 21 » Computational Interpretations of Classical Linear Logic |
211
click to vote
SIAMCOMP
2008
15 years 7 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
330
click to vote
POPL
2005
ACM
16 years 7 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
177
click to vote
APSEC
2005
IEEE
16 years 1 months ago
2005
IEEE
— In this paper, we present a temporal logic called F whose interpretation is over Input Output Symbolic Transition Systems (IOSTS). IOSTS extend transition systems to communicat...
218
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...
166
click to vote
CSR
2008
Springer
15 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...