[TYPES/announce] DICE 2013 - call-for partcipation

2013-02-13 Thread Simona Ronchi della Rocca
[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

   DICE 2013
§§

  (DEVELOPMENTS IN IMPLICIT COMPUTATIONAL 
COMPLEXITY)
 
http://dice2013.di.unito.it/

 Roma, March 16,17 
2013
  satellite event of 
ETAPS 2013
 
   call for 
participation


IMPORTANT DATES:

submission:January 10, 2013
notification: January 25, 2013
final version due:February 14, 2013

INVITED:

‣ Jean-Yves Marion (Loria - INPL Nancy)
‣ Marko van Eekelen (Open University - Radboud University 
Nijmegen)
‣ Paul-André Melliès (PPS, Paris)


SCOPE:

The area of Implicit Computational Complexity (ICC) has grown out from several 
proposals
 to use logic and formal methods to provide languages for complexity-bounded 
computation
 (e.g. Ptime, Logspace computation). It aims at studying computational 
complexity without
 referring to external measuring conditions or a particular machine model, but 
only by
 considering language restrictions or logical/computational principles implying 
complexity properties. 
This workshop focuses on ICC methods related to programs (rather than 
descriptive methods). 
In this approach one relates complexity classes to restrictions on programming 
paradigms 
(functional programs, lambda calculi, rewriting systems), such as ramified 
recurrence, weak 
polymorphic types, linear logic and linear types, and interpretative measures. 
The two main 
objectives of this area are:
- to find natural implicit characterizations of various 
complexity classes of functions, thereby 
   illuminating their nature and importance;
- to design methods suitable for static verification of program 
complexity.

Therefore ICC is related on the one hand to the study of complexity classes, 
and on the other 
hand to static program analysis. The workshop will be open to contributions on 
various aspects 
of ICC including (but not exclusively):
- types for controlling complexity,
- logical systems for implicit computational complexity,
- linear logic,
- semantics of complexity-bounded computation,
- rewriting and termination orderings,
- interpretation-based methods for implicit complexity,
- programming languages for complexity-bounded computation,
- application of implicit complexity to other programming 
paradigms  
  (e.g. imperative or object-oriented languages).

 
POST-PROCEEDINGS:

An open call for post-proceedings, as special issue of 
  INFORMATION  COMPUTATION 
will follow.

PROGRAM COMMITTEE:

‣ Roberto Amadio (Paris-Diderot)
‣ Harry Mairson (Brandeis)
‣ Virgile Mogbil (Paris 13)
‣ Simona Ronchi Della Rocca (Torino) (Chair)
‣ Luca Roversi (Torino)
‣ Olha Shkaravska (Nijmegen)
‣ Ulrich Schöpp (LMU)
‣ Aleksy Shubert (Warsaw)
‣ Jakob G. Simonsen (DIKU)


STEERING COMMITTEE:

‣ Patrick Baillot (ENS Lyon, CNRS)
‣ Ugo Dal Lago (Università degli Studi di Bologna)
‣ Martin Hofmann (Ludwig-Maximilians-Universität München)
‣ Jean-Yves Marion (Loria - INPL Nancy)
‣ Simona Ronchi Della Rocca (Università degli Studi di Torino))


Simona Ronchi Della Rocca
full Professor of  
Foundations of Computer Science
Dipartimento di Informatica
Universita' di Torino
c.Svizzera 185, 10149 Torino (Italy)

e-mail :  ron...@di.unito.it
phone: +39-011-6706734
fax : +39-011-751603
mobile: +39-320-4205121

http://www.di.unito.it/~ronchi





[TYPES/announce] Control Operators and their Semantics (COS'13) - Second Call for Papers

2013-02-13 Thread Ugo de' Liguoro
[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]




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/




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

To make reviewing faster we ask title and (short) abstract within
March the 24th. The deadline for the pdf text is April the 6th.


Important Dates:

Abstract: March,24   2013
Submission:   April,62013
Notification: April,29   2013 (changed)
Final version:May,  15   2013 (changed)
Workshop: June, 24-252013


Contact:

Ugo de'Liguoro
Dipartimento di Informatica,
Universita' di Torino,
Corso Svizzera 185, 10149 Torino, Italy
email: deligu...@di.unito.it


Web sites:

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