Slides of a (very) informal lecture of mine on the Curry-Howard correspondence
1 for n in N: 2 for m in N: 3 assert p(n, m) == 1