1997
DOI: 10.1007/3-540-63237-9_23
|View full text |Cite
|
Sign up to set email alerts
|

An implementation of Eden on top of concurrent Haskell

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1998
1998
1998
1998

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…3 For the channels to connect unique writers to unique readers, it is checked at runtime that no other process has connected to this channel before.…”
Section: Edenmentioning
confidence: 99%
See 1 more Smart Citation
“…3 For the channels to connect unique writers to unique readers, it is checked at runtime that no other process has connected to this channel before.…”
Section: Edenmentioning
confidence: 99%
“…In contrast to the prototype implementation described in [3], the distributed implementation presented in this paper incorporates a parallel runtime system that is specifically tailored for Eden. It follows the lines of other implementations of functional languages: full Eden is first desugared and translated into a core language called PEARL (Parallel Eden Abstract Reduction Language), then this language is conceptually interpreted by an abstract distributed machine called DREAM (DistRibuted Eden Abstract Machine).…”
Section: Introductionmentioning
confidence: 99%