Skip to content
Modular datatypes: introducing Swierstra's paper "Datatypes à la Carte" episode artwork

Jun 24, 2021 8 min

Modular datatypes: introducing Swierstra's paper "Datatypes à la Carte"

from Iowa Type Theory Commute Hosted by Aaron Stump

In a really wonderful paper of some few years back, Swierstra introduced the idea of modular datatypes using ideas from universal algebra. Modular datatypes allow one to assemble a bigger datatype from component datatypes, and combine functions written on the component datatypes in a modular way. In this episode I introduce the paper and the problem (dubbed the expression problem by Phil Wadler) it is trying to solve. Modular datatypes are a different form of modularity that I would like to consider in the context of the discussion of module systems we have been engaged in now for a while in Chapter 13 of the podcast.

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

Modular datatypes: introducing Swierstra's paper "Datatypes à la Carte"

0:00 8:50

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

How long is this episode of Iowa Type Theory Commute?

This episode is 8 minutes long.

When was this Iowa Type Theory Commute episode published?

This episode was published on June 24, 2021.

Can I download this Iowa Type Theory Commute episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.