Author:
Bird Richard,De Moor Oege,Hoogendijk Paul
Abstract
AbstractA generic functional 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.
Publisher
Cambridge University Press (CUP)
Reference23 articles.
1. Deforestation: transforming programs to eliminate trees
2. A 2-categorical approach to geometric morphisms I;Carboni;Cahiers de topologie et geometrie differentielle categoriques,1991
3. Gibbons J. (1991) Algebras for tree algorithms. DPhil thesis, Programming Research Group, Computing Laboratory, Oxford University.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Practical generic programming over a universe of native datatypes;Proceedings of the ACM on Programming Languages;2022-08-29
2. Polymorphic Session Processes as Morphisms;The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy;2019
3. Incremental computing with data structures;Science of Computer Programming;2018-10
4. Incremental Computing with Abstract Data Structures;Functional and Logic Programming;2016
5. Programming from Galois connections;The Journal of Logic and Algebraic Programming;2012-08