Topological Skeletons in Haskell#

Authors:
Francisco Heron de Carvalho Junior;Rafael Dueire Lins
Affiliations:
-;-
Venue:
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Year:
2003

Citing 0
Cited 4

The # model: separation of concerns for reconciling modularity, abstraction and efficiency in distributed parallel programming

Proceedings of the 2005 ACM symposium on Applied computing
A type-level approach to component prototyping

International workshop on Synthesis and analysis of component connectors: in conjunction with the 6th ESEC/FSE joint meeting
On the design of abstract binding connectors for high performance computing component models

Proceedings of the 2007 symposium on Component and framework technology in high-performance and scientific computing
An Institutional Theory for #-Components

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algorithmic skeletons is a powerful concept to describe patterns of concurrency in programming, abstracting from implementation. Haskell# is a coordination based distributed extension of Haskell. In this paper, it is shown how skeletons can be introduced into Haskell# at configuration level, by extending its notion of hierarchical composition of programs with process templates. The approach described herein is general enough to be applied to any configuration language. Its expressiveness, simplicity and elegance are demonstrated by examples, which also show its impact in Haskell# programming practice and performance.