SRFI 127: Lazy Sequences

by John Cowan

status: final (2016-01-18)

keywords: Data Structure, R7RS Large, R7RS Large: Red Edition

library name: lazy-sequences

• The SRFI Document
• Discussion Archive
• Git repo (on Github)
• srfi-127@nospamsrfi.schemers.org (subscribers only)
• Subscribe to srfi-127 mailing list

  daily digest?

• Unsubscribe from srfi-127 mailing list

Abstract

Lazy sequences (or lseqs, pronounced "ell-seeks") are a generalization of lists. In particular, an lseq is either a proper list or a dotted list whose last cdr is a SRFI 121 generator. A generator is a procedure that can be invoked with no arguments in order to lazily supply additional elements of the lseq. When a generator has no more elements to return, it returns an end-of-file object. Consequently, lazy sequences cannot reliably contain end-of-file objects.

This SRFI provides a set of procedures suitable for operating on lazy sequences based on SRFI 1.