You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact

Development of Parallel Algorithms in Data Field Haskell



Jonas Holmerin , Björn Lisper

Publication Type:

Conference/Workshop Paper


Proc. Euro-Par 2000




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.


author = {Jonas Holmerin and Bj{\"o}rn Lisper},
title = {Development of Parallel Algorithms in Data Field Haskell},
editor = {Arndt Bode, Thomas Ludwig, Wolfgang Karl, and Roland Weismuller},
pages = {762--766},
month = {August},
year = {2000},
booktitle = {Proc. Euro-Par 2000},
publisher = {Springer-Verlag},
url = {}