src/HOL/Subst/ROOT.ML
author nipkow
Fri Aug 28 18:52:41 2009 +0200 (2009-08-28)
changeset 32436 10cd49e0c067
parent 9000 c20d58286a51
child 33615 261abc2e3155
permissions -rw-r--r--
Turned "x <= y ==> sup x y = y" (and relatives) into simp rules
     1 (*  Title:      HOL/Subst/ROOT.ML
     2     ID:         $Id$
     3     Authors:     Martin Coen, Cambridge University Computer Laboratory
     4                  Konrad Slind, TU Munich
     5     Copyright   1993  University of Cambridge,
     6                 1996  TU Munich
     7 
     8 Substitution and Unification in Higher-Order Logic. 
     9 
    10 Implements Manna & Waldinger's formalization, with Paulson's simplifications,
    11 and some new simplifications by Slind.
    12 
    13 Z Manna & R Waldinger, Deductive Synthesis of the Unification Algorithm. 
    14 SCP 1 (1981), 5-48
    15 
    16 L C Paulson, Verifying the Unification Algorithm in LCF. SCP 5 (1985), 143-170
    17 
    18 AList        -  association lists
    19 UTerm        -  data type of terms
    20 Subst        -  substitutions
    21 Unifier      -  specification of unification and conditions for 
    22                 correctness and termination
    23 Unify        -  the unification function
    24 
    25 *)
    26 
    27 time_use_thy "Unify";