The Workshop on Type-driven Development (TyDe) aims to show how static type information may be used effectively in the development of computer programs. Co-located with ICFP, this workshop brings together leading researchers and practitioners who are using or exploring types as a means of program development.
We welcome all contributions, both theoretical and practical, on a range of topics including:
We will have formal proceedings, published by the ACM. Accepted full 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.
The official publication date is the date the papers are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.
Submissions should fall into one of two categories:
The bibliography will not be counted against the page limits for either category.
Regular research papers are expected to present novel and interesting research results, and will be included in the formal proceedings. Extended abstracts should report work in progress that the authors would like to present at the workshop; they will be evaluated primarily for relevance and interest. Extended abstracts will be distributed to workshop attendees but will not be published in the formal proceedings.
We welcome submissions from PC members (with the exception of the two co-chairs), but these submissions will be held to a higher standard.
Submission is handled through HotCRP.
All submissions should be in portable document format (PDF) and formatted using the ACM SIGPLAN style guidelines.
Note that submissions should use the new ‘acmart’ format and the two-column ‘sigplan’ subformat (not to be confused with the one-column ‘acmlarge’ subformat).
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 participation-related expenses. PAC also offers other support, such as for child-care expenses during the meeting or for accommodations for members with physical disabilities. For details on the PAC program, see its web page.
The schedule is shown in the time zone of Belgrade, Bratislava, Budapest, Ljubljana, Prague, where the workshop took place.
| Time | Content |
| 09:00 | A Hoare-Logic Style Refinement Types Formalisation: Zilin Chen (extended abstract) |
| 09:18 | Computing with Generic Trees in Agda: Stephen Dolan (extended abstract) |
| 09:36 | Contextual Algebraic Theories: Generic Boilerplate beyond Abstraction Andreas Nuyts (extended abstract) |
| 09:54 | Provingly Correct Optimisations on Intrinsically Typed Expressions Matthias Heinzel (extended abstract) |
| 10:12 | Structural Refinement Types David Binder: Ingo Skupin, David Läwen, Klaus Ostermann (extended abstract) |
| 10:30 | Break |
| 11:00 | Idris2-Table: evaluating dependently-typed tables with the Brown Benchmark for Table Types: Robert Wright, Michel Steuwer, Ohad Kammar (extended abstract) |
| 11:18 | Syntax-Generic Operations, Reflectively Reified: Tzu-Chi Lin, Hsiang-Shang ‘Josh’ Ko (extended abstract) |
| 11:36 | Toward Grammar Inference via Refinement Types: Michael Schröder, Jürgen Cito (extended abstract) |
| 11:54 | Towards Dependently-Typed Control Effects: Youyou Cong, Kenichi Asai (extended abstract) |
| 12:12 | tylr, a tiny tile-based structure editor: David Moon, Andrew Blinn, Cyrus Omar (extended abstract) |
| 12:30 | Lunch |
| 14:00 | Normalization by Evaluation with Free Extensions: Nathan Corbyn, Ohad Kammar, Sam Lindley, Nachiappan Valliappan, Jeremy Yallop (extended abstract) |
| 14:18 | Zena’s birthday introduction: Marco Gaboardi |
| 14:36 | Compiling without continuations: Simon Peyton Jones |
| 14:54 | On the power of syntactic methods: It is all syntax after all…: Amr Sabry |
| 15:12 | The impact of delimited control and call-by-need in proof theory: Hugo Herbelin |
| 15:30 | Break |
| 16:00 | A Computational Interpretation of Girard’s Intuitionistic Proof-Nets: Delia Kesner |
| 16:18 | Duality of intersection and union types - where and how?: Silvia Ghilezan |
| 16:36 | Mu tilde (re)cycled: Pierre-Louis Curien |
| 16:54 | OPLSS over twenty years (online): Robert Harper |
| 17:12 | Happy Birthday, Zena! |
The proceedings are published on the ACM Digital Library and freely available through ACM OpenTOC.