zbMATH — the first resource for mathematics

The algebra of programming. (English) Zbl 0847.68014
Broy, Manfred (ed.), Deductive program design. Proceedings of the NATO Advanced Study Institute, Marktoberdorf, Germany, July 26–August 7, 1994. Berlin: Springer-Verlag. NATO ASI Ser., Ser. F, Comput. Syst. Sci. 152, 167-203 (1996).
Summary: In these lecture notes we describe an algebraic approach to programming, suitable both for the derivation of individual programs and for the study of programming techniques in general. The programming techniques we have in mind are those paradigms and strategies of program construction, such as dynamic programming, greedy algorithms, exhaustive search, and divide and conquer, that form the core of most textbooks in Algorithm Design. We illustrate the main ideas in the context of optimization problems, developing one or two of the basic techniques used to solve them.
For the entire collection see [Zbl 0842.00044].

68N01 General topics in the theory of software
18B10 Categories of spans/cospans, relations, or partial maps
PDF BibTeX Cite