There are several remedies to this situation, ranging from dependent types (where types may contain values) through intersection types to types with modalities. These systems are well-investigated from a theoretical point of view by logicians and type theorists. However, the impact of these developments on practical programming has been small, partly because they are trading simplicity against expressivity.
The objective of the workshop is to make researchers in programming languages aware of new developments and research directions on the theory side while at the same time pointing out problems arising in practical uses to theorists. Technical topics include, but are not limited to:
Original results that bear on these and related topics are solicited. Papers investigating novel uses, applications, and shortcomings of type systems in the broadest sense are especially encouraged. Authors concerned about the appropriateness of a topic are welcome to consult with the program chairs prior to submission.
An extended abstract should be submitted electronically to firstname.lastname@example.org. Acceptable formats are PostScript or PDF, viewable by gv. Submissions should not exceed 5000 words, excluding bibliography and figures.
Submitted papers will be judged on significance,
relevance, correctness, originality, and clarity. They should include
a clear identification of what has been accomplished and why it
is significant. Informal workshop proceedings will appear as a technical report
at INRIA. It is planned to publish an ENTCS
volume with selected works,
refereed to conference standard, after the workshop.
|Deadline for submission:||27 April 2002||expired|
|Notification:||1 June 2002||expired|
|Final papers due:||21 June 2002|
|Gilles Barthe, INRIA Sophia-Antipolis, France [co-chair]|
|Jacques Garrigue, Kyoto University, Japan|
|Eugenio Moggi, University of Genova, Italy|
|Zhong Shao, Yale University, USA|
|Peter Thiemann, Universitšt Freiburg, Germany [co-chair]|
|Joe Wells, Heriot-Watt University, Edinburgh, Scotland|