(*

cd /usr/local/Isabelle/test/Tools/isac/ADDTESTS/course/

/usr/local/Isabelle/bin/isabelle jedit -l Isac T2_Rewriting.thy &

*)

theory T2_Rewriting imports Isac.Isac_Knowledge

begin

chapter \<open>Rewriting\<close>

text \<open>\emph{Rewriting} is a technique of Symbolic Computation, which is 

  appropriate to make a 'transparent system', because it is intuitively 

  comprehensible. For a thourogh introduction see the book of Tobias Nipkow, 

  http://www4.informatik.tu-muenchen.de/~nipkow/TRaAT/

section {* Introduction to rewriting\<close>

text \<open>Rewriting creates calculations which look like written by hand; see the 

  ISAC tutoring system ! ISAC finds the rules automatically. Here we start by 

  telling the rules ourselves.

  Let's differentiate after we have identified the rules for differentiation, as 

  found in $ISABELLE_ISAC/Knowledge/Diff.thy:

\<close>

ML \<open>

val diff_sum = @{thm diff_sum};

val diff_pow = @{thm diff_pow};

val diff_var = @{thm diff_var};

val diff_const = @{thm diff_const};

\<close>

text \<open>Looking at the rules (abbreviated by 'thm' above), we see the 

  differential operator abbreviated by 'd_d ?bdv', where '?bdv' is the bound 

  variable.

  Can you read diff_const in the Ouput window ?

  Please, skip this introductory ML-section in the first go ...\<close>

ML \<open>

(*default_print_depth 1;*)

val (thy, ro, er, inst) = 

    (@{theory "Isac_Knowledge"}, tless_true, eval_rls, [(@{term "bdv::real"}, @{term "x::real"})]);

val ctxt = Proof_Context.init_global thy; (*required for parsing*)

\<close>

text \<open>... and  let us differentiate the term t:\<close>

ML \<open>

val t = TermC.parseNEW' ctxt "d_d x (x\<up>2 + x + y)";

val SOME (t, _) = Rewrite.rewrite_inst_ ctxt ro er true inst diff_sum t; UnparseC.term t;

val SOME (t, _) = Rewrite.rewrite_inst_ ctxt ro er true inst diff_sum t; UnparseC.term t;

val SOME (t, _) = Rewrite.rewrite_inst_ ctxt ro er true inst diff_pow t; UnparseC.term t;

val SOME (t, _) = Rewrite.rewrite_inst_ ctxt ro er true inst diff_var t; UnparseC.term t;

val SOME (t, _) = Rewrite.rewrite_inst_ ctxt ro er true inst diff_const t; UnparseC.term t;

\<close>

text \<open>Please, scoll up the Output-window to check the 5 steps of rewriting !

  You might not be satisfied by the result "2 * x \<up> (2 - 1) + 1 + 0".

  ISAC has a set of rules called 'make_polynomial', which simplifies the result:

\<close>

ML \<open>

val SOME (t, _) = Rewrite.rewrite_set_ ctxt true make_polynomial t; UnparseC.term t;

\<close>

section \<open>Note on bound variables\<close>

text \<open>You may have noticed that rewrite_ above could distinguish between x 

  (d_d x x = 1) and y (d_d x y = 0). ISAC does this by instantiating theorems

  before application: given [(@{term "bdv::real"}, @{term "x::real"})] the 

  theorem diff_sum becomes "d_d x (?u + ?v) = d_d x ?u + d_d x ?v".

  Isabelle does this differently by variables bound by a 'lambda' %, see

  http://isabelle.in.tum.de/dist/library/HOL/HOL-Multivariate_Analysis/Derivative.html

\<close>

ML \<open>

val t = @{term "%x. x^2 + x + y"};

TermC.atom_write_detail @{context} t; UnparseC.term_in_ctxt @{context} t;

\<close>

text \<open>Since this notation does not conform to present high-school matheatics

  ISAC introduced the 'bdv' mechanism. This mechanism is also used for equation

  solving in ISAC.

\<close>

section \<open>Conditional and ordered rewriting\<close>

text \<open>We have already seen conditional rewriting above when we used the rule

  diff_const; let us try:\<close>

ML \<open>

val t1 = TermC.parseNEW' ctxt "d_d x (a*BC*x*z)";

Rewrite.rewrite_inst_ ctxt ro er true inst diff_const t1;

val t2 = TermC.parseNEW' ctxt "d_d x (a*BC*y*z)";

Rewrite.rewrite_inst_ ctxt ro er true inst diff_const t2;

\<close>

text \<open>For term t1 the assumption 'not (x occurs_in "a*BC*x*z")' is false, 

  since x occurs in t1 actually; thus the rule following implication '==>' is 

  not applied and rewrite_inst_ returns NONE.

  For term t2 is 'not (x occurs_in "a*BC*y*z")' true, thus the rule is applied.

\<close>

subsection \<open>ordered rewriting\<close>

text \<open>Let us start with an example; in order to see what is going on we tell

  Isabelle to show all brackets:

\<close>

ML \<open>

(*show_brackets := true; TODO*)

val t0 = TermC.parseNEW' ctxt "2*a + 3*b + 4*a::real"; UnparseC.term t0;

(*show_brackets := false;*)

\<close>

text \<open>Now we want to bring 4*a close to 2*a in order to get 6*a:

\<close>

ML \<open>

val SOME (t, _) = Rewrite.rewrite_ ctxt ro er true @{thm add.assoc} t0; UnparseC.term t;

val SOME (t, _) = Rewrite.rewrite_ ctxt ro er true @{thm add.left_commute} t; UnparseC.term t;

val SOME (t, _) = Rewrite.rewrite_ ctxt ro er true @{thm add.commute} t; UnparseC.term t;

val SOME (t, _) = Rewrite.rewrite_ ctxt ro er true @{thm real_num_collect} t; UnparseC.term t;

\<close>

text \<open>That is fine, we just need to add 2+4 !!!!! See the next section below.

  But we cannot automate such ordering with what we know so far: If we put

  add.assoc, add.left_commute and add.commute into one ruleset (your have used

  ruleset 'make_polynomial' already), then all the rules are applied as long

  as one rule is applicable (that is the way such rulesets work).

  Try to step through the ML-sections without skipping one of them ...

\<close>

ML \<open>val SOME (t, _) = Rewrite.rewrite_ ctxt ro er true @{thm add.commute} t; UnparseC.term t\<close>

ML \<open>val SOME (t, _) = Rewrite.rewrite_ ctxt ro er true @{thm add.commute} t; UnparseC.term t\<close>

ML \<open>val SOME (t, _) = Rewrite.rewrite_ ctxt ro er true @{thm add.commute} t; UnparseC.term t\<close>

ML \<open>val SOME (t, _) = Rewrite.rewrite_ ctxt ro er true @{thm add.commute} t; UnparseC.term t\<close>

text \<open>... you can go forever, the ruleset is 'not terminating'.

  The theory of rewriting makes this kind of rulesets terminate by the use of

  'rewrite orders': 

  Given two terms t1 and t2 we describe rewriting by: t1 ~~> t2. Then

  'ordered rewriting' is: t2 < t1 ==> t1 ~~> t2. That means, a rule is only

  applied, when the result t2 is 'smaller', '<', than the one to be rewritten.

  Defining such a '<' is not trivial, see ~~/src/Tools/isacKnowledge/Poly.thy

  for 'fun has_degree_in' etc.

\<close>

subsection \<open>Simplification in ISAC\<close>

text \<open>

  With the introduction into rewriting, ordered rewriting and conditional

  rewriting we have seen all what is necessary for the practice of rewriting.

  One basic technique of 'symbolic computation' which uses rewriting is

  simplification, that means: transform terms into an equivalent form which is

  as simple as possible.

  Isabelle has powerful and efficient simplifiers. Nevertheless, ISAC has another

  kind of simplifiers, which groups rulesets such that the trace of rewrites is 

  more readable in ISAC's worksheets.

  Here are examples of of how ISAC's simplifier work:

\<close>

ML \<open>

(*show_brackets := false; TODO*)

val t1 = TermC.parseNEW' ctxt "(a - b) * (a\<up>2 + a*b + b\<up>2)";

val SOME (t, _) = Rewrite.rewrite_set_ ctxt true make_polynomial t1; UnparseC.term t;

\<close>

ML \<open>

val t2 = TermC.parseNEW' ctxt 

  "(2 / (x + 3) + 2 / (x - 3)) / (8 * x / (x \<up> 2 - 9))";

val SOME (t, _) = Rewrite.rewrite_set_ ctxt true norm_Rational t2; UnparseC.term t;

\<close>

text \<open>The simplifiers are quite busy when finding the above results. you can

  watch them at work by setting the switch 'Rewrite.trace_on:\<close>

ML \<open>

tracing "+++begin++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++";

val SOME (t, _) = Rewrite.rewrite_set_ ctxt true norm_Rational t2; UnparseC.term t;

tracing "+++end++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++";

\<close>

text \<open>You see what happend when you click the checkbox <Tracing> on the bar

  separating this window from the Output-window.

  So, it might be better to take simpler examples for watching the simplifiers.

\<close>

section \<open>Experiments with a simplifier conserving minus\<close>

text \<open>We conclude the section on rewriting with starting into an experimental

  development. This development has been urged by teachers using ISAC for

  introduction to algebra with students at the age of 12-14.

  The teachers requested ISAC to keep the minus, for instance in the above 

  result "a^3 + -1 * b^3" (here ISAC should write "a^3  - * b^3") and also

  in all intermediate steps.

  So we started to develop (in German !) such a simplifier in 

  $ISABELLE_ISAC/Knowledge/PolyMinus.thy

\<close>

subsection \<open>What already works\<close>

ML \<open>

val t2 = TermC.parseNEW' ctxt 

  "5*e + 6*f - 8*g - 9 - 7*e - 4*f + 10*g + 12::real";

val SOME (t, _) = Rewrite.rewrite_set_ ctxt true rls_p_33 t2; UnparseC.term t;

\<close>

text \<open>Try your own examples !\<close>

subsection \<open>This raises questions about didactics\<close>

text \<open>Oberserve the '-' ! That works out. But see the efforts in PolyMinus.thy

\<close>

ML \<open>

@{thm subtrahiere};

@{thm subtrahiere_von_1};

@{thm subtrahiere_1};

\<close>

text \<open>That would not be so bad. But it is only a little part of what else is

  required:

\<close>

ML \<open>

@{thm subtrahiere_x_plus_minus};

@{thm subtrahiere_x_plus1_minus};

@{thm subtrahiere_x_plus_minus1};

@{thm subtrahiere_x_minus_plus};

@{thm subtrahiere_x_minus1_plus};

@{thm subtrahiere_x_minus_plus1};

@{thm subtrahiere_x_minus_minus};

@{thm subtrahiere_x_minus1_minus};

@{thm subtrahiere_x_minus_minus1};

\<close>

text \<open>So, learning so many rules, and learning to apply these rules, is futile.

  Actually, most of our students are unable to apply theorems.

  But if you look at 'make_polynomial' or even 'norm_Rational' you see, 

  that these general simplifiers require about 10% than rulesets for '-'.

  So, we might have better chances to teach our student to apply theorems

  without '-' ?

\<close>

subsection \<open>This does not yet work\<close>

ML \<open>

val t = TermC.parseNEW' ctxt 

  "(2*a - 5*b) * (2*a + 5*b)";

Rewrite.rewrite_set_ ctxt true rls_p_33 t; UnparseC.term t;

\<close>

end