An Introduction to the Theory of Lists
In these lectures we introduce a notation and a calculus for specifying and manipulating computable functions over lists. The calculus is used to derive efficient solutions for a number of problems, including problems in text processing. Although programming per se is not the main topic, we indicate briefly how these solutions can be implemented in a purely functional programming language.
KeywordsGreedy Algorithm Identity Element Directed Reduction Injective Function Empty List
Unable to display preview. Download preview PDF.
- 3.Bird, R.S. and Hughes, R.J.M. The alpha-beta algorithm: an exercise in program transformation. Inf. Proc. Letters (to appear 1986).Google Scholar
- 4.Bird, R.S. and Meertens L.G.L.T Two exercises found in a book on algorithmics. Proc. TC2 Conference on Program Specification and Transformation, Bad Tolz, W. Germany 1986 (to appear Springer LNCS 1986).Google Scholar
- 5.Bird, R.S. and Wadler, P. An Introduction to Functional Programming Prentice-Hall (to be published 1987).Google Scholar
- 6.Meertens, L.G.L.T Algorithmics — towards programming as a mathematical activity. Proc. CWI Symp. on Mathematics and Computer Science, CWI Monographs, North-Holland, 1 (1986) 289–334.Google Scholar
- 7.Turner, D. Recursion equations as a programming language. Functional Programming and its Applicatons, Cambridge University Press, Cambridge, U.K. 1982.Google Scholar