The notion of continuation is ubiquitous in many different areas of computer science, including logic, constructive mathematics, programming languages, and programming. This workshop aims at providing a forum for discussion of: new results and work in progress; work aimed at a better understanding of the nature of continuations; applications of continuations, and the relation of continuations to other areas of logic and computer science. This technical report serves as informal proceedings for CW92. It consists of submitted manuscripts bound together according to the program order.
Cited By
- Biernacki D, Danvy O and Millikin K (2015). A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations, ACM Transactions on Programming Languages and Systems, 38:1, (1-25), Online publication date: 16-Oct-2015.
- Biernacka M, Biernacki D and Lenglet S Typing control operators in the CPS hierarchy Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming, (149-160)
- Shan C (2007). A static simulation of dynamic delimited control, Higher-Order and Symbolic Computation, 20:4, (371-401), Online publication date: 1-Dec-2007.
- Danvy O and Millikin K A rational deconstruction of landin's j operator Proceedings of the 17th international conference on Implementation and Application of Functional Languages, (55-73)
- Danvy O and Sabry A (2019). Editorial, Higher-Order and Symbolic Computation, 15:2-3, (139-140), Online publication date: 1-Sep-2002.
- Danvy O and Talcott C (1999). Editorial, Higher-Order and Symbolic Computation, 12:1, (5-5), Online publication date: 1-Apr-1999.
- Danvy O and Talcott C (1998). Introduction, Higher-Order and Symbolic Computation, 11:2, (115-116), Online publication date: 1-Sep-1998.