CG Ponder, PC McGeer & A P-C Ng [June 1988], "Are applicative languages inefficient?," SIGPLAN Notices 23, 135--139. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Lazy Functional State Threads - Launchbury (1994) (79 citations) (Correct)
....programming languages allow many algorithms to be expressed very concisely, but there are a few algorithms in which in place updatable state seems to play a crucial role. For these algorithms, purelyfunctional languages, which lack updatable state, appear to be inherently inefficient (Ponder, McGeer Ng [1988]) Take, for example, algorithms based on the use of incrementally modified hash tables, where lookups are interleaved with the insertion of new items. Similarly, the union find algorithm relies for its efficiency on the set representations being simplified each time the structure is examined. ....
CG Ponder, PC McGeer & A P-C Ng [June 1988], "Are applicative languages inefficient?," SIGPLAN Notices 23, 135--139.
Lazy Functional State Threads - Launchbury, Jones (1993) (79 citations) (Correct)
....programming languages allow many algorithms to be expressed very concisely, but there are a few algorithms in which in place updatable state seems to play a crucial role. For these algorithms, purelyfunctional languages, which lack updatable state, appear to be inherently inefficient (Ponder, McGeer Ng [1988]) Take, for example, algorithms based on the use of incrementally modified hash tables, where lookups are interleaved with the insertion of new items. Similarly, the union find algorithm relies for its efficiency on the set representations being simplified each time the structure is examined. ....
CG Ponder, PC McGeer & A P-C Ng [June 1988], "Are applicative languages inefficient?," SIGPLAN Notices 23, 135--139.
State in Haskell - Launchbury, Jones (1996) (11 citations) (Correct)
....programming languages allow many algorithms to be expressed very concisely, but there are a few algorithms in which in place updatable state seems to play a crucial role. For these algorithms, purely functional languages, which lack updatable state, appear to be inherently inefficient (Ponder, McGeer Ng [1988]) Examples of such algorithms include: ffl Algorithms based on the use of incrementally modified hash tables, where lookups are interleaved with the insertion of new items. ffl The union find algorithm, which relies for its efficiency on the set representations being simplified each time the ....
CG Ponder, PC McGeer & A P-C Ng [June 1988], "Are applicative languages inefficient ?," SIGPLAN Notices 23, 135--139.
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