Write a Blog >>
ICFP 2018
Sun 23 - Sat 29 September 2018 St. Louis, Missouri, United States
Thu 27 Sep 2018 11:10 - 11:35 at New York Central - Types Chair(s): Richard A. Eisenberg

Generic programming for mutually recursive families of datatypes is hard. On the other hand, most interesting abstract syntax trees are described by a mutually recursive family of datatypes. We could give up on using that mutually recursive structure, but then we lose the ability to use those generic operations which take advantage of that same structure. We present a new approach to generic programming that uses modern Haskell features to handle mutually recursive families with explicit sum-of-products structure. This additional structure allows us to remove much of the complexity previously associated with generic programming over these types.

Thu 27 Sep

Displayed time zone: Guadalajara, Mexico City, Monterrey change

10:20 - 12:00
TypesTyDe at New York Central
Chair(s): Richard A. Eisenberg Bryn Mawr College, USA
10:20
25m
Research paper
Typing, Representing, and Abstracting Control: Functional Pearl
TyDe
Philipp Schuster University of Tübingen, Germany, Jonathan Immanuel Brachthäuser University of Tübingen, Germany
DOI
10:45
25m
Research paper
Extensible Type-Directed Editing
TyDe
Joomy Korkut Wesleyan University, USA, David Thrane Christiansen Galois, USA
DOI
11:10
25m
Research paper
Sums of Products for Mutually Recursive Datatypes: The Appropriationist’s View on Generic Programming
TyDe
Victor Cacciari Miraldo Utrecht University, Netherlands, Alejandro Serrano Utrecht University, Netherlands
DOI
11:35
25m
Research paper
Implementing Resource-Aware Safe Assembly for Kernel Probes as a Dependently-Typed DSL
TyDe
Ilya Yanok USI Lugano, Switzerland, Nate Nystrom USI Lugano, Switzerland
DOI