64 search results - page 7 / 13 » Cut elimination in coalgebraic logics |
ICFP
2000
ACM
14 years 2 days ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
CSFW
2008
IEEE
14 years 2 months ago
2008
IEEE
We present an authorization logic that permits reasoning with explicit time. Following a proof-theoretic approach, we study the meta-theory of the logic, including cut elimination...
ESORICS
2006
Springer
13 years 11 months ago
2006
Springer
We propose a logic for specifying security policies at a very el of abstraction. The logic accommodates the subjective nature of affirmations for authorization and knowledge withou...
CALCO
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...