|Applications of The sieve of Eratosthenes|
The sieve process produces the stream of all prime numbers
The first 25 prime numbers made by sieving a sufficiently long prefix of the integers starting from 2.
In addition, however, you must load the Scheme stream stuff. The most remarkable function is filter-streams, which illustrates that it is necessary to rewrite all our classical higher order function to stream variants. This is clearly a drawback!