Skip to content
Definition of the Mendler encoding episode artwork

Feb 26, 2020 15 min

Definition of the Mendler encoding

from Iowa Type Theory Commute Hosted by Aaron Stump

We consider using Mendler's technique of abstracting out problematic types with new type variables, and how this can yield a lambda encoding where the programmer is in charge of when to make recursive calls (rather than in the Church encoding, where the data present the programmer's combining function with the results of all possible recursive calls on immediate subdata).

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

Definition of the Mendler encoding

0:00 15:52

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 15 minutes long.

When was this Iowa Type Theory Commute episode published?

This episode was published on February 26, 2020.

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.