In: Carroll Morgan and Jim Woodcock (editors), Mathematics of Program Construction, Lecture Notes in Computer Science 669, pp. 45-66, 1993.

Authors: Richard S. Bird and Oege de Moor
>

Abstract

We investigate when the solution of an optimisation problem (such as computing a minimum spanning tree) can be expressed in terms of structural recursion. The investigation is conducted using a categorical calculus of datatypes, and an algebra of relations to account for nondeterminism.

(PS)

BIBTEX:

           @inproceedings{mpc93bird, 
           author = "Richard S. Bird and Oege de Moor",
           title = "Solving optimisation problems with catamorphisms", 
           booktitle = "Mathematics of Program Construction", 
           editor = "C. C. Morgan and J. C. P. Woodcock",
           series = "Lecture Notes in Computer Science",
           volume = "669",
           pages = "45-69",
           year = "1993"}