I have been making my products statically linked over the past few days. This post presents why and how to statically link your Haskell executables and collects a mapping from obscure error to unexpected fixes.This work would not have been possible without…

A formalization of logical refinement types in Lean 4

Changes in Typst 0.14.1

Changes in Typst 0.14.2

Personal blog of Stephen Diehl - Software engineer writing about technology, programming, and the future

The homepage for the mathlib library for the Lean theorem prover. Contains an archive of the Zulip chat for discussions about Lean and mathlib.

Looking at the first principles of icon design—and how Apple failed to apply all of them in macOS Tahoe

This is, I'm afraid, another question that MSE couldn't answer.

It's easy to see how inductively-defined data types correspond to least fixed points. Let's take the natural numbers as an example, ...

Ever since the work by Gimenez for his PhD thesis, Coq has supported positive coinductive types. For example, the type of always-infinite streams containing elements of type A and accessor function...