fixpt

Propositions as types never troubled me: a proposition is a type, a proof a term of it, the Curry-Howard correspondence.

This is my first post about Lean on this blog :) It is meant as a response to Joachim’s post about extrinsic termination proofs.

Denotational semantics assign meaning to a program (e.g., in untyped lambda calculus) by mapping the program into a self-contained domain model in some meta language (e.g., Scott domains).

Welcome back!

Non-strict languages like Haskell often require the programmer to reason about strictness to achieve good performance.

As Hakylls FAQ points out, in order to have source code highlighting for your blog, you need appropriate CSS markup.