Jan-Willem Maessen  Home/Search
Context
Related
| mit.edu/pub/papers/t...maessensm.ps.gz sop.inria.fr/oasis/pe...Maessen94.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: hypatia.dcs.qmw...unctional.trans (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The extensive use of lists in functional programming languages exacts a cost penalty for important operations such as array construction. In addition, because lists are linear data structures, it is difficult to generate and traverse them efficiently in parallel given a purely-functional environment. Three common methods of traversal---left and right fold, and reduction---can be described in terms of map and reduce operations yielding higher-order functions; these higher-order functions can be ... (Update)
Active bibliography (related documents): More All
2.0: Simplifying Parallel List Traversal - Maessen (1995) (Correct)
0.3: Bottom Extraction Factoring error handling out of functional.. - Maessen (1999) (Correct)
0.1: A New Means of Ensuring Termination of Deforestation - Sørensen (1993) (Correct)
Similar documents based on text: More All
0.6: The Use of the Domain Name System for Dynamic References in an.. - Alavi (1994) (Correct)
0.6: Application of Minimal Perfect Hashing in Main Memory Indexing - Ho (1994) (Correct)
0.5: Recognition and Classification by Exploration - Chklovski (1998) (Correct)
BibTeX entry: (Update)
@mastersthesis{ maessen94eliminating,
author = "Maessen, J. W.",
title = "{E}liminating {I}ntermediate {L}ists in p{H} using {L}ocal {T}ransformations",
month = "May",
year = "1994",
url = "citeseer.ist.psu.edu/maessen94eliminating.html" }
Citations (may not include all citations):385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
333 Introduction to Functional Programming (context) - Bird, Wadler - 1988
324 Deforestation: Transforming programs to eliminate trees - Wadler - 1991
210 Functional programming with bananas (context) - Meijer, Fokkinga et al. - 1991
172 An introduction to the theory of lists (context) - Bird - 1987
161 A short cut to deforestation - Gill, Launchbury et al. - 1993
158 Reasoning about programs in continuation-passing style - Sabry, Felleisen - 1992
150 Report on the functional programming language Haskell (context) - Hudak, Jones et al. - 1992
138 Lectures on constructive functional programming (context) - Bird - 1989
131 A fold for all seasons - Sheard, Fegaras - 1993
66 Views: A way for pattern matching to cohabit with data abstr.. - Wadler - 1987
32 Listlessness is better than laziness: Lazy evaluation and ga.. (context) - Wadler - 1984
31 Automatic transformation of series expressions into loops (context) - Waters - 1991
16 Safe fusion of functional expressions (context) - Chin - 1992
9 a parallel persistent object system (context) - Heytens, Nikhil et al. - 1991
3 MIT Computation Structures Group Memo (context) - Nikhil, reference et al. - 1990
2 Working document describing pH extensions to Haskell (context) - Nikhil, James et al.
2 Chapter 7: List comprehensions (context) - Wadler - 1987
2 Chapter in Id-in-id compiler documentation (context) - Zhou, List et al.
Documents on the same site (http://hypatia.dcs.qmw.ac.uk/SEL-HPC/Articles/GeneratedHtml/functional.trans.html): More
Transformations of Evolving Algebras - Diehl (1997) (Correct)
Transformations of Evolving Algebras - Diehl (1997) (Correct)
Deriving Efficient Parallel Implementations of.. - Fitzpatrick, Harmer.. (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC