An Exercise in Polytypic Program Derivation: repmin

An Exercise in Polytypic Program Derivation: repmin (1996)

by Oege De Moor

Citations:

3 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	An Exercise in Polytypic Program Derivation: repmin	user correction - Legacy Corrections
AUTHOR NAME	Oege De Moor	SVM HeaderParse 0.1
ABSTRACT	A program derivation is said to be polytypic if some of its parameters are data types. The repmin problem is to replace all elements of a tree of numbers by the minimum element, making only a single pass over the original tree. Here we present a polytypic derivation for that problem. The derivation has an unusual feature: when interpreted in the category of relations, the resulting program is the well-known cyclic logic program, and when interpreted in the category of functions, it is the well-known higher-order functional solution. 1 Motivation Suppose I were to show you a derivation of a shortest path algorithm, and my whole presentation was in terms of numbers, addition and minimum. Undoubtedly some of you would get up and point out that by abstracting over the operations and recording their algebraic properties, I could have derived a whole class of algorithms instead of one particular program. Indeed, such abstraction over operations is now commonly accepted as one of the hallmar...	user correction - Legacy Corrections
YEAR	1996	INFERENCE
CITATIONS	13 found	ParsCit 1.0