A syntactic theory of sequential control
Open Access
- 31 December 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 52 (3) , 205-237
- https://doi.org/10.1016/0304-3975(87)90109-5
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Embedding continuations in procedural objectsACM Transactions on Programming Languages and Systems, 1987
- Logic continuationsThe Journal of Logic Programming, 1987
- Revised 3 report on the algorithmic language schemeACM SIGPLAN Notices, 1986
- A network of microprocessors to execute reduction languages, part IIInternational Journal of Parallel Programming, 1979
- A network of microprocessors to execute reduction languages, part IInternational Journal of Parallel Programming, 1979
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975
- Lambda calculus schemataPublished by Association for Computing Machinery (ACM) ,1972
- Definitional interpreters for higher-order programming languagesPublished by Association for Computing Machinery (ACM) ,1972
- Proving algorithms by tail functionsInformation and Control, 1971
- The Mechanical Evaluation of ExpressionsThe Computer Journal, 1964