Decomposing datatypes into functors episode artwork

EPISODE · Jul 3, 2021 · 13 MIN

Decomposing datatypes into functors

from Iowa Type Theory Commute · host Aaron Stump

This episode continues the discussion of Swierstra's paper "Datatypes à la Carte", explaining how we can decompose a datatype into the application of a fixed-point type constructor and then a functor.  The functor itself can be assembled from other functors for pieces of the datatype.  This makes modular datatypes possible.

Episode metadata supplied by the publisher feed · Published Jul 3, 2021

This episode continues the discussion of Swierstra's paper "Datatypes à la Carte", explaining how we can decompose a datatype into the application of a fixed-point type constructor and then a functor. The functor itself can be assembled from other functors for pieces of the datatype. This makes modular datatypes possible.

PodParley-generated summary based on available episode metadata and transcript content.

NOW PLAYING

Decomposing datatypes into functors

0:00 13:38

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

Frequently Asked Questions

How long is this episode of Iowa Type Theory Commute?

This episode is 13 minutes long.

When was this Iowa Type Theory Commute episode published?

This episode was published on July 3, 2021.

What is this episode about?

This episode continues the discussion of Swierstra's paper "Datatypes à la Carte", explaining how we can decompose a datatype into the application of a fixed-point type constructor and then a functor.  The functor itself can be assembled from other...

Can I download this Iowa Type Theory Commute episode?

Yes, you can download this episode by clicking the download button on the episode player, or subscribe to the podcast in your preferred podcast app for automatic downloads.
URL copied to clipboard!