LCF
- proof assistants
Robin Milner’s LCF work developed an interactive theorem-proving approach in which theorems are represented by an abstract data type. Only trusted primitive inference operations can construct values of that type, while more elaborate proof procedures combine those operations. This architecture separates flexible automation from the small core responsible for logical soundness. ML originated as a language for organizing such proof procedures. The LCF tradition influenced multiple later provers, but sharing the architecture does not mean that all of them use the same logic or implementation. **Timeline anchor:** 1 January 1972 CE. Stanford LCF 1972; Edinburgh LCF 1979. **References:** [Source 1](https://en.wikipedia.org/wiki/Logic_for_Computable_Functions), [Source 2](https://en.wikipedia.org/wiki/Robin_Milner).
Sources
Related
On other timelines
- Milner’s original LCF proof checker on Type theory · foundations, languages, proof assistants and program logics by @athan