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