EPILOG = PROLOG + Data Flow: arguments for combining PROLOG with a data driven mechanism

Authors:
Michael J. Wise
Affiliations:
University of New South Wales, New South Wales, Australia
Venue:
ACM SIGPLAN Notices
Year:
1982

Citing 7
Cited 2

Algorithm = logic + control

Communications of the ACM
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
A parallel Prolog: The construction of a data driven model

LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
System oriented extensions to dataflow

System oriented extensions to dataflow
Limits of the "algebraic" specification of abstract data types

ACM SIGPLAN Notices
Specifications of Majster's traversable stack and Veloso's traversable stack

ACM SIGPLAN Notices
LISP 1.5 Programmer's Manual

LISP 1.5 Programmer's Manual

Survey on special purpose computer architectures for AI

ACM SIGART Bulletin
A History of Data-Flow Languages

IEEE Annals of the History of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Spurred by the desire to construct multi- processor computer architectures, researchers have been proposing alternatives to the conventional wisdom of the Von Neumann design. One of the most Interesting and innovative of these is the class of machines based on the principle of data-flow - the order in which data-flow operations are executed is dependent solely on the availability of input data. The results of experiments with both real and simulated data-flow computers have, however, been rather less than earth shattering. It is the thesis of this work that PROLOG contains within it the seeds of a solution for the difficulties found in data-flow.The material contained in this work is a revision and substantial expansion of sections 2 and 3 of [Wise 82].