It has earlier been assumed that a compositional approach to algorithm design and program transformation is somehow unique to functional programming. With this talk we hope to demonstrate that some of the same techniques and results are applicable to logic programming as well.
Presented at the Nottingham Workshop on Generic Programming.
This paper uses notions like foldr and program tranformation in the context of Prolog programming (more precisely, Prolog embedded in Haskell). These provably correct transformations can, for example, reduce program run time by introducing an accumulator.
Posted to Logic/Declerative by Ehud Lamm on 2/8/02; 8:27:18 AM