author | wenzelm |

Mon Dec 31 12:25:11 2012 +0100 (2012-12-31) | |

changeset 50645 | cb8f93361e86 |

parent 50644 | d15f1c39401c |

child 50646 | c02e6a75aa3f |

recovered Isabelle2012 NEWS from ae12b92c145a, except for e5420161d11d;

1.1 --- a/NEWS Mon Dec 31 12:09:51 2012 +0100 1.2 +++ b/NEWS Mon Dec 31 12:25:11 2012 +0100 1.3 @@ -4854,7 +4854,7 @@ 1.4 type and generates all solutions by prolog-style backwards proof using 1.5 the declared rules. 1.6 1.7 -This setup also deals with rules like 1.8 +This setup also deals with rules like 1.9 1.10 "is_measure f ==> is_measure (list_size f)" 1.11 1.12 @@ -5626,7 +5626,7 @@ 1.13 rewrites now. That is, trace_simp_depth_limit is set to 1 by 1.14 default. Thus there is less danger of being flooded by the trace. The 1.15 trace indicates where parts have been suppressed. 1.16 - 1.17 + 1.18 * Provers/classical: removed obsolete classical version of elim_format 1.19 attribute; classical elim/dest rules are now treated uniformly when 1.20 manipulating the claset. 1.21 @@ -5665,7 +5665,7 @@ 1.22 Examples are in the directory MetisExamples. WARNING: the 1.23 Isabelle/HOL-Metis integration does not yet work properly with 1.24 multi-threading. 1.25 - 1.26 + 1.27 * Command 'sledgehammer' invokes external automatic theorem provers as 1.28 background processes. It generates calls to the "metis" method if 1.29 successful. These can be pasted into the proof. Users do not have to 1.30 @@ -6031,7 +6031,7 @@ 1.31 users are encouraged to use the new package. 1.32 1.33 * Method "lexicographic_order" automatically synthesizes termination 1.34 -relations as lexicographic combinations of size measures. 1.35 +relations as lexicographic combinations of size measures. 1.36 1.37 * Case-expressions allow arbitrary constructor-patterns (including 1.38 "_") and take their order into account, like in functional 1.39 @@ -6115,7 +6115,7 @@ 1.40 (K x) r The K-combinator that is internally used is called K_record. 1.41 INCOMPATIBILITY: Usage of the plain update functions has to be 1.42 adapted. 1.43 - 1.44 + 1.45 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0 1.46 * x = 0, which are required for a semiring. Richer structures do not 1.47 inherit from semiring_0 anymore, because this property is a theorem 1.48 @@ -7011,19 +7011,19 @@ 1.49 mult_neg_le now named mult_nonpos_nonpos 1.50 1.51 * The following lemmas in Ring_and_Field have been added to the simplifier: 1.52 - 1.53 + 1.54 zero_le_square 1.55 - not_square_less_zero 1.56 + not_square_less_zero 1.57 1.58 The following lemmas have been deleted from Real/RealPow: 1.59 - 1.60 + 1.61 realpow_zero_zero 1.62 realpow_two 1.63 realpow_less 1.64 zero_le_power 1.65 realpow_two_le 1.66 abs_realpow_two 1.67 - realpow_two_abs 1.68 + realpow_two_abs 1.69 1.70 * Theory Parity: added rules for simplifying exponents. 1.71