4 search results - page 1 / 1 » Proofs, denotational semantics and observational equivalence... |
MSCS
2007
13 years 4 months ago
2007
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We show that for Multiplicative Exponential Linear Logic (without weakenings) the syntactical equivalence relation on proofs induced by cut-elimination coincides with the semantic ...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
ICFP
2007
ACM
14 years 4 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 ...