8298
|
1 |
(* Title: Pure/Isar/net_rules.ML
|
|
2 |
ID: $Id$
|
|
3 |
Author: Markus Wenzel, TU Muenchen
|
8807
|
4 |
License: GPL (GNU GENERAL PUBLIC LICENSE)
|
8298
|
5 |
|
|
6 |
Efficient storage of rules: preserves order, prefers later entries.
|
|
7 |
*)
|
|
8 |
|
|
9 |
signature NET_RULES =
|
|
10 |
sig
|
|
11 |
type 'a T
|
|
12 |
val rules: 'a T -> 'a list
|
11776
|
13 |
val retrieve: 'a T -> term -> 'a list
|
|
14 |
val retrieve_weighted: 'a T -> term -> 'a list
|
|
15 |
val init: ('a * 'a -> bool) -> ('a -> int) -> ('a -> term) -> 'a T
|
8298
|
16 |
val merge: 'a T * 'a T -> 'a T
|
|
17 |
val delete: 'a -> 'a T -> 'a T
|
|
18 |
val insert: 'a -> 'a T -> 'a T
|
|
19 |
val deletes: 'a list -> 'a T -> 'a T
|
|
20 |
val inserts: 'a list -> 'a T -> 'a T
|
11776
|
21 |
val intro: thm T
|
|
22 |
val elim: thm T
|
8298
|
23 |
end;
|
|
24 |
|
|
25 |
structure NetRules: NET_RULES =
|
|
26 |
struct
|
|
27 |
|
|
28 |
(* datatype rules *)
|
|
29 |
|
|
30 |
datatype 'a T =
|
|
31 |
Rules of {
|
|
32 |
eq: 'a * 'a -> bool,
|
11776
|
33 |
weight: 'a -> int,
|
8298
|
34 |
index: 'a -> term,
|
|
35 |
rules: 'a list,
|
|
36 |
next: int,
|
11776
|
37 |
net: ((int * int) * 'a) Net.net};
|
8298
|
38 |
|
11776
|
39 |
fun mk_rules eq weight index rules next net =
|
|
40 |
Rules {eq = eq, weight = weight, index = index, rules = rules, next = next, net = net};
|
8298
|
41 |
|
|
42 |
fun rules (Rules {rules = rs, ...}) = rs;
|
11776
|
43 |
|
|
44 |
|
|
45 |
(* retrieve rules *)
|
|
46 |
|
|
47 |
fun gen_retrieve order (Rules {rules, net, ...}) tm =
|
|
48 |
Tactic.untaglist (map (fn ((_, k), x) => (k, x))
|
|
49 |
(sort (order o pairself #1) (Net.unify_term net tm)));
|
|
50 |
|
|
51 |
fun retrieve x = gen_retrieve (int_ord o pairself snd) x;
|
|
52 |
fun retrieve_weighted x = gen_retrieve (prod_ord int_ord int_ord) x;
|
8298
|
53 |
|
|
54 |
|
|
55 |
(* build rules *)
|
|
56 |
|
11776
|
57 |
fun init eq weight index = mk_rules eq weight index [] ~1 Net.empty;
|
8298
|
58 |
|
11776
|
59 |
fun add rule (Rules {eq, weight, index, rules, next, net}) =
|
|
60 |
mk_rules eq weight index (rule :: rules) (next - 1)
|
|
61 |
(Net.insert_term ((index rule, ((weight rule, next), rule)), net, K false));
|
8298
|
62 |
|
11776
|
63 |
fun make eq weight index rules = foldr (uncurry add) (rules, init eq weight index);
|
8298
|
64 |
|
|
65 |
|
11776
|
66 |
fun merge (Rules {eq, weight, index, rules = rules1, ...}, Rules {rules = rules2, ...}) =
|
|
67 |
make eq weight index (Library.generic_merge eq I I rules1 rules2);
|
8298
|
68 |
|
11776
|
69 |
fun delete rule (rs as Rules {eq, weight, index, rules, next, net}) =
|
8298
|
70 |
if not (Library.gen_mem eq (rule, rules)) then rs
|
11776
|
71 |
else mk_rules eq weight index (Library.gen_rem eq (rules, rule)) next
|
|
72 |
(Net.delete_term ((index rule, ((0, 0), rule)), net, eq o pairself #2));
|
8298
|
73 |
|
|
74 |
fun insert rule rs = add rule (delete rule rs); (*ensure new rule gets precedence*)
|
|
75 |
|
|
76 |
fun deletes rules rs = foldr (uncurry delete) (rules, rs);
|
|
77 |
fun inserts rules rs = foldr (uncurry insert) (rules, rs);
|
|
78 |
|
|
79 |
|
|
80 |
(* intro/elim rules *)
|
|
81 |
|
11776
|
82 |
val intro = init Thm.eq_thm Thm.nprems_of Thm.concl_of;
|
|
83 |
val elim = init Thm.eq_thm Thm.nprems_of Thm.major_prem_of;
|
8298
|
84 |
|
|
85 |
|
|
86 |
end;
|