Google's MapReduce programming model serves for processing large data sets in a
massively parallel manner. We deliver the first rigorous description of the model including its …

Constraint Handling Rules (CHR) is both a theoretical formalism based on logic and a
practical programming language based on rules. This book, written by the creator of CHR …

Haskell programmers often use a multi-parameter type class in which one or more type
parameters are functionally dependent on the first. Although such functional dependencies …

Haskell's type classes allow ad-hoc overloading, or type-indexing, of functions. A natural
generalisation is to allow type-indexing of data types as well. It turns out that this idea …

We report on an extension of Haskell with open type-level functions and equality constraints
that unifies earlier work on GADTs, functional dependencies, and associated types. The …

Advanced type system features, such as GADTs, type classes and type families, have
proven to be invaluable language extensions for ensuring data invariants and program …

Reasoning about program control-flow paths is an important functionality of a number of
recent program matching languages and associated searching and transformation tools …

Functional dependencies are a popular and useful extension to Haskell style type classes.
We give a reformulation of functional dependencies in terms of Constraint Handling Rules …

Constraint Handling Rules (CHR) is a high-level programming language based on
multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint …

Constraint Handling Rules (CHR) is a high-level rule-based programming language which
is increasingly used for general-purpose programming. We introduce the CHR machine, a …