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