neuper@42301
|
1 |
(* Title: Build_Inverse_Z_Transform
|
neuper@42279
|
2 |
Author: Jan Rocnik
|
neuper@42279
|
3 |
(c) copyright due to lincense terms.
|
neuper@42279
|
4 |
12345678901234567890123456789012345678901234567890123456789012345678901234567890
|
neuper@42279
|
5 |
10 20 30 40 50 60 70 80
|
neuper@42279
|
6 |
*)
|
neuper@42279
|
7 |
|
jan@42298
|
8 |
theory Build_Inverse_Z_Transform imports Isac
|
neuper@42289
|
9 |
|
neuper@42289
|
10 |
begin
|
neuper@42279
|
11 |
|
jan@42368
|
12 |
text{* We stepwise build \ttfamily Inverse\_Z\_Transform.thy \normalfont as an
|
jan@42368
|
13 |
exercise. Because subsection~\ref{sec:stepcheck} requires
|
jan@42368
|
14 |
\ttfamily Inverse\_Z\_Transform.thy \normalfont as a subtheory of \ttfamily
|
jan@42368
|
15 |
Isac.thy\normalfont, the setup has been changed from \ttfamily theory
|
jan@42368
|
16 |
Inverse\_Z\_Transform imports Isac \normalfont to the above one.
|
jan@42368
|
17 |
\par \noindent
|
jan@42368
|
18 |
\begin{center}
|
jan@42368
|
19 |
\textbf{ATTENTION WITH NAMES OF IDENTIFIERS WHEN GOING INTO INTERNALS}
|
jan@42368
|
20 |
\end{center}
|
jan@42368
|
21 |
Here in this theory there are the internal names twice, for instance we have
|
jan@42368
|
22 |
\ttfamily (Thm.derivation\_name @{thm rule1} =
|
jan@42368
|
23 |
"Build\_Inverse\_Z\_Transform.rule1") = true; \normalfont
|
jan@42368
|
24 |
but actually in us will be \ttfamily Inverse\_Z\_Transform.rule1 \normalfont
|
jan@42368
|
25 |
*}
|
neuper@42279
|
26 |
|
jan@42368
|
27 |
section {*Trials towards the Z-Transform\label{sec:trials}*}
|
jan@42368
|
28 |
|
neuper@42279
|
29 |
ML {*val thy = @{theory Isac};*}
|
neuper@42279
|
30 |
|
jan@42368
|
31 |
subsection {*Notations and Terms*}
|
jan@42368
|
32 |
text{*\noindent Try which notations we are able to use.*}
|
neuper@42279
|
33 |
ML {*
|
jan@42368
|
34 |
@{term "1 < || z ||"};
|
jan@42368
|
35 |
@{term "z / (z - 1)"};
|
jan@42368
|
36 |
@{term "-u -n - 1"};
|
jan@42368
|
37 |
@{term "-u [-n - 1]"}; (*[ ] denotes lists !!!*)
|
jan@42368
|
38 |
@{term "z /(z - 1) = -u [-n - 1]"};Isac
|
jan@42368
|
39 |
@{term "1 < || z || ==> z / (z - 1) = -u [-n - 1]"};
|
jan@42368
|
40 |
term2str @{term "1 < || z || ==> z / (z - 1) = -u [-n - 1]"};
|
neuper@42279
|
41 |
*}
|
jan@42368
|
42 |
text{*\noindent Try which symbols we are able to use and how we generate them.*}
|
neuper@42279
|
43 |
ML {*
|
jan@42368
|
44 |
(*alpha --> "</alpha>" *)
|
jan@42368
|
45 |
@{term "\<alpha> "};
|
jan@42368
|
46 |
@{term "\<delta> "};
|
jan@42368
|
47 |
@{term "\<phi> "};
|
jan@42368
|
48 |
@{term "\<rho> "};
|
jan@42368
|
49 |
term2str @{term "\<rho> "};
|
neuper@42279
|
50 |
*}
|
neuper@42279
|
51 |
|
jan@42368
|
52 |
subsection {*Rules*}
|
jan@42368
|
53 |
(*axiomatization "z / (z - 1) = -u [-n - 1]"
|
jan@42368
|
54 |
Illegal variable name: "z / (z - 1) = -u [-n - 1]" *)
|
jan@42368
|
55 |
(*definition "z / (z - 1) = -u [-n - 1]"
|
jan@42368
|
56 |
Bad head of lhs: existing constant "op /"*)
|
neuper@42279
|
57 |
axiomatization where
|
neuper@42279
|
58 |
rule1: "1 = \<delta>[n]" and
|
neuper@42279
|
59 |
rule2: "|| z || > 1 ==> z / (z - 1) = u [n]" and
|
neuper@42279
|
60 |
rule3: "|| z || < 1 ==> z / (z - 1) = -u [-n - 1]" and
|
neuper@42279
|
61 |
rule4: "|| z || > || \<alpha> || ==> z / (z - \<alpha>) = \<alpha>^^^n * u [n]" and
|
neuper@42279
|
62 |
rule5: "|| z || < || \<alpha> || ==> z / (z - \<alpha>) = -(\<alpha>^^^n) * u [-n - 1]" and
|
neuper@42279
|
63 |
rule6: "|| z || > 1 ==> z/(z - 1)^^^2 = n * u [n]"
|
jan@42368
|
64 |
|
jan@42368
|
65 |
text{*\noindent Check the rules for their correct notation.
|
jan@42368
|
66 |
(See the machine output.)*}
|
neuper@42279
|
67 |
ML {*
|
jan@42368
|
68 |
@{thm rule1};
|
jan@42368
|
69 |
@{thm rule2};
|
jan@42368
|
70 |
@{thm rule3};
|
jan@42368
|
71 |
@{thm rule4};
|
neuper@42279
|
72 |
*}
|
neuper@42279
|
73 |
|
jan@42368
|
74 |
subsection {*Apply Rules*}
|
jan@42368
|
75 |
text{*\noindent We try to apply the rules to a given expression.*}
|
jan@42368
|
76 |
|
neuper@42279
|
77 |
ML {*
|
jan@42368
|
78 |
val inverse_Z = append_rls "inverse_Z" e_rls
|
jan@42368
|
79 |
[ Thm ("rule3",num_str @{thm rule3}),
|
jan@42368
|
80 |
Thm ("rule4",num_str @{thm rule4}),
|
jan@42368
|
81 |
Thm ("rule1",num_str @{thm rule1})
|
jan@42368
|
82 |
];
|
neuper@42279
|
83 |
|
jan@42368
|
84 |
val t = str2term "z / (z - 1) + z / (z - \<alpha>) + 1";
|
jan@42368
|
85 |
val SOME (t', asm) = rewrite_set_ thy true inverse_Z t;
|
jan@42368
|
86 |
term2str t' = "z / (z - ?\<delta> [?n]) + z / (z - \<alpha>) + ?\<delta> [?n]";
|
jan@42368
|
87 |
(*
|
jan@42368
|
88 |
* Attention rule1 is applied before the expression is
|
jan@42368
|
89 |
* checked for rule4 which would be correct!!!
|
jan@42368
|
90 |
*)
|
neuper@42279
|
91 |
*}
|
neuper@42279
|
92 |
|
jan@42368
|
93 |
ML {* val (thy, ro, er) = (@{theory Isac}, tless_true, eval_rls); *}
|
jan@42368
|
94 |
ML {*
|
jan@42368
|
95 |
val SOME (t, asm1) =
|
jan@42368
|
96 |
rewrite_ thy ro er true (num_str @{thm rule3}) t;
|
jan@42368
|
97 |
term2str t = "- ?u [- ?n - 1] + z / (z - \<alpha>) + 1";
|
jan@42368
|
98 |
(*- real *)
|
jan@42368
|
99 |
term2str t;
|
jan@42296
|
100 |
|
jan@42368
|
101 |
val SOME (t, asm2) =
|
jan@42368
|
102 |
rewrite_ thy ro er true (num_str @{thm rule4}) t;
|
jan@42368
|
103 |
term2str t = "- ?u [- ?n - 1] + \<alpha> ^^^ ?n * ?u [?n] + 1";
|
jan@42368
|
104 |
(*- real *)
|
jan@42368
|
105 |
term2str t;
|
jan@42296
|
106 |
|
jan@42368
|
107 |
val SOME (t, asm3) =
|
jan@42368
|
108 |
rewrite_ thy ro er true (num_str @{thm rule1}) t;
|
jan@42368
|
109 |
term2str t = "- ?u [- ?n - 1] + \<alpha> ^^^ ?n * ?u [?n] + ?\<delta> [?n]";
|
jan@42368
|
110 |
(*- real *)
|
jan@42368
|
111 |
term2str t;
|
jan@42368
|
112 |
*}
|
jan@42368
|
113 |
ML {* terms2str (asm1 @ asm2 @ asm3); *}
|
jan@42296
|
114 |
|
jan@42368
|
115 |
section{*Prepare Steps for CTP-based programming Language\label{sec:prepstep}*}
|
jan@42368
|
116 |
text{*
|
jan@42368
|
117 |
\par \noindent The following sections are challanging with the CTP-based
|
jan@42368
|
118 |
possibilities of building the programm. The goal is realized in
|
jan@42368
|
119 |
Section~\ref{spec-meth} and Section~\ref{prog-steps}.
|
jan@42368
|
120 |
\par The reader is advised to jump between the subsequent subsections and
|
jan@42368
|
121 |
the respective steps in Section~\ref{prog-steps}. By comparing
|
jan@42368
|
122 |
Section~\ref{sec:calc:ztrans} the calculation can be comprehended step
|
jan@42368
|
123 |
by step.
|
neuper@42279
|
124 |
*}
|
neuper@42279
|
125 |
|
jan@42368
|
126 |
subsection {*Prepare Expression\label{prep-expr}*}
|
jan@42368
|
127 |
ML {*
|
jan@42368
|
128 |
val ctxt = ProofContext.init_global @{theory Isac};
|
jan@42368
|
129 |
val ctxt = declare_constraints' [@{term "z::real"}] ctxt;
|
jan@42368
|
130 |
|
jan@42368
|
131 |
val SOME fun1 =
|
jan@42368
|
132 |
parseNEW ctxt "X z = 3 / (z - 1/4 + -1/8 * z ^^^ -1)"; term2str fun1;
|
jan@42368
|
133 |
val SOME fun1' =
|
jan@42368
|
134 |
parseNEW ctxt "X z = 3 / (z - 1/4 + -1/8 * (1/z))"; term2str fun1';
|
jan@42368
|
135 |
*}
|
jan@42368
|
136 |
|
jan@42368
|
137 |
subsubsection {*Prepare Numerator and Denominator*}
|
jan@42368
|
138 |
text{*\noindent The partial fraction decomposion is only possible ig we
|
jan@42368
|
139 |
get the bound variable out of the numerator. Therefor we divide
|
jan@42368
|
140 |
the expression by $z$. Follow up the Calculation at
|
jan@42368
|
141 |
Section~\ref{sec:calc:ztrans} line number 02.*}
|
jan@42368
|
142 |
|
neuper@42279
|
143 |
axiomatization where
|
neuper@42279
|
144 |
ruleZY: "(X z = a / b) = (X' z = a / (z * b))"
|
neuper@42279
|
145 |
|
neuper@42279
|
146 |
ML {*
|
jan@42368
|
147 |
val (thy, ro, er) = (@{theory Isac}, tless_true, eval_rls);
|
jan@42368
|
148 |
val SOME (fun2, asm1) =
|
jan@42368
|
149 |
rewrite_ thy ro er true @{thm ruleZY} fun1; term2str fun2;
|
jan@42368
|
150 |
val SOME (fun2', asm1) =
|
jan@42368
|
151 |
rewrite_ thy ro er true @{thm ruleZY} fun1'; term2str fun2';
|
neuper@42279
|
152 |
|
jan@42368
|
153 |
val SOME (fun3,_) =
|
jan@42368
|
154 |
rewrite_set_ @{theory Isac} false norm_Rational fun2;
|
jan@42368
|
155 |
term2str fun3;
|
jan@42368
|
156 |
(*
|
jan@42368
|
157 |
* Fails on x^^^(-1)
|
jan@42368
|
158 |
* We solve this problem by using 1/x as a workaround.
|
jan@42368
|
159 |
*)
|
jan@42368
|
160 |
val SOME (fun3',_) =
|
jan@42368
|
161 |
rewrite_set_ @{theory Isac} false norm_Rational fun2';
|
jan@42368
|
162 |
term2str fun3';
|
jan@42368
|
163 |
(*
|
jan@42368
|
164 |
* OK - workaround!
|
jan@42368
|
165 |
*)
|
neuper@42289
|
166 |
*}
|
neuper@42279
|
167 |
|
jan@42368
|
168 |
subsubsection {*Get the Argument of the Expression X'*}
|
jan@42368
|
169 |
text{*\noindent We use \texttt{grep} for finding possibilities how we can
|
jan@42368
|
170 |
extract the bound variable in the expression. \ttfamily Atools.thy,
|
jan@42368
|
171 |
Tools.thy \normalfont contain general utilities: \ttfamily
|
jan@42368
|
172 |
eval\_argument\_in, eval\_rhs, eval\_lhs,\ldots \normalfont
|
jan@42368
|
173 |
\ttfamily grep -r "fun eva\_" * \normalfont shows all functions
|
jan@42368
|
174 |
witch can be used in a script. Lookup this files how to build
|
jan@42368
|
175 |
and handle such functions.
|
jan@42368
|
176 |
\par The next section shows how to introduce such a function.
|
jan@42298
|
177 |
*}
|
jan@42298
|
178 |
|
jan@42368
|
179 |
subsubsection{*Decompose the Given Term Into lhs and rhs\footnote{Note:
|
jan@42368
|
180 |
lhs means \em Left Hand Side \normalfont and rhs means
|
jan@42368
|
181 |
\em Right Hand Side \normalfont and indicates the left or
|
jan@42368
|
182 |
the right part of an equation.}*}
|
neuper@42302
|
183 |
ML {*
|
neuper@42302
|
184 |
val (_, expr) = HOLogic.dest_eq fun3'; term2str expr;
|
jan@42368
|
185 |
val (_, denom) =
|
jan@42368
|
186 |
HOLogic.dest_bin "Rings.inverse_class.divide" (type_of expr) expr;
|
neuper@42302
|
187 |
term2str denom = "-1 + -2 * z + 8 * z ^^^ 2";
|
neuper@42302
|
188 |
*}
|
jan@42298
|
189 |
|
jan@42368
|
190 |
text{*\noindent We have rhs in the Script language, but we need a function
|
jan@42368
|
191 |
which gets the denominator of a fraction.*}
|
jan@42298
|
192 |
|
jan@42368
|
193 |
subsubsection{*Get the Denominator and Numerator out of a Fraction*}
|
jan@42368
|
194 |
text{*\noindent The selv written functions in e.g. \texttt{get\_denominator}
|
jan@42368
|
195 |
should become a constant for the isabelle parser:*}
|
jan@42298
|
196 |
|
jan@42298
|
197 |
consts
|
jan@42345
|
198 |
get_denominator :: "real => real"
|
jan@42344
|
199 |
get_numerator :: "real => real"
|
jan@42298
|
200 |
|
jan@42368
|
201 |
text {*\noindent With the above definition we run into problems when we parse
|
jan@42368
|
202 |
the Script \texttt{InverseZTransform}. This leads to \em ambiguous
|
jan@42368
|
203 |
parse trees. \normalfont We avoid this by moving the definition
|
jan@42368
|
204 |
to \ttfamily Rational.thy \normalfont and re-building Isac.
|
jan@42368
|
205 |
\par \noindent ATTENTION: From now on \ttfamily
|
jan@42368
|
206 |
Build\_Inverse\_Z\_Transform \normalfont mimics a build from scratch;
|
jan@42368
|
207 |
it only works due to re-building Isac several times (indicated
|
jan@42368
|
208 |
explicityl).
|
neuper@42302
|
209 |
*}
|
jan@42300
|
210 |
|
jan@42298
|
211 |
ML {*
|
jan@42368
|
212 |
(*
|
jan@42368
|
213 |
*("get_denominator",
|
jan@42368
|
214 |
* ("Rational.get_denominator", eval_get_denominator ""))
|
jan@42368
|
215 |
*)
|
jan@42298
|
216 |
fun eval_get_denominator (thmid:string) _
|
neuper@42301
|
217 |
(t as Const ("Rational.get_denominator", _) $
|
jan@42298
|
218 |
(Const ("Rings.inverse_class.divide", _) $ num $
|
jan@42298
|
219 |
denom)) thy =
|
neuper@42302
|
220 |
SOME (mk_thmid thmid ""
|
jan@42368
|
221 |
(Print_Mode.setmp []
|
jan@42368
|
222 |
(Syntax.string_of_term (thy2ctxt thy)) denom) "",
|
jan@42298
|
223 |
Trueprop $ (mk_equality (t, denom)))
|
jan@42300
|
224 |
| eval_get_denominator _ _ _ _ = NONE;
|
jan@42298
|
225 |
*}
|
neuper@42302
|
226 |
text {* tests of eval_get_denominator see test/Knowledge/rational.sml*}
|
neuper@42289
|
227 |
|
jan@42338
|
228 |
text {*get numerator should also become a constant for the isabelle parser: *}
|
jan@42337
|
229 |
|
jan@42337
|
230 |
ML {*
|
jan@42337
|
231 |
fun eval_get_numerator (thmid:string) _
|
jan@42337
|
232 |
(t as Const ("Rational.get_numerator", _) $
|
jan@42338
|
233 |
(Const ("Rings.inverse_class.divide", _) $num
|
jan@42338
|
234 |
$denom )) thy =
|
jan@42337
|
235 |
SOME (mk_thmid thmid ""
|
jan@42338
|
236 |
(Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy)) num) "",
|
jan@42338
|
237 |
Trueprop $ (mk_equality (t, num)))
|
jan@42337
|
238 |
| eval_get_numerator _ _ _ _ = NONE;
|
jan@42337
|
239 |
*}
|
jan@42337
|
240 |
|
jan@42345
|
241 |
text {*
|
jan@42345
|
242 |
We discovered severell problems by implementing the get_numerator function.
|
jan@42345
|
243 |
Remember when putting new functions to Isac, put them in a thy file and rebuild
|
jan@42345
|
244 |
isac, also put them in the ruleset for the script!
|
jan@42345
|
245 |
*}
|
jan@42345
|
246 |
|
neuper@42279
|
247 |
subsection {*solve equation*}
|
neuper@42279
|
248 |
text {*this type of equation if too general for the present program*}
|
neuper@42279
|
249 |
ML {*
|
neuper@42279
|
250 |
"----------- Minisubplb/100-init-rootp (*OK*)bl.sml ---------------------";
|
neuper@42279
|
251 |
val denominator = parseNEW ctxt "z^^^2 - 1/4*z - 1/8 = 0";
|
neuper@42279
|
252 |
val fmz = ["equality (z^^^2 - 1/4*z - 1/8 = (0::real))", "solveFor z","solutions L"];
|
neuper@42279
|
253 |
val (dI',pI',mI') =("Isac", ["univariate","equation"], ["no_met"]);
|
neuper@42279
|
254 |
(* ^^^^^^^^^^^^^^^^^^^^^^ TODO: ISAC determines type of eq*)
|
neuper@42279
|
255 |
*}
|
neuper@42279
|
256 |
text {*Does the Equation Match the Specification ?*}
|
neuper@42279
|
257 |
ML {*
|
neuper@42279
|
258 |
match_pbl fmz (get_pbt ["univariate","equation"]);
|
neuper@42279
|
259 |
*}
|
neuper@42279
|
260 |
ML {*Context.theory_name thy = "Isac"(*==================================================*)*}
|
neuper@42279
|
261 |
|
neuper@42279
|
262 |
ML {*
|
neuper@42303
|
263 |
val denominator = parseNEW ctxt "-1 + -2 * z + 8 * z ^^^ 2 = 0";
|
neuper@42279
|
264 |
val fmz = (*specification*)
|
neuper@42303
|
265 |
["equality (-1 + -2 * z + 8 * z ^^^ 2 = (0::real))", (*equality*)
|
neuper@42279
|
266 |
"solveFor z", (*bound variable*)
|
neuper@42279
|
267 |
"solutions L"]; (*identifier for solution*)
|
jan@42300
|
268 |
|
neuper@42279
|
269 |
val (dI',pI',mI') =
|
neuper@42303
|
270 |
("Isac", ["abcFormula","degree_2","polynomial","univariate","equation"], ["no_met"]);
|
neuper@42279
|
271 |
*}
|
neuper@42279
|
272 |
text {*Does the Other Equation Match the Specification ?*}
|
neuper@42279
|
273 |
ML {*
|
neuper@42303
|
274 |
match_pbl fmz (get_pbt ["abcFormula","degree_2","polynomial","univariate","equation"]);
|
neuper@42279
|
275 |
*}
|
neuper@42279
|
276 |
text {*Solve Equation Stepwise*}
|
neuper@42279
|
277 |
ML {*
|
neuper@42303
|
278 |
*}
|
neuper@42303
|
279 |
ML {*
|
neuper@42279
|
280 |
val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
|
neuper@42279
|
281 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
282 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
283 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
284 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
285 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
286 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
287 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
288 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
289 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
290 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
291 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
292 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt =..,Check_elementwise "Assumptions")*)
|
neuper@42279
|
293 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
294 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; f2str f;
|
neuper@42303
|
295 |
(*[z = 1 / 2, z = -1 / 4]*)
|
neuper@42279
|
296 |
show_pt pt;
|
neuper@42279
|
297 |
val SOME f = parseNEW ctxt "[z=1/2, z=-1/4]";
|
neuper@42279
|
298 |
*}
|
neuper@42279
|
299 |
|
neuper@42279
|
300 |
subsection {*partial fraction decomposition*}
|
neuper@42279
|
301 |
subsubsection {*solution of the equation*}
|
neuper@42279
|
302 |
ML {*
|
neuper@42279
|
303 |
val SOME solutions = parseNEW ctxt "[z=1/2, z=-1/4]";
|
neuper@42279
|
304 |
term2str solutions;
|
neuper@42279
|
305 |
atomty solutions;
|
neuper@42279
|
306 |
*}
|
neuper@42279
|
307 |
|
neuper@42279
|
308 |
subsubsection {*get solutions out of list*}
|
neuper@42279
|
309 |
text {*in isac's CTP-based programming language: let$ $s_1 = NTH 1$ solutions; $s_2 = NTH 2...$*}
|
neuper@42279
|
310 |
ML {*
|
neuper@42279
|
311 |
val Const ("List.list.Cons", _) $ s_1 $ (Const ("List.list.Cons", _) $
|
neuper@42279
|
312 |
s_2 $ Const ("List.list.Nil", _)) = solutions;
|
neuper@42279
|
313 |
term2str s_1;
|
neuper@42279
|
314 |
term2str s_2;
|
neuper@42279
|
315 |
*}
|
neuper@42279
|
316 |
|
neuper@42279
|
317 |
ML {* (*Solutions as Denominator --> Denominator1 = z - Zeropoint1, Denominator2 = z-Zeropoint2,...*)
|
neuper@42279
|
318 |
val xx = HOLogic.dest_eq s_1;
|
neuper@42279
|
319 |
val s_1' = HOLogic.mk_binop "Groups.minus_class.minus" xx;
|
neuper@42279
|
320 |
val xx = HOLogic.dest_eq s_2;
|
neuper@42279
|
321 |
val s_2' = HOLogic.mk_binop "Groups.minus_class.minus" xx;
|
neuper@42279
|
322 |
term2str s_1';
|
neuper@42279
|
323 |
term2str s_2';
|
neuper@42279
|
324 |
*}
|
neuper@42335
|
325 |
text {* for the programming language a function
|
neuper@42335
|
326 |
collecting all the above manipulations is helpful*}
|
neuper@42335
|
327 |
ML {*
|
neuper@42335
|
328 |
fun mk_minus_1 T = Free("-1", T); (*TODO DELETE WITH numbers_to_string*)
|
neuper@42335
|
329 |
fun flip_sign t = (*TODO improve for use in factors_from_solution: -(-1) etc*)
|
neuper@42335
|
330 |
let val minus_1 = t |> type_of |> mk_minus_1
|
neuper@42335
|
331 |
in HOLogic.mk_binop "Groups.times_class.times" (minus_1, t) end;
|
neuper@42335
|
332 |
fun fac_from_sol s =
|
neuper@42335
|
333 |
let val (lhs, rhs) = HOLogic.dest_eq s
|
jan@42367
|
334 |
in HOLogic.mk_binop "Groups.minus_class.minus" (lhs, rhs) end;
|
neuper@42335
|
335 |
*}
|
neuper@42335
|
336 |
ML {*
|
neuper@42335
|
337 |
e_term
|
neuper@42335
|
338 |
*}
|
neuper@42335
|
339 |
ML {*
|
neuper@42335
|
340 |
fun mk_prod prod [] =
|
neuper@42335
|
341 |
if prod = e_term then error "mk_prod called with []" else prod
|
neuper@42335
|
342 |
| mk_prod prod (t :: []) =
|
neuper@42335
|
343 |
if prod = e_term then t else HOLogic.mk_binop "Groups.times_class.times" (prod, t)
|
neuper@42335
|
344 |
| mk_prod prod (t1 :: t2 :: ts) =
|
neuper@42335
|
345 |
if prod = e_term
|
neuper@42335
|
346 |
then
|
neuper@42335
|
347 |
let val p = HOLogic.mk_binop "Groups.times_class.times" (t1, t2)
|
neuper@42335
|
348 |
in mk_prod p ts end
|
neuper@42335
|
349 |
else
|
neuper@42335
|
350 |
let val p = HOLogic.mk_binop "Groups.times_class.times" (prod, t1)
|
neuper@42335
|
351 |
in mk_prod p (t2 :: ts) end
|
neuper@42335
|
352 |
*}
|
neuper@42335
|
353 |
ML {*
|
neuper@42335
|
354 |
*}
|
neuper@42335
|
355 |
ML {*
|
neuper@42335
|
356 |
(*probably keept these test in test/Tools/isac/...
|
neuper@42335
|
357 |
(*mk_prod e_term [];*)
|
neuper@42335
|
358 |
|
neuper@42335
|
359 |
val prod = mk_prod e_term [str2term "x + 123"];
|
neuper@42335
|
360 |
term2str prod = "x + 123";
|
neuper@42335
|
361 |
|
neuper@42335
|
362 |
val sol = str2term "[z = 1 / 2, z = -1 / 4]";
|
neuper@42335
|
363 |
val sols = HOLogic.dest_list sol;
|
neuper@42335
|
364 |
val facs = map fac_from_sol sols;
|
neuper@42335
|
365 |
val prod = mk_prod e_term facs;
|
neuper@42335
|
366 |
term2str prod = "(z + -1 * (1 / 2)) * (z + -1 * (-1 / 4))";
|
neuper@42335
|
367 |
|
neuper@42335
|
368 |
val prod = mk_prod e_term [str2term "x + 1", str2term "x + 2", str2term "x + 3"];
|
neuper@42335
|
369 |
term2str prod = "(x + 1) * (x + 2) * (x + 3)";
|
neuper@42335
|
370 |
*)
|
neuper@42335
|
371 |
|
neuper@42335
|
372 |
fun factors_from_solution sol =
|
neuper@42335
|
373 |
let val ts = HOLogic.dest_list sol
|
neuper@42335
|
374 |
in mk_prod e_term (map fac_from_sol ts) end;
|
neuper@42335
|
375 |
(*
|
neuper@42335
|
376 |
val sol = str2term "[z = 1 / 2, z = -1 / 4]";
|
neuper@42335
|
377 |
val fs = factors_from_solution sol;
|
neuper@42335
|
378 |
term2str fs = "(z + -1 * (1 / 2)) * (z + -1 * (-1 / 4))"
|
neuper@42335
|
379 |
*)
|
neuper@42335
|
380 |
*}
|
neuper@42335
|
381 |
text {* This function needs to be packed such that it can be evaluated by the Lucas-Interpreter:
|
neuper@42335
|
382 |
# shift these functions into the related Equation.thy
|
neuper@42335
|
383 |
# -- compare steps done with get_denominator above
|
jan@42344
|
384 |
# done 02.12.2011 moved to PartialFractions.thy
|
neuper@42335
|
385 |
*}
|
neuper@42335
|
386 |
ML {*
|
jan@42352
|
387 |
(*("factors_from_solution", ("Partial_Fractions.factors_from_solution", eval_factors_from_solution ""))*)
|
jan@42352
|
388 |
fun eval_factors_from_solution (thmid:string) _
|
jan@42352
|
389 |
(t as Const ("Partial_Fractions.factors_from_solution", _) $ sol) thy =
|
jan@42352
|
390 |
((let val prod = factors_from_solution sol
|
jan@42352
|
391 |
in SOME (mk_thmid thmid ""
|
jan@42352
|
392 |
(Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy)) prod) "",
|
jan@42352
|
393 |
Trueprop $ (mk_equality (t, prod)))
|
jan@42352
|
394 |
end)
|
jan@42352
|
395 |
handle _ => NONE)
|
jan@42352
|
396 |
| eval_factors_from_solution _ _ _ _ = NONE;
|
jan@42352
|
397 |
*}
|
jan@42352
|
398 |
|
jan@42352
|
399 |
text {*
|
jan@42352
|
400 |
The tracing output of the calc tree after apllying this function was
|
jan@42352
|
401 |
24 / factors_from_solution [z = 1/ 2, z = -1 / 4])] and the next step
|
jan@42352
|
402 |
val nxt = ("Empty_Tac", ...): tac'_).
|
jan@42352
|
403 |
These observations indicate, that the Lucas-Interpreter (LIP) does
|
jan@42352
|
404 |
not know how to evaluate factors_from_solution, so there is something
|
jan@42352
|
405 |
wrong or missing.
|
jan@42352
|
406 |
|
jan@42352
|
407 |
# First we isolate the difficulty in the program as follows:
|
jan@42352
|
408 |
:
|
jan@42352
|
409 |
" (L_L::bool list) = (SubProblem (PolyEq'," ^
|
jan@42352
|
410 |
" [abcFormula,degree_2,polynomial,univariate,equation],[no_met])" ^
|
jan@42352
|
411 |
" [BOOL equ, REAL zzz]); " ^
|
jan@42352
|
412 |
" (facs::real) = factors_from_solution L_L;" ^
|
jan@42352
|
413 |
" (foo::real) = Take facs" ^
|
jan@42352
|
414 |
:
|
jan@42352
|
415 |
and see
|
jan@42352
|
416 |
[
|
jan@42352
|
417 |
(([], Frm), Problem (Isac, [inverse, Z_Transform, SignalProcessing])),
|
jan@42352
|
418 |
(([1], Frm), X z = 3 / (z - 1 / 4 + -1 / 8 * (1 / z))),
|
jan@42352
|
419 |
(([1], Res), ?X' z = 3 / (z * (z - 1 / 4 + -1 / 8 * (1 / z)))),
|
jan@42352
|
420 |
(([2], Res), ?X' z = 24 / (-1 + -2 * z + 8 * z ^^^ 2)),
|
jan@42352
|
421 |
(([3], Pbl), solve (-1 + -2 * z + 8 * z ^^^ 2 = 0, z)),
|
jan@42352
|
422 |
(([3,1], Frm), -1 + -2 * z + 8 * z ^^^ 2 = 0),
|
jan@42352
|
423 |
(([3,1], Res), z = (- -2 + sqrt (-2 ^^^ 2 - 4 * 8 * -1)) / (2 * 8) |
|
jan@42352
|
424 |
z = (- -2 - sqrt (-2 ^^^ 2 - 4 * 8 * -1)) / (2 * 8)),
|
jan@42352
|
425 |
(([3,2], Res), z = 1 / 2 | z = -1 / 4),
|
jan@42352
|
426 |
(([3,3], Res), [z = 1 / 2, z = -1 / 4]),
|
jan@42352
|
427 |
(([3,4], Res), [z = 1 / 2, z = -1 / 4]),
|
jan@42352
|
428 |
(([3], Res), [z = 1 / 2, z = -1 / 4]),
|
jan@42352
|
429 |
(([4], Frm), factors_from_solution [z = 1 / 2, z = -1 / 4])]
|
jan@42352
|
430 |
in particular that
|
jan@42352
|
431 |
(([3], Pbl), solve (-1 + -2 * z + 8 * z ^^^ 2 = 0, z)),
|
jan@42352
|
432 |
shows the equation which has been created in the program by
|
jan@42352
|
433 |
" (denom::real) = get_denominator funterm;" ^ (*get_denominator*)
|
jan@42352
|
434 |
" (equ::bool) = (denom = (0::real));" ^
|
jan@42352
|
435 |
# 'get_denominator' has been evaluated successfully, but not factors_from_solution.
|
jan@42352
|
436 |
So we stepwise compare with an analogous case, get_denominator
|
jan@42352
|
437 |
successfully done above: We know that LIP evaluates expressions in the
|
jan@42352
|
438 |
program by use of the "srls", so we
|
jan@42352
|
439 |
# try to get the original srls
|
jan@42352
|
440 |
|
jan@42352
|
441 |
val {srls, ...} = get_met ["SignalProcessing","Z_Transform","inverse"];
|
jan@42352
|
442 |
|
jan@42352
|
443 |
# create 2 good example terms
|
jan@42352
|
444 |
val SOME t1 = parseNEW ctxt "get_denominator ((111::real) / 222)";
|
jan@42352
|
445 |
val SOME t2 = parseNEW ctxt "factors_from_solution [(z::real) = 1 / 2, z = -1 / 4]";
|
jan@42352
|
446 |
|
jan@42352
|
447 |
# rewrite the terms using srls
|
jan@42352
|
448 |
rewrite_set_ thy true srls t1;
|
jan@42352
|
449 |
rewrite_set_ thy true srls t2;
|
jan@42352
|
450 |
|
jan@42352
|
451 |
and we see a difference: t1 gives SOME, t2 gives NONE.
|
jan@42352
|
452 |
Now we look at the srls:
|
jan@42352
|
453 |
val srls = Rls {id="srls_InverseZTransform",
|
jan@42352
|
454 |
:
|
jan@42352
|
455 |
rules =
|
jan@42352
|
456 |
[
|
jan@42352
|
457 |
:
|
jan@42352
|
458 |
Calc("Rational.get_numerator",
|
jan@42352
|
459 |
eval_get_numerator "Rational.get_numerator"),
|
jan@42352
|
460 |
Calc("Partial_Fractions.factors_from_solution",
|
jan@42352
|
461 |
eval_factors_from_solution "Partial_Fractions.factors_from_solution")
|
jan@42352
|
462 |
],
|
jan@42352
|
463 |
:
|
jan@42352
|
464 |
|
jan@42352
|
465 |
Here everthing is perfect. So the error can only be in the SML code of eval_factors_from_solution.
|
jan@42352
|
466 |
We try to check the code with an existing test; since the code is in
|
jan@42352
|
467 |
|
jan@42352
|
468 |
src/Tools/isac/Knowledge/Partial_Fractions.thy
|
jan@42352
|
469 |
|
jan@42352
|
470 |
the test should be in
|
jan@42352
|
471 |
|
jan@42352
|
472 |
test/Tools/isac/Knowledge/partial_fractions.sml
|
jan@42352
|
473 |
|
jan@42352
|
474 |
-------------------------------------------------------------------------------
|
jan@42352
|
475 |
After updating the function get_factors_from solution to a new version and
|
jan@42352
|
476 |
putting a testcase to Partial_Fractions.sml we tried again to evaluate the
|
jan@42352
|
477 |
term with the same result.
|
jan@42352
|
478 |
We opened the test Test_Isac.thy and saw that everything is working fine.
|
jan@42352
|
479 |
Also we checked that the test partial_fractions.sml is used in Test_Isac.thy
|
jan@42352
|
480 |
|
jan@42352
|
481 |
--> use "Knowledge/partial_fractions.sml"
|
jan@42352
|
482 |
|
jan@42352
|
483 |
and Partial_Fractions.thy is part is part of isac by evaluating
|
jan@42352
|
484 |
|
jan@42352
|
485 |
val thy = @{theory Isac};
|
jan@42352
|
486 |
|
jan@42353
|
487 |
after rebuilding isac again it worked
|
jan@42353
|
488 |
|
neuper@42335
|
489 |
*}
|
neuper@42279
|
490 |
|
neuper@42279
|
491 |
subsubsection {*build expression*}
|
neuper@42279
|
492 |
text {*in isac's CTP-based programming language: let s_1 = Take numerator / (s_1 * s_2)*}
|
neuper@42279
|
493 |
ML {*
|
neuper@42279
|
494 |
(*The Main Denominator is the multiplikation of the partial fraction denominators*)
|
neuper@42279
|
495 |
val denominator' = HOLogic.mk_binop "Groups.times_class.times" (s_1', s_2') ;
|
neuper@42279
|
496 |
val SOME numerator = parseNEW ctxt "3::real";
|
neuper@42279
|
497 |
|
neuper@42279
|
498 |
val expr' = HOLogic.mk_binop "Rings.inverse_class.divide" (numerator, denominator');
|
neuper@42279
|
499 |
term2str expr';
|
neuper@42279
|
500 |
*}
|
neuper@42279
|
501 |
|
neuper@42279
|
502 |
subsubsection {*Ansatz - create partial fractions out of our expression*}
|
neuper@42302
|
503 |
ML {*Context.theory_name thy = "Isac"*}
|
neuper@42279
|
504 |
|
neuper@42279
|
505 |
axiomatization where
|
neuper@42279
|
506 |
ansatz2: "n / (a*b) = A/a + B/(b::real)" and
|
jan@42344
|
507 |
multiply_eq2: "((n::real) / (a*b) = A/a + B/b) = (a*b*(n / (a*b)) = a*b*(A/a + B/b::real))"
|
neuper@42279
|
508 |
|
neuper@42279
|
509 |
ML {*
|
neuper@42279
|
510 |
(*we use our ansatz2 to rewrite our expression and get an equilation with our expression on the left and the partial fractions of it on the right side*)
|
neuper@42279
|
511 |
val SOME (t1,_) = rewrite_ @{theory Isac} e_rew_ord e_rls false @{thm ansatz2} expr';
|
neuper@42279
|
512 |
term2str t1; atomty t1;
|
neuper@42279
|
513 |
val eq1 = HOLogic.mk_eq (expr', t1);
|
neuper@42279
|
514 |
term2str eq1;
|
neuper@42279
|
515 |
*}
|
neuper@42279
|
516 |
ML {*
|
neuper@42279
|
517 |
(*eliminate the demoninators by multiplying the left and the right side with the main denominator*)
|
neuper@42279
|
518 |
val SOME (eq2,_) = rewrite_ @{theory Isac} e_rew_ord e_rls false @{thm multiply_eq2} eq1;
|
neuper@42279
|
519 |
term2str eq2;
|
neuper@42279
|
520 |
*}
|
neuper@42279
|
521 |
ML {*
|
neuper@42279
|
522 |
(*simplificatoin*)
|
neuper@42279
|
523 |
val SOME (eq3,_) = rewrite_set_ @{theory Isac} false norm_Rational eq2;
|
neuper@42279
|
524 |
term2str eq3; (*?A ?B not simplified*)
|
neuper@42279
|
525 |
*}
|
neuper@42279
|
526 |
ML {*
|
neuper@42279
|
527 |
val SOME fract1 =
|
neuper@42279
|
528 |
parseNEW ctxt "(z - 1 / 2) * (z - -1 / 4) * (A / (z - 1 / 2) + B / (z - -1 / 4))"; (*A B !*)
|
neuper@42279
|
529 |
val SOME (fract2,_) = rewrite_set_ @{theory Isac} false norm_Rational fract1;
|
neuper@42279
|
530 |
term2str fract2 = "(A + -2 * B + 4 * A * z + 4 * B * z) / 4";
|
neuper@42279
|
531 |
(*term2str fract2 = "A * (1 / 4 + z) + B * (-1 / 2 + z)" would be more traditional*)
|
neuper@42279
|
532 |
*}
|
neuper@42279
|
533 |
ML {*
|
neuper@42279
|
534 |
val (numerator, denominator) = HOLogic.dest_eq eq3;
|
neuper@42279
|
535 |
val eq3' = HOLogic.mk_eq (numerator, fract1); (*A B !*)
|
neuper@42279
|
536 |
term2str eq3';
|
neuper@42279
|
537 |
(*MANDATORY: simplify (and remove denominator) otherwise 3 = 0*)
|
neuper@42279
|
538 |
val SOME (eq3'' ,_) = rewrite_set_ @{theory Isac} false norm_Rational eq3';
|
neuper@42279
|
539 |
term2str eq3'';
|
neuper@42279
|
540 |
*}
|
neuper@42279
|
541 |
ML {*Context.theory_name thy = "Isac"(*==================================================*)*}
|
neuper@42279
|
542 |
|
neuper@42342
|
543 |
subsubsection {*Build a rule-set for ansatz*}
|
neuper@42359
|
544 |
text {* the "ansatz" rules violate the principle that each variable on
|
neuper@42359
|
545 |
the right-hand-side must also occur on the left-hand-side of the rule:
|
neuper@42359
|
546 |
A, B, etc don't.
|
neuper@42359
|
547 |
Thus the rewriter marks these variables with question marks: ?A, ?B, etc.
|
neuper@42360
|
548 |
These question marks can be dropped by "fun drop_questionmarks".
|
neuper@42359
|
549 |
*}
|
neuper@42342
|
550 |
ML {*
|
neuper@42342
|
551 |
val ansatz_rls = prep_rls(
|
neuper@42342
|
552 |
Rls {id = "ansatz_rls", preconds = [], rew_ord = ("dummy_ord",dummy_ord),
|
neuper@42342
|
553 |
erls = e_rls, srls = Erls, calc = [],
|
neuper@42342
|
554 |
rules =
|
neuper@42342
|
555 |
[Thm ("ansatz2",num_str @{thm ansatz2}),
|
neuper@42342
|
556 |
Thm ("multiply_eq2",num_str @{thm multiply_eq2})
|
neuper@42342
|
557 |
],
|
neuper@42342
|
558 |
scr = EmptyScr});
|
neuper@42342
|
559 |
*}
|
neuper@42342
|
560 |
ML {*
|
neuper@42342
|
561 |
val SOME (ttttt,_) = rewrite_set_ @{theory Isac} false ansatz_rls expr';
|
neuper@42359
|
562 |
*}
|
neuper@42359
|
563 |
ML {*
|
neuper@42359
|
564 |
term2str expr' = "3 / ((z - 1 / 2) * (z - -1 / 4))";
|
neuper@42359
|
565 |
term2str ttttt = "?A / (z - 1 / 2) + ?B / (z - -1 / 4)";
|
neuper@42342
|
566 |
*}
|
neuper@42342
|
567 |
|
neuper@42342
|
568 |
|
neuper@42279
|
569 |
subsubsection {*get first koeffizient*}
|
neuper@42279
|
570 |
|
neuper@42279
|
571 |
ML {*
|
neuper@42279
|
572 |
(*substitude z with the first zeropoint to get A*)
|
neuper@42279
|
573 |
val SOME (eq4_1,_) = rewrite_terms_ @{theory Isac} e_rew_ord e_rls [s_1] eq3'';
|
neuper@42279
|
574 |
term2str eq4_1;
|
neuper@42279
|
575 |
|
neuper@42279
|
576 |
val SOME (eq4_2,_) = rewrite_set_ @{theory Isac} false norm_Rational eq4_1;
|
neuper@42279
|
577 |
term2str eq4_2;
|
neuper@42279
|
578 |
|
neuper@42279
|
579 |
val fmz = ["equality (3 = 3 * A / (4::real))", "solveFor A","solutions L"];
|
neuper@42279
|
580 |
val (dI',pI',mI') =("Isac", ["univariate","equation"], ["no_met"]);
|
neuper@42279
|
581 |
(*solve the simple linear equilation for A TODO: return eq, not list of eq*)
|
neuper@42279
|
582 |
val (p,_,fa,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
|
neuper@42362
|
583 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Add_Given "equality (3 = 3 * A / 4)"*)
|
neuper@42362
|
584 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (* Add_Given "solveFor A"*)
|
neuper@42362
|
585 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Add_Find "solutions L"*)
|
neuper@42362
|
586 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Specify_Theory "Isac"*)
|
neuper@42362
|
587 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Specify_Problem ["normalize", "polynomial",
|
neuper@42362
|
588 |
"univariate", "equation"])*)
|
neuper@42362
|
589 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (* Specify_Method ["PolyEq", "normalize_poly"]*)
|
neuper@42362
|
590 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Apply_Method ["PolyEq", "normalize_poly"]*)
|
neuper@42362
|
591 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Rewrite ("all_left", "PolyEq.all_left")*)
|
neuper@42362
|
592 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Rewrite_Set_Inst (["(bdv, A)"], "make_ratpoly_in")*)
|
neuper@42362
|
593 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Rewrite_Set "polyeq_simplify"*)
|
neuper@42362
|
594 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (**)
|
neuper@42362
|
595 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (**)
|
neuper@42362
|
596 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Add_Given "equality (3 + -3 / 4 * A = 0)"*)
|
neuper@42362
|
597 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Add_Given "solveFor A"*)
|
neuper@42362
|
598 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Add_Find "solutions A_i"*)
|
neuper@42362
|
599 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (**)
|
neuper@42362
|
600 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (**)
|
neuper@42362
|
601 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (**)
|
neuper@42362
|
602 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Apply_Method ["PolyEq", "solve_d1_polyeq_equation"]*)
|
neuper@42362
|
603 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Rewrite_Set_Inst (["(bdv, A)"], "d1_polyeq_simplify")*)
|
neuper@42362
|
604 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Rewrite_Set "polyeq_simplify"*)
|
neuper@42362
|
605 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Rewrite_Set "norm_Rational_parenthesized"*)
|
neuper@42362
|
606 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Or_to_List*)
|
neuper@42362
|
607 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Check_elementwise "Assumptions"*)
|
neuper@42362
|
608 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Check_Postcond ["degree_1", "polynomial",
|
neuper@42362
|
609 |
"univariate", "equation"]*)
|
neuper@42362
|
610 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*Check_Postcond ["normalize", "polynomial",
|
neuper@42362
|
611 |
"univariate", "equation"]*)
|
neuper@42362
|
612 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt; (*End_Proof'*)
|
neuper@42279
|
613 |
f2str fa;
|
neuper@42279
|
614 |
*}
|
neuper@42279
|
615 |
|
neuper@42279
|
616 |
subsubsection {*get second koeffizient*}
|
neuper@42279
|
617 |
ML {*thy*}
|
neuper@42279
|
618 |
|
neuper@42279
|
619 |
ML {*
|
neuper@42279
|
620 |
(*substitude z with the second zeropoint to get B*)
|
neuper@42279
|
621 |
val SOME (eq4b_1,_) = rewrite_terms_ @{theory Isac} e_rew_ord e_rls [s_2] eq3'';
|
neuper@42279
|
622 |
term2str eq4b_1;
|
neuper@42279
|
623 |
|
neuper@42279
|
624 |
val SOME (eq4b_2,_) = rewrite_set_ @{theory Isac} false norm_Rational eq4b_1;
|
neuper@42279
|
625 |
term2str eq4b_2;
|
neuper@42279
|
626 |
*}
|
neuper@42279
|
627 |
ML {*
|
neuper@42279
|
628 |
(*solve the simple linear equilation for B TODO: return eq, not list of eq*)
|
neuper@42279
|
629 |
val fmz = ["equality (3 = -3 * B / (4::real))", "solveFor B","solutions L"];
|
neuper@42279
|
630 |
val (dI',pI',mI') =("Isac", ["univariate","equation"], ["no_met"]);
|
neuper@42279
|
631 |
val (p,_,fb,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
|
neuper@42279
|
632 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
633 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
634 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
635 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
636 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
637 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
638 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
639 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
640 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
641 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
642 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
643 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
644 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
645 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
646 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
647 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
648 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
649 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
650 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
651 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
652 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
653 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
654 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
655 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
656 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
657 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
658 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42279
|
659 |
f2str fb;
|
neuper@42279
|
660 |
*}
|
neuper@42279
|
661 |
|
neuper@42279
|
662 |
ML {* (*check koeffizients*)
|
neuper@42279
|
663 |
if f2str fa = "[A = 4]" then () else error "part.fract. eq4_1";
|
neuper@42279
|
664 |
if f2str fb = "[B = -4]" then () else error "part.fract. eq4_1";
|
neuper@42279
|
665 |
*}
|
neuper@42279
|
666 |
|
neuper@42279
|
667 |
subsubsection {*substitute expression with solutions*}
|
neuper@42279
|
668 |
ML {*
|
neuper@42279
|
669 |
*}
|
neuper@42279
|
670 |
ML {*thy*}
|
neuper@42279
|
671 |
|
jan@42296
|
672 |
section {*Implement the Specification and the Method \label{spec-meth}*}
|
neuper@42279
|
673 |
text{*==============================================*}
|
neuper@42279
|
674 |
subsection{*Define the Field Descriptions for the specification*}
|
neuper@42279
|
675 |
consts
|
neuper@42279
|
676 |
filterExpression :: "bool => una"
|
neuper@42279
|
677 |
stepResponse :: "bool => una"
|
neuper@42279
|
678 |
|
neuper@42279
|
679 |
subsection{*Define the Specification*}
|
neuper@42279
|
680 |
ML {*
|
neuper@42279
|
681 |
store_pbt
|
neuper@42279
|
682 |
(prep_pbt thy "pbl_SP" [] e_pblID
|
neuper@42279
|
683 |
(["SignalProcessing"], [], e_rls, NONE, []));
|
neuper@42279
|
684 |
store_pbt
|
neuper@42279
|
685 |
(prep_pbt thy "pbl_SP_Ztrans" [] e_pblID
|
neuper@42279
|
686 |
(["Z_Transform","SignalProcessing"], [], e_rls, NONE, []));
|
neuper@42279
|
687 |
*}
|
neuper@42279
|
688 |
ML {*thy*}
|
neuper@42279
|
689 |
ML {*
|
neuper@42279
|
690 |
store_pbt
|
neuper@42279
|
691 |
(prep_pbt thy "pbl_SP_Ztrans_inv" [] e_pblID
|
neuper@42279
|
692 |
(["inverse", "Z_Transform", "SignalProcessing"],
|
neuper@42279
|
693 |
[("#Given" ,["filterExpression X_eq"]),
|
neuper@42279
|
694 |
("#Find" ,["stepResponse n_eq"])
|
neuper@42279
|
695 |
],
|
neuper@42279
|
696 |
append_rls "e_rls" e_rls [(*for preds in where_*)], NONE,
|
neuper@42279
|
697 |
[["SignalProcessing","Z_Transform","inverse"]]));
|
neuper@42279
|
698 |
|
neuper@42279
|
699 |
show_ptyps();
|
neuper@42279
|
700 |
get_pbt ["inverse","Z_Transform","SignalProcessing"];
|
neuper@42279
|
701 |
*}
|
neuper@42279
|
702 |
|
neuper@42279
|
703 |
subsection {*Define Name and Signature for the Method*}
|
neuper@42279
|
704 |
consts
|
neuper@42279
|
705 |
InverseZTransform :: "[bool, bool] => bool"
|
neuper@42279
|
706 |
("((Script InverseZTransform (_ =))// (_))" 9)
|
neuper@42279
|
707 |
|
neuper@42279
|
708 |
subsection {*Setup Parent Nodes in Hierarchy of Method*}
|
neuper@42279
|
709 |
ML {*
|
neuper@42279
|
710 |
store_met
|
neuper@42279
|
711 |
(prep_met thy "met_SP" [] e_metID
|
neuper@42279
|
712 |
(["SignalProcessing"], [],
|
neuper@42279
|
713 |
{rew_ord'="tless_true", rls'= e_rls, calc = [], srls = e_rls, prls = e_rls,
|
neuper@42279
|
714 |
crls = e_rls, nrls = e_rls}, "empty_script"));
|
neuper@42279
|
715 |
store_met
|
neuper@42279
|
716 |
(prep_met thy "met_SP_Ztrans" [] e_metID
|
neuper@42279
|
717 |
(["SignalProcessing", "Z_Transform"], [],
|
neuper@42279
|
718 |
{rew_ord'="tless_true", rls'= e_rls, calc = [], srls = e_rls, prls = e_rls,
|
neuper@42279
|
719 |
crls = e_rls, nrls = e_rls}, "empty_script"));
|
neuper@42279
|
720 |
*}
|
neuper@42279
|
721 |
ML {*
|
neuper@42279
|
722 |
store_met
|
neuper@42279
|
723 |
(prep_met thy "met_SP_Ztrans_inv" [] e_metID
|
neuper@42279
|
724 |
(["SignalProcessing", "Z_Transform", "inverse"],
|
neuper@42279
|
725 |
[("#Given" ,["filterExpression X_eq"]),
|
neuper@42279
|
726 |
("#Find" ,["stepResponse n_eq"])
|
neuper@42279
|
727 |
],
|
neuper@42279
|
728 |
{rew_ord'="tless_true", rls'= e_rls, calc = [], srls = e_rls, prls = e_rls,
|
neuper@42279
|
729 |
crls = e_rls, nrls = e_rls},
|
neuper@42279
|
730 |
"empty_script"
|
neuper@42279
|
731 |
));
|
neuper@42279
|
732 |
*}
|
neuper@42279
|
733 |
ML {*
|
neuper@42279
|
734 |
store_met
|
neuper@42279
|
735 |
(prep_met thy "met_SP_Ztrans_inv" [] e_metID
|
neuper@42279
|
736 |
(["SignalProcessing", "Z_Transform", "inverse"],
|
neuper@42279
|
737 |
[("#Given" ,["filterExpression X_eq"]),
|
neuper@42279
|
738 |
("#Find" ,["stepResponse n_eq"])
|
neuper@42279
|
739 |
],
|
neuper@42279
|
740 |
{rew_ord'="tless_true", rls'= e_rls, calc = [], srls = e_rls, prls = e_rls,
|
neuper@42279
|
741 |
crls = e_rls, nrls = e_rls},
|
neuper@42279
|
742 |
"Script InverseZTransform (Xeq::bool) =" ^
|
neuper@42279
|
743 |
" (let X = Take Xeq;" ^
|
neuper@42279
|
744 |
" X = Rewrite ruleZY False X" ^
|
neuper@42279
|
745 |
" in X)"
|
neuper@42279
|
746 |
));
|
jan@42299
|
747 |
*}
|
jan@42299
|
748 |
ML {*
|
neuper@42279
|
749 |
show_mets();
|
jan@42299
|
750 |
*}
|
jan@42299
|
751 |
ML {*
|
neuper@42279
|
752 |
get_met ["SignalProcessing","Z_Transform","inverse"];
|
neuper@42279
|
753 |
*}
|
neuper@42279
|
754 |
|
jan@42296
|
755 |
section {*Program in CTP-based language \label{prog-steps}*}
|
neuper@42279
|
756 |
text{*=================================*}
|
neuper@42279
|
757 |
subsection {*Stepwise extend Program*}
|
neuper@42279
|
758 |
ML {*
|
neuper@42279
|
759 |
val str =
|
neuper@42279
|
760 |
"Script InverseZTransform (Xeq::bool) =" ^
|
neuper@42279
|
761 |
" Xeq";
|
neuper@42279
|
762 |
*}
|
neuper@42279
|
763 |
ML {*
|
neuper@42279
|
764 |
val str =
|
neuper@42279
|
765 |
"Script InverseZTransform (Xeq::bool) =" ^ (*(1/z) instead of z ^^^ -1*)
|
neuper@42279
|
766 |
" (let X = Take Xeq;" ^
|
neuper@42279
|
767 |
" X' = Rewrite ruleZY False X;" ^ (*z * denominator*)
|
neuper@42279
|
768 |
" X' = (Rewrite_Set norm_Rational False) X'" ^ (*simplify*)
|
neuper@42279
|
769 |
" in X)";
|
neuper@42279
|
770 |
(*NONE*)
|
neuper@42279
|
771 |
"Script InverseZTransform (Xeq::bool) =" ^ (*(1/z) instead of z ^^^ -1*)
|
neuper@42279
|
772 |
" (let X = Take Xeq;" ^
|
neuper@42279
|
773 |
" X' = Rewrite ruleZY False X;" ^ (*z * denominator*)
|
neuper@42279
|
774 |
" X' = (Rewrite_Set norm_Rational False) X';" ^ (*simplify*)
|
neuper@42279
|
775 |
" X' = (SubProblem (Isac',[pqFormula,degree_2,polynomial,univariate,equation], [no_met]) " ^
|
neuper@42279
|
776 |
" [BOOL e_e, REAL v_v])" ^
|
neuper@42279
|
777 |
" in X)";
|
neuper@42279
|
778 |
*}
|
neuper@42279
|
779 |
ML {*
|
neuper@42279
|
780 |
val str =
|
neuper@42279
|
781 |
"Script InverseZTransform (Xeq::bool) =" ^ (*(1/z) instead of z ^^^ -1*)
|
neuper@42279
|
782 |
" (let X = Take Xeq;" ^
|
neuper@42279
|
783 |
" X' = Rewrite ruleZY False X;" ^ (*z * denominator*)
|
neuper@42279
|
784 |
" X' = (Rewrite_Set norm_Rational False) X';" ^ (*simplify*)
|
neuper@42279
|
785 |
" funterm = rhs X'" ^ (*drop X'= for equation solving*)
|
neuper@42279
|
786 |
" in X)";
|
neuper@42279
|
787 |
*}
|
neuper@42279
|
788 |
ML {*
|
neuper@42290
|
789 |
val str =
|
neuper@42290
|
790 |
"Script InverseZTransform (X_eq::bool) =" ^ (*(1/z) instead of z ^^^ -1*)
|
neuper@42290
|
791 |
" (let X = Take X_eq;" ^
|
neuper@42290
|
792 |
" X' = Rewrite ruleZY False X;" ^ (*z * denominator*)
|
neuper@42290
|
793 |
" X' = (Rewrite_Set norm_Rational False) X';" ^ (*simplify*)
|
jan@42298
|
794 |
" (X'_z::real) = lhs X';" ^
|
jan@42298
|
795 |
" (z::real) = argument_in X'_z;" ^
|
jan@42298
|
796 |
" (funterm::real) = rhs X';" ^ (*drop X' z = for equation solving*)
|
jan@42298
|
797 |
" (denom::real) = get_denominator funterm;" ^ (*get_denominator*)
|
jan@42298
|
798 |
" (equ::bool) = (denom = (0::real));" ^
|
neuper@42290
|
799 |
" (L_L::bool list) = " ^
|
neuper@42290
|
800 |
" (SubProblem (Test', " ^
|
neuper@42290
|
801 |
" [linear,univariate,equation,test]," ^
|
neuper@42290
|
802 |
" [Test,solve_linear]) " ^
|
neuper@42290
|
803 |
" [BOOL equ, REAL z]) " ^
|
neuper@42290
|
804 |
" in X)"
|
neuper@42290
|
805 |
;
|
neuper@42290
|
806 |
|
neuper@42279
|
807 |
parse thy str;
|
neuper@42279
|
808 |
val sc = ((inst_abs thy) o term_of o the o (parse thy)) str;
|
neuper@42279
|
809 |
atomty sc;
|
neuper@42279
|
810 |
|
neuper@42279
|
811 |
*}
|
jan@42300
|
812 |
|
jan@42300
|
813 |
text {*
|
jan@42300
|
814 |
This ruleset contains all functions that are in the script;
|
jan@42300
|
815 |
The evaluation of the functions is done by rewriting using this ruleset.
|
jan@42300
|
816 |
*}
|
jan@42300
|
817 |
|
neuper@42279
|
818 |
ML {*
|
neuper@42290
|
819 |
val srls = Rls {id="srls_InverseZTransform",
|
neuper@42290
|
820 |
preconds = [], rew_ord = ("termlessI",termlessI),
|
neuper@42290
|
821 |
erls = append_rls "erls_in_srls_InverseZTransform" e_rls
|
neuper@42290
|
822 |
[(*for asm in NTH_CONS ...*) Calc ("Orderings.ord_class.less",eval_equ "#less_"),
|
neuper@42290
|
823 |
(*2nd NTH_CONS pushes n+-1 into asms*) Calc("Groups.plus_class.plus", eval_binop "#add_")
|
neuper@42290
|
824 |
],
|
neuper@42290
|
825 |
srls = Erls, calc = [],
|
neuper@42290
|
826 |
rules =
|
neuper@42290
|
827 |
[Thm ("NTH_CONS",num_str @{thm NTH_CONS}),
|
neuper@42290
|
828 |
Calc("Groups.plus_class.plus", eval_binop "#add_"),
|
neuper@42290
|
829 |
Thm ("NTH_NIL",num_str @{thm NTH_NIL}),
|
neuper@42290
|
830 |
Calc("Tools.lhs", eval_lhs"eval_lhs_"), (*<=== ONLY USED*)
|
neuper@42290
|
831 |
Calc("Tools.rhs", eval_rhs"eval_rhs_"), (*<=== ONLY USED*)
|
jan@42300
|
832 |
Calc("Atools.argument'_in", eval_argument_in "Atools.argument'_in"),
|
neuper@42359
|
833 |
Calc("Rational.get_denominator", eval_get_denominator "#get_denominator"),
|
neuper@42359
|
834 |
Calc("Rational.get_numerator", eval_get_numerator "#get_numerator"),
|
jan@42344
|
835 |
Calc("Partial_Fractions.factors_from_solution",
|
neuper@42359
|
836 |
eval_factors_from_solution "#factors_from_solution"),
|
neuper@42359
|
837 |
Calc("Partial_Fractions.drop_questionmarks", eval_drop_questionmarks "#drop_?")
|
neuper@42290
|
838 |
],
|
neuper@42290
|
839 |
scr = EmptyScr};
|
neuper@42279
|
840 |
*}
|
neuper@42279
|
841 |
|
neuper@42279
|
842 |
|
neuper@42279
|
843 |
subsection {*Store Final Version of Program for Execution*}
|
jan@42338
|
844 |
|
neuper@42279
|
845 |
ML {*
|
neuper@42279
|
846 |
store_met
|
neuper@42279
|
847 |
(prep_met thy "met_SP_Ztrans_inv" [] e_metID
|
neuper@42279
|
848 |
(["SignalProcessing", "Z_Transform", "inverse"],
|
neuper@42279
|
849 |
[("#Given" ,["filterExpression X_eq"]),
|
neuper@42279
|
850 |
("#Find" ,["stepResponse n_eq"])
|
neuper@42279
|
851 |
],
|
neuper@42290
|
852 |
{rew_ord'="tless_true", rls'= e_rls, calc = [], srls = srls,
|
neuper@42290
|
853 |
prls = e_rls,
|
neuper@42279
|
854 |
crls = e_rls, nrls = e_rls},
|
neuper@42359
|
855 |
"Script InverseZTransform (X_eq::bool) =" ^ (*(1/z) instead of z ^^^ -1*)
|
neuper@42359
|
856 |
" (let X = Take X_eq;" ^
|
neuper@42359
|
857 |
(*([1], Frm), X z = 3 / (z - 1 / 4 + -1 / 8 * (1 / z))*)
|
neuper@42359
|
858 |
" X' = Rewrite ruleZY False X;" ^ (*z * denominator*)
|
neuper@42359
|
859 |
(*([1], Res), ?X' z = 3 / (z * (z - 1 / 4 + -1 / 8 * (1 / z)))*)
|
jan@42364
|
860 |
" (num_orig::real) = get_numerator (rhs X');"^
|
neuper@42359
|
861 |
" X' = (Rewrite_Set norm_Rational False) X';" ^ (*simplify*)
|
neuper@42359
|
862 |
(*([2], Res), ?X' z = 24 / (-1 + -2 * z + 8 * z ^^^ 2)*)
|
neuper@42359
|
863 |
" (X'_z::real) = lhs X';" ^ (**)
|
neuper@42359
|
864 |
" (zzz::real) = argument_in X'_z;" ^ (**)
|
neuper@42359
|
865 |
" (funterm::real) = rhs X';" ^ (*drop X' z = for equation solving*)
|
neuper@42359
|
866 |
" (denom::real) = get_denominator funterm;" ^ (*get_denominator*)
|
neuper@42359
|
867 |
" (num::real) = get_numerator funterm; " ^ (*get_numerator*)
|
neuper@42359
|
868 |
" (equ::bool) = (denom = (0::real));" ^
|
neuper@42359
|
869 |
" (L_L::bool list) = (SubProblem (PolyEq'," ^
|
neuper@42359
|
870 |
" [abcFormula,degree_2,polynomial,univariate,equation],[no_met])" ^
|
neuper@42359
|
871 |
" [BOOL equ, REAL zzz]); " ^
|
jan@42363
|
872 |
|
neuper@42359
|
873 |
(*([3], Pbl), solve (-1 + -2 * z + 8 * z ^^^ 2 = 0, z)*)
|
neuper@42359
|
874 |
(*([3], Res), [z = 1 / 2, z = -1 / 4]*)
|
jan@42363
|
875 |
|
neuper@42359
|
876 |
" (facs::real) = factors_from_solution L_L;" ^
|
jan@42364
|
877 |
" (eql::real) = Take (num_orig / facs);" ^ (*([4], Frm), 24 / ((z + -1 * (1 / 2)) * (z + -1 * (-1 / 4)))*)
|
jan@42363
|
878 |
|
jan@42363
|
879 |
" (eqr::real) = (Try (Rewrite_Set ansatz_rls False)) eql;"^ (*([4], Res), ?A / (z + -1 * (1 / 2)) + ?B / (z + -1 * (-1 / 4))*)
|
jan@42363
|
880 |
|
jan@42363
|
881 |
" (eq::bool) = Take (eql = eqr);"^ (*Maybe possible to use HOLogic.mk_eq ??*) (*([5], Frm), 24 / ((z + -1 * (1 / 2)) * (z + -1 * (-1 / 4))) = ?A / (z + -1 * (1 / 2)) + ?B / (z + -1 * (-1 / 4))*)
|
jan@42363
|
882 |
|
jan@42363
|
883 |
" eq = (Try (Rewrite_Set equival_trans False)) eq;"^ (*([5], Res), 24 = ?A * (z + -1 * (-1 / 4)) + ?B * (z + -1 * (1 / 2))*)
|
jan@42363
|
884 |
|
neuper@42359
|
885 |
" eq = drop_questionmarks eq;"^
|
jan@42363
|
886 |
" (z1::real) = (rhs (NTH 1 L_L));"^ (*prepare equliation for a - eq_a therfor subsitude z with solution 1 - z1*)
|
jan@42364
|
887 |
" (z2::real) = (rhs (NTH 2 L_L));"^
|
jan@42364
|
888 |
|
jan@42364
|
889 |
" (eq_a::bool) = Take eq;"^
|
jan@42364
|
890 |
" eq_a = (Substitute [zzz=z1]) eq;"^ (*([6], Res), 24 = ?A * (1 / 2 + -1 * (-1 / 4)) + ?B * (1 / 2 + -1 * (1 / 2))*)
|
jan@42363
|
891 |
" eq_a = (Rewrite_Set norm_Rational False) eq_a;"^ (*([7], Res), 24 = ?A * 3 / 4*)
|
jan@42363
|
892 |
" (sol_a::bool list) = (SubProblem (Isac'," ^
|
neuper@42359
|
893 |
" [univariate,equation],[no_met])" ^
|
neuper@42362
|
894 |
" [BOOL eq_a, REAL (A::real)]);"^
|
jan@42363
|
895 |
" (a::real) = (rhs(NTH 1 sol_a));"^
|
jan@42363
|
896 |
|
jan@42364
|
897 |
" (eq_b::bool) = Take eq;"^
|
jan@42364
|
898 |
" eq_b = (Substitute [zzz=z2]) eq_b;"^
|
jan@42364
|
899 |
" eq_b = (Rewrite_Set norm_Rational False) eq_b;"^
|
jan@42364
|
900 |
" (sol_b::bool list) = (SubProblem (Isac'," ^
|
jan@42364
|
901 |
" [univariate,equation],[no_met])" ^
|
jan@42364
|
902 |
" [BOOL eq_b, REAL (B::real)]);"^
|
jan@42366
|
903 |
" (b::real) = (rhs(NTH 1 sol_b));"^
|
jan@42364
|
904 |
|
jan@42366
|
905 |
|
jan@42366
|
906 |
" eqr = drop_questionmarks eqr;"^
|
jan@42365
|
907 |
" (pbz::real) = Take eqr;"^
|
jan@42366
|
908 |
" pbz = ((Substitute [A=a]) pbz);"^
|
jan@42366
|
909 |
" pbz = ((Substitute [B=b]) pbz);"^
|
jan@42365
|
910 |
|
jan@42367
|
911 |
" pbz = Rewrite ruleYZ False pbz;"^
|
jan@42367
|
912 |
" pbz = drop_questionmarks pbz;"^
|
jan@42365
|
913 |
|
jan@42367
|
914 |
" (iztrans::real) = Take pbz;"^
|
jan@42367
|
915 |
" iztrans = (Rewrite_Set inverse_z False) iztrans;"^
|
jan@42367
|
916 |
" iztrans = drop_questionmarks iztrans;"^
|
jan@42367
|
917 |
" (n_eq::bool) = Take (X_n = iztrans)"^
|
jan@42365
|
918 |
|
jan@42366
|
919 |
" in n_eq)"
|
neuper@42359
|
920 |
));
|
neuper@42279
|
921 |
*}
|
neuper@42279
|
922 |
|
jan@42338
|
923 |
|
neuper@42281
|
924 |
subsection {*Check the Program*}
|
neuper@42279
|
925 |
|
neuper@42281
|
926 |
subsubsection {*Check the formalization*}
|
neuper@42279
|
927 |
ML {*
|
neuper@42279
|
928 |
val fmz = ["filterExpression (X = 3 / (z - 1/4 + -1/8 * (1/(z::real))))",
|
neuper@42279
|
929 |
"stepResponse (x[n::real]::bool)"];
|
neuper@42279
|
930 |
val (dI,pI,mI) = ("Isac", ["inverse", "Z_Transform", "SignalProcessing"],
|
neuper@42279
|
931 |
["SignalProcessing","Z_Transform","inverse"]);
|
neuper@42281
|
932 |
|
neuper@42281
|
933 |
val ([(1, [1], "#Given", Const ("Inverse_Z_Transform.filterExpression", _),
|
neuper@42281
|
934 |
[Const ("HOL.eq", _) $ _ $ _]),
|
neuper@42281
|
935 |
(2, [1], "#Find", Const ("Inverse_Z_Transform.stepResponse", _),
|
neuper@42281
|
936 |
[Free ("x", _) $ _])],
|
neuper@42281
|
937 |
_) = prep_ori fmz thy ((#ppc o get_pbt) pI);
|
neuper@42281
|
938 |
*}
|
neuper@42290
|
939 |
ML {*
|
neuper@42290
|
940 |
val Script sc = (#scr o get_met) ["SignalProcessing","Z_Transform","inverse"];
|
neuper@42290
|
941 |
atomty sc;
|
neuper@42290
|
942 |
*}
|
neuper@42281
|
943 |
|
jan@42368
|
944 |
subsubsection {*Stepwise check the program\label{sec:stepcheck}*}
|
neuper@42281
|
945 |
ML {*
|
neuper@42302
|
946 |
trace_rewrite := false;
|
neuper@42306
|
947 |
trace_script := false; print_depth 9;
|
neuper@42281
|
948 |
val fmz = ["filterExpression (X z = 3 / (z - 1/4 + -1/8 * (1/(z::real))))",
|
neuper@42281
|
949 |
"stepResponse (x[n::real]::bool)"];
|
neuper@42281
|
950 |
val (dI,pI,mI) = ("Isac", ["inverse", "Z_Transform", "SignalProcessing"],
|
neuper@42281
|
951 |
["SignalProcessing","Z_Transform","inverse"]);
|
neuper@42310
|
952 |
val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI,pI,mI))];
|
neuper@42359
|
953 |
(*([], Frm), Problem (Isac, [inverse, Z_Transform, SignalProcessing])*)
|
neuper@42303
|
954 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "Add_Given";
|
neuper@42303
|
955 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "Add_Find";
|
neuper@42303
|
956 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "Specify_Theory";
|
neuper@42303
|
957 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "Specify_Problem";
|
neuper@42303
|
958 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "Specify_Method";
|
jan@42296
|
959 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "nxt = Apply_Method";
|
jan@42297
|
960 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "nxt = Rewrite (ruleZY, Inverse_Z_Transform.ruleZY) --> X z = 3 / (z - 1 / 4 + -1 / 8 * (1 / z))"; (*TODO naming!*)
|
neuper@42359
|
961 |
(*([1], Frm), X z = 3 / (z - 1 / 4 + -1 / 8 * (1 / z))*)
|
jan@42296
|
962 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "nxt = Rewrite_Set norm_Rational --> X' z = 3 / (z * (z - 1 / 4 + -1 / 8 * (1 / z)))";
|
neuper@42359
|
963 |
(*([1], Res), ?X' z = 3 / (z * (z - 1 / 4 + -1 / 8 * (1 / z)))*)
|
neuper@42315
|
964 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "nxt = SubProblem";
|
neuper@42359
|
965 |
(*([2], Res), ?X' z = 24 / (-1 + -2 * z + 8 * z ^^^ 2)*)
|
jan@42300
|
966 |
*}
|
neuper@42305
|
967 |
text {* Instead of nxt = Subproblem above we had Empty_Tac; the search for the reason
|
neuper@42305
|
968 |
considered the following points:
|
neuper@42303
|
969 |
# what shows show_pt pt; ...
|
neuper@42303
|
970 |
(([2], Res), ?X' z = 24 / (-1 + -2 * z + 8 * z ^^^ 2))] ..calculation ok,
|
neuper@42303
|
971 |
but no "next" step found: should be "nxt = Subproblem" ?!?
|
neuper@42303
|
972 |
# what shows trace_script := true; we read bottom up ...
|
neuper@42303
|
973 |
@@@ next leaf 'SubProbfrom
|
neuper@42303
|
974 |
(PolyEq', [abcFormula, degree_2, polynomial, univariate, equation],
|
neuper@42303
|
975 |
no_meth)
|
neuper@42303
|
976 |
[BOOL equ, REAL z]' ---> STac 'SubProblem
|
neuper@42303
|
977 |
(PolyEq', [abcFormula, degree_2, polynomial, univariate, equation],
|
neuper@42303
|
978 |
no_meth)
|
neuper@42303
|
979 |
[BOOL (-1 + -2 * z + 8 * z ^^^ 2 = 0), REAL z]'
|
neuper@42305
|
980 |
... and see the SubProblem with correct arguments from searching next step
|
neuper@42305
|
981 |
(program text !!!--->!!! STac (script tactic) with arguments evaluated.)
|
neuper@42310
|
982 |
# do we have the right Script ...difference in the argumentsdifference in the arguments
|
neuper@42303
|
983 |
val Script s = (#scr o get_met) ["SignalProcessing","Z_Transform","inverse"];
|
neuper@42303
|
984 |
writeln (term2str s);
|
neuper@42310
|
985 |
... shows the right script.difference in the arguments
|
neuper@42305
|
986 |
# test --- why helpless here ? --- shows: replace no_meth by [no_meth] in Script
|
neuper@42301
|
987 |
*}
|
neuper@42315
|
988 |
|
neuper@42301
|
989 |
ML {*
|
neuper@42315
|
990 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "nxt = Model_Problem";
|
neuper@42359
|
991 |
(*([3], Pbl), solve (-1 + -2 * z + 8 * z ^^^ 2 = 0, z)*)
|
neuper@42306
|
992 |
*}
|
neuper@42306
|
993 |
text {* Instead of nxt = Model_Problem above we had Empty_Tac; the search for the reason
|
neuper@42310
|
994 |
considered the following points:difference in the arguments
|
neuper@42306
|
995 |
# comparison with subsection { *solve equation* }: there solving this equation works,
|
neuper@42315
|
996 |
so there must be some difference in the arguments of the Subproblem:
|
neuper@42315
|
997 |
RIGHT: we had [no_meth] instead of [no_met] ;-))
|
neuper@42305
|
998 |
*}
|
neuper@42305
|
999 |
ML {*
|
neuper@42315
|
1000 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "nxt = Add_Given equality (-1 + -2 * z + 8 * z ^^^ 2 = 0)";
|
neuper@42315
|
1001 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "nxt = Add_Given solveFor z";
|
neuper@42315
|
1002 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "nxt = Add_Find solutions z_i";
|
neuper@42315
|
1003 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "nxt = Specify_Theory Isac";
|
neuper@42301
|
1004 |
*}
|
neuper@42359
|
1005 |
|
neuper@42315
|
1006 |
text {* We had "nxt = Empty_Tac instead Specify_Theory;
|
neuper@42315
|
1007 |
the search for the reason considered the following points:
|
neuper@42302
|
1008 |
# was there an error message ? NO --ok
|
neuper@42302
|
1009 |
# has "nxt = Add_Find" been inserted in pt: get_obj g_pbl pt (fst p); YES --ok
|
neuper@42302
|
1010 |
# what is the returned "formula": print_depth 999; f; print_depth 999; --
|
neuper@42302
|
1011 |
{Find = [Correct "solutions z_i"], With = [],
|
neuper@42302
|
1012 |
Given = [Correct "equality (-1 + -2 * z + 8 * z ^^^ 2 = 0)", Correct "solveFor z"],
|
neuper@42302
|
1013 |
Where = [False "matches (z = 0) (-1 + -2 * z + 8 * z ^^^ 2 = 0) |\n
|
neuper@42302
|
1014 |
matches (?b * z = 0) (-1 + -2 * z + 8 * z ^^^ 2 = 0) |\n
|
neuper@42302
|
1015 |
matches (?a + z = 0) (-1 + -2 * z + 8 * z ^^^ 2 = 0) |\n
|
neuper@42302
|
1016 |
matches (?a + ?b * z = 0) (-1 + -2 * z + 8 * z ^^^ 2 = 0)"],
|
neuper@42302
|
1017 |
Relate = []}
|
neuper@42302
|
1018 |
-- the only False is the reason: the Where (the precondition) is False for good reasons:
|
neuper@42302
|
1019 |
the precondition seems to check for linear equations, not for the one we want to solve!
|
neuper@42302
|
1020 |
Removed this error by correcting the Script
|
neuper@42302
|
1021 |
from SubProblem (PolyEq', [linear,univariate,equation,test], [Test,solve_linear]
|
neuper@42302
|
1022 |
to SubProblem (PolyEq', [abcFormula,degree_2,polynomial,univariate,equation],
|
neuper@42303
|
1023 |
[PolyEq,solve_d2_polyeq_abc_equation]
|
neuper@42302
|
1024 |
You find the appropriate type of equation at
|
neuper@42302
|
1025 |
http://www.ist.tugraz.at/projects/isac/www/kbase/pbl/index_pbl.html
|
neuper@42302
|
1026 |
and the respective method in Knowledge/PolyEq.thy at the respective store_pbt.
|
neuper@42302
|
1027 |
Or you leave the selection of the appropriate type to isac as done in the final Script ;-))
|
neuper@42302
|
1028 |
*}
|
neuper@42302
|
1029 |
ML {*
|
neuper@42315
|
1030 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "nxt = Specify_Problem [abcFormula,...";
|
neuper@42315
|
1031 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "nxt = Specify_Method [PolyEq,solve_d2_polyeq_abc_equation";
|
neuper@42315
|
1032 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "nxt = Apply_Method [PolyEq,solve_d2_polyeq_abc_equation";
|
neuper@42315
|
1033 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; "nxt = Rewrite_Set_Inst ([(bdv, z)], d2_polyeq_abcFormula_simplify";
|
neuper@42359
|
1034 |
(*([3,1], Frm), -1 + -2 * z + 8 * z ^^^ 2 = 0)*)
|
neuper@42359
|
1035 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42359
|
1036 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42359
|
1037 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42359
|
1038 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42359
|
1039 |
(*([3,4], Res), [z = 1 / 2, z = -1 / 4])*)
|
neuper@42359
|
1040 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42359
|
1041 |
(*([3], Res), [z = 1 / 2, z = -1 / 4]*)
|
neuper@42359
|
1042 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42359
|
1043 |
(*([4], Frm), 24 / ((z + -1 * (1 / 2)) * (z + -1 * (-1 / 4)))*)
|
neuper@42359
|
1044 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42359
|
1045 |
(*([4], Res), ?A / (z + -1 * (1 / 2)) + ?B / (z + -1 * (-1 / 4))*)
|
neuper@42359
|
1046 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42359
|
1047 |
(*([5], Frm), 24 / ((z + -1 * (1 / 2)) * (z + -1 * (-1 / 4))) = ?A / (z + -1 * (1 / 2)) + ?B / (z + -1 * (-1 / 4))*)
|
neuper@42359
|
1048 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42359
|
1049 |
(*([5], Res), 24 = ?A * (z + -1 * (-1 / 4)) + ?B * (z + -1 * (1 / 2))*)
|
neuper@42359
|
1050 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42361
|
1051 |
(*([6], Res), 24 = A * (1 / 2 + -1 * (-1 / 4)) + B * (1 / 2 + -1 * (1 / 2))*)
|
neuper@42361
|
1052 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42361
|
1053 |
(*([7], Res), 24 = A * 3 / 4*)
|
neuper@42362
|
1054 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42362
|
1055 |
(*([8], Pbl), solve (24 = 3 * A / 4, A)*)
|
neuper@42362
|
1056 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*Add_Given "equality (24 = 3 * A / 4)"*)
|
neuper@42362
|
1057 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*Add_Given "solveFor A"*)
|
neuper@42362
|
1058 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*Add_Find "solutions A_i"*)
|
neuper@42362
|
1059 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*Specify_Theory "Isac"*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*Specify_Problem ["normalize", "polynomial",
|
neuper@42362
|
1060 |
"univariate", "equation"]*)
|
neuper@42362
|
1061 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*Specify_Method ["PolyEq", "normalize_poly"]*)
|
neuper@42362
|
1062 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*Apply_Method ["PolyEq", "normalize_poly"]*)
|
neuper@42362
|
1063 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*Rewrite ("all_left", "PolyEq.all_left")*)
|
neuper@42362
|
1064 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*Rewrite_Set_Inst (["(bdv, A)"], "make_ratpoly_in")*)
|
neuper@42362
|
1065 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*Rewrite_Set "polyeq_simplify"*)
|
neuper@42362
|
1066 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*Subproblem ("Isac", ["degree_1", "polynomial",
|
neuper@42362
|
1067 |
"univariate", "equation"])*)
|
neuper@42362
|
1068 |
*}
|
jan@42363
|
1069 |
|
jan@42363
|
1070 |
|
neuper@42362
|
1071 |
ML {*
|
jan@42363
|
1072 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42360
|
1073 |
show_pt pt;
|
neuper@42360
|
1074 |
*}
|
jan@42363
|
1075 |
|
neuper@42279
|
1076 |
ML {*
|
jan@42363
|
1077 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42363
|
1078 |
show_pt pt;
|
neuper@42279
|
1079 |
*}
|
neuper@42279
|
1080 |
|
jan@42363
|
1081 |
ML {*
|
jan@42363
|
1082 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42363
|
1083 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42363
|
1084 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42363
|
1085 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42363
|
1086 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42363
|
1087 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42363
|
1088 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42363
|
1089 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42363
|
1090 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42363
|
1091 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42363
|
1092 |
*}
|
jan@42363
|
1093 |
|
jan@42363
|
1094 |
ML {*
|
jan@42363
|
1095 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1096 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1097 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1098 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1099 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1100 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1101 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1102 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1103 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1104 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1105 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1106 |
*}
|
jan@42364
|
1107 |
|
jan@42364
|
1108 |
ML {*
|
jan@42364
|
1109 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1110 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1111 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1112 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1113 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1114 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1115 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1116 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1117 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1118 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1119 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1120 |
*}
|
jan@42364
|
1121 |
|
jan@42364
|
1122 |
ML {*
|
jan@42364
|
1123 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1124 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1125 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1126 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1127 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1128 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1129 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1130 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1131 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1132 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1133 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1134 |
*}
|
jan@42364
|
1135 |
|
jan@42364
|
1136 |
ML {*
|
jan@42364
|
1137 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1138 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1139 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1140 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1141 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1142 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1143 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1144 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1145 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1146 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1147 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42364
|
1148 |
*}
|
jan@42364
|
1149 |
|
jan@42367
|
1150 |
ML {*
|
jan@42367
|
1151 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42367
|
1152 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42367
|
1153 |
*}
|
jan@42364
|
1154 |
|
jan@42364
|
1155 |
ML {*
|
jan@42365
|
1156 |
trace_script := true;
|
jan@42364
|
1157 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
jan@42363
|
1158 |
show_pt pt;
|
jan@42363
|
1159 |
*}
|
jan@42363
|
1160 |
|
jan@42363
|
1161 |
|
neuper@42279
|
1162 |
section {*Write Tests for Crucial Details*}
|
neuper@42279
|
1163 |
text{*===================================*}
|
neuper@42279
|
1164 |
ML {*
|
neuper@42279
|
1165 |
*}
|
neuper@42279
|
1166 |
|
neuper@42279
|
1167 |
section {*Integrate Program into Knowledge*}
|
neuper@42279
|
1168 |
ML {*
|
neuper@42362
|
1169 |
print_depth 999;
|
neuper@42279
|
1170 |
*}
|
neuper@42279
|
1171 |
|
neuper@42279
|
1172 |
end
|
neuper@42279
|
1173 |
|