Structured Recursion Schemes for Point-Free Recursion episode artwork

EPISODE · Dec 19, 2019 · 12 MIN

Structured Recursion Schemes for Point-Free Recursion

from Iowa Type Theory Commute · host Aaron Stump

Review of basic application of category theory for functional programming.  Recursion schemes are combinators that let you write point-free recursions.

Episode metadata supplied by the publisher feed · Published Dec 19, 2019

Review of basic application of category theory for functional programming. Recursion schemes are combinators that let you write point-free recursions.

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

NOW PLAYING

Structured Recursion Schemes for Point-Free Recursion

0:00 12:30

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

When was this Iowa Type Theory Commute episode published?

This episode was published on December 19, 2019.

What is this episode about?

Review of basic application of category theory for functional programming.  Recursion schemes are combinators that let you write point-free recursions.

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!