Skip to main content
SpringerLink
Log in
Book cover

Mathematical Studies of Information Processing pp 302–325Cite as

Program synthesis through Gödel's interpretation

  • Conference paper
  • First Online:

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

Abstract

This paper develops a program synthesis method based upon intuitionistic logic. This method is essentially an application of Gödel's interpretation which is also called Dialectica interpretation. By the use of Gödel's interpretation, it is possible to transform proof figures of intuitionistic number theory into primitive recursive functionals. The present concept is that primitive recursive functionals can be represented by LISP programs. Consequently, proof figures can be transformed into computer programs. To confirm this idea experimentally, a program synthesizer GDL0, which is a PDP-11 (DEC) program, is implemented. GDL0 experimental applications results are presented.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Gödel, Uber eine bisher noch nicht benützte Erweiterung des finiten Standpunktes, Dialectica, 12, pp. 280–287, 1958.

    Google Scholar 

  2. S. Goto, Foundation of automatic program synthesis: an application of Gödel's interpretation (in Japanese), I.E.C.E., Japan, AL77-16, June, 1977.

    Google Scholar 

  3. G. Takeuti and M. Yasugi, Foundation of Mathematics (in Japanese), Kyoritsu Publ. Co., Tokyo, 1974.

    Google Scholar 

  4. A.S.Troelstra, Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Math. 344, Springer, 1973.

    Google Scholar 

  5. J.R.Hindley, B.Lercher and J.P.Seldin, Introduction to Combinatory Logic, Cambridge Univ. Press, 1972.

    Google Scholar 

  6. S.C.Kleene, Introduction to Metamathematics, North-Holland, 1952.

    Google Scholar 

  7. M.E.Szabo (ed), The collected papers of Gerhard Gentzen, North-Holland, 1969.

    Google Scholar 

  8. R.L.Constable, A constructive programming logic, Proceeding of IFIP Congress, pp. 733–738, 1977.

    Google Scholar 

  9. D.S.Scott, Logic and Programming Languages, CACM, vol.20, no.9, Stetember, 1977.

    Google Scholar 

  10. I.Takeuchi and H.Okuno, A list processor LIPQ, 2nd USA-JAPAN Computer Conference Proceedings, pp.416–421, August, 1975.

    Google Scholar 

  11. L.H.Quam and W.Diffie, Stanford LISP1.6 manual, Stanford A.I.Laboratory Operating Note 28.7.

    Google Scholar 

  12. Z. Manna and R.J. Waldinger, Toward Automatic Program Synthesis, Comm. of the ACM, vol.14, no.3, pp.151–165, 1971.

    Google Scholar 

  13. M.Sato, private communication, 1978.

    Google Scholar 

  14. S.Takasu, Proofs and Programs, The Third IBM symposium on Mathematical Foundation of Computer Science, August, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Musashino Electrical Communication Laboratory, Nippon Telegraph and Telephone Public Corporation, Musashino-shi, 180, Tokyo, Japan

    Shigeki Goto

Authors
  1. Shigeki Goto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. K. Blum M. Paul S. Takasu

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goto, S. (1979). Program synthesis through Gödel's interpretation. In: Blum, E.K., Paul, M., Takasu, S. (eds) Mathematical Studies of Information Processing. Lecture Notes in Computer Science, vol 75. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09541-1_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-09541-1_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09541-5

  • Online ISBN: 978-3-540-35010-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation