skip to main content
10.1145/3546196acmconferencesBook PagePublication PagesicfpConference Proceedingsconference-collections
TyDe 2022: Proceedings of the 7th ACM SIGPLAN International Workshop on Type-Driven Development
ACM2022 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
TyDe '22: 7th ACM SIGPLAN International Workshop on Type-Driven Development Ljubljana Slovenia 11 September 2022
ISBN:
978-1-4503-9439-0
Published:
06 September 2022
Sponsors:
Next Conference
Bibliometrics
Skip Abstract Section
Abstract

This report aggregates the full papers presented at the Workshop on Type-Driven Development (TyDe) to be hosted on September 11, 2022 in Ljubljana, Slovenia, co-located with ICFP, the 27th ACM SIGPLAN International Conference on Functional Programming

Historically, TyDe is a merging of two previous workshops: the Workshop on Dependently Typed Programming and the Workshop on Generic Programming. These two research areas have a rich history, bridging both theory and practice, and having types at their core. Novel techniques explored by both communities have gradually spread to more mainstream languages. This workshop thus covers topics of generic programming and dependently typed programming, as well as static and dynamic analyses of types, tools and IDEs, and generally the design and implementation of programming languages exploiting types in novel ways. The workshop features contributions from around the world capturing the state of the art in these important areas.

In addition to the four full papers which you see in these proceedings, seven extended abstracts will be presented at the workshop.

Thanks in advance to all presenters, participants, members of the program committee, the TyDe steering committee, and the organizers of ICFP 2022.

Skip Table Of Content Section
SESSION: Papers
research-article
A Hoare logic style refinement types formalisation

Refinement types is a lightweight yet expressive tool for specifying and reasoning about programs. The connection between refinement types and Hoare logic has long been recognised but the discussion remains largely informal. In this paper, we present a ...

research-article
Structural refinement types

Static types are a great form of lightweight static analysis. But sometimes a type like List is too coarse – we would also like to work with its refinements like non-empty lists, or lists containing exactly 42 elements. Dependent types allow for this, ...

research-article
tylr: a tiny tile-based structure editor

Structure editors designed for keyboard input often struggle to resolve the tension between maintaining hierarchical term structure and offering efficient linear editing affordances. Contemporary designs either compromise structure by deferring to text ...

research-article
Computing with generic trees in Agda

Dependently-typed programming languages offer powerful new means of abstraction, allowing the programmer to work generically across data structures. However, using the standard generic encoding of tree-like data structures (the W-types), we soon notice ...

Contributors
  • Harvard University

Recommendations