src/HOL/simpdata.ML
author paulson
Thu, 12 Sep 1996 10:36:51 +0200
changeset 1984 5cf82dc3ce67
parent 1968 daa97cc96feb
child 2022 9d47e2962edd
permissions -rw-r--r--
Installed AddIffs, and some code from HOL.ML
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1465
5d7a7e439cec expanded tabs
clasohm
parents: 1264
diff changeset
     1
(*  Title:      HOL/simpdata.ML
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     2
    ID:         $Id$
1465
5d7a7e439cec expanded tabs
clasohm
parents: 1264
diff changeset
     3
    Author:     Tobias Nipkow
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     4
    Copyright   1991  University of Cambridge
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     5
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     6
Instantiation of the generic simplifier
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     7
*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     8
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
     9
section "Simplifier";
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    10
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    11
open Simplifier;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    12
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    13
(*** Integration of simplifier with classical reasoner ***)
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    14
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    15
(*Add a simpset to a classical set!*)
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    16
infix 4 addss;
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    17
fun cs addss ss = cs addbefore asm_full_simp_tac ss 1;
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    18
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    19
fun Addss ss = (claset := !claset addbefore asm_full_simp_tac ss 1);
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    20
1968
daa97cc96feb Beefed-up auto-tactic: now repeatedly simplifies if needed
paulson
parents: 1948
diff changeset
    21
(*Designed to be idempotent, except if best_tac instantiates variables
daa97cc96feb Beefed-up auto-tactic: now repeatedly simplifies if needed
paulson
parents: 1948
diff changeset
    22
  in some of the subgoals*)
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    23
fun auto_tac (cs,ss) = 
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    24
    ALLGOALS (asm_full_simp_tac ss) THEN
1968
daa97cc96feb Beefed-up auto-tactic: now repeatedly simplifies if needed
paulson
parents: 1948
diff changeset
    25
    REPEAT (safe_tac cs THEN ALLGOALS (asm_full_simp_tac ss)) THEN
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    26
    REPEAT (FIRSTGOAL (best_tac (cs addss ss)));
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    27
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    28
fun Auto_tac() = auto_tac (!claset, !simpset);
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    29
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    30
fun auto() = by (Auto_tac());
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    31
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    32
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    33
(*** Addition of rules to simpsets and clasets simultaneously ***)
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    34
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    35
(*Takes UNCONDITIONAL theorems of the form A<->B to 
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    36
	the Safe Intr     rule B==>A and 
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    37
	the Safe Destruct rule A==>B.
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    38
  Also ~A goes to the Safe Elim rule A ==> ?R
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    39
  Failing other cases, A is added as a Safe Intr rule*)
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    40
local
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    41
  val iff_const = HOLogic.eq_const HOLogic.boolT;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    42
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    43
  fun addIff th = 
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    44
      (case HOLogic.dest_Trueprop (#prop(rep_thm th)) of
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    45
		(Const("not",_) $ A) =>
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    46
		    AddSEs [zero_var_indexes (th RS notE)]
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    47
	      | (con $ _ $ _) =>
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    48
		    if con=iff_const
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    49
		    then (AddSIs [zero_var_indexes (th RS iffD2)];  
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    50
			  AddSDs [zero_var_indexes (th RS iffD1)])
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    51
		    else  AddSIs [th]
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    52
	      | _ => AddSIs [th];
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    53
       Addsimps [th])
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    54
      handle _ => error ("AddIffs: theorem must be unconditional\n" ^ 
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    55
			 string_of_thm th)
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    56
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    57
  fun delIff th = 
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    58
      (case HOLogic.dest_Trueprop (#prop(rep_thm th)) of
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    59
		(Const("not",_) $ A) =>
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    60
		    Delrules [zero_var_indexes (th RS notE)]
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    61
	      | (con $ _ $ _) =>
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    62
		    if con=iff_const
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    63
		    then Delrules [zero_var_indexes (th RS iffD2),
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    64
				   zero_var_indexes (th RS iffD1)]
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    65
		    else Delrules [th]
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    66
	      | _ => Delrules [th];
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    67
       Delsimps [th])
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    68
      handle _ => warning("DelIffs: ignoring conditional theorem\n" ^ 
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    69
			  string_of_thm th)
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    70
in
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    71
val AddIffs = seq addIff
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    72
val DelIffs = seq delIff
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    73
end;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    74
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
    75
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    76
local
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    77
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    78
  fun prover s = prove_goal HOL.thy s (fn _ => [fast_tac HOL_cs 1]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    79
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    80
  val P_imp_P_iff_True = prover "P --> (P = True)" RS mp;
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    81
  val P_imp_P_eq_True = P_imp_P_iff_True RS eq_reflection;
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    82
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    83
  val not_P_imp_P_iff_F = prover "~P --> (P = False)" RS mp;
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    84
  val not_P_imp_P_eq_False = not_P_imp_P_iff_F RS eq_reflection;
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    85
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    86
  fun atomize pairs =
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    87
    let fun atoms th =
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    88
	  (case concl_of th of
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    89
	     Const("Trueprop",_) $ p =>
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    90
	       (case head_of p of
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    91
		  Const(a,_) =>
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    92
		    (case assoc(pairs,a) of
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    93
		       Some(rls) => flat (map atoms ([th] RL rls))
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    94
		     | None => [th])
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    95
		| _ => [th])
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    96
	   | _ => [th])
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    97
    in atoms end;
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    98
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
    99
  fun mk_meta_eq r = case concl_of r of
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   100
	  Const("==",_)$_$_ => r
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   101
      |   _$(Const("op =",_)$_$_) => r RS eq_reflection
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   102
      |   _$(Const("not",_)$_) => r RS not_P_imp_P_eq_False
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   103
      |   _ => r RS P_imp_P_eq_True;
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   104
  (* last 2 lines requires all formulae to be of the from Trueprop(.) *)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   105
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   106
  fun gen_all th = forall_elim_vars (#maxidx(rep_thm th)+1) th;
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   107
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   108
  val simp_thms = map prover
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   109
   [ "(x=x) = True",
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   110
     "(~True) = False", "(~False) = True", "(~ ~ P) = P",
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   111
     "(~P) ~= P", "P ~= (~P)", "(P ~= Q) = (P = (~Q))",
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   112
     "(True=P) = P", "(P=True) = P",
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   113
     "(True --> P) = P", "(False --> P) = True", 
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   114
     "(P --> True) = True", "(P --> P) = True",
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   115
     "(P --> False) = (~P)", "(P --> ~P) = (~P)",
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   116
     "(P & True) = P", "(True & P) = P", 
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   117
     "(P & False) = False", "(False & P) = False", "(P & P) = P",
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   118
     "(P | True) = True", "(True | P) = True", 
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   119
     "(P | False) = P", "(False | P) = P", "(P | P) = P",
1948
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   120
     "((~P) = (~Q)) = (P=Q)",
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   121
     "(!x.P) = P", "(? x.P) = P", "? x. x=t", 
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   122
     "(? x. x=t & P(x)) = P(t)", "(! x. x=t --> P(x)) = P(t)" ];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   123
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   124
in
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   125
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   126
val meta_eq_to_obj_eq = prove_goal HOL.thy "x==y ==> x=y"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   127
  (fn [prem] => [rewtac prem, rtac refl 1]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   128
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   129
val eq_sym_conv = prover "(x=y) = (y=x)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   130
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   131
val conj_assoc = prover "((P&Q)&R) = (P&(Q&R))";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   132
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   133
val disj_assoc = prover "((P|Q)|R) = (P|(Q|R))";
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   134
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   135
val imp_disj   = prover "(P|Q --> R) = ((P-->R)&(Q-->R))";
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   136
1948
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   137
(*Avoids duplication of subgoals after expand_if, when the true and false 
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   138
  cases boil down to the same thing.*) 
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   139
val cases_simp = prover "((P --> Q) & (~P --> Q)) = Q";
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   140
965
24eef3860714 changed syntax of "if"
clasohm
parents: 941
diff changeset
   141
val if_True = prove_goalw HOL.thy [if_def] "(if True then x else y) = x"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   142
 (fn _=>[fast_tac (HOL_cs addIs [select_equality]) 1]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   143
965
24eef3860714 changed syntax of "if"
clasohm
parents: 941
diff changeset
   144
val if_False = prove_goalw HOL.thy [if_def] "(if False then x else y) = y"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   145
 (fn _=>[fast_tac (HOL_cs addIs [select_equality]) 1]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   146
965
24eef3860714 changed syntax of "if"
clasohm
parents: 941
diff changeset
   147
val if_P = prove_goal HOL.thy "P ==> (if P then x else y) = x"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   148
 (fn [prem] => [ stac (prem RS eqTrueI) 1, rtac if_True 1 ]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   149
965
24eef3860714 changed syntax of "if"
clasohm
parents: 941
diff changeset
   150
val if_not_P = prove_goal HOL.thy "~P ==> (if P then x else y) = y"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   151
 (fn [prem] => [ stac (prem RS not_P_imp_P_iff_F) 1, rtac if_False 1 ]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   152
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   153
val expand_if = prove_goal HOL.thy
965
24eef3860714 changed syntax of "if"
clasohm
parents: 941
diff changeset
   154
    "P(if Q then x else y) = ((Q --> P(x)) & (~Q --> P(y)))"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   155
 (fn _=> [ (res_inst_tac [("Q","Q")] (excluded_middle RS disjE) 1),
1465
5d7a7e439cec expanded tabs
clasohm
parents: 1264
diff changeset
   156
         rtac (if_P RS ssubst) 2,
5d7a7e439cec expanded tabs
clasohm
parents: 1264
diff changeset
   157
         rtac (if_not_P RS ssubst) 1,
5d7a7e439cec expanded tabs
clasohm
parents: 1264
diff changeset
   158
         REPEAT(fast_tac HOL_cs 1) ]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   159
965
24eef3860714 changed syntax of "if"
clasohm
parents: 941
diff changeset
   160
val if_bool_eq = prove_goal HOL.thy
24eef3860714 changed syntax of "if"
clasohm
parents: 941
diff changeset
   161
                   "(if P then Q else R) = ((P-->Q) & (~P-->R))"
24eef3860714 changed syntax of "if"
clasohm
parents: 941
diff changeset
   162
                   (fn _ => [rtac expand_if 1]);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   163
988
8317adb1c444 Defined addss to perform simplification in a claset.
lcp
parents: 965
diff changeset
   164
(*Add congruence rules for = (instead of ==) *)
8317adb1c444 Defined addss to perform simplification in a claset.
lcp
parents: 965
diff changeset
   165
infix 4 addcongs;
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   166
fun ss addcongs congs = ss addeqcongs (congs RL [eq_reflection]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   167
1264
3eb91524b938 added local simpsets; removed IOA from 'make test'
clasohm
parents: 988
diff changeset
   168
fun Addcongs congs = (simpset := !simpset addcongs congs);
3eb91524b938 added local simpsets; removed IOA from 'make test'
clasohm
parents: 988
diff changeset
   169
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   170
val mksimps_pairs =
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   171
  [("op -->", [mp]), ("op &", [conjunct1,conjunct2]),
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   172
   ("All", [spec]), ("True", []), ("False", []),
965
24eef3860714 changed syntax of "if"
clasohm
parents: 941
diff changeset
   173
   ("If", [if_bool_eq RS iffD1])];
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   174
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   175
fun mksimps pairs = map mk_meta_eq o atomize pairs o gen_all;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   176
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   177
val imp_cong = impI RSN
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   178
    (2, prove_goal HOL.thy "(P=P')--> (P'--> (Q=Q'))--> ((P-->Q) = (P'-->Q'))"
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   179
        (fn _=> [fast_tac HOL_cs 1]) RS mp RS mp);
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   180
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   181
val o_apply = prove_goalw HOL.thy [o_def] "(f o g)(x) = f(g(x))"
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   182
 (fn _ => [rtac refl 1]);
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   183
1948
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   184
(*Miniscoping: pushing in existential quantifiers*)
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   185
val ex_simps = map prover 
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   186
		["(EX x. P x & Q)   = ((EX x.P x) & Q)",
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   187
		 "(EX x. P & Q x)   = (P & (EX x.Q x))",
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   188
		 "(EX x. P x | Q)   = ((EX x.P x) | Q)",
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   189
		 "(EX x. P | Q x)   = (P | (EX x.Q x))",
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   190
		 "(EX x. P x --> Q) = ((ALL x.P x) --> Q)",
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   191
		 "(EX x. P --> Q x) = (P --> (EX x.Q x))"];
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   192
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   193
(*Miniscoping: pushing in universal quantifiers*)
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   194
val all_simps = map prover
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   195
		["(ALL x. P x & Q)   = ((ALL x.P x) & Q)",
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   196
		 "(ALL x. P & Q x)   = (P & (ALL x.Q x))",
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   197
		 "(ALL x. P x | Q)   = ((ALL x.P x) | Q)",
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   198
		 "(ALL x. P | Q x)   = (P | (ALL x.Q x))",
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   199
		 "(ALL x. P x --> Q) = ((EX x.P x) --> Q)",
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   200
		 "(ALL x. P --> Q x) = (P --> (ALL x.Q x))"];
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   201
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   202
val HOL_ss = empty_ss
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   203
      setmksimps (mksimps mksimps_pairs)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   204
      setsolver (fn prems => resolve_tac (TrueI::refl::prems) ORELSE' atac
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   205
                             ORELSE' etac FalseE)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   206
      setsubgoaler asm_simp_tac
1948
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   207
      addsimps ([if_True, if_False, o_apply, imp_disj, conj_assoc, disj_assoc,
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   208
		 cases_simp]
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   209
        @ ex_simps @ all_simps @ simp_thms)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   210
      addcongs [imp_cong];
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   211
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   212
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   213
(*In general it seems wrong to add distributive laws by default: they
1948
78e5bfcbc1e9 Added miniscoping to the simplifier: quantifiers are now pushed in
paulson
parents: 1922
diff changeset
   214
  might cause exponential blow-up.  But imp_disj has been in for a while
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   215
  and cannot be removed without affecting existing proofs.  Moreover, 
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   216
  rewriting by "(P|Q --> R) = ((P-->R)&(Q-->R))" might be justified on the
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   217
  grounds that it allows simplification of R in the two cases.*)
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   218
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   219
941
f8a202891ac9 Enforced partial evaluation of mk_case_split_tac
nipkow
parents: 923
diff changeset
   220
local val mktac = mk_case_split_tac (meta_eq_to_obj_eq RS iffD2)
f8a202891ac9 Enforced partial evaluation of mk_case_split_tac
nipkow
parents: 923
diff changeset
   221
in
f8a202891ac9 Enforced partial evaluation of mk_case_split_tac
nipkow
parents: 923
diff changeset
   222
fun split_tac splits = mktac (map mk_meta_eq splits)
f8a202891ac9 Enforced partial evaluation of mk_case_split_tac
nipkow
parents: 923
diff changeset
   223
end;
f8a202891ac9 Enforced partial evaluation of mk_case_split_tac
nipkow
parents: 923
diff changeset
   224
1722
bb326972ede6 Added split_inside_tac.
berghofe
parents: 1660
diff changeset
   225
local val mktac = mk_case_split_inside_tac (meta_eq_to_obj_eq RS iffD2)
bb326972ede6 Added split_inside_tac.
berghofe
parents: 1660
diff changeset
   226
in
bb326972ede6 Added split_inside_tac.
berghofe
parents: 1660
diff changeset
   227
fun split_inside_tac splits = mktac (map mk_meta_eq splits)
bb326972ede6 Added split_inside_tac.
berghofe
parents: 1660
diff changeset
   228
end;
bb326972ede6 Added split_inside_tac.
berghofe
parents: 1660
diff changeset
   229
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   230
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   231
(* eliminiation of existential quantifiers in assumptions *)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   232
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   233
val ex_all_equiv =
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   234
  let val lemma1 = prove_goal HOL.thy
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   235
        "(? x. P(x) ==> PROP Q) ==> (!!x. P(x) ==> PROP Q)"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   236
        (fn prems => [resolve_tac prems 1, etac exI 1]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   237
      val lemma2 = prove_goalw HOL.thy [Ex_def]
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   238
        "(!!x. P(x) ==> PROP Q) ==> (? x. P(x) ==> PROP Q)"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   239
        (fn prems => [REPEAT(resolve_tac prems 1)])
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   240
  in equal_intr lemma1 lemma2 end;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   241
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   242
(* '&' congruence rule: not included by default!
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   243
   May slow rewrite proofs down by as much as 50% *)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   244
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   245
val conj_cong = impI RSN
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   246
    (2, prove_goal HOL.thy "(P=P')--> (P'--> (Q=Q'))--> ((P&Q) = (P'&Q'))"
1465
5d7a7e439cec expanded tabs
clasohm
parents: 1264
diff changeset
   247
        (fn _=> [fast_tac HOL_cs 1]) RS mp RS mp);
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   248
1548
afe750876848 Added 'section' commands
nipkow
parents: 1485
diff changeset
   249
val rev_conj_cong = impI RSN
afe750876848 Added 'section' commands
nipkow
parents: 1485
diff changeset
   250
    (2, prove_goal HOL.thy "(Q=Q')--> (Q'--> (P=P'))--> ((P&Q) = (P'&Q'))"
afe750876848 Added 'section' commands
nipkow
parents: 1485
diff changeset
   251
        (fn _=> [fast_tac HOL_cs 1]) RS mp RS mp);
afe750876848 Added 'section' commands
nipkow
parents: 1485
diff changeset
   252
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   253
(** 'if' congruence rules: neither included by default! *)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   254
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   255
(*Simplifies x assuming c and y assuming ~c*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   256
val if_cong = prove_goal HOL.thy
965
24eef3860714 changed syntax of "if"
clasohm
parents: 941
diff changeset
   257
  "[| b=c; c ==> x=u; ~c ==> y=v |] ==>\
24eef3860714 changed syntax of "if"
clasohm
parents: 941
diff changeset
   258
\  (if b then x else y) = (if c then u else v)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   259
  (fn rew::prems =>
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   260
   [stac rew 1, stac expand_if 1, stac expand_if 1,
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   261
    fast_tac (HOL_cs addDs prems) 1]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   262
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   263
(*Prevents simplification of x and y: much faster*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   264
val if_weak_cong = prove_goal HOL.thy
965
24eef3860714 changed syntax of "if"
clasohm
parents: 941
diff changeset
   265
  "b=c ==> (if b then x else y) = (if c then x else y)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   266
  (fn [prem] => [rtac (prem RS arg_cong) 1]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   267
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   268
(*Prevents simplification of t: much faster*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   269
val let_weak_cong = prove_goal HOL.thy
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   270
  "a = b ==> (let x=a in t(x)) = (let x=b in t(x))"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   271
  (fn [prem] => [rtac (prem RS arg_cong) 1]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   272
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   273
end;
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   274
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   275
fun prove nm thm  = qed_goal nm HOL.thy thm (fn _ => [fast_tac HOL_cs 1]);
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   276
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   277
prove "conj_commute" "(P&Q) = (Q&P)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   278
prove "conj_left_commute" "(P&(Q&R)) = (Q&(P&R))";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   279
val conj_comms = [conj_commute, conj_left_commute];
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   280
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   281
prove "disj_commute" "(P|Q) = (Q|P)";
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   282
prove "disj_left_commute" "(P|(Q|R)) = (Q|(P|R))";
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   283
val disj_comms = [disj_commute, disj_left_commute];
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   284
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   285
prove "conj_disj_distribL" "(P&(Q|R)) = (P&Q | P&R)";
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   286
prove "conj_disj_distribR" "((P|Q)&R) = (P&R | Q&R)";
1485
240cc98b94a7 Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents: 1465
diff changeset
   287
1892
23765bc3e8e2 Added two new distributive laws
paulson
parents: 1874
diff changeset
   288
prove "disj_conj_distribL" "(P|(Q&R)) = ((P|Q) & (P|R))";
23765bc3e8e2 Added two new distributive laws
paulson
parents: 1874
diff changeset
   289
prove "disj_conj_distribR" "((P&Q)|R) = ((P|R) & (Q|R))";
23765bc3e8e2 Added two new distributive laws
paulson
parents: 1874
diff changeset
   290
23765bc3e8e2 Added two new distributive laws
paulson
parents: 1874
diff changeset
   291
prove "imp_conj_distrib" "(P --> (Q&R)) = ((P-->Q) & (P-->R))";
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   292
prove "imp_conj"         "((P&Q)-->R)   = (P --> (Q --> R))";
1892
23765bc3e8e2 Added two new distributive laws
paulson
parents: 1874
diff changeset
   293
1485
240cc98b94a7 Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents: 1465
diff changeset
   294
prove "de_Morgan_disj" "(~(P | Q)) = (~P & ~Q)";
240cc98b94a7 Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents: 1465
diff changeset
   295
prove "de_Morgan_conj" "(~(P & Q)) = (~P | ~Q)";
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   296
prove "not_iff" "(P~=Q) = (P = (~Q))";
1485
240cc98b94a7 Added qed_spec_mp to avoid renaming of bound vars in 'th RS spec'
nipkow
parents: 1465
diff changeset
   297
1660
8cb42cd97579 *** empty log message ***
oheimb
parents: 1655
diff changeset
   298
prove "not_all" "(~ (! x.P(x))) = (? x.~P(x))";
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   299
prove "imp_all" "((! x. P x) --> Q) = (? x. P x --> Q)";
1660
8cb42cd97579 *** empty log message ***
oheimb
parents: 1655
diff changeset
   300
prove "not_ex"  "(~ (? x.P(x))) = (! x.~P(x))";
1922
ce495557ac33 Installation of auto_tac; re-organization
paulson
parents: 1892
diff changeset
   301
prove "imp_ex" "((? x. P x) --> Q) = (! x. P x --> Q)";
1660
8cb42cd97579 *** empty log message ***
oheimb
parents: 1655
diff changeset
   302
1655
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   303
prove "ex_disj_distrib" "(? x. P(x) | Q(x)) = ((? x. P(x)) | (? x. Q(x)))";
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   304
prove "all_conj_distrib" "(!x. P(x) & Q(x)) = ((! x. P(x)) & (! x. Q(x)))";
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   305
1758
60613b065e9b Added ex_imp
nipkow
parents: 1722
diff changeset
   306
1655
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   307
qed_goal "if_cancel" HOL.thy "(if c then x else x) = x"
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   308
  (fn _ => [simp_tac (HOL_ss setloop (split_tac [expand_if])) 1]);
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   309
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   310
qed_goal "if_distrib" HOL.thy
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   311
  "f(if c then x else y) = (if c then f x else f y)" 
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   312
  (fn _ => [simp_tac (HOL_ss setloop (split_tac [expand_if])) 1]);
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   313
1874
35f22792aade Corrected o_assoc lemma
pusch
parents: 1821
diff changeset
   314
qed_goalw "o_assoc" HOL.thy [o_def] "f o (g o h) = (f o g o h)"
1655
5be64540f275 Added a number of lemmas
nipkow
parents: 1548
diff changeset
   315
  (fn _=>[rtac ext 1, rtac refl 1]);
1984
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   316
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   317
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   318
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   319
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   320
(*** Install simpsets and datatypes in theory structure ***)
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   321
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   322
simpset := HOL_ss;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   323
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   324
exception SS_DATA of simpset;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   325
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   326
let fun merge [] = SS_DATA empty_ss
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   327
      | merge ss = let val ss = map (fn SS_DATA x => x) ss;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   328
                   in SS_DATA (foldl merge_ss (hd ss, tl ss)) end;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   329
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   330
    fun put (SS_DATA ss) = simpset := ss;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   331
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   332
    fun get () = SS_DATA (!simpset);
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   333
in add_thydata "HOL"
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   334
     ("simpset", ThyMethods {merge = merge, put = put, get = get})
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   335
end;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   336
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   337
type dtype_info = {case_const:term, case_rewrites:thm list,
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   338
                   constructors:term list, nchotomy:thm, case_cong:thm};
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   339
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   340
exception DT_DATA of (string * dtype_info) list;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   341
val datatypes = ref [] : (string * dtype_info) list ref;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   342
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   343
let fun merge [] = DT_DATA []
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   344
      | merge ds =
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   345
          let val ds = map (fn DT_DATA x => x) ds;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   346
          in DT_DATA (foldl (gen_union eq_fst) (hd ds, tl ds)) end;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   347
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   348
    fun put (DT_DATA ds) = datatypes := ds;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   349
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   350
    fun get () = DT_DATA (!datatypes);
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   351
in add_thydata "HOL"
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   352
     ("datatypes", ThyMethods {merge = merge, put = put, get = get})
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   353
end;
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   354
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   355
5cf82dc3ce67 Installed AddIffs, and some code from HOL.ML
paulson
parents: 1968
diff changeset
   356
add_thy_reader_file "thy_data.ML";