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