Deriving an applicative heapsort algorithm
FacultiesFakultät für Informatik
LicenseStandard (Fassung vom 03.05.2003)
We proceed by program transformation to derive a version of the Heapsort algorithm from a non-deterministic specification. The object language is Haskell and, therefore, the style of the resulting Heapsort program is necessarily applicative. Our development is supported by the program transformation system Ultra. Although a valuable tool, several shortcomings of Ultra are identified.