Incremental stream processing, pervasive in practice, makes the best case for lazy evaluation. Lazy evaluation promotes modularity, letting us glue together separately developed stream producers, consumers and transformers. Lazy list processing has become a cardinal feature of Haskell. It also brings the worst in lazy evaluation: its incompatibility with effects and unpredictable and often extraordinary use of memory. Much of the Haskell programming lore are the ways to get around lazy evaluation.
««
Next »
« Previous
-
Getting Started with Subversion -
Bucketing, Multiplexing and Combining in Hadoop - Part 1
-
How to connect Android with PHP | Android Aspect
-
NoSQL Matters: Building Scalability with Riak
-
Ruby/Python: Constructing a taxonomy from an array using zip
-
Neo4j 1.9 General Availability Announcement!
-
CloudStack University
| Subversion | |
| Written by: Lorna Jane Mitchell | |
| Featured Refcardz: Top Refcardz: | |
| 150+ Refcardz Available · Get them all | |
Add your comment
