Unbounded computational structures

Daniel P. Friedman, David S. Wise · Software Practice and Experience · 1978

Abstract The concept of suspended evaluation is used as an approach to co‐routines. Problems from the literature involving infinite data structures are solved in a LISP‐like applicative language to demonstrate that simple new semantics can enrich old and ‘friendly’ control structures. It appears that the very nature of these problems draws control structure and data structure together, so that issues of style may be studied at once for both.

Read the paper · More papers on PaperTik