author paulson
Thu, 15 May 1997 12:40:01 +0200
changeset 3192 a75558a4ed37
parent 1465 5d7a7e439cec
child 6349 f7750d816c21
permissions -rw-r--r--
New version, modified by Konrad Slind and LCP for TFL

(*  Title:      HOL/Subst/ROOT.ML
    ID:         $Id$
    Authors:     Martin Coen, Cambridge University Computer Laboratory
                 Konrad Slind, TU Munich
    Copyright   1993  University of Cambridge,
                1996  TU Munich

Substitution and Unification in Higher-Order Logic. 

Implements Manna & Waldinger's formalization, with Paulson's simplifications,
and some new simplifications by Slind.

Z Manna & R Waldinger, Deductive Synthesis of the Unification Algorithm. 
SCP 1 (1981), 5-48

L C Paulson, Verifying the Unification Algorithm in LCF. SCP 5 (1985), 143-170

AList        -  association lists
UTerm        -  data type of terms
Subst        -  substitutions
Unifier      -  specification of unification and conditions for 
                correctness and termination
Unify        -  the unification function

To load, type use"ROOT.ML"; into an Isabelle-HOL that has TFL 
also loaded. 

HOL_build_completed;    (*Cause examples to fail if HOL did*)

writeln"Root file for Substitutions and Unification";
use_thy "Unify";

writeln"END: Root file for Substitutions and Unification";