Sciweavers

4370 search results - page 447 / 874
» Algebra of Logic Programming
Sort
View
177
Voted
AOSD
2012
ACM
13 years 11 months ago
A monadic interpretation of execution levels and exceptions for AOP
Aspect-Oriented Programming (AOP) started fifteen years ago with the remark that modularization of so-called crosscutting functionalities is a fundamental problem for the enginee...
Nicolas Tabareau
105
Voted
CSL
2009
Springer
15 years 10 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
112
Voted
BIRTHDAY
2003
Springer
15 years 8 months 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...
133
Voted
CSFW
2004
IEEE
15 years 7 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...
114
Voted
ENTCS
2007
107views more  ENTCS 2007»
15 years 3 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