Skip to main content
SpringerLink
Log in

Predicative programming revisited

  • Lectures
  • Conference paper
  • First Online:
Mathematical Methods of Specification and Synthesis of Software Systems '85 (MMSSS 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 215))

  • 145 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • 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 

  • Bibel, W. (1976), A uniform approach to programming, Technical Report 7633, Technische Universität München.

    Google Scholar 

  • Bibel, W. (1980), Syntax-directed, semantics-supported program synthesis, Artificial Intelligence 14, pp.243–261.

    Google Scholar 

  • Bibel, W. (1981), Logical program synthesis; In: Proceedings Int. Conference on Fifth Generation Computer Systems, (T. Moto-oka, ed.), North-Holland.

    Google Scholar 

  • Bibel, W. (1982), Automated theorem proving, Vieweg, Braunschweig.

    Google Scholar 

  • Bibel, W. (1983), Matings in matrices, CACM 26, 844–852.

    Google Scholar 

  • 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 

  • Bibel, W. (1985), A deductive solution for plan generation, Technical Report CS-1985-7, Duke University (submitted to New Generation Journal).

    Google Scholar 

  • 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 

  • Biermann, A.W., Automatic programming: A tutorial on formal methodologies, Journal on Symbolic Computation, vol. 1, no.2 (to appear).

    Google Scholar 

  • Biermann, A.W., Guiho, G., eds. (1983), Computer program synthesis methodologies, Reidel, Dordrecht.

    Google Scholar 

  • Biermann, A.W., Guiho, G., Kodratoff, Y., eds. (1984), Automated program construction techniques, Macmillan, NewYork.

    Google Scholar 

  • Broy, M. (1983), Program construtions by transformations; In: Biermann et al. (1983), pp. 1–49.

    Google Scholar 

  • Dershowitz, N., Plaisted, D. (1984), Logic programming cum applicative, programming. Symposium on Logic Programming, Boston, July 1985, (to appear).

    Google Scholar 

  • Fronhöfer, B. (1984), Heuristics for recursion improvement, ECAI-84 (T. O'Shea, ed.), North-Holland, Amsterdam.

    Google Scholar 

  • Green, C. (1969), Application of theorem proving to problem solving, IJCAI-69, Kaufmann, Los Altos CA, 219–239.

    Google Scholar 

  • 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 

  • Hehner, E. (1984), Predicative programming, CACM 27, 134–151.

    Google Scholar 

  • 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 

  • Kowalski, R. (1979), Logic for problem solving, North Holland, New York NY.

    Google Scholar 

  • Manna, Z., Waldinger, R. (1971), Toward automatic program synthesis, CACM 14, pp. 151–165.

    Google Scholar 

  • Manna, Z., Waldinger, R. (1984), A deductive approach to program synthesis; In: Biermann et al. (1984), pp. 33–68.

    Google Scholar 

  • Nilsson, N.J. (1980), Principles of Artificial Intelligence, Tioga, Palo Alto CA.

    Google Scholar 

  • Shapiro, E. (1983), An algorithm that infers theories from facts, IJCAI-81, Kaufmann, Los Altos, pp. 446–451.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. TU München, Germany

    W. Bibel

  2. Duke University, Durham, NC, USA

    W. Bibel

Authors
  1. W. Bibel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Bibel Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bibel, W. (1986). Predicative programming revisited. In: Bibel, W., Jantke, K.P. (eds) Mathematical Methods of Specification and Synthesis of Software Systems '85. MMSSS 1985. Lecture Notes in Computer Science, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16444-8_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-16444-8_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16444-9

  • Online ISBN: 978-3-540-39784-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation