Attribute Grammars (AGs), a general-purpose formalism for describing recursive
computations over data types, avoid the trade-off which arises when building software …

Type classes have found a wide variety of uses in Haskell programs, from simple
overloading of operators (such as equality or ordering) to complex invariants used to …

Eight years ago, functional dependencies, a concept from the theory of relational databases,
were proposed as a mechanism for avoiding common problems with multiple parameter …

We present an approach to support partiality in type-level computation without
compromising expressiveness or type safety. Existing frameworks for type-level computation …

The Utrecht University Attribute Grammar Compiler takes attribute grammar declarations
from multiple source files and generates an attribute grammar evaluator consisting of a …

Ideally complexity is managed by composing a system out of quite a few, more or less
independent, and much smaller descriptions of various aspects of the overall artefact. When …

Type classes, first proposed during the design of the Haskell programming language, extend
standard type systems to support overloaded functions. Since their introduction, type classes …

Idealmente la complejidad es manejada componiendo un sistema en algunas pocas, más o
menos independientes, descripciones más pequenas de varios aspectos del artefacto …

We describe DMSL, a domain specific language for defining schema map**s. Schema
map**s are assertions in carefully crafted logics that express constraints between data …

We discuss type classes in the context of the Chameleon language, a Haskell-style
language where overloading resolution is expressed in terms of the meta-language of …