Describes a comparison between two models for the parallel evaluation of functional languages: the well-known 'graph reduction model' and the model we have ...
This paper describes a comparison between two models for parallel evaluation of functional languuges : the well- known gruph reduction model und the model ...
A comparison between the graph reduction model and an original parallel evaluation scheme for functional languages ; Q1. Association for Computing Machinery (ACM).
developing fast implementations of lazy functional languages, based on graph reduction, ... graph reduction in a common graph - this is the shared memory model.
1993 Euromicro Workshop on Parallel and Distributed Processing
www.computer.org › proceedings › empdp
A comparison between the graph reduction model and an original parallel evaluation scheme for functional languages pp. 124,125,126,127,128,129,130. Mesh ...
Graph reduction is a particularly attractive execution model for parallel systems, for the following reasons. There is no sequential concept of 'program counter ...
Graph reduction is now considered as an important com- puting model for direct evaluation of functional language programs. [6]. The basis of graph reduction is ...
Comparisons thus far have been based on implementations that do not necessarily represent the best mapping of graph reduction onto conventional hardware. 2.1.3.
Missing: original | Show results with:original
This book illustrates the techniques of functional programming in Miranda and Clean, and focuses on the computational model of Graph Rewriting Systems for both ...
Missing: original scheme
Parallel graph reduction is an attractive implementation for functional programming languages because of its simplicity and inherently distributed nature.