Sciweavers

478 search results - page 10 / 96
» Monads of Regular Theories
Sort
View
FOSSACS
2010
Springer
15 years 5 months ago
Completeness for Algebraic Theories of Local State
Every algebraic theory gives rise to a monad, and monads allow a meta-language which is a basic programming language with sideeffects. Equations in the algebraic theory give rise ...
Sam Staton
LISP
2006
105views more  LISP 2006»
14 years 10 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
ENTCS
2006
124views more  ENTCS 2006»
14 years 10 months ago
Generic Trace Theory
Trace semantics has been defined for various non-deterministic systems with different input/output types, or with different types of "non-determinism" such as classical ...
Ichiro Hasuo, Bart Jacobs, Ana Sokolova
PODS
2004
ACM
131views Database» more  PODS 2004»
15 years 10 months ago
On the Decidability of Containment of Recursive Datalog Queries - Preliminary report
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unres...
Piero A. Bonatti
ENTCS
2002
103views more  ENTCS 2002»
14 years 10 months ago
Deciding low levels of tree-automata hierarchy
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
Igor Walukiewicz