Combining relational calculus and the DijkstraGries method for deriving relational programs
We show how to derive imperative programs for relation-based discrete structures by combining relational calculus and the DijkstraGries method. Three examples are given, viz. Warshall's algorithm for transitive closures, a breadth-first-search reachability algorithm, and an algorithm for spanning trees.
relational programs program derivation relational algebra graph theory