Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...
Manuel M. T. Chakravarty, Gabriele Keller, Simon L...
Abstract. This paper is concerned with the question of quantifying gradient degrees of acceptability by introducing the notion of Density in the context of constructional constrain...
This paper presents the design of G, a new language specifically created for generic programming. We review and identify important language features of C++ and Haskell in light o...
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Features are essential characteristic of applications within a product line. Features organized in different kinds of diagrams containing hierarchies of feature trees are closely ...