Automatic Program Synthesis in Second-Order Logic
Proceedings of the Third International Joint Conference on Artificial Intelligence. Automatic Programming. Pages 537-541.
Abstract
A resolution-based theorem prover, incorporating a restricted higher-order unification algorithm, has been applied to the automatic synthesis of SNOBOL-4 programs. The set of premisses includes second-order assignment and iteration axioms derived from those of Hoare. Two examples are given of the synthesis of programs that compute elementary functions.
Jared L. Darlington. 1973. Automatic Program Synthesis in Second-Order Logic. In Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73. IJCAI, 537–541. https://ijcai.org/proceedings/1973/67
Darlington, J. L. (1973). Automatic Program Synthesis in Second-Order Logic. In Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73 (pp. 537–541). IJCAI. https://ijcai.org/proceedings/1973/67
@inproceedings{ijcai1973p67,
title = {Automatic Program Synthesis in Second-Order Logic},
author = {Darlington, Jared L.},
booktitle = {Proceedings of the Third International Joint Conference on
Artificial Intelligence, {IJCAI-73}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Nils J. Nilsson},
pages = {537--541},
year = {1973},
month = {8},
note = {Automatic Programming},
url = {https://ijcai.org/proceedings/1973/67},
}
TY - CPAPER TI - Automatic Program Synthesis in Second-Order Logic AU - Darlington, Jared L. T2 - Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73 PB - International Joint Conferences on Artificial Intelligence PY - 1973 SP - 537 EP - 541 UR - https://ijcai.org/proceedings/1973/67 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
