NEWS
author wenzelm
Mon Feb 17 22:39:20 2014 +0100 (2014-02-17)
changeset 55547 384bfd19ee61
parent 55536 56ebc4d4d008
child 55580 d12a13713cb4
permissions -rw-r--r--
subtle change of semantics of Thm.eq_thm, e.g. relevant for merge of src/HOL/Tools/Predicate_Compile/core_data.ML (cf. HOL-IMP);
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@54055
     4
New in this Isabelle version
wenzelm@54055
     5
----------------------------
wenzelm@54055
     6
wenzelm@54702
     7
*** General ***
wenzelm@54702
     8
wenzelm@54702
     9
* Document antiquotation @{url} produces markup for the given URL,
wenzelm@54702
    10
which results in an active hyperlink within the text.
wenzelm@54702
    11
wenzelm@54705
    12
* Document antiquotation @{file_unchecked} is like @{file}, but does
wenzelm@54705
    13
not check existence within the file-system.
wenzelm@54705
    14
wenzelm@54732
    15
* Discontinued legacy_isub_isup, which was a temporary Isabelle/ML
wenzelm@54732
    16
workaround in Isabelle2013-1.  The prover process no longer accepts
wenzelm@54732
    17
old identifier syntax with \<^isub> or \<^isup>.
wenzelm@54732
    18
wenzelm@55029
    19
* Syntax of document antiquotation @{rail} now uses \<newline> instead
wenzelm@55029
    20
of "\\", to avoid the optical illusion of escaped backslash within
wenzelm@55029
    21
string token.  Minor INCOMPATIBILITY.
wenzelm@55029
    22
wenzelm@55122
    23
* Lexical syntax (inner and outer) supports text cartouches with
wenzelm@55122
    24
arbitrary nesting, and without escapes of quotes etc.
wenzelm@55122
    25
wenzelm@54702
    26
wenzelm@54533
    27
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@54533
    28
wenzelm@54533
    29
* Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
wenzelm@54533
    30
Open text buffers take precedence over copies within the file-system.
wenzelm@54533
    31
wenzelm@55536
    32
* Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
wenzelm@55536
    33
auxiliary ML files.
wenzelm@55536
    34
wenzelm@54688
    35
* Document panel: simplied interaction where every single mouse click
wenzelm@54688
    36
(re)opens document via desktop environment or as jEdit buffer.
wenzelm@54688
    37
wenzelm@54881
    38
* Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
wenzelm@54881
    39
General") allows to specify additional print modes for the prover
wenzelm@54881
    40
process, without requiring old-fashioned command-line invocation of
wenzelm@54881
    41
"isabelle jedit -m MODE".
wenzelm@54881
    42
lars@55316
    43
* New panel: Simplifier trace.  Provides an interactive view of the
lars@55316
    44
simplification process, enabled by the newly-introduced
lars@55316
    45
"simplifier_trace" declaration.
lars@55316
    46
wenzelm@54533
    47
wenzelm@55001
    48
*** Pure ***
wenzelm@55001
    49
wenzelm@55385
    50
* Low-level type-class commands 'classes', 'classrel', 'arities' have
wenzelm@55385
    51
been discontinued to avoid the danger of non-trivial axiomatization
wenzelm@55385
    52
that is not immediately visible.  INCOMPATIBILITY, use regular
wenzelm@55385
    53
'instance' with proof.  The required OFCLASS(...) theorem might be
wenzelm@55385
    54
postulated via 'axiomatization' beforehand, or the proof finished
wenzelm@55385
    55
trivially if the underlying class definition is made vacuous (without
wenzelm@55385
    56
any assumptions).  See also Isabelle/ML operations
wenzelm@55385
    57
Axclass.axiomatize_class, Axclass.axiomatize_classrel,
wenzelm@55385
    58
Axclass.axiomatize_arity.
wenzelm@55385
    59
wenzelm@55143
    60
* Attributes "where" and "of" allow an optional context of local
wenzelm@55143
    61
variables ('for' declaration): these variables become schematic in the
wenzelm@55143
    62
instantiated theorem.
wenzelm@55143
    63
wenzelm@55152
    64
* Obsolete attribute "standard" has been discontinued (legacy since
wenzelm@55152
    65
Isabelle2012).  Potential INCOMPATIBILITY, use explicit 'for' context
wenzelm@55152
    66
where instantiations with schematic variables are intended (for
wenzelm@55152
    67
declaration commands like 'lemmas' or attributes like "of").  The
wenzelm@55152
    68
following temporary definition may help to port old applications:
wenzelm@55152
    69
wenzelm@55152
    70
  attribute_setup standard =
wenzelm@55152
    71
    "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
wenzelm@55152
    72
wenzelm@55001
    73
* More thorough check of proof context for goal statements and
wenzelm@55006
    74
attributed fact expressions (concerning background theory, declared
wenzelm@55006
    75
hyps).  Potential INCOMPATIBILITY, tools need to observe standard
wenzelm@55006
    76
context discipline.  See also Assumption.add_assumes and the more
wenzelm@55006
    77
primitive Thm.assume_hyps.
wenzelm@55001
    78
wenzelm@55108
    79
* Inner syntax token language allows regular quoted strings "..."
wenzelm@55108
    80
(only makes sense in practice, if outer syntax is delimited
wenzelm@55108
    81
differently).
wenzelm@55108
    82
wenzelm@55001
    83
haftmann@54227
    84
*** HOL ***
haftmann@54227
    85
wenzelm@55139
    86
* Simproc "finite_Collect" is no longer enabled by default, due to
wenzelm@55139
    87
spurious crashes and other surprises.  Potential INCOMPATIBILITY.
wenzelm@55139
    88
blanchet@55098
    89
* Moved new (co)datatype package and its dependencies from "HOL-BNF" to "HOL".
blanchet@55098
    90
  The "bnf", "wrap_free_constructors", "datatype_new", "codatatype",
blanchet@55098
    91
  "primrec_new", "primcorec", and "primcorecursive" command are now part of
blanchet@55098
    92
  "Main".
blanchet@55098
    93
  Theory renamings:
blanchet@55098
    94
    FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
blanchet@55098
    95
    Library/Wfrec.thy ~> Wfrec.thy
blanchet@55098
    96
    Library/Zorn.thy ~> Zorn.thy
blanchet@55098
    97
    Cardinals/Order_Relation.thy ~> Order_Relation.thy
blanchet@55098
    98
    Library/Order_Union.thy ~> Cardinals/Order_Union.thy
blanchet@55098
    99
    Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
blanchet@55098
   100
    Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
blanchet@55098
   101
    Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
blanchet@55098
   102
    Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
blanchet@55098
   103
    Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
blanchet@55098
   104
    BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
blanchet@55098
   105
    BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
blanchet@55098
   106
    BNF/BNF_Comp.thy ~> BNF_Comp.thy
blanchet@55098
   107
    BNF/BNF_Def.thy ~> BNF_Def.thy
blanchet@55098
   108
    BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
blanchet@55098
   109
    BNF/BNF_GFP.thy ~> BNF_GFP.thy
blanchet@55098
   110
    BNF/BNF_LFP.thy ~> BNF_LFP.thy
blanchet@55098
   111
    BNF/BNF_Util.thy ~> BNF_Util.thy
blanchet@55098
   112
    BNF/Coinduction.thy ~> Coinduction.thy
blanchet@55098
   113
    BNF/More_BNFs.thy ~> Library/More_BNFs.thy
blanchet@55098
   114
    BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
blanchet@55098
   115
    BNF/Examples/* ~> BNF_Examples/*
blanchet@55098
   116
  New theories:
blanchet@55098
   117
    List_Prefix.thy (split from Library/Sublist.thy)
blanchet@55098
   118
    Wellorder_Extension.thy (split from Zorn.thy)
blanchet@55098
   119
    Library/Cardinal_Notations.thy
blanchet@55098
   120
    Library/BNF_Decl.thy
blanchet@55098
   121
    BNF_Examples/Misc_Primcorec.thy
blanchet@55098
   122
    BNF_Examples/Stream_Processor.thy
blanchet@55519
   123
  Discontinued theories:
blanchet@55098
   124
    BNF/BNF.thy
blanchet@55098
   125
    BNF/Equiv_Relations_More.thy
blanchet@55533
   126
  Renamed commands:
blanchet@55533
   127
    datatype_new_compat ~> datatype_compat
blanchet@55533
   128
    primrec_new ~> primrec
blanchet@55519
   129
    wrap_free_constructors ~> free_constructors
blanchet@55519
   130
  INCOMPATIBILITY.
blanchet@55098
   131
blanchet@55425
   132
* Old datatype package:
blanchet@55425
   133
  * Generated constants "xxx_case" and "xxx_rec" have been renamed "case_xxx"
blanchet@55519
   134
    and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
blanchet@55425
   135
    INCOMPATIBILITY.
blanchet@55425
   136
blanchet@55524
   137
* The types "'a list" and "'a option", their set and map functions, their
blanchet@55524
   138
  relators, and their selectors are now produced using the new BNF-based datatype
blanchet@55524
   139
  package.
blanchet@55519
   140
  Renamed constants:
blanchet@55519
   141
    Option.set ~> set_option
blanchet@55519
   142
    Option.map ~> map_option
blanchet@55525
   143
    option_rel ~> rel_option
blanchet@55519
   144
  Renamed theorems:
blanchet@55519
   145
    map_def ~> map_rec[abs_def]
blanchet@55519
   146
    Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
blanchet@55524
   147
    list_all2_def ~> list_all2_iff
blanchet@55519
   148
    map.simps ~> list.map
blanchet@55519
   149
    hd.simps ~> list.sel(1)
blanchet@55519
   150
    tl.simps ~> list.sel(2-3)
blanchet@55519
   151
    the.simps ~> option.sel
blanchet@55519
   152
  INCOMPATIBILITY.
blanchet@55519
   153
blanchet@55098
   154
* New theory:
blanchet@55098
   155
    Cardinals/Ordinal_Arithmetic.thy
blanchet@55098
   156
blanchet@55098
   157
* Theory reorganizations:
blanchet@55098
   158
  * Big_Operators.thy ~> Groups_Big.thy and Lattices_Big.thy
blanchet@55098
   159
blanchet@55183
   160
* Sledgehammer:
blanchet@55289
   161
  - New option:
blanchet@55297
   162
      smt_proofs
blanchet@55183
   163
  - Renamed options:
blanchet@55183
   164
      isar_compress ~> compress_isar
blanchet@55183
   165
      isar_try0 ~> try0_isar
blanchet@55183
   166
    INCOMPATIBILITY.
blanchet@55183
   167
blanchet@55315
   168
* Metis:
blanchet@55315
   169
  - Removed legacy proof method 'metisFT'. Use 'metis (full_types)' instead.
blanchet@55315
   170
    INCOMPATIBILITY.
blanchet@55315
   171
blanchet@55183
   172
* Try0: Added 'algebra' and 'meson' to the set of proof methods.
blanchet@55183
   173
blanchet@55519
   174
* Command renaming: enriched_type ~> functor. INCOMPATIBILITY.
blanchet@55519
   175
wenzelm@55015
   176
* The symbol "\<newline>" may be used within char or string literals
wenzelm@55015
   177
to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
wenzelm@55015
   178
wenzelm@55007
   179
* Activation of Z3 now works via "z3_non_commercial" system option
wenzelm@55007
   180
(without requiring restart), instead of former settings variable
wenzelm@55007
   181
"Z3_NON_COMMERCIAL".  The option can be edited in Isabelle/jEdit menu
wenzelm@55007
   182
Plugin Options / Isabelle / General.
wenzelm@55007
   183
wenzelm@54893
   184
* "declare [[code abort: ...]]" replaces "code_abort ...".
wenzelm@54893
   185
INCOMPATIBILITY.
wenzelm@54893
   186
wenzelm@54893
   187
* "declare [[code drop: ...]]" drops all code equations associated
haftmann@54890
   188
with the given constants.
haftmann@54890
   189
haftmann@54864
   190
* Abolished slightly odd global lattice interpretation for min/max.
haftmann@54864
   191
haftmann@54864
   192
Fact consolidations:
haftmann@54864
   193
    min_max.inf_assoc ~> min.assoc
haftmann@54864
   194
    min_max.inf_commute ~> min.commute
haftmann@54864
   195
    min_max.inf_left_commute ~> min.left_commute
haftmann@54864
   196
    min_max.inf_idem ~> min.idem
haftmann@54864
   197
    min_max.inf_left_idem ~> min.left_idem
haftmann@54864
   198
    min_max.inf_right_idem ~> min.right_idem
haftmann@54864
   199
    min_max.sup_assoc ~> max.assoc
haftmann@54864
   200
    min_max.sup_commute ~> max.commute
haftmann@54864
   201
    min_max.sup_left_commute ~> max.left_commute
haftmann@54864
   202
    min_max.sup_idem ~> max.idem
haftmann@54864
   203
    min_max.sup_left_idem ~> max.left_idem
haftmann@54864
   204
    min_max.sup_inf_distrib1 ~> max_min_distrib2
haftmann@54864
   205
    min_max.sup_inf_distrib2 ~> max_min_distrib1
haftmann@54864
   206
    min_max.inf_sup_distrib1 ~> min_max_distrib2
haftmann@54864
   207
    min_max.inf_sup_distrib2 ~> min_max_distrib1
haftmann@54864
   208
    min_max.distrib ~> min_max_distribs
haftmann@54864
   209
    min_max.inf_absorb1 ~> min.absorb1
haftmann@54864
   210
    min_max.inf_absorb2 ~> min.absorb2
haftmann@54864
   211
    min_max.sup_absorb1 ~> max.absorb1
haftmann@54864
   212
    min_max.sup_absorb2 ~> max.absorb2
haftmann@54864
   213
    min_max.le_iff_inf ~> min.absorb_iff1
haftmann@54864
   214
    min_max.le_iff_sup ~> max.absorb_iff2
haftmann@54864
   215
    min_max.inf_le1 ~> min.cobounded1
haftmann@54864
   216
    min_max.inf_le2 ~> min.cobounded2
haftmann@54864
   217
    le_maxI1, min_max.sup_ge1 ~> max.cobounded1
haftmann@54864
   218
    le_maxI2, min_max.sup_ge2 ~> max.cobounded2
haftmann@54864
   219
    min_max.le_infI1 ~> min.coboundedI1
haftmann@54864
   220
    min_max.le_infI2 ~> min.coboundedI2
haftmann@54864
   221
    min_max.le_supI1 ~> max.coboundedI1
haftmann@54864
   222
    min_max.le_supI2 ~> max.coboundedI2
haftmann@54864
   223
    min_max.less_infI1 ~> min.strict_coboundedI1
haftmann@54864
   224
    min_max.less_infI2 ~> min.strict_coboundedI2
haftmann@54864
   225
    min_max.less_supI1 ~> max.strict_coboundedI1
haftmann@54864
   226
    min_max.less_supI2 ~> max.strict_coboundedI2
haftmann@54864
   227
    min_max.inf_mono ~> min.mono
haftmann@54864
   228
    min_max.sup_mono ~> max.mono
haftmann@54864
   229
    min_max.le_infI, min_max.inf_greatest ~> min.boundedI
haftmann@54864
   230
    min_max.le_supI, min_max.sup_least ~> max.boundedI
haftmann@54864
   231
    min_max.le_inf_iff ~> min.bounded_iff
haftmann@54864
   232
    min_max.le_sup_iff ~> max.bounded_iff
haftmann@54864
   233
haftmann@54864
   234
For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
haftmann@54864
   235
min.left_commute, min.left_idem, max.commute, max.assoc,
haftmann@54864
   236
max.left_commute, max.left_idem directly.
haftmann@54864
   237
haftmann@54864
   238
For min_max.inf_sup_ord, prefer (one of) min.cobounded1, min.cobounded2,
haftmann@54864
   239
max.cobounded1m max.cobounded2 directly.
haftmann@54864
   240
haftmann@54864
   241
For min_ac or max_ac, prefor more general collection ac_simps.
haftmann@54864
   242
haftmann@54864
   243
INCOMPATBILITY. 
haftmann@54864
   244
haftmann@54850
   245
* Word library: bit representations prefer type bool over type bit.
haftmann@54850
   246
INCOMPATIBILITY.
haftmann@54850
   247
haftmann@54745
   248
* Theorem disambiguation Inf_le_Sup (on finite sets) ~> Inf_fin_le_Sup_fin.
haftmann@54850
   249
INCOMPATIBILITY.
haftmann@54745
   250
haftmann@54708
   251
* Code generations are provided for make, fields, extend and truncate
haftmann@54708
   252
operations on records.
haftmann@54708
   253
haftmann@54295
   254
* Qualified constant names Wellfounded.acc, Wellfounded.accp.
haftmann@54295
   255
INCOMPATIBILITY.
haftmann@54295
   256
haftmann@54228
   257
* Fact generalization and consolidation:
haftmann@54228
   258
    neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
haftmann@54228
   259
INCOMPATIBILITY.
haftmann@54228
   260
haftmann@54228
   261
* Purely algebraic definition of even.  Fact generalization and consolidation:
haftmann@54228
   262
    nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
haftmann@54228
   263
    even_zero_(nat|int) ~> even_zero
haftmann@54228
   264
INCOMPATIBILITY.
wenzelm@54055
   265
haftmann@54489
   266
* Abolished neg_numeral.
haftmann@54489
   267
  * Canonical representation for minus one is "- 1".
haftmann@54489
   268
  * Canonical representation for other negative numbers is "- (numeral _)".
haftmann@54502
   269
  * When devising rule sets for number calculation, consider the
haftmann@54587
   270
    following canonical cases: 0, 1, numeral _, - 1, - numeral _.
haftmann@54587
   271
  * HOLogic.dest_number also recognizes numerals in non-canonical forms
wenzelm@54893
   272
    like "numeral One", "- numeral One", "- 0" and even "- ... - _".
haftmann@54489
   273
  * Syntax for negative numerals is mere input syntax.
haftmann@54489
   274
INCOMPATBILITY.
haftmann@54489
   275
haftmann@54230
   276
* Elimination of fact duplicates:
haftmann@54230
   277
    equals_zero_I ~> minus_unique
haftmann@54230
   278
    diff_eq_0_iff_eq ~> right_minus_eq
traytel@54588
   279
    nat_infinite ~> infinite_UNIV_nat
traytel@54588
   280
    int_infinite ~> infinite_UNIV_int
haftmann@54230
   281
INCOMPATIBILITY.
haftmann@54230
   282
haftmann@54230
   283
* Fact name consolidation:
haftmann@54230
   284
    diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
haftmann@54250
   285
    minus_le_self_iff ~> neg_less_eq_nonneg
haftmann@54250
   286
    le_minus_self_iff ~> less_eq_neg_nonpos
haftmann@54250
   287
    neg_less_nonneg ~> neg_less_pos
haftmann@54250
   288
    less_minus_self_iff ~> less_neg_neg [simp]
haftmann@54230
   289
INCOMPATIBILITY.
haftmann@54230
   290
haftmann@54230
   291
* More simplification rules on unary and binary minus:
haftmann@54230
   292
add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
haftmann@54230
   293
add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
haftmann@54230
   294
add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
haftmann@54230
   295
le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
haftmann@54230
   296
minus_add_cancel, uminus_add_conv_diff.  These correspondingly
haftmann@54230
   297
have been taken away from fact collections algebra_simps and
haftmann@54230
   298
field_simps.  INCOMPATIBILITY.
haftmann@54230
   299
haftmann@54230
   300
To restore proofs, the following patterns are helpful:
haftmann@54230
   301
haftmann@54230
   302
a) Arbitrary failing proof not involving "diff_def":
haftmann@54230
   303
Consider simplification with algebra_simps or field_simps.
haftmann@54230
   304
haftmann@54230
   305
b) Lifting rules from addition to subtraction:
wenzelm@54893
   306
Try with "using <rule for addition> of [... "- _" ...]" by simp".
haftmann@54230
   307
haftmann@54230
   308
c) Simplification with "diff_def": just drop "diff_def".
haftmann@54230
   309
Consider simplification with algebra_simps or field_simps;
haftmann@54230
   310
or the brute way with
haftmann@54230
   311
"simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
haftmann@54230
   312
hoelzl@54264
   313
* SUP and INF generalized to conditionally_complete_lattice
hoelzl@54264
   314
hoelzl@54264
   315
* Theory Lubs moved HOL image to HOL-Library. It is replaced by
hoelzl@54264
   316
Conditionally_Complete_Lattices.   INCOMPATIBILITY.
hoelzl@54264
   317
hoelzl@54264
   318
* Introduce bdd_above and bdd_below in Conditionally_Complete_Lattices, use them
hoelzl@54264
   319
instead of explicitly stating boundedness of sets.
hoelzl@54264
   320
Andreas@54631
   321
* ccpo.admissible quantifies only over non-empty chains to allow
Andreas@54631
   322
more syntax-directed proof rules; the case of the empty chain
Andreas@54631
   323
shows up as additional case in fixpoint induction proofs.
Andreas@54631
   324
INCOMPATIBILITY
hoelzl@54264
   325
boehmes@55049
   326
* Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
boehmes@55049
   327
wenzelm@54672
   328
* Nitpick:
wenzelm@54672
   329
  - Fixed soundness bug whereby mutually recursive datatypes could take
wenzelm@54672
   330
    infinite values.
wenzelm@54672
   331
immler@54787
   332
* HOL-Multivariate_Analysis:
immler@54787
   333
  - type class ordered_real_vector for ordered vector spaces
immler@54787
   334
  - changed order of ordered_euclidean_space to be compatible with
immler@54787
   335
    pointwise ordering on products. Therefore instance of
immler@54787
   336
    conditionally_complete_lattice and ordered_real_vector.
immler@54787
   337
    INCOMPATIBILITY: use box instead of greaterThanLessThan or
immler@54787
   338
    explicit set-comprehensions with eucl_less for other (half-) open
immler@54787
   339
    intervals.
immler@54787
   340
wenzelm@54672
   341
wenzelm@54449
   342
*** ML ***
wenzelm@54449
   343
wenzelm@55143
   344
* Proper context discipline for read_instantiate and instantiate_tac:
wenzelm@55143
   345
variables that are meant to become schematic need to be given as
wenzelm@55143
   346
fixed, and are generalized by the explicit context of local variables.
wenzelm@55143
   347
This corresponds to Isar attributes "where" and "of" with 'for'
wenzelm@55143
   348
declaration.  INCOMPATIBILITY, also due to potential change of indices
wenzelm@55143
   349
of schematic variables.
wenzelm@55143
   350
wenzelm@54449
   351
* Toplevel function "use" refers to raw ML bootstrap environment,
wenzelm@54449
   352
without Isar context nor antiquotations.  Potential INCOMPATIBILITY.
wenzelm@54449
   353
Note that 'ML_file' is the canonical command to load ML files into the
wenzelm@54449
   354
formal context.
wenzelm@54449
   355
wenzelm@54742
   356
* Proper context for basic Simplifier operations: rewrite_rule,
wenzelm@54742
   357
rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
wenzelm@54742
   358
pass runtime Proof.context (and ensure that the simplified entity
wenzelm@54742
   359
actually belongs to it).
wenzelm@54742
   360
wenzelm@55547
   361
* Subtle change of semantics of Thm.eq_thm: theory stamps are not
wenzelm@55547
   362
compared (according to Thm.thm_ord), but assumed to be covered by the
wenzelm@55547
   363
current background theory.  Thus equivalent data produced in different
wenzelm@55547
   364
branches of the theory graph usually coincides (e.g. relevant for
wenzelm@55547
   365
theory merge).  Note that the softer Thm.eq_thm_prop is often more
wenzelm@55547
   366
appropriate than Thm.eq_thm.
wenzelm@55547
   367
wenzelm@54449
   368
wenzelm@54683
   369
*** System ***
wenzelm@54683
   370
wenzelm@54683
   371
* Simplified "isabelle display" tool.  Settings variables DVI_VIEWER
wenzelm@54683
   372
and PDF_VIEWER now refer to the actual programs, not shell
wenzelm@54683
   373
command-lines.  Discontinued option -c: invocation may be asynchronous
wenzelm@54683
   374
via desktop environment, without any special precautions.  Potential
wenzelm@54683
   375
INCOMPATIBILITY with ambitious private settings.
wenzelm@54683
   376
wenzelm@54683
   377
* Improved 'display_drafts' concerning desktop integration and
wenzelm@54683
   378
repeated invocation in PIDE front-end: re-use single file
wenzelm@54683
   379
$ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
wenzelm@54683
   380
wenzelm@54683
   381
wenzelm@54449
   382
wenzelm@54639
   383
New in Isabelle2013-2 (December 2013)
wenzelm@54639
   384
-------------------------------------
wenzelm@54639
   385
wenzelm@54639
   386
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@54639
   387
wenzelm@54639
   388
* More robust editing of running commands with internal forks,
wenzelm@54639
   389
e.g. non-terminating 'by' steps.
wenzelm@54639
   390
wenzelm@54641
   391
* More relaxed Sledgehammer panel: avoid repeated application of query
wenzelm@54641
   392
after edits surrounding the command location.
wenzelm@54641
   393
wenzelm@54648
   394
* More status information about commands that are interrupted
wenzelm@54648
   395
accidentally (via physical event or Poly/ML runtime system signal,
wenzelm@54648
   396
e.g. out-of-memory).
wenzelm@54648
   397
wenzelm@54653
   398
wenzelm@54653
   399
*** System ***
wenzelm@54653
   400
wenzelm@54653
   401
* More robust termination of external processes managed by
wenzelm@54664
   402
Isabelle/ML: support cancellation of tasks within the range of
wenzelm@54664
   403
milliseconds, as required for PIDE document editing with automatically
wenzelm@54664
   404
tried tools (e.g. Sledgehammer).
wenzelm@54653
   405
wenzelm@54648
   406
* Reactivated Isabelle/Scala kill command for external processes on
wenzelm@54648
   407
Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
wenzelm@54648
   408
workaround for some Debian/Ubuntu Linux versions from 2013.
wenzelm@54648
   409
wenzelm@54639
   410
wenzelm@54639
   411
wenzelm@53971
   412
New in Isabelle2013-1 (November 2013)
wenzelm@53971
   413
-------------------------------------
wenzelm@50994
   414
wenzelm@51293
   415
*** General ***
wenzelm@51293
   416
wenzelm@53971
   417
* Discontinued obsolete 'uses' within theory header.  Note that
wenzelm@53971
   418
commands like 'ML_file' work without separate declaration of file
wenzelm@53971
   419
dependencies.  Minor INCOMPATIBILITY.
wenzelm@53971
   420
wenzelm@53971
   421
* Discontinued redundant 'use' command, which was superseded by
wenzelm@53971
   422
'ML_file' in Isabelle2013.  Minor INCOMPATIBILITY.
wenzelm@53971
   423
wenzelm@53016
   424
* Simplified subscripts within identifiers, using plain \<^sub>
wenzelm@53016
   425
instead of the second copy \<^isub> and \<^isup>.  Superscripts are
wenzelm@53016
   426
only for literal tokens within notation; explicit mixfix annotations
wenzelm@53016
   427
for consts or fixed variables may be used as fall-back for unusual
wenzelm@53016
   428
names.  Obsolete \<twosuperior> has been expanded to \<^sup>2 in
wenzelm@53016
   429
Isabelle/HOL.  INCOMPATIBILITY, use "isabelle update_sub_sup" to
wenzelm@53016
   430
standardize symbols as a starting point for further manual cleanup.
wenzelm@53016
   431
The ML reference variable "legacy_isub_isup" may be set as temporary
wenzelm@53016
   432
workaround, to make the prover accept a subset of the old identifier
wenzelm@53016
   433
syntax.
wenzelm@53016
   434
wenzelm@53021
   435
* Document antiquotations: term style "isub" has been renamed to
wenzelm@53021
   436
"sub".  Minor INCOMPATIBILITY.
wenzelm@53021
   437
wenzelm@52487
   438
* Uniform management of "quick_and_dirty" as system option (see also
wenzelm@52487
   439
"isabelle options"), configuration option within the context (see also
wenzelm@52487
   440
Config.get in Isabelle/ML), and attribute in Isabelle/Isar.  Minor
wenzelm@52487
   441
INCOMPATIBILITY, need to use more official Isabelle means to access
wenzelm@52487
   442
quick_and_dirty, instead of historical poking into mutable reference.
wenzelm@52059
   443
wenzelm@52060
   444
* Renamed command 'print_configs' to 'print_options'.  Minor
wenzelm@52060
   445
INCOMPATIBILITY.
wenzelm@52060
   446
wenzelm@52430
   447
* Proper diagnostic command 'print_state'.  Old 'pr' (with its
wenzelm@52430
   448
implicit change of some global references) is retained for now as
wenzelm@52430
   449
control command, e.g. for ProofGeneral 3.7.x.
wenzelm@52430
   450
wenzelm@52549
   451
* Discontinued 'print_drafts' command with its old-fashioned PS output
wenzelm@52549
   452
and Unix command-line print spooling.  Minor INCOMPATIBILITY: use
wenzelm@52549
   453
'display_drafts' instead and print via the regular document viewer.
wenzelm@52549
   454
wenzelm@53971
   455
* Updated and extended "isar-ref" and "implementation" manual,
wenzelm@53971
   456
eliminated old "ref" manual.
wenzelm@53971
   457
wenzelm@51293
   458
wenzelm@51533
   459
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@51533
   460
wenzelm@53971
   461
* New manual "jedit" for Isabelle/jEdit, see isabelle doc or
wenzelm@53852
   462
Documentation panel.
wenzelm@53852
   463
wenzelm@53971
   464
* Dockable window "Documentation" provides access to Isabelle
wenzelm@53971
   465
documentation.
wenzelm@52646
   466
wenzelm@52949
   467
* Dockable window "Find" provides query operations for formal entities
wenzelm@52949
   468
(GUI front-end to 'find_theorems' command).
wenzelm@52949
   469
wenzelm@53050
   470
* Dockable window "Sledgehammer" manages asynchronous / parallel
wenzelm@53050
   471
sledgehammer runs over existing document sources, independently of
wenzelm@53050
   472
normal editing and checking process.
wenzelm@53050
   473
wenzelm@51533
   474
* Dockable window "Timing" provides an overview of relevant command
wenzelm@54332
   475
timing information, depending on option jedit_timing_threshold.  The
wenzelm@54332
   476
same timing information is shown in the extended tooltip of the
wenzelm@54332
   477
command keyword, when hovering the mouse over it while the CONTROL or
wenzelm@54332
   478
COMMAND modifier is pressed.
wenzelm@51533
   479
wenzelm@53971
   480
* Improved dockable window "Theories": Continuous checking of proof
wenzelm@53971
   481
document (visible and required parts) may be controlled explicitly,
wenzelm@53971
   482
using check box or shortcut "C+e ENTER".  Individual theory nodes may
wenzelm@53971
   483
be marked explicitly as required and checked in full, using check box
wenzelm@53971
   484
or shortcut "C+e SPACE".
wenzelm@53971
   485
wenzelm@54305
   486
* Improved completion mechanism, which is now managed by the
wenzelm@54305
   487
Isabelle/jEdit plugin instead of SideKick.  Refined table of Isabelle
wenzelm@54305
   488
symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
wenzelm@54305
   489
wenzelm@54319
   490
* Standard jEdit keyboard shortcut C+b complete-word is remapped to
wenzelm@54319
   491
isabelle.complete for explicit completion in Isabelle sources.
wenzelm@54319
   492
INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
wenzelm@54319
   493
to resolve conflict.
wenzelm@54319
   494
wenzelm@54305
   495
* Improved support of various "minor modes" for Isabelle NEWS,
wenzelm@54305
   496
options, session ROOT etc., with completion and SideKick tree view.
wenzelm@54305
   497
wenzelm@53971
   498
* Strictly monotonic document update, without premature cancellation of
wenzelm@53971
   499
running transactions that are still needed: avoid reset/restart of
wenzelm@53971
   500
such command executions while editing.
wenzelm@53271
   501
wenzelm@53971
   502
* Support for asynchronous print functions, as overlay to existing
wenzelm@53971
   503
document content.
wenzelm@53971
   504
wenzelm@53971
   505
* Support for automatic tools in HOL, which try to prove or disprove
wenzelm@53971
   506
toplevel theorem statements.
wenzelm@53971
   507
wenzelm@53971
   508
* Action isabelle.reset-font-size resets main text area font size
wenzelm@54365
   509
according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
wenzelm@54365
   510
also "Plugin Options / Isabelle / General").  It can be bound to some
wenzelm@54365
   511
keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
wenzelm@53971
   512
wenzelm@53971
   513
* File specifications in jEdit (e.g. file browser) may refer to
wenzelm@54351
   514
$ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms.  Discontinued
wenzelm@54351
   515
obsolete $ISABELLE_HOME_WINDOWS variable.
wenzelm@53971
   516
wenzelm@53971
   517
* Improved support for Linux look-and-feel "GTK+", see also "Utilities
wenzelm@53971
   518
/ Global Options / Appearance".
wenzelm@53971
   519
wenzelm@53971
   520
* Improved support of native Mac OS X functionality via "MacOSX"
wenzelm@53971
   521
plugin, which is now enabled by default.
wenzelm@53971
   522
wenzelm@51533
   523
wenzelm@51313
   524
*** Pure ***
wenzelm@51313
   525
ballarin@54049
   526
* Commands 'interpretation' and 'sublocale' are now target-sensitive.
ballarin@54049
   527
In particular, 'interpretation' allows for non-persistent
ballarin@54049
   528
interpretation within "context ... begin ... end" blocks offering a
ballarin@54049
   529
light-weight alternative to 'sublocale'.  See "isar-ref" manual for
ballarin@54049
   530
details.
haftmann@51747
   531
ballarin@51565
   532
* Improved locales diagnostic command 'print_dependencies'.
ballarin@51565
   533
wenzelm@51313
   534
* Discontinued obsolete 'axioms' command, which has been marked as
wenzelm@51313
   535
legacy since Isabelle2009-2.  INCOMPATIBILITY, use 'axiomatization'
wenzelm@51313
   536
instead, while observing its uniform scope for polymorphism.
wenzelm@51313
   537
wenzelm@51316
   538
* Discontinued empty name bindings in 'axiomatization'.
wenzelm@51316
   539
INCOMPATIBILITY.
wenzelm@51316
   540
wenzelm@53971
   541
* System option "proofs" has been discontinued.  Instead the global
wenzelm@53971
   542
state of Proofterm.proofs is persistently compiled into logic images
wenzelm@53971
   543
as required, notably HOL-Proofs.  Users no longer need to change
wenzelm@53971
   544
Proofterm.proofs dynamically.  Minor INCOMPATIBILITY.
wenzelm@53971
   545
wenzelm@53971
   546
* Syntax translation functions (print_translation etc.) always depend
wenzelm@53971
   547
on Proof.context.  Discontinued former "(advanced)" option -- this is
wenzelm@53971
   548
now the default.  Minor INCOMPATIBILITY.
wenzelm@53971
   549
wenzelm@53971
   550
* Former global reference trace_unify_fail is now available as
wenzelm@53971
   551
configuration option "unify_trace_failure" (global context only).
wenzelm@53971
   552
wenzelm@52463
   553
* SELECT_GOAL now retains the syntactic context of the overall goal
wenzelm@52463
   554
state (schematic variables etc.).  Potential INCOMPATIBILITY in rare
wenzelm@52463
   555
situations.
wenzelm@52463
   556
wenzelm@51313
   557
hoelzl@51002
   558
*** HOL ***
hoelzl@51002
   559
wenzelm@54032
   560
* Stronger precedence of syntax for big intersection and union on
wenzelm@54032
   561
sets, in accordance with corresponding lattice operations.
wenzelm@54032
   562
INCOMPATIBILITY.
wenzelm@54032
   563
wenzelm@54032
   564
* Notation "{p:A. P}" now allows tuple patterns as well.
wenzelm@54032
   565
wenzelm@54032
   566
* Nested case expressions are now translated in a separate check phase
wenzelm@54032
   567
rather than during parsing. The data for case combinators is separated
wenzelm@54032
   568
from the datatype package. The declaration attribute
wenzelm@54032
   569
"case_translation" can be used to register new case combinators:
wenzelm@54032
   570
wenzelm@54032
   571
  declare [[case_translation case_combinator constructor1 ... constructorN]]
haftmann@52637
   572
haftmann@52435
   573
* Code generator:
wenzelm@53160
   574
  - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
wenzelm@53160
   575
    'code_instance'.
wenzelm@53160
   576
  - 'code_identifier' declares name hints for arbitrary identifiers in
wenzelm@53160
   577
    generated code, subsuming 'code_modulename'.
wenzelm@53983
   578
wenzelm@53983
   579
See the isar-ref manual for syntax diagrams, and the HOL theories for
wenzelm@53983
   580
examples.
haftmann@52435
   581
wenzelm@54032
   582
* Attibute 'code': 'code' now declares concrete and abstract code
wenzelm@54032
   583
equations uniformly.  Use explicit 'code equation' and 'code abstract'
wenzelm@54032
   584
to distinguish both when desired.
wenzelm@54032
   585
wenzelm@54032
   586
* Discontinued theories Code_Integer and Efficient_Nat by a more
wenzelm@54032
   587
fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
wenzelm@54032
   588
Code_Target_Nat and Code_Target_Numeral.  See the tutorial on code
wenzelm@54032
   589
generation for details.  INCOMPATIBILITY.
wenzelm@54032
   590
wenzelm@54032
   591
* Numeric types are mapped by default to target language numerals:
wenzelm@54032
   592
natural (replaces former code_numeral) and integer (replaces former
wenzelm@54032
   593
code_int).  Conversions are available as integer_of_natural /
wenzelm@54032
   594
natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
wenzelm@54032
   595
Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
wenzelm@54032
   596
ML).  INCOMPATIBILITY.
wenzelm@54032
   597
wenzelm@54032
   598
* Function package: For mutually recursive functions f and g, separate
wenzelm@54032
   599
cases rules f.cases and g.cases are generated instead of unusable
wenzelm@54032
   600
f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
wenzelm@54032
   601
in the case that the unusable rule was used nevertheless.
wenzelm@54032
   602
wenzelm@54032
   603
* Function package: For each function f, new rules f.elims are
wenzelm@54032
   604
generated, which eliminate equalities of the form "f x = t".
wenzelm@54032
   605
wenzelm@54032
   606
* New command 'fun_cases' derives ad-hoc elimination rules for
wenzelm@54032
   607
function equations as simplified instances of f.elims, analogous to
wenzelm@54032
   608
inductive_cases.  See ~~/src/HOL/ex/Fundefs.thy for some examples.
blanchet@53307
   609
kuncar@54021
   610
* Lifting:
kuncar@54021
   611
  - parametrized correspondence relations are now supported:
wenzelm@54378
   612
    + parametricity theorems for the raw term can be specified in
kuncar@54021
   613
      the command lift_definition, which allow us to generate stronger
kuncar@54021
   614
      transfer rules
kuncar@54021
   615
    + setup_lifting generates stronger transfer rules if parametric
kuncar@54021
   616
      correspondence relation can be generated
kuncar@54021
   617
    + various new properties of the relator must be specified to support
kuncar@54021
   618
      parametricity
kuncar@54021
   619
    + parametricity theorem for the Quotient relation can be specified
kuncar@54021
   620
  - setup_lifting generates domain rules for the Transfer package
kuncar@54021
   621
  - stronger reflexivity prover of respectfulness theorems for type
kuncar@54021
   622
    copies
kuncar@54021
   623
  - ===> and --> are now local. The symbols can be introduced
kuncar@54021
   624
    by interpreting the locale lifting_syntax (typically in an
kuncar@54021
   625
    anonymous context)
wenzelm@54378
   626
  - Lifting/Transfer relevant parts of Library/Quotient_* are now in
kuncar@54021
   627
    Main. Potential INCOMPATIBILITY
kuncar@54021
   628
  - new commands for restoring and deleting Lifting/Transfer context:
kuncar@54021
   629
    lifting_forget, lifting_update
wenzelm@54378
   630
  - the command print_quotmaps was renamed to print_quot_maps.
kuncar@54021
   631
    INCOMPATIBILITY
kuncar@54021
   632
kuncar@54021
   633
* Transfer:
wenzelm@54378
   634
  - better support for domains in Transfer: replace Domainp T
kuncar@54021
   635
    by the actual invariant in a transferred goal
kuncar@54021
   636
  - transfer rules can have as assumptions other transfer rules
kuncar@54021
   637
  - Experimental support for transferring from the raw level to the
kuncar@54021
   638
    abstract level: Transfer.transferred attribute
kuncar@54021
   639
  - Attribute version of the transfer method: untransferred attribute
kuncar@54021
   640
haftmann@52286
   641
* Reification and reflection:
wenzelm@53160
   642
  - Reification is now directly available in HOL-Main in structure
wenzelm@53160
   643
    "Reification".
wenzelm@53160
   644
  - Reflection now handles multiple lists with variables also.
wenzelm@53160
   645
  - The whole reflection stack has been decomposed into conversions.
haftmann@52286
   646
INCOMPATIBILITY.
haftmann@52286
   647
haftmann@51489
   648
* Revised devices for recursive definitions over finite sets:
haftmann@51489
   649
  - Only one fundamental fold combinator on finite set remains:
haftmann@51489
   650
    Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
haftmann@51489
   651
    This is now identity on infinite sets.
wenzelm@52745
   652
  - Locales ("mini packages") for fundamental definitions with
haftmann@51489
   653
    Finite_Set.fold: folding, folding_idem.
haftmann@51489
   654
  - Locales comm_monoid_set, semilattice_order_set and
haftmann@51489
   655
    semilattice_neutr_order_set for big operators on sets.
haftmann@51489
   656
    See theory Big_Operators for canonical examples.
haftmann@51489
   657
    Note that foundational constants comm_monoid_set.F and
haftmann@51489
   658
    semilattice_set.F correspond to former combinators fold_image
haftmann@51489
   659
    and fold1 respectively.  These are now gone.  You may use
haftmann@51490
   660
    those foundational constants as substitutes, but it is
wenzelm@53983
   661
    preferable to interpret the above locales accordingly.
haftmann@51489
   662
  - Dropped class ab_semigroup_idem_mult (special case of lattice,
haftmann@51489
   663
    no longer needed in connection with Finite_Set.fold etc.)
haftmann@51489
   664
  - Fact renames:
haftmann@51489
   665
      card.union_inter ~> card_Un_Int [symmetric]
haftmann@51489
   666
      card.union_disjoint ~> card_Un_disjoint
haftmann@51489
   667
INCOMPATIBILITY.
haftmann@51489
   668
haftmann@51487
   669
* Locale hierarchy for abstract orderings and (semi)lattices.
haftmann@51487
   670
wenzelm@53526
   671
* Complete_Partial_Order.admissible is defined outside the type class
wenzelm@53526
   672
ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
wenzelm@53526
   673
class predicate assumption or sort constraint when possible.
Andreas@53362
   674
INCOMPATIBILITY.
Andreas@53362
   675
wenzelm@53160
   676
* Introduce type class "conditionally_complete_lattice": Like a
wenzelm@53160
   677
complete lattice but does not assume the existence of the top and
wenzelm@53160
   678
bottom elements.  Allows to generalize some lemmas about reals and
wenzelm@53160
   679
extended reals.  Removed SupInf and replaced it by the instantiation
wenzelm@53160
   680
of conditionally_complete_lattice for real. Renamed lemmas about
wenzelm@53160
   681
conditionally-complete lattice from Sup_... to cSup_... and from
wenzelm@53160
   682
Inf_...  to cInf_... to avoid hidding of similar complete lattice
wenzelm@53160
   683
lemmas.
wenzelm@53160
   684
wenzelm@53160
   685
* Introduce type class linear_continuum as combination of
wenzelm@53160
   686
conditionally-complete lattices and inner dense linorders which have
wenzelm@53160
   687
more than one element.  INCOMPATIBILITY.
wenzelm@53160
   688
wenzelm@53983
   689
* Introduced type classes order_top and order_bot. The old classes top
wenzelm@53983
   690
and bot only contain the syntax without assumptions.  INCOMPATIBILITY:
wenzelm@53983
   691
Rename bot -> order_bot, top -> order_top
lammich@53683
   692
wenzelm@53160
   693
* Introduce type classes "no_top" and "no_bot" for orderings without
wenzelm@53160
   694
top and bottom elements.
hoelzl@51732
   695
hoelzl@51732
   696
* Split dense_linorder into inner_dense_order and no_top, no_bot.
hoelzl@51732
   697
hoelzl@51732
   698
* Complex_Main: Unify and move various concepts from
wenzelm@53160
   699
HOL-Multivariate_Analysis to HOL-Complex_Main.
hoelzl@51732
   700
wenzelm@53983
   701
 - Introduce type class (lin)order_topology and
wenzelm@53983
   702
   linear_continuum_topology.  Allows to generalize theorems about
wenzelm@53983
   703
   limits and order.  Instances are reals and extended reals.
hoelzl@51732
   704
hoelzl@51732
   705
 - continuous and continuos_on from Multivariate_Analysis:
wenzelm@53983
   706
   "continuous" is the continuity of a function at a filter.  "isCont"
wenzelm@53983
   707
   is now an abbrevitation: "isCont x f == continuous (at _) f".
wenzelm@53983
   708
wenzelm@53983
   709
   Generalized continuity lemmas from isCont to continuous on an
wenzelm@53983
   710
   arbitrary filter.
wenzelm@53983
   711
wenzelm@53983
   712
 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
wenzelm@53983
   713
   compactness of closed intervals on reals. Continuous functions
wenzelm@53983
   714
   attain infimum and supremum on compact sets. The inverse of a
wenzelm@53983
   715
   continuous function is continuous, when the function is continuous
wenzelm@53983
   716
   on a compact set.
hoelzl@51732
   717
hoelzl@51732
   718
 - connected from Multivariate_Analysis. Use it to prove the
hoelzl@51775
   719
   intermediate value theorem. Show connectedness of intervals on
hoelzl@51775
   720
   linear_continuum_topology).
hoelzl@51732
   721
hoelzl@51732
   722
 - first_countable_topology from Multivariate_Analysis. Is used to
wenzelm@53983
   723
   show equivalence of properties on the neighbourhood filter of x and
wenzelm@53983
   724
   on all sequences converging to x.
wenzelm@53983
   725
wenzelm@53983
   726
 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
wenzelm@53983
   727
   theorems from Library/FDERIV.thy to Deriv.thy and base the
wenzelm@53983
   728
   definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
wenzelm@53983
   729
   which are restricted to sets, i.e. to represent derivatives from
wenzelm@53983
   730
   left or right.
hoelzl@51732
   731
hoelzl@51732
   732
 - Removed the within-filter. It is replaced by the principal filter:
hoelzl@51732
   733
hoelzl@51732
   734
     F within X = inf F (principal X)
hoelzl@51732
   735
hoelzl@51732
   736
 - Introduce "at x within U" as a single constant, "at x" is now an
hoelzl@51732
   737
   abbreviation for "at x within UNIV"
hoelzl@51732
   738
wenzelm@53983
   739
 - Introduce named theorem collections tendsto_intros,
wenzelm@53983
   740
   continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
wenzelm@53983
   741
   in tendsto_intros (or FDERIV_intros) are also available as
wenzelm@53983
   742
   tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
wenzelm@53983
   743
   is replaced by a congruence rule. This allows to apply them as
wenzelm@53983
   744
   intro rules and then proving equivalence by the simplifier.
hoelzl@51732
   745
hoelzl@51732
   746
 - Restructured theories in HOL-Complex_Main:
hoelzl@51732
   747
hoelzl@51732
   748
   + Moved RealDef and RComplete into Real
hoelzl@51732
   749
hoelzl@51732
   750
   + Introduced Topological_Spaces and moved theorems about
hoelzl@51732
   751
     topological spaces, filters, limits and continuity to it
hoelzl@51732
   752
hoelzl@51732
   753
   + Renamed RealVector to Real_Vector_Spaces
hoelzl@51732
   754
wenzelm@53983
   755
   + Split Lim, SEQ, Series into Topological_Spaces,
wenzelm@53983
   756
     Real_Vector_Spaces, and Limits
hoelzl@51732
   757
hoelzl@51732
   758
   + Moved Ln and Log to Transcendental
hoelzl@51732
   759
hoelzl@51732
   760
   + Moved theorems about continuity from Deriv to Topological_Spaces
hoelzl@51732
   761
hoelzl@51732
   762
 - Remove various auxiliary lemmas.
hoelzl@51732
   763
hoelzl@51732
   764
INCOMPATIBILITY.
hoelzl@51002
   765
blanchet@53738
   766
* Nitpick:
blanchet@53803
   767
  - Added option "spy"
blanchet@53738
   768
  - Reduce incidence of "too high arity" errors
blanchet@53738
   769
blanchet@51137
   770
* Sledgehammer:
blanchet@51137
   771
  - Renamed option:
blanchet@51137
   772
      isar_shrink ~> isar_compress
blanchet@53738
   773
    INCOMPATIBILITY.
blanchet@53801
   774
  - Added options "isar_try0", "spy"
blanchet@53728
   775
  - Better support for "isar_proofs"
blanchet@53766
   776
  - MaSh has been fined-tuned and now runs as a local server
blanchet@51137
   777
wenzelm@54032
   778
* Improved support for ad hoc overloading of constants (see also
wenzelm@54032
   779
isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
wenzelm@54032
   780
wenzelm@54032
   781
* Library/Polynomial.thy:
wenzelm@54032
   782
  - Use lifting for primitive definitions.
wenzelm@54032
   783
  - Explicit conversions from and to lists of coefficients, used for
wenzelm@54032
   784
    generated code.
wenzelm@54032
   785
  - Replaced recursion operator poly_rec by fold_coeffs.
wenzelm@54032
   786
  - Prefer pre-existing gcd operation for gcd.
wenzelm@54032
   787
  - Fact renames:
wenzelm@54032
   788
    poly_eq_iff ~> poly_eq_poly_eq_iff
wenzelm@54032
   789
    poly_ext ~> poly_eqI
wenzelm@54032
   790
    expand_poly_eq ~> poly_eq_iff
wenzelm@54032
   791
IMCOMPATIBILITY.
wenzelm@54032
   792
wenzelm@54032
   793
* New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
wenzelm@54032
   794
case_of_simps to convert function definitions between a list of
wenzelm@54032
   795
equations with patterns on the lhs and a single equation with case
wenzelm@54032
   796
expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
wenzelm@54032
   797
wenzelm@54032
   798
* New Library/FSet.thy: type of finite sets defined as a subtype of
wenzelm@54032
   799
sets defined by Lifting/Transfer.
wenzelm@54032
   800
wenzelm@54032
   801
* Discontinued theory src/HOL/Library/Eval_Witness.  INCOMPATIBILITY.
wenzelm@54032
   802
wenzelm@54032
   803
* Consolidation of library theories on product orders:
wenzelm@54032
   804
wenzelm@54032
   805
    Product_Lattice ~> Product_Order -- pointwise order on products
wenzelm@54032
   806
    Product_ord ~> Product_Lexorder -- lexicographic order on products
wenzelm@54032
   807
wenzelm@54032
   808
INCOMPATIBILITY.
wenzelm@54032
   809
wenzelm@53160
   810
* Imperative-HOL: The MREC combinator is considered legacy and no
wenzelm@53160
   811
longer included by default. INCOMPATIBILITY, use partial_function
wenzelm@53160
   812
instead, or import theory Legacy_Mrec as a fallback.
wenzelm@53160
   813
wenzelm@53983
   814
* HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
wenzelm@53983
   815
~~/src/HOL/Algebra/poly.  Existing theories should be based on
wenzelm@53983
   816
~~/src/HOL/Library/Polynomial instead.  The latter provides
wenzelm@53983
   817
integration with HOL's type classes for rings.  INCOMPATIBILITY.
ballarin@51517
   818
wenzelm@54033
   819
* HOL-BNF:
wenzelm@54032
   820
  - Various improvements to BNF-based (co)datatype package, including
wenzelm@54032
   821
    new commands "primrec_new", "primcorec", and
wenzelm@54032
   822
    "datatype_new_compat", as well as documentation. See
wenzelm@54032
   823
    "datatypes.pdf" for details.
wenzelm@54032
   824
  - New "coinduction" method to avoid some boilerplate (compared to
wenzelm@54032
   825
    coinduct).
wenzelm@54032
   826
  - Renamed keywords:
wenzelm@54032
   827
    data ~> datatype_new
wenzelm@54032
   828
    codata ~> codatatype
wenzelm@54032
   829
    bnf_def ~> bnf
wenzelm@54032
   830
  - Renamed many generated theorems, including
wenzelm@54032
   831
    discs ~> disc
wenzelm@54032
   832
    map_comp' ~> map_comp
wenzelm@54032
   833
    map_id' ~> map_id
wenzelm@54032
   834
    sels ~> sel
wenzelm@54032
   835
    set_map' ~> set_map
wenzelm@54032
   836
    sets ~> set
wenzelm@54032
   837
IMCOMPATIBILITY.
wenzelm@54032
   838
ballarin@51517
   839
wenzelm@51551
   840
*** ML ***
wenzelm@51551
   841
wenzelm@53971
   842
* Spec_Check is a Quickcheck tool for Isabelle/ML.  The ML function
wenzelm@53971
   843
"check_property" allows to check specifications of the form "ALL x y
wenzelm@53971
   844
z. prop x y z".  See also ~~/src/Tools/Spec_Check/ with its
wenzelm@53971
   845
Examples.thy in particular.
wenzelm@53971
   846
wenzelm@53709
   847
* Improved printing of exception trace in Poly/ML 5.5.1, with regular
wenzelm@53709
   848
tracing output in the command transaction context instead of physical
wenzelm@53709
   849
stdout.  See also Toplevel.debug, Toplevel.debugging and
wenzelm@53709
   850
ML_Compiler.exn_trace.
wenzelm@53709
   851
wenzelm@53971
   852
* ML type "theory" is now immutable, without any special treatment of
wenzelm@53971
   853
drafts or linear updates (which could lead to "stale theory" errors in
wenzelm@53971
   854
the past).  Discontinued obsolete operations like Theory.copy,
wenzelm@53971
   855
Theory.checkpoint, and the auxiliary type theory_ref.  Minor
wenzelm@53971
   856
INCOMPATIBILITY.
wenzelm@53164
   857
wenzelm@51551
   858
* More uniform naming of goal functions for skipped proofs:
wenzelm@51551
   859
wenzelm@51551
   860
    Skip_Proof.prove  ~>  Goal.prove_sorry
wenzelm@51551
   861
    Skip_Proof.prove_global  ~>  Goal.prove_sorry_global
wenzelm@51551
   862
wenzelm@53971
   863
Minor INCOMPATIBILITY.
wenzelm@51703
   864
wenzelm@51717
   865
* Simplifier tactics and tools use proper Proof.context instead of
wenzelm@51717
   866
historic type simpset.  Old-style declarations like addsimps,
wenzelm@51717
   867
addsimprocs etc. operate directly on Proof.context.  Raw type simpset
wenzelm@51717
   868
retains its use as snapshot of the main Simplifier context, using
wenzelm@51717
   869
simpset_of and put_simpset on Proof.context.  INCOMPATIBILITY -- port
wenzelm@51717
   870
old tools by making them depend on (ctxt : Proof.context) instead of
wenzelm@51717
   871
(ss : simpset), then turn (simpset_of ctxt) into ctxt.
wenzelm@51717
   872
wenzelm@53971
   873
* Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
wenzelm@53971
   874
operate on Proof.context instead of claset, for uniformity with addIs,
wenzelm@53971
   875
addEs, addDs etc. Note that claset_of and put_claset allow to manage
wenzelm@53971
   876
clasets separately from the context.
wenzelm@53971
   877
wenzelm@51717
   878
* Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
wenzelm@51717
   879
INCOMPATIBILITY, use @{context} instead.
wenzelm@51717
   880
wenzelm@53971
   881
* Antiquotation @{theory_context A} is similar to @{theory A}, but
wenzelm@53971
   882
presents the result as initial Proof.context.
wenzelm@53971
   883
wenzelm@51551
   884
wenzelm@51398
   885
*** System ***
wenzelm@51398
   886
wenzelm@52052
   887
* Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
wenzelm@52052
   888
"isabelle build" in Isabelle2013.  INCOMPATIBILITY.
wenzelm@51398
   889
wenzelm@52054
   890
* Discontinued obsolete isabelle-process options -f and -u (former
wenzelm@52054
   891
administrative aliases of option -e).  Minor INCOMPATIBILITY.
wenzelm@52054
   892
wenzelm@52550
   893
* Discontinued obsolete isabelle print tool, and PRINT_COMMAND
wenzelm@52550
   894
settings variable.
wenzelm@52550
   895
wenzelm@52746
   896
* Discontinued ISABELLE_DOC_FORMAT settings variable and historic
wenzelm@52746
   897
document formats: dvi.gz, ps, ps.gz -- the default document format is
wenzelm@52746
   898
always pdf.
wenzelm@52743
   899
wenzelm@52053
   900
* Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
wenzelm@52053
   901
specify global resources of the JVM process run by isabelle build.
wenzelm@52053
   902
wenzelm@52116
   903
* Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
wenzelm@52116
   904
to run Isabelle/Scala source files as standalone programs.
wenzelm@52116
   905
wenzelm@52439
   906
* Improved "isabelle keywords" tool (for old-style ProofGeneral
wenzelm@52439
   907
keyword tables): use Isabelle/Scala operations, which inspect outer
wenzelm@52439
   908
syntax without requiring to build sessions first.
wenzelm@52439
   909
wenzelm@53971
   910
* Sessions may be organized via 'chapter' specifications in the ROOT
wenzelm@53971
   911
file, which determines a two-level hierarchy of browser info.  The old
wenzelm@53971
   912
tree-like organization via implicit sub-session relation (with its
wenzelm@53971
   913
tendency towards erratic fluctuation of URLs) has been discontinued.
wenzelm@53971
   914
The default chapter is called "Unsorted".  Potential INCOMPATIBILITY
wenzelm@53971
   915
for HTML presentation of theories.
wenzelm@53971
   916
wenzelm@51398
   917
wenzelm@51398
   918
wenzelm@50993
   919
New in Isabelle2013 (February 2013)
wenzelm@50993
   920
-----------------------------------
wenzelm@47887
   921
wenzelm@47967
   922
*** General ***
wenzelm@47967
   923
wenzelm@50126
   924
* Theorem status about oracles and unfinished/failed future proofs is
wenzelm@50126
   925
no longer printed by default, since it is incompatible with
wenzelm@50126
   926
incremental / parallel checking of the persistent document model.  ML
wenzelm@50126
   927
function Thm.peek_status may be used to inspect a snapshot of the
wenzelm@50126
   928
ongoing evaluation process.  Note that in batch mode --- notably
wenzelm@50126
   929
isabelle build --- the system ensures that future proofs of all
wenzelm@50126
   930
accessible theorems in the theory context are finished (as before).
wenzelm@50126
   931
wenzelm@49699
   932
* Configuration option show_markup controls direct inlining of markup
wenzelm@49699
   933
into the printed representation of formal entities --- notably type
wenzelm@49699
   934
and sort constraints.  This enables Prover IDE users to retrieve that
wenzelm@49699
   935
information via tooltips in the output window, for example.
wenzelm@49699
   936
wenzelm@48890
   937
* Command 'ML_file' evaluates ML text from a file directly within the
wenzelm@48890
   938
theory, without any predeclaration via 'uses' in the theory header.
wenzelm@48890
   939
wenzelm@49243
   940
* Old command 'use' command and corresponding keyword 'uses' in the
wenzelm@49243
   941
theory header are legacy features and will be discontinued soon.
wenzelm@49243
   942
Tools that load their additional source files may imitate the
wenzelm@49243
   943
'ML_file' implementation, such that the system can take care of
wenzelm@49243
   944
dependencies properly.
wenzelm@49243
   945
wenzelm@47967
   946
* Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
wenzelm@47967
   947
is called fastforce / fast_force_tac already since Isabelle2011-1.
wenzelm@47967
   948
wenzelm@50110
   949
* Updated and extended "isar-ref" and "implementation" manual, reduced
wenzelm@50110
   950
remaining material in old "ref" manual.
wenzelm@48120
   951
wenzelm@51050
   952
* Improved support for auxiliary contexts that indicate block structure
wenzelm@51050
   953
for specifications.  Nesting of "context fixes ... context assumes ..."
wenzelm@49841
   954
and "class ... context ...".
wenzelm@49841
   955
wenzelm@50772
   956
* Attribute "consumes" allows a negative value as well, which is
wenzelm@50778
   957
interpreted relatively to the total number of premises of the rule in
wenzelm@50772
   958
the target context.  This form of declaration is stable when exported
wenzelm@50772
   959
from a nested 'context' with additional assumptions.  It is the
wenzelm@50772
   960
preferred form for definitional packages, notably cases/rules produced
wenzelm@50772
   961
in HOL/inductive and HOL/function.
wenzelm@50772
   962
wenzelm@49869
   963
* More informative error messages for Isar proof commands involving
wenzelm@49869
   964
lazy enumerations (method applications etc.).
wenzelm@49869
   965
wenzelm@50213
   966
* Refined 'help' command to retrieve outer syntax commands according
wenzelm@50213
   967
to name patterns (with clickable results).
wenzelm@50213
   968
wenzelm@47967
   969
wenzelm@49968
   970
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@49968
   971
wenzelm@49968
   972
* Parallel terminal proofs ('by') are enabled by default, likewise
wenzelm@49968
   973
proofs that are built into packages like 'datatype', 'function'.  This
wenzelm@49968
   974
allows to "run ahead" checking the theory specifications on the
wenzelm@49968
   975
surface, while the prover is still crunching on internal
wenzelm@49968
   976
justifications.  Unfinished / cancelled proofs are restarted as
wenzelm@49968
   977
required to complete full proof checking eventually.
wenzelm@49968
   978
wenzelm@49968
   979
* Improved output panel with tooltips, hyperlinks etc. based on the
wenzelm@49968
   980
same Rich_Text_Area as regular Isabelle/jEdit buffers.  Activation of
wenzelm@49968
   981
tooltips leads to some window that supports the same recursively,
wenzelm@49968
   982
which can lead to stacks of tooltips as the semantic document content
wenzelm@49968
   983
is explored.  ESCAPE closes the whole stack, individual windows may be
wenzelm@49968
   984
closed separately, or detached to become independent jEdit dockables.
wenzelm@49968
   985
wenzelm@50717
   986
* Improved support for commands that produce graph output: the text
wenzelm@50717
   987
message contains a clickable area to open a new instance of the graph
wenzelm@50717
   988
browser on demand.
wenzelm@50717
   989
wenzelm@49968
   990
* More robust incremental parsing of outer syntax (partial comments,
wenzelm@49968
   991
malformed symbols).  Changing the balance of open/close quotes and
wenzelm@49968
   992
comment delimiters works more conveniently with unfinished situations
wenzelm@49968
   993
that frequently occur in user interaction.
wenzelm@49968
   994
wenzelm@49968
   995
* More efficient painting and improved reactivity when editing large
wenzelm@49968
   996
files.  More scalable management of formal document content.
wenzelm@49968
   997
wenzelm@50505
   998
* Smarter handling of tracing messages: prover process pauses after
wenzelm@50505
   999
certain number of messages per command transaction, with some user
wenzelm@50505
  1000
dialog to stop or continue.  This avoids swamping the front-end with
wenzelm@50119
  1001
potentially infinite message streams.
wenzelm@49968
  1002
wenzelm@49968
  1003
* More plugin options and preferences, based on Isabelle/Scala.  The
wenzelm@49968
  1004
jEdit plugin option panel provides access to some Isabelle/Scala
wenzelm@49968
  1005
options, including tuning parameters for editor reactivity and color
wenzelm@49968
  1006
schemes.
wenzelm@49968
  1007
wenzelm@50184
  1008
* Dockable window "Symbols" provides some editing support for Isabelle
wenzelm@50184
  1009
symbols.
wenzelm@50184
  1010
wenzelm@51082
  1011
* Dockable window "Monitor" shows ML runtime statistics.  Note that
wenzelm@51082
  1012
continuous display of the chart slows down the system.
wenzelm@50701
  1013
wenzelm@50183
  1014
* Improved editing support for control styles: subscript, superscript,
wenzelm@50183
  1015
bold, reset of style -- operating on single symbols or text
wenzelm@50198
  1016
selections.  Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
wenzelm@50198
  1017
wenzelm@50198
  1018
* Actions isabelle.increase-font-size and isabelle.decrease-font-size
wenzelm@50198
  1019
adjust the main text area font size, and its derivatives for output,
wenzelm@50836
  1020
tooltips etc.  Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
wenzelm@50836
  1021
need to be adapted to local keyboard layouts.
wenzelm@50183
  1022
wenzelm@50730
  1023
* More reactive completion popup by default: use \t (TAB) instead of
wenzelm@50730
  1024
\n (NEWLINE) to minimize intrusion into regular flow of editing.  See
wenzelm@50730
  1025
also "Plugin Options / SideKick / General / Code Completion Options".
wenzelm@50730
  1026
wenzelm@50406
  1027
* Implicit check and build dialog of the specified logic session
wenzelm@50406
  1028
image.  For example, HOL, HOLCF, HOL-Nominal can be produced on
wenzelm@50406
  1029
demand, without bundling big platform-dependent heap images in the
wenzelm@50406
  1030
Isabelle distribution.
wenzelm@50406
  1031
wenzelm@49968
  1032
* Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
wenzelm@49968
  1033
from Oracle provide better multi-platform experience.  This version is
wenzelm@49968
  1034
now bundled exclusively with Isabelle.
wenzelm@49968
  1035
wenzelm@49968
  1036
wenzelm@48205
  1037
*** Pure ***
wenzelm@48205
  1038
haftmann@48431
  1039
* Code generation for Haskell: restrict unqualified imports from
haftmann@48431
  1040
Haskell Prelude to a small set of fundamental operations.
haftmann@48431
  1041
wenzelm@50646
  1042
* Command 'export_code': relative file names are interpreted
wenzelm@50646
  1043
relatively to master directory of current theory rather than the
wenzelm@50646
  1044
rather arbitrary current working directory.  INCOMPATIBILITY.
haftmann@48371
  1045
wenzelm@48205
  1046
* Discontinued obsolete attribute "COMP".  Potential INCOMPATIBILITY,
wenzelm@48205
  1047
use regular rule composition via "OF" / "THEN", or explicit proof
wenzelm@48205
  1048
structure instead.  Note that Isabelle/ML provides a variety of
wenzelm@48205
  1049
operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
wenzelm@48205
  1050
with some care where this is really required.
wenzelm@48205
  1051
wenzelm@48792
  1052
* Command 'typ' supports an additional variant with explicit sort
wenzelm@48792
  1053
constraint, to infer and check the most general type conforming to a
wenzelm@51063
  1054
given sort.  Example (in HOL):
wenzelm@48792
  1055
wenzelm@48792
  1056
  typ "_ * _ * bool * unit" :: finite
wenzelm@48792
  1057
wenzelm@50716
  1058
* Command 'locale_deps' visualizes all locales and their relations as
wenzelm@50716
  1059
a Hasse diagram.
wenzelm@50716
  1060
wenzelm@48205
  1061
bulwahn@48013
  1062
*** HOL ***
bulwahn@48013
  1063
wenzelm@50646
  1064
* Sledgehammer:
wenzelm@50646
  1065
wenzelm@50646
  1066
  - Added MaSh relevance filter based on machine-learning; see the
wenzelm@50646
  1067
    Sledgehammer manual for details.
wenzelm@50646
  1068
  - Polished Isar proofs generated with "isar_proofs" option.
wenzelm@50646
  1069
  - Rationalized type encodings ("type_enc" option).
blanchet@50720
  1070
  - Renamed "kill_provers" subcommand to "kill_all".
wenzelm@50646
  1071
  - Renamed options:
wenzelm@50646
  1072
      isar_proof ~> isar_proofs
wenzelm@50646
  1073
      isar_shrink_factor ~> isar_shrink
wenzelm@50646
  1074
      max_relevant ~> max_facts
wenzelm@50646
  1075
      relevance_thresholds ~> fact_thresholds
wenzelm@50646
  1076
wenzelm@50646
  1077
* Quickcheck: added an optimisation for equality premises.  It is
wenzelm@50646
  1078
switched on by default, and can be switched off by setting the
wenzelm@50646
  1079
configuration quickcheck_optimise_equality to false.
wenzelm@50646
  1080
kuncar@50878
  1081
* Quotient: only one quotient can be defined by quotient_type
kuncar@50878
  1082
INCOMPATIBILITY.
kuncar@50878
  1083
kuncar@50878
  1084
* Lifting:
kuncar@50878
  1085
  - generation of an abstraction function equation in lift_definition
kuncar@50878
  1086
  - quot_del attribute
kuncar@50878
  1087
  - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
kuncar@50878
  1088
wenzelm@50646
  1089
* Simproc "finite_Collect" rewrites set comprehensions into pointfree
wenzelm@50646
  1090
expressions.
wenzelm@50646
  1091
wenzelm@50646
  1092
* Preprocessing of the code generator rewrites set comprehensions into
wenzelm@50646
  1093
pointfree expressions.
wenzelm@50646
  1094
wenzelm@50646
  1095
* The SMT solver Z3 has now by default a restricted set of directly
wenzelm@50646
  1096
supported features. For the full set of features (div/mod, nonlinear
wenzelm@50646
  1097
arithmetic, datatypes/records) with potential proof reconstruction
wenzelm@50646
  1098
failures, enable the configuration option "z3_with_extensions".  Minor
wenzelm@50646
  1099
INCOMPATIBILITY.
haftmann@49948
  1100
wenzelm@49836
  1101
* Simplified 'typedef' specifications: historical options for implicit
wenzelm@49836
  1102
set definition and alternative name have been discontinued.  The
wenzelm@49836
  1103
former behavior of "typedef (open) t = A" is now the default, but
wenzelm@49836
  1104
written just "typedef t = A".  INCOMPATIBILITY, need to adapt theories
wenzelm@49836
  1105
accordingly.
wenzelm@49836
  1106
wenzelm@50646
  1107
* Removed constant "chars"; prefer "Enum.enum" on type "char"
wenzelm@50646
  1108
directly.  INCOMPATIBILITY.
wenzelm@50646
  1109
wenzelm@50646
  1110
* Moved operation product, sublists and n_lists from theory Enum to
wenzelm@50646
  1111
List.  INCOMPATIBILITY.
haftmann@49822
  1112
haftmann@49739
  1113
* Theorem UN_o generalized to SUP_comp.  INCOMPATIBILITY.
haftmann@49739
  1114
haftmann@49738
  1115
* Class "comm_monoid_diff" formalises properties of bounded
haftmann@49388
  1116
subtraction, with natural numbers and multisets as typical instances.
haftmann@49388
  1117
wenzelm@50646
  1118
* Added combinator "Option.these" with type "'a option set => 'a set".
wenzelm@50646
  1119
wenzelm@50646
  1120
* Theory "Transitive_Closure": renamed lemmas
wenzelm@50646
  1121
wenzelm@50646
  1122
  reflcl_tranclp -> reflclp_tranclp
wenzelm@50646
  1123
  rtranclp_reflcl -> rtranclp_reflclp
wenzelm@50646
  1124
wenzelm@50646
  1125
INCOMPATIBILITY.
wenzelm@50646
  1126
wenzelm@50646
  1127
* Theory "Rings": renamed lemmas (in class semiring)
wenzelm@50646
  1128
wenzelm@50646
  1129
  left_distrib ~> distrib_right
wenzelm@50646
  1130
  right_distrib ~> distrib_left
wenzelm@50646
  1131
wenzelm@50646
  1132
INCOMPATIBILITY.
wenzelm@50646
  1133
wenzelm@50646
  1134
* Generalized the definition of limits:
wenzelm@50646
  1135
wenzelm@50646
  1136
  - Introduced the predicate filterlim (LIM x F. f x :> G) which
wenzelm@50646
  1137
    expresses that when the input values x converge to F then the
wenzelm@50646
  1138
    output f x converges to G.
wenzelm@50646
  1139
wenzelm@50646
  1140
  - Added filters for convergence to positive (at_top) and negative
wenzelm@50646
  1141
    infinity (at_bot).
wenzelm@50646
  1142
wenzelm@50646
  1143
  - Moved infinity in the norm (at_infinity) from
wenzelm@50646
  1144
    Multivariate_Analysis to Complex_Main.
wenzelm@50646
  1145
wenzelm@50646
  1146
  - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
wenzelm@50646
  1147
    at_top".
wenzelm@50646
  1148
wenzelm@50646
  1149
INCOMPATIBILITY.
wenzelm@50646
  1150
wenzelm@50646
  1151
* Theory "Library/Option_ord" provides instantiation of option type to
wenzelm@50646
  1152
lattice type classes.
wenzelm@50646
  1153
wenzelm@50646
  1154
* Theory "Library/Multiset": renamed
wenzelm@50646
  1155
wenzelm@50646
  1156
    constant fold_mset ~> Multiset.fold
wenzelm@50646
  1157
    fact fold_mset_commute ~> fold_mset_comm
wenzelm@50646
  1158
wenzelm@50646
  1159
INCOMPATIBILITY.
wenzelm@50646
  1160
wenzelm@50646
  1161
* Renamed theory Library/List_Prefix to Library/Sublist, with related
wenzelm@50646
  1162
changes as follows.
wenzelm@50646
  1163
wenzelm@50646
  1164
  - Renamed constants (and related lemmas)
Christian@49145
  1165
Christian@49145
  1166
      prefix ~> prefixeq
Christian@49145
  1167
      strict_prefix ~> prefix
Christian@49145
  1168
wenzelm@50646
  1169
  - Replaced constant "postfix" by "suffixeq" with swapped argument
wenzelm@50646
  1170
    order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
wenzelm@50646
  1171
    old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
wenzelm@50646
  1172
    Renamed lemmas accordingly.
wenzelm@50646
  1173
wenzelm@50646
  1174
  - Added constant "list_hembeq" for homeomorphic embedding on
wenzelm@50646
  1175
    lists. Added abbreviation "sublisteq" for special case
wenzelm@50646
  1176
    "list_hembeq (op =)".
wenzelm@50646
  1177
wenzelm@50646
  1178
  - Theory Library/Sublist no longer provides "order" and "bot" type
wenzelm@50646
  1179
    class instances for the prefix order (merely corresponding locale
wenzelm@50646
  1180
    interpretations). The type class instances are now in theory
wenzelm@50646
  1181
    Library/Prefix_Order.
wenzelm@50646
  1182
wenzelm@50646
  1183
  - The sublist relation of theory Library/Sublist_Order is now based
wenzelm@50646
  1184
    on "Sublist.sublisteq".  Renamed lemmas accordingly:
Christian@50516
  1185
Christian@50516
  1186
      le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
Christian@50516
  1187
      le_list_append_mono ~> Sublist.list_hembeq_append_mono
Christian@50516
  1188
      le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
Christian@50516
  1189
      le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
Christian@50516
  1190
      le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
Christian@50516
  1191
      le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
Christian@50516
  1192
      le_list_drop_Cons ~> Sublist.sublisteq_Cons'
Christian@50516
  1193
      le_list_drop_many ~> Sublist.sublisteq_drop_many
Christian@50516
  1194
      le_list_filter_left ~> Sublist.sublisteq_filter_left
Christian@50516
  1195
      le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
Christian@50516
  1196
      le_list_rev_take_iff ~> Sublist.sublisteq_append
Christian@50516
  1197
      le_list_same_length ~> Sublist.sublisteq_same_length
Christian@50516
  1198
      le_list_take_many_iff ~> Sublist.sublisteq_append'
Christian@49145
  1199
      less_eq_list.drop ~> less_eq_list_drop
Christian@49145
  1200
      less_eq_list.induct ~> less_eq_list_induct
Christian@50516
  1201
      not_le_list_length ~> Sublist.not_sublisteq_length
Christian@49145
  1202
wenzelm@50646
  1203
INCOMPATIBILITY.
wenzelm@50646
  1204
wenzelm@50646
  1205
* New theory Library/Countable_Set.
wenzelm@50646
  1206
wenzelm@50646
  1207
* Theory Library/Debug and Library/Parallel provide debugging and
wenzelm@50646
  1208
parallel execution for code generated towards Isabelle/ML.
wenzelm@50646
  1209
wenzelm@50646
  1210
* Theory Library/FuncSet: Extended support for Pi and extensional and
wenzelm@50646
  1211
introduce the extensional dependent function space "PiE". Replaced
wenzelm@50646
  1212
extensional_funcset by an abbreviation, and renamed lemmas from
wenzelm@50646
  1213
extensional_funcset to PiE as follows:
wenzelm@50646
  1214
wenzelm@50646
  1215
  extensional_empty  ~>  PiE_empty
wenzelm@50646
  1216
  extensional_funcset_empty_domain  ~>  PiE_empty_domain
wenzelm@50646
  1217
  extensional_funcset_empty_range  ~>  PiE_empty_range
wenzelm@50646
  1218
  extensional_funcset_arb  ~>  PiE_arb
wenzelm@50646
  1219
  extensional_funcset_mem  ~>  PiE_mem
wenzelm@50646
  1220
  extensional_funcset_extend_domainI  ~>  PiE_fun_upd
wenzelm@50646
  1221
  extensional_funcset_restrict_domain  ~>  fun_upd_in_PiE
wenzelm@50646
  1222
  extensional_funcset_extend_domain_eq  ~>  PiE_insert_eq
wenzelm@50646
  1223
  card_extensional_funcset  ~>  card_PiE
wenzelm@50646
  1224
  finite_extensional_funcset  ~>  finite_PiE
wenzelm@50646
  1225
wenzelm@50646
  1226
INCOMPATIBILITY.
wenzelm@50646
  1227
wenzelm@50646
  1228
* Theory Library/FinFun: theory of almost everywhere constant
wenzelm@50646
  1229
functions (supersedes the AFP entry "Code Generation for Functions as
wenzelm@50646
  1230
Data").
wenzelm@50646
  1231
wenzelm@50646
  1232
* Theory Library/Phantom: generic phantom type to make a type
wenzelm@50646
  1233
parameter appear in a constant's type.  This alternative to adding
wenzelm@50646
  1234
TYPE('a) as another parameter avoids unnecessary closures in generated
wenzelm@50646
  1235
code.
wenzelm@50646
  1236
wenzelm@50646
  1237
* Theory Library/RBT_Impl: efficient construction of red-black trees
wenzelm@50646
  1238
from sorted associative lists. Merging two trees with rbt_union may
wenzelm@50646
  1239
return a structurally different tree than before.  Potential
wenzelm@50646
  1240
INCOMPATIBILITY.
wenzelm@50646
  1241
wenzelm@50646
  1242
* Theory Library/IArray: immutable arrays with code generation.
wenzelm@50646
  1243
wenzelm@50646
  1244
* Theory Library/Finite_Lattice: theory of finite lattices.
wenzelm@50646
  1245
wenzelm@50646
  1246
* HOL/Multivariate_Analysis: replaced
wenzelm@50646
  1247
wenzelm@50646
  1248
  "basis :: 'a::euclidean_space => nat => real"
wenzelm@50646
  1249
  "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
wenzelm@50646
  1250
wenzelm@50646
  1251
on euclidean spaces by using the inner product "_ \<bullet> _" with
wenzelm@50646
  1252
vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
wenzelm@50646
  1253
"SUM i : Basis. f i * r i".
wenzelm@50646
  1254
wenzelm@50646
  1255
  With this change the following constants are also changed or removed:
wenzelm@50646
  1256
wenzelm@50646
  1257
    DIM('a) :: nat  ~>  card (Basis :: 'a set)   (is an abbreviation)
wenzelm@50646
  1258
    a $$ i  ~>  inner a i  (where i : Basis)
wenzelm@50646
  1259
    cart_base i  removed
wenzelm@50646
  1260
    \<pi>, \<pi>'  removed
hoelzl@50526
  1261
hoelzl@50526
  1262
  Theorems about these constants where removed.
hoelzl@50526
  1263
hoelzl@50526
  1264
  Renamed lemmas:
hoelzl@50526
  1265
wenzelm@50646
  1266
    component_le_norm  ~>  Basis_le_norm
wenzelm@50646
  1267
    euclidean_eq  ~>  euclidean_eq_iff
wenzelm@50646
  1268
    differential_zero_maxmin_component  ~>  differential_zero_maxmin_cart
wenzelm@50646
  1269
    euclidean_simps  ~>  inner_simps
wenzelm@50646
  1270
    independent_basis  ~>  independent_Basis
wenzelm@50646
  1271
    span_basis  ~>  span_Basis
wenzelm@50646
  1272
    in_span_basis  ~>  in_span_Basis
wenzelm@50646
  1273
    norm_bound_component_le  ~>  norm_boound_Basis_le
wenzelm@50646
  1274
    norm_bound_component_lt  ~>  norm_boound_Basis_lt
wenzelm@50646
  1275
    component_le_infnorm  ~>  Basis_le_infnorm
wenzelm@50646
  1276
wenzelm@50646
  1277
INCOMPATIBILITY.
hoelzl@50526
  1278
hoelzl@50141
  1279
* HOL/Probability:
wenzelm@50646
  1280
wenzelm@50646
  1281
  - Added simproc "measurable" to automatically prove measurability.
wenzelm@50646
  1282
wenzelm@50646
  1283
  - Added induction rules for sigma sets with disjoint union
wenzelm@50646
  1284
    (sigma_sets_induct_disjoint) and for Borel-measurable functions
wenzelm@50646
  1285
    (borel_measurable_induct).
wenzelm@50646
  1286
wenzelm@50646
  1287
  - Added the Daniell-Kolmogorov theorem (the existence the limit of a
wenzelm@50646
  1288
    projective family).
wenzelm@50646
  1289
wenzelm@50646
  1290
* HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
wenzelm@50646
  1291
AFP entry "Ordinals_and_Cardinals").
wenzelm@50646
  1292
wenzelm@50646
  1293
* HOL/BNF: New (co)datatype package based on bounded natural functors
wenzelm@50646
  1294
with support for mixed, nested recursion and interesting non-free
wenzelm@50646
  1295
datatypes.
blanchet@48094
  1296
wenzelm@50991
  1297
* HOL/Finite_Set and Relation: added new set and relation operations
kuncar@50878
  1298
expressed by Finite_Set.fold.
kuncar@50878
  1299
kuncar@50878
  1300
* New theory HOL/Library/RBT_Set: implementation of sets by red-black
kuncar@50878
  1301
trees for the code generator.
kuncar@50878
  1302
kuncar@50878
  1303
* HOL/Library/RBT and HOL/Library/Mapping have been converted to
kuncar@50878
  1304
Lifting/Transfer.
kuncar@50878
  1305
possible INCOMPATIBILITY.
kuncar@50878
  1306
kuncar@50878
  1307
* HOL/Set: renamed Set.project -> Set.filter
kuncar@50878
  1308
INCOMPATIBILITY.
kuncar@50878
  1309
wenzelm@48120
  1310
wenzelm@48206
  1311
*** Document preparation ***
wenzelm@48206
  1312
wenzelm@50646
  1313
* Dropped legacy antiquotations "term_style" and "thm_style", since
wenzelm@50646
  1314
styles may be given as arguments to "term" and "thm" already.
wenzelm@50646
  1315
Discontinued legacy styles "prem1" .. "prem19".
wenzelm@50646
  1316
wenzelm@50646
  1317
* Default LaTeX rendering for \<euro> is now based on eurosym package,
wenzelm@50646
  1318
instead of slightly exotic babel/greek.
wenzelm@48206
  1319
wenzelm@48616
  1320
* Document variant NAME may use different LaTeX entry point
wenzelm@48616
  1321
document/root_NAME.tex if that file exists, instead of the common
wenzelm@48616
  1322
document/root.tex.
wenzelm@48616
  1323
wenzelm@48657
  1324
* Simplified custom document/build script, instead of old-style
wenzelm@48657
  1325
document/IsaMakefile.  Minor INCOMPATIBILITY.
wenzelm@48657
  1326
wenzelm@48206
  1327
wenzelm@48992
  1328
*** ML ***
wenzelm@48992
  1329
wenzelm@50646
  1330
* The default limit for maximum number of worker threads is now 8,
wenzelm@50646
  1331
instead of 4, in correspondence to capabilities of contemporary
wenzelm@50646
  1332
hardware and Poly/ML runtime system.
wenzelm@50646
  1333
wenzelm@49869
  1334
* Type Seq.results and related operations support embedded error
wenzelm@49869
  1335
messages within lazy enumerations, and thus allow to provide
wenzelm@49869
  1336
informative errors in the absence of any usable results.
wenzelm@49869
  1337
wenzelm@48992
  1338
* Renamed Position.str_of to Position.here to emphasize that this is a
wenzelm@48992
  1339
formal device to inline positions into message text, but not
wenzelm@48992
  1340
necessarily printing visible text.
wenzelm@48992
  1341
wenzelm@48992
  1342
wenzelm@48206
  1343
*** System ***
wenzelm@48206
  1344
wenzelm@48585
  1345
* Advanced support for Isabelle sessions and build management, see
wenzelm@48585
  1346
"system" manual for the chapter of that name, especially the "isabelle
wenzelm@51056
  1347
build" tool and its examples.  The "isabelle mkroot" tool prepares
wenzelm@51056
  1348
session root directories for use with "isabelle build", similar to
wenzelm@51056
  1349
former "isabelle mkdir" for "isabelle usedir".  Note that this affects
wenzelm@51056
  1350
document preparation as well.  INCOMPATIBILITY, isabelle usedir /
wenzelm@48736
  1351
mkdir / make are rendered obsolete.
wenzelm@48736
  1352
wenzelm@51056
  1353
* Discontinued obsolete Isabelle/build script, it is superseded by the
wenzelm@51056
  1354
regular isabelle build tool.  For example:
wenzelm@51056
  1355
wenzelm@51056
  1356
  isabelle build -s -b HOL
wenzelm@51056
  1357
wenzelm@48736
  1358
* Discontinued obsolete "isabelle makeall".
wenzelm@48585
  1359
wenzelm@48722
  1360
* Discontinued obsolete IsaMakefile and ROOT.ML files from the
wenzelm@48722
  1361
Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
wenzelm@48722
  1362
provides some traditional targets that invoke "isabelle build".  Note
wenzelm@48722
  1363
that this is inefficient!  Applications of Isabelle/HOL involving
wenzelm@48722
  1364
"isabelle make" should be upgraded to use "isabelle build" directly.
wenzelm@48722
  1365
wenzelm@48693
  1366
* The "isabelle options" tool prints Isabelle system options, as
wenzelm@48693
  1367
required for "isabelle build", for example.
wenzelm@48693
  1368
wenzelm@50646
  1369
* The "isabelle logo" tool produces EPS and PDF format simultaneously.
wenzelm@50646
  1370
Minor INCOMPATIBILITY in command-line options.
wenzelm@50646
  1371
wenzelm@50646
  1372
* The "isabelle install" tool has now a simpler command-line.  Minor
wenzelm@50646
  1373
INCOMPATIBILITY.
wenzelm@50646
  1374
wenzelm@48844
  1375
* The "isabelle components" tool helps to resolve add-on components
wenzelm@48844
  1376
that are not bundled, or referenced from a bare-bones repository
wenzelm@48844
  1377
version of Isabelle.
wenzelm@48844
  1378
wenzelm@50646
  1379
* Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
wenzelm@50646
  1380
platform family: "linux", "macos", "windows".
wenzelm@50646
  1381
wenzelm@50646
  1382
* The ML system is configured as regular component, and no longer
wenzelm@50646
  1383
picked up from some surrounding directory.  Potential INCOMPATIBILITY
wenzelm@50646
  1384
for home-made settings.
wenzelm@50132
  1385
wenzelm@50701
  1386
* Improved ML runtime statistics (heap, threads, future tasks etc.).
wenzelm@50701
  1387
wenzelm@48206
  1388
* Discontinued support for Poly/ML 5.2.1, which was the last version
wenzelm@48206
  1389
without exception positions and advanced ML compiler/toplevel
wenzelm@48206
  1390
configuration.
wenzelm@48206
  1391
wenzelm@48574
  1392
* Discontinued special treatment of Proof General -- no longer guess
wenzelm@48574
  1393
PROOFGENERAL_HOME based on accidental file-system layout.  Minor
wenzelm@48574
  1394
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
wenzelm@48574
  1395
settings manually, or use a Proof General version that has been
wenzelm@48574
  1396
bundled as Isabelle component.
wenzelm@48206
  1397
wenzelm@50182
  1398
wenzelm@48120
  1399
wenzelm@47462
  1400
New in Isabelle2012 (May 2012)
wenzelm@47462
  1401
------------------------------
wenzelm@45109
  1402
wenzelm@45593
  1403
*** General ***
wenzelm@45593
  1404
wenzelm@45614
  1405
* Prover IDE (PIDE) improvements:
wenzelm@45614
  1406
wenzelm@47585
  1407
  - more robust Sledgehammer integration (as before the sledgehammer
wenzelm@47806
  1408
    command-line needs to be typed into the source buffer)
wenzelm@45614
  1409
  - markup for bound variables
wenzelm@47806
  1410
  - markup for types of term variables (displayed as tooltips)
wenzelm@46956
  1411
  - support for user-defined Isar commands within the running session
wenzelm@47158
  1412
  - improved support for Unicode outside original 16bit range
wenzelm@47158
  1413
    e.g. glyph for \<A> (thanks to jEdit 4.5.1)
wenzelm@45614
  1414
wenzelm@47806
  1415
* Forward declaration of outer syntax keywords within the theory
wenzelm@47806
  1416
header -- minor INCOMPATIBILITY for user-defined commands.  Allow new
wenzelm@47806
  1417
commands to be used in the same theory where defined.
wenzelm@46485
  1418
wenzelm@47482
  1419
* Auxiliary contexts indicate block structure for specifications with
wenzelm@47482
  1420
additional parameters and assumptions.  Such unnamed contexts may be
wenzelm@47482
  1421
nested within other targets, like 'theory', 'locale', 'class',
wenzelm@47482
  1422
'instantiation' etc.  Results from the local context are generalized
wenzelm@47482
  1423
accordingly and applied to the enclosing target context.  Example:
wenzelm@47482
  1424
wenzelm@47482
  1425
  context
wenzelm@47482
  1426
    fixes x y z :: 'a
wenzelm@47482
  1427
    assumes xy: "x = y" and yz: "y = z"
wenzelm@47482
  1428
  begin
wenzelm@47482
  1429
wenzelm@47482
  1430
  lemma my_trans: "x = z" using xy yz by simp
wenzelm@47482
  1431
wenzelm@47482
  1432
  end
wenzelm@47482
  1433
wenzelm@47482
  1434
  thm my_trans
wenzelm@47482
  1435
wenzelm@47482
  1436
The most basic application is to factor-out context elements of
wenzelm@47482
  1437
several fixes/assumes/shows theorem statements, e.g. see
wenzelm@47482
  1438
~~/src/HOL/Isar_Examples/Group_Context.thy
wenzelm@47482
  1439
wenzelm@47482
  1440
Any other local theory specification element works within the "context
wenzelm@47482
  1441
... begin ... end" block as well.
wenzelm@47482
  1442
wenzelm@47484
  1443
* Bundled declarations associate attributed fact expressions with a
wenzelm@47484
  1444
given name in the context.  These may be later included in other
wenzelm@47484
  1445
contexts.  This allows to manage context extensions casually, without
wenzelm@47855
  1446
the logical dependencies of locales and locale interpretation.  See
wenzelm@47855
  1447
commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
wenzelm@47484
  1448
wenzelm@47829
  1449
* Commands 'lemmas' and 'theorems' allow local variables using 'for'
wenzelm@47829
  1450
declaration, and results are standardized before being stored.  Thus
wenzelm@47829
  1451
old-style "standard" after instantiation or composition of facts
wenzelm@47829
  1452
becomes obsolete.  Minor INCOMPATIBILITY, due to potential change of
wenzelm@47829
  1453
indices of schematic variables.
wenzelm@47829
  1454
wenzelm@47829
  1455
* Rule attributes in local theory declarations (e.g. locale or class)
wenzelm@47829
  1456
are now statically evaluated: the resulting theorem is stored instead
wenzelm@47829
  1457
of the original expression.  INCOMPATIBILITY in rare situations, where
wenzelm@47829
  1458
the historic accident of dynamic re-evaluation in interpretations
wenzelm@47829
  1459
etc. was exploited.
wenzelm@47829
  1460
wenzelm@47829
  1461
* New tutorial "Programming and Proving in Isabelle/HOL"
wenzelm@47829
  1462
("prog-prove").  It completely supersedes "A Tutorial Introduction to
wenzelm@47829
  1463
Structured Isar Proofs" ("isar-overview"), which has been removed.  It
wenzelm@47829
  1464
also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
wenzelm@47829
  1465
Logic" as the recommended beginners tutorial, but does not cover all
wenzelm@47829
  1466
of the material of that old tutorial.
wenzelm@47829
  1467
wenzelm@47829
  1468
* Updated and extended reference manuals: "isar-ref",
wenzelm@47829
  1469
"implementation", "system"; reduced remaining material in old "ref"
wenzelm@47829
  1470
manual.
wenzelm@47829
  1471
wenzelm@47829
  1472
wenzelm@47829
  1473
*** Pure ***
wenzelm@47829
  1474
wenzelm@46976
  1475
* Command 'definition' no longer exports the foundational "raw_def"
wenzelm@46976
  1476
into the user context.  Minor INCOMPATIBILITY, may use the regular
wenzelm@46976
  1477
"def" result with attribute "abs_def" to imitate the old version.
wenzelm@46976
  1478
wenzelm@47855
  1479
* Attribute "abs_def" turns an equation of the form "f x y == t" into
wenzelm@47855
  1480
"f == %x y. t", which ensures that "simp" or "unfold" steps always
wenzelm@47855
  1481
expand it.  This also works for object-logic equality.  (Formerly
wenzelm@47855
  1482
undocumented feature.)
wenzelm@47855
  1483
wenzelm@47856
  1484
* Sort constraints are now propagated in simultaneous statements, just
wenzelm@47856
  1485
like type constraints.  INCOMPATIBILITY in rare situations, where
wenzelm@47856
  1486
distinct sorts used to be assigned accidentally.  For example:
wenzelm@47856
  1487
wenzelm@47856
  1488
  lemma "P (x::'a::foo)" and "Q (y::'a::bar)"  -- "now illegal"
wenzelm@47856
  1489
wenzelm@47856
  1490
  lemma "P (x::'a)" and "Q (y::'a::bar)"
wenzelm@47856
  1491
    -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
wenzelm@47856
  1492
wenzelm@47856
  1493
* Rule composition via attribute "OF" (or ML functions OF/MRS) is more
wenzelm@47856
  1494
tolerant against multiple unifiers, as long as the final result is
wenzelm@47856
  1495
unique.  (As before, rules are composed in canonical right-to-left
wenzelm@47856
  1496
order to accommodate newly introduced premises.)
wenzelm@47856
  1497
wenzelm@47806
  1498
* Renamed some inner syntax categories:
wenzelm@47806
  1499
wenzelm@47806
  1500
    num ~> num_token
wenzelm@47806
  1501
    xnum ~> xnum_token
wenzelm@47806
  1502
    xstr ~> str_token
wenzelm@47806
  1503
wenzelm@47806
  1504
Minor INCOMPATIBILITY.  Note that in practice "num_const" or
wenzelm@47806
  1505
"num_position" etc. are mainly used instead (which also include
wenzelm@47806
  1506
position information via constraints).
wenzelm@47806
  1507
wenzelm@47829
  1508
* Simplified configuration options for syntax ambiguity: see
wenzelm@47829
  1509
"syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
wenzelm@47829
  1510
manual.  Minor INCOMPATIBILITY.
wenzelm@47829
  1511
wenzelm@47856
  1512
* Discontinued configuration option "syntax_positions": atomic terms
wenzelm@47856
  1513
in parse trees are always annotated by position constraints.
wenzelm@45134
  1514
wenzelm@47464
  1515
* Old code generator for SML and its commands 'code_module',
wenzelm@45383
  1516
'code_library', 'consts_code', 'types_code' have been discontinued.
haftmann@46028
  1517
Use commands of the generic code generator instead.  INCOMPATIBILITY.
wenzelm@45383
  1518
wenzelm@47464
  1519
* Redundant attribute "code_inline" has been discontinued. Use
wenzelm@47464
  1520
"code_unfold" instead.  INCOMPATIBILITY.
wenzelm@47464
  1521
wenzelm@47464
  1522
* Dropped attribute "code_unfold_post" in favor of the its dual
wenzelm@47464
  1523
"code_abbrev", which yields a common pattern in definitions like
haftmann@46028
  1524
haftmann@46028
  1525
  definition [code_abbrev]: "f = t"
haftmann@46028
  1526
haftmann@46028
  1527
INCOMPATIBILITY.
wenzelm@45383
  1528
wenzelm@47856
  1529
* Obsolete 'types' command has been discontinued.  Use 'type_synonym'
wenzelm@47856
  1530
instead.  INCOMPATIBILITY.
wenzelm@47856
  1531
wenzelm@47856
  1532
* Discontinued old "prems" fact, which used to refer to the accidental
wenzelm@47856
  1533
collection of foundational premises in the context (already marked as
wenzelm@47856
  1534
legacy since Isabelle2011).
wenzelm@47855
  1535
wenzelm@45427
  1536
huffman@45122
  1537
*** HOL ***
huffman@45122
  1538
wenzelm@47464
  1539
* Type 'a set is now a proper type constructor (just as before
wenzelm@47464
  1540
Isabelle2008).  Definitions mem_def and Collect_def have disappeared.
wenzelm@47464
  1541
Non-trivial INCOMPATIBILITY.  For developments keeping predicates and
wenzelm@47855
  1542
sets separate, it is often sufficient to rephrase some set S that has
wenzelm@47855
  1543
been accidentally used as predicates by "%x. x : S", and some
wenzelm@47855
  1544
predicate P that has been accidentally used as set by "{x. P x}".
wenzelm@47855
  1545
Corresponding proofs in a first step should be pruned from any
wenzelm@47855
  1546
tinkering with former theorems mem_def and Collect_def as far as
wenzelm@47855
  1547
possible.
wenzelm@47855
  1548
wenzelm@47855
  1549
For developments which deliberately mix predicates and sets, a
wenzelm@47464
  1550
planning step is necessary to determine what should become a predicate
wenzelm@47464
  1551
and what a set.  It can be helpful to carry out that step in
wenzelm@47464
  1552
Isabelle2011-1 before jumping right into the current release.
wenzelm@47464
  1553
wenzelm@47855
  1554
* Code generation by default implements sets as container type rather
wenzelm@47855
  1555
than predicates.  INCOMPATIBILITY.
wenzelm@47855
  1556
wenzelm@47855
  1557
* New type synonym 'a rel = ('a * 'a) set
wenzelm@47855
  1558
wenzelm@47464
  1559
* The representation of numerals has changed.  Datatype "num"
wenzelm@47464
  1560
represents strictly positive binary numerals, along with functions
wenzelm@47464
  1561
"numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
wenzelm@47855
  1562
positive and negated numeric literals, respectively.  See also
wenzelm@47855
  1563
definitions in ~~/src/HOL/Num.thy.  Potential INCOMPATIBILITY, some
wenzelm@47855
  1564
user theories may require adaptations as follows:
huffman@47108
  1565
huffman@47108
  1566
  - Theorems with number_ring or number_semiring constraints: These
huffman@47108
  1567
    classes are gone; use comm_ring_1 or comm_semiring_1 instead.
huffman@47108
  1568
huffman@47108
  1569
  - Theories defining numeric types: Remove number, number_semiring,
huffman@47108
  1570
    and number_ring instances. Defer all theorems about numerals until
huffman@47108
  1571
    after classes one and semigroup_add have been instantiated.
huffman@47108
  1572
huffman@47108
  1573
  - Numeral-only simp rules: Replace each rule having a "number_of v"
huffman@47108
  1574
    pattern with two copies, one for numeral and one for neg_numeral.
huffman@47108
  1575
huffman@47108
  1576
  - Theorems about subclasses of semiring_1 or ring_1: These classes
huffman@47108
  1577
    automatically support numerals now, so more simp rules and
huffman@47108
  1578
    simprocs may now apply within the proof.
huffman@47108
  1579
huffman@47108
  1580
  - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
huffman@47108
  1581
    Redefine using other integer operations.
huffman@47108
  1582
wenzelm@47855
  1583
* Transfer: New package intended to generalize the existing
wenzelm@47855
  1584
"descending" method and related theorem attributes from the Quotient
wenzelm@47855
  1585
package.  (Not all functionality is implemented yet, but future
wenzelm@47855
  1586
development will focus on Transfer as an eventual replacement for the
wenzelm@47855
  1587
corresponding parts of the Quotient package.)
wenzelm@47809
  1588
wenzelm@47809
  1589
  - transfer_rule attribute: Maintains a collection of transfer rules,
wenzelm@47809
  1590
    which relate constants at two different types. Transfer rules may
wenzelm@47809
  1591
    relate different type instances of the same polymorphic constant,
wenzelm@47809
  1592
    or they may relate an operation on a raw type to a corresponding
wenzelm@47809
  1593
    operation on an abstract type (quotient or subtype). For example:
wenzelm@47809
  1594
wenzelm@47809
  1595
    ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
wenzelm@47809
  1596
    (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
wenzelm@47809
  1597
wenzelm@47809
  1598
  - transfer method: Replaces a subgoal on abstract types with an
wenzelm@47809
  1599
    equivalent subgoal on the corresponding raw types. Constants are
wenzelm@47809
  1600
    replaced with corresponding ones according to the transfer rules.
wenzelm@47809
  1601
    Goals are generalized over all free variables by default; this is
huffman@47851
  1602
    necessary for variables whose types change, but can be overridden
wenzelm@47855
  1603
    for specific variables with e.g. "transfer fixing: x y z".  The
wenzelm@47809
  1604
    variant transfer' method allows replacing a subgoal with one that
wenzelm@47809
  1605
    is logically stronger (rather than equivalent).
wenzelm@47809
  1606
wenzelm@47809
  1607
  - relator_eq attribute: Collects identity laws for relators of
wenzelm@47809
  1608
    various type constructors, e.g. "list_all2 (op =) = (op =)".  The
wenzelm@47809
  1609
    transfer method uses these lemmas to infer transfer rules for
wenzelm@47809
  1610
    non-polymorphic constants on the fly.
wenzelm@47809
  1611
wenzelm@47809
  1612
  - transfer_prover method: Assists with proving a transfer rule for a
wenzelm@47809
  1613
    new constant, provided the constant is defined in terms of other
wenzelm@47809
  1614
    constants that already have transfer rules. It should be applied
wenzelm@47809
  1615
    after unfolding the constant definitions.
wenzelm@47809
  1616
wenzelm@47809
  1617
  - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
wenzelm@47809
  1618
    from type nat to type int.
wenzelm@47809
  1619
huffman@47851
  1620
* Lifting: New package intended to generalize the quotient_definition
huffman@47851
  1621
facility of the Quotient package; designed to work with Transfer.
wenzelm@47809
  1622
wenzelm@47809
  1623
  - lift_definition command: Defines operations on an abstract type in
wenzelm@47809
  1624
    terms of a corresponding operation on a representation
wenzelm@47809
  1625
    type.  Example syntax:
wenzelm@47809
  1626
wenzelm@47809
  1627
    lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
wenzelm@47809
  1628
      is List.insert
wenzelm@47809
  1629
wenzelm@47809
  1630
    Users must discharge a respectfulness proof obligation when each
wenzelm@47809
  1631
    constant is defined. (For a type copy, i.e. a typedef with UNIV,
wenzelm@47809
  1632
    the proof is discharged automatically.) The obligation is
wenzelm@47809
  1633
    presented in a user-friendly, readable form; a respectfulness
wenzelm@47809
  1634
    theorem in the standard format and a transfer rule are generated
wenzelm@47809
  1635
    by the package.
wenzelm@47809
  1636
wenzelm@47809
  1637
  - Integration with code_abstype: For typedefs (e.g. subtypes
wenzelm@47809
  1638
    corresponding to a datatype invariant, such as dlist),
wenzelm@47809
  1639
    lift_definition generates a code certificate theorem and sets up
wenzelm@47809
  1640
    code generation for each constant.
wenzelm@47809
  1641
wenzelm@47809
  1642
  - setup_lifting command: Sets up the Lifting package to work with a
wenzelm@47809
  1643
    user-defined type. The user must provide either a quotient theorem
wenzelm@47809
  1644
    or a type_definition theorem.  The package configures transfer
wenzelm@47809
  1645
    rules for equality and quantifiers on the type, and sets up the
wenzelm@47809
  1646
    lift_definition command to work with the type.
wenzelm@47809
  1647
wenzelm@47809
  1648
  - Usage examples: See Quotient_Examples/Lift_DList.thy,
huffman@47851
  1649
    Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
huffman@47851
  1650
    Word/Word.thy and Library/Float.thy.
wenzelm@47809
  1651
wenzelm@47809
  1652
* Quotient package:
wenzelm@47809
  1653
wenzelm@47809
  1654
  - The 'quotient_type' command now supports a 'morphisms' option with
wenzelm@47809
  1655
    rep and abs functions, similar to typedef.
wenzelm@47809
  1656
wenzelm@47809
  1657
  - 'quotient_type' sets up new types to work with the Lifting and
wenzelm@47809
  1658
    Transfer packages, as with 'setup_lifting'.
wenzelm@47809
  1659
wenzelm@47809
  1660
  - The 'quotient_definition' command now requires the user to prove a
wenzelm@47809
  1661
    respectfulness property at the point where the constant is
wenzelm@47809
  1662
    defined, similar to lift_definition; INCOMPATIBILITY.
wenzelm@47809
  1663
wenzelm@47809
  1664
  - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
wenzelm@47809
  1665
    accordingly, INCOMPATIBILITY.
wenzelm@47809
  1666
wenzelm@47809
  1667
* New diagnostic command 'find_unused_assms' to find potentially
wenzelm@47809
  1668
superfluous assumptions in theorems using Quickcheck.
wenzelm@47809
  1669
wenzelm@47809
  1670
* Quickcheck:
wenzelm@47809
  1671
wenzelm@47809
  1672
  - Quickcheck returns variable assignments as counterexamples, which
wenzelm@47809
  1673
    allows to reveal the underspecification of functions under test.
wenzelm@47809
  1674
    For example, refuting "hd xs = x", it presents the variable
wenzelm@47809
  1675
    assignment xs = [] and x = a1 as a counterexample, assuming that
wenzelm@47809
  1676
    any property is false whenever "hd []" occurs in it.
wenzelm@47809
  1677
wenzelm@47809
  1678
    These counterexample are marked as potentially spurious, as
wenzelm@47809
  1679
    Quickcheck also returns "xs = []" as a counterexample to the
wenzelm@47809
  1680
    obvious theorem "hd xs = hd xs".
wenzelm@47809
  1681
wenzelm@47809
  1682
    After finding a potentially spurious counterexample, Quickcheck
wenzelm@47809
  1683
    continues searching for genuine ones.
wenzelm@47809
  1684
wenzelm@47809
  1685
    By default, Quickcheck shows potentially spurious and genuine
wenzelm@47809
  1686
    counterexamples. The option "genuine_only" sets quickcheck to only
wenzelm@47809
  1687
    show genuine counterexamples.
wenzelm@47809
  1688
wenzelm@47809
  1689
  - The command 'quickcheck_generator' creates random and exhaustive
wenzelm@47809
  1690
    value generators for a given type and operations.
wenzelm@47809
  1691
wenzelm@47809
  1692
    It generates values by using the operations as if they were
wenzelm@47809
  1693
    constructors of that type.
wenzelm@47809
  1694
wenzelm@47809
  1695
  - Support for multisets.
wenzelm@47809
  1696
wenzelm@47809
  1697
  - Added "use_subtype" options.
wenzelm@47809
  1698
wenzelm@47809
  1699
  - Added "quickcheck_locale" configuration to specify how to process
wenzelm@47809
  1700
    conjectures in a locale context.
wenzelm@47809
  1701
wenzelm@47855
  1702
* Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
wenzelm@47855
  1703
and affecting 'rat' and 'real'.
wenzelm@47809
  1704
wenzelm@47809
  1705
* Sledgehammer:
wenzelm@47809
  1706
  - Integrated more tightly with SPASS, as described in the ITP 2012
wenzelm@47809
  1707
    paper "More SPASS with Isabelle".
wenzelm@47809
  1708
  - Made it try "smt" as a fallback if "metis" fails or times out.
wenzelm@47809
  1709
  - Added support for the following provers: Alt-Ergo (via Why3 and
wenzelm@47809
  1710
    TFF1), iProver, iProver-Eq.
wenzelm@47809
  1711
  - Sped up the minimizer.
wenzelm@47809
  1712
  - Added "lam_trans", "uncurry_aliases", and "minimize" options.
wenzelm@47809
  1713
  - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
wenzelm@47809
  1714
  - Renamed "sound" option to "strict".
wenzelm@47809
  1715
wenzelm@47855
  1716
* Metis: Added possibility to specify lambda translations scheme as a
wenzelm@47855
  1717
parenthesized argument (e.g., "by (metis (lifting) ...)").
wenzelm@47855
  1718
wenzelm@47855
  1719
* SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
wenzelm@47855
  1720
wenzelm@47855
  1721
* Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
wenzelm@47809
  1722
wenzelm@47856
  1723
* New "case_product" attribute to generate a case rule doing multiple
wenzelm@47856
  1724
case distinctions at the same time.  E.g.
wenzelm@47856
  1725
wenzelm@47856
  1726
  list.exhaust [case_product nat.exhaust]
wenzelm@47856
  1727
wenzelm@47856
  1728
produces a rule which can be used to perform case distinction on both
wenzelm@47856
  1729
a list and a nat.
wenzelm@47856
  1730
wenzelm@47809
  1731
* New "eventually_elim" method as a generalized variant of the
wenzelm@47855
  1732
eventually_elim* rules.  Supports structured proofs.
wenzelm@47855
  1733
wenzelm@47702
  1734
* Typedef with implicit set definition is considered legacy.  Use
wenzelm@47702
  1735
"typedef (open)" form instead, which will eventually become the
wenzelm@47702
  1736
default.
wenzelm@47702
  1737
wenzelm@47856
  1738
* Record: code generation can be switched off manually with
wenzelm@47856
  1739
wenzelm@47856
  1740
  declare [[record_coden = false]]  -- "default true"
wenzelm@47856
  1741
wenzelm@47856
  1742
* Datatype: type parameters allow explicit sort constraints.
wenzelm@47856
  1743
wenzelm@47855
  1744
* Concrete syntax for case expressions includes constraints for source
wenzelm@47855
  1745
positions, and thus produces Prover IDE markup for its bindings.
wenzelm@47855
  1746
INCOMPATIBILITY for old-style syntax translations that augment the
wenzelm@47855
  1747
pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
wenzelm@47855
  1748
one_case.
wenzelm@47855
  1749
wenzelm@47855
  1750
* Clarified attribute "mono_set": pure declaration without modifying
wenzelm@47855
  1751
the result of the fact expression.
wenzelm@47855
  1752
haftmann@46752
  1753
* More default pred/set conversions on a couple of relation operations
wenzelm@47464
  1754
and predicates.  Added powers of predicate relations.  Consolidation
wenzelm@47464
  1755
of some relation theorems:
haftmann@46752
  1756
haftmann@46752
  1757
  converse_def ~> converse_unfold
haftmann@47549
  1758
  rel_comp_def ~> relcomp_unfold
haftmann@47820
  1759
  symp_def ~> (modified, use symp_def and sym_def instead)
haftmann@46752
  1760
  transp_def ~> transp_trans
haftmann@46752
  1761
  Domain_def ~> Domain_unfold
haftmann@46752
  1762
  Range_def ~> Domain_converse [symmetric]
haftmann@46752
  1763
haftmann@46981
  1764
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
haftmann@46981
  1765
wenzelm@47464
  1766
See theory "Relation" for examples for making use of pred/set
wenzelm@47464
  1767
conversions by means of attributes "to_set" and "to_pred".
haftmann@47086
  1768
haftmann@46752
  1769
INCOMPATIBILITY.
haftmann@46752
  1770
bulwahn@46363
  1771
* Renamed facts about the power operation on relations, i.e., relpow
wenzelm@47464
  1772
to match the constant's name:
wenzelm@47463
  1773
wenzelm@46458
  1774
  rel_pow_1 ~> relpow_1
bulwahn@46363
  1775
  rel_pow_0_I ~> relpow_0_I
bulwahn@46363
  1776
  rel_pow_Suc_I ~> relpow_Suc_I
bulwahn@46363
  1777
  rel_pow_Suc_I2 ~> relpow_Suc_I2
bulwahn@46363
  1778
  rel_pow_0_E ~> relpow_0_E
bulwahn@46363
  1779
  rel_pow_Suc_E ~> relpow_Suc_E
bulwahn@46363
  1780
  rel_pow_E ~> relpow_E
wenzelm@46458
  1781
  rel_pow_Suc_D2 ~> relpow_Suc_D2
wenzelm@47463
  1782
  rel_pow_Suc_E2 ~> relpow_Suc_E2
bulwahn@46363
  1783
  rel_pow_Suc_D2' ~> relpow_Suc_D2'
bulwahn@46363
  1784
  rel_pow_E2 ~> relpow_E2
bulwahn@46363
  1785
  rel_pow_add ~> relpow_add
bulwahn@46363
  1786
  rel_pow_commute ~> relpow
bulwahn@46363
  1787
  rel_pow_empty ~> relpow_empty:
bulwahn@46363
  1788
  rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
bulwahn@46363
  1789
  rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
bulwahn@46363
  1790
  rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
bulwahn@46363
  1791
  rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
bulwahn@46363
  1792
  rel_pow_fun_conv ~> relpow_fun_conv
bulwahn@46363
  1793
  rel_pow_finite_bounded1 ~> relpow_finite_bounded1
bulwahn@46363
  1794
  rel_pow_finite_bounded ~> relpow_finite_bounded
bulwahn@46363
  1795
  rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
bulwahn@46363
  1796
  trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
bulwahn@46363
  1797
  single_valued_rel_pow ~> single_valued_relpow
wenzelm@47463
  1798
bulwahn@46363
  1799
INCOMPATIBILITY.
bulwahn@46363
  1800
bulwahn@47448
  1801
* Theory Relation: Consolidated constant name for relation composition
wenzelm@47464
  1802
and corresponding theorem names:
wenzelm@47464
  1803
haftmann@47549
  1804
  - Renamed constant rel_comp to relcomp.
wenzelm@47464
  1805
bulwahn@47448
  1806
  - Dropped abbreviation pred_comp. Use relcompp instead.
wenzelm@47464
  1807
bulwahn@47448
  1808
  - Renamed theorems:
wenzelm@47464
  1809
bulwahn@47448
  1810
    rel_compI ~> relcompI
bulwahn@47448
  1811
    rel_compEpair ~> relcompEpair
bulwahn@47448
  1812
    rel_compE ~> relcompE
bulwahn@47448
  1813
    pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
bulwahn@47448
  1814
    rel_comp_empty1 ~> relcomp_empty1
bulwahn@47448
  1815
    rel_comp_mono ~> relcomp_mono
bulwahn@47448
  1816
    rel_comp_subset_Sigma ~> relcomp_subset_Sigma
bulwahn@47448
  1817
    rel_comp_distrib ~> relcomp_distrib
bulwahn@47448
  1818
    rel_comp_distrib2 ~> relcomp_distrib2
bulwahn@47448
  1819
    rel_comp_UNION_distrib ~> relcomp_UNION_distrib
bulwahn@47448
  1820
    rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
bulwahn@47448
  1821
    single_valued_rel_comp ~> single_valued_relcomp
haftmann@47549
  1822
    rel_comp_def ~> relcomp_unfold
bulwahn@47448
  1823
    converse_rel_comp ~> converse_relcomp
bulwahn@47448
  1824
    pred_compI ~> relcomppI
bulwahn@47448
  1825
    pred_compE ~> relcomppE
bulwahn@47448
  1826
    pred_comp_bot1 ~> relcompp_bot1
bulwahn@47448
  1827
    pred_comp_bot2 ~> relcompp_bot2
bulwahn@47448
  1828
    transp_pred_comp_less_eq ~> transp_relcompp_less_eq
bulwahn@47448
  1829
    pred_comp_mono ~> relcompp_mono
bulwahn@47448
  1830
    pred_comp_distrib ~> relcompp_distrib
bulwahn@47448
  1831
    pred_comp_distrib2 ~> relcompp_distrib2
bulwahn@47448
  1832
    converse_pred_comp ~> converse_relcompp
wenzelm@47464
  1833
bulwahn@47448
  1834
    finite_rel_comp ~> finite_relcomp
wenzelm@47464
  1835
bulwahn@47448
  1836
    set_rel_comp ~> set_relcomp
bulwahn@47448
  1837
bulwahn@47448
  1838
INCOMPATIBILITY.
bulwahn@47448
  1839
haftmann@47550
  1840
* Theory Divides: Discontinued redundant theorems about div and mod.
haftmann@47550
  1841
INCOMPATIBILITY, use the corresponding generic theorems instead.
haftmann@47550
  1842
haftmann@47550
  1843
  DIVISION_BY_ZERO ~> div_by_0, mod_by_0
haftmann@47550
  1844
  zdiv_self ~> div_self
haftmann@47550
  1845
  zmod_self ~> mod_self
haftmann@47550
  1846
  zdiv_zero ~> div_0
haftmann@47550
  1847
  zmod_zero ~> mod_0
haftmann@47550
  1848
  zdiv_zmod_equality ~> div_mod_equality2
haftmann@47550
  1849
  zdiv_zmod_equality2 ~> div_mod_equality
haftmann@47550
  1850
  zmod_zdiv_trivial ~> mod_div_trivial
haftmann@47550
  1851
  zdiv_zminus_zminus ~> div_minus_minus
haftmann@47550
  1852
  zmod_zminus_zminus ~> mod_minus_minus
haftmann@47550
  1853
  zdiv_zminus2 ~> div_minus_right
haftmann@47550
  1854
  zmod_zminus2 ~> mod_minus_right
haftmann@47550
  1855
  zdiv_minus1_right ~> div_minus1_right
haftmann@47550
  1856
  zmod_minus1_right ~> mod_minus1_right
haftmann@47550
  1857
  zdvd_mult_div_cancel ~> dvd_mult_div_cancel
haftmann@47550
  1858
  zmod_zmult1_eq ~> mod_mult_right_eq
haftmann@47550
  1859
  zpower_zmod ~> power_mod
haftmann@47550
  1860
  zdvd_zmod ~> dvd_mod
haftmann@47550
  1861
  zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
haftmann@47550
  1862
  mod_mult_distrib ~> mult_mod_left
haftmann@47550
  1863
  mod_mult_distrib2 ~> mult_mod_right
haftmann@47550
  1864
haftmann@47550
  1865
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
haftmann@47550
  1866
generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
haftmann@47550
  1867
haftmann@47551
  1868
* Finite_Set.fold now qualified.  INCOMPATIBILITY.
haftmann@47551
  1869
haftmann@47552
  1870
* Consolidated theorem names concerning fold combinators:
haftmann@47550
  1871
haftmann@47550
  1872
  inf_INFI_fold_inf ~> inf_INF_fold_inf
haftmann@47550
  1873
  sup_SUPR_fold_sup ~> sup_SUP_fold_sup
haftmann@47550
  1874
  INFI_fold_inf ~> INF_fold_inf
haftmann@47550
  1875
  SUPR_fold_sup ~> SUP_fold_sup
haftmann@47550
  1876
  union_set ~> union_set_fold
haftmann@47550
  1877
  minus_set ~> minus_set_fold
haftmann@47550
  1878
  INFI_set_fold ~> INF_set_fold
haftmann@47550
  1879
  SUPR_set_fold ~> SUP_set_fold
haftmann@47550
  1880
  INF_code ~> INF_set_foldr
haftmann@47550
  1881
  SUP_code ~> SUP_set_foldr
haftmann@47550
  1882
  foldr.simps ~> foldr.simps (in point-free formulation)
haftmann@47550
  1883
  foldr_fold_rev ~> foldr_conv_fold
haftmann@47550
  1884
  foldl_fold ~> foldl_conv_fold
haftmann@47550
  1885
  foldr_foldr ~> foldr_conv_foldl
haftmann@47550
  1886
  foldl_foldr ~> foldl_conv_foldr
haftmann@47552
  1887
  fold_set_remdups ~> fold_set_fold_remdups
haftmann@47552
  1888
  fold_set ~> fold_set_fold
haftmann@47552
  1889
  fold1_set ~> fold1_set_fold
haftmann@47550
  1890
haftmann@47550
  1891
INCOMPATIBILITY.
haftmann@47550
  1892
haftmann@47550
  1893
* Dropped rarely useful theorems concerning fold combinators:
haftmann@47550
  1894
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
haftmann@47550
  1895
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
haftmann@47550
  1896
concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
haftmann@47550
  1897
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
haftmann@47550
  1898
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
haftmann@47550
  1899
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
haftmann@47550
  1900
INCOMPATIBILITY.  For the common phrases "%xs. List.foldr plus xs 0"
haftmann@47550
  1901
and "List.foldl plus 0", prefer "List.listsum".  Otherwise it can be
haftmann@47550
  1902
useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
haftmann@47550
  1903
unfolding "foldr_conv_fold" and "foldl_conv_fold".
haftmann@47550
  1904
haftmann@47550
  1905
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
haftmann@47550
  1906
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
haftmann@47550
  1907
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
haftmann@47550
  1908
INF_set_foldr, SUP_set_foldr.  INCOMPATIBILITY.  Prefer corresponding
haftmann@47550
  1909
lemmas over fold rather than foldr, or make use of lemmas
haftmann@47550
  1910
fold_conv_foldr and fold_rev.
haftmann@47550
  1911
haftmann@47550
  1912
* Congruence rules Option.map_cong and Option.bind_cong for recursion
haftmann@47550
  1913
through option types.
haftmann@47550
  1914
wenzelm@47856
  1915
* "Transitive_Closure.ntrancl": bounded transitive closure on
wenzelm@47856
  1916
relations.
wenzelm@47856
  1917
wenzelm@47856
  1918
* Constant "Set.not_member" now qualified.  INCOMPATIBILITY.
wenzelm@47856
  1919
wenzelm@47856
  1920
* Theory Int: Discontinued many legacy theorems specific to type int.
wenzelm@47856
  1921
INCOMPATIBILITY, use the corresponding generic theorems instead.
wenzelm@47856
  1922
wenzelm@47856
  1923
  zminus_zminus ~> minus_minus
wenzelm@47856
  1924
  zminus_0 ~> minus_zero
wenzelm@47856
  1925
  zminus_zadd_distrib ~> minus_add_distrib
wenzelm@47856
  1926
  zadd_commute ~> add_commute
wenzelm@47856
  1927
  zadd_assoc ~> add_assoc
wenzelm@47856
  1928
  zadd_left_commute ~> add_left_commute
wenzelm@47856
  1929
  zadd_ac ~> add_ac
wenzelm@47856
  1930
  zmult_ac ~> mult_ac
wenzelm@47856
  1931
  zadd_0 ~> add_0_left
wenzelm@47856
  1932
  zadd_0_right ~> add_0_right
wenzelm@47856
  1933
  zadd_zminus_inverse2 ~> left_minus
wenzelm@47856
  1934
  zmult_zminus ~> mult_minus_left
wenzelm@47856
  1935
  zmult_commute ~> mult_commute
wenzelm@47856
  1936
  zmult_assoc ~> mult_assoc
wenzelm@47856
  1937
  zadd_zmult_distrib ~> left_distrib
wenzelm@47856
  1938
  zadd_zmult_distrib2 ~> right_distrib
wenzelm@47856
  1939
  zdiff_zmult_distrib ~> left_diff_distrib
wenzelm@47856
  1940
  zdiff_zmult_distrib2 ~> right_diff_distrib
wenzelm@47856
  1941
  zmult_1 ~> mult_1_left
wenzelm@47856
  1942
  zmult_1_right ~> mult_1_right
wenzelm@47856
  1943
  zle_refl ~> order_refl
wenzelm@47856
  1944
  zle_trans ~> order_trans
wenzelm@47856
  1945
  zle_antisym ~> order_antisym
wenzelm@47856
  1946
  zle_linear ~> linorder_linear
wenzelm@47856
  1947
  zless_linear ~> linorder_less_linear
wenzelm@47856
  1948
  zadd_left_mono ~> add_left_mono
wenzelm@47856
  1949
  zadd_strict_right_mono ~> add_strict_right_mono
wenzelm@47856
  1950
  zadd_zless_mono ~> add_less_le_mono
wenzelm@47856
  1951
  int_0_less_1 ~> zero_less_one
wenzelm@47856
  1952
  int_0_neq_1 ~> zero_neq_one
wenzelm@47856
  1953
  zless_le ~> less_le
wenzelm@47856
  1954
  zpower_zadd_distrib ~> power_add
wenzelm@47856
  1955
  zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
wenzelm@47856
  1956
  zero_le_zpower_abs ~> zero_le_power_abs
wenzelm@47856
  1957
wenzelm@47856
  1958
* Theory Deriv: Renamed
wenzelm@47856
  1959
wenzelm@47856
  1960
  DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
wenzelm@47856
  1961
wenzelm@47856
  1962
* Theory Library/Multiset: Improved code generation of multisets.
wenzelm@47856
  1963
wenzelm@47855
  1964
* Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
krauss@47703
  1965
are expressed via type classes again. The special syntax
krauss@47703
  1966
\<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
krauss@47703
  1967
setsum_set, which is now subsumed by Big_Operators.setsum.
krauss@47703
  1968
INCOMPATIBILITY.
krauss@47703
  1969
wenzelm@46160
  1970
* Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
wenzelm@46160
  1971
use theory HOL/Library/Nat_Bijection instead.
wenzelm@46160
  1972
wenzelm@47464
  1973
* Theory HOL/Library/RBT_Impl: Backing implementation of red-black
wenzelm@47464
  1974
trees is now inside a type class context.  Names of affected
wenzelm@47464
  1975
operations and lemmas have been prefixed by rbt_.  INCOMPATIBILITY for
wenzelm@47464
  1976
theories working directly with raw red-black trees, adapt the names as
wenzelm@47464
  1977
follows:
Andreas@47452
  1978
Andreas@47452
  1979
  Operations:
Andreas@47452
  1980
  bulkload -> rbt_bulkload
Andreas@47452
  1981
  del_from_left -> rbt_del_from_left
Andreas@47452
  1982
  del_from_right -> rbt_del_from_right
Andreas@47452
  1983
  del -> rbt_del
Andreas@47452
  1984
  delete -> rbt_delete
Andreas@47452
  1985
  ins -> rbt_ins
Andreas@47452
  1986
  insert -> rbt_insert
Andreas@47452
  1987
  insertw -> rbt_insert_with
Andreas@47452
  1988
  insert_with_key -> rbt_insert_with_key
Andreas@47452
  1989
  map_entry -> rbt_map_entry
Andreas@47452
  1990
  lookup -> rbt_lookup
Andreas@47452
  1991
  sorted -> rbt_sorted
Andreas@47452
  1992
  tree_greater -> rbt_greater
Andreas@47452
  1993
  tree_less -> rbt_less
Andreas@47452
  1994
  tree_less_symbol -> rbt_less_symbol
Andreas@47452
  1995
  union -> rbt_union
Andreas@47452
  1996
  union_with -> rbt_union_with
Andreas@47452
  1997
  union_with_key -> rbt_union_with_key
Andreas@47452
  1998
Andreas@47452
  1999
  Lemmas:
Andreas@47452
  2000
  balance_left_sorted -> balance_left_rbt_sorted
Andreas@47452
  2001
  balance_left_tree_greater -> balance_left_rbt_greater
Andreas@47452
  2002
  balance_left_tree_less -> balance_left_rbt_less
Andreas@47452
  2003
  balance_right_sorted -> balance_right_rbt_sorted
Andreas@47452
  2004
  balance_right_tree_greater -> balance_right_rbt_greater
Andreas@47452
  2005
  balance_right_tree_less -> balance_right_rbt_less
Andreas@47452
  2006
  balance_sorted -> balance_rbt_sorted
Andreas@47452
  2007
  balance_tree_greater -> balance_rbt_greater
Andreas@47452
  2008
  balance_tree_less -> balance_rbt_less
Andreas@47452
  2009
  bulkload_is_rbt -> rbt_bulkload_is_rbt
Andreas@47452
  2010
  combine_sorted -> combine_rbt_sorted
Andreas@47452
  2011
  combine_tree_greater -> combine_rbt_greater
Andreas@47452
  2012
  combine_tree_less -> combine_rbt_less
Andreas@47452
  2013
  delete_in_tree -> rbt_delete_in_tree
Andreas@47452
  2014
  delete_is_rbt -> rbt_delete_is_rbt
Andreas@47452
  2015
  del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
Andreas@47452
  2016
  del_from_left_tree_less -> rbt_del_from_left_rbt_less
Andreas@47452
  2017
  del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
Andreas@47452
  2018
  del_from_right_tree_less -> rbt_del_from_right_rbt_less
Andreas@47452
  2019
  del_in_tree -> rbt_del_in_tree
Andreas@47452
  2020
  del_inv1_inv2 -> rbt_del_inv1_inv2
Andreas@47452
  2021
  del_sorted -> rbt_del_rbt_sorted
Andreas@47452
  2022
  del_tree_greater -> rbt_del_rbt_greater
Andreas@47452
  2023
  del_tree_less -> rbt_del_rbt_less
Andreas@47452
  2024
  dom_lookup_Branch -> dom_rbt_lookup_Branch
Andreas@47452
  2025
  entries_lookup -> entries_rbt_lookup
Andreas@47452
  2026
  finite_dom_lookup -> finite_dom_rbt_lookup
Andreas@47452
  2027
  insert_sorted -> rbt_insert_rbt_sorted
Andreas@47452
  2028
  insertw_is_rbt -> rbt_insertw_is_rbt
Andreas@47452
  2029
  insertwk_is_rbt -> rbt_insertwk_is_rbt
Andreas@47452
  2030
  insertwk_sorted -> rbt_insertwk_rbt_sorted
Andreas@47452
  2031
  insertw_sorted -> rbt_insertw_rbt_sorted
Andreas@47452
  2032
  ins_sorted -> ins_rbt_sorted
Andreas@47452
  2033
  ins_tree_greater -> ins_rbt_greater
Andreas@47452
  2034
  ins_tree_less -> ins_rbt_less
Andreas@47452
  2035
  is_rbt_sorted -> is_rbt_rbt_sorted
Andreas@47452
  2036
  lookup_balance -> rbt_lookup_balance
Andreas@47452
  2037
  lookup_bulkload -> rbt_lookup_rbt_bulkload
Andreas@47452
  2038
  lookup_delete -> rbt_lookup_rbt_delete
Andreas@47452
  2039
  lookup_Empty -> rbt_lookup_Empty
Andreas@47452
  2040
  lookup_from_in_tree -> rbt_lookup_from_in_tree
Andreas@47452
  2041
  lookup_in_tree -> rbt_lookup_in_tree
Andreas@47452
  2042
  lookup_ins -> rbt_lookup_ins
Andreas@47452
  2043
  lookup_insert -> rbt_lookup_rbt_insert
Andreas@47452
  2044
  lookup_insertw -> rbt_lookup_rbt_insertw
Andreas@47452
  2045
  lookup_insertwk -> rbt_lookup_rbt_insertwk
Andreas@47452
  2046
  lookup_keys -> rbt_lookup_keys
Andreas@47452
  2047
  lookup_map -> rbt_lookup_map
Andreas@47452
  2048
  lookup_map_entry -> rbt_lookup_rbt_map_entry
Andreas@47452
  2049
  lookup_tree_greater -> rbt_lookup_rbt_greater
Andreas@47452
  2050
  lookup_tree_less -> rbt_lookup_rbt_less
Andreas@47452
  2051
  lookup_union -> rbt_lookup_rbt_union
Andreas@47452
  2052
  map_entry_color_of -> rbt_map_entry_color_of
Andreas@47452
  2053
  map_entry_inv1 -> rbt_map_entry_inv1
Andreas@47452
  2054
  map_entry_inv2 -> rbt_map_entry_inv2
Andreas@47452
  2055
  map_entry_is_rbt -> rbt_map_entry_is_rbt
Andreas@47452
  2056
  map_entry_sorted -> rbt_map_entry_rbt_sorted
Andreas@47452
  2057
  map_entry_tree_greater -> rbt_map_entry_rbt_greater
Andreas@47452
  2058
  map_entry_tree_less -> rbt_map_entry_rbt_less
Andreas@47452
  2059
  map_tree_greater -> map_rbt_greater
Andreas@47452
  2060
  map_tree_less -> map_rbt_less
Andreas@47452
  2061
  map_sorted -> map_rbt_sorted
Andreas@47452
  2062
  paint_sorted -> paint_rbt_sorted
Andreas@47452
  2063
  paint_lookup -> paint_rbt_lookup
Andreas@47452
  2064
  paint_tree_greater -> paint_rbt_greater
Andreas@47452
  2065
  paint_tree_less -> paint_rbt_less
Andreas@47452
  2066
  sorted_entries -> rbt_sorted_entries
Andreas@47452
  2067
  tree_greater_eq_trans -> rbt_greater_eq_trans
Andreas@47452
  2068
  tree_greater_nit -> rbt_greater_nit
Andreas@47452
  2069
  tree_greater_prop -> rbt_greater_prop
Andreas@47452
  2070
  tree_greater_simps -> rbt_greater_simps
Andreas@47452
  2071
  tree_greater_trans -> rbt_greater_trans
Andreas@47452
  2072
  tree_less_eq_trans -> rbt_less_eq_trans
Andreas@47452
  2073
  tree_less_nit -> rbt_less_nit
Andreas@47452
  2074
  tree_less_prop -> rbt_less_prop
Andreas@47452
  2075
  tree_less_simps -> rbt_less_simps
Andreas@47452
  2076
  tree_less_trans -> rbt_less_trans
Andreas@47452
  2077
  tree_ord_props -> rbt_ord_props
Andreas@47452
  2078
  union_Branch -> rbt_union_Branch
Andreas@47452
  2079
  union_is_rbt -> rbt_union_is_rbt
Andreas@47452
  2080
  unionw_is_rbt -> rbt_unionw_is_rbt
Andreas@47452
  2081
  unionwk_is_rbt -> rbt_unionwk_is_rbt
Andreas@47452
  2082
  unionwk_sorted -> rbt_unionwk_rbt_sorted
Andreas@47452
  2083
wenzelm@47807
  2084
* Theory HOL/Library/Float: Floating point numbers are now defined as
wenzelm@47807
  2085
a subset of the real numbers.  All operations are defined using the
wenzelm@47807
  2086
lifing-framework and proofs use the transfer method.  INCOMPATIBILITY.
hoelzl@47616
  2087
hoelzl@47616
  2088
  Changed Operations:
hoelzl@47622
  2089
  float_abs -> abs
hoelzl@47622
  2090
  float_nprt -> nprt
hoelzl@47622
  2091
  float_pprt -> pprt
hoelzl@47622
  2092
  pow2 -> use powr
hoelzl@47622
  2093
  round_down -> float_round_down
hoelzl@47622
  2094
  round_up -> float_round_up
hoelzl@47622
  2095
  scale -> exponent
hoelzl@47622
  2096
hoelzl@47622
  2097
  Removed Operations:
hoelzl@47622
  2098
  ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
hoelzl@47622
  2099
hoelzl@47622
  2100
  Renamed Lemmas:
hoelzl@47622
  2101
  abs_float_def -> Float.compute_float_abs
hoelzl@47622
  2102
  bitlen_ge0 -> bitlen_nonneg
hoelzl@47622
  2103
  bitlen.simps -> Float.compute_bitlen
hoelzl@47622
  2104
  float_components -> Float_mantissa_exponent
hoelzl@47622
  2105
  float_divl.simps -> Float.compute_float_divl
hoelzl@47622
  2106
  float_divr.simps -> Float.compute_float_divr
hoelzl@47622
  2107
  float_eq_odd -> mult_powr_eq_mult_powr_iff
hoelzl@47622
  2108
  float_power -> real_of_float_power
hoelzl@47622
  2109
  lapprox_posrat_def -> Float.compute_lapprox_posrat
hoelzl@47622
  2110
  lapprox_rat.simps -> Float.compute_lapprox_rat
hoelzl@47622
  2111
  le_float_def' -> Float.compute_float_le
hoelzl@47622
  2112
  le_float_def -> less_eq_float.rep_eq
hoelzl@47622
  2113
  less_float_def' -> Float.compute_float_less
hoelzl@47622
  2114
  less_float_def -> less_float.rep_eq
hoelzl@47622
  2115
  normfloat_def -> Float.compute_normfloat
hoelzl@47622
  2116
  normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
hoelzl@47622
  2117
  normfloat -> normfloat_def
hoelzl@47622
  2118
  normfloat_unique -> use normfloat_def
hoelzl@47622
  2119
  number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
hoelzl@47622
  2120
  one_float_def -> Float.compute_float_one
hoelzl@47622
  2121
  plus_float_def -> Float.compute_float_plus
hoelzl@47622
  2122
  rapprox_posrat_def -> Float.compute_rapprox_posrat
hoelzl@47622
  2123
  rapprox_rat.simps -> Float.compute_rapprox_rat
hoelzl@47622
  2124
  real_of_float_0 -> zero_float.rep_eq
hoelzl@47622
  2125
  real_of_float_1 -> one_float.rep_eq
hoelzl@47622
  2126
  real_of_float_abs -> abs_float.rep_eq
hoelzl@47622
  2127
  real_of_float_add -> plus_float.rep_eq
hoelzl@47622
  2128
  real_of_float_minus -> uminus_float.rep_eq
hoelzl@47622
  2129
  real_of_float_mult -> times_float.rep_eq
hoelzl@47622
  2130
  real_of_float_simp -> Float.rep_eq
hoelzl@47622
  2131
  real_of_float_sub -> minus_float.rep_eq
hoelzl@47622
  2132
  round_down.simps -> Float.compute_float_round_down
hoelzl@47622
  2133
  round_up.simps -> Float.compute_float_round_up
hoelzl@47622
  2134
  times_float_def -> Float.compute_float_times
hoelzl@47622
  2135
  uminus_float_def -> Float.compute_float_uminus
hoelzl@47622
  2136
  zero_float_def -> Float.compute_float_zero
hoelzl@47622
  2137
hoelzl@47622
  2138
  Lemmas not necessary anymore, use the transfer method:
hoelzl@47622
  2139
  bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
hoelzl@47622
  2140
  float_divr, float_le_simp, float_less1_mantissa_bound,
hoelzl@47622
  2141
  float_less_simp, float_less_zero, float_le_zero,
hoelzl@47622
  2142
  float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
hoelzl@47622
  2143
  floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
hoelzl@47622
  2144
  lapprox_rat_bottom, normalized_float, rapprox_posrat,
hoelzl@47622
  2145
  rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
hoelzl@47622
  2146
  real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
hoelzl@47622
  2147
  round_up, zero_le_float, zero_less_float
hoelzl@47616
  2148
wenzelm@47856
  2149
* New theory HOL/Library/DAList provides an abstract type for
wenzelm@47856
  2150
association lists with distinct keys.
noschinl@45791
  2151
wenzelm@47866
  2152
* Session HOL/IMP: Added new theory of abstract interpretation of
wenzelm@47866
  2153
annotated commands.
wenzelm@47866
  2154
wenzelm@47855
  2155
* Session HOL-Import: Re-implementation from scratch is faster,
wenzelm@47855
  2156
simpler, and more scalable.  Requires a proof bundle, which is
wenzelm@47855
  2157
available as an external component.  Discontinued old (and mostly
wenzelm@47855
  2158
dead) Importer for HOL4 and HOL Light.  INCOMPATIBILITY.
wenzelm@47855
  2159
wenzelm@47855
  2160
* Session HOL-Word: Discontinued many redundant theorems specific to
wenzelm@47855
  2161
type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
wenzelm@47855
  2162
instead.
wenzelm@47855
  2163
wenzelm@47855
  2164
  word_sub_alt ~> word_sub_wi
wenzelm@47855
  2165
  word_add_alt ~> word_add_def
wenzelm@47855
  2166
  word_mult_alt ~> word_mult_def
wenzelm@47855
  2167
  word_minus_alt ~> word_minus_def
wenzelm@47855
  2168
  word_0_alt ~> word_0_wi
wenzelm@47855
  2169
  word_1_alt ~> word_1_wi
wenzelm@47855
  2170
  word_add_0 ~> add_0_left
wenzelm@47855
  2171
  word_add_0_right ~> add_0_right
wenzelm@47855
  2172
  word_mult_1 ~> mult_1_left
wenzelm@47855
  2173
  word_mult_1_right ~> mult_1_right
wenzelm@47855
  2174
  word_add_commute ~> add_commute
wenzelm@47855
  2175
  word_add_assoc ~> add_assoc
wenzelm@47855
  2176
  word_add_left_commute ~> add_left_commute
wenzelm@47855
  2177
  word_mult_commute ~> mult_commute
wenzelm@47855
  2178
  word_mult_assoc ~> mult_assoc
wenzelm@47855
  2179
  word_mult_left_commute ~> mult_left_commute
wenzelm@47855
  2180
  word_left_distrib ~> left_distrib
wenzelm@47855
  2181
  word_right_distrib ~> right_distrib
wenzelm@47855
  2182
  word_left_minus ~> left_minus
wenzelm@47855
  2183
  word_diff_0_right ~> diff_0_right
wenzelm@47855
  2184
  word_diff_self ~> diff_self
wenzelm@47855
  2185
  word_sub_def ~> diff_minus
wenzelm@47855
  2186
  word_diff_minus ~> diff_minus
wenzelm@47855
  2187
  word_add_ac ~> add_ac
wenzelm@47855
  2188
  word_mult_ac ~> mult_ac
wenzelm@47855
  2189
  word_plus_ac0 ~> add_0_left add_0_right add_ac
wenzelm@47855
  2190
  word_times_ac1 ~> mult_1_left mult_1_right mult_ac
wenzelm@47855
  2191
  word_order_trans ~> order_trans
wenzelm@47855
  2192
  word_order_refl ~> order_refl
wenzelm@47855
  2193
  word_order_antisym ~> order_antisym
wenzelm@47855
  2194
  word_order_linear ~> linorder_linear
wenzelm@47855
  2195
  lenw1_zero_neq_one ~> zero_neq_one
wenzelm@47855
  2196
  word_number_of_eq ~> number_of_eq
wenzelm@47855
  2197
  word_of_int_add_hom ~> wi_hom_add
wenzelm@47855
  2198
  word_of_int_sub_hom ~> wi_hom_sub
wenzelm@47855
  2199
  word_of_int_mult_hom ~> wi_hom_mult
wenzelm@47855
  2200
  word_of_int_minus_hom ~> wi_hom_neg
wenzelm@47855
  2201
  word_of_int_succ_hom ~> wi_hom_succ
wenzelm@47855
  2202
  word_of_int_pred_hom ~> wi_hom_pred
wenzelm@47855
  2203
  word_of_int_0_hom ~> word_0_wi
wenzelm@47855
  2204
  word_of_int_1_hom ~> word_1_wi
wenzelm@47855
  2205
wenzelm@47809
  2206
* Session HOL-Word: New proof method "word_bitwise" for splitting
wenzelm@47809
  2207
machine word equalities and inequalities into logical circuits,
wenzelm@47809
  2208
defined in HOL/Word/WordBitwise.thy.  Supports addition, subtraction,
wenzelm@47809
  2209
multiplication, shifting by constants, bitwise operators and numeric
wenzelm@47809
  2210
constants.  Requires fixed-length word types, not 'a word.  Solves
wenzelm@47854
  2211
many standard word identities outright and converts more into first
wenzelm@47809
  2212
order problems amenable to blast or similar.  See also examples in
wenzelm@47809
  2213
HOL/Word/Examples/WordExamples.thy.
wenzelm@47809
  2214
wenzelm@47807
  2215
* Session HOL-Probability: Introduced the type "'a measure" to
wenzelm@47807
  2216
represent measures, this replaces the records 'a algebra and 'a
wenzelm@47807
  2217
measure_space.  The locales based on subset_class now have two
wenzelm@47856
  2218
locale-parameters the space \<Omega> and the set of measurable sets M.
wenzelm@47856
  2219
The product of probability spaces uses now the same constant as the
wenzelm@47856
  2220
finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
wenzelm@47807
  2221
measure".  Most constants are defined now outside of locales and gain
wenzelm@47807
  2222
an additional parameter, like null_sets, almost_eventually or \<mu>'.
wenzelm@47807
  2223
Measure space constructions for distributions and densities now got
wenzelm@47807
  2224
their own constants distr and density.  Instead of using locales to
wenzelm@47807
  2225
describe measure spaces with a finite space, the measure count_space
wenzelm@47807
  2226
and point_measure is introduced.  INCOMPATIBILITY.
hoelzl@47694
  2227
hoelzl@47694
  2228
  Renamed constants:
hoelzl@47694
  2229
  measure -> emeasure
hoelzl@47694
  2230
  finite_measure.\<mu>' -> measure
hoelzl@47694
  2231
  product_algebra_generator -> prod_algebra
hoelzl@47694
  2232
  product_prob_space.emb -> prod_emb
hoelzl@47694
  2233
  product_prob_space.infprod_algebra -> PiM
hoelzl@47694
  2234
hoelzl@47694
  2235
  Removed locales:
hoelzl@47694
  2236
  completeable_measure_space
hoelzl@47694
  2237
  finite_measure_space
hoelzl@47694
  2238
  finite_prob_space
hoelzl@47694
  2239
  finite_product_finite_prob_space
hoelzl@47694
  2240
  finite_product_sigma_algebra
hoelzl@47694
  2241
  finite_sigma_algebra
hoelzl@47694
  2242
  measure_space
hoelzl@47694
  2243
  pair_finite_prob_space
hoelzl@47694
  2244
  pair_finite_sigma_algebra
hoelzl@47694
  2245
  pair_finite_space
hoelzl@47694
  2246
  pair_sigma_algebra
hoelzl@47694
  2247
  product_sigma_algebra
hoelzl@47694
  2248
hoelzl@47694
  2249
  Removed constants:
hoelzl@47751
  2250
  conditional_space
hoelzl@47694
  2251
  distribution -> use distr measure, or distributed predicate
hoelzl@47751
  2252
  image_space
hoelzl@47694
  2253
  joint_distribution -> use distr measure, or distributed predicate
hoelzl@47751
  2254
  pair_measure_generator
hoelzl@47694
  2255
  product_prob_space.infprod_algebra -> use PiM
hoelzl@47694
  2256
  subvimage
hoelzl@47694
  2257
hoelzl@47694
  2258
  Replacement theorems:
hoelzl@47751
  2259
  finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
hoelzl@47751
  2260
  finite_measure.empty_measure -> measure_empty
hoelzl@47751
  2261
  finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
hoelzl@47751
  2262
  finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
hoelzl@47751
  2263
  finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
hoelzl@47751
  2264
  finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
hoelzl@47751
  2265
  finite_measure.finite_measure -> finite_measure.emeasure_finite
hoelzl@47751
  2266
  finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
hoelzl@47751
  2267
  finite_measure.positive_measure' -> measure_nonneg
hoelzl@47751
  2268
  finite_measure.real_measure -> finite_measure.emeasure_real
hoelzl@47751
  2269
  finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
hoelzl@47751
  2270
  finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
hoelzl@47751
  2271
  finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
hoelzl@47751
  2272
  information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
hoelzl@47751
  2273
  information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
hoelzl@47751
  2274
  information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
hoelzl@47751
  2275
  information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
hoelzl@47751
  2276
  information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
hoelzl@47751
  2277
  information_space.entropy_commute -> information_space.entropy_commute_simple
hoelzl@47751
  2278
  information_space.entropy_eq -> information_space.entropy_simple_distributed
hoelzl@47751
  2279
  information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
hoelzl@47751
  2280
  information_space.entropy_positive -> information_space.entropy_nonneg_simple
hoelzl@47751
  2281
  information_space.entropy_uniform_max -> information_space.entropy_uniform
hoelzl@47751
  2282
  information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
hoelzl@47751
  2283
  information_space.KL_eq_0 -> information_space.KL_same_eq_0
hoelzl@47751
  2284
  information_space.KL_ge_0 -> information_space.KL_nonneg
hoelzl@47751
  2285
  information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
hoelzl@47751
  2286
  information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
hoelzl@47751
  2287
  Int_stable_cuboids -> Int_stable_atLeastAtMost
hoelzl@47751
  2288
  Int_stable_product_algebra_generator -> positive_integral
hoelzl@47751
  2289
  measure_preserving -> equality "distr M N f = N" "f : measurable M N"
hoelzl@47694
  2290
  measure_space.additive -> emeasure_additive
hoelzl@47751
  2291
  measure_space.AE_iff_null_set -> AE_iff_null
hoelzl@47751
  2292
  measure_space.almost_everywhere_def -> eventually_ae_filter
hoelzl@47751
  2293
  measure_space.almost_everywhere_vimage -> AE_distrD
hoelzl@47751
  2294
  measure_space.continuity_from_above -> INF_emeasure_decseq
hoelzl@47751
  2295
  measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
hoelzl@47751
  2296
  measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
hoelzl@47694
  2297
  measure_space.continuity_from_below -> SUP_emeasure_incseq
hoelzl@47751
  2298
  measure_space_density -> emeasure_density
hoelzl@47751
  2299
  measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
hoelzl@47751
  2300
  measure_space.integrable_vimage -> integrable_distr
hoelzl@47751
  2301
  measure_space.integral_translated_density -> integral_density
hoelzl@47751
  2302
  measure_space.integral_vimage -> integral_distr
hoelzl@47751
  2303
  measure_space.measure_additive -> plus_emeasure
hoelzl@47751
  2304
  measure_space.measure_compl -> emeasure_compl
hoelzl@47751
  2305
  measure_space.measure_countable_increasing -> emeasure_countable_increasing
hoelzl@47751
  2306
  measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
hoelzl@47694
  2307
  measure_space.measure_decseq -> decseq_emeasure
hoelzl@47751
  2308
  measure_space.measure_Diff -> emeasure_Diff
hoelzl@47751
  2309
  measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
hoelzl@47694
  2310
  measure_space.measure_eq_0 -> emeasure_eq_0
hoelzl@47694
  2311
  measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
hoelzl@47751
  2312
  measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
hoelzl@47751
  2313
  measure_space.measure_incseq -> incseq_emeasure
hoelzl@47751
  2314
  measure_space.measure_insert -> emeasure_insert
hoelzl@47751
  2315
  measure_space.measure_mono -> emeasure_mono
hoelzl@47751
  2316
  measure_space.measure_not_negative -> emeasure_not_MInf
hoelzl@47751
  2317
  measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
hoelzl@47751
  2318
  measure_space.measure_setsum -> setsum_emeasure
hoelzl@47751
  2319
  measure_space.measure_setsum_split -> setsum_emeasure_cover
hoelzl@47694
  2320
  measure_space.measure_space_vimage -> emeasure_distr
hoelzl@47751
  2321
  measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
hoelzl@47751
  2322
  measure_space.measure_subadditive -> subadditive
hoelzl@47751
  2323
  measure_space.measure_top -> emeasure_space
hoelzl@47751
  2324
  measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
hoelzl@47751
  2325
  measure_space.measure_Un_null_set -> emeasure_Un_null_set
hoelzl@47751
  2326
  measure_space.positive_integral_translated_density -> positive_integral_density
hoelzl@47751
  2327
  measure_space.positive_integral_vimage -> positive_integral_distr
hoelzl@47694
  2328
  measure_space.real_continuity_from_above -> Lim_measure_decseq
hoelzl@47751
  2329
  measure_space.real_continuity_from_below -> Lim_measure_incseq
hoelzl@47694
  2330
  measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
hoelzl@47751
  2331
  measure_space.real_measure_Diff -> measure_Diff
hoelzl@47751
  2332
  measure_space.real_measure_finite_Union -> measure_finite_Union
hoelzl@47751
  2333
  measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
hoelzl@47751
  2334
  measure_space.real_measure_subadditive -> measure_subadditive
hoelzl@47751
  2335
  measure_space.real_measure_Union -> measure_Union
hoelzl@47751
  2336
  measure_space.real_measure_UNION -> measure_UNION
hoelzl@47694
  2337
  measure_space.simple_function_vimage -> simple_function_comp
hoelzl@47694
  2338
  measure_space.simple_integral_vimage -> simple_integral_distr
hoelzl@47751
  2339
  measure_space.simple_integral_vimage -> simple_integral_distr
hoelzl@47751
  2340
  measure_unique_Int_stable -> measure_eqI_generator_eq
hoelzl@47751
  2341
  measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
hoelzl@47694
  2342
  pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
hoelzl@47694
  2343
  pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
hoelzl@47694
  2344
  pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
hoelzl@47694
  2345
  pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
hoelzl@47694
  2346
  pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
hoelzl@47694
  2347
  pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
hoelzl@47694
  2348
  pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
hoelzl@47694
  2349
  pair_sigma_algebra.sets_swap -> sets_pair_swap
hoelzl@47751
  2350
  pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
hoelzl@47751
  2351
  pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
hoelzl@47751
  2352
  pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
hoelzl@47751
  2353
  pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
hoelzl@47751
  2354
  pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
hoelzl@47751
  2355
  pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
hoelzl@47751
  2356
  prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
hoelzl@47751
  2357
  prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
hoelzl@47694
  2358
  prob_space.measure_space_1 -> prob_space.emeasure_space_1
hoelzl@47694
  2359
  prob_space.prob_space_vimage -> prob_space_distr
hoelzl@47694
  2360
  prob_space.random_variable_restrict -> measurable_restrict
hoelzl@47751
  2361
  prob_space_unique_Int_stable -> measure_eqI_prob_space
hoelzl@47751
  2362
  product_algebraE -> prod_algebraE_all
hoelzl@47751
  2363
  product_algebra_generator_der -> prod_algebra_eq_finite
hoelzl@47751
  2364
  product_algebra_generator_into_space -> prod_algebra_sets_into_space
hoelzl@47751
  2365
  product_algebraI -> sets_PiM_I_finite
hoelzl@47751
  2366
  product_measure_exists -> product_sigma_finite.sigma_finite
hoelzl@47694
  2367
  product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
hoelzl@47694
  2368
  product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
hoelzl@47694
  2369
  product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
hoelzl@47694
  2370
  product_prob_space.measurable_component -> measurable_component_singleton
hoelzl@47694
  2371
  product_prob_space.measurable_emb -> measurable_prod_emb
hoelzl@47694
  2372
  product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
hoelzl@47694
  2373
  product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
hoelzl@47694
  2374
  product_prob_space.measure_emb -> emeasure_prod_emb
hoelzl@47751
  2375
  product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
hoelzl@47751
  2376
  product_sigma_algebra.product_algebra_into_space -> space_closed
hoelzl@47751
  2377
  product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
hoelzl@47751
  2378
  product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
hoelzl@47751
  2379
  product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
hoelzl@47694
  2380
  sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
hoelzl@47751
  2381
  sets_product_algebra -> sets_PiM
hoelzl@47751
  2382
  sigma_algebra.measurable_sigma -> measurable_measure_of
hoelzl@47751
  2383
  sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
hoelzl@47751
  2384
  sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
hoelzl@47751
  2385
  sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
hoelzl@47751
  2386
  space_product_algebra -> space_PiM
hoelzl@47694
  2387
wenzelm@47855
  2388
* Session HOL-TPTP: support to parse and import TPTP problems (all
wenzelm@47855
  2389
languages) into Isabelle/HOL.
wenzelm@47413
  2390
blanchet@45398
  2391
noschinl@45160
  2392
*** FOL ***
noschinl@45160
  2393
wenzelm@45383
  2394
* New "case_product" attribute (see HOL).
noschinl@45160
  2395
wenzelm@45109
  2396
wenzelm@47463
  2397
*** ZF ***
wenzelm@47463
  2398
wenzelm@47463
  2399
* Greater support for structured proofs involving induction or case
wenzelm@47463
  2400
analysis.
wenzelm@47463
  2401
wenzelm@47463
  2402
* Much greater use of mathematical symbols.
wenzelm@47463
  2403
wenzelm@47463
  2404
* Removal of many ML theorem bindings.  INCOMPATIBILITY.
wenzelm@47463
  2405
wenzelm@47463
  2406
wenzelm@45128
  2407
*** ML ***
wenzelm@45128
  2408
wenzelm@46948
  2409
* Antiquotation @{keyword "name"} produces a parser for outer syntax
wenzelm@46948
  2410
from a minor keyword introduced via theory header declaration.
wenzelm@46948
  2411
wenzelm@46961
  2412
* Antiquotation @{command_spec "name"} produces the
wenzelm@46961
  2413
Outer_Syntax.command_spec from a major keyword introduced via theory
wenzelm@46961
  2414
header declaration; it can be passed to Outer_Syntax.command etc.
wenzelm@46961
  2415
wenzelm@46916
  2416
* Local_Theory.define no longer hard-wires default theorem name
wenzelm@46992
  2417
"foo_def", but retains the binding as given.  If that is Binding.empty
wenzelm@46992
  2418
/ Attrib.empty_binding, the result is not registered as user-level
wenzelm@46992
  2419
fact.  The Local_Theory.define_internal variant allows to specify a
wenzelm@46992
  2420
non-empty name (used for the foundation in the background theory),
wenzelm@46992
  2421
while omitting the fact binding in the user-context.  Potential
wenzelm@46992
  2422
INCOMPATIBILITY for derived definitional packages: need to specify
wenzelm@46992
  2423
naming policy for primitive definitions more explicitly.
wenzelm@46916
  2424
wenzelm@46497
  2425
* Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
wenzelm@46497
  2426
conformance with similar operations in structure Term and Logic.
wenzelm@46497
  2427
wenzelm@45592
  2428
* Antiquotation @{attributes [...]} embeds attribute source
wenzelm@45592
  2429
representation into the ML text, which is particularly useful with
wenzelm@45592
  2430
declarations like Local_Theory.note.
wenzelm@45592
  2431
wenzelm@45128
  2432
* Structure Proof_Context follows standard naming scheme.  Old
wenzelm@45128
  2433
ProofContext has been discontinued.  INCOMPATIBILITY.
wenzelm@45128
  2434
wenzelm@45293
  2435
* Refined Local_Theory.declaration {syntax, pervasive}, with subtle
wenzelm@45298
  2436
change of semantics: update is applied to auxiliary local theory
wenzelm@45293
  2437
context as well.
wenzelm@45293
  2438
wenzelm@45620
  2439
* Modernized some old-style infix operations:
wenzelm@45620
  2440
wenzelm@45620
  2441
  addeqcongs    ~> Simplifier.add_eqcong
wenzelm@45620
  2442
  deleqcongs    ~> Simplifier.del_eqcong
wenzelm@45620
  2443
  addcongs      ~> Simplifier.add_cong
wenzelm@45620
  2444
  delcongs      ~> Simplifier.del_cong
wenzelm@45625
  2445
  setmksimps    ~> Simplifier.set_mksimps
wenzelm@45625
  2446
  setmkcong     ~> Simplifier.set_mkcong
wenzelm@45625
  2447
  setmksym      ~> Simplifier.set_mksym
wenzelm@45625
  2448
  setmkeqTrue   ~> Simplifier.set_mkeqTrue
wenzelm@45625
  2449
  settermless   ~> Simplifier.set_termless
wenzelm@45625
  2450
  setsubgoaler  ~> Simplifier.set_subgoaler
wenzelm@45620
  2451
  addsplits     ~> Splitter.add_split
wenzelm@45620
  2452
  delsplits     ~> Splitter.del_split
wenzelm@45620
  2453
wenzelm@45128
  2454
wenzelm@47461
  2455
*** System ***
wenzelm@47461
  2456
wenzelm@47661
  2457
* USER_HOME settings variable points to cross-platform user home
wenzelm@47661
  2458
directory, which coincides with HOME on POSIX systems only.  Likewise,
wenzelm@47661
  2459
the Isabelle path specification "~" now expands to $USER_HOME, instead
wenzelm@47661
  2460
of former $HOME.  A different default for USER_HOME may be set
wenzelm@47661
  2461
explicitly in shell environment, before Isabelle settings are
wenzelm@47661
  2462
evaluated.  Minor INCOMPATIBILITY: need to adapt Isabelle path where
wenzelm@47661
  2463
the generic user home was intended.
wenzelm@47661
  2464
wenzelm@47807
  2465
* ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
wenzelm@47807
  2466
notation, which is useful for the jEdit file browser, for example.
wenzelm@47807
  2467
wenzelm@47464
  2468
* ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
wenzelm@47464
  2469
(not just JRE).
wenzelm@47464
  2470
wenzelm@47461
  2471
wenzelm@45109
  2472
wenzelm@44801
  2473
New in Isabelle2011-1 (October 2011)
wenzelm@44801
  2474
------------------------------------
wenzelm@41651
  2475
wenzelm@41703
  2476
*** General ***
wenzelm@41703
  2477
wenzelm@44760
  2478
* Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
wenzelm@44968
  2479
"isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
wenzelm@44760
  2480
wenzelm@44777
  2481
  - Management of multiple theory files directly from the editor
wenzelm@44760
  2482
    buffer store -- bypassing the file-system (no requirement to save
wenzelm@44760
  2483
    files for checking).
wenzelm@44760
  2484
wenzelm@44777
  2485
  - Markup of formal entities within the text buffer, with semantic
wenzelm@44760
  2486
    highlighting, tooltips and hyperlinks to jump to defining source
wenzelm@44760
  2487
    positions.
wenzelm@44760
  2488
wenzelm@44777
  2489
  - Improved text rendering, with sub/superscripts in the source
wenzelm@44777
  2490
    buffer (including support for copy/paste wrt. output panel, HTML
wenzelm@44777
  2491
    theory output and other non-Isabelle text boxes).
wenzelm@44777
  2492
wenzelm@44777
  2493
  - Refined scheduling of proof checking and printing of results,
wenzelm@44760
  2494
    based on interactive editor view.  (Note: jEdit folding and
wenzelm@44760
  2495
    narrowing allows to restrict buffer perspectives explicitly.)
wenzelm@44760
  2496
wenzelm@44777
  2497
  - Reduced CPU performance requirements, usable on machines with few
wenzelm@44760
  2498
    cores.
wenzelm@44760
  2499
wenzelm@44777
  2500
  - Reduced memory requirements due to pruning of unused document
wenzelm@44760
  2501
    versions (garbage collection).
wenzelm@44760
  2502
wenzelm@44760
  2503
See also ~~/src/Tools/jEdit/README.html for further information,
wenzelm@44760
  2504
including some remaining limitations.
wenzelm@44760
  2505
wenzelm@44800
  2506
* Theory loader: source files are exclusively located via the master
wenzelm@44800
  2507
directory of each theory node (where the .thy file itself resides).
wenzelm@44800
  2508
The global load path (such as src/HOL/Library) has been discontinued.
wenzelm@44800
  2509
Note that the path element ~~ may be used to reference theories in the
wenzelm@44800
  2510
Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
wenzelm@44800
  2511
INCOMPATIBILITY.
wenzelm@44800
  2512
wenzelm@41955
  2513
* Theory loader: source files are identified by content via SHA1
wenzelm@41955
  2514
digests.  Discontinued former path/modtime identification and optional
wenzelm@41955
  2515
ISABELLE_FILE_IDENT plugin scripts.
wenzelm@41955
  2516
wenzelm@41703
  2517
* Parallelization of nested Isar proofs is subject to
wenzelm@41703
  2518
Goal.parallel_proofs_threshold (default 100).  See also isabelle
wenzelm@41703
  2519
usedir option -Q.
wenzelm@41703
  2520
wenzelm@42669
  2521
* Name space: former unsynchronized references are now proper
wenzelm@42669
  2522
configuration options, with more conventional names:
wenzelm@42669
  2523
wenzelm@42669
  2524
  long_names   ~> names_long
wenzelm@42669
  2525
  short_names  ~> names_short
wenzelm@42669
  2526
  unique_names ~> names_unique
wenzelm@42669
  2527
wenzelm@42669
  2528
Minor INCOMPATIBILITY, need to declare options in context like this:
wenzelm@42669
  2529
wenzelm@42669
  2530
  declare [[names_unique = false]]
wenzelm@42358
  2531
wenzelm@42502
  2532
* Literal facts `prop` may contain dummy patterns, e.g. `_ = _`.  Note
wenzelm@42502
  2533
that the result needs to be unique, which means fact specifications
wenzelm@42502
  2534
may have to be refined after enriching a proof context.
wenzelm@42502
  2535
wenzelm@44800
  2536
* Attribute "case_names" has been refined: the assumptions in each case
wenzelm@44800
  2537
can be named now by following the case name with [name1 name2 ...].
wenzelm@44800
  2538
wenzelm@44968
  2539
* Isabelle/Isar reference manual has been updated and extended:
wenzelm@44968
  2540
  - "Synopsis" provides a catalog of main Isar language concepts.
wenzelm@44968
  2541
  - Formal references in syntax diagrams, via @{rail} antiquotation.
wenzelm@44968
  2542
  - Updated material from classic "ref" manual, notably about
wenzelm@44968
  2543
    "Classical Reasoner".
wenzelm@42633
  2544
wenzelm@41703
  2545
blanchet@41727
  2546
*** HOL ***
blanchet@41727
  2547
wenzelm@44968
  2548
* Class bot and top require underlying partial order rather than
wenzelm@44800
  2549
preorder: uniqueness of bot and top is guaranteed.  INCOMPATIBILITY.
haftmann@43815
  2550
haftmann@43940
  2551
* Class complete_lattice: generalized a couple of lemmas from sets;
wenzelm@44800
  2552
generalized theorems INF_cong and SUP_cong.  New type classes for
wenzelm@44800
  2553
complete boolean algebras and complete linear orders.  Lemmas
wenzelm@44800
  2554
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
wenzelm@44800
  2555
class complete_linorder.
wenzelm@44800
  2556
wenzelm@44800
  2557
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
wenzelm@44800
  2558
Sup_fun_def, Inf_apply, Sup_apply.
wenzelm@44800
  2559
wenzelm@45088
  2560
Removed redundant lemmas (the right hand side gives hints how to
wenzelm@45088
  2561
replace them for (metis ...), or (simp only: ...) proofs):
hoelzl@45041
  2562
hoelzl@45041
  2563
  Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
hoelzl@45041
  2564
  Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
hoelzl@45041
  2565
  Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
hoelzl@45041
  2566
  Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
hoelzl@45041
  2567
  Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
hoelzl@45041
  2568
  Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
hoelzl@45041
  2569
  Inter_def ~> INF_def, image_def
hoelzl@45041
  2570
  Union_def ~> SUP_def, image_def
hoelzl@45041
  2571
  INT_eq ~> INF_def, and image_def
hoelzl@45041
  2572
  UN_eq ~> SUP_def, and image_def
hoelzl@45041
  2573
  INF_subset ~> INF_superset_mono [OF _ order_refl]
wenzelm@44800
  2574
wenzelm@44800
  2575
More consistent and comprehensive names:
wenzelm@44800
  2576
hoelzl@45041
  2577
  INTER_eq_Inter_image ~> INF_def
hoelzl@45041
  2578
  UNION_eq_Union_image ~> SUP_def
haftmann@43872
  2579
  INFI_def ~> INF_def
haftmann@43872
  2580
  SUPR_def ~> SUP_def
haftmann@44103
  2581
  INF_leI ~> INF_lower
haftmann@44103
  2582
  INF_leI2 ~> INF_lower2
haftmann@44103
  2583
  le_INFI ~> INF_greatest
haftmann@44103
  2584
  le_SUPI ~> SUP_upper
haftmann@44103
  2585
  le_SUPI2 ~> SUP_upper2
haftmann@44103
  2586
  SUP_leI ~> SUP_least
haftmann@43873
  2587
  INFI_bool_eq ~> INF_bool_eq
haftmann@43873
  2588
  SUPR_bool_eq ~> SUP_bool_eq
haftmann@43873
  2589
  INFI_apply ~> INF_apply
haftmann@43873
  2590
  SUPR_apply ~> SUP_apply
haftmann@44103
  2591
  INTER_def ~> INTER_eq
haftmann@44103
  2592
  UNION_def ~> UNION_eq
haftmann@44103
  2593
haftmann@43865
  2594
INCOMPATIBILITY.
haftmann@43865
  2595
wenzelm@44973
  2596
* Renamed theory Complete_Lattice to Complete_Lattices.
wenzelm@44973
  2597
INCOMPATIBILITY.
wenzelm@44973
  2598
wenzelm@44973
  2599
* Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
wenzelm@44973
  2600
INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
wenzelm@44973
  2601
Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
wenzelm@44973
  2602
Sup_insert are now declared as [simp].  INCOMPATIBILITY.
wenzelm@44973
  2603
wenzelm@44973
  2604
* Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
wenzelm@44973
  2605
compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
wenzelm@44973
  2606
sup_inf_absob, sup_left_idem are now declared as [simp].  Minor
wenzelm@44973
  2607
INCOMPATIBILITY.
wenzelm@44973
  2608
krauss@44845
  2609
* Added syntactic classes "inf" and "sup" for the respective
krauss@44845
  2610
constants.  INCOMPATIBILITY: Changes in the argument order of the
krauss@44845
  2611
(mostly internal) locale predicates for some derived classes.
krauss@44845
  2612
wenzelm@44800
  2613
* Theorem collections ball_simps and bex_simps do not contain theorems
wenzelm@44800
  2614
referring to UNION any longer; these have been moved to collection
wenzelm@44800
  2615
UN_ball_bex_simps.  INCOMPATIBILITY.
wenzelm@44800
  2616
wenzelm@44800
  2617
* Theory Archimedean_Field: floor now is defined as parameter of a
wenzelm@44800
  2618
separate type class floor_ceiling.
wenzelm@44800
  2619
wenzelm@44800
  2620
* Theory Finite_Set: more coherent development of fold_set locales:
haftmann@42874
  2621
haftmann@42874
  2622
    locale fun_left_comm ~> locale comp_fun_commute
haftmann@42874
  2623
    locale fun_left_comm_idem ~> locale comp_fun_idem
wenzelm@44800
  2624
wenzelm@44800
  2625
Both use point-free characterization; interpretation proofs may need
wenzelm@44800
  2626
adjustment.  INCOMPATIBILITY.
haftmann@42874
  2627
wenzelm@44800
  2628
* Theory Limits: Type "'a net" has been renamed to "'a filter", in
huffman@44081
  2629
accordance with standard mathematical terminology. INCOMPATIBILITY.
huffman@44081
  2630
wenzelm@44800
  2631
* Theory Complex_Main: The locale interpretations for the
wenzelm@44800
  2632
bounded_linear and bounded_bilinear locales have been removed, in
wenzelm@44800
  2633
order to reduce the number of duplicate lemmas. Users must use the
wenzelm@44800
  2634
original names for distributivity theorems, potential INCOMPATIBILITY.
huffman@44282
  2635
huffman@44282
  2636
  divide.add ~> add_divide_distrib
huffman@44282
  2637
  divide.diff ~> diff_divide_distrib
huffman@44282
  2638
  divide.setsum ~> setsum_divide_distrib
huffman@44282
  2639
  mult.add_right ~> right_distrib
huffman@44282
  2640
  mult.diff_right ~> right_diff_distrib
huffman@44282
  2641
  mult_right.setsum ~> setsum_right_distrib
huffman@44282
  2642
  mult_left.diff ~> left_diff_distrib
huffman@44282
  2643
wenzelm@44800
  2644
* Theory Complex_Main: Several redundant theorems have been removed or
huffman@44568
  2645
replaced by more general versions. INCOMPATIBILITY.
huffman@44522
  2646
huffman@45051
  2647
  real_diff_def ~> minus_real_def
huffman@45051
  2648
  real_divide_def ~> divide_real_def
huffman@45051
  2649
  real_less_def ~> less_le
huffman@45051
  2650
  real_abs_def ~> abs_real_def
huffman@45051
  2651
  real_sgn_def ~> sgn_real_def
huffman@45051
  2652
  real_mult_commute ~> mult_commute
huffman@45051
  2653
  real_mult_assoc ~> mult_assoc
huffman@45051
  2654
  real_mult_1 ~> mult_1_left
huffman@45051
  2655
  real_add_mult_distrib ~> left_distrib
huffman@45051
  2656
  real_zero_not_eq_one ~> zero_neq_one
huffman@45051
  2657
  real_mult_inverse_left ~> left_inverse
huffman@45051
  2658
  INVERSE_ZERO ~> inverse_zero
huffman@45051
  2659
  real_le_refl ~> order_refl
huffman@45051
  2660
  real_le_antisym ~> order_antisym
huffman@45051
  2661
  real_le_trans ~> order_trans
huffman@45051
  2662
  real_le_linear ~> linear
huffman@45051
  2663
  real_le_eq_diff ~> le_iff_diff_le_0
huffman@45051
  2664
  real_add_left_mono ~> add_left_mono
huffman@45051
  2665
  real_mult_order ~> mult_pos_pos
huffman@45051
  2666
  real_mult_less_mono2 ~> mult_strict_left_mono
huffman@44822
  2667
  real_of_int_real_of_nat ~> real_of_int_of_nat_eq
huffman@44522
  2668
  real_0_le_divide_iff ~> zero_le_divide_iff
huffman@44522
  2669
  realpow_two_disj ~> power2_eq_iff
huffman@44522
  2670
  real_squared_diff_one_factored ~> square_diff_one_factored
huffman@44522
  2671
  realpow_two_diff ~> square_diff_square_factored
huffman@44669
  2672
  reals_complete2 ~> complete_real
huffman@44749
  2673
  real_sum_squared_expand ~> power2_sum
huffman@44522
  2674
  exp_ln_eq ~> ln_unique
huffman@44711
  2675
  expi_add ~> exp_add
huffman@44711
  2676
  expi_zero ~> exp_zero
huffman@44522
  2677
  lemma_DERIV_subst ~> DERIV_cong
huffman@44568
  2678
  LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
huffman@44568
  2679
  LIMSEQ_const ~> tendsto_const
huffman@44568
  2680
  LIMSEQ_norm ~> tendsto_norm
huffman@44568
  2681
  LIMSEQ_add ~> tendsto_add
huffman@44568
  2682
  LIMSEQ_minus ~> tendsto_minus
huffman@44568
  2683
  LIMSEQ_minus_cancel ~> tendsto_minus_cancel
huffman@44568
  2684
  LIMSEQ_diff ~> tendsto_diff
huffman@44568
  2685
  bounded_linear.LIMSEQ ~> bounded_linear.tendsto
huffman@44568
  2686
  bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
huffman@44568
  2687
  LIMSEQ_mult ~> tendsto_mult
huffman@44568
  2688
  LIMSEQ_inverse ~> tendsto_inverse
huffman@44568
  2689
  LIMSEQ_divide ~> tendsto_divide
huffman@44568
  2690
  LIMSEQ_pow ~> tendsto_power
huffman@44568
  2691
  LIMSEQ_setsum ~> tendsto_setsum
huffman@44568
  2692
  LIMSEQ_setprod ~> tendsto_setprod
huffman@44568
  2693
  LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
huffman@44568
  2694
  LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
huffman@44568
  2695
  LIMSEQ_imp_rabs ~> tendsto_rabs
huffman@44710
  2696
  LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
huffman@44710
  2697
  LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
huffman@44710
  2698
  LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
huffman@44748
  2699
  LIMSEQ_Complex ~> tendsto_Complex
huffman@44568
  2700
  LIM_ident ~> tendsto_ident_at
huffman@44568
  2701
  LIM_const ~> tendsto_const
huffman@44568
  2702
  LIM_add ~> tendsto_add
huffman@44568
  2703
  LIM_add_zero ~> tendsto_add_zero
huffman@44568
  2704
  LIM_minus ~> tendsto_minus
huffman@44568
  2705
  LIM_diff ~> tendsto_diff
huffman@44568
  2706
  LIM_norm ~> tendsto_norm
huffman@44568
  2707
  LIM_norm_zero ~> tendsto_norm_zero
huffman@44568
  2708
  LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
huffman@44568
  2709
  LIM_norm_zero_iff ~> tendsto_norm_zero_iff
huffman@44568
  2710
  LIM_rabs ~> tendsto_rabs
huffman@44568
  2711
  LIM_rabs_zero ~> tendsto_rabs_zero
huffman@44568
  2712
  LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
huffman@44568
  2713
  LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
huffman@44568
  2714
  LIM_compose ~> tendsto_compose
huffman@44568
  2715
  LIM_mult ~> tendsto_mult
huffman@44568
  2716
  LIM_scaleR ~> tendsto_scaleR
huffman@44568
  2717
  LIM_of_real ~> tendsto_of_real
huffman@44568
  2718
  LIM_power ~> tendsto_power
huffman@44568
  2719
  LIM_inverse ~> tendsto_inverse
huffman@44568
  2720
  LIM_sgn ~> tendsto_sgn
huffman@44568
  2721
  isCont_LIM_compose ~> isCont_tendsto_compose
huffman@44568
  2722
  bounded_linear.LIM ~> bounded_linear.tendsto
huffman@44568
  2723
  bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
huffman@44568
  2724
  bounded_bilinear.LIM ~> bounded_bilinear.tendsto
huffman@44568
  2725
  bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
huffman@44568
  2726
  bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
huffman@44568
  2727
  bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
huffman@44568
  2728
  LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
huffman@44522
  2729
wenzelm@44967
  2730
* Theory Complex_Main: The definition of infinite series was