Language constructs for programming by example

Authors:
Robert V. Rubin
Affiliations:
-
Venue:
COCS '86 Proceedings of the third ACM-SIGOIS conference on Office information systems
Year:
1986

Citing 11
Cited 0

Smalltalk-80: the language and its implementation

Smalltalk-80: the language and its implementation
Programming in Prolog (2nd ed.)

Programming in Prolog (2nd ed.)
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Ancient Babylonian algorithms

Communications of the ACM
Programming primitives for database languages

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Universality of data retrieval languages

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A session with Tinker: Interleaving program testing with program design

LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Thinglab--a constraint-oriented simulation laboratory.

Thinglab--a constraint-oriented simulation laboratory.
Adaptive subject description in document retrieval

Adaptive subject description in document retrieval
Software psychology: Human factors in computer and information systems (Winthrop computer systems series)

Software psychology: Human factors in computer and information systems (Winthrop computer systems series)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Systems for programming by example permit the specification of algorithms through the use of demonstrations that manipulate examples. This paper analyzes systems for programming by example from a language point of view. Examples are analyzed as data abstractions, and demonstrations as abstractions for evaluation and control. Criteria are introduced for evaluating both the computational power and the expressiveness of the abstractions. The analysis demonstrates the existence of several previously unconsidered approaches to the more difficult problems associated with programming by example.