Sciweavers

Share
5 search results - page 1 / 1
» Proofs, denotational semantics and observational equivalence...
Sort
View
MSCS
2007
117views more  MSCS 2007»
8 years 9 months ago
Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic
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 ...
Michele Pagani
CORR
2010
Springer
71views Education» more  CORR 2010»
8 years 10 months ago
The relational model is injective for Multiplicative Exponential Linear Logic (without weakenings)
We show that for Multiplicative Exponential Linear Logic (without weakenings) the syntactical equivalence relation on proofs induced by cut-elimination coincides with the semantic ...
Daniel de Carvalho, Lorenzo Tortora de Falco
APAL
2016
3 years 6 months ago
Interaction graphs: Additives
Geometry of Interaction (GoI) is a research program initiated by Jean-Yves Girard which aims at defining a semantics of linear logic proofs accounting for the dynamical aspects o...
Thomas Seiller
STACS
2009
Springer
9 years 5 months ago
Strong Completeness of Coalgebraic Modal Logics
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...
Lutz Schröder, Dirk Pattinson
ICFP
2007
ACM
9 years 10 months ago
Relating complexity and precision in control flow analysis
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 ...
David Van Horn, Harry G. Mairson
books