Graph-based communication in Eden

DOI10.1007/S10990-014-9101-YzbMATH Open1360.68330OpenAlexW2088516171MaRDI QIDQ526455FDOQ526455

Thomas Horstmeyer, Rita Loogen

Publication date: 15 May 2017

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-014-9101-y

zbMATH Keywords

functional programmingparallel computationcommunication topologiesprocess graphs

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cites Work

• Title not available (Why is that?)
• Algorithm + strategy = parallelism
• Title not available (Why is that?)
• Title not available (Why is that?)
• Understanding functional dependencies via constraint handling rules
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph-based communication in Eden
• Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach
• Type classes with existential types
• Parallel functional programming in Eden

Cited In (1)

• Graph-based communication in Eden

Uses Software

• Haskell
• Erlang
• Eden

This page was built for publication: Graph-based communication in Eden

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526455)