A laboratory for the study of automating programming

Authors:
T. E. Cheatham, Jr.;Ben Wegbreit
Affiliations:
Harvard University, Cambridge, Massachusetts;Harvard University, Cambridge, Massachusetts
Venue:
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Year:
1971

Citing 12
Cited 1

Experiments with a Heuristic Compiler

Journal of the ACM (JACM)
Nondeterministic Algorithms

Journal of the ACM (JACM)
Automatic Theorem Proving With Renamable and Semantic Resolution

Journal of the ACM (JACM)
Experiments with a deductive question-answering program

Communications of the ACM
An interpretation oriented theorem prover over integers

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Translating recursion equations into flow charts

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
The use of theorem-proving techniques in question-answering systems

ACM '68 Proceedings of the 1968 23rd ACM national conference
Micro-Planner Reference Manual

Micro-Planner Reference Manual
An algebraic definition of simulation between programs

An algebraic definition of simulation between programs
A program verifier

A program verifier
The application of theorem proving to question-answering systems

The application of theorem proving to question-answering systems
The ECL programming system

AFIPS '71 (Fall) Proceedings of the November 16-18, 1971, fall joint computer conference

Technology for automatic generation of application programs: a pragmatic view

MIS Quarterly

Quantified Score

Hi-index	0.00

Visualization

Abstract

We are concerned in this paper with facilities, tools, and techniques for automating programming and thus we had best commence with discussing what we mean by programming. Given a precise specification of some task to be accomplished or some abstract object to be constructed, programming is the activity of producing an algorithm or procedure---a program---capable of performing the task or constructing a representation of the object on some computing system. The initial specifications and the resulting program are both couched in some (programming) language---perhaps the same language. The process typically involves such activities as: choosing efficient representations for data and algorithms, taking advantage of known or deduced constraints on data and algorithms to permit more efficient computations, verifying (proving) that the task will be accomplished or that the object constructed is, in fact, the one desired, demonstrating that certain performance criteria are met, and so on.