[TYPES/announce] Intersection Types and Related Systems (ITRS 2012) -- Final Call

2012-03-27 Thread Luca Paolini

[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

**
  Second CALL FOR PAPER
  Sixth Workshop on Intersection Types and Related Systems (ITRS 2012)
   June 29th, Dubrovnik (Croatia).

http://itrs2012.di.unito.it/

Workshop held in conjunction with LICS 2012

**

ITRS 2010 workshop aims to bring together researchers working on both 
the theory and practical applications of systems based on intersection 
types and related approaches.


IMPORTANT DATES

Abstract Submission: April 13
Author notification: April 30
Abstract final version due: June 10
EPTCS Post-proceedings Submission: before September 30th, 2012

SUBMISSION
The submission is in two stages.
(1) Before the workshop, authors are invited to submit an extended 
abstract (3-5 pages, max. 10 pages) in PDF format.
(2) After the workshop, authors of accepted papers will be invited to 
submit full versions, which will be referred for inclusion in EPTCS 
post-proceedings.


TOPICS
Possible topics for submitted papers include, but are not limited to:
- Formal properties of systems with intersection types.
- Results for related systems, such as union types, refinement types, or 
singleton types.

- Applications to lambda calculus and similar systems.
- Applications to pi-calculus and similar systems.
- Applications for programming languages.
- Applications for other areas, such as database query languages and 
program extraction from proofs.
- Related approaches using behavioural/intesional types to characterize 
computational properties.



PROGRAM COMMITTEE
Stéphane Lengrand (École Polytechnique)
Koji Nakazawa (Kyoto Univ.)
Luke Ong (Oxford Univ.)
Luca Paolini (Univ. Torino), chair
Frank Pfenning (Carniege Mellon Univ.)
Betti Venneri (Univ. di Firenze)


INFORMATION
For further information, please contact
Luca Paolini
Email: paol...@di.unito.it


[TYPES/announce] HOPE 2012 (a new workshop co-located with ICFP): Call for Talk Proposals

2012-03-27 Thread Derek Dreyer
[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

 CALL FOR TALK PROPOSALS

HOPE 2012

 The 1st ACM SIGPLAN Workshop on
   Higher-Order Programming with Effects

September 9, 2012
   Copenhagen, Denmark
(the day before ICFP 2012)

   http://hope2012.mpi-sws.org


HOPE is a *new workshop* that is intended to bring together
researchers interested in the design, semantics, implementation, and
verification of higher-order effectful programs. It will be
*informal*, consisting of invited talks, contributed talks on work in
progress, and open-ended discussion sessions. This 1st edition of HOPE
is dedicated to John Reynolds, whose work is an inspiration to us all.


-
Goals of the Workshop
-

A recurring theme in many papers at ICFP, and in the research of many
ICFP attendees, is the interaction of higher-order programming with
various kinds of effects: storage effects, I/O, control effects,
concurrency, etc. While effects are of critical importance in many
applications, they also make it hard to build, maintain, and reason
about one's code. Higher-order languages (both functional and
object-oriented) provide a variety of abstraction mechanisms to help
tame or encapsulate effects (e.g. monads, ADTs, ownership types,
typestate, first-class events, transactions, Hoare Type Theory,
session types, substructural and region-based type systems), and a
number of different semantic models and verification technologies have
been developed in order to codify and exploit the benefits of this
encapsulation (e.g. bisimulations, step-indexed Kripke logical
relations, higher-order separation logic, game semantics, various
modal logics). But there remain many open problems, and the field is
highly active.

The goal of the HOPE workshop is to bring researchers from a variety
of different backgrounds and perspectives together to exchange new and
exciting ideas concerning the design, semantics, implementation, and
verification of higher-order effectful programs.

We want HOPE to be as informal and interactive as possible. The
program will thus involve a combination of invited talks, contributed
talks about work in progress, and open-ended discussion
sessions. There will be no published proceedings, but participants
will be invited to submit working documents, talk slides, etc. to be
posted on this website.


---
Call for Talk Proposals
---

We solicit proposals for contributed talks. Proposals should be at
most 2 pages, in either plain text or PDF format, and should specify
how long a talk the speaker wishes to give. By default, contributed
talks will be 30 minutes long, but proposals for shorter or longer
talks will also be considered. Speakers may also submit supplementary
material (e.g. a full paper, talk slides) if they desire, which PC
members are free (but not expected) to read.

We are interested in talks on all topics related to the interaction of
higher-order programming and computational effects. Talks about work
in progress are particularly encouraged. If you have any questions
about the relevance of a particular topic, please contact the PC
chairs at the address hope2...@mpi-sws.org.

Deadline for talk proposals:June 8, 2012 (Friday)

Notification of acceptance: July 1, 2012 (Sunday)

Workshop:   September 9, 2012 (Sunday)

The submission website is now open:

  http://www.easychair.org/conferences/?conf=hope2012


-
Workshop Organization
-

Program Co-Chairs:

Amal Ahmed (Northeastern University)
Derek Dreyer (MPI-SWS, Germany)


Program Committee:

Jim Laird (University of Bath)
Rasmus Møgelberg (IT University of Copenhagen)
Greg Morrisett (Harvard University)
Aleks Nanevski (IMDEA Software Institute)
David Naumann (Stevens Institute of Technology)
Matthew Parkinson (Microsoft Research Cambridge)
François Pottier (INRIA Rocquencourt)
Amr Sabry (Indiana University)
Eijiro Sumii (Tohoku University)
Nikhil Swamy (Microsoft Research Redmond)
Nobuko Yoshida (Imperial College London)


[TYPES/announce] Third Call for Papers: Workshop on Script to Program Evolution (STOP 2012)

2012-03-27 Thread Sam Tobin-Hochstadt
[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

CALL FOR PAPERS

3rd Workshop on Script to Program Evolution
 (co-located with ECOOP and PLDI)
 Beijing, China
 June 11, 2012
 http://wrigstad.com/stop12/

Submission site: http://continue2.cs.brown.edu/stop2012/

OVERVIEW

Recent years have seen increased use of scripting languages in large
applications.  Scripting languages optimize development time,
especially early in the software life cycle, over safety and
robustness.  As the understanding of the system reaches a critical
point and requirements stabilize, scripting languages become less
appealing. Compromises made to optimize development time make it
harder to reason about program correctness, harder to do
semantic-preserving refactorings, and harder to optimize execution
speed. Lack of type information makes code harder to navigate and to
use correctly. In the worst cases, this situation leads to a costly
and potentially error-prone rewrite of a program in a compiled
language, losing the flexibility of scripting languages for future
extension.

Recently, pluggable type systems and annotation systems have been
proposed.  Such systems add compile-time checkable annotations without
changing a program’s run-time semantics which facilitates early error
checking and program analysis. It is believed that untyped scripts can
be retrofitted to work with such systems. Furthermore, integration of
typed and untyped code, for example, through use of gradual typing,
allows scripts to evolve into safer programs more suitable for program
analysis and compile-time optimizations.

With few exceptions, practical reports are yet to be found. The STOP
workshop focuses on the evolution of scripts, largely untyped code,
into safer programs, with more rigid structure and more constrained
behavior through the use of gradual/hybrid/pluggable typing, optional
contract checking, extensible languages, refactoring tools, and the
like. The goal is to further the understanding and use of such systems
in practice, and connect practice and theory.

CALL FOR CONTRIBUTIONS

Abstracts, position papers, and status reports are welcome. Papers
should be 1-2 pages in standard ACM SIGPLAN format. All submissions
will be reviewed by the program committee. The accepted papers, after
rework by the authors, will be published in an informal proceedings,
which will be distributed at the workshop. All accepted submissions
shall remain available from the workshop web page.

Papers are to be submitted electronically via the STOP website:
 http://continue2.cs.brown.edu/stop2012/


IMPORTANT DATES

paper submission:  11:59 PM 30 March 2012 Eastern Daylight Time
notification:  20 April 2012
camera-ready paper:15 May 2012
conference date:   11 June 2012

PROGRAM COMMITTEE

 Avik Chaudhuri, Adobe Labs
 Kathryn Gray, Swansea University
 Arjun Guha, Brown University
 David Herman, Mozilla Research
 Manuel Hermenegildo, IMDEA
 Atsushi Igarashi, Kyoto University
 Ranjit Jhala, University of California, San Diego


[TYPES/announce] PhD/Postdoc Positions in Theoretical Computer Science at FAU Erlangen-Nürnberg

2012-03-27 Thread Lutz Schroeder

[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

[I would be grateful for further distribution of the job advertisement 
below]	


In the newly founded Theoretical Computer Science group (Chair 8) at the 
University of Erlangen-Nürnberg, several research positions are 
available that can be filled at the doctoral or post-doctoral level. 
These include project positions of up to two years, in the TV-L E13 or 
E14 pay scale depending on qualification of the applicant; project 
topics include


- coalgebraic logic
- probabilistic description logic
- formal methods in mechanical engineering.

Additionally, at least one position is available that is not tied to a 
specific research project but does carry a teaching obligation of 5h per 
week; in this case, research work can be positioned in any of the core 
fields of the group including


- modal logic
- knowledge representation
- coalgebra
- formal methods
- program semantics
- applications of semantic technologies

Such positions can be filled at TV-L E13 for an initial appointment of 
three years, with a possibility of extension for another three years 
subject to provisions by German laws on temporal employment in academia; 
postdoctoral applicants from EU countries can be appointed at the A13 
payscale (akademischer Rat) (which pays better and has better 
benefits) for two periods of three years, with a possible extension of 
two periods of two years at the A14 payscale (akademischer Oberrat) 
for candidates who successfully complete a habilitation during the first 
six years.


Please send applications consisting of a cover letter, resume, and 
contact details of three references by email to 
lutz.schroe...@cs.fau.de. There is no particular application deadline; 
positions will be filled when suitable candidates are found.


Best regards,

Lutz




--
--
Prof. Dr. Lutz Schröder
Chair of Theoretical Computer Science
Department of Computer Science
Friedrich-Alexander-Universität
Erlangen-Nürnberg
lutz.schroe...@informatik.uni-erlangen.de
lutz.schroe...@cs.fau.de
--