Workshop on Continuations 2015 (WoC'15)
Satellite event of ETAPS 2015
London, April 12th 2015
The notion of continuation is ubiquitous in many different areas of
computer science, including systems programming, programming
languages, algorithmics, semantics, logic, and constructive
mathematics. In fact the concept of continuation nicely realizes
sophisticated control mechanisms, which are widely used in a variety of applications.
Since we cannot escape control features, it becomes a challenge to provide them
with sound reasoning principles. Indeed
there is much research activity on understanding, representing, and
reasoning about elaborated non-local control structures, in particular
in declarative programming languages such as functional and logic languages.
WoC 2015 is a new venue, continuing and broadening the scope of
COS'13, held in Eindhoven.
WoC 2015 offers a forum for the presentation and
discussion of continuation-based constructs in programming languages,
whether in the style of Curry (terms first, types later (maybe)) or
in the style of Church (types first, typed terms later). We
specifically welcome the presentation of elegant motivating examples.
- Key dates:
Submission through EasyChair:
January 22, 2015
Notification: February 14, 2015
Pre-proceedings version of accepted papers due: March 1, 2015
Submission to post-proceedings in EPTCS: June 7th (new)
- 09:00 - 10:00
"A verified abstract machine for functional coroutines"
Tristan Crolard, CNAM, France
- 10:00 - 10:30
"The selection monad as a CPS translation"
Jules Hedges, Queen Mary University of London, UK
- 10:30 - 11:00
- 11:00 - 11:30
"A modular structural operational semantics for delimited continuations"
Neil Sculthorpe, Paolo Torrini, and Peter Mosses, Swansea University, UK
- 11:30 - 12:30
"Why all programmers want continuations (but use callbacks instead)"
Gabriel Kerneis, Paris, France
- 12:30 - 14:00
- 14:00 - 15:00
"Command injection attacks, continuations, and the Lambek calculus"
Hayo Thielecke, University of Birmingham, UK
- 15:00 - 16:00
"Bisimulations for delimited-control operators"
Serguei Lenglet, Universite de Lorraine, France
- 16:00 - 16:30
- 16:30 - 17:00
"ATM without tears:
prompt-passing style transformation for typed delimited-control operators"
Ikuo Kobori and Yukiyoshi Kameyama, University of Tsukuba, Japan
Oleg Kiselyov, Tohoku University, Japan
- 17:00 - 18:00
"Logical by need"
Aalexis Saurin, CNRS & Université Paris Diderot, France.
- Program committee:
University of Oregon, USA
University of Wroclaw, Poland
Olivier Danvy (chair),
Aarhus University, Denmark
Ben Gurion University, Israel
FAU Erlangen-Nuernberg, Germany
Vassar College, USA
Université: Pierre et Marie Curie, France
Purdue University, USA
CNRS & Université Paris Diderot -- Paris 7, France
University of Birmingham, UK
- General Chair and organizer:
University of Torino, Italy