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

                          CALL FOR PAPERS
                   (Deadline: March 31, 2010)

                           **ITRS 2010**
         Fifth Workshop on  Intersection Types and Related Systems
             (A FLoC workshop affiliated with LICS 2010)
                   July 9, 2010, Edinburgh, UK
Intersection types were introduced near the end of the 1970s to overcome
the limitations of Curry's type assignment system and to provide a
characterization of the strongly normalizing terms of the Lambda Calculus.
They have been one of the first examples of behavioural type theory:
namely, they provide an abstract specification of computational
properties, by expressing a finer and more precise input/output relation
than  standard, commonly used, type systems can do.

Although intersection types were initially intended for use in analysing
and/or synthesizing lambda models as well as in analysing normalization
properties, over the last twenty years the scope of the research on
intersection types and related systems has broadened in many directions.
Restricted (and more manageable) forms have been investigated, such as
refinement types. Type systems based on intersection type theory have
been extensively studied for practical purposes, such as program
analysis. The dual notion of union types turned out to be quite useful
for programming languages. Finally, the behavioural approach
to types, which can give a static specification of computational
properties, has become central in the most recent research on type theory.

The 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.


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 types to characterize
computational properties.


The submission is in two stages.
(1) Before the workshop, authors are invited to submit an extended
abstract (max. 10 pages) in PDF format, using the Easychair submission
site  http://www.easychair.org/conferences/?conf=itrs2010.
Accepted papers will be presented at the workshop and included in the
preliminary proceedings, which will made available in electronic form.
(2) After the workshop, authors of accepted papers will be invited to
submit full versions, which will be referred for inclusion in final
post-proceedings. The post-proceedings will be  published as a special
issue of Electronic Proceedings in Theoretical Computer Science (EPTCS).
Submissions must be prepared in LaTeX using the EPTCS macro package


Submission of extended abstracts: March 31, 2010
Author notification: April 30, 2010
Final version for preliminary proceedings: May 26, 2010
Workshop: July 9, 2010
Submission for EPTC Post-Proceedings: September 30, 2010 (TBC)


Mariangiola Dezani-Ciancaglini (Univ.di Torino)
Joshua Dunfield (McGill Univ. Montreal)
Silvia Ghilezan (Univ. of Novi Sad)
Atsushi Igarashi (Kyoto Univ.)
Elaine Pimentel (Belo Horizonte Univ.)
Betti Venneri (Univ. di Firenze)  Chair
Joe Wells (Heriot-Watt Univ.Edinburgh).


Reply via email to