neuper@42256
|
1 |
(* Title: Test_Z_Transform
|
neuper@42256
|
2 |
Author: Jan Rocnik
|
neuper@42256
|
3 |
(c) copyright due to lincense terms.
|
neuper@42256
|
4 |
12345678901234567890123456789012345678901234567890123456789012345678901234567890
|
neuper@42256
|
5 |
10 20 30 40 50 60 70 80
|
neuper@42256
|
6 |
*)
|
neuper@42256
|
7 |
|
neuper@42256
|
8 |
theory Test_Z_Transform imports Isac begin
|
neuper@42256
|
9 |
|
neuper@42256
|
10 |
section {*trials towards Z transform *}
|
neuper@42256
|
11 |
text{*===============================*}
|
neuper@42256
|
12 |
subsection {*terms*}
|
neuper@42256
|
13 |
ML {*
|
neuper@42256
|
14 |
@{term "1 < || z ||"};
|
neuper@42256
|
15 |
@{term "z / (z - 1)"};
|
neuper@42256
|
16 |
@{term "-u -n - 1"};
|
neuper@42256
|
17 |
@{term "-u [-n - 1]"}; (*[ ] denotes lists !!!*)
|
neuper@42256
|
18 |
@{term "z /(z - 1) = -u [-n - 1]"};Isac
|
neuper@42256
|
19 |
@{term "1 < || z || ==> z / (z - 1) = -u [-n - 1]"};
|
neuper@42256
|
20 |
term2str @{term "1 < || z || ==> z / (z - 1) = -u [-n - 1]"};
|
neuper@42256
|
21 |
*}
|
neuper@42256
|
22 |
ML {*
|
neuper@42256
|
23 |
(*alpha --> "</alpha>" *)
|
neuper@42256
|
24 |
|
neuper@42256
|
25 |
@{term "\<alpha> "};
|
neuper@42256
|
26 |
@{term "\<delta> "};
|
neuper@42256
|
27 |
@{term "\<phi> "};
|
neuper@42256
|
28 |
@{term "\<rho> "};
|
neuper@42256
|
29 |
term2str @{term "\<rho> "};
|
neuper@42256
|
30 |
*}
|
neuper@42256
|
31 |
|
neuper@42256
|
32 |
subsection {*rules*}
|
neuper@42256
|
33 |
(*axiomatization "z / (z - 1) = -u [-n - 1]" Illegal variable name: "z / (z - 1) = -u [-n - 1]" *)
|
neuper@42256
|
34 |
(*definition "z / (z - 1) = -u [-n - 1]" Bad head of lhs: existing constant "op /"*)
|
neuper@42256
|
35 |
axiomatization where
|
neuper@42256
|
36 |
rule1: "1 = \<delta>[n]" and
|
neuper@42256
|
37 |
rule2: "|| z || > 1 ==> z / (z - 1) = u [n]" and
|
neuper@42256
|
38 |
rule3: "|| z || < 1 ==> z / (z - 1) = -u [-n - 1]" and
|
neuper@42256
|
39 |
rule4: "|| z || > || \<alpha> || ==> z / (z - \<alpha>) = \<alpha>^^^n * u [n]" and
|
neuper@42256
|
40 |
rule5: "|| z || < || \<alpha> || ==> z / (z - \<alpha>) = -(\<alpha>^^^n) * u [-n - 1]" and
|
neuper@42256
|
41 |
rule6: "|| z || > 1 ==> z/(z - 1)^^^2 = n * u [n]"
|
neuper@42256
|
42 |
ML {*
|
neuper@42256
|
43 |
@{thm rule1};
|
neuper@42256
|
44 |
@{thm rule2};
|
neuper@42256
|
45 |
@{thm rule3};
|
neuper@42256
|
46 |
@{thm rule4};
|
neuper@42256
|
47 |
*}
|
neuper@42256
|
48 |
|
neuper@42256
|
49 |
subsection {*apply rules*}
|
neuper@42256
|
50 |
ML {*
|
neuper@42256
|
51 |
val inverse_Z = append_rls "inverse_Z" e_rls
|
neuper@42256
|
52 |
[ Thm ("rule3",num_str @{thm rule3}),
|
neuper@42256
|
53 |
Thm ("rule4",num_str @{thm rule4}),
|
neuper@42256
|
54 |
Thm ("rule1",num_str @{thm rule1})
|
neuper@42256
|
55 |
];
|
neuper@42256
|
56 |
|
neuper@42256
|
57 |
val t = str2term "z / (z - 1) + z / (z - \<alpha>) + 1";
|
neuper@42256
|
58 |
val SOME (t', asm) = rewrite_set_ thy true inverse_Z t;
|
neuper@42256
|
59 |
term2str t' = "z / (z - ?\<delta> [?n]) + z / (z - \<alpha>) + ?\<delta> [?n]"; (*attention rule1 !!!*)
|
neuper@42256
|
60 |
*}
|
neuper@42256
|
61 |
ML {*
|
neuper@42256
|
62 |
val (thy, ro, er) = (@{theory}, tless_true, eval_rls);
|
neuper@42256
|
63 |
*}
|
neuper@42256
|
64 |
ML {*
|
neuper@42256
|
65 |
val SOME (t, asm1) = rewrite_ thy ro er true (num_str @{thm rule3}) t;
|
neuper@42256
|
66 |
term2str t = "- ?u [- ?n - 1] + z / (z - \<alpha>) + 1"; (*- real *)
|
neuper@42256
|
67 |
term2str t;
|
neuper@42256
|
68 |
*}
|
neuper@42256
|
69 |
ML {*
|
neuper@42256
|
70 |
val SOME (t, asm2) = rewrite_ thy ro er true (num_str @{thm rule4}) t;
|
neuper@42256
|
71 |
term2str t = "- ?u [- ?n - 1] + \<alpha> ^^^ ?n * ?u [?n] + 1"; (*- real *)
|
neuper@42256
|
72 |
term2str t;
|
neuper@42256
|
73 |
*}
|
neuper@42256
|
74 |
ML {*
|
neuper@42256
|
75 |
val SOME (t, asm3) = rewrite_ thy ro er true (num_str @{thm rule1}) t;
|
neuper@42256
|
76 |
term2str t = "- ?u [- ?n - 1] + \<alpha> ^^^ ?n * ?u [?n] + ?\<delta> [?n]"; (*- real *)
|
neuper@42256
|
77 |
term2str t;
|
neuper@42256
|
78 |
*}
|
neuper@42256
|
79 |
ML {*
|
neuper@42256
|
80 |
terms2str (asm1 @ asm2 @ asm3);
|
neuper@42256
|
81 |
*}
|
neuper@42256
|
82 |
|
neuper@42256
|
83 |
section {*Prepare steps in CTP-based programming language*}
|
neuper@42256
|
84 |
text{*===================================================*}
|
neuper@42256
|
85 |
subsection {*prepare expression*}
|
neuper@42256
|
86 |
ML {*
|
neuper@42256
|
87 |
val ctxt = ProofContext.init_global @{theory};
|
neuper@42256
|
88 |
val ctxt = declare_constraints' [@{term "z::real"}] ctxt;
|
neuper@42256
|
89 |
|
neuper@42256
|
90 |
val SOME fun1 = parseNEW ctxt "X z = 3 / (z - 1/4 + -1/8 * z ^^^ -1)"; term2str fun1;
|
neuper@42256
|
91 |
val SOME fun1' = parseNEW ctxt "X z = 3 / (z - 1/4 + -1/8 * (1/z))"; term2str fun1';
|
neuper@42256
|
92 |
*}
|
neuper@42256
|
93 |
|
neuper@42256
|
94 |
axiomatization where
|
neuper@42256
|
95 |
ruleZY: "(X z = a / b) = (X' z = a / (z * b))"
|
neuper@42256
|
96 |
|
neuper@42256
|
97 |
ML {*
|
neuper@42256
|
98 |
val (thy, ro, er) = (@{theory}, tless_true, eval_rls);
|
neuper@42256
|
99 |
val SOME (fun2, asm1) = rewrite_ thy ro er true @{thm ruleZY} fun1; term2str fun2;
|
neuper@42256
|
100 |
val SOME (fun2', asm1) = rewrite_ thy ro er true @{thm ruleZY} fun1'; term2str fun2';
|
neuper@42256
|
101 |
|
neuper@42256
|
102 |
val SOME (fun3,_) = rewrite_set_ @{theory Isac} false norm_Rational fun2;
|
neuper@42256
|
103 |
term2str fun3; (*fails on x^^^(-1) TODO*)
|
neuper@42256
|
104 |
val SOME (fun3',_) = rewrite_set_ @{theory Isac} false norm_Rational fun2';
|
neuper@42256
|
105 |
term2str fun3'; (*OK*)
|
neuper@42256
|
106 |
|
neuper@42256
|
107 |
val (_, expr) = HOLogic.dest_eq fun3'; term2str expr;
|
neuper@42256
|
108 |
*}
|
neuper@42256
|
109 |
|
neuper@42256
|
110 |
subsection {*solve equation*}
|
neuper@42256
|
111 |
text {*this type of equation if too general for the present program*}
|
neuper@42256
|
112 |
ML {*
|
neuper@42256
|
113 |
"----------- Minisubplb/100-init-rootp (*OK*)bl.sml ---------------------";
|
neuper@42256
|
114 |
val denominator = parseNEW ctxt "z^^^2 - 1/4*z - 1/8 = 0";
|
neuper@42256
|
115 |
val fmz = ["equality (z^^^2 - 1/4*z - 1/8 = (0::real))", "solveFor z","solutions L"];
|
neuper@42256
|
116 |
val (dI',pI',mI') =("Isac", ["univariate","equation"], ["no_met"]);
|
neuper@42256
|
117 |
(* ^^^^^^^^^^^^^^^^^^^^^^ TODO: ISAC determines type of eq*)
|
neuper@42256
|
118 |
*}
|
neuper@42256
|
119 |
text {*Does the Equation Match the Specification ?*}
|
neuper@42256
|
120 |
ML {*
|
neuper@42256
|
121 |
match_pbl fmz (get_pbt ["univariate","equation"]);
|
neuper@42256
|
122 |
*}
|
neuper@42256
|
123 |
|
neuper@42256
|
124 |
ML {*
|
neuper@42256
|
125 |
val denominator = parseNEW ctxt "-1/8 + -1/4*z + z^^^2 = 0";
|
neuper@42256
|
126 |
val fmz = (*specification*)
|
neuper@42256
|
127 |
["equality (-1/8 + (-1/4)*z + z^^^2 = (0::real))", (*equality*)
|
neuper@42256
|
128 |
"solveFor z", (*bound variable*)
|
neuper@42256
|
129 |
"solutions L"]; (*identifier for solution*)
|
neuper@42256
|
130 |
(*liste der theoreme die zum lösen benötigt werden, aus isac, keine spezielle methode (no met)*)
|
neuper@42256
|
131 |
val (dI',pI',mI') =
|
neuper@42256
|
132 |
("Isac", ["pqFormula","degree_2","polynomial","univariate","equation"], ["no_met"]);
|
neuper@42256
|
133 |
*}
|
neuper@42256
|
134 |
text {*Does the Other Equation Match the Specification ?*}
|
neuper@42256
|
135 |
ML {*
|
neuper@42256
|
136 |
match_pbl fmz (get_pbt ["pqFormula","degree_2","polynomial","univariate","equation"]);
|
neuper@42256
|
137 |
*}
|
neuper@42256
|
138 |
text {*Solve Equation Stepwise*}
|
neuper@42256
|
139 |
ML {*
|
neuper@42256
|
140 |
val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
|
neuper@42256
|
141 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
142 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
143 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
144 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
145 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
146 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
147 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
148 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
149 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
150 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
151 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
152 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt =..,Check_elementwise "Assumptions")*)
|
neuper@42256
|
153 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
154 |
val (p,_,f,nxt,_,pt) = me nxt p [] pt; f2str f;
|
neuper@42256
|
155 |
(*[z = 1 / 8 + sqrt (9 / 16) / 2, z = 1 / 8 + -1 * sqrt (9 / 16) / 2] TODO sqrt*)
|
neuper@42256
|
156 |
show_pt pt;
|
neuper@42256
|
157 |
val SOME f = parseNEW ctxt "[z = 1 / 8 + 3 / 8, z = 1 / 8 + -3 / 8]";
|
neuper@42256
|
158 |
*}
|
neuper@42256
|
159 |
|
neuper@42256
|
160 |
subsection {*partial fraction decomposition*}
|
neuper@42256
|
161 |
subsubsection {*solution of the equation*}
|
neuper@42256
|
162 |
ML {*
|
neuper@42256
|
163 |
val SOME solutions = parseNEW ctxt "[z=1/2, z=-1/4]";
|
neuper@42256
|
164 |
term2str solutions;
|
neuper@42256
|
165 |
atomty solutions;
|
neuper@42256
|
166 |
*}
|
neuper@42256
|
167 |
|
neuper@42256
|
168 |
subsubsection {*get solutions out of list*}
|
neuper@42256
|
169 |
text {*in isac's CTP-based programming language: let s_1 = NTH 1 solutions; s_2 = NTH 2...*}
|
neuper@42256
|
170 |
ML {*
|
neuper@42256
|
171 |
val Const ("List.list.Cons", _) $ s_1 $ (Const ("List.list.Cons", _) $
|
neuper@42256
|
172 |
s_2 $ Const ("List.list.Nil", _)) = solutions;
|
neuper@42256
|
173 |
term2str s_1;
|
neuper@42256
|
174 |
term2str s_2;
|
neuper@42256
|
175 |
*}
|
neuper@42256
|
176 |
|
neuper@42256
|
177 |
ML {* (*Solutions as Denominator --> Denominator1 = z - Zeropoint1, Denominator2 = z-Zeropoint2,...*)
|
neuper@42256
|
178 |
val xx = HOLogic.dest_eq s_1;
|
neuper@42256
|
179 |
val s_1' = HOLogic.mk_binop "Groups.minus_class.minus" xx;
|
neuper@42256
|
180 |
val xx = HOLogic.dest_eq s_2;
|
neuper@42256
|
181 |
val s_2' = HOLogic.mk_binop "Groups.minus_class.minus" xx;
|
neuper@42256
|
182 |
term2str s_1';
|
neuper@42256
|
183 |
term2str s_2';
|
neuper@42256
|
184 |
*}
|
neuper@42256
|
185 |
|
neuper@42256
|
186 |
subsubsection {*build expression*}
|
neuper@42256
|
187 |
text {*in isac's CTP-based programming language: let s_1 = Take numerator / (s_1 * s_2)*}
|
neuper@42256
|
188 |
ML {*
|
neuper@42256
|
189 |
(*The Main Denominator is the multiplikation of the partial fraction denominators*)
|
neuper@42256
|
190 |
val denominator' = HOLogic.mk_binop "Groups.times_class.times" (s_1', s_2') ;
|
neuper@42256
|
191 |
val SOME numerator = parseNEW ctxt "3::real";
|
neuper@42256
|
192 |
|
neuper@42256
|
193 |
val expr' = HOLogic.mk_binop "Rings.inverse_class.divide" (numerator, denominator');
|
neuper@42256
|
194 |
term2str expr';
|
neuper@42256
|
195 |
*}
|
neuper@42256
|
196 |
|
neuper@42256
|
197 |
subsubsection {*Ansatz - create partial fractions out of our expression*}
|
neuper@42256
|
198 |
|
neuper@42256
|
199 |
axiomatization where
|
neuper@42256
|
200 |
ansatz2: "n / (a*b) = A/a + B/(b::real)" and
|
neuper@42256
|
201 |
multiply_eq2: "(n / (a*b) = A/a + B/b) = (a*b*(n / (a*b)) = a*b*(A/a + B/b))"
|
neuper@42256
|
202 |
|
neuper@42256
|
203 |
ML {*
|
neuper@42256
|
204 |
(*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@42256
|
205 |
val SOME (t1,_) = rewrite_ @{theory Isac} e_rew_ord e_rls false @{thm ansatz2} expr';
|
neuper@42256
|
206 |
term2str t1; atomty t1;
|
neuper@42256
|
207 |
val eq1 = HOLogic.mk_eq (expr', t1);
|
neuper@42256
|
208 |
term2str eq1;
|
neuper@42256
|
209 |
*}
|
neuper@42256
|
210 |
ML {*
|
neuper@42256
|
211 |
(*eliminate the demoninators by multiplying the left and the right side with the main denominator*)
|
neuper@42256
|
212 |
val SOME (eq2,_) = rewrite_ @{theory Isac} e_rew_ord e_rls false @{thm multiply_eq2} eq1;
|
neuper@42256
|
213 |
term2str eq2;
|
neuper@42256
|
214 |
*}
|
neuper@42256
|
215 |
ML {*
|
neuper@42256
|
216 |
(*simplificatoin*)
|
neuper@42256
|
217 |
val SOME (eq3,_) = rewrite_set_ @{theory Isac} false norm_Rational eq2;
|
neuper@42256
|
218 |
term2str eq3; (*?A ?B not simplified*)
|
neuper@42256
|
219 |
*}
|
neuper@42256
|
220 |
ML {*
|
neuper@42256
|
221 |
val SOME fract1 =
|
neuper@42256
|
222 |
parseNEW ctxt "(z - 1 / 2) * (z - -1 / 4) * (A / (z - 1 / 2) + B / (z - -1 / 4))"; (*A B !*)
|
neuper@42256
|
223 |
val SOME (fract2,_) = rewrite_set_ @{theory Isac} false norm_Rational fract1;
|
neuper@42256
|
224 |
term2str fract2 = "(A + -2 * B + 4 * A * z + 4 * B * z) / 4";
|
neuper@42256
|
225 |
(*term2str fract2 = "A * (1 / 4 + z) + B * (-1 / 2 + z)" would be more traditional*)
|
neuper@42256
|
226 |
*}
|
neuper@42256
|
227 |
ML {*
|
neuper@42256
|
228 |
val (numerator, denominator) = HOLogic.dest_eq eq3;
|
neuper@42256
|
229 |
val eq3' = HOLogic.mk_eq (numerator, fract1); (*A B !*)
|
neuper@42256
|
230 |
term2str eq3';
|
neuper@42256
|
231 |
(*MANDATORY: simplify (and remove denominator) otherwise 3 = 0*)
|
neuper@42256
|
232 |
val SOME (eq3'' ,_) = rewrite_set_ @{theory Isac} false norm_Rational eq3';
|
neuper@42256
|
233 |
term2str eq3'';
|
neuper@42256
|
234 |
*}
|
neuper@42256
|
235 |
|
neuper@42256
|
236 |
subsubsection {*get first koeffizient*}
|
neuper@42256
|
237 |
|
neuper@42256
|
238 |
ML {*
|
neuper@42256
|
239 |
(*substitude z with the first zeropoint to get A*)
|
neuper@42256
|
240 |
val SOME (eq4_1,_) = rewrite_terms_ @{theory Isac} e_rew_ord e_rls [s_1] eq3'';
|
neuper@42256
|
241 |
term2str eq4_1;
|
neuper@42256
|
242 |
|
neuper@42256
|
243 |
val SOME (eq4_2,_) = rewrite_set_ @{theory Isac} false norm_Rational eq4_1;
|
neuper@42256
|
244 |
term2str eq4_2;
|
neuper@42256
|
245 |
|
neuper@42256
|
246 |
val fmz = ["equality (3 = 3 * A / (4::real))", "solveFor A","solutions L"];
|
neuper@42256
|
247 |
val (dI',pI',mI') =("Isac", ["univariate","equation"], ["no_met"]);
|
neuper@42256
|
248 |
(*solve the simple linear equilation for A TODO: return eq, not list of eq*)
|
neuper@42256
|
249 |
val (p,_,fa,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
|
neuper@42256
|
250 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
251 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
252 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
253 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
254 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
255 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
256 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
257 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
258 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
259 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
260 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
261 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
262 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
263 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
264 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
265 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
266 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
267 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
268 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
269 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
270 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
271 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
272 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
273 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
274 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
275 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
276 |
val (p,_,fa,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
277 |
f2str fa;
|
neuper@42256
|
278 |
*}
|
neuper@42256
|
279 |
|
neuper@42256
|
280 |
subsubsection {*get second koeffizient*}
|
neuper@42256
|
281 |
|
neuper@42256
|
282 |
ML {*
|
neuper@42256
|
283 |
(*substitude z with the second zeropoint to get B*)
|
neuper@42256
|
284 |
val SOME (eq4b_1,_) = rewrite_terms_ @{theory Isac} e_rew_ord e_rls [s_2] eq3'';
|
neuper@42256
|
285 |
term2str eq4b_1;
|
neuper@42256
|
286 |
|
neuper@42256
|
287 |
val SOME (eq4b_2,_) = rewrite_set_ @{theory Isac} false norm_Rational eq4b_1;
|
neuper@42256
|
288 |
term2str eq4b_2;
|
neuper@42256
|
289 |
*}
|
neuper@42256
|
290 |
ML {*
|
neuper@42256
|
291 |
(*solve the simple linear equilation for B TODO: return eq, not list of eq*)
|
neuper@42256
|
292 |
val fmz = ["equality (3 = -3 * B / (4::real))", "solveFor B","solutions L"];
|
neuper@42256
|
293 |
val (dI',pI',mI') =("Isac", ["univariate","equation"], ["no_met"]);
|
neuper@42256
|
294 |
val (p,_,fb,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
|
neuper@42256
|
295 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
296 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
297 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
298 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
299 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
300 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
301 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
302 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
303 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
304 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
305 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
306 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
307 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
308 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
309 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
310 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
311 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
312 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
313 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
314 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
315 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
316 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
317 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
318 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
319 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
320 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
321 |
val (p,_,fb,nxt,_,pt) = me nxt p [] pt;
|
neuper@42256
|
322 |
f2str fb;
|
neuper@42256
|
323 |
*}
|
neuper@42256
|
324 |
|
neuper@42256
|
325 |
ML {* (*check koeffizients*)
|
neuper@42256
|
326 |
if f2str fa = "[A = 4]" then () else error "part.fract. eq4_1";
|
neuper@42256
|
327 |
if f2str fb = "[B = -4]" then () else error "part.fract. eq4_1";
|
neuper@42256
|
328 |
*}
|
neuper@42256
|
329 |
|
neuper@42256
|
330 |
subsubsection {*substitute expression with solutions*}
|
neuper@42256
|
331 |
ML {*
|
neuper@42256
|
332 |
*}
|
neuper@42256
|
333 |
|
neuper@42256
|
334 |
section {*Implement the Specification and the Method*}
|
neuper@42256
|
335 |
text{*==============================================*}
|
neuper@42256
|
336 |
subsection{*Define the Specification*}
|
neuper@42256
|
337 |
ML {*
|
neuper@42256
|
338 |
val thy = @{theory};
|
neuper@42256
|
339 |
*}
|
neuper@42256
|
340 |
ML {*
|
neuper@42256
|
341 |
store_pbt
|
neuper@42256
|
342 |
(prep_pbt thy "pbl_SP" [] e_pblID
|
neuper@42256
|
343 |
(["SignalProcessing"], [], e_rls, NONE, []));
|
neuper@42256
|
344 |
store_pbt
|
neuper@42256
|
345 |
(prep_pbt thy "pbl_SP_Ztrans" [] e_pblID
|
neuper@42256
|
346 |
(["Z_Transform","SignalProcessing"], [], e_rls, NONE, []));
|
neuper@42256
|
347 |
store_pbt
|
neuper@42256
|
348 |
(prep_pbt thy "pbl_SP_Ztrans_inv" [] e_pblID
|
neuper@42256
|
349 |
(["inverse", "Z_Transform", "SignalProcessing"],
|
neuper@42256
|
350 |
[("#Given" ,["equality X_eq"]),
|
neuper@42256
|
351 |
("#Find" ,["equality n_eq"])
|
neuper@42256
|
352 |
],
|
neuper@42256
|
353 |
append_rls "e_rls" e_rls [(*for preds in where_*)], NONE,
|
neuper@42256
|
354 |
[["TODO: path to method"]]));
|
neuper@42256
|
355 |
|
neuper@42256
|
356 |
show_ptyps();
|
neuper@42256
|
357 |
get_pbt ["inverse","Z_Transform","SignalProcessing"];
|
neuper@42256
|
358 |
*}
|
neuper@42256
|
359 |
|
neuper@42256
|
360 |
subsection{*Define the (Dummy-)Method*}
|
neuper@42256
|
361 |
subsection {*Define Name and Signature for the Method*}
|
neuper@42256
|
362 |
consts
|
neuper@42256
|
363 |
InverseZTransform :: "[bool, bool] => bool"
|
neuper@42256
|
364 |
("((Script InverseZTransform (_ =))// (_))" 9)
|
neuper@42256
|
365 |
|
neuper@42256
|
366 |
ML {*
|
neuper@42256
|
367 |
store_met
|
neuper@42256
|
368 |
(prep_met thy "met_SP" [] e_metID
|
neuper@42256
|
369 |
(["SignalProcessing"], [],
|
neuper@42256
|
370 |
{rew_ord'="tless_true", rls'= e_rls, calc = [], srls = e_rls, prls = e_rls,
|
neuper@42256
|
371 |
crls = e_rls, nrls = e_rls}, "empty_script"));
|
neuper@42256
|
372 |
store_met
|
neuper@42256
|
373 |
(prep_met thy "met_SP_Ztrans" [] e_metID
|
neuper@42256
|
374 |
(["SignalProcessing", "Z_Transform"], [],
|
neuper@42256
|
375 |
{rew_ord'="tless_true", rls'= e_rls, calc = [], srls = e_rls, prls = e_rls,
|
neuper@42256
|
376 |
crls = e_rls, nrls = e_rls}, "empty_script"));
|
neuper@42256
|
377 |
*}
|
neuper@42256
|
378 |
ML {*
|
neuper@42256
|
379 |
store_met
|
neuper@42256
|
380 |
(prep_met thy "met_SP_Ztrans_inv" [] e_metID
|
neuper@42256
|
381 |
(["SignalProcessing", "Z_Transform", "inverse"], [],
|
neuper@42256
|
382 |
{rew_ord'="tless_true", rls'= e_rls, calc = [], srls = e_rls, prls = e_rls,
|
neuper@42256
|
383 |
crls = e_rls, nrls = e_rls},
|
neuper@42256
|
384 |
"empty_script"
|
neuper@42256
|
385 |
));
|
neuper@42256
|
386 |
val thy = @{theory}; (*latest version of thy required*)
|
neuper@42256
|
387 |
store_met
|
neuper@42256
|
388 |
(prep_met thy "met_SP_Ztrans_inv" [] e_metID
|
neuper@42256
|
389 |
(["SignalProcessing", "Z_Transform", "inverse"],
|
neuper@42256
|
390 |
[("#Given" ,["equality X_eq"]),
|
neuper@42256
|
391 |
("#Find" ,["equality n_eq"])
|
neuper@42256
|
392 |
],
|
neuper@42256
|
393 |
{rew_ord'="tless_true", rls'= e_rls, calc = [], srls = e_rls, prls = e_rls,
|
neuper@42256
|
394 |
crls = e_rls, nrls = e_rls},
|
neuper@42256
|
395 |
"Script InverseZTransform (Xeq::bool) =" ^
|
neuper@42256
|
396 |
" (let X = Take Xeq;" ^
|
neuper@42256
|
397 |
" X = Rewrite ruleZY False X" ^
|
neuper@42256
|
398 |
" in X)"
|
neuper@42256
|
399 |
));
|
neuper@42256
|
400 |
|
neuper@42256
|
401 |
show_mets();
|
neuper@42256
|
402 |
get_met ["SignalProcessing","Z_Transform","inverse"];
|
neuper@42256
|
403 |
*}
|
neuper@42256
|
404 |
|
neuper@42256
|
405 |
|
neuper@42256
|
406 |
section {*Program in CTP-based language*}
|
neuper@42256
|
407 |
text{*=================================*}
|
neuper@42256
|
408 |
subsection {*Stepwise extend Program*}
|
neuper@42256
|
409 |
ML {*
|
neuper@42256
|
410 |
val str =
|
neuper@42256
|
411 |
"Script InverseZTransform (Xeq::bool) =" ^
|
neuper@42256
|
412 |
" Xeq";
|
neuper@42256
|
413 |
*}
|
neuper@42256
|
414 |
ML {*
|
neuper@42256
|
415 |
val str =
|
neuper@42256
|
416 |
"Script InverseZTransform (Xeq::bool) =" ^
|
neuper@42256
|
417 |
" (let X = Take Xeq;" ^
|
neuper@42256
|
418 |
" X = Rewrite ruleZY False X" ^
|
neuper@42256
|
419 |
" in X)";
|
neuper@42256
|
420 |
*}
|
neuper@42256
|
421 |
ML {*
|
neuper@42256
|
422 |
val thy = @{theory};
|
neuper@42256
|
423 |
val sc = ((inst_abs thy) o term_of o the o (parse thy)) str;
|
neuper@42256
|
424 |
*}
|
neuper@42256
|
425 |
ML {*
|
neuper@42256
|
426 |
term2str sc;
|
neuper@42256
|
427 |
atomty sc
|
neuper@42256
|
428 |
*}
|
neuper@42256
|
429 |
|
neuper@42256
|
430 |
|
neuper@42256
|
431 |
subsection {*Store Final Version of Program for Execution*}
|
neuper@42256
|
432 |
ML {*
|
neuper@42256
|
433 |
store_met
|
neuper@42256
|
434 |
(prep_met thy "met_SP_Ztrans_inv" [] e_metID
|
neuper@42256
|
435 |
(["SignalProcessing", "Z_Transform", "inverse"],
|
neuper@42256
|
436 |
[("#Given" ,["equality X_eq"]),
|
neuper@42256
|
437 |
("#Find" ,["equality n_eq"])
|
neuper@42256
|
438 |
],
|
neuper@42256
|
439 |
{rew_ord'="tless_true", rls'= e_rls, calc = [], srls = e_rls, prls = e_rls,
|
neuper@42256
|
440 |
crls = e_rls, nrls = e_rls},
|
neuper@42256
|
441 |
"Script InverseZTransform (Xeq::bool) =" ^
|
neuper@42256
|
442 |
" (let X = Take Xeq;" ^
|
neuper@42256
|
443 |
" X = Rewrite ruleZY False X" ^
|
neuper@42256
|
444 |
" in X)"
|
neuper@42256
|
445 |
));
|
neuper@42256
|
446 |
*}
|
neuper@42256
|
447 |
|
neuper@42256
|
448 |
|
neuper@42256
|
449 |
subsection {*Stepwise Execute the Program*}
|
neuper@42256
|
450 |
|
neuper@42256
|
451 |
|
neuper@42256
|
452 |
|
neuper@42256
|
453 |
|
neuper@42256
|
454 |
|
neuper@42256
|
455 |
|
neuper@42256
|
456 |
|
neuper@42256
|
457 |
|
neuper@42256
|
458 |
section {*Write Tests for Crucial Details*}
|
neuper@42256
|
459 |
text{*===================================*}
|
neuper@42256
|
460 |
ML {*
|
neuper@42256
|
461 |
|
neuper@42256
|
462 |
*}
|
neuper@42256
|
463 |
|
neuper@42256
|
464 |
section {*Integrate Program into Knowledge*}
|
neuper@42256
|
465 |
ML {*
|
neuper@42256
|
466 |
|
neuper@42256
|
467 |
*}
|
neuper@42256
|
468 |
|
neuper@42256
|
469 |
end
|
neuper@42256
|
470 |
|