src/FOLP/ROOT.ML
changeset 1459 d12da312eff4
parent 1361 90d615b599d9
child 2237 f01ac387e82b
     1.1 --- a/src/FOLP/ROOT.ML	Mon Jan 29 13:56:41 1996 +0100
     1.2 +++ b/src/FOLP/ROOT.ML	Mon Jan 29 13:58:15 1996 +0100
     1.3 @@ -1,6 +1,6 @@
     1.4 -(*  Title: 	FOLP/ROOT
     1.5 +(*  Title:      FOLP/ROOT
     1.6      ID:         $Id$
     1.7 -    Author: 	martin Coen, Cambridge University Computer Laboratory
     1.8 +    Author:     martin Coen, Cambridge University Computer Laboratory
     1.9      Copyright   1993  University of Cambridge
    1.10  
    1.11  Modifed version of Lawrence Paulson's FOL that contains proof terms.
    1.12 @@ -20,7 +20,7 @@
    1.13  
    1.14  use "hypsubst.ML";
    1.15  use "classical.ML";      (* Patched 'cos matching won't instantiate proof *)
    1.16 -use "simp.ML";	         (* Patched 'cos matching won't instantiate proof *)
    1.17 +use "simp.ML";           (* Patched 'cos matching won't instantiate proof *)
    1.18  
    1.19  
    1.20  (*** Applying HypsubstFun to generate hyp_subst_tac ***)
    1.21 @@ -34,7 +34,7 @@
    1.22  
    1.23    (*etac rev_cut_eq moves an equality to be the last premise. *)
    1.24    val rev_cut_eq = prove_goal IFOLP.thy 
    1.25 -		"[| p:a=b;  !!x.x:a=b ==> f(x):R |] ==> ?p:R"
    1.26 +                "[| p:a=b;  !!x.x:a=b ==> f(x):R |] ==> ?p:R"
    1.27     (fn prems => [ REPEAT(resolve_tac prems 1) ]);
    1.28  
    1.29    val rev_mp = rev_mp
    1.30 @@ -78,4 +78,4 @@
    1.31  use "../Pure/install_pp.ML";
    1.32  print_depth 8;
    1.33  
    1.34 -val FOLP_build_completed = ();	(*indicate successful build*)
    1.35 +val FOLP_build_completed = ();  (*indicate successful build*)