test/Tools/isac/ADDTESTS/course/SignalProcess/Build_Inverse_Z_Transform.thy
changeset 59901 07a042166900
parent 59900 4e6fc3336336
child 59903 5037ca1b112b
     1.1 --- a/test/Tools/isac/ADDTESTS/course/SignalProcess/Build_Inverse_Z_Transform.thy	Tue Apr 21 16:53:17 2020 +0200
     1.2 +++ b/test/Tools/isac/ADDTESTS/course/SignalProcess/Build_Inverse_Z_Transform.thy	Wed Apr 22 11:06:48 2020 +0200
     1.3 @@ -652,7 +652,7 @@
     1.4        of simplification occurs right here, in the next step.\<close>
     1.5  
     1.6  ML \<open>
     1.7 -  Trace.trace_rewrite := false;
     1.8 +  Rewrite.trace_on := false;
     1.9    val SOME fract1 =
    1.10      parseNEW ctxt "(z - 1/2)*(z - -1/4) * (A/(z - 1/2) + B/(z - -1/4))";
    1.11    (*
    1.12 @@ -1242,8 +1242,8 @@
    1.13        tree and check if every node implements that what we have wanted.\<close>
    1.14        
    1.15  ML \<open>
    1.16 -  Trace.trace_rewrite := false; (*true*)
    1.17 -  trace_LI := false; (*true*)
    1.18 +  Rewrite.trace_on := false; (*true*)
    1.19 +  LItool.trace_on := false; (*true*)
    1.20    print_depth 9;
    1.21    
    1.22    val fmz =
    1.23 @@ -1492,7 +1492,7 @@
    1.24  \<close>
    1.25  
    1.26  ML \<open>
    1.27 -trace_LI := true;
    1.28 +LItool.trace_on := true;
    1.29  \<close>
    1.30  ML \<open>
    1.31  val (p,_,f,nxt,_,pt) = me nxt p [] pt;