Predicative programming revisited

  • W. Bibel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 215)


This paper analyzes the problem of program synthesis at various levels of detail. At the highest level we distinguish a number of problem areas which are addressed in the subject as a whole. The goals, achievements and perspectives of each of these areas are briefly reviewed. At the next lower level we outline techniques which have been applied partially in the context of the LOPS project, or which, to our opinion, are worth further elaboration. Occasionally, we work out at the technical level specific features which seem to need clarification. The connection method will be the deductive tool on this level of detail, where especially two new results of interest are achieved. One concerns the functionalization of PROLOG programs, the other the extension of PROLOG's relative efficiency to formulas beyond those in Horn-form.


predicative programming program synthesis program construction LOPS connection method 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bibel, W. (1974), Programmieren in der Sprache der Prädikatenlogik, Habilitationsarbeit (rejected), Technische Universität München; shortened version appeared as: Prädikatives Programmieren, LNCS 33, Springer, Berlin, 274–283 (english version available as a report entitled: Predicative programming).Google Scholar
  2. Bibel, W. (1976), A uniform approach to programming, Technical Report 7633, Technische Universität München.Google Scholar
  3. Bibel, W. (1980), Syntax-directed, semantics-supported program synthesis, Artificial Intelligence 14, pp.243–261.Google Scholar
  4. Bibel, W. (1981), Logical program synthesis; In: Proceedings Int. Conference on Fifth Generation Computer Systems, (T. Moto-oka, ed.), North-Holland.Google Scholar
  5. Bibel, W. (1982), Automated theorem proving, Vieweg, Braunschweig.Google Scholar
  6. Bibel, W. (1983), Matings in matrices, CACM 26, 844–852.Google Scholar
  7. Bibel, W. (1984), Software — Eine Studie aus der Perspektive der Künstlichen Intelligenz, Report ATP-27-IV-84, Technische Universität München.Google Scholar
  8. Bibel, W. (1985), A deductive solution for plan generation, Technical Report CS-1985-7, Duke University (submitted to New Generation Journal).Google Scholar
  9. Bibel, W., Hörnig, K.M., (1984), LOPS — A system based on a strategical approach to program synthesis; In: Biermann et al. (1984).Google Scholar
  10. Biermann, A.W., Automatic programming: A tutorial on formal methodologies, Journal on Symbolic Computation, vol. 1, no.2 (to appear).Google Scholar
  11. Biermann, A.W., Guiho, G., eds. (1983), Computer program synthesis methodologies, Reidel, Dordrecht.Google Scholar
  12. Biermann, A.W., Guiho, G., Kodratoff, Y., eds. (1984), Automated program construction techniques, Macmillan, NewYork.Google Scholar
  13. Broy, M. (1983), Program construtions by transformations; In: Biermann et al. (1983), pp. 1–49.Google Scholar
  14. Dershowitz, N., Plaisted, D. (1984), Logic programming cum applicative, programming. Symposium on Logic Programming, Boston, July 1985, (to appear).Google Scholar
  15. Fronhöfer, B. (1984), Heuristics for recursion improvement, ECAI-84 (T. O'Shea, ed.), North-Holland, Amsterdam.Google Scholar
  16. Green, C. (1969), Application of theorem proving to problem solving, IJCAI-69, Kaufmann, Los Altos CA, 219–239.Google Scholar
  17. Guiho, G., Gresse, G., Program synthesis from incomplete specifications, 5th Conf. Automated Deduction (W. Bibel et al., eds.), Lecture Notes in CS 87, Springer, Berlin.Google Scholar
  18. Hehner, E. (1984), Predicative programming, CACM 27, 134–151.Google Scholar
  19. Kodratoff, Y., Jouannaud, J.-P., Synthesizing LISP programs working on the list level of embedding; In: Biermann et al. (1984), pp. 325–374.Google Scholar
  20. Kowalski, R. (1979), Logic for problem solving, North Holland, New York NY.Google Scholar
  21. Manna, Z., Waldinger, R. (1971), Toward automatic program synthesis, CACM 14, pp. 151–165.Google Scholar
  22. Manna, Z., Waldinger, R. (1984), A deductive approach to program synthesis; In: Biermann et al. (1984), pp. 33–68.Google Scholar
  23. Nilsson, N.J. (1980), Principles of Artificial Intelligence, Tioga, Palo Alto CA.Google Scholar
  24. Shapiro, E. (1983), An algorithm that infers theories from facts, IJCAI-81, Kaufmann, Los Altos, pp. 446–451.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • W. Bibel
    • 1
    • 2
  1. 1.TU MünchenGermany
  2. 2.Duke UniversityDurhamUSA

Personalised recommendations