Datatype-generic programming
Cached
Download Links
| Venue: | Spring School on Datatype-Generic Programming, volume 4719 of Lecture Notes in Computer Science |
| Citations: | 34 - 11 self |
BibTeX
@INPROCEEDINGS{Gibbons_datatype-genericprogramming,
author = {Jeremy Gibbons},
title = {Datatype-generic programming},
booktitle = {Spring School on Datatype-Generic Programming, volume 4719 of Lecture Notes in Computer Science},
year = {},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Generic programming aims to increase the flexibility of programming languages, by expanding the possibilities for parametrization — ideally, without also expanding the possibilities for uncaught errors. The term means different things to different people: parametric polymorphism, data abstraction, meta-programming, and so on. We use it to mean polytypism, that is, parametrization by the shape of data structures rather than their contents. To avoid confusion with other uses, we have coined the qualified term datatype-generic programming for this purpose. In these lecture notes, we expand on the definition of datatype-generic programming, and present some examples of datatypegeneric programs. We also explore the connection with design patterns in object-oriented programming; in particular, we argue that certain design patterns are just higher-order datatype-generic programs. 1
