Abstract
Data fields provide a flexible and highly general model for in- dexed 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.
This work was supported by The Swedish Research Council for Engineering Sciences (TFR), grant no. 98-653.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
P. Hammarlund and B. Lisper. On the relation between functional and data parallel programming languages. In Proc. Sixth Conference on Functional Programming Languages and Computer Architecture, pages 210–222. ACM Press, June 1993.
B. Lisper. Data parallelism and functional programming. In G.-R. Perrin and A. Darte, editors, The Data Parallel Programming Model: Foundations, HPF Realization, and Scientific Applications, Vol. 1132 of Lecture Notes in Comput. Sci., pages 220–251, Les Ménuires, France, Mar. 1996. Springer-Verlag.
B. Lisper. Data fields. In Proc. Workshop on Generic Programming, Marstrand, Sweden, June 1998. http://wsinwp01.win.tue.nl:1234/WGPProceedings/
B. Lisper and P. Hammarlund. The data field model. Technical Report TRITA-IT R 99:02, Dept. of Teleinformatics, KTH, Stockholm, Mar. 1999. ftp://ftp.it.kth.se/Reports/TELEINFORMATICS/TRITA-IT-9902.ps.gz
J. Peterson, K. Hammond, L. Augustsson, B. Boutel, W. Burton, J. Fasel, A. D. Gordon, J. Hughes, P. Hudak, T. Johnsson, M. Jones, E. Meijer, S. L.Peyton Jones, A. Reid, and P. Wadler. Report on the programming language Haskell: A non-strict purely functional language, version 1.4, Apr. 1997. http://www.haskell.org/definition/
N. Röjemo. Garbage Collection, and Memory Efficiency, in Lazy Functional Languages. PhD thesis, Department of Computing Science, Chalmers University of Technology, Gothenburg, Sweden, 1995.
J. M. Sipelstein and G. E. Blelloch. Collection-oriented languages. Proc. IEEE, 79(4):504–523, Apr. 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holmerin, J., Lisper, B. (2000). Development of Parallel Algorithms in Data Field Haskell. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_105
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_105
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive