# HG changeset patch
# User wenzelm
# Date 975370272 -3600
# Node ID df079a585e6d1df28e8457c1d8144e5802d12632
# Parent  b92c228660e491dda65e47e0efd1f4a16c7cda83
added consumes, consumes_default;
added save;
tuned;

diff -r b92c228660e4 -r df079a585e6d src/Pure/Isar/rule_cases.ML
--- a/src/Pure/Isar/rule_cases.ML	Tue Nov 28 01:10:37 2000 +0100
+++ b/src/Pure/Isar/rule_cases.ML	Tue Nov 28 01:11:12 2000 +0100
@@ -8,12 +8,14 @@
 
 signature RULE_CASES =
 sig
-  type T (* = (string * typ) list * term list *)
+  val consumes: int -> 'a attribute
+  val consumes_default: int -> 'a attribute
   val name: string list -> thm -> thm
   val case_names: string list -> 'a attribute
-  val get: thm -> string list
-  val add: thm -> thm * string list
-  val none: thm -> thm * string list
+  val get: thm -> string list * int
+  val add: thm -> thm * (string list * int)
+  val save: thm -> thm -> thm
+  type T (* = (string * typ) list * term list *)
   val make: bool -> thm -> string list -> (string * T) list
   val rename_params: string list list -> thm -> thm
   val params: string list list -> 'a attribute
@@ -22,29 +24,54 @@
 structure RuleCases: RULE_CASES =
 struct
 
+(* number of consumed facts *)
 
-(* local contexts *)
+val consumesN = "consumes";
+
+fun lookup_consumes thm = Library.assoc (Thm.tags_of_thm thm, consumesN);
 
-type T = (string * typ) list * term list;
-val casesN = "cases";
+fun get_consumes thm =
+  let fun err () = raise THM ("Malformed 'consumes' tag of theorem", 0, [thm]) in
+    (case lookup_consumes thm of
+      None => 0
+    | Some [s] => (case Syntax.read_nat s of Some n => n | _ => err ())
+    | _ => err ())
+  end;
+
+fun put_consumes n = Drule.tag_rule (consumesN, [Library.string_of_int n]);
+val save_consumes = put_consumes o get_consumes;
+
+fun consumes n x = Drule.rule_attribute (K (put_consumes n)) x;
+fun consumes_default n x = if Library.is_some (lookup_consumes (#2 x)) then x else consumes n x;
 
 
 (* case names *)
 
+val casesN = "cases";
+
 fun name names thm =
   thm
   |> Drule.untag_rule casesN
   |> Drule.tag_rule (casesN, names);
 
+fun get_case_names thm = Library.assocs (Thm.tags_of_thm thm) casesN;
+val save_case_names = name o get_case_names;
+
 fun case_names ss = Drule.rule_attribute (K (name ss));
 
-fun get thm = Library.assocs (Thm.tags_of_thm thm) casesN;
+
+(* access hints *)
+
+fun get thm = (get_case_names thm, get_consumes thm);
 fun add thm = (thm, get thm);
-fun none thm = (thm, []);
+
+fun save thm = save_case_names thm o save_consumes thm;
 
 
 (* prepare cases *)
 
+type T = (string * typ) list * term list;
+
 fun prep_case open_parms thm name i =
   let
     val (_, _, Bi, _) = Thm.dest_state (thm, i)
@@ -64,7 +91,7 @@
 
 fun rename_params xss thm =
   #1 (foldl (fn ((th, i), xs) => (Thm.rename_params_rule (xs, i) th, i + 1)) ((thm, 1), xss))
-  |> name (get thm);
+  |> save thm;
 
 fun params xss = Drule.rule_attribute (K (rename_params xss));