54 search results - page 10 / 11 » Dependency-style generic Haskell |
TPHOL
2005
IEEE
14 years 4 months ago
2005
IEEE
We have definitionally extended Isabelle/HOLCF to support axiomatic Haskell-style constructor classes. We have subsequently defined the functor and monad classes, together with t...
CALCO
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...
TYPES
2004
Springer
14 years 4 months ago
2004
Springer
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
ICFP
2006
ACM
14 years 10 months ago
2006
ACM
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
ICFP
2006
ACM
14 years 10 months ago
2006
ACM
Datatype-generic programming (DGP) is the next step beyond abstracting over types using parametric polymorphism, which is often called "genericity" in object-oriented la...