High level operations in automatic programming

Authors:
Jay Earley
Affiliations:
-
Venue:
Proceedings of the ACM SIGPLAN symposium on Very high level languages
Year:
1974

Citing 2
Cited 15

GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept

Communications of the ACM
The SNOBOL4 programming language

The SNOBOL4 programming language

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

Journal of Symbolic Computation
A categorized bibliography on incremental computation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theseus—a programming language for relational databeses

ACM Transactions on Database Systems (TODS)
Beyond programming languages

Communications of the ACM
Generalized common subexpressions in very high level languages

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An algebraic model for string patterns

POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Program improvement by internal specialization

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Inductively computable constructs in very high level languages

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Computational Divided Differencing and Divided-Difference Arithmetics

Higher-Order and Symbolic Computation
Applicative style programming, program transformation, and list operators

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
The design of usable programming languages

ACM '75 Proceedings of the 1975 annual conference
Goal-directed program transformation

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Connector functions: another view of the GOTO ?

ACM SIGPLAN Notices
On the feasibility of implementing a large relational data base with optimal performance on a minicomputer

VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
High level iterators and a method for automatically designing data structure representation

Computer Languages

Quantified Score

Hi-index	0.02

Visualization

Abstract

We discuss the thesis that one good way of achieving non-procedural or problem-oriented languages is by constructing higher and higher level procedural languages. We present a set of operations embedded in a programming language VERS2 which represent a higher level of description than currently exists. These include iterators (operations which, if written out, would normally involve an iteration over a group of objects), pattern matching facilities, implicitly specified data structures, and the ability to place constraints on data structures.