• Computer Science
  • Published 1994

Eliminating intermediate lists in pH using local transformations

@inproceedings{Maessen1994EliminatingIL,
  title={Eliminating intermediate lists in pH using local transformations},
  author={Jan-Willem Maessen},
  year={1994}
}
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… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES

Lectures on Constructive Functional Programming

VIEW 20 EXCERPTS
HIGHLY INFLUENTIAL

Chapter 7: List comprehensions

  • Philip Wadler
  • 1987
VIEW 21 EXCERPTS
HIGHLY INFLUENTIAL

A short cut to deforestation

VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Safe fusion of functional expressions

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Introduction to functional programming

VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

A Transformation System for Developing Recursive Programs

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Automatic transformation of series expressions into loops

  • Richard C Waters
  • ACM Transactions on Programming Languages and Systems,
  • 1991
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL