Reasoning about programs in continuation-passing style
- 1 November 1993
- journal article
- Published by Springer Nature in Higher-Order and Symbolic Computation
- Vol. 6 (3-4), 289-360
- https://doi.org/10.1007/bf01019462
Abstract
No abstract availableThis publication has 34 references indexed in Scilit:
- A theory for program and data type specificationTheoretical Computer Science, 1992
- Representing Control: a Study of the CPS TransformationMathematical Structures in Computer Science, 1992
- Back to direct style IIACM SIGPLAN Lisp Pointers, 1992
- Reasoning about programs in continuation-passing style.ACM SIGPLAN Lisp Pointers, 1992
- Improving binding times without explicit CPS-conversionACM SIGPLAN Lisp Pointers, 1992
- Equivalence in functional languages with effectsJournal of Functional Programming, 1991
- A syntactic theory of sequential stateTheoretical Computer Science, 1989
- Obtaining coroutines with continuationsComputer Languages, 1986
- Revised 3 report on the algorithmic language schemeACM SIGPLAN Notices, 1986
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975