ICFP Workshops 2021
26th ACM SIGPLAN International Conference on Functional Programming (ICFP 2021)
Powered by
Conference Publishing Consulting

6th ACM SIGPLAN International Workshop on Type-Driven Development (TyDe 2021), August 22, 2021, Virtual, Republic of Korea

TyDe 2021 – Proceedings

Contents - Abstracts - Authors

6th ACM SIGPLAN International Workshop on Type-Driven Development (TyDe 2021)

Frontmatter

Title Page


Welcome from the Chairs
Welcome to the 6 th ACM SIGPLAN International Workshop on Type-Driven Development (TyDe 2021), co-located with the International Conference on Functional Programming (ICFP 2021). The workshop brings together leading researchers and practitioners who are using or exploring types as a means to support program development.
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.

Papers

Actions You Can Handle: Dependent Types for AI Plans
Alasdair Hill, Ekaterina Komendantskaya, Matthew L. Daggitt, and Ronald P. A. Petrick
(Heriot-Watt University, UK)
Verification of AI is a challenge that has engineering, algorithmic and programming language components. For example, AI planners are deployed to model actions of autonomous agents. They comprise a number of searching algorithms that, given a set of specified properties, find a sequence of actions that satisfy these properties. Although AI planners are mature tools from the algorithmic and engineering points of view, they have limitations as programming languages. Decidable and efficient automated search entails restrictions on the syntax of the language, prohibiting use of higher-order properties or recursion. This paper proposes a methodology for embedding plans produced by AI planners into the dependently-typed language Agda, which enables users to reason about and verify more general and abstract properties of plans, and also provides a more holistic programming language infrastructure for modelling plan execution.

Publisher's Version Article Search Info
A Simpler Encoding of Indexed Types
Yinsen ZhangORCID logo
(Pennsylvania State University, USA)
In functional programming languages, generalized algebraic data types (GADTs) are very useful as the unnecessary pattern matching over them can be ruled out by the failure of unification of type arguments. In dependent type systems, this is usually called indexed types and it’s particularly useful as the identity type is a special case of it. However, pattern matching over indexed types is very complicated as it requires term unification in general. We study a simplified version of indexed types (called simpler indexed types) where we explicitly specify the selection process of constructors, and we discuss its expressiveness, limitations, and properties.

Publisher's Version Article Search

proc time: 1.83