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

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

<p>Review of basic application of category theory for functional programming.&nbsp; Recursion schemes are combinators that let you write point-free recursions.</p>

Structured Recursion Schemes for Point-Free Recursion

Aaron Stump talks about type theory, computational logic, and related topics in Computer Science on his short commute.

Share Structured Recursion Schemes for Point-Free Recursion

Sign up to save your podcasts

Structured Recursion Schemes for Point-Free Recursion

Structured Recursion Schemes for Point-Free Recursion

More shows like Iowa Type Theory Commute

The Changelog: Software Development, Open Source

Sean Carroll's Mindscape: Science, Society, Philosophy, Culture, Arts, and Ideas

Interesting Times with Ross Douthat

Tech Won't Save Us

Dwarkesh Podcast

The Ezra Klein Show

The Haskell Interlude

Software Unscripted

Oxide and Friends