Primary evidence
- Edinburgh LCF: A Mechanized Logic of ComputationS1 · Primary research · Paper · 1979-12-01
Edinburgh LCF avoided retaining complete proof objects by exposing theorem values through a restricted abstract interface whose constructors corresponded to axioms and inference rules.
The Springer monograph Edinburgh LCF: A Mechanized Logic of Computation, published on 1 December 1979, documented the Edinburgh LCF system and its ML-based proof environment. Milner's retrospective account dates the Edinburgh LCF project to 1974 and explains that ML was created as a metalanguage for machine-assisted proof after experience with Stanford LCF.
Edinburgh LCF avoided retaining complete proof objects by exposing theorem values through a restricted abstract interface whose constructors corresponded to axioms and inference rules. Users could write higher-level proof procedures in the typed functional language ML, while tactics and tacticals supported reusable backward proof strategies.
This separation between a small trusted logical core and powerful untrusted proof automation became one of the central engineering patterns of proof assistants. It made extensible automation compatible with strong assurance and created the lineage from LCF to HOL and Isabelle that later supplied machine-readable formal environments for AI theorem proving.
Significance rationale: Edinburgh LCF turned lessons from Stanford LCF into a durable proof-assistant architecture: a small trusted inference interface protected by an abstract theorem type, an ML metalanguage for extending proof procedures, and tactics/tacticals for programmable goal-directed proof. These ideas became architectural foundations for HOL, Isabelle and many later interactive theorem provers.
Springer's archival monograph supplies an exact publication anchor for the mature Edinburgh LCF system; Milner's retrospective history distinguishes its 1974 project origin from Stanford LCF in 1971–1972.
No corrections recorded.