Sat, 24 Aug 2013 11:54:39 +0200GCD_Poly_ML: conversions term <--> poly
Walther Neuper <neuper@ist.tugraz.at> [Sat, 24 Aug 2013 11:54:39 +0200] rev 52087
GCD_Poly_ML: conversions term <--> poly

not contained in GCD_Poly_ML, because the latter is meant for TUM,
while conversions use lots of Isac tools.

Sat, 24 Aug 2013 11:23:34 +0200GCD_Poly_ML: minimise negative coefficients
Walther Neuper <neuper@ist.tugraz.at> [Sat, 24 Aug 2013 11:23:34 +0200] rev 52086
GCD_Poly_ML: minimise negative coefficients

Sat, 24 Aug 2013 11:18:43 +0200GCD_Poly_ML: reformat specific part of rewriter
Walther Neuper <neuper@ist.tugraz.at> [Sat, 24 Aug 2013 11:18:43 +0200] rev 52085
GCD_Poly_ML: reformat specific part of rewriter

TODO: ?has prepat been replaced by checks in SML-code?
# new test doesn't work (which might be a quick mistake in the sequence)
# prepat is used by order_add_ and order_mult

Fri, 23 Aug 2013 09:32:05 +0200GCD_Poly_ML: start integration into Isac by commenting datatypes
Walther Neuper <neuper@ist.tugraz.at> [Fri, 23 Aug 2013 09:32:05 +0200] rev 52084
GCD_Poly_ML: start integration into Isac by commenting datatypes

In multi-step execution "reverse rewriting" worked only as passive presentation
without any interaction. So the functions init_state, locate_rule etc are just dummies.

Sat, 17 Aug 2013 15:45:36 +0200tuned
Walther Neuper <neuper@ist.tugraz.at> [Sat, 17 Aug 2013 15:45:36 +0200] rev 52083
tuned

Sat, 17 Aug 2013 15:43:24 +0200unsuccessful investigation of failing evaluation
Walther Neuper <neuper@ist.tugraz.at> [Sat, 17 Aug 2013 15:43:24 +0200] rev 52082
unsuccessful investigation of failing evaluation

Wed, 14 Aug 2013 17:14:11 +0200large numerals: which evaluation strategy is used ?
Walther Neuper <neuper@ist.tugraz.at> [Wed, 14 Aug 2013 17:14:11 +0200] rev 52081
large numerals: which evaluation strategy is used ?

Wed, 14 Aug 2013 16:30:47 +0200GCD_Poly: Euclidean algorithm evaluates efficiently with large numerals
Walther Neuper <neuper@ist.tugraz.at> [Wed, 14 Aug 2013 16:30:47 +0200] rev 52080
GCD_Poly: Euclidean algorithm evaluates efficiently with large numerals

In comparison to ab40ffae86a8 just a type conversion nat --> int was removed.

Wed, 14 Aug 2013 14:32:18 +0200tuned
Walther Neuper <neuper@ist.tugraz.at> [Wed, 14 Aug 2013 14:32:18 +0200] rev 52079
tuned

Wed, 14 Aug 2013 14:05:40 +0200suggestions for representation of calculations and interaction by Lucas-Interpretation
Walther Neuper <neuper@ist.tugraz.at> [Wed, 14 Aug 2013 14:05:40 +0200] rev 52078
suggestions for representation of calculations and interaction by Lucas-Interpretation

The suggestions follow from the case study with the Euclidean algorithm and polynomial division.
Ad-hoc statement on requirements implied by these suggestions.