Data Field Haskell

Abstract Data fields provide a flexible and highly general model for indexed collections of data. Data Field Haskell is a Haskell dialect that provides an instance of data fields. It can be used for very generic collection-oriented programming, with a special emphasis on multidimensional structures. We give a brief description of the data field model and its underlying theory. We then describe Data Field Haskell, and an implementation.

[1]  David C. Cann,et al.  A Report on the Sisal Language Project , 1990, J. Parallel Distributed Comput..

[2]  David R. Musser,et al.  STL tutorial and reference guide , 2001 .

[3]  Kevin Hammond,et al.  Research Directions in Parallel Functional Programming , 1999, Springer London.

[4]  Björn Lisper,et al.  On the relation between functional and data parallel programming languages , 1993, FPCA '93.

[5]  Simon Peyton Jones,et al.  The Implementation of Functional Programming Languages (Prentice-hall International Series in Computer Science) , 1987 .

[6]  Jonathan M. D. Hill,et al.  Data Parallel Haskell: Mixing Old and New Glue , 1993 .

[7]  Guy E. Blelloch,et al.  Programming parallel algorithms , 1996, CACM.

[8]  Simon L. Peyton Jones,et al.  The Implementation of Functional Programming Languages , 1987 .

[9]  B. C. Gorda.  Data parallelism , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[10]  W. Daniel Hillis,et al.  Connection Machine Lisp: fine-grained parallel symbolic processing , 1986, LFP '86.

[11]  Guy E. Blelloch,et al.  Collection-oriented languages , 1991 .

[12]  Lennart Augustsson,et al.  PH Language Reference Manual, Version 1.0---preliminary , 1995 .

[13]  Boleslaw K. Szymanski,et al.  Parallel functional languages and compilers , 1991 .

[14]  Simon Peyton-Jones.  Bulk Types With Class , 1997 .

[15]  Simon L. Peyton Jones,et al.  Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.

[16]  Paul Steckler,et al.  The Functional Imperative: Shape! , 1998, ESOP.

[17]  Luigi Semenzato,et al.  Arrays in FIDIL , 1991 .

[18]  A. D. Falkoff,et al.  The design of APL , 1973, APLQ.

[19]  Björn Lisper,et al.  Data Parallelism and Functional Programming , 1996, The Data Parallel Programming Model.

[20]  Walter S. Brainerd,et al.  Programmer's guide to Fortran 90 , 1990 .

[21]  Niklas Röjemo.  Garbage Collection, and Memory Efficiency, in Lazy Functional Languages , 1995 .

[22]  Kattamuri Ekanadham.  A perspective on Id , 1991 .

[23]  Claes Thornberg.  Towards polymorphic type inference with elemental function overloading , 1999 .

[24]  Jonas Holmerin.  Development and Veriication of Parallel Algorithms in the Data Field Model , 2000 .