QA9

Six years ago, I taught a class called “Lambda Calculus and Applications” at U.

nepls-fall-2025Download I gave this talk at NEPLS this morning!

I am releasing a podcast episode where I discuss some parts of the paper “Gödel’s system T revisited”, and here is a brief note with some of the definitions I tried to talk through: noteDownload

In 2005, I believe it was, I watched Phil Wadler and Frank Pfenning perform a dramatic version of the proof, under Curry-Howard and following Griffin, of the Law of Excluded Middle.

RTA Open Problem 19 asks for a measure-based proof of termination for beta-reduction of simply typed terms.

Did you know you can write a safe version of the tail function as a fold?

Parametricity is a profound principle in the theory of programming languages — but what kind of principle is it?

I recently watched a pretty inspiring talk by Avi Press about his experience using Haskell at his startup, Scarf.

Strong functional programming was proposed by David Turner, a founding father of modern functional programming (FP), as a better version of the functional programming paradigm realized today in Haskell.

Everyone hates to define the predecessor function on Church-encoded natural numbers, right?