Using Underspecification in the Derivation of some Optimal Partition Algorithms

@inproceedings{Fokkinga1990UsingUI,
  title={Using Underspecification in the Derivation of some Optimal Partition Algorithms},
  author={Maarten M. Fokkinga},
  year={1990}
}
Indeterminacy is inherent in the specification of optimal partition (and many more) algorithms, even though the algorithms themselves may be fully determinate. Indeterminacy is a notoriously hard phenomenon to deal with in a purely functional setting. In the paper “A Calculus Of Functions for Program Derivation” R. S. Bird tries to handle it by using underspecified functions. (Other authors have proposed to use ‘indeterminate’ functions, and to use relations instead of functions.) In this paper… CONTINUE READING