Skip to main content
Conference ProceedingsOPEN ACCESS

Development of parallel algorithms in data field Haskell

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1900 762-766
DOI: 10.1007/3-540-44520-x_105
5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Data fields provide a flexible and highly general model for indexed collections of data. Data Field Haskell is a dialect of the functional language Haskell which provides an instance of data fields. We describe Data Field Haskell and exemplify how it can be used in the early phase of parallel program design.

Cite

CITATION STYLE

APA

Holmerin, J., & Lisper, B. (2000). Development of parallel algorithms in data field Haskell. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1900, pp. 762–766). Springer Verlag. https://doi.org/10.1007/3-540-44520-x_105

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free