The H2 Wiki


greenspun

Greenspun’s tenth rule of mathematical logic

Any sufficiently complicated mathematical proof contains an ad hoc, informally-specified, bug-ridden, inflexible implementation of half of type theory.