wenzelm [Mon, 01 Aug 2005 19:20:26 +0200] rev 16973
simprocs: Simplifier.inherit_bounds;
wenzelm [Mon, 01 Aug 2005 19:20:25 +0200] rev 16972
no eq_sym_conv;
tuned;
wenzelm [Mon, 01 Aug 2005 19:20:24 +0200] rev 16971
removed read_cterm;
tuned;
wenzelm [Mon, 01 Aug 2005 19:20:23 +0200] rev 16970
tuned msg;
wenzelm [Mon, 01 Aug 2005 19:20:22 +0200] rev 16969
PolyML.Compiler.printInAlphabeticalOrder := false;
wenzelm [Mon, 01 Aug 2005 19:20:21 +0200] rev 16968
polyml: use polyml-platform/version from Isabelle distribution;
removed DEFS_CHAIN_HISTORY;
wenzelm [Mon, 01 Aug 2005 14:40:21 +0200] rev 16967
obsolete;
obua [Mon, 01 Aug 2005 11:39:33 +0200] rev 16966
1. changed configuration variables for linear programming (Cplex_tools):
LP_SOLVER is either CPLEX or GLPK
CPLEX_PATH is the path to the cplex binary
GLPK_PATH is the path to the glpk binary
The change makes it possible to switch between glpk and cplex at runtime.
2. moved conflicting list theories out of Library.thy into ROOT.ML
nipkow [Mon, 01 Aug 2005 11:24:19 +0200] rev 16965
added map_filter lemmas
kleing [Mon, 01 Aug 2005 03:27:31 +0200] rev 16964
Ordering is now: first by number of assumptions, second by the substitution size.
Treat elim/dest rules like erule/drule would:
* "elim" is now a subset of "dest" and matches on conclusion of goal and
major premise against any premise of goal. Computed substitution size
takes both into account.
* "dest" no longer has a restriction that limits its conclusion to a var.
(contributed by Raf)