393 "-------- me 'polynomial simplification' Schalk I p.63 No.267b ---"; |
393 "-------- me 'polynomial simplification' Schalk I p.63 No.267b ---"; |
394 val fmz = ["TERM ((5*x^^^2 + 3) * (2*x^^^7 + 3) \ |
394 val fmz = ["TERM ((5*x^^^2 + 3) * (2*x^^^7 + 3) \ |
395 \- (3*x^^^5 + 8) * (6*x^^^4 - 1))", |
395 \- (3*x^^^5 + 8) * (6*x^^^4 - 1))", |
396 "normalform N"]; |
396 "normalform N"]; |
397 val (dI',pI',mI') = |
397 val (dI',pI',mI') = |
398 ("Poly.thy",["polynomial","simplification"], |
398 ("Poly",["polynomial","simplification"], |
399 ["simplification","for_polynomials"]); |
399 ["simplification","for_polynomials"]); |
400 val p = e_pos'; val c = []; |
400 val p = e_pos'; val c = []; |
401 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))]; |
401 val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))]; |
402 val (p,_,f,nxt,_,pt) = me nxt p c pt; |
402 val (p,_,f,nxt,_,pt) = me nxt p c pt; |
403 val (p,_,f,nxt,_,pt) = me nxt p c pt; |
403 val (p,_,f,nxt,_,pt) = me nxt p c pt; |
418 "-------- interSteps for Schalk 299a -----------------------------"; |
418 "-------- interSteps for Schalk 299a -----------------------------"; |
419 "-------- interSteps for Schalk 299a -----------------------------"; |
419 "-------- interSteps for Schalk 299a -----------------------------"; |
420 states:=[]; |
420 states:=[]; |
421 CalcTree |
421 CalcTree |
422 [(["TERM ((x - y)*(x + y))", "normalform N"], |
422 [(["TERM ((x - y)*(x + y))", "normalform N"], |
423 ("Poly.thy",["polynomial","simplification"], |
423 ("Poly",["polynomial","simplification"], |
424 ["simplification","for_polynomials"]))]; |
424 ["simplification","for_polynomials"]))]; |
425 Iterator 1; |
425 Iterator 1; |
426 moveActiveRoot 1; |
426 moveActiveRoot 1; |
427 autoCalculate 1 CompleteCalc; |
427 autoCalculate 1 CompleteCalc; |
428 val ((pt,p),_) = get_calc 1; show_pt pt; |
428 val ((pt,p),_) = get_calc 1; show_pt pt; |