Program synthesis through Gödel's interpretation

  • Shigeki Goto
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 75)


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.


Free Variable Finite Type Intuitionistic Logic Natural Deduction Program Synthesis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K. Gödel, Uber eine bisher noch nicht benützte Erweiterung des finiten Standpunktes, Dialectica, 12, pp. 280–287, 1958.Google Scholar
  2. [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. [3]
    G. Takeuti and M. Yasugi, Foundation of Mathematics (in Japanese), Kyoritsu Publ. Co., Tokyo, 1974.Google Scholar
  4. [4]
    A.S.Troelstra, Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Math. 344, Springer, 1973.Google Scholar
  5. [5]
    J.R.Hindley, B.Lercher and J.P.Seldin, Introduction to Combinatory Logic, Cambridge Univ. Press, 1972.Google Scholar
  6. [6]
    S.C.Kleene, Introduction to Metamathematics, North-Holland, 1952.Google Scholar
  7. [7]
    M.E.Szabo (ed), The collected papers of Gerhard Gentzen, North-Holland, 1969.Google Scholar
  8. [8]
    R.L.Constable, A constructive programming logic, Proceeding of IFIP Congress, pp. 733–738, 1977.Google Scholar
  9. [9]
    D.S.Scott, Logic and Programming Languages, CACM, vol.20, no.9, Stetember, 1977.Google Scholar
  10. [10]
    I.Takeuchi and H.Okuno, A list processor LIPQ, 2nd USA-JAPAN Computer Conference Proceedings, pp.416–421, August, 1975.Google Scholar
  11. [11]
    L.H.Quam and W.Diffie, Stanford LISP1.6 manual, Stanford A.I.Laboratory Operating Note 28.7.Google Scholar
  12. [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. [13]
    M.Sato, private communication, 1978.Google Scholar
  14. [14]
    S.Takasu, Proofs and Programs, The Third IBM symposium on Mathematical Foundation of Computer Science, August, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Shigeki Goto
    • 1
  1. 1.Musashino Electrical Communication LaboratoryNippon Telegraph and Telephone Public CorporationTokyoJapan

Personalised recommendations