Structured Recursion Schemes for Point-Free Recursion
from Iowa Type Theory Commute Hosted by Aaron Stump
Review of basic application of category theory for functional programming. Recursion schemes are combinators that let you write point-free recursions.
Embed this episode
No transcript yet.
Frequently asked questions
How long is this episode of Iowa Type Theory Commute?
This episode is 12 minutes long.
When was this Iowa Type Theory Commute episode published?
This episode was published on December 19, 2019.
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.