Premium
Unbounded computational structures
Author(s) -
Friedman Daniel P.,
Wise David S.
Publication year - 1978
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380080404
Subject(s) - lisp , computer science , simple (philosophy) , data structure , control (management) , programming language , style (visual arts) , semantics (computer science) , theoretical computer science , artificial intelligence , epistemology , philosophy , archaeology , history
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.