src/Provers/Arith/cancel_numeral_factor.ML
2015-09-09 wenzelm 2015-09-09 simplified simproc programming interfaces;
2015-07-18 wenzelm 2015-07-18 prefer tactics with explicit context;
2015-02-11 wenzelm 2015-02-11 proper context; tuned whitespace;
2013-04-18 wenzelm 2013-04-18 simplifier uses proper Proof.context instead of historic type simpset;
2011-09-17 haftmann 2011-09-17 dropped unused argument – avoids problem with SML/NJ
2011-06-29 wenzelm 2011-06-29 tuned signature;
2010-03-13 wenzelm 2010-03-13 removed old CVS Ids; tuned headers;
2007-09-18 wenzelm 2007-09-18 simplified type int (eliminated IntInf.int, integer);
2007-06-05 haftmann 2007-06-05 tuned integers
2006-07-12 wenzelm 2006-07-12 prove_conv: Variable.import_terms instead of Term.addhoc_freeze_vars; tuned;
2006-07-08 wenzelm 2006-07-08 simprocs: no theory argument -- use simpset context instead;
2005-08-01 wenzelm 2005-08-01 simprocs: Simplifier.inherit_bounds;
2005-05-16 paulson 2005-05-16 Use of IntInf.int instead of int in most numeric simprocs; avoids integer overflow in SML/NJ
2005-03-03 skalberg 2005-03-03 Move towards standard functions.
2005-02-13 skalberg 2005-02-13 Deleted Library.option type.
2004-07-08 wenzelm 2004-07-08 adapted type of simprocs;
2002-08-08 wenzelm 2002-08-08 adhoc_freeze_vars;
2000-12-13 paulson 2000-12-13 tries harder to remove negative literals, e.g. -2*x = 0 goes to x=0 rather than -x=0.
2000-11-29 paulson 2000-11-29 simproc for cancelling common factors around = < <= div /