Accepted Papers
Call for Papers
1st Workshop on Type-Driven Development
Dependently Typed and Generic Programming
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:
- dependently typed programming;
- generic programming;
- design and implementation of programming languages, exploiting types in novel ways;
- exploiting typed data, data dependent data, or type providers;
- static and dynamic analyses of typed programs;
- tools, IDEs, or testing tools exploiting type information;
- pearls, being elegant, instructive examples of types used in the derivation, calculation, or construction of programs.
Proceedings and Copyright
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.
Submission details
Submitted papers should fall into one of two categories:
- Regular research papers (12 pages)
- Extended abstracts (2 pages)
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.
Important Dates
- Regular paper deadline: Friday, 10th June, 2016
- Extended abstract deadline: Friday, 24th June, 2016
- Author notification: Friday, 8th July, 2016
- Deadline for camera ready version: Sunday, 31st July, 2016
- Workshop: Sunday, 18th September, 2016
Travel Support
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.
Sun 18 SepDisplayed time zone: Osaka, Sapporo, Tokyo change
09:15 - 10:15 | |||
09:15 20mDay opening | Opening TyDe | ||
09:35 20mTalk | APLicative Programming with Naperian Functors TyDe Jeremy Gibbons University of Oxford, UK | ||
09:55 20mTalk | Choose Your Own Derivative TyDe |
10:45 - 12:15 | |||
10:45 30mTalk | Generic diff3 for Algebraic Datatypes TyDe | ||
11:15 20mTalk | Programming Assistance for Type-directed Programming TyDe Peter-Michael Osera Grinnell College | ||
11:35 20mTalk | Generic partially-static data TyDe | ||
11:55 20mTalk | Bidirectional Transformations are Proof-Relevant Bisimulations TyDe James McKinna University of Edinburgh |
14:00 - 15:00 | |||
14:00 30mTalk | Applications of Applicative Proof Search TyDe Liam O'Connor UNSW, Australia | ||
14:30 30mTalk | Liberating Effects with Rows and Handlers TyDe |
15:30 - 16:30 | |||
15:30 30mTalk | Programming with Monadic CSP-Style Processes in Dependent Type Theory TyDe | ||
16:00 30mTalk | Generic Lookup and Update for Infinitary Inductive-Recursive Types TyDe |
17:00 - 18:00 | |||
17:00 20mTalk | Parameterized Extensible Effects and Session Types TyDe Oleg Kiselyov Tohoku University | ||
17:20 20mTalk | An Agda formalisation of the transitive closure of block matrices TyDe Pre-print |
Paper downloads
Generic lookup and update for infinitary inductive-recursive types
- Larry Diehl
- Tim Sheard
APLicative programming with Naperian functors (extended abstract)
- Jeremy Gibbons
Liberating effects with rows and handlers
- Daniel Hillerström
- Sam Lindley
Programming with monadic CSP-style processes in dependent type theory
- Bashar Igried
- Anton Setzer
Generic partially-static data (extended abstract)
- David Kaloper-Meršinjak
- Jeremy Yallop
Parameterized extensible effects and session types (extended abstract)
- Oleg Kiselyov
Applications of applicative proof search
- Liam O'Connor
Programming assistance for type-directed programming (extended abstract)
- Peter-Michael Osera
Choose your own derivative (extended abstract)
- Jennifer Paykin
- Antal Spector-Zabusky
- Kenneth Foner
An agda formalisation of the transitive closure of block matrices (extended abstract)
- Adam Sandberg Eriksson
- Patrik Jansson
Generic Diff3 for algebraic datatypes
- Marco Vassena