2272 search results - page 187 / 455 » A Calculus for |
189
click to vote
CALCO
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. We investigate the phenomenon that every monad is a linear state monad. We do this by studying a fully-complete state-passing translation from an impure call-by-value lan...
156
click to vote
CSFW
2012
IEEE
13 years 7 months ago
2012
IEEE
—We show that Kripke semantics of modal logic, manifest in the syntactic proof formalism of labeled sequent calculi, can be used to solve three central problems in access control...
144
click to vote
CADE
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...
239
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, ...
241
click to vote
POPL
2005
ACM
16 years 4 months ago
2005
ACM
Modern applications are designed in multiple tiers to separate concerns. Since each tier may run at a separate location, middleware is required to mediate access between tiers. Ho...