Unbounded computational structures
- 1 July 1978
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 8 (4) , 407-416
- https://doi.org/10.1002/spe.4380080404
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.Keywords
This publication has 19 references indexed in Scilit:
- Functional combinationComputer Languages, 1978
- Aspects of applicative programming for file systems (Preliminary Version)ACM SIGPLAN Notices, 1977
- Output driven interpretation of recursive programs, or writing creates and destroys data structuresInformation Processing Letters, 1976
- Lucid—A Formal System for Writing and Proving ProgramsSIAM Journal on Computing, 1976
- Correct and optimal implementations of recursion in a simple programming languageJournal of Computer and System Sciences, 1974
- New Programming Languages for Artificial Intelligence ResearchACM Computing Surveys, 1974
- SIMULA: an ALGOL-based simulation languageCommunications of the ACM, 1966
- The next 700 programming languagesCommunications of the ACM, 1966
- Correspondence between ALGOL 60 and Church's Lambda-notationCommunications of the ACM, 1965
- Design of a separable transition-diagram compilerCommunications of the ACM, 1963