[Haskell] CFP: Continuation Fest 2008
oleg at okmij.org
oleg at okmij.org
Tue Feb 19 19:50:23 EST 2008
Call for Talk Proposals
Continuation Fest 2008
April 13, Tokyo, Japan
http://logic.cs.tsukuba.ac.jp/~kam/Continuation2008/
Continuations are used, and constantly re-discovered, in web
programming, logic, event-based concurrency, linguistics, transactional
systems, optimization, program generation and verification. Programming
language systems -- including Scheme, OCaml, Ruby, Python, Haskell,
Coq -- are (re-)implementing continuations, generators, iterators and
related control structures. Continuations are also being studied for
their own sake.
We call for an informal gathering of people working in all these
areas -- language designers, users, and researchers who study or use
continuations in academic or practical work or as a hobby. The goal is
to exchange ideas, terminology, new results, experience reports, works
in progress, open problems, and friendly feedback -- as well as meet
each other and strengthen the community.
We plan a combination of 7-8 broadly accessible talks and 1-2 invited
talks, with plenty of breaks for socializing and informal conversations.
An evening event is planned. Participants are invited to submit working
notes, source files, and abstracts for distribution to the attendees,
but as the workshop has no formal proceedings, contributions may still
be submitted for publication elsewhere.
We solicit talk proposals, about 2 paragraphs long. The proposal should
include the desired talk duration and be emailed to
CF2008 at logic.cs.tsukuba.ac.jp
The proposals will be evaluated by the Program Committee, who also would
advise the authors on the duration of the talk and on making it as
accessible as possible.
The topics of interest include, but are not at all limited to:
-- descriptions of uses of continuations in program generation,
linguistics, proof theory, model checking,
-- system demonstrations
-- libraries using continuations, such as generators
-- verifying programs that use continuations explicitly
or implicitly (exceptions, concurrency, backtracking)
-- type systems of continuations and their formalizations
-- open problems
Important dates:
March 31, 2008: The deadline for the talk proposals
April 13, 2008: The Fest
Program committee:
Chris Barker (New York)
Shiro Kawai (Scheme Arts)
Oleg Kiselyov (FNMOC)
Chung-chieh Shan (Chair, Rutgers)
Taiichi Yuasa (Kyoto)
Organizing Committee:
Kenichi Asai (Ochanomizu)
Yukiyoshi Kameyama (Chair, Tsukuba)
Inquiries:
CF2008 at logic.cs.tsukuba.ac.jp
More information about the Haskell
mailing list