Data sharing in an FFP machine

Authors:
Gyula Magó
Affiliations:
-
Venue:
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Year:
1982

Citing 12
Cited 2

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Programming language semantics and closed applicative languages

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Data Structure Techniques

Data Structure Techniques
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Introduction to VLSI Systems

Introduction to VLSI Systems
ALICE a multi-processor reduction machine for the parallel evaluation CF applicative languages

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Copying operands versus copying results: A solution to the problem of large operands in FFP'S

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Optimal associative searching on a cellular computer

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Programming in reduction languages.

Programming in reduction languages.
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)

Compiling prolog programs for parallel execution on a cellular machine

ACM '84 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge
Supporting tasks with adaptive groups in data parallel programming

International Journal of Computational Science and Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The possibility of expressing data sharing in FPs is discussed. The Paterson-Wegman unification algorithm is considered, in which data sharing is indispensable to achieve efficient (linear time) execution. An FP implementation of this algorithm is shown to execute in linear time on an FFP machine. “Associative” versions of some of Backus's FP functions and combining forms appear to be very useful in dealing with irregular data objects such as graphs.