Comparing libraries for generic programming in haskell

  • Authors:
  • Alexey Rodriguez;Johan Jeuring;Patrik Jansson;Alex Gerdes;Oleg Kiselyov;Bruno C. d. S. Oliveira

  • Affiliations:
  • Utrecht University, Utrecht, Netherlands;Utrecht University, Utrecht, Netherlands;Chalmers University of Technology & University of Gothenburg, Gothenburg, Sweden;Open University, Utrecht, Netherlands;FNMOC, Monterey, CA, USA;Oxford University, Oxford, United Kingdom

  • Venue:
  • Proceedings of the first ACM SIGPLAN symposium on Haskell
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Datatype-generic programming is defining functions that depend on the structure, or "shape", of datatypes. It has been around for more than 10 years, and a lot of progress has been made, in particular in the lazy functional programming language Haskell. There are morethan 10 proposals for generic programming libraries orlanguage extensions for Haskell. To compare and characterise the many generic programming libraries in atyped functional language, we introduce a set of criteria and develop a generic programming benchmark: a set of characteristic examples testing various facets of datatype-generic programming. We have implemented the benchmark for nine existing Haskell generic programming libraries and present the evaluation of the libraries. The comparison is useful for reaching a common standard for generic programming, but also for a programmer who has to choose a particular approach for datatype-generic programming.