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.rew_ord, rules: Rule_Def.rule list, scr: Rule_Def.program, srls: T}
16 val append_rules: string -> T -> Rule_Def.rule list -> T
17 val keep_unique_rules: string -> T -> Rule_Def.rule list -> T
18 val merge: string -> T -> T -> T
19 val get_rules: T -> Rule_Def.rule list
20 (*val rule2rls' : Rule.rule -> string*)
21 val id_from_rule : Rule.rule -> string
24 val equal: (''a * ('b * 'c)) * (''a * ('d * 'e)) -> bool
25 val to_kestore: for_kestore list * for_kestore list -> for_kestore list
27 (*/------- this will disappear eventually ----------------------------------------------------\*)
29 type rrlsstate = term * term * Rule_Def.rule list list * (Rule_Def.rule * (term * term list)) list
30 val e_rrlsstate: rrlsstate
32 (*\------- this will disappear eventually ----------------------------------------------------/*)
34 (* ---- for tests only: shifted from below to remove the Warning "unused" at fun.def. --------- *)
36 (*/-------------------------------------------------------- ! aktivate for Test_Isac BEGIN ---\* )
37 val insert_merge: for_kestore -> for_kestore list -> for_kestore list
38 ( *\--- ! aktivate for Test_Isac END ----------------------------------------------------------/*)
42 structure Rule_Set(**): RULE_SET(**) =
45 datatype T = datatype Rule_Def.rule_set;
48 (*/------- this will disappear eventually ----------------------------------------------------\*)
49 fun dummy_ord (_: (term * term) list) (_: term, _: term) = true;
51 Rule_Def.Repeat {id = "empty", preconds = [], rew_ord = ("dummy_ord", dummy_ord), erls = Rule_Def.Empty,
52 srls = Rule_Def.Empty, calc = [], rules = [], errpatts = [], scr = Rule_Def.Empty_Prog}
53 (*\------- this will disappear eventually ----------------------------------------------------/*)
56 fun rep Rule_Def.Empty = rep empty
57 | rep (Rule_Def.Repeat {id, preconds, rew_ord, erls, srls, calc, errpatts, rules, scr}) =
58 {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls, errpats = errpatts,
59 calc = calc, rules = rules, scr = scr}
60 | rep (Rule_Def.Sequence {id, preconds, rew_ord, erls, srls, calc, errpatts, rules, scr}) =
61 {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls, errpats = errpatts,
62 calc = calc, rules = rules, scr = scr}
63 | rep (Rule_Def.Rrls _) = rep empty
65 fun append_rules id Rule_Def.Empty _ = raise ERROR ("append_rules: with \"" ^ id ^ "\" not for Rule_Def.Empty")
66 | append_rules id (Rule_Def.Repeat {id = _, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
67 rules = rs, errpatts = errpatts, scr = sc}) r =
68 Rule_Def.Repeat {id = id, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
69 rules = rs @ r, errpatts = errpatts, scr = sc}
70 | append_rules id (Rule_Def.Sequence {id = _, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
71 rules = rs, errpatts = errpatts, scr = sc}) r =
72 Rule_Def.Sequence {id = id, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
73 rules = rs @ r, errpatts = errpatts, scr = sc}
74 | append_rules id (Rule_Def.Rrls _) _ = raise ERROR ("append_rules: not for reverse-rewrite-rule-set " ^ id);
76 fun merge_ids rls1 rls2 =
78 val id1 = (#id o rep) rls1
79 val id2 = (#id o rep) rls2
81 if id1 = id2 then id1 else "merged_" ^ id1 ^ "_" ^ id2
84 fun merge _ Rule_Def.Empty rls = rls
85 | merge _ rls Rule_Def.Empty = rls
86 | merge _ (Rrls x) _ = Rrls x (* required for merging Theory_Data *)
87 | merge _ _ (Rrls x) = Rrls x
89 (Rule_Def.Repeat {preconds = pc1, rew_ord = ro1, erls = er1, srls = sr1, calc = ca1,
90 rules = rs1, errpatts = eps1, scr = sc1, ...})
91 (Rule_Def.Repeat {preconds = pc2, erls = er2, srls = sr2, calc = ca2,
92 rules = rs2, errpatts = eps2, ...})
94 Rule_Def.Repeat {id = id, rew_ord = ro1, scr = sc1,
95 preconds = union (op =) pc1 pc2,
96 erls = merge (merge_ids er1 er2) er1 er2,
97 srls = merge (merge_ids sr1 sr2) sr1 sr2,
98 calc = union Exec_Def.calc_eq ca1 ca2,
99 rules = union Rule.equal rs1 rs2,
100 errpatts = union (op =) eps1 eps2}
102 (Rule_Def.Sequence {preconds = pc1, rew_ord = ro1, erls = er1, srls = sr1, calc = ca1,
103 rules = rs1, errpatts = eps1, scr = sc1, ...})
104 (Rule_Def.Sequence {preconds = pc2, erls = er2, srls = sr2, calc = ca2,
105 rules = rs2, errpatts = eps2, ...})
107 Rule_Def.Sequence {id = id, rew_ord = ro1, scr = sc1,
108 preconds = union (op =) pc1 pc2,
109 erls = merge (merge_ids er1 er2) er1 er2,
110 srls = merge (merge_ids sr1 sr2) sr1 sr2,
111 calc = union Exec_Def.calc_eq ca1 ca2,
112 rules = union Rule.equal rs1 rs2,
113 errpatts = union (op =) eps1 eps2}
114 | merge id _ _ = error ("merge: \"" ^ id ^
115 "\"; not for reverse-rewrite-rule-sets and not for mixed Rls -- Rule_Def.Sequence");
117 (* datastructure for KEStore_Elems, intermediate for thehier *)
119 (id * (* id unique within Isac *)
120 (ThyC.id * (* just for assignment in thehier, not appropriate for parsing etc *)
121 T)) (* ((#id o rep) T) = id by coding discipline *)
122 fun equal ((id1, (_, _)), (id2, (_, _))) = id1 = id2
124 fun insert_merge (re as (id, (thyID, r1))) ys =
125 case get_index (fn y => if curry equal re y then SOME y else NONE) ys of
127 | SOME (i, (_, (_, r2))) =>
129 val r12 = merge id r1 r2
130 in list_update ys i (id, (thyID, r12)) end
131 fun to_kestore (s1, s2) = fold insert_merge s1 s2;
133 (* used only for one hack *)
134 fun keep_unique_rules id
135 (Rule_Def.Repeat {id = _, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
136 rules = rs, errpatts = eps, scr = sc}) r =
137 Rule_Def.Repeat {id = id, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
138 rules = gen_rems Rule.equal (rs, r),
141 | keep_unique_rules id
142 (Rule_Def.Sequence {id = _, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
143 rules = rs, errpatts = eps, scr = sc}) r =
144 Rule_Def.Sequence {id = id, preconds = pc, rew_ord = ro, erls = er, srls = sr, calc = ca,
145 rules = gen_rems Rule.equal (rs, r),
148 | keep_unique_rules id (Rule_Def.Rrls _) _ = raise ERROR ("keep_unique_rules: not for reverse-rewrite-rule-set "^id)
149 | keep_unique_rules _ rls _ = raise ERROR ("remove_rls called with " ^ id rls);
151 fun get_rules Rule_Def.Empty = []
152 | get_rules (Rule_Def.Repeat {rules, ...}) = rules
153 | get_rules (Rule_Def.Sequence {rules, ...}) = rules
154 | get_rules (Rule_Def.Rrls _) = [];
156 fun id_from_rule (Rule.Rls_ rls) = id rls
157 | id_from_rule r = raise ERROR ("id_from_rule: not defined for " ^ Rule.to_string r);
159 (*/------- this will disappear eventually -----------\*)
160 type rrlsstate = (* state for reverse rewriting, comments see type rule and scr | Rfuns *)
161 (term * term * Rule_Def.rule list list * (Rule_Def.rule * (term * term list)) list);
162 val e_rrlsstate = (UnparseC.term_empty, UnparseC.term_empty, [[Rule_Def.Erule]], [(Rule_Def.Erule, (UnparseC.term_empty, []))]) : rrlsstate;
164 fun ii (_: term) = e_rrlsstate;
165 fun no (_: term) = SOME (UnparseC.term_empty, [UnparseC.term_empty]);
166 fun lo (_: Rule_Def.rule list list) (_: term) (_: Rule_Def.rule) = [(Rule_Def.Erule, (UnparseC.term_empty, [UnparseC.term_empty]))];
167 fun ne (_: Rule_Def.rule list list) (_: term) = SOME Rule_Def.Erule;
168 fun fo (_: Rule_Def.rule list list) (_: term) (_: term) = [(Rule_Def.Erule, (UnparseC.term_empty, [UnparseC.term_empty]))];
170 val e_rfuns = Rule_Def.Rfuns {init_state = ii, normal_form = no, locate_rule = lo,
171 next_rule = ne, attach_form = fo};
174 Rule_Def.Rrls {id = "e_rrls", prepat = [], rew_ord = ("dummy_ord", dummy_ord), erls = Rule_Def.Empty,
175 calc = [], errpatts = [], scr = e_rfuns}
176 (*\------- this will disappear eventually -----------/*)