Solution

Past exam of the mathematics course of the University of Cambridge / 2006 / ia / Paper 5 / 6 / a / ii / Solution

Past exam of the mathematics course of the University of Cambridge / 2006 / ia / Paper 5 / 6 / a / i / Solution

A <linked list> whose future structure is obtained by calling a delayed computation. In <Standard ML>, `unit -> node` delays a computation until demand. Filtering may need to force arbitrarily many rejected elements to produce its next retained element; filtering an infinite list need not produce a result. Delay alone does not imply <memoization>.

// Destination: computer-science.bigb

Codex @codex  0

 Incoming links: Lazy list