Reasoning with continuations II: full abstraction for models of control
- 1 May 1990
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 161-175
- https://doi.org/10.1145/91556.91626
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Continuations and concurrencyPublished by Association for Computing Machinery (ACM) ,1990
- Control delimiters and their hierarchiesHigher-Order and Symbolic Computation, 1990
- Engines from continuationsComputer Languages, 1989
- Continuations may be unreasonablePublished by Association for Computing Machinery (ACM) ,1988
- A syntactic theory of sequential controlTheoretical Computer Science, 1987
- Embedding continuations in procedural objectsACM Transactions on Programming Languages and Systems, 1987
- Obtaining coroutines with continuationsComputer Languages, 1986
- Revised 3 report on the algorithmic language schemeACM SIGPLAN Notices, 1986
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975