Algorithms from Theorems (1990)
by
Johan Jeuring
,
Johan Jeuring
| Venue: | Programming Concepts and Methods |
| Citations: | 11 - 5 self |
BibTeX
@INPROCEEDINGS{Jeuring90algorithmsfrom,
author = {Johan Jeuring and Johan Jeuring},
title = {Algorithms from Theorems},
booktitle = {Programming Concepts and Methods},
year = {1990},
pages = {247--266},
publisher = {North-Holland}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we show how algorithms are derived from their specification in the Bird-Meertens form,dl,m. The Bird-Meertens formalism is a programming methodology which provides a concise functional notation for algorithms and for every data structure a promotion theorem for proving equalities of functions.
Citations
| 8882 | Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979 |
| 1224 | Lectures on constructive functional programming - Bird - 1989 |
| 205 | An introduction to the theory of lists - Bird - 1987 |
| 11 | Transformational programming and the paragraph problem - Bird - 1986 |
| 7 | List partitions - Bird, Moor - 1993 |
| 6 | Deriving algorithms on binary labelled trees - Jeuring - 1989 |
| 2 | Lecture notes on nub theory - Moor, Bird - 1989 |
| 1 | An exploration of the Bird-Meertens formalism. Tzical Report Computing Science Notes - Backhouse - 1988 |
| 1 | A synthesis of several sorting algorithms - Darhngton - 1978 |
| 1 | The derivation of an algorithm for finding palindromes - Jeuring - 1989 |
