Abstract
The subject of these lectures is a calculus of functions for deriving programs from their specifications. This calculus consists of a range of concepts and notations for defining functions over various data types — including lists, trees, and arrays — together with their algebraic and other properties. Each lecture begins with a specific problem, and the theory necessary to solve it is then developed. In this way we hope to show that a functional approach to the problem of systematically calculating programs from their specifications can take its place alongside other methodologies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
De Moor, O. and Swierstra, D. The low segment problem. Presentation at WG2. 1, Rome, March 1988.
Rem, M. Small programming exercises. Science of Computer Programming. 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bird, R.S. (1989). Lectures on Constructive Functional Programming. In: Broy, M. (eds) Constructive Methods in Computing Science. NATO ASI Series, vol 55. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-74884-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-74884-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-74886-8
Online ISBN: 978-3-642-74884-4
eBook Packages: Springer Book Archive