6 search results - page 1 / 2 » Algebraic foundations for effect-dependent optimisations |
POPL
2012
ACM
12 years 20 hour ago
2012
ACM
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
TLCA
2007
Springer
13 years 10 months ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
ICFEM
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. CSP is a well-established formalism for modelling and verification of concurrent reactive systems based on refinement. Consolidated denotational models and an effective t...
VLDB
1987
ACM
13 years 8 months ago
1987
ACM
is at least ae powerful as SQL. Two well known relational query languages that have a sound theoretical foundation are relational algebra and relational calculus. As SQL is more cl...
ICFP
2005
ACM
14 years 4 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...