[logic-ml] Control Operators and their Semantics (COS'13) - change of dates

[Fujita Kenetsu]

[Please circulate. My apologies for cross posting.]
皆様，
TLCA(Typed Lambda Calculi and Applications) と RTA(Rewriting Techniques
and Applications) の
Satellite workshop(COS'13) がEindhovenで開催されます．皆様のご参加・投稿
をお待ちしております．
群馬大学　藤田憲悦
------------------------------------------------------------------------------------------------------------------------------------

This is the COS'13 cfp with some changes of dates.
While keeping *the deadline of submissions on April the 6th*, we do not
require
previous abstract submission, and postpone to April the 15th the
deadline for
contributed talks only (called EXTENDED ABSTRACTS below):

Submission: April, 6 2013 (*no previous abstract submission required*)
Extended abstract: April, 15 2013 (*new*)
Notification: April, 29 2013 (changed)
Final version: May, 15 2013 (changed)
Workshop: June, 24-25 2013


============================================================================

Control Operators and their Semantics (COS'13) - Call for Papers

Satellite event of RDP'13

June 24 - 25, 2013, Eindhoven, The Nederlands

http://cos2013.di.unito.it/

(modified on April, 25th)
============================================================================


Modern programming languages provide sophisticated control mechanisms,
commonly
referred to as control operators which are widely used to realize a
variety of
applications. Since we cannot escape control features, it becomes a
challenge
to provide them with sound reasoning principles. There is a very active
research
on understanding, manipulating, representing, and reasoning about elaborated
non-local control structures, in particular in declarative programming
languages
such as functional and logic languages. Ideas and results originating
from this
research area have impact in many other areas of computer science, like
distributed
and concurrent systems, proof theory, proof mining, web programming and
linguistics.
For instance, the study of the logical foundations of control operators
renewed the
study of the connections between proofs and programs via the so-called
Curry-Howard
correspondence, providing new methods to extract the computational
content of
classical proofs.

The focus of the workshop is on the interplay between syntax and
semantics, namely
the central question of what a program means and how it does define the
intended
procedure.

This is a crucial issue especially in the case of control operators,
since they are
as powerful as potentially obscure, and programs that use them are
usually more error
prone than purely declarative ones.
The issue of a better understanding of control is also relevant for
communicating
across different research areas and communities. More abstract views can
be achieved
via several means, that include operational semantics of formal calculi,
abstract
machines, algebraic specifications and rewriting, type assignment
systems, denotational
semantics and game semantics, category theory and logic, to say the least.

Relevant topics include, but are not limited to:

- continuations and delimited continuations
- categorical models of continuations
- compositionality and modularity of control operators
- denotational semantics of control, event structures and causality
- operational semantics and abstract machines
- type systems for control operators
- game semantics of programming languages and of logical proofs
- usage of control operators in proof search and proof mining
- semantics of control operators in logic programming

Invited speakers:
- Mattew Flatt (Univeristy of Utah)
- Thomas Streicher (Universitaet Darmstadt)


Program Committee:

Zena Ariola University of Oregon
Stefano Berardi Turin University
Hugo Herbelin INRIA and Laboratoire PPS (Paris 7)
Ugo de'Liguoro (chair) Turin Univerisity
Ken-etsu Fujita Gunma University
Koji Nakazawa Kyoto University
Alexis Saurin (co-chair) INRIA and Laboratoire PPS (Paris 7)


Submission: authors of original works on the topic of the workshop
are invited to submit either a FULL PAPER of up to 20 pages, which
has to be unpublished nor submitted elsewhere, or an EXTENDED ABSTRACT
of up to 5 pages (to which previous restrictions do not apply)
for short presentation at the workshop.
Only accepted full papers will appear in the proceedings; the PC might
decide, on the ground of referees reports, that a full paper submission
is accepted as extended abstract instead.

Submission consists of a LaTex generated pdf file, prepared using EPTCS
macro package, available from: http://info.eptcs.org/
Authors of extended abstracts must add: "Extended Abstract" to the title.
The PC

Submissions are via EasyChair COS2013 site:

https://www.easychair.org/conferences/?conf=cos2013


Important Dates:

Submission: April, 6 2013 (no previous abstract submission required)
Extended abstract: April, 15 2013 (new)
Notification: April, 29 2013 (changed)
Final version: May, 15 2013 (changed)
Workshop: June, 24-25 2013


Contact:

Ugo de'Liguoro
Dipartimento di Informatica,
Universita' di Torino,
Corso Svizzera 185, 10149 Torino, Italy
email: deliguoro at di.unito.it <mailto:deliguoro at di.unito.it>


Web sites:

COS'13: http://cos2013.di.unito.it <http://cos2013.di.unito.it/>
RTD'13: http://www.win.tue.nl/rdp2013/

------------------------------------------------------------------------------------------------


-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.fos.kuis.kyoto-u.ac.jp/pipermail/logic-ml/attachments/20130330/d92d6cb2/attachment.html>