EPISODE · Feb 26, 2020 · 15 MIN
Definition of the Mendler encoding
from Iowa Type Theory Commute · host 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).
Embed this episode
NOW PLAYING
Definition of the Mendler encoding
No transcript for this episode yet
Similar Episodes
No similar episodes found.
Similar Podcasts
No similar podcasts found.