On the performance of pure and impure pa
โ
A.P. Willem Bรถhm; Jeffrey P. Hammes; Sumit S. Sur
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 576 KB
This paper reports on the memory performance of parallel scientiยฎc algorithms, written in both pure and impure functional styles. The Id programming language is used, since it allows both pure and impure parallel functional programs to be expressed. The non-strict storage model of Id is introduced.