Datatype-generic programming

51Citations
Citations of this article
64Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Gibbons, J. (2007). Datatype-generic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4719 LNCS, pp. 1–71). Springer Verlag. https://doi.org/10.1007/978-3-540-76786-2_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free