curry-howard

Not the keyword you're looking for? See all keywords.

Programming a Mini-Lean in Julia's Type System Programming a Mini-Lean in Julia’s Type System
18 min read Keywords:  theorem proving, julia, lean, curry-howard, Type Systems, formal verification

Guillermo Angeris builds a working theorem prover in 61 lines of Julia. A tiny trusted kernel, six axioms, and the compiler does the rest. This article walks through the full construction.

Building a Tiny Theorem Prover in Python Building a Tiny Theorem Prover in Python
7 min read Keywords:  theorem proving, python, type theory, formal verification, logic, curry-howard

A tiny theorem prover is just a term language, a checker, and a small trusted kernel. We build one in plain Python to make the architecture explicit.

Propositions Are Types, Proofs Are Programs Propositions Are Types, Proofs Are Programs
12 min read Keywords:  curry-howard, type theory, theorem proving, logic, formal verification

The Curry-Howard correspondence says that types and logical propositions are the same thing. Understanding why changes how you think about both programming and mathematics.