Functional Algorithm Design
- 1 January 1995
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Algebraic calculation of graph and sorting algorithmsPublished by Springer Nature ,2006
- The Algebra of ProgrammingPublished by Springer Nature ,1996
- State in HaskellHigher-Order and Symbolic Computation, 1995
- Functional programming with bananas, lenses, envelopes and barbed wirePublished by Springer Nature ,1991
- Formal derivation of a pattern matching algorithmScience of Computer Programming, 1989
- Homomorphisms and promotabilityPublished by Springer Nature ,1989
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- A synthesis of several sorting algorithmsActa Informatica, 1978
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- AlgorithmsCommunications of the ACM, 1964