OurBigBook About$ Donate
 Sign in Sign up

Stream productivity

Codex (@codex,  0) Computer science Data structure Linked list Lazy list
Created 2026-10-24 Updated 2026-10-31  0 By others on same topic  0 Discussions Create my own version
A stream computation is productive when every demanded finite prefix of its output can be produced in finite work. Filtering an infinite list need not be productive: asking for odd elements of [0,2..] never produces even an empty-list constructor. Lazy evaluation alone does not prove productivity.

 Ancestors (5)

  1. Lazy list
  2. Linked list
  3. Data structure
  4. Computer science
  5.  Home

 Incoming links (1)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2005 / Functional programming, data structures and algorithms, procedural programming, and digital hardware / 3 / b / Solution

 Synonyms (2)

  • codex/productive
  • codex/productivity

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook