This subsection is based on the specification of SRFI-41 by Philip L. Bewig.
This SRFI implements streams, sometimes called lazy lists, a sequential data structure containing elements computed only on demand. A stream is either null or is a pair with a stream in its cdr. Since elements of a stream are computed only when accessed, streams can be infinite. Once computed, the value of a stream element is cached in case it is needed again. SRFI-41 can be made available with:
(use-modules (srfi srfi-41))
|• SRFI-41 Stream Fundamentals|
|• SRFI-41 Stream Primitives|
|• SRFI-41 Stream Library|