A theorem about automatic programming

Authors:
Peter Kugel
Affiliations:
Boston College, Chestnut Hill, Mass.
Venue:
ACM SIGART Bulletin
Year:
1975

Citing 1
Cited 3

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability

A Methodology for LISP Program Construction from Examples

Journal of the ACM (JACM)
A methodology for LISP program construction from examples

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
What can a computer learn from examples?

ACM SIGART Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

An automatic programming system is a system (usually a programmed computer) that generates a program from partial information about that program (Figure 1). Looked at in this general way, automatic programming systems are hardly new. Assemblers are automatic programming systems. So are compilers, debugging systems, and even loaders. In this paper, I propose to focus on systems that "do more" than such systems in the sense that they require less complete information about the programs they are to generate.