NEWS
changeset 54671 d64a4ef26edb
parent 54664 9dd9d0f023be
parent 54632 7a14f831d02d
child 54672 748778ac0ab8
equal deleted inserted replaced
54670:cfb21e03fe2a 54671:d64a4ef26edb
     1 Isabelle NEWS -- history user-relevant changes
     1 Isabelle NEWS -- history user-relevant changes
     2 ==============================================
     2 ==============================================
       
     3 
       
     4 New in this Isabelle version
       
     5 ----------------------------
       
     6 
       
     7 *** Prover IDE -- Isabelle/Scala/jEdit ***
       
     8 
       
     9 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
       
    10 Open text buffers take precedence over copies within the file-system.
       
    11 
       
    12 
       
    13 *** HOL ***
       
    14 
       
    15 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
       
    16 INCOMPATIBILITY.
       
    17 
       
    18 * Fact generalization and consolidation:
       
    19     neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
       
    20 INCOMPATIBILITY.
       
    21 
       
    22 * Purely algebraic definition of even.  Fact generalization and consolidation:
       
    23     nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
       
    24     even_zero_(nat|int) ~> even_zero
       
    25 INCOMPATIBILITY.
       
    26 
       
    27 * Abolished neg_numeral.
       
    28   * Canonical representation for minus one is "- 1".
       
    29   * Canonical representation for other negative numbers is "- (numeral _)".
       
    30   * When devising rule sets for number calculation, consider the
       
    31     following canonical cases: 0, 1, numeral _, - 1, - numeral _.
       
    32   * HOLogic.dest_number also recognizes numerals in non-canonical forms
       
    33     like "numeral One", "- numeral One", "- 0" and even "- … - _".
       
    34   * Syntax for negative numerals is mere input syntax.
       
    35 INCOMPATBILITY.
       
    36 
       
    37 * Elimination of fact duplicates:
       
    38     equals_zero_I ~> minus_unique
       
    39     diff_eq_0_iff_eq ~> right_minus_eq
       
    40     nat_infinite ~> infinite_UNIV_nat
       
    41     int_infinite ~> infinite_UNIV_int
       
    42 INCOMPATIBILITY.
       
    43 
       
    44 * Fact name consolidation:
       
    45     diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
       
    46     minus_le_self_iff ~> neg_less_eq_nonneg
       
    47     le_minus_self_iff ~> less_eq_neg_nonpos
       
    48     neg_less_nonneg ~> neg_less_pos
       
    49     less_minus_self_iff ~> less_neg_neg [simp]
       
    50 INCOMPATIBILITY.
       
    51 
       
    52 * More simplification rules on unary and binary minus:
       
    53 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
       
    54 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
       
    55 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
       
    56 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
       
    57 minus_add_cancel, uminus_add_conv_diff.  These correspondingly
       
    58 have been taken away from fact collections algebra_simps and
       
    59 field_simps.  INCOMPATIBILITY.
       
    60 
       
    61 To restore proofs, the following patterns are helpful:
       
    62 
       
    63 a) Arbitrary failing proof not involving "diff_def":
       
    64 Consider simplification with algebra_simps or field_simps.
       
    65 
       
    66 b) Lifting rules from addition to subtraction:
       
    67 Try with "using <rule for addition> of [… "- _" …]" by simp".
       
    68 
       
    69 c) Simplification with "diff_def": just drop "diff_def".
       
    70 Consider simplification with algebra_simps or field_simps;
       
    71 or the brute way with
       
    72 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
       
    73 
       
    74 * SUP and INF generalized to conditionally_complete_lattice
       
    75 
       
    76 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
       
    77 Conditionally_Complete_Lattices.   INCOMPATIBILITY.
       
    78 
       
    79 * Introduce bdd_above and bdd_below in Conditionally_Complete_Lattices, use them
       
    80 instead of explicitly stating boundedness of sets.
       
    81 
       
    82 * ccpo.admissible quantifies only over non-empty chains to allow
       
    83 more syntax-directed proof rules; the case of the empty chain
       
    84 shows up as additional case in fixpoint induction proofs.
       
    85 INCOMPATIBILITY
       
    86 
       
    87 *** ML ***
       
    88 
       
    89 * Toplevel function "use" refers to raw ML bootstrap environment,
       
    90 without Isar context nor antiquotations.  Potential INCOMPATIBILITY.
       
    91 Note that 'ML_file' is the canonical command to load ML files into the
       
    92 formal context.
       
    93 
       
    94 
     3 
    95 
     4 New in Isabelle2013-2 (December 2013)
    96 New in Isabelle2013-2 (December 2013)
     5 -------------------------------------
    97 -------------------------------------
     6 
    98 
     7 *** Prover IDE -- Isabelle/Scala/jEdit ***
    99 *** Prover IDE -- Isabelle/Scala/jEdit ***
   454     map_id' ~> map_id
   546     map_id' ~> map_id
   455     sels ~> sel
   547     sels ~> sel
   456     set_map' ~> set_map
   548     set_map' ~> set_map
   457     sets ~> set
   549     sets ~> set
   458 IMCOMPATIBILITY.
   550 IMCOMPATIBILITY.
       
   551 
       
   552 * Nitpick:
       
   553   - Fixed soundness bug whereby mutually recursive datatypes could take
       
   554     infinite values.
   459 
   555 
   460 
   556 
   461 *** ML ***
   557 *** ML ***
   462 
   558 
   463 * Spec_Check is a Quickcheck tool for Isabelle/ML.  The ML function
   559 * Spec_Check is a Quickcheck tool for Isabelle/ML.  The ML function