Program synthesis through Gödel's interpretation

Shigeki Goto*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationMathematical Studies of Information Processing - Proceedings of the International Conference
Number of pages24
ISBN (Print)9783540095415
Publication statusPublished - 1979 Jan 1
Externally publishedYes
EventInternational Conference on Mathematical Studies of Information Processing, 1978 - Kyoto, Japan
Duration: 1978 Aug 231978 Aug 26

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume75 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


OtherInternational Conference on Mathematical Studies of Information Processing, 1978

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Program synthesis through Gödel's interpretation'. Together they form a unique fingerprint.

Cite this