A Novel Approach to Parenting in Functional Program Evaluation
by
Julian Dermoudy School
BibTeX
@MISC{School_anovel,
author = {Julian Dermoudy School},
title = {A Novel Approach to Parenting in Functional Program Evaluation},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The ability for multiple threads to enter the same graph node without contention and conflict is a necessary component of the graph reduction of functional languages since graph components may be shared. Shared closures, however, compound the difficulty of priority management.
Citations
| 997 | The Lambda Calculus: its Syntax and Semantics - Barendregt - 1984 |
| 515 | D.: Implementation of Functional Programming Languages - Jones, Lester - 1987 |
| 28 | Granularity in large-scale parallel functional programming - Loidl - 1998 |
| 26 | A high performance architecture for parallel graph reduction - Jones - 1987 |
| 8 | Semantics of PH: A Parallel Dialect of Haskell - Aidtya, Arvind, et al. - 1995 |
| 8 | The Glasgow Haskell compiler: a retrospective - Hall, Hammond, et al. - 1992 |
| 6 | Bypassing of Channels in Eden - Klusik, Pena, et al. - 2000 |
| 3 | Effective Runtime Management of Parallelism in a Functional Programming Context - Dermoudy - 2002 |
| 3 | A Strategic Profiler for Glasgow Parallel Haskell - King, Hall, et al. - 1998 |
| 1 | Implementing Speculative Evaluation - Dermoudy - 1999 |
| 1 | GRAPH for PVM: Graph Reduction for Distributed Hardware - Loidl - 1994 |
