Advertisement

GWAI-84 pp 229-237 | Cite as

Improvement of Recursive Programs from a Logic Programming Point of View

  • B. Fronhöfer
  • R. Caferra
  • P. Jacquet
Conference paper
Part of the Informatik Fachberichte book series (INFORMATIK, volume 103)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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
  2. [BUR 77]
    Burstall R., Darlington J.: “A transformation system for developing recursive programs” JACM, Vol.24 No 1, January 1977, pp.44–67.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [CLA 78]
    Clark K.: “Negation as failure” in “Logic and data bases” (Gallaire, Minker Eds.) Plenum Press 1978, pp.293–322.CrossRefGoogle Scholar
  4. [HOG 81]
    Hogger C.J.: “Derivation of logic programs” JACM, Vol. 28, No. 2, April 1981, pp. 372–392.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • B. Fronhöfer
    • 1
  • R. Caferra
    • 2
  • P. Jacquet
    • 2
  1. 1.Institut für InformatikTU MünchenMünchen 2Germany
  2. 2.LIFIA - IMAGSaint Martin d’Heres CedexFrance

Personalised recommendations