neuper@37906
|
1 |
(* tests on PolyMinus
|
neuper@37906
|
2 |
author: Walther Neuper
|
neuper@37906
|
3 |
WN071207,
|
neuper@37906
|
4 |
(c) due to copyright terms
|
neuper@37906
|
5 |
|
neuper@37906
|
6 |
use"../smltest/IsacKnowledge/polyminus.sml";
|
neuper@37906
|
7 |
use"polyminus.sml";
|
neuper@37906
|
8 |
*)
|
neuper@37906
|
9 |
val thy = PolyMinus.thy;
|
neuper@37906
|
10 |
|
neuper@37906
|
11 |
"-----------------------------------------------------------------";
|
neuper@37906
|
12 |
"table of contents -----------------------------------------------";
|
neuper@37906
|
13 |
"-----------------------------------------------------------------";
|
neuper@37906
|
14 |
"----------- fun eval_ist_monom ----------------------------------";
|
neuper@37906
|
15 |
"----------- watch order_add_mult -------------------------------";
|
neuper@37906
|
16 |
"----------- build predicate for +- ordering ---------------------";
|
neuper@37906
|
17 |
"----------- build fasse_zusammen --------------------------------";
|
neuper@37906
|
18 |
"----------- build verschoenere ----------------------------------";
|
neuper@37906
|
19 |
"----------- met simplification for_polynomials with_minus -------";
|
neuper@37906
|
20 |
"----------- pbl polynom vereinfachen p.33 -----------------------";
|
neuper@37906
|
21 |
"----------- met probe fuer_polynom ------------------------------";
|
neuper@37906
|
22 |
"----------- pbl polynom probe -----------------------------------";
|
neuper@37906
|
23 |
"----------- pbl klammer polynom vereinfachen p.34 ---------------";
|
neuper@37906
|
24 |
"----------- try fun applyTactics --------------------------------";
|
neuper@37906
|
25 |
"----------- pbl binom polynom vereinfachen p.39 -----------------";
|
neuper@37906
|
26 |
"----------- pbl binom polynom vereinfachen: cube ----------------";
|
neuper@37906
|
27 |
"----------- refine Vereinfache ----------------------------------";
|
neuper@37906
|
28 |
"-----------------------------------------------------------------";
|
neuper@37906
|
29 |
"-----------------------------------------------------------------";
|
neuper@37906
|
30 |
"-----------------------------------------------------------------";
|
neuper@37906
|
31 |
|
neuper@37906
|
32 |
|
neuper@37906
|
33 |
"----------- fun eval_ist_monom ----------------------------------";
|
neuper@37906
|
34 |
"----------- fun eval_ist_monom ----------------------------------";
|
neuper@37906
|
35 |
"----------- fun eval_ist_monom ----------------------------------";
|
neuper@37906
|
36 |
ist_monom (str2term "12");
|
neuper@37906
|
37 |
case eval_ist_monom 0 0 (str2term "12 ist_monom") 0 of
|
neuper@37926
|
38 |
SOME ("12 ist_monom = True", _) => ()
|
neuper@37906
|
39 |
| _ => raise error "polyminus.sml: 12 ist_monom = True";
|
neuper@37906
|
40 |
|
neuper@37906
|
41 |
case eval_ist_monom 0 0 (str2term "a ist_monom") 0 of
|
neuper@37926
|
42 |
SOME ("a ist_monom = True", _) => ()
|
neuper@37906
|
43 |
| _ => raise error "polyminus.sml: a ist_monom = True";
|
neuper@37906
|
44 |
|
neuper@37906
|
45 |
case eval_ist_monom 0 0 (str2term "(3*a) ist_monom") 0 of
|
neuper@37926
|
46 |
SOME ("3 * a ist_monom = True", _) => ()
|
neuper@37906
|
47 |
| _ => raise error "polyminus.sml: 3 * a ist_monom = True";
|
neuper@37906
|
48 |
|
neuper@37906
|
49 |
case eval_ist_monom 0 0 (str2term "(a^^^2) ist_monom") 0 of
|
neuper@37926
|
50 |
SOME ("a ^^^ 2 ist_monom = True", _) => ()
|
neuper@37906
|
51 |
| _ => raise error "polyminus.sml: a^^^2 ist_monom = True";
|
neuper@37906
|
52 |
|
neuper@37906
|
53 |
case eval_ist_monom 0 0 (str2term "(3*a^^^2) ist_monom") 0 of
|
neuper@37926
|
54 |
SOME ("3 * a ^^^ 2 ist_monom = True", _) => ()
|
neuper@37906
|
55 |
| _ => raise error "polyminus.sml: 3*a^^^2 ist_monom = True";
|
neuper@37906
|
56 |
|
neuper@37906
|
57 |
case eval_ist_monom 0 0 (str2term "(a*b) ist_monom") 0 of
|
neuper@37926
|
58 |
SOME ("a * b ist_monom = True", _) => ()
|
neuper@37906
|
59 |
| _ => raise error "polyminus.sml: a*b ist_monom = True";
|
neuper@37906
|
60 |
|
neuper@37906
|
61 |
case eval_ist_monom 0 0 (str2term "(3*a*b) ist_monom") 0 of
|
neuper@37926
|
62 |
SOME ("3 * a * b ist_monom = True", _) => ()
|
neuper@37906
|
63 |
| _ => raise error "polyminus.sml: 3*a*b ist_monom = True";
|
neuper@37906
|
64 |
|
neuper@37906
|
65 |
|
neuper@37906
|
66 |
"----------- watch order_add_mult -------------------------------";
|
neuper@37906
|
67 |
"----------- watch order_add_mult -------------------------------";
|
neuper@37906
|
68 |
"----------- watch order_add_mult -------------------------------";
|
neuper@37906
|
69 |
"----- with these simple variables it works...";
|
neuper@37906
|
70 |
trace_rewrite:=true;
|
neuper@37906
|
71 |
trace_rewrite:=false;
|
neuper@37906
|
72 |
val t = str2term "((a + d) + c) + b";
|
neuper@37926
|
73 |
val SOME (t,_) = rewrite_set_ thy false order_add_mult t; term2str t;
|
neuper@37906
|
74 |
if term2str t = "a + (b + (c + d))" then ()
|
neuper@37906
|
75 |
else raise error "polyminus.sml 1 watch order_add_mult";
|
neuper@37906
|
76 |
trace_rewrite:=false;
|
neuper@37906
|
77 |
|
neuper@37906
|
78 |
"----- the same stepwise...";
|
neuper@37906
|
79 |
val od = ord_make_polynomial true Poly.thy;
|
neuper@37906
|
80 |
val t = str2term "((a + d) + c) + b";
|
neuper@37906
|
81 |
"((a + d) + c) + b";
|
neuper@37971
|
82 |
val SOME (t,_) = rewrite_ thy od e_rls true add_commute t; term2str t;
|
neuper@37906
|
83 |
"b + ((a + d) + c)";
|
neuper@37971
|
84 |
val SOME (t,_) = rewrite_ thy od e_rls true add_commute t; term2str t;
|
neuper@37906
|
85 |
"b + (c + (a + d))";
|
neuper@37971
|
86 |
val SOME (t,_) = rewrite_ thy od e_rls true add_left_commute t;term2str t;
|
neuper@37906
|
87 |
"b + (a + (c + d))";
|
neuper@37971
|
88 |
val SOME (t,_) = rewrite_ thy od e_rls true add_left_commute t;term2str t;
|
neuper@37906
|
89 |
"a + (b + (c + d))";
|
neuper@37906
|
90 |
if term2str t = "a + (b + (c + d))" then ()
|
neuper@37906
|
91 |
else raise error "polyminus.sml 2 watch order_add_mult";
|
neuper@37906
|
92 |
|
neuper@37906
|
93 |
"----- if parentheses are right, left_commute is (almost) sufficient...";
|
neuper@37906
|
94 |
val t = str2term "a + (d + (c + b))";
|
neuper@37906
|
95 |
"a + (d + (c + b))";
|
neuper@37971
|
96 |
val SOME (t,_) = rewrite_ thy od e_rls true add_left_commute t;term2str t;
|
neuper@37906
|
97 |
"a + (c + (d + b))";
|
neuper@37971
|
98 |
val SOME (t,_) = rewrite_ thy od e_rls true add_commute t;term2str t;
|
neuper@37906
|
99 |
"a + (c + (b + d))";
|
neuper@37971
|
100 |
val SOME (t,_) = rewrite_ thy od e_rls true add_left_commute t;term2str t;
|
neuper@37906
|
101 |
"a + (b + (c + d))";
|
neuper@37906
|
102 |
|
neuper@37906
|
103 |
"----- but we do not want the parentheses at right; thus: cond.rew.";
|
neuper@37906
|
104 |
"WN0712707 complicated monomials do not yet work ...";
|
neuper@37906
|
105 |
val t = str2term "((5*a + 4*d) + 3*c) + 2*b";
|
neuper@37926
|
106 |
val SOME (t,_) = rewrite_set_ thy false order_add_mult t; term2str t;
|
neuper@37906
|
107 |
if term2str t = "2 * b + (3 * c + (4 * d + 5 * a))" then ()
|
neuper@37906
|
108 |
else raise error "polyminus.sml: order_add_mult changed";
|
neuper@37906
|
109 |
|
neuper@37906
|
110 |
"----- here we see rew_sub going into subterm with ord.rew....";
|
neuper@37906
|
111 |
val od = ord_make_polynomial false Poly.thy;
|
neuper@37906
|
112 |
val t = str2term "b + a + c + d";
|
neuper@37971
|
113 |
val SOME (t,_) = rewrite_ thy od e_rls false add_commute t; term2str t;
|
neuper@37971
|
114 |
val SOME (t,_) = rewrite_ thy od e_rls false add_commute t; term2str t;
|
neuper@37906
|
115 |
(*@@@ rew_sub gosub: t = d + (b + a + c)
|
neuper@37906
|
116 |
@@@ rew_sub begin: t = b + a + c*)
|
neuper@37906
|
117 |
|
neuper@37906
|
118 |
|
neuper@37906
|
119 |
"----------- build predicate for +- ordering ---------------------";
|
neuper@37906
|
120 |
"----------- build predicate for +- ordering ---------------------";
|
neuper@37906
|
121 |
"----------- build predicate for +- ordering ---------------------";
|
neuper@37906
|
122 |
"a" < "b";
|
neuper@37906
|
123 |
"ba" < "ab";
|
neuper@37906
|
124 |
"123" < "a"; (*unused due to ---vvv*)
|
neuper@37906
|
125 |
"12" < "3"; (*true !!!*)
|
neuper@37906
|
126 |
|
neuper@37906
|
127 |
" a kleiner b ==> (b + a) = (a + b)";
|
neuper@37906
|
128 |
str2term "aaa";
|
neuper@37906
|
129 |
str2term "222 * aaa";
|
neuper@37906
|
130 |
(*
|
neuper@37906
|
131 |
case eval_kleiner 0 0 (str2term "123 kleiner 32") 0 of
|
neuper@37926
|
132 |
SOME ("12 kleiner 9 = False", _) => ()
|
neuper@37906
|
133 |
| _ => raise error "polyminus.sml: 12 kleiner 9 = False";
|
neuper@37906
|
134 |
*)
|
neuper@37906
|
135 |
case eval_kleiner 0 0 (str2term "a kleiner b") 0 of
|
neuper@37926
|
136 |
SOME ("a kleiner b = True", _) => ()
|
neuper@37906
|
137 |
| _ => raise error "polyminus.sml: a kleiner b = True";
|
neuper@37906
|
138 |
|
neuper@37906
|
139 |
case eval_kleiner 0 0 (str2term "(10*g) kleiner f") 0 of
|
neuper@37926
|
140 |
SOME ("10 * g kleiner f = False", _) => ()
|
neuper@37906
|
141 |
| _ => raise error "polyminus.sml: 10 * g kleiner f = False";
|
neuper@37906
|
142 |
|
neuper@37906
|
143 |
case eval_kleiner 0 0 (str2term "(a^^^2) kleiner b") 0 of
|
neuper@37926
|
144 |
SOME ("a ^^^ 2 kleiner b = True", _) => ()
|
neuper@37906
|
145 |
| _ => raise error "polyminus.sml: a ^^^ 2 kleiner b = True";
|
neuper@37906
|
146 |
|
neuper@37906
|
147 |
case eval_kleiner 0 0 (str2term "(3*a^^^2) kleiner b") 0 of
|
neuper@37926
|
148 |
SOME ("3 * a ^^^ 2 kleiner b = True", _) => ()
|
neuper@37906
|
149 |
| _ => raise error "polyminus.sml: 3 * a ^^^ 2 kleiner b = True";
|
neuper@37906
|
150 |
|
neuper@37906
|
151 |
case eval_kleiner 0 0 (str2term "(a*b) kleiner c") 0 of
|
neuper@37926
|
152 |
SOME ("a * b kleiner c = True", _) => ()
|
neuper@37906
|
153 |
| _ => raise error "polyminus.sml: a * b kleiner b = True";
|
neuper@37906
|
154 |
|
neuper@37906
|
155 |
case eval_kleiner 0 0 (str2term "(3*a*b) kleiner c") 0 of
|
neuper@37926
|
156 |
SOME ("3 * a * b kleiner c = True", _) => ()
|
neuper@37906
|
157 |
| _ => raise error "polyminus.sml: 3 * a * b kleiner b = True";
|
neuper@37906
|
158 |
|
neuper@37906
|
159 |
|
neuper@37906
|
160 |
|
neuper@37906
|
161 |
"----- compare tausche_plus with real_num_collect";
|
neuper@37906
|
162 |
val od = dummy_ord;
|
neuper@37906
|
163 |
|
neuper@37906
|
164 |
val erls = erls_ordne_alphabetisch;
|
neuper@37906
|
165 |
val t = str2term "b + a";
|
neuper@37926
|
166 |
val SOME (t,_) = rewrite_ thy od erls false tausche_plus t; term2str t;
|
neuper@37906
|
167 |
if term2str t = "a + b" then ()
|
neuper@37906
|
168 |
else raise error "polyminus.sml: ordne_alphabetisch1 b + a";
|
neuper@37906
|
169 |
|
neuper@37906
|
170 |
val erls = Atools_erls;
|
neuper@37906
|
171 |
val t = str2term "2*a + 3*a";
|
neuper@37926
|
172 |
val SOME (t,_) = rewrite_ thy od erls false real_num_collect t; term2str t;
|
neuper@37906
|
173 |
|
neuper@37906
|
174 |
"----- test rewrite_, rewrite_set_";
|
neuper@37906
|
175 |
trace_rewrite:=true;
|
neuper@37906
|
176 |
val erls = erls_ordne_alphabetisch;
|
neuper@37906
|
177 |
val t = str2term "b + a";
|
neuper@37926
|
178 |
val SOME (t,_) = rewrite_set_ thy false ordne_alphabetisch t; term2str t;
|
neuper@37906
|
179 |
if term2str t = "a + b" then ()
|
neuper@37906
|
180 |
else raise error "polyminus.sml: ordne_alphabetisch a + b";
|
neuper@37906
|
181 |
|
neuper@37906
|
182 |
val t = str2term "2*b + a";
|
neuper@37926
|
183 |
val SOME (t,_) = rewrite_set_ thy false ordne_alphabetisch t; term2str t;
|
neuper@37906
|
184 |
if term2str t = "a + 2 * b" then ()
|
neuper@37906
|
185 |
else raise error "polyminus.sml: ordne_alphabetisch a + 2 * b";
|
neuper@37906
|
186 |
|
neuper@37906
|
187 |
val t = str2term "a + c + b";
|
neuper@37926
|
188 |
val SOME (t,_) = rewrite_set_ thy false ordne_alphabetisch t; term2str t;
|
neuper@37906
|
189 |
if term2str t = "a + b + c" then ()
|
neuper@37906
|
190 |
else raise error "polyminus.sml: ordne_alphabetisch a + b + c";
|
neuper@37906
|
191 |
|
neuper@37906
|
192 |
"----- rewrite goes into subterms";
|
neuper@37906
|
193 |
val t = str2term "a + c + b + d";
|
neuper@37926
|
194 |
val SOME (t,_) = rewrite_ thy od erls false tausche_plus_plus t; term2str t;
|
neuper@37906
|
195 |
if term2str t = "a + b + c + d" then ()
|
neuper@37906
|
196 |
else raise error "polyminus.sml: ordne_alphabetisch1 a + b + c + d";
|
neuper@37906
|
197 |
|
neuper@37906
|
198 |
val t = str2term "a + c + d + b";
|
neuper@37926
|
199 |
val SOME (t,_) = rewrite_set_ thy false ordne_alphabetisch t; term2str t;
|
neuper@37906
|
200 |
if term2str t = "a + b + c + d" then ()
|
neuper@37906
|
201 |
else raise error "polyminus.sml: ordne_alphabetisch2 a + b + c + d";
|
neuper@37906
|
202 |
|
neuper@37906
|
203 |
"----- here we see rew_sub going into subterm with cond.rew....";
|
neuper@37906
|
204 |
val t = str2term "b + a + c + d";
|
neuper@37926
|
205 |
val SOME (t,_) = rewrite_ thy od erls false tausche_plus t; term2str t;
|
neuper@37906
|
206 |
if term2str t = "a + b + c + d" then ()
|
neuper@37906
|
207 |
else raise error "polyminus.sml: ordne_alphabetisch3 a + b + c + d";
|
neuper@37906
|
208 |
|
neuper@37906
|
209 |
"----- compile rls for the most complicated terms";
|
neuper@37906
|
210 |
val t = str2term "5*e + 6*f - 8*g - 9 - 7*e - 4*f + 10*g + 12";
|
neuper@37906
|
211 |
"5 * e + 6 * f - 8 * g - 9 - 7 * e - 4 * f + 10 * g + 12";
|
neuper@37926
|
212 |
val SOME (t,_) = rewrite_set_ thy false ordne_alphabetisch t;
|
neuper@37906
|
213 |
if term2str t = "- 9 + 12 + 5 * e - 7 * e + 6 * f - 4 * f - 8 * g + 10 * g"
|
neuper@37906
|
214 |
then () else raise error "polyminus.sml: ordne_alphabetisch finished";
|
neuper@37906
|
215 |
|
neuper@37906
|
216 |
|
neuper@37906
|
217 |
"----------- build fasse_zusammen --------------------------------";
|
neuper@37906
|
218 |
"----------- build fasse_zusammen --------------------------------";
|
neuper@37906
|
219 |
"----------- build fasse_zusammen --------------------------------";
|
neuper@37906
|
220 |
val t = str2term "- 9 + 12 + 5 * e - 7 * e + 6 * f - 4 * f - 8 * g + 10 * g";
|
neuper@37926
|
221 |
val SOME (t,_) = rewrite_set_ thy false fasse_zusammen t;
|
neuper@37906
|
222 |
if term2str t = "3 + -2 * e + 2 * f + 2 * g" then ()
|
neuper@37906
|
223 |
else raise error "polyminus.sml: fasse_zusammen finished";
|
neuper@37906
|
224 |
|
neuper@37906
|
225 |
"----------- build verschoenere ----------------------------------";
|
neuper@37906
|
226 |
"----------- build verschoenere ----------------------------------";
|
neuper@37906
|
227 |
"----------- build verschoenere ----------------------------------";
|
neuper@37906
|
228 |
val t = str2term "3 + -2 * e + 2 * f + 2 * g";
|
neuper@37926
|
229 |
val SOME (t,_) = rewrite_set_ thy false verschoenere t;
|
neuper@37906
|
230 |
if term2str t = "3 - 2 * e + 2 * f + 2 * g" then ()
|
neuper@37906
|
231 |
else raise error "polyminus.sml: verschoenere 3 + -2 * e ...";
|
neuper@37906
|
232 |
|
neuper@37906
|
233 |
trace_rewrite:=true;
|
neuper@37906
|
234 |
trace_rewrite:=false;
|
neuper@37906
|
235 |
|
neuper@37906
|
236 |
"----------- met simplification for_polynomials with_minus -------";
|
neuper@37906
|
237 |
"----------- met simplification for_polynomials with_minus -------";
|
neuper@37906
|
238 |
"----------- met simplification for_polynomials with_minus -------";
|
neuper@37906
|
239 |
val str =
|
neuper@37906
|
240 |
"Script SimplifyScript (t_::real) = \
|
neuper@37906
|
241 |
\ (((Try (Rewrite_Set ordne_alphabetisch False)) @@ \
|
neuper@37906
|
242 |
\ (Try (Rewrite_Set fasse_zusammen False)) @@ \
|
neuper@37906
|
243 |
\ (Try (Rewrite_Set verschoenere False))) t_)"
|
neuper@37906
|
244 |
val sc = ((inst_abs thy) o term_of o the o (parse thy)) str;
|
neuper@37906
|
245 |
atomty sc;
|
neuper@37906
|
246 |
|
neuper@37906
|
247 |
|
neuper@37906
|
248 |
"----------- pbl polynom vereinfachen p.33 -----------------------";
|
neuper@37906
|
249 |
"----------- pbl polynom vereinfachen p.33 -----------------------";
|
neuper@37906
|
250 |
"----------- pbl polynom vereinfachen p.33 -----------------------";
|
neuper@37906
|
251 |
"----------- 140 c ---";
|
neuper@37906
|
252 |
states:=[];
|
neuper@37967
|
253 |
CalcTree [(["TERM (5*e + 6*f - 8*g - 9 - 7*e - 4*f + 10*g + 12)",
|
neuper@37906
|
254 |
"normalform N"],
|
neuper@37991
|
255 |
("PolyMinus",["plus_minus","polynom","vereinfachen"],
|
neuper@37906
|
256 |
["simplification","for_polynomials","with_minus"]))];
|
neuper@37906
|
257 |
moveActiveRoot 1;
|
neuper@37906
|
258 |
autoCalculate 1 CompleteCalc;
|
neuper@37906
|
259 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
260 |
if p = ([], Res) andalso
|
neuper@37906
|
261 |
term2str (get_obj g_res pt (fst p)) = "3 - 2 * e + 2 * f + 2 * g"
|
neuper@37906
|
262 |
then () else raise error "polyminus.sml: Vereinfache (3 - 2 * e + 2 * f...";
|
neuper@37906
|
263 |
|
neuper@37906
|
264 |
"----------- 140 d ---";
|
neuper@37906
|
265 |
states:=[];
|
neuper@37967
|
266 |
CalcTree [(["TERM (-r - 2*s - 3*t + 5 + 4*r + 8*s - 5*t - 2)",
|
neuper@37906
|
267 |
"normalform N"],
|
neuper@37991
|
268 |
("PolyMinus",["plus_minus","polynom","vereinfachen"],
|
neuper@37906
|
269 |
["simplification","for_polynomials","with_minus"]))];
|
neuper@37906
|
270 |
moveActiveRoot 1;
|
neuper@37906
|
271 |
autoCalculate 1 CompleteCalc;
|
neuper@37906
|
272 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
273 |
if p = ([], Res) andalso
|
neuper@37906
|
274 |
term2str (get_obj g_res pt (fst p)) = "3 + 3 * r + 6 * s - 8 * t"
|
neuper@37906
|
275 |
then () else raise error "polyminus.sml: Vereinfache 140 d)";
|
neuper@37906
|
276 |
|
neuper@37906
|
277 |
|
neuper@37906
|
278 |
"----------- 139 c ---";
|
neuper@37906
|
279 |
states:=[];
|
neuper@37967
|
280 |
CalcTree [(["TERM (3*e - 6*f - 8*e - 4*f + 5*e + 7*f)",
|
neuper@37906
|
281 |
"normalform N"],
|
neuper@37991
|
282 |
("PolyMinus",["plus_minus","polynom","vereinfachen"],
|
neuper@37906
|
283 |
["simplification","for_polynomials","with_minus"]))];
|
neuper@37906
|
284 |
moveActiveRoot 1;
|
neuper@37906
|
285 |
autoCalculate 1 CompleteCalc;
|
neuper@37906
|
286 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
287 |
if p = ([], Res) andalso
|
neuper@37906
|
288 |
term2str (get_obj g_res pt (fst p)) = "- (3 * f)"
|
neuper@37906
|
289 |
then () else raise error "polyminus.sml: Vereinfache 139 c)";
|
neuper@37906
|
290 |
|
neuper@37906
|
291 |
"----------- 139 b ---";
|
neuper@37906
|
292 |
states:=[];
|
neuper@37967
|
293 |
CalcTree [(["TERM (8*u - 5*v - 5*u + 7*v - 6*u - 3*v)",
|
neuper@37906
|
294 |
"normalform N"],
|
neuper@37991
|
295 |
("PolyMinus",["plus_minus","polynom","vereinfachen"],
|
neuper@37906
|
296 |
["simplification","for_polynomials","with_minus"]))];
|
neuper@37906
|
297 |
moveActiveRoot 1;
|
neuper@37906
|
298 |
autoCalculate 1 CompleteCalc;
|
neuper@37906
|
299 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
300 |
if p = ([], Res) andalso
|
neuper@37906
|
301 |
term2str (get_obj g_res pt (fst p)) = "-3 * u - v"
|
neuper@37906
|
302 |
then () else raise error "polyminus.sml: Vereinfache 139 b)";
|
neuper@37906
|
303 |
|
neuper@37906
|
304 |
"----------- 138 a ---";
|
neuper@37906
|
305 |
states:=[];
|
neuper@37967
|
306 |
CalcTree [(["TERM (2*u - 3*v - 6*u + 5*v)",
|
neuper@37906
|
307 |
"normalform N"],
|
neuper@37991
|
308 |
("PolyMinus",["plus_minus","polynom","vereinfachen"],
|
neuper@37906
|
309 |
["simplification","for_polynomials","with_minus"]))];
|
neuper@37906
|
310 |
moveActiveRoot 1;
|
neuper@37906
|
311 |
autoCalculate 1 CompleteCalc;
|
neuper@37906
|
312 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
313 |
if p = ([], Res) andalso
|
neuper@37906
|
314 |
term2str (get_obj g_res pt (fst p)) = "-4 * u + 2 * v"
|
neuper@37906
|
315 |
then () else raise error "polyminus.sml: Vereinfache 138 a)";
|
neuper@37906
|
316 |
|
neuper@37906
|
317 |
|
neuper@37906
|
318 |
"----------- met probe fuer_polynom ------------------------------";
|
neuper@37906
|
319 |
"----------- met probe fuer_polynom ------------------------------";
|
neuper@37906
|
320 |
"----------- met probe fuer_polynom ------------------------------";
|
neuper@37906
|
321 |
val str =
|
neuper@37982
|
322 |
"Script ProbeScript (e_e::bool) (ws_::bool list) =\
|
neuper@37991
|
323 |
\ (let e_e = Take e_e; \
|
neuper@37981
|
324 |
\ e_e = Substitute ws_ e_e \
|
neuper@37975
|
325 |
\ in (Repeat((Try (Repeat (Calculate TIMES))) @@ \
|
neuper@37975
|
326 |
\ (Try (Repeat (Calculate PLUS ))) @@ \
|
neuper@37981
|
327 |
\ (Try (Repeat (Calculate MINUS))))) e_e)"
|
neuper@37906
|
328 |
val sc = ((inst_abs thy) o term_of o the o (parse thy)) str;
|
neuper@37906
|
329 |
atomty sc;
|
neuper@37906
|
330 |
|
neuper@37906
|
331 |
|
neuper@37906
|
332 |
"----------- pbl polynom probe -----------------------------------";
|
neuper@37906
|
333 |
"----------- pbl polynom probe -----------------------------------";
|
neuper@37906
|
334 |
"----------- pbl polynom probe -----------------------------------";
|
neuper@37906
|
335 |
states:=[];
|
neuper@37906
|
336 |
CalcTree [(["Pruefe (5*e + 6*f - 8*g - 9 - 7*e - 4*f + 10*g + 12 =\
|
neuper@37906
|
337 |
\3 - 2 * e + 2 * f + 2 * g)",
|
neuper@37906
|
338 |
"mitWert [e = 1, f = 2, g = 3]",
|
neuper@37906
|
339 |
"Geprueft b"],
|
neuper@37991
|
340 |
("PolyMinus",["polynom","probe"],
|
neuper@37906
|
341 |
["probe","fuer_polynom"]))];
|
neuper@37906
|
342 |
moveActiveRoot 1;
|
neuper@37906
|
343 |
autoCalculate 1 CompleteCalc;
|
neuper@37906
|
344 |
(* autoCalculate 1 CompleteCalcHead;
|
neuper@37906
|
345 |
autoCalculate 1 (Step 1);
|
neuper@37906
|
346 |
autoCalculate 1 (Step 1);
|
neuper@37906
|
347 |
val ((pt,p),_) = get_calc 1; term2str (get_obj g_res pt (fst p));
|
neuper@37906
|
348 |
@@@@@WN081114 gives "??.empty", all "Pruefe" are the same,
|
neuper@37906
|
349 |
although analogies work in interface.sml: FIXME.WN081114 in "Pruefe"*)
|
neuper@37906
|
350 |
val ((pt,p),_) = get_calc 1;
|
neuper@37906
|
351 |
if p = ([], Res) andalso term2str (get_obj g_res pt (fst p)) = "11 = 11"
|
neuper@37906
|
352 |
then () else raise error "polyminus.sml: Probe 11 = 11";
|
neuper@37906
|
353 |
show_pt pt;
|
neuper@37906
|
354 |
|
neuper@37906
|
355 |
|
neuper@37906
|
356 |
"----------- pbl klammer polynom vereinfachen p.34 ---------------";
|
neuper@37906
|
357 |
"----------- pbl klammer polynom vereinfachen p.34 ---------------";
|
neuper@37906
|
358 |
"----------- pbl klammer polynom vereinfachen p.34 ---------------";
|
neuper@37906
|
359 |
states:=[];
|
neuper@37967
|
360 |
CalcTree [(["TERM (2*u - 5 - (3 - 4*u) + (8*u + 9))",
|
neuper@37906
|
361 |
"normalform N"],
|
neuper@37991
|
362 |
("PolyMinus",["klammer","polynom","vereinfachen"],
|
neuper@37906
|
363 |
["simplification","for_polynomials","with_parentheses"]))];
|
neuper@37906
|
364 |
moveActiveRoot 1;
|
neuper@37906
|
365 |
autoCalculate 1 CompleteCalc;
|
neuper@37906
|
366 |
val ((pt,p),_) = get_calc 1;
|
neuper@37906
|
367 |
if p = ([], Res) andalso
|
neuper@37906
|
368 |
term2str (get_obj g_res pt (fst p)) = "1 + 14 * u"
|
neuper@37906
|
369 |
then () else raise error "polyminus.sml: Vereinfache (2*u - 5 - (3 - ...";
|
neuper@37906
|
370 |
show_pt pt;
|
neuper@37906
|
371 |
|
neuper@37906
|
372 |
"----- probe p.34 -----";
|
neuper@37906
|
373 |
states:=[];
|
neuper@37906
|
374 |
CalcTree [(["Pruefe (2*u - 5 - (3 - 4*u) + (8*u + 9) = 1 + 14 * u)",
|
neuper@37906
|
375 |
"mitWert [u = 2]",
|
neuper@37906
|
376 |
"Geprueft b"],
|
neuper@37991
|
377 |
("PolyMinus",["polynom","probe"],
|
neuper@37906
|
378 |
["probe","fuer_polynom"]))];
|
neuper@37906
|
379 |
moveActiveRoot 1;
|
neuper@37906
|
380 |
autoCalculate 1 CompleteCalc;
|
neuper@37906
|
381 |
val ((pt,p),_) = get_calc 1;
|
neuper@37906
|
382 |
if p = ([], Res) andalso term2str (get_obj g_res pt (fst p)) = "29 = 29"
|
neuper@37906
|
383 |
then () else raise error "polyminus.sml: Probe 29 = 29";
|
neuper@37906
|
384 |
show_pt pt;
|
neuper@37906
|
385 |
|
neuper@37906
|
386 |
|
neuper@37906
|
387 |
"----------- try fun applyTactics --------------------------------";
|
neuper@37906
|
388 |
"----------- try fun applyTactics --------------------------------";
|
neuper@37906
|
389 |
"----------- try fun applyTactics --------------------------------";
|
neuper@37906
|
390 |
states:=[];
|
neuper@37967
|
391 |
CalcTree [(["TERM (5*e + 6*f - 8*g - 9 - 7*e - 4*f + 10*g + 12)",
|
neuper@37906
|
392 |
"normalform N"],
|
neuper@37991
|
393 |
("PolyMinus",["plus_minus","polynom","vereinfachen"],
|
neuper@37906
|
394 |
["simplification","for_polynomials","with_minus"]))];
|
neuper@37906
|
395 |
moveActiveRoot 1;
|
neuper@37906
|
396 |
autoCalculate 1 CompleteCalcHead;
|
neuper@37906
|
397 |
autoCalculate 1 (Step 1);
|
neuper@37906
|
398 |
autoCalculate 1 (Step 1);
|
neuper@37906
|
399 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
400 |
"----- 1 ^^^";
|
neuper@37906
|
401 |
fetchApplicableTactics 1 0 p;
|
neuper@37906
|
402 |
val appltacs = sel_appl_atomic_tacs pt p;
|
neuper@37906
|
403 |
applyTactic 1 p (hd appltacs) (*addiere_x_plus_minus*);
|
neuper@37906
|
404 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
405 |
"----- 2 ^^^";
|
neuper@37906
|
406 |
trace_rewrite := true;
|
neuper@37906
|
407 |
val erls = erls_ordne_alphabetisch;
|
neuper@37906
|
408 |
val t = str2term "- 9 + 12 + 5 * e - 7 * e + (6 - 4) * f - 8 * g + 10 * g";
|
neuper@37926
|
409 |
val SOME (t',_) =
|
neuper@37906
|
410 |
rewrite_ Isac.thy e_rew_ord erls false tausche_minus t;
|
neuper@37906
|
411 |
term2str t'; "- 9 + 12 + 5 * e - 7 * e + (- 4 + 6) * f - 8 * g + 10 * g";
|
neuper@37906
|
412 |
|
neuper@37906
|
413 |
val t = str2term "- 9 + 12 + 5 * e - 7 * e + (6 - 4) * f - 8 * g + 10 * g";
|
neuper@37926
|
414 |
val NONE =
|
neuper@37906
|
415 |
rewrite_ Isac.thy e_rew_ord erls false tausche_minus_plus t;
|
neuper@37906
|
416 |
|
neuper@37906
|
417 |
val t = str2term "- 9 + 12 + 5 * e - 7 * e + (6 - 4) * f - 8 * g + 10 * g";
|
neuper@37926
|
418 |
val SOME (t',_) =
|
neuper@37906
|
419 |
rewrite_set_ Isac.thy false ordne_alphabetisch t;
|
neuper@37906
|
420 |
term2str t'; "- 9 + 12 + 5 * e - 7 * e - 8 * g + 10 * g + (- 4 + 6) * f";
|
neuper@37906
|
421 |
trace_rewrite := false;
|
neuper@37906
|
422 |
|
neuper@37906
|
423 |
|
neuper@37906
|
424 |
applyTactic 1 p (hd (sel_appl_atomic_tacs pt p)) (*tausche_minus*);
|
neuper@37906
|
425 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
426 |
"----- 3 ^^^";
|
neuper@37906
|
427 |
applyTactic 1 p (hd (sel_appl_atomic_tacs pt p)) (**);
|
neuper@37906
|
428 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
429 |
"----- 4 ^^^";
|
neuper@37906
|
430 |
applyTactic 1 p (hd (sel_appl_atomic_tacs pt p)) (**);
|
neuper@37906
|
431 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
432 |
"----- 5 ^^^";
|
neuper@37906
|
433 |
applyTactic 1 p (hd (sel_appl_atomic_tacs pt p)) (**);
|
neuper@37906
|
434 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
435 |
"----- 6 ^^^";
|
neuper@37906
|
436 |
|
neuper@37906
|
437 |
(*<CALCMESSAGE> failure </CALCMESSAGE>
|
neuper@37906
|
438 |
applyTactic 1 p (hd (sel_appl_atomic_tacs pt p)) (**);
|
neuper@37906
|
439 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
440 |
"----- 7 ^^^";
|
neuper@37906
|
441 |
*)
|
neuper@37906
|
442 |
|
neuper@37906
|
443 |
autoCalculate 1 CompleteCalc;
|
neuper@37906
|
444 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
445 |
(*independent from failure above: met_simp_poly_minus not confluent:
|
neuper@37906
|
446 |
(([9], Res), - (8 * g) + 10 * g + (3 - 2 * e + 2 * f)),
|
neuper@37906
|
447 |
(([], Res), - (8 * g) + 10 * g + (3 - 2 * e + 2 * f))]
|
neuper@37906
|
448 |
~~~~~~~~~~~###~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*)
|
neuper@37906
|
449 |
|
neuper@37906
|
450 |
states:=[];
|
neuper@37967
|
451 |
CalcTree [(["TERM (- (8 * g) + 10 * g + h)",
|
neuper@37906
|
452 |
"normalform N"],
|
neuper@37991
|
453 |
("PolyMinus",["plus_minus","polynom","vereinfachen"],
|
neuper@37906
|
454 |
["simplification","for_polynomials","with_minus"]))];
|
neuper@37906
|
455 |
moveActiveRoot 1;
|
neuper@37906
|
456 |
autoCalculate 1 CompleteCalc;
|
neuper@37906
|
457 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
458 |
if p = ([], Res) andalso term2str (get_obj g_res pt (fst p)) = "2 * g + h"
|
neuper@37906
|
459 |
then () else raise error "polyminus.sml: addiere_vor_minus";
|
neuper@37906
|
460 |
|
neuper@37906
|
461 |
|
neuper@37906
|
462 |
states:=[];
|
neuper@37967
|
463 |
CalcTree [(["TERM (- (8 * g) + 10 * g + f)",
|
neuper@37906
|
464 |
"normalform N"],
|
neuper@37991
|
465 |
("PolyMinus",["plus_minus","polynom","vereinfachen"],
|
neuper@37906
|
466 |
["simplification","for_polynomials","with_minus"]))];
|
neuper@37906
|
467 |
moveActiveRoot 1;
|
neuper@37906
|
468 |
autoCalculate 1 CompleteCalc;
|
neuper@37906
|
469 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
470 |
if p = ([], Res) andalso term2str (get_obj g_res pt (fst p)) = "f + 2 * g"
|
neuper@37906
|
471 |
then () else raise error "polyminus.sml: tausche_vor_plus";
|
neuper@37906
|
472 |
|
neuper@37906
|
473 |
|
neuper@37906
|
474 |
"----------- pbl binom polynom vereinfachen p.39 -----------------";
|
neuper@37906
|
475 |
"----------- pbl binom polynom vereinfachen p.39 -----------------";
|
neuper@37906
|
476 |
"----------- pbl binom polynom vereinfachen p.39 -----------------";
|
neuper@37906
|
477 |
val rls = klammern_ausmultiplizieren;
|
neuper@37906
|
478 |
val t = str2term "(3 * a + 2) * (4 * a - 1)";
|
neuper@37926
|
479 |
val SOME (t,_) = rewrite_set_ thy false rls t; term2str t;
|
neuper@37906
|
480 |
"3 * a * (4 * a) - 3 * a * 1 + (2 * (4 * a) - 2 * 1)";
|
neuper@37906
|
481 |
val rls = discard_parentheses;
|
neuper@37926
|
482 |
val SOME (t,_) = rewrite_set_ thy false rls t; term2str t;
|
neuper@37906
|
483 |
"3 * a * 4 * a - 3 * a * 1 + (2 * 4 * a - 2 * 1)";
|
neuper@37906
|
484 |
val rls = ordne_monome;
|
neuper@37926
|
485 |
val SOME (t,_) = rewrite_set_ thy false rls t; term2str t;
|
neuper@37906
|
486 |
"3 * 4 * a * a - 1 * 3 * a + (2 * 4 * a - 1 * 2)";
|
neuper@37906
|
487 |
(*
|
neuper@37906
|
488 |
val t = str2term "3 * a * 4 * a";
|
neuper@37906
|
489 |
val rls = ordne_monome;
|
neuper@37926
|
490 |
val SOME (t,_) = rewrite_set_ thy false rls t; term2str t;
|
neuper@37906
|
491 |
*)
|
neuper@37906
|
492 |
val rls = klammern_aufloesen;
|
neuper@37926
|
493 |
val SOME (t,_) = rewrite_set_ thy false rls t; term2str t;
|
neuper@37906
|
494 |
"3 * 4 * a * a - 1 * 3 * a + 2 * 4 * a - 1 * 2";
|
neuper@37906
|
495 |
val rls = ordne_alphabetisch;
|
neuper@37906
|
496 |
(*TODO: make is_monom more general, a*a=a^2, ...*)
|
neuper@37926
|
497 |
val SOME (t,_) = rewrite_set_ thy false rls t; term2str t;
|
neuper@37906
|
498 |
"3 * 4 * a * a - 1 * 2 - 1 * 3 * a + 2 * 4 * a";
|
neuper@37906
|
499 |
(*GOON.WN080104
|
neuper@37906
|
500 |
val rls = fasse_zusammen;
|
neuper@37926
|
501 |
val SOME (t,_) = rewrite_set_ thy false rls t; term2str t;
|
neuper@37906
|
502 |
val rls = verschoenere;
|
neuper@37926
|
503 |
val SOME (t,_) = rewrite_set_ thy false rls t; term2str t;
|
neuper@37906
|
504 |
*)
|
neuper@37906
|
505 |
|
neuper@37906
|
506 |
|
neuper@37906
|
507 |
trace_rewrite := true;
|
neuper@37906
|
508 |
trace_rewrite := false;
|
neuper@37906
|
509 |
|
neuper@37906
|
510 |
(*@@@@@@@*)
|
neuper@37906
|
511 |
states:=[];
|
neuper@37967
|
512 |
CalcTree [(["TERM ((3*a + 2) * (4*a - 1))",
|
neuper@37906
|
513 |
"normalform N"],
|
neuper@37991
|
514 |
("PolyMinus",["binom_klammer","polynom","vereinfachen"],
|
neuper@37906
|
515 |
["simplification","for_polynomials","with_parentheses_mult"]))];
|
neuper@37906
|
516 |
moveActiveRoot 1;
|
neuper@37906
|
517 |
autoCalculate 1 CompleteCalc;
|
neuper@37906
|
518 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
519 |
|
neuper@37906
|
520 |
(*
|
neuper@37906
|
521 |
if p = ([], Res) andalso
|
neuper@37906
|
522 |
term2str (get_obj g_res pt (fst p)) = "1 + 14 * u"
|
neuper@37906
|
523 |
then () else raise error "polyminus.sml: Vereinfache (2*u - 5 - (3 - ...";
|
neuper@37906
|
524 |
*)
|
neuper@37906
|
525 |
|
neuper@37906
|
526 |
|
neuper@37906
|
527 |
"----------- pbl binom polynom vereinfachen: cube ----------------";
|
neuper@37906
|
528 |
"----------- pbl binom polynom vereinfachen: cube ----------------";
|
neuper@37906
|
529 |
"----------- pbl binom polynom vereinfachen: cube ----------------";
|
neuper@37906
|
530 |
states:=[];
|
neuper@37967
|
531 |
CalcTree [(["TERM (8*(a - q) + a - 2*q + 3*(a - 2*q))",
|
neuper@37906
|
532 |
"normalform N"],
|
neuper@37991
|
533 |
("PolyMinus",["binom_klammer","polynom","vereinfachen"],
|
neuper@37906
|
534 |
["simplification","for_polynomials","with_parentheses_mult"]))];
|
neuper@37906
|
535 |
moveActiveRoot 1;
|
neuper@37906
|
536 |
autoCalculate 1 CompleteCalc;
|
neuper@37906
|
537 |
val ((pt,p),_) = get_calc 1; show_pt pt;
|
neuper@37906
|
538 |
|
neuper@37906
|
539 |
|
neuper@37906
|
540 |
"----------- refine Vereinfache ----------------------------------";
|
neuper@37906
|
541 |
"----------- refine Vereinfache ----------------------------------";
|
neuper@37906
|
542 |
"----------- refine Vereinfache ----------------------------------";
|
neuper@37967
|
543 |
val fmz = ["TERM (8*(a - q) + a - 2*q + 3*(a - 2*q))",
|
neuper@37906
|
544 |
"normalform N"];
|
neuper@37906
|
545 |
print_depth 11;
|
neuper@37906
|
546 |
val matches = refine fmz ["vereinfachen"];
|
neuper@37906
|
547 |
print_depth 3;
|
neuper@37906
|
548 |
|
neuper@37906
|
549 |
"----- go into details, if it seems not to work -----";
|
neuper@37906
|
550 |
"--- does the predicate evaluate correctly ?";
|
neuper@37906
|
551 |
val t = str2term
|
neuper@37906
|
552 |
"matchsub (?a * (?b - ?c)) (8 * (a - q) + a - 2 * q + \
|
neuper@37906
|
553 |
\3 * (a - 2 * q))";
|
neuper@37906
|
554 |
val ma = eval_matchsub "" "Tools.matchsub" t thy;
|
neuper@37906
|
555 |
case ma of
|
neuper@37926
|
556 |
SOME ("matchsub (?a * (?b - ?c)) (8 * (a - q) + \
|
neuper@37906
|
557 |
\a - 2 * q + 3 * (a - 2 * q)) = True", _) => ()
|
neuper@37906
|
558 |
| _ => raise error "polyminus.sml matchsub (?a * (?b - ?c)...A";
|
neuper@37906
|
559 |
|
neuper@37906
|
560 |
"--- does the respective prls rewrite ?";
|
neuper@37906
|
561 |
val prls = append_rls "prls_pbl_vereinf_poly" e_rls
|
neuper@37906
|
562 |
[Calc ("Poly.is'_polyexp", eval_is_polyexp ""),
|
neuper@37906
|
563 |
Calc ("Tools.matchsub", eval_matchsub ""),
|
neuper@37906
|
564 |
Thm ("or_true",or_true),
|
neuper@37906
|
565 |
(*"(?a | True) = True"*)
|
neuper@37906
|
566 |
Thm ("or_false",or_false),
|
neuper@37906
|
567 |
(*"(?a | False) = ?a"*)
|
neuper@37970
|
568 |
Thm ("not_true",num_str @{thm not_true}),
|
neuper@37906
|
569 |
(*"(~ True) = False"*)
|
neuper@37970
|
570 |
Thm ("not_false",num_str @{thm not_false})
|
neuper@37906
|
571 |
(*"(~ False) = True"*)];
|
neuper@37906
|
572 |
trace_rewrite := true;
|
neuper@37926
|
573 |
val SOME (t', _) = rewrite_set_ thy false prls t;
|
neuper@37906
|
574 |
trace_rewrite := false;
|
neuper@37906
|
575 |
|
neuper@37906
|
576 |
"--- does the respective prls rewrite the whole predicate ?";
|
neuper@37906
|
577 |
val t = str2term
|
neuper@37906
|
578 |
"Not (matchsub (?a * (?b + ?c)) (8 * (a - q) + a - 2 * q) | \
|
neuper@37906
|
579 |
\ matchsub (?a * (?b - ?c)) (8 * (a - q) + a - 2 * q) | \
|
neuper@37906
|
580 |
\ matchsub ((?b + ?c) * ?a) (8 * (a - q) + a - 2 * q) | \
|
neuper@37906
|
581 |
\ matchsub ((?b - ?c) * ?a) (8 * (a - q) + a - 2 * q) )";
|
neuper@37906
|
582 |
trace_rewrite := true;
|
neuper@37926
|
583 |
val SOME (t', _) = rewrite_set_ thy false prls t;
|
neuper@37906
|
584 |
trace_rewrite := false;
|
neuper@37906
|
585 |
if term2str t' = "False" then ()
|
neuper@37906
|
586 |
else raise error "polyminus.sml Not (matchsub (?a * (?b + ?c)) (8 ...";
|
neuper@37906
|
587 |
|
neuper@37906
|
588 |
|
neuper@37906
|
589 |
|
neuper@37906
|
590 |
|
neuper@37906
|
591 |
|
neuper@37906
|
592 |
|
neuper@37906
|
593 |
|
neuper@37906
|
594 |
|
neuper@37906
|
595 |
(*
|
neuper@37906
|
596 |
use"../smltest/IsacKnowledge/polyminus.sml";
|
neuper@37906
|
597 |
use"polyminus.sml";
|
neuper@37906
|
598 |
*)
|