A New Approach to Generic Functional Programming (1999)
Cached
Download Links
- [www.informatik.uni-bonn.de]
- [www.informatik.uni-bonn.de]
- [www.informatik.uni-bonn.de]
- DBLP
Other Repositories/Bibliography
| Venue: | In The 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages |
| Citations: | 84 - 13 self |
BibTeX
@INPROCEEDINGS{Hinze99anew,
author = {Ralf Hinze},
title = {A New Approach to Generic Functional Programming},
booktitle = {In The 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages},
year = {1999},
pages = {119--132},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper describes a new approach to generic functional programming, which allows us to define functions generically for all datatypes expressible in Haskell. A generic function is one that is defined by induction on the structure of types. Typical examples include pretty printers, parsers, and comparison functions. The advanced type system of Haskell presents a real challenge: datatypes may be parameterized not only by types but also by type constructors, type definitions may involve mutual recursion, and recursive calls of type constructors can be arbitrarily nested. We show that--- despite this complexity---a generic function is uniquely defined by giving cases for primitive types and type constructors (such as disjoint unions and cartesian products). Given this information a generic function can be specialized to arbitrary Haskell datatypes. The key idea of the approach is to model types by terms of the simply typed -calculus augmented by a family of recursion operators. While co...
