|
1266
|
1 |
(* Title: HOL/Subst/ROOT.ML
|
|
|
2 |
ID: $Id$
|
|
968
|
3 |
Author: Martin Coen, Cambridge University Computer Laboratory
|
|
|
4 |
Copyright 1993 University of Cambridge
|
|
|
5 |
|
|
|
6 |
Substitution and Unification in Higher-Order Logic.
|
|
|
7 |
|
|
|
8 |
Implements Manna & Waldinger's formalization, with Paulson's simplifications:
|
|
|
9 |
|
|
|
10 |
Z Manna & R Waldinger, Deductive Synthesis of the Unification Algorithm.
|
|
|
11 |
SCP 1 (1981), 5-48
|
|
|
12 |
|
|
|
13 |
L C Paulson, Verifying the Unification Algorithm in LCF. SCP 5 (1985), 143-170
|
|
|
14 |
|
|
|
15 |
setplus - minor additions to HOL's set theory
|
|
|
16 |
alist - association lists
|
|
|
17 |
uterm - inductive data type of terms
|
|
|
18 |
utlemmas - definition of occurs and vars_of for terms
|
|
|
19 |
subst - substitutions
|
|
|
20 |
unifier - specification of unification and conditions for
|
|
|
21 |
correctness and termination
|
|
|
22 |
|
|
|
23 |
To load, go to the parent directory and type use"Subst/ROOT.ML";
|
|
|
24 |
*)
|
|
|
25 |
|
|
1165
|
26 |
HOL_build_completed; (*Cause examples to fail if HOL did*)
|
|
968
|
27 |
|
|
|
28 |
writeln"Root file for Substitutions and Unification";
|
|
|
29 |
loadpath := ["Subst"];
|
|
|
30 |
|
|
1266
|
31 |
use_thy "Unifier";
|
|
968
|
32 |
|
|
|
33 |
writeln"END: Root file for Substitutions and Unification";
|