Jump to content

Logic for Computable Functions

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 18.111.0.136 (talk) at 01:42, 27 December 2002. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A theorem prover developed at University of Edinborough by Robin Milner. It introduced a general purpose programming language ML to allow users to write theorem proving tactics. Theorems are proposition of special "theorem" type, the ML type system ensures that theorems are derived using only sound inference rules.

Successors include HOL theorem prover, Isabelle theorem prover.