Generic functional programming with types and relations
- 1 January 1996
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Functional Programming
- Vol. 6 (1) , 1-28
- https://doi.org/10.1017/s0956796800001556
Abstract
Agenericfunctional program is one which is parameterised by datatype. By installing specific choices, for example lists or trees, different programs are obtained that are, nevertheless, abstractly the same. The purpose of this paper is to explore the possibility of deriving generic programs. Part of the theory of lists that deals with segments is recast as a theory about ‘segments’ in a wide class of datatypes, and then used to pose and solve a generic version of a well-known problem.Keywords
This publication has 12 references indexed in Scilit:
- The Algebra of ProgrammingPublished by Springer Nature ,1996
- A system of constructor classesPublished by Association for Computing Machinery (ACM) ,1993
- Virtual data structuresPublished by Springer Nature ,1993
- Elements of a relational theory of datatypesPublished by Springer Nature ,1993
- Data structures and program transformationScience of Computer Programming, 1990
- Deforestation: transforming programs to eliminate treesTheoretical Computer Science, 1990
- Lectures on Constructive Functional ProgrammingPublished by Springer Nature ,1989
- Algebraic Identities for Program CalculationThe Computer Journal, 1989
- Toposes, Triples and TheoriesPublished by Springer Nature ,1985
- Algebraic specification of data types: A synthetic approachTheory of Computing Systems, 1981