Sciweavers

Share
6 search results - page 1 / 2
» Algebraic foundations for effect-dependent optimisations
Sort
View
POPL
2012
ACM
8 years 5 months ago
Algebraic foundations for effect-dependent optimisations
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...
Ohad Kammar, Gordon D. Plotkin
TLCA
2007
Springer
10 years 3 months ago
Initial Algebra Semantics Is Enough!
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...
Patricia Johann, Neil Ghani
ICFEM
2007
Springer
10 years 1 months ago
Testing for Refinement in CSP
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...
Ana Cavalcanti, Marie-Claude Gaudel
VLDB
1987
ACM
108views Database» more  VLDB 1987»
10 years 1 months ago
Translating and Optimizing SQL Queries Having Aggregates
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...
Günter von Bültzingsloewen
ICFP
2005
ACM
10 years 9 months ago
Monadic augment and generalised short cut fusion
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...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
books