Sciweavers

4257 search results - page 433 / 852
» The Logical Modularity of Programs
Sort
View
CSL
2009
Springer
16 years 1 months ago
Focalisation and Classical Realisability
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
Guillaume Munch-Maccagnoni
ICALP
2004
Springer
16 years 5 days ago
A Categorical Model for the Geometry of Interaction
We consider the multiplicative and exponential fragment of linear logic (MELL) and give a Geometry of Interaction (GoI) semantics for it based on unique decomposition categories. ...
Esfandiar Haghverdi, Philip J. Scott
BIRTHDAY
2003
Springer
16 years 20 hour ago
From CTL to Datalog
We provide a translation from CTL to Datalog¬ Succ. The translation has the following advantages: a) It is natural. b) It provides intuition to the expressive power of CTL and it...
Foto N. Afrati, Theodore Andronikos, Vassia Pavlak...
CSFW
2004
IEEE
15 years 10 months ago
By Reason and Authority: A System for Authorization of Proof-Carrying Code
We present a system, BLF, that combines an authorization logic based on the Binder language with a logical framework, LF, able to express semantic properties of programs. BLF is a...
Nathan Whitehead, Martín Abadi, George C. N...
ENTCS
2007
107views more  ENTCS 2007»
15 years 6 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky