Sciweavers

65 search results - page 1 / 13
» Generic Haskell: Practice and Theory
Sort
View
AC
2003
Springer
13 years 10 months ago
Generic Haskell: Practice and Theory
Ralf Hinze, Johan Jeuring
ICFP
2006
ACM
14 years 5 months ago
Context-parametric polykinded types
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...
Pablo Nogueira
MPC
2004
Springer
155views Mathematics» more  MPC 2004»
13 years 10 months ago
Inferring Type Isomorphisms Generically
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
Frank Atanassow, Johan Jeuring
TLDI
2003
ACM
134views Formal Methods» more  TLDI 2003»
13 years 10 months ago
Scrap your boilerplate: a practical design pattern for generic programming
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...
Ralf Lämmel, Simon L. Peyton Jones
PLDI
2005
ACM
13 years 11 months ago
Essential language support for generic programming
Concepts are an essential language feature for generic programming in the large. Concepts allow for succinct expression of constraints on type parameters of generic algorithms, en...
Jeremy G. Siek, Andrew Lumsdaine