2011 - Dependently Typed Programming 2011

Dependently Typed Programming 2011
August 27, Nijmegen, The Netherlands
affiliated with ITP'11
Introduction
Dependently typed programming is here today: where will it go tomorrow? On the one hand, dependent type theories have grown programming languages; on the other hand, the type systems of programming languages like Haskell (and even C#) are incorporating some kinds of type-level data.

When types involve data, they can capture relationships between data, internalising invariants necessary for appropriate computation. When data describe types, we can express patterns of programming in code. We're beginning to see how to take advantage of the power and precision which dependent types afford, but there are still plenty of problems to address and issues to resolve. The design space is large: this workshop is a forum for researchers who are exploring it.

We hope that the workshop will attract people who either work on the design and implementation of dependently typed programming languages and development environments, or who are using existing systems to develop dependently typed programs or libraries.

The following list contains an (incomplete) selection of topics relevant for the workshop:

The design of dependently typed programming languages: Should we care about phase, or not? Are we going to be partial or total? Are we going to be uniform or properly dependent? How do we deal with equality?
Programming: What are good examples of dependently typed programming? What are the killer apps? What are the emerging programming patterns?
Type checking and elaboration: Clearly, dependent types raise issues which go beyond the traditional Hindley-Milner approach, but hopefully there is a lot to salvage.
Compilation: Can we produce efficent code for Dependently Typed Programs? At least as good as C, if not better?
Development environments: Dependent types open up new challenges but also new opportunities for IDEs.
Reusability: Finer types reduce the reusability of code, but maybe the dependent types come with their own remedy: generic programming using universes? Do we need a module system, and if yes how should it look like? What are examples of good library design?
Reasoning: How well do dependent types integrate with reasoning? Or is program verification just a special form of programming anyway?
Totality: Should dependently typed programs be total And if so how do we make sure that they are?
Effects: How to interface dependently typed programs with the real world?
This workshop is a sequel to the previous workshops on dependently typed programming in Nottingham in 2008: DTP 2008 and in Edinburgh in 2010: DTP 2010.
Invited speaker
Edwin Brady, University of St Andrews

Submissions
If you want to give a talk or a demo at the workshop, please send us a title and an abstract before 10 June 2011 to w.swierstra-AT-cs.ru.nl. Slots will be of 30 minutes (unless you ask for less). We will try to fit as many talks as possible.

We aim to publish post-proceedings containing refereed papers related to the topic of the workshop in a suitable journal. More information about this will come after the workshop.

Important Dates
10 June 2011: Submission deadline
25 June 2011: Notification of acceptance
27 August 2011: DTP workshop
Program Committee
Ana Bove, Chalmers, Sweden
Matthieu Sozeau, INRIA, France
Wouter Swierstra, Radboud University, The Netherlands