The workshop on Type-Driven Development aims to show how static type information may be used effectively in the development of computer programs. The workshop, co-located with ICFP, unifies two workshops: the Workshop on Dependently Typed Programming and the Workshop on Generic Programming.
These two research areas have a rich history and bridge both theory and practice. Novel techniques explored by both communities has gradually spread to more mainstream languages. This workshop aims to bring together leading researchers and practitioners in generic programming and dependently typed programming from around the world, and features papers capturing the state of the art in these important areas.
We welcome all contributions, both theoretical and practical, on:
Applications of Applicative Proof Search (Regular paper). Liam O’Connor.
Generic diff3 for Algebraic Datatypes (Regular paper). Marco Vassena.
Generic Lookup and Update for Infinitary Inductive-Recursive Types (Regular paper). Larry Diehl and Tim Sheard.
Liberating Effects with Rows and Handlers (Regular paper). Daniel Hillerström and Sam Lindley.
Programming with Monadic CSP-Style Processes in Dependent Type Theory (Regular paper). Bashar Igried and Anton Setzer.
An Agda formalisation of the transitive closure of block matrices (Extended abstract). Adam Sandberg Eriksson and P. Jansson.
APLicative Programming with Naperian Functors (Extended abstract). Jeremy Gibbons.
Choose Your Own Derivative (Extended abstract). Jennifer Paykin, Antal Spector-Zabusky and Kenneth Foner.
Generic partially-static data (Extended abstract). David Kaloper and Jeremy Yallop.
Parameterized Extensible Effects and Session Types (Extended abstract). Oleg Kiselyov.
Programming Assistance for Type-directed Programming (Extended abstract). Peter-Michael Osera.
|09.25||APLicative Programming with Naperian Functors|
|09.45||Choose Your Own Derivative|
|10.45||Generic diff3 for Algebraic Datatypes|
|11.15||Programming Assistance for Type-directed Programming|
|11.35||Generic partially-static data|
|11.55||Bidirectional Transformations are Proof-Relevant Bisimulations|
|14.00||Applications of Applicative Proof Search|
|14.30||Liberating Effects with Rows and Handlers|
|15.30||Programming with Monadic CSP-Style Processes in Dependent Type Theory|
|16.00||Generic Lookup and Update for Infinitary Inductive-Recursive Types|
|17.00||Parameterized Extensible Effects and Session Types|
|17.20||An Agda formalisation of the transitive closure of block matrices|
We plan to have formal proceedings, published by the ACM. Accepted papers will be included in the ACM Digital Library. Authors must grant ACM publication rights upon acceptance, but may retain copyright if they wish. Authors are encouraged to publish auxiliary material with their paper (source code, test data, and so forth). The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference.
Submitted papers should fall into one of two categories:
Submission is via Easychair.
Regular research papers are expected to present novel and interesting research results. Extended abstracts should report work in progress that the authors would like to present at the workshop.
We welcome submissions from PC members (with the exception of the two co-chairs), but these submissions will be held to a higher standard.
All submissions should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (two-column, 9pt). Extended abstracts must be submitted with the label ‘Extended abstract’ clearly in the title.
Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC program, see its web page.