Start / Iowa Type Theory Commute / Structured recursion schemes for point free recursion

Iowa Type Theory Commute

Structured Recursion Schemes for Point-Free Recursion

13 min • 19 december 2019

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

Senaste avsnitt

Correction: the Correct Author of the Proof from Last Episode, and an AI flop

12 maj | 7 min

Krivine's Proof of FD, Using Intersection Types

5 maj | 22 min

A Measure-Based Proof of Finite Developments

16 april | 23 min

Introduction to the Finite Developments Theorem

27 mars | 16 min

Nominal Isabelle/HOL

31 januari | 16 min
Vad är en podd?

En liten tjänst av I'm With Friends. Finns även på engelska.

Podcastbild

00:00 -00:00
00:00 -00:00