Patterns in Functional Programming

This series of lectures will cover recursion patterns in functional programming: folds and unfolds, and their various generalizations. My plan is that it will build on the categorical foundations of initial algebras, final coalgebras, adjunctions, etc laid down in Roy Crole's and Venanzio Capretta's lectures, and make explicit connection with short concrete functional programs for problems such as sorting and data transformation.

Lecture Notes

Folds and Unfolds
Sorting Algorithms
Primitive (Co-)Recursion
Metamorphisms
Sorting with Bialgebras
Adjunctions
Monads

Last modified: Wed Apr 1 21:10:38 CEST 2015