1 (* Title: BaseDefinitions/rule-set.sml
3 (c) due to copyright terms
5 In ISAC a Rule_Set serves rewriting. Know_Store holds all rule-sets for ubiquitous access.
9 datatype T = datatype Rule_Def.rule_set
13 val rep: T -> {calc: Rule_Def.calc list, erls: T, errpats: Rule_Def.errpatID list, id: string,
14 preconds: term list, rew_ord: Rewrite_Ord.T, rules: Rule_Def.rule list, scr: Rule_Def.program, srls: T}
15 val to_string: T -> string
17 val append_rules: string -> T -> Rule_Def.rule list -> T
18 val append_erls_rules: string -> T -> Rule_Def.rule list -> T
19 val keep_unique_rules: string -> T -> Rule_Def.rule list -> T
20 val merge: string -> T -> T -> T
21 val get_rules: T -> Rule_Def.rule list
22 val id_from_rule: Rule.rule -> string
23 val contains: Rule.rule -> T -> bool
26 val equal: (''a * ('b * 'c)) * (''a * ('d * 'e)) -> bool
27 val to_kestore: for_kestore list * for_kestore list -> for_kestore list
29 (*/------- this will disappear eventually ----------------------------------------------------\*)
31 type rrlsstate = term * term * Rule_Def.rule list list * (Rule_Def.rule * (term * term list)) list
32 val e_rrlsstate: rrlsstate
34 (*\------- this will disappear eventually ----------------------------------------------------/*)
36 val insert_merge: for_kestore -> for_kestore list -> for_kestore list
41 structure Rule_Set(**): RULE_SET(**) =
44 datatype T = datatype Rule_Def.rule_set;
47 (*/------- this will disappear eventually ----------------------------------------------------\*)
48 fun dummy_ord (_: LibraryC.subst) (_: term, _: term) = true;
50 Rule_Def.Repeat {id = "empty", preconds = [], rew_ord = ("dummy_ord", dummy_ord), erls = Rule_Def.Empty,
51 srls = Rule_Def.Empty, calc = [], rules = [], errpatts = [], scr = Rule_Def.Empty_Prog}
52 (*\------- this will disappear eventually ----------------------------------------------------/*)
55 fun rep Rule_Def.Empty = rep empty
56 | rep (Rule_Def.Repeat {id, preconds, rew_ord, erls, srls, calc, errpatts, rules, scr}) =
57 {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls, errpats = errpatts,
58 calc = calc, rules = rules, scr = scr}
59 | rep (Rule_Def.Sequence {id, preconds, rew_ord, erls, srls, calc, errpatts, rules, scr}) =
60 {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls, errpats = errpatts,
61 calc = calc, rules = rules, scr = scr}
62 | rep (Rule_Def.Rrls _) = rep empty
63 fun to_string Rule_Def.Empty = "Rule_Set.Empty"
64 | to_string (Rule_Def.Repeat {id, preconds, rew_ord, erls = _, srls = _, calc = _, errpatts = _, rules, scr}) =
65 "(Rule_Def.Repeat {id = " ^ id ^ ", preconds = " ^ UnparseC.terms preconds ^ ", rew_ord = " ^ Rewrite_Ord.to_string rew_ord
66 ^ ",\n erls = _, srls = _, calc = _, errpatts = _, "
67 ^ ",\n rules = " ^ Rule.s_to_string rules
68 ^ ",\n rules = " ^ Rule_Def.program_to_string scr ^ "})"
69 | to_string (Rule_Def.Sequence {id, preconds, rew_ord, erls = _, srls = _, calc = _, errpatts = _, rules, scr}) =
70 "(Rule_Def.Repeat {id = " ^ id ^ ", preconds = " ^ UnparseC.terms preconds ^ ", rew_ord = " ^ Rewrite_Ord.to_string rew_ord
71 ^ ",\n erls = _, srls = _, calc = _, errpatts = _, "
72 ^ ",\n rules = " ^ Rule.s_to_string rules
73 ^ ",\n rules = " ^ Rule_Def.program_to_string scr ^ "})"
74 | to_string (Rule_Def.Rrls _) = "Rule_Def.Rrls _"
76 fun append_rules id Rule_Def.Empty r = (*.. required for append_erls_rules *)
77 Rule_Def.Repeat {id = id, preconds = [], rew_ord = ("dummy_ord", dummy_ord), erls = Rule_Def.Empty,
78 srls = Rule_Def.Empty, calc = [], rules = r, errpatts = [], scr = Rule_Def.Empty_Prog}
79 | append_rules id (Rule_Def.Repeat {id = _, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
80 rules = rs, errpatts = errpatts, scr = sc}) r =
81 Rule_Def.Repeat {id = id, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
82 rules = rs @ r, errpatts = errpatts, scr = sc}
83 | append_rules id (Rule_Def.Sequence {id = _, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
84 rules = rs, errpatts = errpatts, scr = sc}) r =
85 Rule_Def.Sequence {id = id, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
86 rules = rs @ r, errpatts = errpatts, scr = sc}
87 | append_rules id (Rule_Def.Rrls _) _ = raise ERROR ("append_rules: not for reverse-rewrite-rule-set " ^ id);
89 fun append_erls_rules id_erls Rule_Def.Empty _ =
90 raise ERROR ("append_erls_rules: with \"" ^ id_erls ^ "\" not for Rule_Def.Empty")
91 | append_erls_rules id_erls (Rule_Def.Repeat
92 {id = id, preconds = pc, rew_ord = ro, erls = erls, srls = sr, calc = ca,
93 rules = rules, errpatts = errpatts, scr = sc}) rs =
94 Rule_Def.Repeat {id = id, preconds = pc, rew_ord = ro, erls = append_rules id_erls erls rs,
95 srls = sr, calc = ca, rules = rules, errpatts = errpatts, scr = sc}
96 | append_erls_rules id_erls (Rule_Def.Sequence
97 {id = id, preconds = pc, rew_ord = ro, erls = erls, srls = sr, calc = ca,
98 rules = rules, errpatts = errpatts, scr = sc}) rs =
99 Rule_Def.Sequence {id = id, preconds = pc, rew_ord = ro, erls = append_rules id_erls erls rs,
100 srls = sr, calc = ca, rules = rules, errpatts = errpatts, scr = sc}
101 | append_erls_rules id_erls (Rule_Def.Rrls _) _ =
102 raise ERROR ("append_erls_rules: not for reverse-rewrite-rule-set " ^ id_erls);
104 fun merge_ids rls1 rls2 =
106 val id1 = (#id o rep) rls1
107 val id2 = (#id o rep) rls2
109 if id1 = id2 then id1 else "merged_" ^ id1 ^ "_" ^ id2
112 fun merge _ Rule_Def.Empty rls = rls
113 | merge _ rls Rule_Def.Empty = rls
114 | merge _ (Rrls x) _ = Rrls x (* required for merging Theory_Data *)
115 | merge _ _ (Rrls x) = Rrls x
117 (Rule_Def.Repeat {preconds = pc1, rew_ord = ro1, erls = er1, srls = sr1, calc = ca1,
118 rules = rs1, errpatts = eps1, scr = sc1, ...})
119 (Rule_Def.Repeat {preconds = pc2, erls = er2, srls = sr2, calc = ca2,
120 rules = rs2, errpatts = eps2, ...})
122 Rule_Def.Repeat {id = id, rew_ord = ro1, scr = sc1,
123 preconds = union (op =) pc1 pc2,
124 erls = merge (merge_ids er1 er2) er1 er2,
125 srls = merge (merge_ids sr1 sr2) sr1 sr2,
126 calc = union Eval_Def.calc_eq ca1 ca2,
127 rules = union Rule.equal rs1 rs2,
128 errpatts = union (op =) eps1 eps2}
130 (Rule_Def.Sequence {preconds = pc1, rew_ord = ro1, erls = er1, srls = sr1, calc = ca1,
131 rules = rs1, errpatts = eps1, scr = sc1, ...})
132 (Rule_Def.Sequence {preconds = pc2, erls = er2, srls = sr2, calc = ca2,
133 rules = rs2, errpatts = eps2, ...})
135 Rule_Def.Sequence {id = id, rew_ord = ro1, scr = sc1,
136 preconds = union (op =) pc1 pc2,
137 erls = merge (merge_ids er1 er2) er1 er2,
138 srls = merge (merge_ids sr1 sr2) sr1 sr2,
139 calc = union Eval_Def.calc_eq ca1 ca2,
140 rules = union Rule.equal rs1 rs2,
141 errpatts = union (op =) eps1 eps2}
142 | merge id _ _ = raise ERROR ("merge: \"" ^ id ^
143 "\"; not for reverse-rewrite-rule-sets and not for mixed Rls -- Rule_Def.Sequence");
145 (* datastructure for KEStore_Elems, intermediate for thehier *)
147 (id * (* id unique within Isac *)
148 (ThyC.id * (* just for assignment in thehier, not appropriate for parsing etc *)
149 T)) (* ((#id o rep) T) = id by coding discipline *)
150 fun equal ((id1, (_, _)), (id2, (_, _))) = id1 = id2
152 fun insert_merge (re as (id, (thyID, r1))) ys =
153 case get_index (fn y => if curry equal re y then SOME y else NONE) ys of
155 | SOME (i, (_, (_, r2))) =>
157 val r12 = merge id r1 r2
158 in list_update ys i (id, (thyID, r12)) end
159 fun to_kestore (s1, s2) = fold insert_merge s1 s2;
161 (* used only for one hack *)
162 fun keep_unique_rules id
163 (Rule_Def.Repeat {id = _, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
164 rules = rs, errpatts = eps, scr = sc}) r =
165 Rule_Def.Repeat {id = id, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
166 rules = gen_rems Rule.equal (rs, r),
169 | keep_unique_rules id
170 (Rule_Def.Sequence {id = _, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
171 rules = rs, errpatts = eps, scr = sc}) r =
172 Rule_Def.Sequence {id = id, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
173 rules = gen_rems Rule.equal (rs, r),
176 | keep_unique_rules id (Rule_Def.Rrls _) _ = raise ERROR ("keep_unique_rules: not for reverse-rewrite-rule-set "^id)
177 | keep_unique_rules _ rls _ = raise ERROR ("remove_rls called with " ^ id rls);
179 fun get_rules Rule_Def.Empty = []
180 | get_rules (Rule_Def.Repeat {rules, ...}) = rules
181 | get_rules (Rule_Def.Sequence {rules, ...}) = rules
182 | get_rules (Rule_Def.Rrls _) = [];
184 fun id_from_rule (Rule.Rls_ rls) = id rls
185 | id_from_rule r = raise ERROR ("id_from_rule: not defined for " ^ Rule.to_string r);
187 (* check if a rule is contained in a rule-set (recursivley down in Rls_);
188 this rule can even be a rule-set itself *)
191 fun (*find (_, Rls_ rls) = finds (get_rules rls)
192 | find r12 = equal r12
193 and*) finds [] = false
194 | finds (r1 :: rs) = if Rule.equal (r, r1) then true else finds rs
196 finds (get_rules rls)
199 (*/------- this will disappear eventually -----------\*)
200 type rrlsstate = (* state for reverse rewriting, comments see type rule and scr | Rfuns *)
201 (term * term * Rule_Def.rule list list * (Rule_Def.rule * (term * term list)) list);
202 val e_rrlsstate = (UnparseC.term_empty, UnparseC.term_empty, [[Rule_Def.Erule]], [(Rule_Def.Erule, (UnparseC.term_empty, []))]) : rrlsstate;
204 fun ii (_: term) = e_rrlsstate;
205 fun no (_: term) = SOME (UnparseC.term_empty, [UnparseC.term_empty]);
206 fun lo (_: Rule_Def.rule list list) (_: term) (_: Rule_Def.rule) = [(Rule_Def.Erule, (UnparseC.term_empty, [UnparseC.term_empty]))];
207 fun ne (_: Rule_Def.rule list list) (_: term) = SOME Rule_Def.Erule;
208 fun fo (_: Rule_Def.rule list list) (_: term) (_: term) = [(Rule_Def.Erule, (UnparseC.term_empty, [UnparseC.term_empty]))];
210 val e_rfuns = Rule_Def.Rfuns {init_state = ii, normal_form = no, locate_rule = lo,
211 next_rule = ne, attach_form = fo};
214 Rule_Def.Rrls {id = "e_rrls", prepat = [], rew_ord = ("dummy_ord", dummy_ord), erls = Rule_Def.Empty,
215 calc = [], errpatts = [], scr = e_rfuns}
216 (*\------- this will disappear eventually -----------/*)