Special issue of Higher-Order and Symbolic Computation:
CW'97 was held at the Ecole Normale Superieure (ENS), which is located on 45 Rue d'Ulm, about a 5-10 minute walk from the Sorbonne.
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.
Following on the 1992 ACM SIGPLAN Workshop on Continuations, we are organizing a new workshop to provide a forum for the presentation and discussion of control constructs in programming. We are specifically interested in design, semantics, implementations, pragmatic experiments, expressive power of these constructs. Theoretical, practical, and bridge-building submissions are welcome.
Keywords: continuations, control delimiters, exceptions, backtracking, calculi.
An informal proceedings will be distributed at the workshop and will be available subsequently as a BRICS technical report.
08h45-09h00: welcome
09h00-10h00: Invited talk. Peter Landin (Queen Mary and Westfield College): Histories of Discoveries of Continuations: Belles-Lettres with Equivocal Tenses
10h00-10h15: break
10h15-10h45: Olin Shivers (MIT): Virtualisable threads
10h45-11h15: Edoardo Biagoni, Ken Cline, Peter Lee, Chris Okasaki, and Chris Stone (CMU): Safe-for-space threads in Standard ML
11h15-11h30: break
11h30-12h00: Gilles Barthe (CWI), John Hatcliff (OSU), Morten Heine Sørensen (DIKU): CPS translations and applications: the cube and beyond
12h00-12h30: Jakov Kucan (MIT): Retraction approach to CPS transform
12h30-14h30: lunch (not included)
14h30-15h30: Invited talk. John C. Reynolds (CMU): The discoveries of continuations
15h30-16h00: Erik Sandewall (Linköping University): An early use of continuations and partial evaluation for compiling rules written in FOPC
16h00-16h15: break
16h15-16h45: Hayo Thielecke (University of Edinburgh): Continuation passing style and self-adjointness
16h45-17h15: Maurizio Proietti (IASI-CNR) and Alberto Pettorossi (University of Roma II): Flexible continuations in logic programs via unfold/fold transformation and goal generalization
17h15-17h30: farewell
January 9, 1996 / August 7, 2000 - cw97@brics.dk