Program synthesis from natural deduction proofs

Authors:
Shigeki Goto
Affiliations:
Musashino Electrical Communication Laboratory, Nippon Telegraph and Telephone Public Corporation, Tokyo, Japan
Venue:
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
Year:
1979

Citing 3
Cited 3

Toward automatic program synthesis

Communications of the ACM
Program synthesis through Gödel's interpretation

Proceedings of the International Conference on Mathematical Studies of Information Processing
Towards a mathematical theory of program synthesis

IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 2

A Selected Bibliography on Constructive Mathematics, Intuitionistic Type Theory and Higher Order Deduction

Journal of Symbolic Computation
Mechanical translation of set theoretic problem specifications into efficient RAM code-A case study

Journal of Symbolic Computation
Theory of Judgments and Derivations

Progress in Discovery Science, Final Report of the Japanese Discovery Science Project

Quantified Score

Hi-index	0.00

Visualization

Abstract

There have already been many program synthesizers which are based on classical logic. There is, however, some evidence that intuitionistic logic is more suitable for computer programs. This paper presents a program synthesis method based on intuitionistic logic. The synthesizing method is essentially an application of Godel's interpretation. An experimental program synthesizer NJL, which performs Godel's interpretation, is implemented in LISP. NJL takes natural deduction proofs as input and produces LISP programs.