[logic-ml] CFP: Two Workshops on Continuations
Yukiyoshi Kameyama
kameyama at acm.org
Tue Feb 22 20:37:16 JST 2011
logic-ml および sonoteno 皆様、
(重複して受け取りの節は御容赦ください)
Continuation (継続) に関する2つのワークショップが、5月末および9月下旬
に開催されます。
1. RDP (RTA + TLCA) に併設
TPDC 2011: Theory and Practice of Delimited Continuations
May 29, 2011, Novi Sad, Serbia
http://www.pps.jussieu.fr/~saurin/tpdc2011/
2. ICFP に併設
CW 2011: ACM SIGPLAN Continuation Workshop 2011
September 24, 2011, Tokyo, Japan
http://logic.cs.tsukuba.ac.jp/cw2011/
どちらも、基礎理論(classical logic, type theory)から、プログラム言語の
理論/実装、継続の様々な応用(web programming, linguistics etc.)までをカ
バーするワークショップです。
「2」の方は、システムのデモンストレーションの発表も歓迎します。
RDP に行かれる方、あるいは、ICFP に行かれる方は、是非投稿をご検討ください。
CFP は添付ファイルにします。
--
亀山幸義 (筑波大学)
http://logic.cs.tsukuba.ac.jp/~kam
-------------- next part --------------
Call for Papers
TPDC 2011
1st International Workshop on
Theory and Practice of Delimited Continuations
http://www.pps.jussieu.fr/~saurin/tpdc2011/
29 May 2011, Novi Sad, Serbia
An RDP 2011 workshop -
Federated Conference on Rewriting, Deduction, and Programming
SCOPE AND TOPIC:
Since their introduction in the late 1980s, delimited control
operators have triggered increasing interest among programmers and the
programming language community, found unexpected applications in
conceptual domains such as linguistics and constructive mathematics,
and shown themselves to be the natural development of classical
control operators. The first workshop on the Theory and Practice of
Delimited Continuations aims to bring together people working with the
many different (practical, theoretical, or foundational) aspects of
delimited continuations, in the hope of fostering some unity and
progress.
Contributions on all topics related to delimited continuations are
welcome, as either short abstracts or full papers (see SUBMISSION
PROCEDURE below).
INVITED SPEAKERS:
To be announced
IMPORTANT DATES:
# Submission of full papers: 25 February 2011
# Submission of short abstracts: 18 March 2011
# Notification of acceptance: 25 March 2011
# Final version due: 8 April 2011
# Workshop: 29-30 May 2011
SUBMISSION PROCEDURE:
We accept submissions of two kinds:
* short abstracts (1 to 2 pages)
* full papers up to 12 pages
Short abstracts are proposals for talks within a wide rubric: reports
on work-in-progress or recently published papers, surveys or short
tutorials, system demonstrations, etc. Full papers must describe new
work not under consideration for publication elsewhere. Accepted
papers and abstracts will be presented at the workshop and included in
the proceedings, published as a technical report.
Papers and abstracts should be formatted using the easychair.cls LaTeX
class (see http://easychair.org/coolnews.cgi), and may be submitted
electronically as pdf files via the easychair website:
https://www.easychair.org/login.cgi?conf=tpdc2011
PROGRAM COMMITTEE:
Zena Ariola, University of Oregon, USA
Dariusz Biernacki, University of Wroclaw, Poland
Hugo Herbelin, INRIA, Paris, France
Yukiyoshi Kameyama, University of Tsukuba, Japan
Alexis Saurin, CNRS, Paris, France
Hayo Thielecke, University of Birmingham, UK
Noam Zeilberger, Universit? Paris Diderot, Paris, France
WORKSHOP ORGANIZERS:
Hugo Herbelin, INRIA, Paris, France
Alexis Saurin, CNRS, Paris, France
Noam Zeilberger, Universit? Paris Diderot, Paris, France
For more information, please contact
Alexis Saurin <saurin at pps.jussieu.fr>
or Noam Zeilberger <noam at pps.jussieu.fr>
-------------- next part --------------
CW 2011
ACM SIGPLAN Continuation Workshop 2011
http://logic.cs.tsukuba.ac.jp/cw2011/
co-located with ICFP 2011, Tokyo, Japan
Saturday, September 24, 2011
Call for Contributions
Continuations have been discovered many times, which highlights their
many applications in programming language semantics and program
analysis, linguistics, logic, parallel processing, compilation and web
programming. Recently, there has been a surge of interest
specifically in delimited continuations: new implementations (in
Scala, Ruby, OCaml, Haskell), new applications (to probabilistic
programming, event-driven distributed processing), substructural and
constructive logics, natural language semantics.
The goal of the Continuation Workshop is to make continuations more
accessible and useful -- to practitioners and to researchers in
various areas of computer science and outside computer science. We
wish to promote communication among the implementors and users in many
fields. We would like to publicize the applications of continuations
in academic (logic, linguistics) and practical fields and various
programming languages (OCaml, Haskell, Scala, Ruby, Scheme, etc).
Continuation Workshop 2011 will be informal. We aim at accessible
presentations of exciting if not fully polished research, and of
interesting academic, industrial and open-source applications that are
new or unfamiliar. The workshop will have no published proceedings;
submissions of short abstracts are preferred.
We intend to organize a tutorial session on delimited continuations
and their main applications, in the evening before the workshop, on
Friday, September 23, 2011.
Invited speakers
----------------
TBD
Important dates
---------------
Submission: June 25, 2011
Notification: August 8, 2011
Tutorials: September 23, 2011
Workshop: September 24, 2011
Format
------
The workshop will consist of presentations by the participants,
selected from submitted abstracts. Participants are invited to submit
working drafts, source code, and/or extended abstracts for
distribution on the workshop homepage and to the attendees, but as the
workshop will have no formal proceedings, any contributions may be
submitted for publication to other venues. (See the SIGPLAN
republication policy for more details.)
Scope
-----
We seek several types of presentations on topics related to
continuations. We especially encourage presentations that describe
work in progress, outline a future research agenda, or encourage
lively discussion.
Research presentations on:
- implementations of continuations
- semantics
- type systems and logics
- meta-theory and its mechanization
- code generation with continuations or effects
- distributed programming
- systems programming and security
- pearls
Research presentations must be broadly accessible and should describe
new ideas, experimental results, significant advances in the theory or
application of continuations, or informed positions regarding new
control operators.
Application presentations, or status reports
These broadly accessible presentations should describe interesting
applications of continuations in research, industry or open source.
We encourage presentations of applications from areas outside of
programming language research -- such as linguistics, logics, AI,
computer graphics, operating systems, etc. These presentations need
not present original research, but should deliver information that is
new or that is unfamiliar to the general ICFP audience. (A broadly
accessible version of research presented elsewhere, with the most
recent results and more discussion of future work may be acceptable as
a CW 2011 status report.) The abstract submission should justify, to a
general reader, why an application is interesting.
Demos and work-in-progress reports
Live demonstrations or presentations of preliminary results are
intended to show new developments, interesting prototypes, or work in
progress. In the abstract submission (which need only be about half a
page), describe the demo and its technical content, and be sure to
include the demo's title, authors, collaborators, references, and
acknowledgments. A demonstration should take 10-15 minutes, and a
work-in-progress report should take about 5 minutes. The exact time
per demo will be decided based on the number of accepted
submissions. (Presenters will have to bring all the software and
hardware for their demonstration; the workshop organizers are only
able to provide a projector.)
Submission Guidelines and Instructions
--------------------------------------
Unlike the previous Continuation Workshops, we do not require the
submission of complete research papers. We will select presentations
based on submitted abstracts, up to 2 (A4 or US letter) pages long in
the PDF format (with the optional supplementary material, up to 8 PDF
pages). Persons for whom this poses a hardship should contact the
program chair. Submissions longer than a half a page should include a
paragraph synopsis suitable for inclusion in the workshop program.
Email submissions to cw2011-submit at logic.cs.tsukuba.ac.jp
Organizers
----------
Yukiyoshi Kameyama, University of Tsukuba
http://logic.cs.tsukuba.ac.jp/~kam/
Chung-chieh Shan, Rutgers University
http://www.cs.rutgers.edu/~ccshan/
Oleg Kiselyov
http://okmij.org/ftp/
Program Committee
-----------------
Kenichi Asai, Ochanomizu University, Japan
http://pllab.is.ocha.ac.jp/~asai/
Malgorzata Biernacka, University of Wroclaw, Poland
http://www.ii.uni.wroc.pl/~mabi/
Hugo Herbelin, PPS - pi.r2, INRIA, France
http://pauillac.inria.fr/~herbelin/index-eng.html
Oleg Kiselyov
http://okmij.org/ftp/
Julia Lawall, University of Copenhagen, Denmark
http://www.diku.dk/~julia
Tiark Rompf, EPFL, Switzerland
Chung-chieh Shan, Rutgers University (Chair)
http://www.cs.rutgers.edu/~ccshan/
Hayo Thielecke, University of Birmingham, UK
http://www.cs.bham.ac.uk/~hxt
Previous Workshops
------------------
ACM SIGPLAN Continuation Workshop (CW'04)
http://www.cs.bham.ac.uk/~hxt/cw04/index.html
ACM SIGPLAN Workshop on Continuations (CW'01)
http://www.cs.indiana.edu/~sabry/cw01/
ACM SIGPLAN Workshop on Continuations (CW'97)
http://www.brics.dk/~cw97/
Continuation Fest 2008
http://logic.cs.tsukuba.ac.jp/~kam/Continuation2008/
More information about the Logic-ml
mailing list