Improvement of Recursive Programs from a Logic Programming Point of View
This paper discusses within the setting of logic programming some techniques which were presented in [BUR 77] for the development of recursive programs. This approach reduces the mystery of some of the eureka in [BUR 77] by making them computationally feasible. Furthermore the idea to do folding and unfolding with the completed logic programs both facilitates and adds translucency to the procedure.
Unable to display preview. Download preview PDF.
- [BIB 75]Bibel W.: “Programmieren in der Sprache der Praedikatenlogik” Habilitationsarbeit (rejected), TU München 1975. Shortened Version: “Praedikatives Programmieren” in: Automata theory and formal languages, LNCS 33, Springer, Berlin 1975, pp.274–283.Google Scholar
- [BUR 77]
- [CLA 78]
- [HOG 81]