Blogs / Personal blogs

Lawrence C. Paulson

lawrencecpaulson.github.io

The formal verification of computer systems has become practical. It has an essential role in tech firms such as Amazon, AMD, Intel, Microsoft and Nvidia. In recent years, researchers have started asking whether verification technology could also benefit research mathematicians. Here, we explore every aspect of doing…

Popular posts
9
Total points
1,467
HN comments
724
Rank
#1,286 personal

Visit lawrencecpaulson.github.io → On Hacker News Oct 2022 – Apr 2026

Math & Algorithms 7Programming Languages 5Software Engineering 2History & Retro Computing 2Systems & Performance 1Life, Learning & Writing 1

1

“Why not just use Lean?”

I have been told that when proposing to formalise mathematics these days, you have to explain why you are not using Lean. And that reminds me why I left the dependent-typed world 40 years ago: its cultism, insularity and conformity. Lean is a great language with good tools, a large library and a huge, enthusiastic…

2

Why don't you use dependent types?

To be fair, nobody asks me this exact question. But people have regularly asked why Isabelle dispenses with proof objects. The two questions are essentially the same, because proof objects are intrinsic to all the usual type theories. They are also completely unnecessary and a huge waste of space. As described in an…

3

Verifying distributed systems with Isabelle/HOL

We use distributed systems every day in the form of internet services. These systems are very useful, but also challenging to implement because networks are unpredictable. Whenever you send a message over the network, it is likely to arrive quite quickly, but it’s possible that it might be delayed for a long time, or…

4

50 years of proof assistants

Crackpots ranging from billionaire Peter Thiel to random YouTube influencers claim that science has been stagnating for the past 50 years. They admit that computing is an exception: they don’t pretend that my personal 32GB laptop is not an advance over the 16MB mainframe that served the whole Caltech community when I…

6

Set theory with types

It is known that mathematics is heavily reliant on set theory, but no one can agree on what set theory is. Many people today understand that we have a choice between set theory and type theory , but they don’t know what type theory is either. Many think that type theory refers to some sort of dependent type theory, as…

7

Memories: Edinburgh ML to Standard ML

Dave MacQueen (with Robert Harper and John Reppy) has written a 100-page History of Standard ML . Here I offer my brief, personal and utterly subjective impressions of its early days, up to the deeply unfortunate schism that created what was then called Caml . Standard ML was a tragic missed opportunity. But even…