NEWS
author wenzelm
Sat Mar 05 23:05:07 2016 +0100 (2016-03-05)
changeset 62525 0c9081056829
parent 62522 d32c23d29968
child 62536 656e9653c645
child 62549 9498623b27f0
permissions -rw-r--r--
NEWS after Isabelle2016;
wenzelm@57491
     1
Isabelle NEWS -- history of user-relevant changes
wenzelm@57491
     2
=================================================
wenzelm@2553
     3
wenzelm@62114
     4
(Note: Isabelle/jEdit shows a tree-view of the NEWS file in Sidekick.)
wenzelm@60006
     5
wenzelm@60331
     6
wenzelm@62216
     7
New in this Isabelle version
wenzelm@62216
     8
----------------------------
wenzelm@62216
     9
wenzelm@62440
    10
*** General ***
wenzelm@62440
    11
wenzelm@62440
    12
* New symbol \<circle>, e.g. for temporal operator.
wenzelm@62440
    13
wenzelm@62453
    14
* Old 'header' command is no longer supported (legacy since
wenzelm@62453
    15
Isabelle2015).
wenzelm@62453
    16
wenzelm@62440
    17
wenzelm@62312
    18
*** Isar ***
wenzelm@62312
    19
wenzelm@62312
    20
* Command '\<proof>' is an alias for 'sorry', with different
wenzelm@62312
    21
typesetting. E.g. to produce proof holes in examples and documentation.
wenzelm@62216
    22
wenzelm@62216
    23
blanchet@62327
    24
*** HOL ***
blanchet@62327
    25
wenzelm@62522
    26
* New abbreviations for negated existence (but not bounded existence):
wenzelm@62522
    27
wenzelm@62522
    28
  \<nexists>x. P x \<equiv> \<not> (\<exists>x. P x)
wenzelm@62522
    29
  \<nexists>!x. P x \<equiv> \<not> (\<exists>!x. P x)
wenzelm@62522
    30
wenzelm@62521
    31
* The print mode "HOL" for ASCII syntax of binders "!", "?", "?!", "@"
wenzelm@62521
    32
has been removed for output. It is retained for input only, until it is
wenzelm@62521
    33
eliminated altogether.
wenzelm@62521
    34
blanchet@62327
    35
* (Co)datatype package:
traytel@62332
    36
  - the predicator :: ('a => bool) => 'a F => bool is now a first-class
traytel@62332
    37
    citizen in bounded natural functors
blanchet@62327
    38
  - "primrec" now allows nested calls through the predicator in addition
blanchet@62327
    39
    to the map function.
traytel@62332
    40
  - "bnf" automatically discharges reflexive proof obligations
traytel@62332
    41
    "bnf" outputs a slightly modified proof obligation expressing rel in
traytel@62332
    42
       terms of map and set
traytel@62332
    43
       (not giving a specification for rel makes this one reflexive)
traytel@62332
    44
    "bnf" outputs a new proof obligation expressing pred in terms of set
traytel@62332
    45
       (not giving a specification for pred makes this one reflexive)
traytel@62332
    46
    INCOMPATIBILITY: manual "bnf" declarations may need adjustment
blanchet@62335
    47
  - Renamed lemmas:
blanchet@62335
    48
      rel_prod_apply ~> rel_prod_inject
blanchet@62335
    49
      pred_prod_apply ~> pred_prod_inject
blanchet@62335
    50
    INCOMPATIBILITY.
blanchet@62327
    51
wenzelm@62407
    52
* Renamed split_if -> if_split and split_if_asm -> if_split_asm to
wenzelm@62407
    53
resemble the f.split naming convention, INCOMPATIBILITY.
nipkow@62396
    54
haftmann@62430
    55
* Multiset membership is now expressed using set_mset rather than count.
haftmann@62430
    56
ASCII infix syntax ":#" has been discontinued.
haftmann@62430
    57
haftmann@62430
    58
  - Expressions "count M a > 0" and similar simplify to membership
haftmann@62430
    59
    by default.
haftmann@62430
    60
haftmann@62430
    61
  - Converting between "count M a = 0" and non-membership happens using
haftmann@62430
    62
    equations count_eq_zero_iff and not_in_iff.
haftmann@62430
    63
haftmann@62430
    64
  - Rules count_inI and in_countE obtain facts of the form
haftmann@62430
    65
    "count M a = n" from membership.
haftmann@62430
    66
haftmann@62430
    67
  - Rules count_in_diffI and in_diff_countE obtain facts of the form
haftmann@62430
    68
    "count M a = n + count N a" from membership on difference sets.
haftmann@62430
    69
haftmann@62430
    70
INCOMPATIBILITY.
haftmann@62430
    71
haftmann@62343
    72
* Compound constants INFIMUM and SUPREMUM are mere abbreviations now.
haftmann@62343
    73
INCOMPATIBILITY.
haftmann@62343
    74
lp15@62408
    75
* More complex analysis including Cauchy's inequality, Liouville theorem,
lp15@62408
    76
open mapping theorem, maximum modulus principle, Schwarz Lemma.
lp15@62408
    77
haftmann@62358
    78
* "Gcd (f ` A)" and "Lcm (f ` A)" are printed with optional
haftmann@62358
    79
comprehension-like syntax analogously to "Inf (f ` A)" and "Sup (f ` A)".
haftmann@62358
    80
haftmann@62345
    81
* Class semiring_Lcd merged into semiring_Gcd.  INCOMPATIBILITY.
haftmann@62345
    82
hoelzl@62376
    83
* The type class ordered_comm_monoid_add is now called
hoelzl@62376
    84
ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add is
hoelzl@62376
    85
introduced as the combination of ordered_ab_semigroup_add + comm_monoid_add.
hoelzl@62376
    86
INCOMPATIBILITY.
hoelzl@62376
    87
hoelzl@62376
    88
* Introduced the type classes canonically_ordered_comm_monoid_add and dioid.
hoelzl@62376
    89
hoelzl@62376
    90
* Added topological_monoid
hoelzl@62376
    91
haftmann@62352
    92
* Library/Polynomial.thy contains also derivation of polynomials
haftmann@62352
    93
but not gcd/lcm on polynomials over fields.  This has been moved
haftmann@62352
    94
to a separate theory Library/Polynomial_GCD_euclidean.thy, to
haftmann@62352
    95
pave way for a possible future different type class instantiation
haftmann@62352
    96
for polynomials over factorial rings.  INCOMPATIBILITY.
haftmann@62352
    97
haftmann@62348
    98
* Dropped various legacy fact bindings, whose replacements are often
haftmann@62348
    99
of a more general type also:
haftmann@62348
   100
  lcm_left_commute_nat ~> lcm.left_commute
haftmann@62348
   101
  lcm_left_commute_int ~> lcm.left_commute
haftmann@62348
   102
  gcd_left_commute_nat ~> gcd.left_commute
haftmann@62348
   103
  gcd_left_commute_int ~> gcd.left_commute
haftmann@62348
   104
  gcd_greatest_iff_nat ~> gcd_greatest_iff
haftmann@62348
   105
  gcd_greatest_iff_int ~> gcd_greatest_iff
haftmann@62348
   106
  coprime_dvd_mult_nat ~> coprime_dvd_mult
haftmann@62348
   107
  coprime_dvd_mult_int ~> coprime_dvd_mult
haftmann@62348
   108
  zpower_numeral_even ~> power_numeral_even
haftmann@62348
   109
  gcd_mult_cancel_nat ~> gcd_mult_cancel
haftmann@62348
   110
  gcd_mult_cancel_int ~> gcd_mult_cancel
haftmann@62348
   111
  div_gcd_coprime_nat ~> div_gcd_coprime
haftmann@62348
   112
  div_gcd_coprime_int ~> div_gcd_coprime
haftmann@62348
   113
  zpower_numeral_odd ~> power_numeral_odd
haftmann@62348
   114
  zero_less_int_conv ~> of_nat_0_less_iff
haftmann@62348
   115
  gcd_greatest_nat ~> gcd_greatest
haftmann@62348
   116
  gcd_greatest_int ~> gcd_greatest
haftmann@62348
   117
  coprime_mult_nat ~> coprime_mult
haftmann@62348
   118
  coprime_mult_int ~> coprime_mult
haftmann@62348
   119
  lcm_commute_nat ~> lcm.commute
haftmann@62348
   120
  lcm_commute_int ~> lcm.commute
haftmann@62348
   121
  int_less_0_conv ~> of_nat_less_0_iff
haftmann@62348
   122
  gcd_commute_nat ~> gcd.commute
haftmann@62348
   123
  gcd_commute_int ~> gcd.commute
haftmann@62348
   124
  Gcd_insert_nat ~> Gcd_insert
haftmann@62348
   125
  Gcd_insert_int ~> Gcd_insert
haftmann@62348
   126
  of_int_int_eq ~> of_int_of_nat_eq
haftmann@62348
   127
  lcm_least_nat ~> lcm_least
haftmann@62348
   128
  lcm_least_int ~> lcm_least
haftmann@62348
   129
  lcm_assoc_nat ~> lcm.assoc
haftmann@62348
   130
  lcm_assoc_int ~> lcm.assoc
haftmann@62348
   131
  int_le_0_conv ~> of_nat_le_0_iff
haftmann@62348
   132
  int_eq_0_conv ~> of_nat_eq_0_iff
haftmann@62348
   133
  Gcd_empty_nat ~> Gcd_empty
haftmann@62348
   134
  Gcd_empty_int ~> Gcd_empty
haftmann@62348
   135
  gcd_assoc_nat ~> gcd.assoc
haftmann@62348
   136
  gcd_assoc_int ~> gcd.assoc
haftmann@62348
   137
  zero_zle_int ~> of_nat_0_le_iff
haftmann@62348
   138
  lcm_dvd2_nat ~> dvd_lcm2
haftmann@62348
   139
  lcm_dvd2_int ~> dvd_lcm2
haftmann@62348
   140
  lcm_dvd1_nat ~> dvd_lcm1
haftmann@62348
   141
  lcm_dvd1_int ~> dvd_lcm1
haftmann@62348
   142
  gcd_zero_nat ~> gcd_eq_0_iff
haftmann@62348
   143
  gcd_zero_int ~> gcd_eq_0_iff
haftmann@62348
   144
  gcd_dvd2_nat ~> gcd_dvd2
haftmann@62348
   145
  gcd_dvd2_int ~> gcd_dvd2
haftmann@62348
   146
  gcd_dvd1_nat ~> gcd_dvd1
haftmann@62348
   147
  gcd_dvd1_int ~> gcd_dvd1
haftmann@62348
   148
  int_numeral ~> of_nat_numeral
haftmann@62348
   149
  lcm_ac_nat ~> ac_simps
haftmann@62348
   150
  lcm_ac_int ~> ac_simps
haftmann@62348
   151
  gcd_ac_nat ~> ac_simps
haftmann@62348
   152
  gcd_ac_int ~> ac_simps
haftmann@62348
   153
  abs_int_eq ~> abs_of_nat
haftmann@62348
   154
  zless_int ~> of_nat_less_iff
haftmann@62348
   155
  zdiff_int ~> of_nat_diff
haftmann@62348
   156
  zadd_int ~> of_nat_add
haftmann@62348
   157
  int_mult ~> of_nat_mult
haftmann@62348
   158
  int_Suc ~> of_nat_Suc
haftmann@62348
   159
  inj_int ~> inj_of_nat
haftmann@62348
   160
  int_1 ~> of_nat_1
haftmann@62348
   161
  int_0 ~> of_nat_0
haftmann@62353
   162
  Lcm_empty_nat ~> Lcm_empty
haftmann@62353
   163
  Lcm_empty_int ~> Lcm_empty
haftmann@62353
   164
  Lcm_insert_nat ~> Lcm_insert
haftmann@62353
   165
  Lcm_insert_int ~> Lcm_insert
haftmann@62353
   166
  comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd
haftmann@62353
   167
  comp_fun_idem_gcd_int ~> comp_fun_idem_gcd
haftmann@62353
   168
  comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm
haftmann@62353
   169
  comp_fun_idem_lcm_int ~> comp_fun_idem_lcm
haftmann@62353
   170
  Lcm_eq_0 ~> Lcm_eq_0_I
haftmann@62353
   171
  Lcm0_iff ~> Lcm_0_iff
haftmann@62353
   172
  Lcm_dvd_int ~> Lcm_least
haftmann@62353
   173
  divides_mult_nat ~> divides_mult
haftmann@62353
   174
  divides_mult_int ~> divides_mult
haftmann@62353
   175
  lcm_0_nat ~> lcm_0_right
haftmann@62353
   176
  lcm_0_int ~> lcm_0_right
haftmann@62353
   177
  lcm_0_left_nat ~> lcm_0_left
haftmann@62353
   178
  lcm_0_left_int ~> lcm_0_left
haftmann@62353
   179
  dvd_gcd_D1_nat ~> dvd_gcdD1
haftmann@62353
   180
  dvd_gcd_D1_int ~> dvd_gcdD1
haftmann@62353
   181
  dvd_gcd_D2_nat ~> dvd_gcdD2
haftmann@62353
   182
  dvd_gcd_D2_int ~> dvd_gcdD2
haftmann@62353
   183
  coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff
haftmann@62353
   184
  coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff
haftmann@62348
   185
  realpow_minus_mult ~> power_minus_mult
haftmann@62348
   186
  realpow_Suc_le_self ~> power_Suc_le_self
haftmann@62353
   187
  dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest
haftmann@62347
   188
INCOMPATIBILITY.
haftmann@62347
   189
wenzelm@62479
   190
* Session HOL-NSA has been renamed to HOL-Nonstandard_Analysis.
wenzelm@62479
   191
blanchet@62327
   192
wenzelm@62498
   193
*** ML ***
wenzelm@62498
   194
wenzelm@62498
   195
* Option ML_exception_debugger controls detailed exception trace via the
wenzelm@62498
   196
Poly/ML debugger. Relevant ML modules need to be compiled beforehand
wenzelm@62498
   197
with ML_file_debug, or with ML_file and option ML_debugger enabled. Note
wenzelm@62498
   198
debugger information requires consirable time and space: main
wenzelm@62498
   199
Isabelle/HOL with full debugger support may need ML_system_64.
wenzelm@62498
   200
wenzelm@62514
   201
* Local_Theory.restore has been renamed to Local_Theory.reset to
wenzelm@62514
   202
emphasize its disruptive impact on the cumulative context, notably the
wenzelm@62514
   203
scope of 'private' or 'qualified' names. Note that Local_Theory.reset is
wenzelm@62514
   204
only appropriate when targets are managed, e.g. starting from a global
wenzelm@62514
   205
theory and returning to it. Regular definitional packages should use
wenzelm@62514
   206
balanced blocks of Local_Theory.open_target versus
wenzelm@62514
   207
Local_Theory.close_target instead. Rare INCOMPATIBILITY.
wenzelm@62514
   208
wenzelm@62519
   209
* Structure TimeLimit (originally from the SML/NJ library) has been
wenzelm@62519
   210
replaced by structure Timeout, with slightly different signature.
wenzelm@62519
   211
INCOMPATIBILITY.
wenzelm@62519
   212
wenzelm@62498
   213
wenzelm@62354
   214
*** System ***
wenzelm@62354
   215
wenzelm@62415
   216
* The Isabelle system environment always ensures that the main
wenzelm@62415
   217
executables are found within the PATH: isabelle, isabelle_process,
wenzelm@62415
   218
isabelle_scala_script.
wenzelm@62415
   219
wenzelm@62525
   220
* Command-line tool "isabelle_process" no longer supports writable heap
wenzelm@62475
   221
images. INCOMPATIBILITY in exotic situations where "isabelle build"
wenzelm@62475
   222
cannot be used: the structure ML_Heap provides operations to save the ML
wenzelm@62475
   223
heap under program control.
wenzelm@62475
   224
wenzelm@62525
   225
* Command-line tool "isabelle_process" supports ML evaluation of literal
wenzelm@62525
   226
expressions (option -e) or files (option -f). Errors lead to premature
wenzelm@62525
   227
exit of the ML process with return code 1.
wenzelm@62525
   228
wenzelm@62525
   229
* Command-line tool "isabelle console -r" helps to bootstrap
wenzelm@62525
   230
Isabelle/Pure interactively.
wenzelm@62525
   231
wenzelm@62451
   232
* The somewhat pointless command-line tool "isabelle yxml" has been
wenzelm@62451
   233
discontinued. INCOMPATIBILITY, use operations from the modules "XML" and
wenzelm@62451
   234
"YXML" in Isabelle/ML or Isabelle/Scala.
wenzelm@62451
   235
wenzelm@62501
   236
* SML/NJ and old versions of Poly/ML are no longer supported.
wenzelm@62354
   237
wenzelm@62354
   238
wenzelm@62031
   239
New in Isabelle2016 (February 2016)
wenzelm@62016
   240
-----------------------------------
wenzelm@60138
   241
wenzelm@61337
   242
*** General ***
wenzelm@61337
   243
wenzelm@62168
   244
* Eisbach is now based on Pure instead of HOL. Objects-logics may import
wenzelm@62168
   245
either the theory ~~/src/HOL/Eisbach/Eisbach (for HOL etc.) or
wenzelm@62168
   246
~~/src/HOL/Eisbach/Eisbach_Old_Appl_Syntax (for FOL, ZF etc.). Note that
wenzelm@62168
   247
the HOL-Eisbach session located in ~~/src/HOL/Eisbach/ contains further
wenzelm@62168
   248
examples that do require HOL.
wenzelm@62168
   249
wenzelm@62157
   250
* Better resource usage on all platforms (Linux, Windows, Mac OS X) for
wenzelm@62157
   251
both Isabelle/ML and Isabelle/Scala.  Slightly reduced heap space usage.
wenzelm@62157
   252
wenzelm@62017
   253
* Former "xsymbols" syntax with Isabelle symbols is used by default,
wenzelm@62017
   254
without any special print mode. Important ASCII replacement syntax
wenzelm@62017
   255
remains available under print mode "ASCII", but less important syntax
wenzelm@62017
   256
has been removed (see below).
wenzelm@62017
   257
wenzelm@62109
   258
* Support for more arrow symbols, with rendering in LaTeX and Isabelle
wenzelm@62109
   259
fonts: \<Lleftarrow> \<Rrightarrow> \<longlongleftarrow> \<longlongrightarrow> \<longlonglongleftarrow> \<longlonglongrightarrow>.
wenzelm@62017
   260
wenzelm@62108
   261
* Special notation \<struct> for the first implicit 'structure' in the
wenzelm@62108
   262
context has been discontinued. Rare INCOMPATIBILITY, use explicit
wenzelm@62108
   263
structure name instead, notably in indexed notation with block-subscript
wenzelm@62108
   264
(e.g. \<odot>\<^bsub>A\<^esub>).
wenzelm@62108
   265
wenzelm@62108
   266
* The glyph for \<diamond> in the IsabelleText font now corresponds better to its
wenzelm@62108
   267
counterpart \<box> as quantifier-like symbol. A small diamond is available as
wenzelm@62108
   268
\<diamondop>; the old symbol \<struct> loses this rendering and any special
wenzelm@62108
   269
meaning.
wenzelm@62108
   270
wenzelm@62017
   271
* Syntax for formal comments "-- text" now also supports the symbolic
wenzelm@62017
   272
form "\<comment> text". Command-line tool "isabelle update_cartouches -c" helps
wenzelm@62017
   273
to update old sources.
wenzelm@62017
   274
wenzelm@61337
   275
* Toplevel theorem statements have been simplified as follows:
wenzelm@61337
   276
wenzelm@61337
   277
  theorems             ~>  lemmas
wenzelm@61337
   278
  schematic_lemma      ~>  schematic_goal
wenzelm@61337
   279
  schematic_theorem    ~>  schematic_goal
wenzelm@61337
   280
  schematic_corollary  ~>  schematic_goal
wenzelm@61337
   281
wenzelm@61337
   282
Command-line tool "isabelle update_theorems" updates theory sources
wenzelm@61337
   283
accordingly.
wenzelm@61337
   284
wenzelm@61338
   285
* Toplevel theorem statement 'proposition' is another alias for
wenzelm@61338
   286
'theorem'.
wenzelm@61338
   287
wenzelm@62169
   288
* The old 'defs' command has been removed (legacy since Isabelle2014).
wenzelm@62169
   289
INCOMPATIBILITY, use regular 'definition' instead. Overloaded and/or
wenzelm@62169
   290
deferred definitions require a surrounding 'overloading' block.
wenzelm@62169
   291
wenzelm@61337
   292
wenzelm@60610
   293
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@60610
   294
wenzelm@60986
   295
* IDE support for the source-level debugger of Poly/ML, to work with
wenzelm@62253
   296
Isabelle/ML and official Standard ML. Option "ML_debugger" and commands
wenzelm@62253
   297
'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',
wenzelm@62253
   298
'SML_file_no_debug' control compilation of sources with or without
wenzelm@62253
   299
debugging information. The Debugger panel allows to set breakpoints (via
wenzelm@62253
   300
context menu), step through stopped threads, evaluate local ML
wenzelm@62253
   301
expressions etc. At least one Debugger view needs to be active to have
wenzelm@62253
   302
any effect on the running ML program.
wenzelm@60984
   303
wenzelm@61803
   304
* The State panel manages explicit proof state output, with dynamic
wenzelm@61803
   305
auto-update according to cursor movement. Alternatively, the jEdit
wenzelm@61803
   306
action "isabelle.update-state" (shortcut S+ENTER) triggers manual
wenzelm@61803
   307
update.
wenzelm@61729
   308
wenzelm@61729
   309
* The Output panel no longer shows proof state output by default, to
wenzelm@61729
   310
avoid GUI overcrowding. INCOMPATIBILITY, use the State panel instead or
wenzelm@61729
   311
enable option "editor_output_state".
wenzelm@61215
   312
wenzelm@61803
   313
* The text overview column (status of errors, warnings etc.) is updated
wenzelm@61803
   314
asynchronously, leading to much better editor reactivity. Moreover, the
wenzelm@61803
   315
full document node content is taken into account. The width of the
wenzelm@61803
   316
column is scaled according to the main text area font, for improved
wenzelm@61803
   317
visibility.
wenzelm@61803
   318
wenzelm@61803
   319
* The main text area no longer changes its color hue in outdated
wenzelm@61803
   320
situations. The text overview column takes over the role to indicate
wenzelm@61803
   321
unfinished edits in the PIDE pipeline. This avoids flashing text display
wenzelm@61803
   322
due to ad-hoc updates by auxiliary GUI components, such as the State
wenzelm@61803
   323
panel.
wenzelm@61803
   324
wenzelm@62254
   325
* Slightly improved scheduling for urgent print tasks (e.g. command
wenzelm@62254
   326
state output, interactive queries) wrt. long-running background tasks.
wenzelm@62017
   327
wenzelm@62017
   328
* Completion of symbols via prefix of \<name> or \<^name> or \name is
wenzelm@62017
   329
always possible, independently of the language context. It is never
wenzelm@62017
   330
implicit: a popup will show up unconditionally.
wenzelm@62017
   331
wenzelm@62017
   332
* Additional abbreviations for syntactic completion may be specified in
wenzelm@62017
   333
$ISABELLE_HOME/etc/abbrevs and $ISABELLE_HOME_USER/etc/abbrevs, with
wenzelm@62017
   334
support for simple templates using ASCII 007 (bell) as placeholder.
wenzelm@62017
   335
wenzelm@62234
   336
* Symbols \<oplus>, \<Oplus>, \<otimes>, \<Otimes>, \<odot>, \<Odot>, \<ominus>, \<oslash> no longer provide abbreviations for
wenzelm@62234
   337
completion like "+o", "*o", ".o" etc. -- due to conflicts with other
wenzelm@62234
   338
ASCII syntax. INCOMPATIBILITY, use plain backslash-completion or define
wenzelm@62234
   339
suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.
wenzelm@62234
   340
wenzelm@61483
   341
* Action "isabelle-emph" (with keyboard shortcut C+e LEFT) controls
wenzelm@61483
   342
emphasized text style; the effect is visible in document output, not in
wenzelm@61483
   343
the editor.
wenzelm@61483
   344
wenzelm@61483
   345
* Action "isabelle-reset" now uses keyboard shortcut C+e BACK_SPACE,
wenzelm@61483
   346
instead of former C+e LEFT.
wenzelm@61483
   347
wenzelm@61512
   348
* The command-line tool "isabelle jedit" and the isabelle.Main
wenzelm@62027
   349
application wrapper treat the default $USER_HOME/Scratch.thy more
wenzelm@61512
   350
uniformly, and allow the dummy file argument ":" to open an empty buffer
wenzelm@61512
   351
instead.
wenzelm@61512
   352
wenzelm@62017
   353
* New command-line tool "isabelle jedit_client" allows to connect to an
wenzelm@62017
   354
already running Isabelle/jEdit process. This achieves the effect of
wenzelm@62017
   355
single-instance applications seen on common GUI desktops.
wenzelm@62017
   356
wenzelm@61529
   357
* The default look-and-feel for Linux is the traditional "Metal", which
wenzelm@61529
   358
works better with GUI scaling for very high-resolution displays (e.g.
wenzelm@61529
   359
4K). Moreover, it is generally more robust than "Nimbus".
wenzelm@61529
   360
wenzelm@62163
   361
* Update to jedit-5.3.0, with improved GUI scaling and support of
wenzelm@62163
   362
high-resolution displays (e.g. 4K).
wenzelm@62163
   363
wenzelm@62034
   364
* The main Isabelle executable is managed as single-instance Desktop
wenzelm@62034
   365
application uniformly on all platforms: Linux, Windows, Mac OS X.
wenzelm@62034
   366
wenzelm@60610
   367
wenzelm@61405
   368
*** Document preparation ***
wenzelm@61405
   369
wenzelm@62017
   370
* Commands 'paragraph' and 'subparagraph' provide additional section
wenzelm@62017
   371
headings. Thus there are 6 levels of standard headings, as in HTML.
wenzelm@62017
   372
wenzelm@62017
   373
* Command 'text_raw' has been clarified: input text is processed as in
wenzelm@62017
   374
'text' (with antiquotations and control symbols). The key difference is
wenzelm@62017
   375
the lack of the surrounding isabelle markup environment in output.
wenzelm@62017
   376
wenzelm@62017
   377
* Text is structured in paragraphs and nested lists, using notation that
wenzelm@62017
   378
is similar to Markdown. The control symbols for list items are as
wenzelm@62017
   379
follows:
wenzelm@62017
   380
wenzelm@62017
   381
  \<^item>  itemize
wenzelm@62017
   382
  \<^enum>  enumerate
wenzelm@62017
   383
  \<^descr>  description
wenzelm@62017
   384
wenzelm@61491
   385
* There is a new short form for antiquotations with a single argument
wenzelm@61491
   386
that is a cartouche: \<^name>\<open>...\<close> is equivalent to @{name \<open>...\<close>} and
wenzelm@61595
   387
\<open>...\<close> without control symbol is equivalent to @{cartouche \<open>...\<close>}.
wenzelm@61595
   388
\<^name> without following cartouche is equivalent to @{name}. The
wenzelm@61501
   389
standard Isabelle fonts provide glyphs to render important control
wenzelm@61501
   390
symbols, e.g. "\<^verbatim>", "\<^emph>", "\<^bold>".
wenzelm@61491
   391
wenzelm@61595
   392
* Antiquotations @{noindent}, @{smallskip}, @{medskip}, @{bigskip} with
wenzelm@61595
   393
corresponding control symbols \<^noindent>, \<^smallskip>, \<^medskip>, \<^bigskip> specify spacing formally, using
wenzelm@61595
   394
standard LaTeX macros of the same names.
wenzelm@61595
   395
wenzelm@61491
   396
* Antiquotation @{cartouche} in Isabelle/Pure is the same as @{text}.
wenzelm@61491
   397
Consequently, \<open>...\<close> without any decoration prints literal quasi-formal
wenzelm@61492
   398
text. Command-line tool "isabelle update_cartouches -t" helps to update
wenzelm@61492
   399
old sources, by approximative patching of the content of string and
wenzelm@61492
   400
cartouche tokens seen in theory sources.
wenzelm@61491
   401
wenzelm@61491
   402
* The @{text} antiquotation now ignores the antiquotation option
wenzelm@61491
   403
"source". The given text content is output unconditionally, without any
wenzelm@61491
   404
surrounding quotes etc. Subtle INCOMPATIBILITY, put quotes into the
wenzelm@61494
   405
argument where they are really intended, e.g. @{text \<open>"foo"\<close>}. Initial
wenzelm@61494
   406
or terminal spaces are ignored.
wenzelm@61491
   407
wenzelm@62017
   408
* Antiquotations @{emph} and @{bold} output LaTeX source recursively,
wenzelm@62017
   409
adding appropriate text style markup. These may be used in the short
wenzelm@62017
   410
form \<^emph>\<open>...\<close> and \<^bold>\<open>...\<close>.
wenzelm@62017
   411
wenzelm@62017
   412
* Document antiquotation @{footnote} outputs LaTeX source recursively,
wenzelm@62017
   413
marked as \footnote{}. This may be used in the short form \<^footnote>\<open>...\<close>.
wenzelm@62017
   414
wenzelm@62017
   415
* Antiquotation @{verbatim [display]} supports option "indent".
wenzelm@62017
   416
wenzelm@62017
   417
* Antiquotation @{theory_text} prints uninterpreted theory source text
wenzelm@62231
   418
(Isar outer syntax with command keywords etc.). This may be used in the
wenzelm@62231
   419
short form \<^theory_text>\<open>...\<close>. @{theory_text [display]} supports option "indent".
wenzelm@62017
   420
wenzelm@62017
   421
* Antiquotation @{doc ENTRY} provides a reference to the given
wenzelm@62017
   422
documentation, with a hyperlink in the Prover IDE.
wenzelm@62017
   423
wenzelm@62017
   424
* Antiquotations @{command}, @{method}, @{attribute} print checked
wenzelm@62017
   425
entities of the Isar language.
wenzelm@62017
   426
wenzelm@61471
   427
* HTML presentation uses the standard IsabelleText font and Unicode
wenzelm@61471
   428
rendering of Isabelle symbols like Isabelle/Scala/jEdit.  The former
wenzelm@61488
   429
print mode "HTML" loses its special meaning.
wenzelm@61471
   430
wenzelm@61405
   431
wenzelm@60406
   432
*** Isar ***
wenzelm@60406
   433
wenzelm@62205
   434
* Local goals ('have', 'show', 'hence', 'thus') allow structured rule
wenzelm@62205
   435
statements like fixes/assumes/shows in theorem specifications, but the
wenzelm@62205
   436
notation is postfix with keywords 'if' (or 'when') and 'for'. For
wenzelm@60555
   437
example:
wenzelm@60414
   438
wenzelm@60414
   439
  have result: "C x y"
wenzelm@60414
   440
    if "A x" and "B y"
wenzelm@60414
   441
    for x :: 'a and y :: 'a
wenzelm@60414
   442
    <proof>
wenzelm@60414
   443
wenzelm@60449
   444
The local assumptions are bound to the name "that". The result is
wenzelm@60449
   445
exported from context of the statement as usual. The above roughly
wenzelm@60414
   446
corresponds to a raw proof block like this:
wenzelm@60414
   447
wenzelm@60414
   448
  {
wenzelm@60414
   449
    fix x :: 'a and y :: 'a
wenzelm@60449
   450
    assume that: "A x" "B y"
wenzelm@60414
   451
    have "C x y" <proof>
wenzelm@60414
   452
  }
wenzelm@60414
   453
  note result = this
wenzelm@60406
   454
wenzelm@60555
   455
The keyword 'when' may be used instead of 'if', to indicate 'presume'
wenzelm@60555
   456
instead of 'assume' above.
wenzelm@60555
   457
wenzelm@61733
   458
* Assumptions ('assume', 'presume') allow structured rule statements
wenzelm@61733
   459
using 'if' and 'for', similar to 'have' etc. above. For example:
wenzelm@61658
   460
wenzelm@61658
   461
  assume result: "C x y"
wenzelm@61658
   462
    if "A x" and "B y"
wenzelm@61658
   463
    for x :: 'a and y :: 'a
wenzelm@61658
   464
wenzelm@61658
   465
This assumes "\<And>x y::'a. A x \<Longrightarrow> B y \<Longrightarrow> C x y" and produces a general
wenzelm@61658
   466
result as usual: "A ?x \<Longrightarrow> B ?y \<Longrightarrow> C ?x ?y".
wenzelm@61658
   467
wenzelm@61658
   468
Vacuous quantification in assumptions is omitted, i.e. a for-context
wenzelm@61658
   469
only effects propositions according to actual use of variables. For
wenzelm@61658
   470
example:
wenzelm@61658
   471
wenzelm@61658
   472
  assume "A x" and "B y" for x and y
wenzelm@61658
   473
wenzelm@61658
   474
is equivalent to:
wenzelm@61658
   475
wenzelm@61658
   476
  assume "\<And>x. A x" and "\<And>y. B y"
wenzelm@61658
   477
wenzelm@60595
   478
* The meaning of 'show' with Pure rule statements has changed: premises
wenzelm@60595
   479
are treated in the sense of 'assume', instead of 'presume'. This means,
wenzelm@62205
   480
a goal like "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" can be solved completely as
wenzelm@62205
   481
follows:
wenzelm@60595
   482
wenzelm@60595
   483
  show "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60595
   484
wenzelm@60595
   485
or:
wenzelm@60595
   486
wenzelm@60595
   487
  show "C x" if "A x" "B x" for x
wenzelm@60595
   488
wenzelm@60595
   489
Rare INCOMPATIBILITY, the old behaviour may be recovered as follows:
wenzelm@60595
   490
wenzelm@60595
   491
  show "C x" when "A x" "B x" for x
wenzelm@60595
   492
wenzelm@60459
   493
* New command 'consider' states rules for generalized elimination and
wenzelm@60459
   494
case splitting. This is like a toplevel statement "theorem obtains" used
wenzelm@60459
   495
within a proof body; or like a multi-branch 'obtain' without activation
wenzelm@60459
   496
of the local context elements yet.
wenzelm@60459
   497
wenzelm@60455
   498
* Proof method "cases" allows to specify the rule as first entry of
wenzelm@60455
   499
chained facts.  This is particularly useful with 'consider':
wenzelm@60455
   500
wenzelm@60455
   501
  consider (a) A | (b) B | (c) C <proof>
wenzelm@60455
   502
  then have something
wenzelm@60455
   503
  proof cases
wenzelm@60455
   504
    case a
wenzelm@60455
   505
    then show ?thesis <proof>
wenzelm@60455
   506
  next
wenzelm@60455
   507
    case b
wenzelm@60455
   508
    then show ?thesis <proof>
wenzelm@60455
   509
  next
wenzelm@60455
   510
    case c
wenzelm@60455
   511
    then show ?thesis <proof>
wenzelm@60455
   512
  qed
wenzelm@60455
   513
wenzelm@60565
   514
* Command 'case' allows fact name and attribute specification like this:
wenzelm@60565
   515
wenzelm@60565
   516
  case a: (c xs)
wenzelm@60565
   517
  case a [attributes]: (c xs)
wenzelm@60565
   518
wenzelm@60565
   519
Facts that are introduced by invoking the case context are uniformly
wenzelm@60565
   520
qualified by "a"; the same name is used for the cumulative fact. The old
wenzelm@60565
   521
form "case (c xs) [attributes]" is no longer supported. Rare
wenzelm@60565
   522
INCOMPATIBILITY, need to adapt uses of case facts in exotic situations,
wenzelm@60565
   523
and always put attributes in front.
wenzelm@60565
   524
wenzelm@60618
   525
* The standard proof method of commands 'proof' and '..' is now called
wenzelm@60618
   526
"standard" to make semantically clear what it is; the old name "default"
wenzelm@60618
   527
is still available as legacy for some time. Documentation now explains
wenzelm@60618
   528
'..' more accurately as "by standard" instead of "by rule".
wenzelm@60618
   529
wenzelm@62017
   530
* Nesting of Isar goal structure has been clarified: the context after
wenzelm@62017
   531
the initial backwards refinement is retained for the whole proof, within
wenzelm@62017
   532
all its context sections (as indicated via 'next'). This is e.g.
wenzelm@62017
   533
relevant for 'using', 'including', 'supply':
wenzelm@62017
   534
wenzelm@62017
   535
  have "A \<and> A" if a: A for A
wenzelm@62017
   536
    supply [simp] = a
wenzelm@62017
   537
  proof
wenzelm@62017
   538
    show A by simp
wenzelm@62017
   539
  next
wenzelm@62017
   540
    show A by simp
wenzelm@62017
   541
  qed
wenzelm@62017
   542
wenzelm@62017
   543
* Command 'obtain' binds term abbreviations (via 'is' patterns) in the
wenzelm@62017
   544
proof body as well, abstracted over relevant parameters.
wenzelm@62017
   545
wenzelm@62017
   546
* Improved type-inference for theorem statement 'obtains': separate
wenzelm@62017
   547
parameter scope for of each clause.
wenzelm@62017
   548
wenzelm@62017
   549
* Term abbreviations via 'is' patterns also work for schematic
wenzelm@62017
   550
statements: result is abstracted over unknowns.
wenzelm@62017
   551
wenzelm@60631
   552
* Command 'subgoal' allows to impose some structure on backward
wenzelm@60631
   553
refinements, to avoid proof scripts degenerating into long of 'apply'
wenzelm@60631
   554
sequences. Further explanations and examples are given in the isar-ref
wenzelm@60631
   555
manual.
wenzelm@60631
   556
wenzelm@62017
   557
* Command 'supply' supports fact definitions during goal refinement
wenzelm@62017
   558
('apply' scripts).
wenzelm@62017
   559
wenzelm@61166
   560
* Proof method "goal_cases" turns the current subgoals into cases within
wenzelm@61166
   561
the context; the conclusion is bound to variable ?case in each case. For
wenzelm@61166
   562
example:
wenzelm@60617
   563
wenzelm@60617
   564
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60622
   565
  and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
wenzelm@61166
   566
proof goal_cases
wenzelm@60622
   567
  case (1 x)
wenzelm@60622
   568
  then show ?case using \<open>A x\<close> \<open>B x\<close> sorry
wenzelm@60622
   569
next
wenzelm@60622
   570
  case (2 y z)
wenzelm@60622
   571
  then show ?case using \<open>U y\<close> \<open>V z\<close> sorry
wenzelm@60622
   572
qed
wenzelm@60622
   573
wenzelm@60622
   574
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60622
   575
  and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
wenzelm@61166
   576
proof goal_cases
wenzelm@60617
   577
  case prems: 1
wenzelm@60617
   578
  then show ?case using prems sorry
wenzelm@60617
   579
next
wenzelm@60617
   580
  case prems: 2
wenzelm@60617
   581
  then show ?case using prems sorry
wenzelm@60617
   582
qed
wenzelm@60578
   583
wenzelm@60581
   584
* The undocumented feature of implicit cases goal1, goal2, goal3, etc.
wenzelm@60617
   585
is marked as legacy, and will be removed eventually. The proof method
wenzelm@60617
   586
"goals" achieves a similar effect within regular Isar; often it can be
wenzelm@60617
   587
done more adequately by other means (e.g. 'consider').
wenzelm@60581
   588
wenzelm@62017
   589
* The vacuous fact "TERM x" may be established "by fact" or as `TERM x`
wenzelm@62017
   590
as well, not just "by this" or "." as before.
wenzelm@60551
   591
wenzelm@60554
   592
* Method "sleep" succeeds after a real-time delay (in seconds). This is
wenzelm@60554
   593
occasionally useful for demonstration and testing purposes.
wenzelm@60554
   594
wenzelm@60406
   595
wenzelm@60331
   596
*** Pure ***
wenzelm@60331
   597
wenzelm@61606
   598
* Qualifiers in locale expressions default to mandatory ('!') regardless
wenzelm@61606
   599
of the command. Previously, for 'locale' and 'sublocale' the default was
wenzelm@61606
   600
optional ('?'). The old synatx '!' has been discontinued.
wenzelm@61606
   601
INCOMPATIBILITY, remove '!' and add '?' as required.
ballarin@61565
   602
ballarin@61566
   603
* Keyword 'rewrites' identifies rewrite morphisms in interpretation
wenzelm@62017
   604
commands. Previously, the keyword was 'where'. INCOMPATIBILITY.
ballarin@61566
   605
ballarin@61701
   606
* More gentle suppression of syntax along locale morphisms while
wenzelm@62017
   607
printing terms. Previously 'abbreviation' and 'notation' declarations
wenzelm@62017
   608
would be suppressed for morphisms except term identity. Now
ballarin@61701
   609
'abbreviation' is also kept for morphims that only change the involved
wenzelm@62017
   610
parameters, and only 'notation' is suppressed. This can be of great help
wenzelm@62017
   611
when working with complex locale hierarchies, because proof states are
wenzelm@62017
   612
displayed much more succinctly. It also means that only notation needs
wenzelm@62017
   613
to be redeclared if desired, as illustrated by this example:
ballarin@61701
   614
ballarin@61701
   615
  locale struct = fixes composition :: "'a => 'a => 'a" (infixl "\<cdot>" 65)
ballarin@61701
   616
  begin
ballarin@61701
   617
    definition derived (infixl "\<odot>" 65) where ...
ballarin@61701
   618
  end
ballarin@61701
   619
ballarin@61701
   620
  locale morphism =
ballarin@61701
   621
    left: struct composition + right: struct composition'
ballarin@61701
   622
    for composition (infix "\<cdot>" 65) and composition' (infix "\<cdot>''" 65)
ballarin@61701
   623
  begin
ballarin@61701
   624
    notation right.derived ("\<odot>''")
ballarin@61701
   625
  end
ballarin@61701
   626
wenzelm@61895
   627
* Command 'global_interpretation' issues interpretations into global
wenzelm@61895
   628
theories, with optional rewrite definitions following keyword 'defines'.
wenzelm@61895
   629
wenzelm@61895
   630
* Command 'sublocale' accepts optional rewrite definitions after keyword
haftmann@61675
   631
'defines'.
haftmann@61675
   632
wenzelm@61895
   633
* Command 'permanent_interpretation' has been discontinued. Use
wenzelm@61895
   634
'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.
haftmann@61670
   635
wenzelm@61252
   636
* Command 'print_definitions' prints dependencies of definitional
wenzelm@61252
   637
specifications. This functionality used to be part of 'print_theory'.
wenzelm@61252
   638
wenzelm@60331
   639
* Configuration option rule_insts_schematic has been discontinued
wenzelm@62017
   640
(intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.
wenzelm@60331
   641
wenzelm@62205
   642
* Abbreviations in type classes now carry proper sort constraint. Rare
wenzelm@62205
   643
INCOMPATIBILITY in situations where the previous misbehaviour has been
wenzelm@62205
   644
exploited.
haftmann@60347
   645
haftmann@60347
   646
* Refinement of user-space type system in type classes: pseudo-local
wenzelm@62205
   647
operations behave more similar to abbreviations. Potential
haftmann@60347
   648
INCOMPATIBILITY in exotic situations.
haftmann@60347
   649
haftmann@60347
   650
nipkow@60171
   651
*** HOL ***
nipkow@60171
   652
wenzelm@62017
   653
* The 'typedef' command has been upgraded from a partially checked
wenzelm@62017
   654
"axiomatization", to a full definitional specification that takes the
wenzelm@62017
   655
global collection of overloaded constant / type definitions into
wenzelm@62017
   656
account. Type definitions with open dependencies on overloaded
wenzelm@62017
   657
definitions need to be specified as "typedef (overloaded)". This
wenzelm@62017
   658
provides extra robustness in theory construction. Rare INCOMPATIBILITY.
wenzelm@62017
   659
wenzelm@62017
   660
* Qualification of various formal entities in the libraries is done more
wenzelm@62017
   661
uniformly via "context begin qualified definition ... end" instead of
wenzelm@62017
   662
old-style "hide_const (open) ...". Consequently, both the defined
wenzelm@62017
   663
constant and its defining fact become qualified, e.g. Option.is_none and
wenzelm@62017
   664
Option.is_none_def. Occasional INCOMPATIBILITY in applications.
wenzelm@62017
   665
wenzelm@62017
   666
* Some old and rarely used ASCII replacement syntax has been removed.
wenzelm@62017
   667
INCOMPATIBILITY, standard syntax with symbols should be used instead.
wenzelm@62017
   668
The subsequent commands help to reproduce the old forms, e.g. to
wenzelm@62017
   669
simplify porting old theories:
wenzelm@62017
   670
wenzelm@62017
   671
  notation iff  (infixr "<->" 25)
wenzelm@62017
   672
wenzelm@62017
   673
  notation Times  (infixr "<*>" 80)
wenzelm@62017
   674
wenzelm@62017
   675
  type_notation Map.map  (infixr "~=>" 0)
wenzelm@62017
   676
  notation Map.map_comp  (infixl "o'_m" 55)
wenzelm@62017
   677
wenzelm@62017
   678
  type_notation FinFun.finfun ("(_ =>f /_)" [22, 21] 21)
wenzelm@62017
   679
wenzelm@62017
   680
  notation FuncSet.funcset  (infixr "->" 60)
wenzelm@62017
   681
  notation FuncSet.extensional_funcset  (infixr "->\<^sub>E" 60)
wenzelm@62017
   682
wenzelm@62017
   683
  notation Omega_Words_Fun.conc (infixr "conc" 65)
wenzelm@62017
   684
wenzelm@62017
   685
  notation Preorder.equiv ("op ~~")
wenzelm@62017
   686
    and Preorder.equiv ("(_/ ~~ _)" [51, 51] 50)
wenzelm@62017
   687
wenzelm@62017
   688
  notation (in topological_space) tendsto (infixr "--->" 55)
wenzelm@62017
   689
  notation (in topological_space) LIMSEQ ("((_)/ ----> (_))" [60, 60] 60)
wenzelm@62017
   690
  notation LIM ("((_)/ -- (_)/ --> (_))" [60, 0, 60] 60)
wenzelm@62017
   691
wenzelm@62017
   692
  notation NSA.approx (infixl "@=" 50)
wenzelm@62017
   693
  notation NSLIMSEQ ("((_)/ ----NS> (_))" [60, 60] 60)
wenzelm@62017
   694
  notation NSLIM ("((_)/ -- (_)/ --NS> (_))" [60, 0, 60] 60)
wenzelm@62017
   695
wenzelm@62017
   696
* The alternative notation "\<Colon>" for type and sort constraints has been
wenzelm@62017
   697
removed: in LaTeX document output it looks the same as "::".
wenzelm@62017
   698
INCOMPATIBILITY, use plain "::" instead.
wenzelm@62017
   699
wenzelm@62017
   700
* Commands 'inductive' and 'inductive_set' work better when names for
wenzelm@62017
   701
intro rules are omitted: the "cases" and "induct" rules no longer
wenzelm@62017
   702
declare empty case_names, but no case_names at all. This allows to use
wenzelm@62017
   703
numbered cases in proofs, without requiring method "goal_cases".
wenzelm@62017
   704
wenzelm@62017
   705
* Inductive definitions ('inductive', 'coinductive', etc.) expose
wenzelm@62017
   706
low-level facts of the internal construction only if the option
wenzelm@62093
   707
"inductive_internals" is enabled. This refers to the internal predicate
wenzelm@62017
   708
definition and its monotonicity result. Rare INCOMPATIBILITY.
wenzelm@62017
   709
wenzelm@62017
   710
* Recursive function definitions ('fun', 'function', 'partial_function')
wenzelm@62017
   711
expose low-level facts of the internal construction only if the option
wenzelm@62205
   712
"function_internals" is enabled. Its internal inductive definition is
wenzelm@62205
   713
also subject to "inductive_internals". Rare INCOMPATIBILITY.
wenzelm@62093
   714
wenzelm@62093
   715
* BNF datatypes ('datatype', 'codatatype', etc.) expose low-level facts
wenzelm@62093
   716
of the internal construction only if the option "bnf_internals" is
wenzelm@62093
   717
enabled. This supersedes the former option "bnf_note_all". Rare
wenzelm@62093
   718
INCOMPATIBILITY.
wenzelm@62017
   719
wenzelm@62017
   720
* Combinator to represent case distinction on products is named
wenzelm@62017
   721
"case_prod", uniformly, discontinuing any input aliasses. Very popular
wenzelm@62017
   722
theorem aliasses have been retained.
wenzelm@62017
   723
haftmann@61424
   724
Consolidated facts:
haftmann@61424
   725
  PairE ~> prod.exhaust
haftmann@61424
   726
  Pair_eq ~> prod.inject
haftmann@61424
   727
  pair_collapse ~> prod.collapse
haftmann@61424
   728
  Pair_fst_snd_eq ~> prod_eq_iff
haftmann@61424
   729
  split_twice ~> prod.case_distrib
haftmann@61424
   730
  split_weak_cong ~> prod.case_cong_weak
haftmann@61424
   731
  split_split ~> prod.split
haftmann@61424
   732
  split_split_asm ~> prod.split_asm
haftmann@61424
   733
  splitI ~> case_prodI
haftmann@61424
   734
  splitD ~> case_prodD
haftmann@61424
   735
  splitI2 ~> case_prodI2
haftmann@61424
   736
  splitI2' ~> case_prodI2'
haftmann@61424
   737
  splitE ~> case_prodE
haftmann@61424
   738
  splitE' ~> case_prodE'
haftmann@61424
   739
  split_pair ~> case_prod_Pair
haftmann@61424
   740
  split_eta ~> case_prod_eta
haftmann@61424
   741
  split_comp ~> case_prod_comp
haftmann@61424
   742
  mem_splitI ~> mem_case_prodI
haftmann@61424
   743
  mem_splitI2 ~> mem_case_prodI2
haftmann@61424
   744
  mem_splitE ~> mem_case_prodE
haftmann@61424
   745
  The_split ~> The_case_prod
haftmann@61424
   746
  cond_split_eta ~> cond_case_prod_eta
haftmann@61424
   747
  Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE
haftmann@61424
   748
  Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI
haftmann@61424
   749
  in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq
haftmann@61424
   750
  Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD
haftmann@61424
   751
  Collect_split_Grp_inD ~> Collect_case_prod_Grp_in
haftmann@61424
   752
  Domain_Collect_split ~> Domain_Collect_case_prod
haftmann@61424
   753
  Image_Collect_split ~> Image_Collect_case_prod
haftmann@61424
   754
  Range_Collect_split ~> Range_Collect_case_prod
haftmann@61424
   755
  Eps_split ~> Eps_case_prod
haftmann@61424
   756
  Eps_split_eq ~> Eps_case_prod_eq
haftmann@61424
   757
  split_rsp ~> case_prod_rsp
haftmann@61424
   758
  curry_split ~> curry_case_prod
haftmann@61424
   759
  split_curry ~> case_prod_curry
wenzelm@62017
   760
haftmann@61424
   761
Changes in structure HOLogic:
haftmann@61424
   762
  split_const ~> case_prod_const
haftmann@61424
   763
  mk_split ~> mk_case_prod
haftmann@61424
   764
  mk_psplits ~> mk_ptupleabs
haftmann@61424
   765
  strip_psplits ~> strip_ptupleabs
wenzelm@62017
   766
wenzelm@62017
   767
INCOMPATIBILITY.
wenzelm@62017
   768
wenzelm@62017
   769
* The coercions to type 'real' have been reorganised. The function
wenzelm@62017
   770
'real' is no longer overloaded, but has type 'nat => real' and
wenzelm@62017
   771
abbreviates of_nat for that type. Also 'real_of_int :: int => real'
wenzelm@62017
   772
abbreviates of_int for that type. Other overloaded instances of 'real'
wenzelm@62017
   773
have been replaced by 'real_of_ereal' and 'real_of_float'.
wenzelm@62017
   774
lp15@61694
   775
Consolidated facts (among others):
lp15@61694
   776
  real_of_nat_le_iff -> of_nat_le_iff
lp15@61694
   777
  real_of_nat_numeral of_nat_numeral
lp15@61694
   778
  real_of_int_zero of_int_0
lp15@61694
   779
  real_of_nat_zero of_nat_0
lp15@61694
   780
  real_of_one of_int_1
lp15@61694
   781
  real_of_int_add of_int_add
lp15@61694
   782
  real_of_nat_add of_nat_add
lp15@61694
   783
  real_of_int_diff of_int_diff
lp15@61694
   784
  real_of_nat_diff of_nat_diff
lp15@61694
   785
  floor_subtract floor_diff_of_int
lp15@61694
   786
  real_of_int_inject of_int_eq_iff
lp15@61694
   787
  real_of_int_gt_zero_cancel_iff of_int_0_less_iff
lp15@61694
   788
  real_of_int_ge_zero_cancel_iff of_int_0_le_iff
lp15@61694
   789
  real_of_nat_ge_zero of_nat_0_le_iff
lp15@61694
   790
  real_of_int_ceiling_ge le_of_int_ceiling
lp15@61694
   791
  ceiling_less_eq ceiling_less_iff
lp15@61694
   792
  ceiling_le_eq ceiling_le_iff
lp15@61694
   793
  less_floor_eq less_floor_iff
lp15@61694
   794
  floor_less_eq floor_less_iff
lp15@61694
   795
  floor_divide_eq_div floor_divide_of_int_eq
lp15@61694
   796
  real_of_int_zero_cancel of_nat_eq_0_iff
lp15@61694
   797
  ceiling_real_of_int ceiling_of_int
wenzelm@62017
   798
wenzelm@62017
   799
INCOMPATIBILITY.
wenzelm@61143
   800
wenzelm@60841
   801
* Theory Map: lemma map_of_is_SomeD was a clone of map_of_SomeD and has
wenzelm@60841
   802
been removed. INCOMPATIBILITY.
wenzelm@60841
   803
lars@60712
   804
* Quickcheck setup for finite sets.
lars@60712
   805
nipkow@60171
   806
* Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.
wenzelm@60138
   807
blanchet@60306
   808
* Sledgehammer:
blanchet@61318
   809
  - The MaSh relevance filter has been sped up.
blanchet@60306
   810
  - Proof reconstruction has been improved, to minimize the incidence of
blanchet@60306
   811
    cases where Sledgehammer gives a proof that does not work.
blanchet@60306
   812
  - Auto Sledgehammer now minimizes and preplays the results.
blanchet@61030
   813
  - Handle Vampire 4.0 proof output without raising exception.
blanchet@61043
   814
  - Eliminated "MASH" environment variable. Use the "MaSh" option in
blanchet@61043
   815
    Isabelle/jEdit instead. INCOMPATIBILITY.
blanchet@61317
   816
  - Eliminated obsolete "blocking" option and related subcommands.
blanchet@60306
   817
blanchet@60310
   818
* Nitpick:
blanchet@61325
   819
  - Fixed soundness bug in translation of "finite" predicate.
blanchet@61324
   820
  - Fixed soundness bug in "destroy_constrs" optimization.
blanchet@62080
   821
  - Fixed soundness bug in translation of "rat" type.
blanchet@60310
   822
  - Removed "check_potential" and "check_genuine" options.
blanchet@61317
   823
  - Eliminated obsolete "blocking" option.
blanchet@60310
   824
wenzelm@62027
   825
* (Co)datatype package:
blanchet@61345
   826
  - New commands "lift_bnf" and "copy_bnf" for lifting (copying) a BNF
blanchet@61345
   827
    structure on the raw type to an abstract type defined using typedef.
blanchet@61345
   828
  - Always generate "case_transfer" theorem.
wenzelm@62235
   829
  - For mutual types, generate slightly stronger "rel_induct",
wenzelm@62235
   830
    "rel_coinduct", and "coinduct" theorems. INCOMPATIBLITY.
blanchet@61551
   831
  - Allow discriminators and selectors with the same name as the type
blanchet@61551
   832
    being defined.
blanchet@61551
   833
  - Avoid various internal name clashes (e.g., 'datatype f = f').
traytel@60920
   834
wenzelm@62098
   835
* Transfer: new methods for interactive debugging of 'transfer' and
wenzelm@62098
   836
'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',
wenzelm@62098
   837
'transfer_prover_start' and 'transfer_prover_end'.
kuncar@61370
   838
kleing@62118
   839
* New diagnostic command print_record for displaying record definitions.
kleing@62118
   840
haftmann@60868
   841
* Division on integers is bootstrapped directly from division on
wenzelm@62017
   842
naturals and uses generic numeral algorithm for computations. Slight
wenzelm@62017
   843
INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former
wenzelm@62017
   844
simprocs binary_int_div and binary_int_mod
wenzelm@62017
   845
wenzelm@62017
   846
* Tightened specification of class semiring_no_zero_divisors. Minor
haftmann@60516
   847
INCOMPATIBILITY.
haftmann@60516
   848
haftmann@60688
   849
* Class algebraic_semidom introduces common algebraic notions of
wenzelm@62017
   850
integral (semi)domains, particularly units. Although logically subsumed
wenzelm@62017
   851
by fields, is is not a super class of these in order not to burden
wenzelm@62017
   852
fields with notions that are trivial there.
wenzelm@62017
   853
wenzelm@62017
   854
* Class normalization_semidom specifies canonical representants for
wenzelm@62017
   855
equivalence classes of associated elements in an integral (semi)domain.
wenzelm@62017
   856
This formalizes associated elements as well.
haftmann@60688
   857
haftmann@60688
   858
* Abstract specification of gcd/lcm operations in classes semiring_gcd,
wenzelm@62017
   859
semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute
wenzelm@62017
   860
and gcd_int.commute are subsumed by gcd.commute, as well as
wenzelm@62017
   861
gcd_nat.assoc and gcd_int.assoc by gcd.assoc.
wenzelm@62017
   862
wenzelm@62017
   863
* Former constants Fields.divide (_ / _) and Divides.div (_ div _) are
wenzelm@62017
   864
logically unified to Rings.divide in syntactic type class Rings.divide,
wenzelm@62017
   865
with infix syntax (_ div _). Infix syntax (_ / _) for field division is
wenzelm@62017
   866
added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,
wenzelm@62017
   867
instantiations must refer to Rings.divide rather than the former
wenzelm@62017
   868
separate constants, hence infix syntax (_ / _) is usually not available
wenzelm@62017
   869
during instantiation.
wenzelm@62017
   870
wenzelm@62017
   871
* New cancellation simprocs for boolean algebras to cancel complementary
wenzelm@62017
   872
terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to
wenzelm@62017
   873
"top". INCOMPATIBILITY.
Andreas@61629
   874
hoelzl@62101
   875
* Class uniform_space introduces uniform spaces btw topological spaces
hoelzl@62101
   876
and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be
wenzelm@62205
   877
introduced in the form of an uniformity. Some constants are more general
wenzelm@62205
   878
now, it may be necessary to add type class constraints.
hoelzl@62101
   879
hoelzl@62101
   880
  open_real_def \<leadsto> open_dist
hoelzl@62101
   881
  open_complex_def \<leadsto> open_dist
hoelzl@62101
   882
wenzelm@62026
   883
* Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.
wenzelm@62026
   884
Mathias@60397
   885
* Library/Multiset:
Mathias@60397
   886
  - Renamed multiset inclusion operators:
Mathias@60397
   887
      < ~> <#
blanchet@62208
   888
      > ~> >#
Mathias@60397
   889
      <= ~> <=#
blanchet@62208
   890
      >= ~> >=#
Mathias@60397
   891
      \<le> ~> \<le>#
blanchet@62208
   892
      \<ge> ~> \<ge>#
Mathias@60397
   893
    INCOMPATIBILITY.
blanchet@62209
   894
  - Added multiset inclusion operator syntax:
blanchet@62209
   895
      \<subset>#
blanchet@62209
   896
      \<subseteq>#
blanchet@62209
   897
      \<supset>#
blanchet@62209
   898
      \<supseteq>#
Mathias@60397
   899
  - "'a multiset" is no longer an instance of the "order",
Mathias@60397
   900
    "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",
Mathias@60397
   901
    "semilattice_inf", and "semilattice_sup" type classes. The theorems
Mathias@60397
   902
    previously provided by these type classes (directly or indirectly)
Mathias@60397
   903
    are now available through the "subset_mset" interpretation
Mathias@60397
   904
    (e.g. add_mono ~> subset_mset.add_mono).
Mathias@60397
   905
    INCOMPATIBILITY.
nipkow@60497
   906
  - Renamed conversions:
nipkow@60515
   907
      multiset_of ~> mset
nipkow@60515
   908
      multiset_of_set ~> mset_set
nipkow@60497
   909
      set_of ~> set_mset
nipkow@60497
   910
    INCOMPATIBILITY
Mathias@60398
   911
  - Renamed lemmas:
Mathias@60398
   912
      mset_le_def ~> subseteq_mset_def
Mathias@60398
   913
      mset_less_def ~> subset_mset_def
Mathias@60400
   914
      less_eq_multiset.rep_eq ~> subseteq_mset_def
Mathias@60400
   915
    INCOMPATIBILITY
Mathias@60400
   916
  - Removed lemmas generated by lift_definition:
wenzelm@62235
   917
    less_eq_multiset.abs_eq, less_eq_multiset.rsp,
wenzelm@62235
   918
    less_eq_multiset.transfer, less_eq_multiset_def
Mathias@60400
   919
    INCOMPATIBILITY
wenzelm@60006
   920
wenzelm@62017
   921
* Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a.
wenzelm@62017
   922
wenzelm@62017
   923
* Library/Bourbaki_Witt_Fixpoint: Added formalisation of the
wenzelm@62017
   924
Bourbaki-Witt fixpoint theorem for increasing functions in
wenzelm@62017
   925
chain-complete partial orders.
wenzelm@62017
   926
wenzelm@62017
   927
* Library/Old_Recdef: discontinued obsolete 'defer_recdef' command.
wenzelm@62017
   928
Minor INCOMPATIBILITY, use 'function' instead.
wenzelm@62017
   929
wenzelm@62064
   930
* Library/Periodic_Fun: a locale that provides convenient lemmas for
wenzelm@62064
   931
periodic functions.
eberlm@62060
   932
wenzelm@62098
   933
* Library/Formal_Power_Series: proper definition of division (with
wenzelm@62098
   934
remainder) for formal power series; instances for Euclidean Ring and
wenzelm@62098
   935
GCD.
eberlm@62086
   936
wenzelm@62084
   937
* HOL-Imperative_HOL: obsolete theory Legacy_Mrec has been removed.
wenzelm@62084
   938
wenzelm@62084
   939
* HOL-Statespace: command 'statespace' uses mandatory qualifier for
wenzelm@62084
   940
import of parent, as for general 'locale' expressions. INCOMPATIBILITY,
wenzelm@62084
   941
remove '!' and add '?' as required.
wenzelm@62084
   942
wenzelm@62237
   943
* HOL-Decision_Procs: The "approximation" method works with "powr"
wenzelm@62237
   944
(exponentiation on real numbers) again.
wenzelm@62237
   945
wenzelm@62084
   946
* HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour
wenzelm@62084
   947
integrals (= complex path integrals), Cauchy's integral theorem, winding
wenzelm@62084
   948
numbers and Cauchy's integral formula, Liouville theorem, Fundamental
wenzelm@62084
   949
Theorem of Algebra. Ported from HOL Light.
wenzelm@62084
   950
wenzelm@62084
   951
* HOL-Multivariate_Analysis: topological concepts such as connected
wenzelm@62017
   952
components, homotopic paths and the inside or outside of a set.
wenzelm@61121
   953
wenzelm@62084
   954
* HOL-Multivariate_Analysis: radius of convergence of power series and
wenzelm@62064
   955
various summability tests; Harmonic numbers and the Euler–Mascheroni
wenzelm@62064
   956
constant; the Generalised Binomial Theorem; the complex and real
wenzelm@62064
   957
Gamma/log-Gamma/Digamma/ Polygamma functions and their most important
wenzelm@62064
   958
properties.
eberlm@62060
   959
wenzelm@62084
   960
* HOL-Probability: The central limit theorem based on Levy's uniqueness
wenzelm@62084
   961
and continuity theorems, weak convergence, and characterisitc functions.
wenzelm@62084
   962
wenzelm@62084
   963
* HOL-Data_Structures: new and growing session of standard data
wenzelm@62084
   964
structures.
lammich@61178
   965
wenzelm@60479
   966
wenzelm@60793
   967
*** ML ***
wenzelm@60793
   968
wenzelm@62017
   969
* The following combinators for low-level profiling of the ML runtime
wenzelm@62017
   970
system are available:
wenzelm@62017
   971
wenzelm@62017
   972
  profile_time          (*CPU time*)
wenzelm@62017
   973
  profile_time_thread   (*CPU time on this thread*)
wenzelm@62017
   974
  profile_allocations   (*overall heap allocations*)
wenzelm@62017
   975
wenzelm@62017
   976
* Antiquotation @{undefined} or \<^undefined> inlines (raise Match).
wenzelm@62017
   977
wenzelm@62075
   978
* Antiquotation @{method NAME} inlines the (checked) name of the given
wenzelm@62075
   979
Isar proof method.
wenzelm@62075
   980
wenzelm@61922
   981
* Pretty printing of Poly/ML compiler output in Isabelle has been
wenzelm@61922
   982
improved: proper treatment of break offsets and blocks with consistent
wenzelm@61922
   983
breaks.
wenzelm@61922
   984
wenzelm@61268
   985
* The auxiliary module Pure/display.ML has been eliminated. Its
wenzelm@61268
   986
elementary thm print operations are now in Pure/more_thm.ML and thus
wenzelm@61268
   987
called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY.
wenzelm@61268
   988
wenzelm@61144
   989
* Simproc programming interfaces have been simplified:
wenzelm@61144
   990
Simplifier.make_simproc and Simplifier.define_simproc supersede various
wenzelm@61144
   991
forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that
wenzelm@61144
   992
term patterns for the left-hand sides are specified with implicitly
wenzelm@61144
   993
fixed variables, like top-level theorem statements. INCOMPATIBILITY.
wenzelm@61144
   994
wenzelm@60802
   995
* Instantiation rules have been re-organized as follows:
wenzelm@60802
   996
wenzelm@60802
   997
  Thm.instantiate  (*low-level instantiation with named arguments*)
wenzelm@60802
   998
  Thm.instantiate' (*version with positional arguments*)
wenzelm@60802
   999
wenzelm@60802
  1000
  Drule.infer_instantiate  (*instantiation with type inference*)
wenzelm@60802
  1001
  Drule.infer_instantiate'  (*version with positional arguments*)
wenzelm@60802
  1002
wenzelm@60802
  1003
The LHS only requires variable specifications, instead of full terms.
wenzelm@60802
  1004
Old cterm_instantiate is superseded by infer_instantiate.
wenzelm@60802
  1005
INCOMPATIBILITY, need to re-adjust some ML names and types accordingly.
wenzelm@60802
  1006
wenzelm@60793
  1007
* Old tactic shorthands atac, rtac, etac, dtac, ftac have been
wenzelm@60793
  1008
discontinued. INCOMPATIBILITY, use regular assume_tac, resolve_tac etc.
wenzelm@60793
  1009
instead (with proper context).
wenzelm@60642
  1010
wenzelm@60642
  1011
* Thm.instantiate (and derivatives) no longer require the LHS of the
wenzelm@60642
  1012
instantiation to be certified: plain variables are given directly.
wenzelm@60642
  1013
wenzelm@60707
  1014
* Subgoal.SUBPROOF and Subgoal.FOCUS combinators use anonymous
wenzelm@60707
  1015
quasi-bound variables (like the Simplifier), instead of accidentally
wenzelm@60707
  1016
named local fixes. This has the potential to improve stability of proof
wenzelm@60707
  1017
tools, but can also cause INCOMPATIBILITY for tools that don't observe
wenzelm@60707
  1018
the proof context discipline.
wenzelm@60707
  1019
wenzelm@62017
  1020
* Isar proof methods are based on a slightly more general type
wenzelm@62017
  1021
context_tactic, which allows to change the proof context dynamically
wenzelm@62017
  1022
(e.g. to update cases) and indicate explicit Seq.Error results. Former
wenzelm@62017
  1023
METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are
wenzelm@62017
  1024
provided in src/Pure/Isar/method.ML for convenience. INCOMPATIBILITY.
wenzelm@61885
  1025
wenzelm@60642
  1026
wenzelm@60983
  1027
*** System ***
wenzelm@60983
  1028
wenzelm@62525
  1029
* Command-line tool "isabelle console" enables print mode "ASCII".
wenzelm@61958
  1030
wenzelm@62017
  1031
* Command-line tool "isabelle update_then" expands old Isar command
wenzelm@62017
  1032
conflations:
wenzelm@62017
  1033
wenzelm@62017
  1034
    hence  ~>  then have
wenzelm@62017
  1035
    thus   ~>  then show
wenzelm@62017
  1036
wenzelm@62017
  1037
This syntax is more orthogonal and improves readability and
wenzelm@62017
  1038
maintainability of proofs.
wenzelm@62017
  1039
wenzelm@61602
  1040
* Global session timeout is multiplied by timeout_scale factor. This
wenzelm@61602
  1041
allows to adjust large-scale tests (e.g. AFP) to overall hardware
wenzelm@61602
  1042
performance.
wenzelm@61602
  1043
wenzelm@61174
  1044
* Property values in etc/symbols may contain spaces, if written with the
wenzelm@62205
  1045
replacement character "␣" (Unicode point 0x2324). For example:
wenzelm@61174
  1046
wenzelm@61602
  1047
    \<star>  code: 0x0022c6  group: operator  font: Deja␣Vu␣Sans␣Mono
wenzelm@61174
  1048
wenzelm@60995
  1049
* Java runtime environment for x86_64-windows allows to use larger heap
wenzelm@60995
  1050
space.
wenzelm@60995
  1051
wenzelm@61135
  1052
* Java runtime options are determined separately for 32bit vs. 64bit
wenzelm@61135
  1053
platforms as follows.
wenzelm@61135
  1054
wenzelm@61135
  1055
  - Isabelle desktop application: platform-specific files that are
wenzelm@61135
  1056
    associated with the main app bundle
wenzelm@61135
  1057
wenzelm@61135
  1058
  - isabelle jedit: settings
wenzelm@61135
  1059
    JEDIT_JAVA_SYSTEM_OPTIONS
wenzelm@61135
  1060
    JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64
wenzelm@61135
  1061
wenzelm@61135
  1062
  - isabelle build: settings
wenzelm@61135
  1063
    ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64
wenzelm@61135
  1064
wenzelm@61294
  1065
* Bash shell function "jvmpath" has been renamed to "platform_path": it
wenzelm@61294
  1066
is relevant both for Poly/ML and JVM processes.
wenzelm@61294
  1067
wenzelm@62017
  1068
* Poly/ML default platform architecture may be changed from 32bit to
wenzelm@62205
  1069
64bit via system option ML_system_64. A system restart (and rebuild) is
wenzelm@62205
  1070
required after change.
wenzelm@62017
  1071
wenzelm@62017
  1072
* Poly/ML 5.6 runs natively on x86-windows and x86_64-windows, which
wenzelm@62017
  1073
both allow larger heap space than former x86-cygwin.
wenzelm@62017
  1074
wenzelm@62157
  1075
* Heap images are 10-15% smaller due to less wasteful persistent theory
wenzelm@62157
  1076
content (using ML type theory_id instead of theory);
wenzelm@62157
  1077
wenzelm@60983
  1078
wenzelm@60479
  1079
wenzelm@60009
  1080
New in Isabelle2015 (May 2015)
wenzelm@60009
  1081
------------------------------
wenzelm@57695
  1082
wenzelm@57941
  1083
*** General ***
wenzelm@57941
  1084
wenzelm@59939
  1085
* Local theory specification commands may have a 'private' or
wenzelm@59990
  1086
'qualified' modifier to restrict name space accesses to the local scope,
wenzelm@59939
  1087
as provided by some "context begin ... end" block. For example:
wenzelm@59926
  1088
wenzelm@59926
  1089
  context
wenzelm@59926
  1090
  begin
wenzelm@59926
  1091
wenzelm@59926
  1092
  private definition ...
wenzelm@59926
  1093
  private lemma ...
wenzelm@59926
  1094
wenzelm@59990
  1095
  qualified definition ...
wenzelm@59990
  1096
  qualified lemma ...
wenzelm@59990
  1097
wenzelm@59926
  1098
  lemma ...
wenzelm@59926
  1099
  theorem ...
wenzelm@59926
  1100
wenzelm@59926
  1101
  end
wenzelm@59926
  1102
wenzelm@59901
  1103
* Command 'experiment' opens an anonymous locale context with private
wenzelm@59901
  1104
naming policy.
wenzelm@59901
  1105
wenzelm@59951
  1106
* Command 'notepad' requires proper nesting of begin/end and its proof
wenzelm@59951
  1107
structure in the body: 'oops' is no longer supported here. Minor
wenzelm@59951
  1108
INCOMPATIBILITY, use 'sorry' instead.
wenzelm@59951
  1109
wenzelm@59951
  1110
* Command 'named_theorems' declares a dynamic fact within the context,
wenzelm@59951
  1111
together with an attribute to maintain the content incrementally. This
wenzelm@59951
  1112
supersedes functor Named_Thms in Isabelle/ML, but with a subtle change
wenzelm@59951
  1113
of semantics due to external visual order vs. internal reverse order.
wenzelm@59951
  1114
wenzelm@59951
  1115
* 'find_theorems': search patterns which are abstractions are
wenzelm@59951
  1116
schematically expanded before search. Search results match the naive
wenzelm@59951
  1117
expectation more closely, particularly wrt. abbreviations.
wenzelm@59951
  1118
INCOMPATIBILITY.
wenzelm@59648
  1119
wenzelm@59569
  1120
* Commands 'method_setup' and 'attribute_setup' now work within a local
wenzelm@59569
  1121
theory context.
wenzelm@57941
  1122
wenzelm@58928
  1123
* Outer syntax commands are managed authentically within the theory
wenzelm@59569
  1124
context, without implicit global state. Potential for accidental
wenzelm@58928
  1125
INCOMPATIBILITY, make sure that required theories are really imported.
wenzelm@58928
  1126
wenzelm@60115
  1127
* Historical command-line terminator ";" is no longer accepted (and
wenzelm@60115
  1128
already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle
wenzelm@60115
  1129
update_semicolons" to remove obsolete semicolons from old theory
wenzelm@60115
  1130
sources.
wenzelm@60115
  1131
wenzelm@59951
  1132
* Structural composition of proof methods (meth1; meth2) in Isar
wenzelm@59951
  1133
corresponds to (tac1 THEN_ALL_NEW tac2) in ML.
haftmann@59105
  1134
wenzelm@60119
  1135
* The Eisbach proof method language allows to define new proof methods
wenzelm@60119
  1136
by combining existing ones with their usual syntax. The "match" proof
wenzelm@60119
  1137
method provides basic fact/term matching in addition to
wenzelm@60119
  1138
premise/conclusion matching through Subgoal.focus, and binds fact names
wenzelm@60288
  1139
from matches as well as term patterns within matches. The Isabelle
wenzelm@60288
  1140
documentation provides an entry "eisbach" for the Eisbach User Manual.
wenzelm@60288
  1141
Sources and various examples are in ~~/src/HOL/Eisbach/.
wenzelm@60119
  1142
wenzelm@57941
  1143
wenzelm@58524
  1144
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@58524
  1145
wenzelm@59569
  1146
* Improved folding mode "isabelle" based on Isar syntax. Alternatively,
wenzelm@59569
  1147
the "sidekick" mode may be used for document structure.
wenzelm@59569
  1148
wenzelm@59569
  1149
* Extended bracket matching based on Isar language structure. System
wenzelm@59569
  1150
option jedit_structure_limit determines maximum number of lines to scan
wenzelm@59569
  1151
in the buffer.
wenzelm@58758
  1152
wenzelm@58540
  1153
* Support for BibTeX files: context menu, context-sensitive token
wenzelm@58540
  1154
marker, SideKick parser.
wenzelm@58524
  1155
wenzelm@58551
  1156
* Document antiquotation @{cite} provides formal markup, which is
wenzelm@60265
  1157
interpreted semi-formally based on .bib files that happen to be open in
wenzelm@60265
  1158
the editor (hyperlinks, completion etc.).
wenzelm@58551
  1159
wenzelm@58785
  1160
* Less waste of vertical space via negative line spacing (see Global
wenzelm@58785
  1161
Options / Text Area).
wenzelm@58785
  1162
wenzelm@60089
  1163
* Improved graphview panel with optional output of PNG or PDF, for
wenzelm@60273
  1164
display of 'thy_deps', 'class_deps' etc.
wenzelm@60009
  1165
wenzelm@60115
  1166
* The commands 'thy_deps' and 'class_deps' allow optional bounds to
wenzelm@60115
  1167
restrict the visualized hierarchy.
wenzelm@60093
  1168
wenzelm@60072
  1169
* Improved scheduling for asynchronous print commands (e.g. provers
wenzelm@60072
  1170
managed by the Sledgehammer panel) wrt. ongoing document processing.
wenzelm@60072
  1171
wenzelm@58524
  1172
wenzelm@59951
  1173
*** Document preparation ***
wenzelm@59951
  1174
wenzelm@59951
  1175
* Document markup commands 'chapter', 'section', 'subsection',
wenzelm@59951
  1176
'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any
wenzelm@59951
  1177
context, even before the initial 'theory' command. Obsolete proof
wenzelm@59951
  1178
commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been
wenzelm@59951
  1179
discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'
wenzelm@59951
  1180
instead. The old 'header' command is still retained for some time, but
wenzelm@59951
  1181
should be replaced by 'chapter', 'section' etc. (using "isabelle
wenzelm@59951
  1182
update_header"). Minor INCOMPATIBILITY.
wenzelm@59951
  1183
wenzelm@60009
  1184
* Official support for "tt" style variants, via \isatt{...} or
wenzelm@60009
  1185
\begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or
wenzelm@60009
  1186
verbatim environment of LaTeX is no longer used. This allows @{ML} etc.
wenzelm@60009
  1187
as argument to other macros (such as footnotes).
wenzelm@60009
  1188
wenzelm@60009
  1189
* Document antiquotation @{verbatim} prints ASCII text literally in "tt"
wenzelm@60009
  1190
style.
wenzelm@60009
  1191
wenzelm@60009
  1192
* Discontinued obsolete option "document_graph": session_graph.pdf is
wenzelm@60009
  1193
produced unconditionally for HTML browser_info and PDF-LaTeX document.
wenzelm@60009
  1194
wenzelm@59951
  1195
* Diagnostic commands and document markup commands within a proof do not
wenzelm@59951
  1196
affect the command tag for output. Thus commands like 'thm' are subject
wenzelm@59951
  1197
to proof document structure, and no longer "stick out" accidentally.
wenzelm@59951
  1198
Commands 'text' and 'txt' merely differ in the LaTeX style, not their
wenzelm@59951
  1199
tags. Potential INCOMPATIBILITY in exotic situations.
wenzelm@59951
  1200
wenzelm@59951
  1201
* System option "pretty_margin" is superseded by "thy_output_margin",
wenzelm@59951
  1202
which is also accessible via document antiquotation option "margin".
wenzelm@59951
  1203
Only the margin for document output may be changed, but not the global
wenzelm@59951
  1204
pretty printing: that is 76 for plain console output, and adapted
wenzelm@59951
  1205
dynamically in GUI front-ends. Implementations of document
wenzelm@59951
  1206
antiquotations need to observe the margin explicitly according to
wenzelm@59951
  1207
Thy_Output.string_of_margin. Minor INCOMPATIBILITY.
wenzelm@59951
  1208
wenzelm@60299
  1209
* Specification of 'document_files' in the session ROOT file is
wenzelm@60299
  1210
mandatory for document preparation. The legacy mode with implicit
wenzelm@60299
  1211
copying of the document/ directory is no longer supported. Minor
wenzelm@60299
  1212
INCOMPATIBILITY.
wenzelm@60299
  1213
wenzelm@59951
  1214
haftmann@58202
  1215
*** Pure ***
haftmann@58202
  1216
wenzelm@59835
  1217
* Proof methods with explicit instantiation ("rule_tac", "subgoal_tac"
wenzelm@59835
  1218
etc.) allow an optional context of local variables ('for' declaration):
wenzelm@59835
  1219
these variables become schematic in the instantiated theorem; this
wenzelm@59835
  1220
behaviour is analogous to 'for' in attributes "where" and "of".
wenzelm@59835
  1221
Configuration option rule_insts_schematic (default false) controls use
wenzelm@59835
  1222
of schematic variables outside the context. Minor INCOMPATIBILITY,
wenzelm@59835
  1223
declare rule_insts_schematic = true temporarily and update to use local
wenzelm@59835
  1224
variable declarations or dummy patterns instead.
wenzelm@59835
  1225
wenzelm@60009
  1226
* Explicit instantiation via attributes "where", "of", and proof methods
wenzelm@60009
  1227
"rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns
wenzelm@60009
  1228
("_") that stand for anonymous local variables.
wenzelm@60009
  1229
wenzelm@59951
  1230
* Generated schematic variables in standard format of exported facts are
wenzelm@59951
  1231
incremented to avoid material in the proof context. Rare
wenzelm@59951
  1232
INCOMPATIBILITY, explicit instantiation sometimes needs to refer to
wenzelm@59951
  1233
different index.
wenzelm@59951
  1234
wenzelm@60010
  1235
* Lexical separation of signed and unsigned numerals: categories "num"
wenzelm@60010
  1236
and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence
wenzelm@60010
  1237
of numeral signs, particularly in expressions involving infix syntax
wenzelm@60010
  1238
like "(- 1) ^ n".
haftmann@58410
  1239
wenzelm@58421
  1240
* Old inner token category "xnum" has been discontinued.  Potential
wenzelm@58421
  1241
INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num"
wenzelm@58421
  1242
token category instead.
wenzelm@58421
  1243
haftmann@58202
  1244
blanchet@57737
  1245
*** HOL ***
blanchet@57737
  1246
blanchet@57983
  1247
* New (co)datatype package:
blanchet@58373
  1248
  - The 'datatype_new' command has been renamed 'datatype'. The old
blanchet@58373
  1249
    command of that name is now called 'old_datatype' and is provided
blanchet@58373
  1250
    by "~~/src/HOL/Library/Old_Datatype.thy". See
blanchet@58373
  1251
    'isabelle doc datatypes' for information on porting.
blanchet@58373
  1252
    INCOMPATIBILITY.
blanchet@57983
  1253
  - Renamed theorems:
blanchet@57983
  1254
      disc_corec ~> corec_disc
blanchet@57983
  1255
      disc_corec_iff ~> corec_disc_iff
blanchet@57983
  1256
      disc_exclude ~> distinct_disc
blanchet@57983
  1257
      disc_exhaust ~> exhaust_disc
blanchet@57983
  1258
      disc_map_iff ~> map_disc_iff
blanchet@57983
  1259
      sel_corec ~> corec_sel
blanchet@57983
  1260
      sel_exhaust ~> exhaust_sel
blanchet@57983
  1261
      sel_map ~> map_sel
blanchet@57983
  1262
      sel_set ~> set_sel
blanchet@57983
  1263
      sel_split ~> split_sel
blanchet@57983
  1264
      sel_split_asm ~> split_sel_asm
blanchet@57983
  1265
      strong_coinduct ~> coinduct_strong
blanchet@57983
  1266
      weak_case_cong ~> case_cong_weak
blanchet@57983
  1267
    INCOMPATIBILITY.
blanchet@58192
  1268
  - The "no_code" option to "free_constructors", "datatype_new", and
blanchet@58192
  1269
    "codatatype" has been renamed "plugins del: code".
blanchet@58192
  1270
    INCOMPATIBILITY.
blanchet@58044
  1271
  - The rules "set_empty" have been removed. They are easy
blanchet@58044
  1272
    consequences of other set rules "by auto".
blanchet@58044
  1273
    INCOMPATIBILITY.
blanchet@58044
  1274
  - The rule "set_cases" is now registered with the "[cases set]"
blanchet@57990
  1275
    attribute. This can influence the behavior of the "cases" proof
blanchet@57990
  1276
    method when more than one case rule is applicable (e.g., an
blanchet@57990
  1277
    assumption is of the form "w : set ws" and the method "cases w"
blanchet@57990
  1278
    is invoked). The solution is to specify the case rule explicitly
blanchet@57990
  1279
    (e.g. "cases w rule: widget.exhaust").
blanchet@57990
  1280
    INCOMPATIBILITY.
blanchet@59675
  1281
  - Renamed theories:
blanchet@59675
  1282
      BNF_Comp ~> BNF_Composition
blanchet@59675
  1283
      BNF_FP_Base ~> BNF_Fixpoint_Base
blanchet@59675
  1284
      BNF_GFP ~> BNF_Greatest_Fixpoint
blanchet@59675
  1285
      BNF_LFP ~> BNF_Least_Fixpoint
blanchet@59675
  1286
      BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions
blanchet@59675
  1287
      Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions
blanchet@59675
  1288
    INCOMPATIBILITY.
wenzelm@60114
  1289
  - Lifting and Transfer setup for basic HOL types sum and prod (also
wenzelm@60114
  1290
    option) is now performed by the BNF package. Theories Lifting_Sum,
wenzelm@60114
  1291
    Lifting_Product and Lifting_Option from Main became obsolete and
wenzelm@60114
  1292
    were removed. Changed definitions of the relators rel_prod and
wenzelm@60114
  1293
    rel_sum (using inductive).
traytel@60111
  1294
    INCOMPATIBILITY: use rel_prod.simps and rel_sum.simps instead
wenzelm@60114
  1295
    of rel_prod_def and rel_sum_def.
wenzelm@60114
  1296
    Minor INCOMPATIBILITY: (rarely used by name) transfer theorem names
wenzelm@60114
  1297
    changed (e.g. map_prod_transfer ~> prod.map_transfer).
wenzelm@60261
  1298
  - Parametricity theorems for map functions, relators, set functions,
wenzelm@60261
  1299
    constructors, case combinators, discriminators, selectors and
wenzelm@60261
  1300
    (co)recursors are automatically proved and registered as transfer
wenzelm@60261
  1301
    rules.
blanchet@57983
  1302
blanchet@57983
  1303
* Old datatype package:
blanchet@58310
  1304
  - The old 'datatype' command has been renamed 'old_datatype', and
blanchet@58373
  1305
    'rep_datatype' has been renamed 'old_rep_datatype'. They are
blanchet@58373
  1306
    provided by "~~/src/HOL/Library/Old_Datatype.thy". See
blanchet@58310
  1307
    'isabelle doc datatypes' for information on porting.
blanchet@58373
  1308
    INCOMPATIBILITY.
blanchet@57983
  1309
  - Renamed theorems:
blanchet@57983
  1310
      weak_case_cong ~> case_cong_weak
blanchet@57983
  1311
    INCOMPATIBILITY.
blanchet@58373
  1312
  - Renamed theory:
blanchet@58373
  1313
      ~~/src/HOL/Datatype.thy ~> ~~/src/HOL/Library/Old_Datatype.thy
blanchet@58373
  1314
    INCOMPATIBILITY.
blanchet@57983
  1315
blanchet@59039
  1316
* Nitpick:
wenzelm@60010
  1317
  - Fixed soundness bug related to the strict and non-strict subset
blanchet@59039
  1318
    operations.
blanchet@59039
  1319
blanchet@57737
  1320
* Sledgehammer:
blanchet@59511
  1321
  - CVC4 is now included with Isabelle instead of CVC3 and run by
blanchet@59511
  1322
    default.
blanchet@59965
  1323
  - Z3 is now always enabled by default, now that it is fully open
blanchet@59965
  1324
    source. The "z3_non_commercial" option is discontinued.
blanchet@57737
  1325
  - Minimization is now always enabled by default.
wenzelm@60010
  1326
    Removed sub-command:
blanchet@57737
  1327
      min
blanchet@59967
  1328
  - Proof reconstruction, both one-liners and Isar, has been
blanchet@59039
  1329
    dramatically improved.
blanchet@59039
  1330
  - Improved support for CVC4 and veriT.
blanchet@57737
  1331
blanchet@58062
  1332
* Old and new SMT modules:
blanchet@58067
  1333
  - The old 'smt' method has been renamed 'old_smt' and moved to
wenzelm@59569
  1334
    'src/HOL/Library/Old_SMT.thy'. It is provided for compatibility,
wenzelm@59569
  1335
    until applications have been ported to use the new 'smt' method. For
wenzelm@59569
  1336
    the method to work, an older version of Z3 (e.g. Z3 3.2 or 4.0) must
wenzelm@59569
  1337
    be installed, and the environment variable "OLD_Z3_SOLVER" must
wenzelm@59569
  1338
    point to it.
blanchet@58062
  1339
    INCOMPATIBILITY.
blanchet@58067
  1340
  - The 'smt2' method has been renamed 'smt'.
blanchet@58060
  1341
    INCOMPATIBILITY.
wenzelm@59569
  1342
  - New option 'smt_reconstruction_step_timeout' to limit the
wenzelm@59569
  1343
    reconstruction time of Z3 proof steps in the new 'smt' method.
boehmes@59216
  1344
  - New option 'smt_statistics' to display statistics of the new 'smt'
boehmes@59216
  1345
    method, especially runtime statistics of Z3 proof reconstruction.
blanchet@58060
  1346
wenzelm@60261
  1347
* Lifting: command 'lift_definition' allows to execute lifted constants
wenzelm@60261
  1348
that have as a return type a datatype containing a subtype. This
wenzelm@60261
  1349
overcomes long-time limitations in the area of code generation and
wenzelm@60261
  1350
lifting, and avoids tedious workarounds.
kuncar@60258
  1351
wenzelm@60009
  1352
* Command and antiquotation "value" provide different evaluation slots
wenzelm@60009
  1353
(again), where the previous strategy (NBE after ML) serves as default.
wenzelm@60009
  1354
Minor INCOMPATIBILITY.
wenzelm@60009
  1355
wenzelm@60009
  1356
* Add NO_MATCH-simproc, allows to check for syntactic non-equality.
wenzelm@60009
  1357
wenzelm@60009
  1358
* field_simps: Use NO_MATCH-simproc for distribution rules, to avoid
wenzelm@60009
  1359
non-termination in case of distributing a division. With this change
wenzelm@60009
  1360
field_simps is in some cases slightly less powerful, if it fails try to
wenzelm@60009
  1361
add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.
wenzelm@60009
  1362
wenzelm@60009
  1363
* Separate class no_zero_divisors has been given up in favour of fully
wenzelm@60009
  1364
algebraic semiring_no_zero_divisors. INCOMPATIBILITY.
wenzelm@60009
  1365
wenzelm@60009
  1366
* Class linordered_semidom really requires no zero divisors.
wenzelm@60009
  1367
INCOMPATIBILITY.
wenzelm@60009
  1368
wenzelm@60009
  1369
* Classes division_ring, field and linordered_field always demand
wenzelm@60009
  1370
"inverse 0 = 0". Given up separate classes division_ring_inverse_zero,
wenzelm@60009
  1371
field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.
wenzelm@60009
  1372
wenzelm@60009
  1373
* Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit
wenzelm@60009
  1374
additive inverse operation. INCOMPATIBILITY.
wenzelm@60009
  1375
lp15@60020
  1376
* Complex powers and square roots. The functions "ln" and "powr" are now
wenzelm@60025
  1377
overloaded for types real and complex, and 0 powr y = 0 by definition.
wenzelm@60025
  1378
INCOMPATIBILITY: type constraints may be necessary.
lp15@60020
  1379
wenzelm@60009
  1380
* The functions "sin" and "cos" are now defined for any type of sort
wenzelm@60009
  1381
"{real_normed_algebra_1,banach}" type, so in particular on "real" and
wenzelm@60009
  1382
"complex" uniformly. Minor INCOMPATIBILITY: type constraints may be
wenzelm@60009
  1383
needed.
wenzelm@60009
  1384
wenzelm@60009
  1385
* New library of properties of the complex transcendental functions sin,
wenzelm@60009
  1386
cos, tan, exp, Ln, Arctan, Arcsin, Arccos. Ported from HOL Light.
wenzelm@60009
  1387
wenzelm@60009
  1388
* The factorial function, "fact", now has type "nat => 'a" (of a sort
wenzelm@60009
  1389
that admits numeric types including nat, int, real and complex.
wenzelm@60009
  1390
INCOMPATIBILITY: an expression such as "fact 3 = 6" may require a type
wenzelm@60009
  1391
constraint, and the combination "real (fact k)" is likely to be
wenzelm@60009
  1392
unsatisfactory. If a type conversion is still necessary, then use
wenzelm@60009
  1393
"of_nat (fact k)" or "real_of_nat (fact k)".
wenzelm@60009
  1394
wenzelm@60009
  1395
* Removed functions "natfloor" and "natceiling", use "nat o floor" and
wenzelm@60009
  1396
"nat o ceiling" instead. A few of the lemmas have been retained and
wenzelm@60009
  1397
adapted: in their names "natfloor"/"natceiling" has been replaced by
wenzelm@60009
  1398
"nat_floor"/"nat_ceiling".
wenzelm@60009
  1399
wenzelm@60009
  1400
* Qualified some duplicated fact names required for boostrapping the
wenzelm@60009
  1401
type class hierarchy:
wenzelm@60009
  1402
  ab_add_uminus_conv_diff ~> diff_conv_add_uminus
wenzelm@60009
  1403
  field_inverse_zero ~> inverse_zero
wenzelm@60009
  1404
  field_divide_inverse ~> divide_inverse
wenzelm@60009
  1405
  field_inverse ~> left_inverse
wenzelm@60009
  1406
Minor INCOMPATIBILITY.
wenzelm@60009
  1407
wenzelm@60009
  1408
* Eliminated fact duplicates:
wenzelm@60009
  1409
  mult_less_imp_less_right ~> mult_right_less_imp_less
wenzelm@60009
  1410
  mult_less_imp_less_left ~> mult_left_less_imp_less
wenzelm@60009
  1411
Minor INCOMPATIBILITY.
wenzelm@60009
  1412
wenzelm@60009
  1413
* Fact consolidation: even_less_0_iff is subsumed by
wenzelm@60009
  1414
double_add_less_zero_iff_single_add_less_zero (simp by default anyway).
wenzelm@60009
  1415
wenzelm@60009
  1416
* Generalized and consolidated some theorems concerning divsibility:
wenzelm@60009
  1417
  dvd_reduce ~> dvd_add_triv_right_iff
wenzelm@60009
  1418
  dvd_plus_eq_right ~> dvd_add_right_iff
wenzelm@60009
  1419
  dvd_plus_eq_left ~> dvd_add_left_iff
wenzelm@60009
  1420
Minor INCOMPATIBILITY.
wenzelm@60009
  1421
wenzelm@60009
  1422
* "even" and "odd" are mere abbreviations for "2 dvd _" and "~ 2 dvd _"
wenzelm@60009
  1423
and part of theory Main.
wenzelm@60009
  1424
  even_def ~> even_iff_mod_2_eq_zero
wenzelm@60009
  1425
INCOMPATIBILITY.
wenzelm@60009
  1426
wenzelm@60009
  1427
* Lemma name consolidation: divide_Numeral1 ~> divide_numeral_1. Minor
wenzelm@60009
  1428
INCOMPATIBILITY.
wenzelm@60009
  1429
wenzelm@60009
  1430
* Bootstrap of listsum as special case of abstract product over lists.
wenzelm@60009
  1431
Fact rename:
wenzelm@60009
  1432
    listsum_def ~> listsum.eq_foldr
wenzelm@60009
  1433
INCOMPATIBILITY.
wenzelm@60009
  1434
wenzelm@60009
  1435
* Product over lists via constant "listprod".
wenzelm@60009
  1436
wenzelm@60009
  1437
* Theory List: renamed drop_Suc_conv_tl and nth_drop' to
wenzelm@60009
  1438
Cons_nth_drop_Suc.
nipkow@58247
  1439
Andreas@58626
  1440
* New infrastructure for compiling, running, evaluating and testing
wenzelm@59569
  1441
generated code in target languages in HOL/Library/Code_Test. See
wenzelm@59569
  1442
HOL/Codegenerator_Test/Code_Test* for examples.
wenzelm@58008
  1443
wenzelm@60009
  1444
* Library/Multiset:
blanchet@59813
  1445
  - Introduced "replicate_mset" operation.
blanchet@59813
  1446
  - Introduced alternative characterizations of the multiset ordering in
blanchet@59813
  1447
    "Library/Multiset_Order".
blanchet@59958
  1448
  - Renamed multiset ordering:
blanchet@59958
  1449
      <# ~> #<#
blanchet@59958
  1450
      <=# ~> #<=#
blanchet@59958
  1451
      \<subset># ~> #\<subset>#
blanchet@59958
  1452
      \<subseteq># ~> #\<subseteq>#
blanchet@59958
  1453
    INCOMPATIBILITY.
blanchet@59986
  1454
  - Introduced abbreviations for ill-named multiset operations:
blanchet@59986
  1455
      <#, \<subset># abbreviate < (strict subset)
blanchet@59986
  1456
      <=#, \<le>#, \<subseteq># abbreviate <= (subset or equal)
blanchet@59986
  1457
    INCOMPATIBILITY.
blanchet@59813
  1458
  - Renamed
blanchet@59813
  1459
      in_multiset_of ~> in_multiset_in_set
nipkow@59998
  1460
      Multiset.fold ~> fold_mset
nipkow@59998
  1461
      Multiset.filter ~> filter_mset
blanchet@59813
  1462
    INCOMPATIBILITY.
nipkow@59949
  1463
  - Removed mcard, is equal to size.
blanchet@59813
  1464
  - Added attributes:
blanchet@59813
  1465
      image_mset.id [simp]
blanchet@59813
  1466
      image_mset_id [simp]
blanchet@59813
  1467
      elem_multiset_of_set [simp, intro]
blanchet@59813
  1468
      comp_fun_commute_plus_mset [simp]
blanchet@59813
  1469
      comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]
blanchet@59813
  1470
      in_mset_fold_plus_iff [iff]
blanchet@59813
  1471
      set_of_Union_mset [simp]
blanchet@59813
  1472
      in_Union_mset_iff [iff]
blanchet@59813
  1473
    INCOMPATIBILITY.
blanchet@59813
  1474
wenzelm@60009
  1475
* Library/Sum_of_Squares: simplified and improved "sos" method. Always
wenzelm@60009
  1476
use local CSDP executable, which is much faster than the NEOS server.
wenzelm@60009
  1477
The "sos_cert" functionality is invoked as "sos" with additional
wenzelm@60009
  1478
argument. Minor INCOMPATIBILITY.
wenzelm@60009
  1479
wenzelm@60009
  1480
* HOL-Decision_Procs: New counterexample generator quickcheck
wenzelm@60009
  1481
[approximation] for inequalities of transcendental functions. Uses
wenzelm@60009
  1482
hardware floating point arithmetic to randomly discover potential
wenzelm@60010
  1483
counterexamples. Counterexamples are certified with the "approximation"
wenzelm@60009
  1484
method. See HOL/Decision_Procs/ex/Approximation_Quickcheck_Ex.thy for
wenzelm@60009
  1485
examples.
immler@58990
  1486
hoelzl@59354
  1487
* HOL-Probability: Reworked measurability prover
wenzelm@60010
  1488
  - applies destructor rules repeatedly
hoelzl@59354
  1489
  - removed application splitting (replaced by destructor rule)
wenzelm@59569
  1490
  - added congruence rules to rewrite measure spaces under the sets
wenzelm@59569
  1491
    projection
wenzelm@59569
  1492
wenzelm@60009
  1493
* New proof method "rewrite" (in theory ~~/src/HOL/Library/Rewrite) for
wenzelm@60009
  1494
single-step rewriting with subterm selection based on patterns.
wenzelm@60009
  1495
wenzelm@58630
  1496
blanchet@58066
  1497
*** ML ***
blanchet@58066
  1498
wenzelm@60009
  1499
* Subtle change of name space policy: undeclared entries are now
wenzelm@60009
  1500
considered inaccessible, instead of accessible via the fully-qualified
wenzelm@60009
  1501
internal name. This mainly affects Name_Space.intern (and derivatives),
wenzelm@60009
  1502
which may produce an unexpected Long_Name.hidden prefix. Note that
wenzelm@60010
  1503
contemporary applications use the strict Name_Space.check (and
wenzelm@60009
  1504
derivatives) instead, which is not affected by the change. Potential
wenzelm@60009
  1505
INCOMPATIBILITY in rare applications of Name_Space.intern.
wenzelm@59951
  1506
wenzelm@60094
  1507
* Subtle change of error semantics of Toplevel.proof_of: regular user
wenzelm@60094
  1508
ERROR instead of internal Toplevel.UNDEF.
wenzelm@60094
  1509
wenzelm@59951
  1510
* Basic combinators map, fold, fold_map, split_list, apply are available
wenzelm@59951
  1511
as parameterized antiquotations, e.g. @{map 4} for lists of quadruples.
wenzelm@59951
  1512
wenzelm@59951
  1513
* Renamed "pairself" to "apply2", in accordance to @{apply 2}.
wenzelm@59951
  1514
INCOMPATIBILITY.
wenzelm@59951
  1515
wenzelm@59951
  1516
* Former combinators NAMED_CRITICAL and CRITICAL for central critical
wenzelm@59951
  1517
sections have been discontinued, in favour of the more elementary
wenzelm@59951
  1518
Multithreading.synchronized and its high-level derivative
wenzelm@59951
  1519
Synchronized.var (which is usually sufficient in applications). Subtle
wenzelm@59951
  1520
INCOMPATIBILITY: synchronized access needs to be atomic and cannot be
wenzelm@59951
  1521
nested.
wenzelm@59951
  1522
wenzelm@60009
  1523
* Synchronized.value (ML) is actually synchronized (as in Scala): subtle
wenzelm@60009
  1524
change of semantics with minimal potential for INCOMPATIBILITY.
wenzelm@59899
  1525
wenzelm@59621
  1526
* The main operations to certify logical entities are Thm.ctyp_of and
wenzelm@59621
  1527
Thm.cterm_of with a local context; old-style global theory variants are
wenzelm@59621
  1528
available as Thm.global_ctyp_of and Thm.global_cterm_of.
wenzelm@59621
  1529
INCOMPATIBILITY.
wenzelm@59621
  1530
wenzelm@59582
  1531
* Elementary operations in module Thm are no longer pervasive.
wenzelm@59582
  1532
INCOMPATIBILITY, need to use qualified Thm.prop_of, Thm.cterm_of,
wenzelm@59582
  1533
Thm.term_of etc.
wenzelm@59582
  1534
wenzelm@58963
  1535
* Proper context for various elementary tactics: assume_tac,
wenzelm@59498
  1536
resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,
wenzelm@59498
  1537
compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.
wenzelm@58956
  1538
blanchet@58066
  1539
* Tactical PARALLEL_ALLGOALS is the most common way to refer to
blanchet@58066
  1540
PARALLEL_GOALS.
blanchet@58066
  1541
wenzelm@59564
  1542
* Goal.prove_multi is superseded by the fully general Goal.prove_common,
wenzelm@59564
  1543
which also allows to specify a fork priority.
wenzelm@59564
  1544
wenzelm@59936
  1545
* Antiquotation @{command_spec "COMMAND"} is superseded by
wenzelm@59936
  1546
@{command_keyword COMMAND} (usually without quotes and with PIDE
wenzelm@59936
  1547
markup). Minor INCOMPATIBILITY.
wenzelm@59936
  1548
wenzelm@60009
  1549
* Cartouches within ML sources are turned into values of type
wenzelm@60009
  1550
Input.source (with formal position information).
wenzelm@60009
  1551
blanchet@58066
  1552
wenzelm@58610
  1553
*** System ***
wenzelm@58610
  1554
wenzelm@59951
  1555
* The Isabelle tool "update_cartouches" changes theory files to use
wenzelm@59951
  1556
cartouches instead of old-style {* verbatim *} or `alt_string` tokens.
wenzelm@59951
  1557
wenzelm@60106
  1558
* The Isabelle tool "build" provides new options -X, -k, -x.
wenzelm@59951
  1559
wenzelm@59951
  1560
* Discontinued old-fashioned "codegen" tool. Code generation can always
wenzelm@59951
  1561
be externally triggered using an appropriate ROOT file plus a
wenzelm@59951
  1562
corresponding theory. Parametrization is possible using environment
wenzelm@59951
  1563
variables, or ML snippets in the most extreme cases. Minor
wenzelm@59951
  1564
INCOMPATIBILITY.
wenzelm@58842
  1565
wenzelm@59200
  1566
* JVM system property "isabelle.threads" determines size of Scala thread
wenzelm@59200
  1567
pool, like Isabelle system option "threads" for ML.
wenzelm@59200
  1568
wenzelm@59201
  1569
* JVM system property "isabelle.laf" determines the default Swing
wenzelm@59201
  1570
look-and-feel, via internal class name or symbolic name as in the jEdit
wenzelm@59201
  1571
menu Global Options / Appearance.
wenzelm@59201
  1572
wenzelm@59951
  1573
* Support for Proof General and Isar TTY loop has been discontinued.
wenzelm@60009
  1574
Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.
wenzelm@59891
  1575
wenzelm@58610
  1576
wenzelm@57695
  1577
wenzelm@57452
  1578
New in Isabelle2014 (August 2014)
wenzelm@57452
  1579
---------------------------------
wenzelm@54055
  1580
wenzelm@54702
  1581
*** General ***
wenzelm@54702
  1582
wenzelm@57452
  1583
* Support for official Standard ML within the Isabelle context.
wenzelm@57452
  1584
Command 'SML_file' reads and evaluates the given Standard ML file.
wenzelm@57452
  1585
Toplevel bindings are stored within the theory context; the initial
wenzelm@57452
  1586
environment is restricted to the Standard ML implementation of
wenzelm@57452
  1587
Poly/ML, without the add-ons of Isabelle/ML.  Commands 'SML_import'
wenzelm@57452
  1588
and 'SML_export' allow to exchange toplevel bindings between the two
wenzelm@57452
  1589
separate environments.  See also ~~/src/Tools/SML/Examples.thy for
wenzelm@57452
  1590
some examples.
wenzelm@56499
  1591
wenzelm@57504
  1592
* Standard tactics and proof methods such as "clarsimp", "auto" and
wenzelm@57504
  1593
"safe" now preserve equality hypotheses "x = expr" where x is a free
wenzelm@57504
  1594
variable.  Locale assumptions and chained facts containing "x"
wenzelm@57504
  1595
continue to be useful.  The new method "hypsubst_thin" and the
wenzelm@57504
  1596
configuration option "hypsubst_thin" (within the attribute name space)
wenzelm@57504
  1597
restore the previous behavior.  INCOMPATIBILITY, especially where
wenzelm@57504
  1598
induction is done after these methods or when the names of free and
wenzelm@57504
  1599
bound variables clash.  As first approximation, old proofs may be
wenzelm@57504
  1600
repaired by "using [[hypsubst_thin = true]]" in the critical spot.
wenzelm@57504
  1601
wenzelm@56232
  1602
* More static checking of proof methods, which allows the system to
wenzelm@56232
  1603
form a closure over the concrete syntax.  Method arguments should be
wenzelm@56232
  1604
processed in the original proof context as far as possible, before
wenzelm@56232
  1605
operating on the goal state.  In any case, the standard discipline for
wenzelm@56232
  1606
subgoal-addressing needs to be observed: no subgoals or a subgoal
wenzelm@56232
  1607
number that is out of range produces an empty result sequence, not an
wenzelm@56232
  1608
exception.  Potential INCOMPATIBILITY for non-conformant tactical
wenzelm@56232
  1609
proof tools.
wenzelm@56232
  1610
wenzelm@57452
  1611
* Lexical syntax (inner and outer) supports text cartouches with
wenzelm@57452
  1612
arbitrary nesting, and without escapes of quotes etc.  The Prover IDE
wenzelm@57452
  1613
supports input via ` (backquote).
wenzelm@57452
  1614
wenzelm@57452
  1615
* The outer syntax categories "text" (for formal comments and document
wenzelm@57452
  1616
markup commands) and "altstring" (for literal fact references) allow
wenzelm@57452
  1617
cartouches as well, in addition to the traditional mix of quotations.
wenzelm@57452
  1618
wenzelm@57452
  1619
* Syntax of document antiquotation @{rail} now uses \<newline> instead
wenzelm@57452
  1620
of "\\", to avoid the optical illusion of escaped backslash within
wenzelm@57491
  1621
string token.  General renovation of its syntax using text cartouches.
wenzelm@57452
  1622
Minor INCOMPATIBILITY.
wenzelm@57452
  1623
wenzelm@57452
  1624
* Discontinued legacy_isub_isup, which was a temporary workaround for
wenzelm@57452
  1625
Isabelle/ML in Isabelle2013-1.  The prover process no longer accepts
wenzelm@57452
  1626
old identifier syntax with \<^isub> or \<^isup>.  Potential
wenzelm@57452
  1627
INCOMPATIBILITY.
wenzelm@57452
  1628
wenzelm@57452
  1629
* Document antiquotation @{url} produces markup for the given URL,
wenzelm@57452
  1630
which results in an active hyperlink within the text.
wenzelm@57452
  1631
wenzelm@57452
  1632
* Document antiquotation @{file_unchecked} is like @{file}, but does
wenzelm@57452
  1633
not check existence within the file-system.
wenzelm@57452
  1634
wenzelm@57452
  1635
* Updated and extended manuals: codegen, datatypes, implementation,
wenzelm@57452
  1636
isar-ref, jedit, system.
wenzelm@57423
  1637
wenzelm@54702
  1638
wenzelm@54533
  1639
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@54533
  1640
wenzelm@57650
  1641
* Improved Document panel: simplified interaction where every single
wenzelm@57452
  1642
mouse click (re)opens document via desktop environment or as jEdit
wenzelm@57452
  1643
buffer.
wenzelm@57452
  1644
wenzelm@57452
  1645
* Support for Navigator plugin (with toolbar buttons), with connection
wenzelm@57452
  1646
to PIDE hyperlinks.
wenzelm@57452
  1647
wenzelm@57452
  1648
* Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
wenzelm@57452
  1649
Open text buffers take precedence over copies within the file-system.
wenzelm@57452
  1650
wenzelm@57452
  1651
* Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
wenzelm@57452
  1652
auxiliary ML files.
wenzelm@57423
  1653
wenzelm@57423
  1654
* Improved syntactic and semantic completion mechanism, with simple
wenzelm@57423
  1655
templates, completion language context, name-space completion,
wenzelm@57423
  1656
file-name completion, spell-checker completion.
wenzelm@57423
  1657
wenzelm@57423
  1658
* Refined GUI popup for completion: more robust key/mouse event
wenzelm@57423
  1659
handling and propagation to enclosing text area -- avoid loosing
wenzelm@57423
  1660
keystrokes with slow / remote graphics displays.
wenzelm@57423
  1661
wenzelm@57833
  1662
* Completion popup supports both ENTER and TAB (default) to select an
wenzelm@57833
  1663
item, depending on Isabelle options.
wenzelm@57833
  1664
wenzelm@57423
  1665
* Refined insertion of completion items wrt. jEdit text: multiple
wenzelm@57423
  1666
selections, rectangular selections, rectangular selection as "tall
wenzelm@57423
  1667
caret".
wenzelm@56342
  1668
wenzelm@56580
  1669
* Integrated spell-checker for document text, comments etc. with
wenzelm@57423
  1670
completion popup and context-menu.
wenzelm@56554
  1671
wenzelm@56879
  1672
* More general "Query" panel supersedes "Find" panel, with GUI access
wenzelm@56879
  1673
to commands 'find_theorems' and 'find_consts', as well as print
wenzelm@56879
  1674
operations for the context.  Minor incompatibility in keyboard
wenzelm@56879
  1675
shortcuts etc.: replace action isabelle-find by isabelle-query.
wenzelm@56761
  1676
wenzelm@56901
  1677
* Search field for all output panels ("Output", "Query", "Info" etc.)
wenzelm@56901
  1678
to highlight text via regular expression.
wenzelm@56901
  1679
wenzelm@54881
  1680
* Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
wenzelm@54881
  1681
General") allows to specify additional print modes for the prover
wenzelm@54881
  1682
process, without requiring old-fashioned command-line invocation of
wenzelm@54881
  1683
"isabelle jedit -m MODE".
wenzelm@54881
  1684
wenzelm@56505
  1685
* More support for remote files (e.g. http) using standard Java
wenzelm@56505
  1686
networking operations instead of jEdit virtual file-systems.
wenzelm@56505
  1687
wenzelm@57822
  1688
* Empty editors buffers that are no longer required (e.g.\ via theory
wenzelm@57822
  1689
imports) are automatically removed from the document model.
wenzelm@57822
  1690
wenzelm@57869
  1691
* Improved monitor panel.
wenzelm@57869
  1692
wenzelm@56838
  1693
* Improved Console/Scala plugin: more uniform scala.Console output,
wenzelm@56838
  1694
more robust treatment of threads and interrupts.
wenzelm@56838
  1695
wenzelm@56939
  1696
* Improved management of dockable windows: clarified keyboard focus
wenzelm@56939
  1697
and window placement wrt. main editor view; optional menu item to
wenzelm@56939
  1698
"Detach" a copy where this makes sense.
wenzelm@56939
  1699
wenzelm@57452
  1700
* New Simplifier Trace panel provides an interactive view of the
wenzelm@57591
  1701
simplification process, enabled by the "simp_trace_new" attribute
wenzelm@57452
  1702
within the context.
wenzelm@57452
  1703
wenzelm@57452
  1704
wenzelm@55001
  1705
*** Pure ***
wenzelm@55001
  1706
wenzelm@57504
  1707
* Low-level type-class commands 'classes', 'classrel', 'arities' have
wenzelm@57504
  1708
been discontinued to avoid the danger of non-trivial axiomatization
wenzelm@57504
  1709
that is not immediately visible.  INCOMPATIBILITY, use regular
wenzelm@57504
  1710
'instance' command with proof.  The required OFCLASS(...) theorem
wenzelm@57504
  1711
might be postulated via 'axiomatization' beforehand, or the proof
wenzelm@57504
  1712
finished trivially if the underlying class definition is made vacuous
wenzelm@57504
  1713
(without any assumptions).  See also Isabelle/ML operations
wenzelm@57504
  1714
Axclass.class_axiomatization, Axclass.classrel_axiomatization,
wenzelm@57504
  1715
Axclass.arity_axiomatization.
wenzelm@57504
  1716
wenzelm@56245
  1717
* Basic constants of Pure use more conventional names and are always
wenzelm@56245
  1718
qualified.  Rare INCOMPATIBILITY, but with potentially serious
wenzelm@56245
  1719
consequences, notably for tools in Isabelle/ML.  The following
wenzelm@56245
  1720
renaming needs to be applied:
wenzelm@56245
  1721
wenzelm@56245
  1722
  ==             ~>  Pure.eq
wenzelm@56245
  1723
  ==>            ~>  Pure.imp
wenzelm@56245
  1724
  all            ~>  Pure.all
wenzelm@56245
  1725
  TYPE           ~>  Pure.type
wenzelm@56245
  1726
  dummy_pattern  ~>  Pure.dummy_pattern
wenzelm@56245
  1727
wenzelm@56245
  1728
Systematic porting works by using the following theory setup on a
wenzelm@56245
  1729
*previous* Isabelle version to introduce the new name accesses for the
wenzelm@56245
  1730
old constants:
wenzelm@56245
  1731
wenzelm@56245
  1732
setup {*
wenzelm@56245
  1733
  fn thy => thy
wenzelm@56245
  1734
    |> Sign.root_path
wenzelm@56245
  1735
    |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
wenzelm@56245
  1736
    |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
wenzelm@56245
  1737
    |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
wenzelm@56245
  1738
    |> Sign.restore_naming thy
wenzelm@56245
  1739
*}
wenzelm@56245
  1740
wenzelm@56245
  1741
Thus ML antiquotations like @{const_name Pure.eq} may be used already.
wenzelm@56245
  1742
Later the application is moved to the current Isabelle version, and
wenzelm@56245
  1743
the auxiliary aliases are deleted.
wenzelm@56245
  1744
wenzelm@55143
  1745
* Attributes "where" and "of" allow an optional context of local
wenzelm@55143
  1746
variables ('for' declaration): these variables become schematic in the
wenzelm@55143
  1747
instantiated theorem.
wenzelm@55143
  1748
wenzelm@55152
  1749
* Obsolete attribute "standard" has been discontinued (legacy since
wenzelm@55152
  1750
Isabelle2012).  Potential INCOMPATIBILITY, use explicit 'for' context
wenzelm@55152
  1751
where instantiations with schematic variables are intended (for
wenzelm@55152
  1752
declaration commands like 'lemmas' or attributes like "of").  The
wenzelm@55152
  1753
following temporary definition may help to port old applications:
wenzelm@55152
  1754
wenzelm@55152
  1755
  attribute_setup standard =
wenzelm@55152
  1756
    "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
wenzelm@55152
  1757
wenzelm@55001
  1758
* More thorough check of proof context for goal statements and
wenzelm@55006
  1759
attributed fact expressions (concerning background theory, declared
wenzelm@55006
  1760
hyps).  Potential INCOMPATIBILITY, tools need to observe standard
wenzelm@55006
  1761
context discipline.  See also Assumption.add_assumes and the more
wenzelm@55006
  1762
primitive Thm.assume_hyps.
wenzelm@55001
  1763
wenzelm@55108
  1764
* Inner syntax token language allows regular quoted strings "..."
wenzelm@55108
  1765
(only makes sense in practice, if outer syntax is delimited
wenzelm@57452
  1766
differently, e.g. via cartouches).
wenzelm@57452
  1767
wenzelm@57504
  1768
* Command 'print_term_bindings' supersedes 'print_binds' for clarity,
wenzelm@57504
  1769
but the latter is retained some time as Proof General legacy.
wenzelm@57504
  1770
wenzelm@57452
  1771
* Code generator preprocessor: explicit control of simp tracing on a
wenzelm@57452
  1772
per-constant basis.  See attribute "code_preproc".
haftmann@57430
  1773
wenzelm@55001
  1774
haftmann@54227
  1775
*** HOL ***
haftmann@54227
  1776
wenzelm@57504
  1777
* Code generator: enforce case of identifiers only for strict target
wenzelm@57504
  1778
language requirements.  INCOMPATIBILITY.
wenzelm@57504
  1779
wenzelm@57504
  1780
* Code generator: explicit proof contexts in many ML interfaces.
wenzelm@57504
  1781
INCOMPATIBILITY.
wenzelm@57504
  1782
wenzelm@57504
  1783
* Code generator: minimize exported identifiers by default.  Minor
wenzelm@57504
  1784
INCOMPATIBILITY.
wenzelm@57504
  1785
wenzelm@57504
  1786
* Code generation for SML and OCaml: dropped arcane "no_signatures"
wenzelm@57504
  1787
option.  Minor INCOMPATIBILITY.
wenzelm@57504
  1788
wenzelm@57504
  1789
* "declare [[code abort: ...]]" replaces "code_abort ...".
wenzelm@57504
  1790
INCOMPATIBILITY.
wenzelm@57504
  1791
wenzelm@57504
  1792
* "declare [[code drop: ...]]" drops all code equations associated
wenzelm@57504
  1793
with the given constants.
wenzelm@57504
  1794
wenzelm@57504
  1795
* Code generations are provided for make, fields, extend and truncate
wenzelm@57504
  1796
operations on records.
haftmann@57437
  1797
wenzelm@57452
  1798
* Command and antiquotation "value" are now hardcoded against nbe and
wenzelm@57452
  1799
ML.  Minor INCOMPATIBILITY.
wenzelm@57452
  1800
wenzelm@57504
  1801
* Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.
wenzelm@57504
  1802
wenzelm@57504
  1803
* The symbol "\<newline>" may be used within char or string literals
wenzelm@57504
  1804
to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
wenzelm@57504
  1805
wenzelm@57504
  1806
* Qualified String.implode and String.explode.  INCOMPATIBILITY.
haftmann@56923
  1807
wenzelm@57452
  1808
* Simplifier: Enhanced solver of preconditions of rewrite rules can
wenzelm@57452
  1809
now deal with conjunctions.  For help with converting proofs, the old
wenzelm@57452
  1810
behaviour of the simplifier can be restored like this: declare/using
wenzelm@57452
  1811
[[simp_legacy_precond]].  This configuration option will disappear
wenzelm@57452
  1812
again in the future.  INCOMPATIBILITY.
nipkow@56073
  1813
wenzelm@55139
  1814
* Simproc "finite_Collect" is no longer enabled by default, due to
wenzelm@55139
  1815
spurious crashes and other surprises.  Potential INCOMPATIBILITY.
wenzelm@55139
  1816
wenzelm@57452
  1817
* Moved new (co)datatype package and its dependencies from session
wenzelm@57452
  1818
  "HOL-BNF" to "HOL".  The commands 'bnf', 'wrap_free_constructors',
wenzelm@57452
  1819
  'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now
wenzelm@57452
  1820
  part of theory "Main".
wenzelm@57452
  1821
blanchet@55098
  1822
  Theory renamings:
blanchet@55098
  1823
    FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
blanchet@55098
  1824
    Library/Wfrec.thy ~> Wfrec.thy
blanchet@55098
  1825
    Library/Zorn.thy ~> Zorn.thy
blanchet@55098
  1826
    Cardinals/Order_Relation.thy ~> Order_Relation.thy
blanchet@55098
  1827
    Library/Order_Union.thy ~> Cardinals/Order_Union.thy
blanchet@55098
  1828
    Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
blanchet@55098
  1829
    Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
blanchet@55098
  1830
    Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
blanchet@55098
  1831
    Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
blanchet@55098
  1832
    Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
blanchet@55098
  1833
    BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
blanchet@55098
  1834
    BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
blanchet@55098
  1835
    BNF/BNF_Comp.thy ~> BNF_Comp.thy
blanchet@55098
  1836
    BNF/BNF_Def.thy ~> BNF_Def.thy
blanchet@55098
  1837
    BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
blanchet@55098
  1838
    BNF/BNF_GFP.thy ~> BNF_GFP.thy
blanchet@55098
  1839
    BNF/BNF_LFP.thy ~> BNF_LFP.thy
blanchet@55098
  1840
    BNF/BNF_Util.thy ~> BNF_Util.thy
blanchet@55098
  1841
    BNF/Coinduction.thy ~> Coinduction.thy
blanchet@55098
  1842
    BNF/More_BNFs.thy ~> Library/More_BNFs.thy
blanchet@55098
  1843
    BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
blanchet@55098
  1844
    BNF/Examples/* ~> BNF_Examples/*
wenzelm@57452
  1845
blanchet@55098
  1846
  New theories:
blanchet@55098
  1847
    Wellorder_Extension.thy (split from Zorn.thy)
blanchet@55098
  1848
    Library/Cardinal_Notations.thy
traytel@56942
  1849
    Library/BNF_Axomatization.thy
blanchet@55098
  1850
    BNF_Examples/Misc_Primcorec.thy
blanchet@55098
  1851
    BNF_Examples/Stream_Processor.thy
wenzelm@57452
  1852
blanchet@55519
  1853
  Discontinued theories:
blanchet@55098
  1854
    BNF/BNF.thy
blanchet@55098
  1855
    BNF/Equiv_Relations_More.thy
wenzelm@57452
  1856
wenzelm@57452
  1857
INCOMPATIBILITY.
blanchet@55098
  1858
blanchet@56118
  1859
* New (co)datatype package:
wenzelm@57452
  1860
  - Command 'primcorec' is fully implemented.
wenzelm@57452
  1861
  - Command 'datatype_new' generates size functions ("size_xxx" and
wenzelm@57452
  1862
    "size") as required by 'fun'.
wenzelm@57452
  1863
  - BNFs are integrated with the Lifting tool and new-style
wenzelm@57452
  1864
    (co)datatypes with Transfer.
wenzelm@57452
  1865
  - Renamed commands:
blanchet@55875
  1866
      datatype_new_compat ~> datatype_compat
blanchet@55875
  1867
      primrec_new ~> primrec
blanchet@55875
  1868
      wrap_free_constructors ~> free_constructors
blanchet@55875
  1869
    INCOMPATIBILITY.
wenzelm@57452
  1870
  - The generated constants "xxx_case" and "xxx_rec" have been renamed
blanchet@55875
  1871
    "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
blanchet@55875
  1872
    INCOMPATIBILITY.
wenzelm@57452
  1873
  - The constant "xxx_(un)fold" and related theorems are no longer
wenzelm@57452
  1874
    generated.  Use "xxx_(co)rec" or define "xxx_(un)fold" manually
wenzelm@57452
  1875
    using "prim(co)rec".
blanchet@55875
  1876
    INCOMPATIBILITY.
wenzelm@57452
  1877
  - No discriminators are generated for nullary constructors by
wenzelm@57452
  1878
    default, eliminating the need for the odd "=:" syntax.
blanchet@57091
  1879
    INCOMPATIBILITY.
wenzelm@57452
  1880
  - No discriminators or selectors are generated by default by
blanchet@57094
  1881
    "datatype_new", unless custom names are specified or the new
blanchet@57094
  1882
    "discs_sels" option is passed.
blanchet@57094
  1883
    INCOMPATIBILITY.
blanchet@55875
  1884
blanchet@55643
  1885
* Old datatype package:
wenzelm@57452
  1886
  - The generated theorems "xxx.cases" and "xxx.recs" have been
wenzelm@57452
  1887
    renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->
wenzelm@57452
  1888
    "sum.case").  INCOMPATIBILITY.
wenzelm@57452
  1889
  - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have
wenzelm@57452
  1890
    been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,
wenzelm@57452
  1891
    "prod_case" ~> "case_prod").  INCOMPATIBILITY.
wenzelm@57452
  1892
wenzelm@57452
  1893
* The types "'a list" and "'a option", their set and map functions,
wenzelm@57452
  1894
  their relators, and their selectors are now produced using the new
wenzelm@57452
  1895
  BNF-based datatype package.
wenzelm@57452
  1896
blanchet@55519
  1897
  Renamed constants:
blanchet@55519
  1898
    Option.set ~> set_option
blanchet@55519
  1899
    Option.map ~> map_option
blanchet@55525
  1900
    option_rel ~> rel_option
wenzelm@57452
  1901
blanchet@55519
  1902
  Renamed theorems:
blanchet@55585
  1903
    set_def ~> set_rec[abs_def]
blanchet@55519
  1904
    map_def ~> map_rec[abs_def]
blanchet@55519
  1905
    Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
blanchet@56652
  1906
    option.recs ~> option.rec
blanchet@55524
  1907
    list_all2_def ~> list_all2_iff
blanchet@55585
  1908
    set.simps ~> set_simps (or the slightly different "list.set")
blanchet@55519
  1909
    map.simps ~> list.map
blanchet@55519
  1910
    hd.simps ~> list.sel(1)
blanchet@55519
  1911
    tl.simps ~> list.sel(2-3)
blanchet@55519
  1912
    the.simps ~> option.sel
wenzelm@57452
  1913
wenzelm@57452
  1914
INCOMPATIBILITY.
blanchet@55519
  1915
blanchet@55933
  1916
* The following map functions and relators have been renamed:
blanchet@55939
  1917
    sum_map ~> map_sum
blanchet@55939
  1918
    map_pair ~> map_prod
blanchet@55944
  1919
    prod_rel ~> rel_prod
blanchet@55943
  1920
    sum_rel ~> rel_sum
blanchet@55945
  1921
    fun_rel ~> rel_fun
blanchet@55942
  1922
    set_rel ~> rel_set
blanchet@55942
  1923
    filter_rel ~> rel_filter
wenzelm@57452
  1924
    fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")
wenzelm@57452
  1925
    cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")
wenzelm@57452
  1926
    vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")
wenzelm@57452
  1927
wenzelm@57452
  1928
INCOMPATIBILITY.
wenzelm@57452
  1929
kuncar@57826
  1930
* Lifting and Transfer:
kuncar@57826
  1931
  - a type variable as a raw type is supported
kuncar@57826
  1932
  - stronger reflexivity prover
kuncar@57826
  1933
  - rep_eq is always generated by lift_definition
wenzelm@57856
  1934
  - setup for Lifting/Transfer is now automated for BNFs
kuncar@57826
  1935
    + holds for BNFs that do not contain a dead variable
wenzelm@57856
  1936
    + relator_eq, relator_mono, relator_distr, relator_domain,
kuncar@57826
  1937
      relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,
kuncar@57826
  1938
      right_unique, right_total, left_unique, left_total are proved
kuncar@57826
  1939
      automatically
kuncar@57826
  1940
    + definition of a predicator is generated automatically
kuncar@57826
  1941
    + simplification rules for a predicator definition are proved
kuncar@57826
  1942
      automatically for datatypes
kuncar@57826
  1943
  - consolidation of the setup of Lifting/Transfer
wenzelm@57856
  1944
    + property that a relator preservers reflexivity is not needed any
kuncar@57826
  1945
      more
kuncar@57826
  1946
      Minor INCOMPATIBILITY.
wenzelm@57856
  1947
    + left_total and left_unique rules are now transfer rules
kuncar@57826
  1948
      (reflexivity_rule attribute not needed anymore)
kuncar@57826
  1949
      INCOMPATIBILITY.
wenzelm@57856
  1950
    + Domainp does not have to be a separate assumption in
kuncar@57826
  1951
      relator_domain theorems (=> more natural statement)
kuncar@57826
  1952
      INCOMPATIBILITY.
kuncar@57826
  1953
  - registration of code equations is more robust
kuncar@57826
  1954
    Potential INCOMPATIBILITY.
kuncar@57826
  1955
  - respectfulness proof obligation is preprocessed to a more readable
kuncar@57826
  1956
    form
kuncar@57826
  1957
    Potential INCOMPATIBILITY.
kuncar@57826
  1958
  - eq_onp is always unfolded in respectfulness proof obligation
kuncar@57826
  1959
    Potential INCOMPATIBILITY.
wenzelm@57856
  1960
  - unregister lifting setup for Code_Numeral.integer and
kuncar@57826
  1961
    Code_Numeral.natural
kuncar@57826
  1962
    Potential INCOMPATIBILITY.
kuncar@57826
  1963
  - Lifting.invariant -> eq_onp
kuncar@57826
  1964
    INCOMPATIBILITY.
wenzelm@57856
  1965
wenzelm@57508
  1966
* New internal SAT solver "cdclite" that produces models and proof
wenzelm@57508
  1967
traces.  This solver replaces the internal SAT solvers "enumerate" and
wenzelm@57508
  1968
"dpll".  Applications that explicitly used one of these two SAT
wenzelm@57508
  1969
solvers should use "cdclite" instead. In addition, "cdclite" is now
wenzelm@57508
  1970
the default SAT solver for the "sat" and "satx" proof methods and
wenzelm@57508
  1971
corresponding tactics; the old default can be restored using "declare
wenzelm@57508
  1972
[[sat_solver = zchaff_with_proofs]]".  Minor INCOMPATIBILITY.
wenzelm@57508
  1973
wenzelm@57508
  1974
* SMT module: A new version of the SMT module, temporarily called
wenzelm@57508
  1975
"SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,
wenzelm@57508
  1976
4.3). The new proof method is called "smt2". CVC3 and CVC4 are also
wenzelm@57508
  1977
supported as oracles. Yices is no longer supported, because no version
wenzelm@57508
  1978
of the solver can handle both SMT-LIB 2 and quantifiers.
wenzelm@57508
  1979
wenzelm@57508
  1980
* Activation of Z3 now works via "z3_non_commercial" system option
wenzelm@57508
  1981
(without requiring restart), instead of former settings variable
wenzelm@57508
  1982
"Z3_NON_COMMERCIAL".  The option can be edited in Isabelle/jEdit menu
wenzelm@57508
  1983
Plugin Options / Isabelle / General.
wenzelm@57508
  1984
wenzelm@57508
  1985
* Sledgehammer:
wenzelm@57508
  1986
  - Z3 can now produce Isar proofs.
wenzelm@57508
  1987
  - MaSh overhaul:
blanchet@57532
  1988
    . New SML-based learning algorithms eliminate the dependency on
wenzelm@57508
  1989
      Python and increase performance and reliability.
wenzelm@57508
  1990
    . MaSh and MeSh are now used by default together with the
wenzelm@57508
  1991
      traditional MePo (Meng-Paulson) relevance filter. To disable
wenzelm@57508
  1992
      MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin
wenzelm@57508
  1993
      Options / Isabelle / General to "none".
wenzelm@57508
  1994
  - New option:
wenzelm@57508
  1995
      smt_proofs
wenzelm@57508
  1996
  - Renamed options:
wenzelm@57508
  1997
      isar_compress ~> compress
wenzelm@57508
  1998
      isar_try0 ~> try0
wenzelm@57508
  1999
wenzelm@57508
  2000
INCOMPATIBILITY.
wenzelm@57508
  2001
wenzelm@57508
  2002
* Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
wenzelm@57508
  2003
wenzelm@57508
  2004
* Nitpick:
wenzelm@57508
  2005
  - Fixed soundness bug whereby mutually recursive datatypes could
wenzelm@57508
  2006
    take infinite values.
wenzelm@57508
  2007
  - Fixed soundness bug with low-level number functions such as
wenzelm@57508
  2008
    "Abs_Integ" and "Rep_Integ".
wenzelm@57508
  2009
  - Removed "std" option.
wenzelm@57508
  2010
  - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
wenzelm@57508
  2011
    "hide_types".
wenzelm@57508
  2012
wenzelm@57508
  2013
* Metis: Removed legacy proof method 'metisFT'. Use 'metis
wenzelm@57508
  2014
(full_types)' instead. INCOMPATIBILITY.
wenzelm@57508
  2015
wenzelm@57508
  2016
* Try0: Added 'algebra' and 'meson' to the set of proof methods.
wenzelm@57508
  2017
wenzelm@57508
  2018
* Adjustion of INF and SUP operations:
wenzelm@57508
  2019
  - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
wenzelm@57508
  2020
  - Consolidated theorem names containing INFI and SUPR: have INF and
wenzelm@57508
  2021
    SUP instead uniformly.
wenzelm@57508
  2022
  - More aggressive normalization of expressions involving INF and Inf
wenzelm@57508
  2023
    or SUP and Sup.
wenzelm@57508
  2024
  - INF_image and SUP_image do not unfold composition.
wenzelm@57508
  2025
  - Dropped facts INF_comp, SUP_comp.
wenzelm@57508
  2026
  - Default congruence rules strong_INF_cong and strong_SUP_cong, with
wenzelm@57508
  2027
    simplifier implication in premises.  Generalize and replace former
wenzelm@57508
  2028
    INT_cong, SUP_cong
wenzelm@57508
  2029
wenzelm@57508
  2030
INCOMPATIBILITY.
wenzelm@57508
  2031
wenzelm@57508
  2032
* SUP and INF generalized to conditionally_complete_lattice.
wenzelm@57508
  2033
wenzelm@57508
  2034
* Swapped orientation of facts image_comp and vimage_comp:
wenzelm@57508
  2035
wenzelm@57508
  2036
  image_compose ~> image_comp [symmetric]
wenzelm@57508
  2037
  image_comp ~> image_comp [symmetric]
wenzelm@57508
  2038
  vimage_compose ~> vimage_comp [symmetric]
wenzelm@57508
  2039
  vimage_comp ~> vimage_comp [symmetric]
wenzelm@57508
  2040
wenzelm@57508
  2041
INCOMPATIBILITY.
wenzelm@57508
  2042
wenzelm@57504
  2043
* Theory reorganization: split of Big_Operators.thy into
wenzelm@57504
  2044
Groups_Big.thy and Lattices_Big.thy.
blanchet@55098
  2045
haftmann@57418
  2046
* Consolidated some facts about big group operators:
haftmann@57418
  2047
haftmann@57418
  2048
    setsum_0' ~> setsum.neutral
haftmann@57418
  2049
    setsum_0 ~> setsum.neutral_const
haftmann@57418
  2050
    setsum_addf ~> setsum.distrib
haftmann@57418
  2051
    setsum_cartesian_product ~> setsum.cartesian_product
haftmann@57418
  2052
    setsum_cases ~> setsum.If_cases
haftmann@57418
  2053
    setsum_commute ~> setsum.commute
haftmann@57418
  2054
    setsum_cong ~> setsum.cong
haftmann@57418
  2055
    setsum_delta ~> setsum.delta
haftmann@57418
  2056
    setsum_delta' ~> setsum.delta'
haftmann@57418
  2057
    setsum_diff1' ~> setsum.remove
haftmann@57418
  2058
    setsum_empty ~> setsum.empty
haftmann@57418
  2059
    setsum_infinite ~> setsum.infinite
haftmann@57418
  2060
    setsum_insert ~> setsum.insert
haftmann@57418
  2061
    setsum_inter_restrict'' ~> setsum.inter_filter
haftmann@57418
  2062
    setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left
haftmann@57418
  2063
    setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right
haftmann@57418
  2064
    setsum_mono_zero_left ~> setsum.mono_neutral_left
haftmann@57418
  2065
    setsum_mono_zero_right ~> setsum.mono_neutral_right
haftmann@57418
  2066
    setsum_reindex ~> setsum.reindex
haftmann@57418
  2067
    setsum_reindex_cong ~> setsum.reindex_cong
haftmann@57418
  2068
    setsum_reindex_nonzero ~> setsum.reindex_nontrivial
haftmann@57418
  2069
    setsum_restrict_set ~> setsum.inter_restrict
haftmann@57418
  2070
    setsum_Plus ~> setsum.Plus
haftmann@57418
  2071
    setsum_setsum_restrict ~> setsum.commute_restrict
haftmann@57418
  2072
    setsum_Sigma ~> setsum.Sigma
haftmann@57418
  2073
    setsum_subset_diff ~> setsum.subset_diff
haftmann@57418
  2074
    setsum_Un_disjoint ~> setsum.union_disjoint
haftmann@57418
  2075
    setsum_UN_disjoint ~> setsum.UNION_disjoint
haftmann@57418
  2076
    setsum_Un_Int ~> setsum.union_inter
haftmann@57418
  2077
    setsum_Union_disjoint ~> setsum.Union_disjoint
haftmann@57418
  2078
    setsum_UNION_zero ~> setsum.Union_comp
haftmann@57418
  2079
    setsum_Un_zero ~> setsum.union_inter_neutral
haftmann@57418
  2080
    strong_setprod_cong ~> setprod.strong_cong
haftmann@57418
  2081
    strong_setsum_cong ~> setsum.strong_cong
haftmann@57418
  2082
    setprod_1' ~> setprod.neutral
haftmann@57418
  2083
    setprod_1 ~> setprod.neutral_const
haftmann@57418
  2084
    setprod_cartesian_product ~> setprod.cartesian_product
haftmann@57418
  2085
    setprod_cong ~> setprod.cong
haftmann@57418
  2086
    setprod_delta ~> setprod.delta
haftmann@57418
  2087
    setprod_delta' ~> setprod.delta'
haftmann@57418
  2088
    setprod_empty ~> setprod.empty
haftmann@57418
  2089
    setprod_infinite ~> setprod.infinite
haftmann@57418
  2090
    setprod_insert ~> setprod.insert
haftmann@57418
  2091
    setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left
haftmann@57418
  2092
    setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right
haftmann@57418
  2093
    setprod_mono_one_left ~> setprod.mono_neutral_left
haftmann@57418
  2094
    setprod_mono_one_right ~> setprod.mono_neutral_right
haftmann@57418
  2095
    setprod_reindex ~> setprod.reindex
haftmann@57418
  2096
    setprod_reindex_cong ~> setprod.reindex_cong
haftmann@57418
  2097
    setprod_reindex_nonzero ~> setprod.reindex_nontrivial
haftmann@57418
  2098
    setprod_Sigma ~> setprod.Sigma
haftmann@57418
  2099
    setprod_subset_diff ~> setprod.subset_diff
haftmann@57418
  2100
    setprod_timesf ~> setprod.distrib
haftmann@57418
  2101
    setprod_Un2 ~> setprod.union_diff2
haftmann@57418
  2102
    setprod_Un_disjoint ~> setprod.union_disjoint
haftmann@57418
  2103
    setprod_UN_disjoint ~> setprod.UNION_disjoint
haftmann@57418
  2104
    setprod_Un_Int ~> setprod.union_inter
haftmann@57418
  2105
    setprod_Union_disjoint ~> setprod.Union_disjoint
haftmann@57418
  2106
    setprod_Un_one ~> setprod.union_inter_neutral
haftmann@57418
  2107
haftmann@57418
  2108
  Dropped setsum_cong2 (simple variant of setsum.cong).
haftmann@57418
  2109
  Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)
haftmann@57418
  2110
  Dropped setsum_reindex_id, setprod_reindex_id
haftmann@57418
  2111
    (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).
haftmann@57418
  2112
wenzelm@57452
  2113
INCOMPATIBILITY.
wenzelm@57452
  2114
haftmann@54864
  2115
* Abolished slightly odd global lattice interpretation for min/max.
haftmann@54864
  2116
wenzelm@57452
  2117
  Fact consolidations:
haftmann@54864
  2118
    min_max.inf_assoc ~> min.assoc
haftmann@54864
  2119
    min_max.inf_commute ~> min.commute
haftmann@54864
  2120
    min_max.inf_left_commute ~> min.left_commute
haftmann@54864
  2121
    min_max.inf_idem ~> min.idem
haftmann@54864
  2122
    min_max.inf_left_idem ~> min.left_idem
haftmann@54864
  2123
    min_max.inf_right_idem ~> min.right_idem
haftmann@54864
  2124
    min_max.sup_assoc ~> max.assoc
haftmann@54864
  2125
    min_max.sup_commute ~> max.commute
haftmann@54864
  2126
    min_max.sup_left_commute ~> max.left_commute
haftmann@54864
  2127
    min_max.sup_idem ~> max.idem
haftmann@54864
  2128
    min_max.sup_left_idem ~> max.left_idem
haftmann@54864
  2129
    min_max.sup_inf_distrib1 ~> max_min_distrib2
haftmann@54864
  2130
    min_max.sup_inf_distrib2 ~> max_min_distrib1
haftmann@54864
  2131
    min_max.inf_sup_distrib1 ~> min_max_distrib2
haftmann@54864
  2132
    min_max.inf_sup_distrib2 ~> min_max_distrib1
haftmann@54864
  2133
    min_max.distrib ~> min_max_distribs
haftmann@54864
  2134
    min_max.inf_absorb1 ~> min.absorb1
haftmann@54864
  2135
    min_max.inf_absorb2 ~> min.absorb2
haftmann@54864
  2136
    min_max.sup_absorb1 ~> max.absorb1
haftmann@54864
  2137
    min_max.sup_absorb2 ~> max.absorb2
haftmann@54864
  2138
    min_max.le_iff_inf ~> min.absorb_iff1
haftmann@54864
  2139
    min_max.le_iff_sup ~> max.absorb_iff2
haftmann@54864
  2140
    min_max.inf_le1 ~> min.cobounded1
haftmann@54864
  2141
    min_max.inf_le2 ~> min.cobounded2
haftmann@54864
  2142
    le_maxI1, min_max.sup_ge1 ~> max.cobounded1
haftmann@54864
  2143
    le_maxI2, min_max.sup_ge2 ~> max.cobounded2
haftmann@54864
  2144
    min_max.le_infI1 ~> min.coboundedI1
haftmann@54864
  2145
    min_max.le_infI2 ~> min.coboundedI2
haftmann@54864
  2146
    min_max.le_supI1 ~> max.coboundedI1
haftmann@54864
  2147
    min_max.le_supI2 ~> max.coboundedI2
haftmann@54864
  2148
    min_max.less_infI1 ~> min.strict_coboundedI1
haftmann@54864
  2149
    min_max.less_infI2 ~> min.strict_coboundedI2
haftmann@54864
  2150
    min_max.less_supI1 ~> max.strict_coboundedI1
haftmann@54864
  2151
    min_max.less_supI2 ~> max.strict_coboundedI2
haftmann@54864
  2152
    min_max.inf_mono ~> min.mono
haftmann@54864
  2153
    min_max.sup_mono ~> max.mono
haftmann@54864
  2154
    min_max.le_infI, min_max.inf_greatest ~> min.boundedI
haftmann@54864
  2155
    min_max.le_supI, min_max.sup_least ~> max.boundedI
haftmann@54864
  2156
    min_max.le_inf_iff ~> min.bounded_iff
haftmann@54864
  2157
    min_max.le_sup_iff ~> max.bounded_iff
haftmann@54864
  2158
haftmann@54864
  2159
For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
haftmann@54864
  2160
min.left_commute, min.left_idem, max.commute, max.assoc,
haftmann@54864
  2161
max.left_commute, max.left_idem directly.
haftmann@54864
  2162
wenzelm@57452
  2163
For min_max.inf_sup_ord, prefer (one of) min.cobounded1,
wenzelm@57452
  2164
min.cobounded2, max.cobounded1m max.cobounded2 directly.
haftmann@54864
  2165
haftmann@56807
  2166
For min_ac or max_ac, prefer more general collection ac_simps.
haftmann@54864
  2167
wenzelm@58604
  2168
INCOMPATIBILITY.
haftmann@54864
  2169
wenzelm@57452
  2170
* Theorem disambiguation Inf_le_Sup (on finite sets) ~>
wenzelm@57452
  2171
Inf_fin_le_Sup_fin.  INCOMPATIBILITY.
haftmann@54745
  2172
haftmann@54295
  2173
* Qualified constant names Wellfounded.acc, Wellfounded.accp.
haftmann@54295
  2174
INCOMPATIBILITY.
haftmann@54295
  2175
haftmann@54228
  2176
* Fact generalization and consolidation:
haftmann@54228
  2177
    neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
wenzelm@57452
  2178
wenzelm@57452
  2179
INCOMPATIBILITY.
wenzelm@57452
  2180
wenzelm@57452
  2181
* Purely algebraic definition of even.  Fact generalization and
wenzelm@57452
  2182
  consolidation:
haftmann@54228
  2183
    nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
haftmann@54228
  2184
    even_zero_(nat|int) ~> even_zero
wenzelm@57452
  2185
haftmann@54228
  2186
INCOMPATIBILITY.
wenzelm@54055
  2187
haftmann@54489
  2188
* Abolished neg_numeral.
wenzelm@57452
  2189
  - Canonical representation for minus one is "- 1".
wenzelm@57452
  2190
  - Canonical representation for other negative numbers is "- (numeral _)".
wenzelm@57452
  2191
  - When devising rule sets for number calculation, consider the
haftmann@54587
  2192
    following canonical cases: 0, 1, numeral _, - 1, - numeral _.
wenzelm@57452
  2193
  - HOLogic.dest_number also recognizes numerals in non-canonical forms
wenzelm@54893
  2194
    like "numeral One", "- numeral One", "- 0" and even "- ... - _".
wenzelm@57452
  2195
  - Syntax for negative numerals is mere input syntax.
wenzelm@57452
  2196
haftmann@56964
  2197
INCOMPATIBILITY.
haftmann@54489
  2198
wenzelm@57517
  2199
* Reduced name variants for rules on associativity and commutativity:
wenzelm@57517
  2200
wenzelm@57517
  2201
    add_assoc ~> add.assoc
wenzelm@57517
  2202
    add_commute ~> add.commute
wenzelm@57517
  2203
    add_left_commute ~> add.left_commute
wenzelm@57517
  2204
    mult_assoc ~> mult.assoc
wenzelm@57517
  2205
    mult_commute ~> mult.commute
wenzelm@57517
  2206
    mult_left_commute ~> mult.left_commute
wenzelm@57517
  2207
    nat_add_assoc ~> add.assoc
wenzelm@57517
  2208
    nat_add_commute ~> add.commute
wenzelm@57517
  2209
    nat_add_left_commute ~> add.left_commute
wenzelm@57517
  2210
    nat_mult_assoc ~> mult.assoc
wenzelm@57517
  2211
    nat_mult_commute ~> mult.commute
wenzelm@57517
  2212
    eq_assoc ~> iff_assoc
wenzelm@57517
  2213
    eq_left_commute ~> iff_left_commute
wenzelm@57517
  2214
wenzelm@57517
  2215
INCOMPATIBILITY.
wenzelm@57517
  2216
wenzelm@57650
  2217
* Fact collections add_ac and mult_ac are considered old-fashioned.
wenzelm@57637
  2218
Prefer ac_simps instead, or specify rules
wenzelm@57637
  2219
(add|mult).(assoc|commute|left_commute) individually.
wenzelm@57517
  2220
haftmann@54230
  2221
* Elimination of fact duplicates:
haftmann@54230
  2222
    equals_zero_I ~> minus_unique
haftmann@54230
  2223
    diff_eq_0_iff_eq ~> right_minus_eq
traytel@54588
  2224
    nat_infinite ~> infinite_UNIV_nat
traytel@54588
  2225
    int_infinite ~> infinite_UNIV_int
wenzelm@57452
  2226
haftmann@54230
  2227
INCOMPATIBILITY.
haftmann@54230
  2228
haftmann@54230
  2229
* Fact name consolidation:
haftmann@54230
  2230
    diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
haftmann@54250
  2231
    minus_le_self_iff ~> neg_less_eq_nonneg
haftmann@54250
  2232
    le_minus_self_iff ~> less_eq_neg_nonpos
haftmann@54250
  2233
    neg_less_nonneg ~> neg_less_pos
haftmann@54250
  2234
    less_minus_self_iff ~> less_neg_neg [simp]
wenzelm@57452
  2235
haftmann@54230
  2236
INCOMPATIBILITY.
haftmann@54230
  2237
haftmann@54230
  2238
* More simplification rules on unary and binary minus:
haftmann@54230
  2239
add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
haftmann@54230
  2240
add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
haftmann@54230
  2241
add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
haftmann@54230
  2242
le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
wenzelm@57452
  2243
minus_add_cancel, uminus_add_conv_diff.  These correspondingly have
wenzelm@57452
  2244
been taken away from fact collections algebra_simps and field_simps.
wenzelm@57452
  2245
INCOMPATIBILITY.
haftmann@54230
  2246
haftmann@54230
  2247
To restore proofs, the following patterns are helpful:
haftmann@54230
  2248
haftmann@54230
  2249
a) Arbitrary failing proof not involving "diff_def":
haftmann@54230
  2250
Consider simplification with algebra_simps or field_simps.
haftmann@54230
  2251
haftmann@54230
  2252
b) Lifting rules from addition to subtraction:
wenzelm@54893
  2253
Try with "using <rule for addition> of [... "- _" ...]" by simp".
haftmann@54230
  2254
haftmann@54230
  2255
c) Simplification with "diff_def": just drop "diff_def".
haftmann@54230
  2256
Consider simplification with algebra_simps or field_simps;
haftmann@54230
  2257
or the brute way with
haftmann@54230
  2258
"simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
haftmann@54230
  2259
wenzelm@57452
  2260
* Introduce bdd_above and bdd_below in theory
wenzelm@57452
  2261
Conditionally_Complete_Lattices, use them instead of explicitly
wenzelm@57452
  2262
stating boundedness of sets.
wenzelm@57452
  2263
wenzelm@57452
  2264
* ccpo.admissible quantifies only over non-empty chains to allow more
wenzelm@57452
  2265
syntax-directed proof rules; the case of the empty chain shows up as
wenzelm@57452
  2266
additional case in fixpoint induction proofs.  INCOMPATIBILITY.
hoelzl@54264
  2267
hoelzl@56214
  2268
* Removed and renamed theorems in Series:
hoelzl@56214
  2269
  summable_le         ~>  suminf_le
hoelzl@56214
  2270
  suminf_le           ~>  suminf_le_const
hoelzl@56214
  2271
  series_pos_le       ~>  setsum_le_suminf
hoelzl@56214
  2272
  series_pos_less     ~>  setsum_less_suminf
hoelzl@56214
  2273
  suminf_ge_zero      ~>  suminf_nonneg
hoelzl@56214
  2274
  suminf_gt_zero      ~>  suminf_pos
hoelzl@56214
  2275
  suminf_gt_zero_iff  ~>  suminf_pos_iff
hoelzl@56214
  2276
  summable_sumr_LIMSEQ_suminf  ~>  summable_LIMSEQ
hoelzl@56214
  2277
  suminf_0_le         ~>  suminf_nonneg [rotate]
hoelzl@56214
  2278
  pos_summable        ~>  summableI_nonneg_bounded
hoelzl@56214
  2279
  ratio_test          ~>  summable_ratio_test
hoelzl@56214
  2280
hoelzl@56214
  2281
  removed series_zero, replaced by sums_finite
hoelzl@56214
  2282
hoelzl@56214
  2283
  removed auxiliary lemmas:
wenzelm@57452
  2284
hoelzl@56214
  2285
    sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
wenzelm@57452
  2286
    half, le_Suc_ex_iff, lemma_realpow_diff_sumr,
wenzelm@57452
  2287
    real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,
wenzelm@57452
  2288
    sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,
wenzelm@57452
  2289
    summable_convergent_sumr_iff, sumr_diff_mult_const
wenzelm@57452
  2290
hoelzl@56214
  2291
INCOMPATIBILITY.
hoelzl@56214
  2292
hoelzl@56214
  2293
* Replace (F)DERIV syntax by has_derivative:
hoelzl@56214
  2294
  - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
hoelzl@56214
  2295
hoelzl@56214
  2296
  - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
hoelzl@56214
  2297
hoelzl@56214
  2298
  - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
hoelzl@56214
  2299
hoelzl@56214
  2300
  - removed constant isDiff
hoelzl@56214
  2301
wenzelm@57452
  2302
  - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as
wenzelm@57452
  2303
    input syntax.
wenzelm@57452
  2304
wenzelm@57452
  2305
  - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.
hoelzl@56214
  2306
hoelzl@56214
  2307
  - Renamed FDERIV_... lemmas to has_derivative_...
hoelzl@56214
  2308
hoelzl@56381
  2309
  - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
hoelzl@56381
  2310
hoelzl@56381
  2311
  - removed DERIV_intros, has_derivative_eq_intros
hoelzl@56381
  2312
wenzelm@57452
  2313
  - introduced derivative_intros and deriative_eq_intros which
wenzelm@57452
  2314
    includes now rules for DERIV, has_derivative and
wenzelm@57452
  2315
    has_vector_derivative.
hoelzl@56381
  2316
hoelzl@56214
  2317
  - Other renamings:
hoelzl@56214
  2318
    differentiable_def        ~>  real_differentiable_def
hoelzl@56214
  2319
    differentiableE           ~>  real_differentiableE
hoelzl@56214
  2320
    fderiv_def                ~>  has_derivative_at
hoelzl@56214
  2321
    field_fderiv_def          ~>  field_has_derivative_at
hoelzl@56214
  2322
    isDiff_der                ~>  differentiable_def
hoelzl@56214
  2323
    deriv_fderiv              ~>  has_field_derivative_def
hoelzl@56381
  2324
    deriv_def                 ~>  DERIV_def
wenzelm@57452
  2325
wenzelm@57452
  2326
INCOMPATIBILITY.
wenzelm@57452
  2327
wenzelm@57452
  2328
* Include more theorems in continuous_intros. Remove the
wenzelm@57452
  2329
continuous_on_intros, isCont_intros collections, these facts are now
wenzelm@57452
  2330
in continuous_intros.
wenzelm@57452
  2331
wenzelm@57452
  2332
* Theorems about complex numbers are now stated only using Re and Im,
wenzelm@57452
  2333
the Complex constructor is not used anymore. It is possible to use
wenzelm@57452
  2334
primcorec to defined the behaviour of a complex-valued function.
wenzelm@57452
  2335
wenzelm@57452
  2336
Removed theorems about the Complex constructor from the simpset, they
wenzelm@57452
  2337
are available as the lemma collection legacy_Complex_simps. This
wenzelm@57452
  2338
especially removes
wenzelm@57452
  2339
hoelzl@56889
  2340
    i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
hoelzl@56889
  2341
wenzelm@57452
  2342
Instead the reverse direction is supported with
hoelzl@56889
  2343
    Complex_eq: "Complex a b = a + \<i> * b"
hoelzl@56889
  2344
wenzelm@57452
  2345
Moved csqrt from Fundamental_Algebra_Theorem to Complex.
hoelzl@56889
  2346
hoelzl@56889
  2347
  Renamings:
hoelzl@56889
  2348
    Re/Im                  ~>  complex.sel
hoelzl@56889
  2349
    complex_Re/Im_zero     ~>  zero_complex.sel
hoelzl@56889
  2350
    complex_Re/Im_add      ~>  plus_complex.sel
hoelzl@56889
  2351
    complex_Re/Im_minus    ~>  uminus_complex.sel
hoelzl@56889
  2352
    complex_Re/Im_diff     ~>  minus_complex.sel
hoelzl@56889
  2353
    complex_Re/Im_one      ~>  one_complex.sel
hoelzl@56889
  2354
    complex_Re/Im_mult     ~>  times_complex.sel
hoelzl@56889
  2355
    complex_Re/Im_inverse  ~>  inverse_complex.sel
hoelzl@56889
  2356
    complex_Re/Im_scaleR   ~>  scaleR_complex.sel
hoelzl@56889
  2357
    complex_Re/Im_i        ~>  ii.sel
hoelzl@56889
  2358
    complex_Re/Im_cnj      ~>  cnj.sel
hoelzl@56889
  2359
    Re/Im_cis              ~>  cis.sel
hoelzl@56889
  2360
hoelzl@56889
  2361
    complex_divide_def   ~>  divide_complex_def
hoelzl@56889
  2362
    complex_norm_def     ~>  norm_complex_def
hoelzl@56889
  2363
    cmod_def             ~>  norm_complex_de
hoelzl@56889
  2364
hoelzl@56889
  2365
  Removed theorems:
hoelzl@56889
  2366
    complex_zero_def
hoelzl@56889
  2367
    complex_add_def
hoelzl@56889
  2368
    complex_minus_def
hoelzl@56889
  2369
    complex_diff_def
hoelzl@56889
  2370
    complex_one_def
hoelzl@56889
  2371
    complex_mult_def
hoelzl@56889
  2372
    complex_inverse_def
hoelzl@56889
  2373
    complex_scaleR_def
hoelzl@56889
  2374
wenzelm@57452
  2375
INCOMPATIBILITY.
wenzelm@57452
  2376
wenzelm@57504
  2377
* Theory Lubs moved HOL image to HOL-Library. It is replaced by
wenzelm@57504
  2378
Conditionally_Complete_Lattices.  INCOMPATIBILITY.
wenzelm@57504
  2379
wenzelm@57504
  2380
* HOL-Library: new theory src/HOL/Library/Tree.thy.
wenzelm@57504
  2381
wenzelm@57504
  2382
* HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it
wenzelm@57504
  2383
is subsumed by session Kleene_Algebra in AFP.
wenzelm@57504
  2384
wenzelm@57856
  2385
* HOL-Library / theory RBT: various constants and facts are hidden;
wenzelm@57856
  2386
lifting setup is unregistered.  INCOMPATIBILITY.
kuncar@57826
  2387
wenzelm@57504
  2388
* HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
wenzelm@57504
  2389
wenzelm@57504
  2390
* HOL-Word: bit representations prefer type bool over type bit.
wenzelm@57504
  2391
INCOMPATIBILITY.
wenzelm@57504
  2392
wenzelm@57504
  2393
* HOL-Word:
wenzelm@57504
  2394
  - Abandoned fact collection "word_arith_alts", which is a duplicate
wenzelm@57504
  2395
    of "word_arith_wis".
wenzelm@57504
  2396
  - Dropped first (duplicated) element in fact collections
wenzelm@57504
  2397
    "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
wenzelm@57504
  2398
    "uint_word_arith_bintrs".
wenzelm@57504
  2399
wenzelm@57504
  2400
* HOL-Number_Theory:
wenzelm@57504
  2401
  - consolidated the proofs of the binomial theorem
wenzelm@57504
  2402
  - the function fib is again of type nat => nat and not overloaded
wenzelm@57504
  2403
  - no more references to Old_Number_Theory in the HOL libraries
wenzelm@57504
  2404
    (except the AFP)
wenzelm@57504
  2405
wenzelm@57504
  2406
INCOMPATIBILITY.
wenzelm@57504
  2407
immler@54787
  2408
* HOL-Multivariate_Analysis:
wenzelm@57452
  2409
  - Type class ordered_real_vector for ordered vector spaces.
wenzelm@57452
  2410
  - New theory Complex_Basic_Analysis defining complex derivatives,
lp15@57253
  2411
    holomorphic functions, etc., ported from HOL Light's canal.ml.
wenzelm@57452
  2412
  - Changed order of ordered_euclidean_space to be compatible with
immler@54787
  2413
    pointwise ordering on products. Therefore instance of
immler@54787
  2414
    conditionally_complete_lattice and ordered_real_vector.
immler@54787
  2415
    INCOMPATIBILITY: use box instead of greaterThanLessThan or
wenzelm@57452
  2416
    explicit set-comprehensions with eucl_less for other (half-)open
immler@54787
  2417
    intervals.
immler@57476
  2418
  - removed dependencies on type class ordered_euclidean_space with
immler@57476
  2419
    introduction of "cbox" on euclidean_space
immler@57476
  2420
    - renamed theorems:
immler@57476
  2421
        interval ~> box
immler@57476
  2422
        mem_interval ~> mem_box
immler@57476
  2423
        interval_eq_empty ~> box_eq_empty
immler@57476
  2424
        interval_ne_empty ~> box_ne_empty
immler@57476
  2425
        interval_sing(1) ~> cbox_sing
immler@57476
  2426
        interval_sing(2) ~> box_sing
immler@57476
  2427
        subset_interval_imp ~> subset_box_imp
immler@57476
  2428
        subset_interval ~> subset_box
immler@57476
  2429
        open_interval ~> open_box
immler@57476
  2430
        closed_interval ~> closed_cbox
immler@57476
  2431
        interior_closed_interval ~> interior_cbox
immler@57476
  2432
        bounded_closed_interval ~> bounded_cbox
immler@57476
  2433
        compact_interval ~> compact_cbox
immler@57476
  2434
        bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric
immler@57476
  2435
        bounded_subset_closed_interval ~> bounded_subset_cbox
immler@57476
  2436
        mem_interval_componentwiseI ~> mem_box_componentwiseI
immler@57476
  2437
        convex_box ~> convex_prod
immler@57476
  2438
        rel_interior_real_interval ~> rel_interior_real_box
immler@57476
  2439
        convex_interval ~> convex_box
immler@57476
  2440
        convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox
immler@57476
  2441
        frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox
immler@57476
  2442
        content_closed_interval' ~> content_cbox'
immler@57476
  2443
        elementary_subset_interval ~> elementary_subset_box
immler@57476
  2444
        diameter_closed_interval ~> diameter_cbox
immler@57476
  2445
        frontier_closed_interval ~> frontier_cbox
immler@57476
  2446
        frontier_open_interval ~> frontier_box
immler@57476
  2447
        bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric
immler@57476
  2448
        closure_open_interval ~> closure_box
immler@57476
  2449
        open_closed_interval_convex ~> open_cbox_convex
immler@57476
  2450
        open_interval_midpoint ~> box_midpoint
immler@57476
  2451
        content_image_affinity_interval ~> content_image_affinity_cbox
immler@57476
  2452
        is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval
immler@57476
  2453
        bounded_interval ~> bounded_closed_interval + bounded_boxes
immler@57476
  2454
immler@57476
  2455
    - respective theorems for intervals over the reals:
immler@57476
  2456
        content_closed_interval + content_cbox
immler@57476
  2457
        has_integral + has_integral_real
immler@57476
  2458
        fine_division_exists + fine_division_exists_real
immler@57476
  2459
        has_integral_null + has_integral_null_real
immler@57476
  2460
        tagged_division_union_interval + tagged_division_union_interval_real
immler@57476
  2461
        has_integral_const + has_integral_const_real
immler@57476
  2462
        integral_const + integral_const_real
immler@57476
  2463
        has_integral_bound + has_integral_bound_real
immler@57476
  2464
        integrable_continuous + integrable_continuous_real
immler@57476
  2465
        integrable_subinterval + integrable_subinterval_real
immler@57476
  2466
        has_integral_reflect_lemma + has_integral_reflect_lemma_real
immler@57476
  2467
        integrable_reflect + integrable_reflect_real
immler@57476
  2468
        integral_reflect + integral_reflect_real
immler@57476
  2469
        image_affinity_interval + image_affinity_cbox
immler@57476
  2470
        image_smult_interval + image_smult_cbox
immler@57476
  2471
        integrable_const + integrable_const_ivl
immler@57476
  2472
        integrable_on_subinterval + integrable_on_subcbox
immler@57476
  2473
hoelzl@56369
  2474
  - renamed theorems:
hoelzl@56369
  2475
    derivative_linear         ~>  has_derivative_bounded_linear
hoelzl@56369
  2476
    derivative_is_linear      ~>  has_derivative_linear
hoelzl@56369
  2477
    bounded_linear_imp_linear ~>  bounded_linear.linear
hoelzl@56369
  2478
hoelzl@56993
  2479
* HOL-Probability:
hoelzl@57825
  2480
  - Renamed positive_integral to nn_integral:
hoelzl@57825
  2481
hoelzl@57825
  2482
    . Renamed all lemmas "*positive_integral*" to *nn_integral*"
hoelzl@57825
  2483
      positive_integral_positive ~> nn_integral_nonneg
hoelzl@57825
  2484
hoelzl@57825
  2485
    . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
hoelzl@57825
  2486
wenzelm@57452
  2487
  - replaced the Lebesgue integral on real numbers by the more general
wenzelm@57452
  2488
    Bochner integral for functions into a real-normed vector space.
hoelzl@56993
  2489
hoelzl@56993
  2490
    integral_zero               ~>  integral_zero / integrable_zero
hoelzl@56993
  2491
    integral_minus              ~>  integral_minus / integrable_minus
hoelzl@56993
  2492
    integral_add                ~>  integral_add / integrable_add
hoelzl@56993
  2493
    integral_diff               ~>  integral_diff / integrable_diff
hoelzl@56993
  2494
    integral_setsum             ~>  integral_setsum / integrable_setsum
hoelzl@56993
  2495
    integral_multc              ~>  integral_mult_left / integrable_mult_left
hoelzl@56993
  2496
    integral_cmult              ~>  integral_mult_right / integrable_mult_right
hoelzl@56993
  2497
    integral_triangle_inequality~>  integral_norm_bound
hoelzl@56993
  2498
    integrable_nonneg           ~>  integrableI_nonneg
hoelzl@56993
  2499
    integral_positive           ~>  integral_nonneg_AE
hoelzl@56993
  2500
    integrable_abs_iff          ~>  integrable_abs_cancel
hoelzl@57825
  2501
    positive_integral_lim_INF   ~>  nn_integral_liminf
hoelzl@56993
  2502
    lebesgue_real_affine        ~>  lborel_real_affine
hoelzl@56993
  2503
    borel_integral_has_integral ~>  has_integral_lebesgue_integral
hoelzl@56993
  2504
    integral_indicator          ~>
hoelzl@56993
  2505
         integral_real_indicator / integrable_real_indicator
hoelzl@57825
  2506
    positive_integral_fst       ~>  nn_integral_fst'
hoelzl@57825
  2507
    positive_integral_fst_measurable ~> nn_integral_fst
hoelzl@57825
  2508
    positive_integral_snd_measurable ~> nn_integral_snd
hoelzl@56993
  2509
hoelzl@56993
  2510
    integrable_fst_measurable   ~>
hoelzl@56993
  2511
         integral_fst / integrable_fst / AE_integrable_fst
hoelzl@56993
  2512
hoelzl@56993
  2513
    integrable_snd_measurable   ~>
hoelzl@56993
  2514
         integral_snd / integrable_snd / AE_integrable_snd
hoelzl@56993
  2515
hoelzl@56993
  2516
    integral_monotone_convergence  ~>
hoelzl@56993
  2517
         integral_monotone_convergence / integrable_monotone_convergence
hoelzl@56993
  2518
hoelzl@56993
  2519
    integral_monotone_convergence_at_top  ~>
hoelzl@56993
  2520
         integral_monotone_convergence_at_top /
hoelzl@56993
  2521
         integrable_monotone_convergence_at_top
hoelzl@56993
  2522
hoelzl@56993
  2523
    has_integral_iff_positive_integral_lebesgue  ~>
hoelzl@56993
  2524
         has_integral_iff_has_bochner_integral_lebesgue_nonneg
hoelzl@56993
  2525
hoelzl@56993
  2526
    lebesgue_integral_has_integral  ~>
hoelzl@56993
  2527
         has_integral_integrable_lebesgue_nonneg
hoelzl@56993
  2528
hoelzl@56993
  2529
    positive_integral_lebesgue_has_integral  ~>
hoelzl@56993
  2530
         integral_has_integral_lebesgue_nonneg /
hoelzl@56993
  2531
         integrable_has_integral_lebesgue_nonneg
hoelzl@56993
  2532
hoelzl@56993
  2533
    lebesgue_integral_real_affine  ~>
hoelzl@57825
  2534
         nn_integral_real_affine
hoelzl@56993
  2535
hoelzl@56993
  2536
    has_integral_iff_positive_integral_lborel  ~>
hoelzl@56993
  2537
         integral_has_integral_nonneg / integrable_has_integral_nonneg
hoelzl@56993
  2538
hoelzl@56993
  2539
    The following theorems where removed:
hoelzl@56993
  2540
hoelzl@56993
  2541
    lebesgue_integral_nonneg
hoelzl@56993
  2542
    lebesgue_integral_uminus
hoelzl@56993
  2543
    lebesgue_integral_cmult
hoelzl@56993
  2544
    lebesgue_integral_multc
hoelzl@56993
  2545
    lebesgue_integral_cmult_nonneg
hoelzl@56993
  2546
    integral_cmul_indicator
hoelzl@56993
  2547
    integral_real
wenzelm@54672
  2548
wenzelm@57452
  2549
  - Formalized properties about exponentially, Erlang, and normal
wenzelm@57452
  2550
    distributed random variables.
wenzelm@57452
  2551
wenzelm@57504
  2552
* HOL-Decision_Procs: Separate command 'approximate' for approximative
wenzelm@57504
  2553
computation in src/HOL/Decision_Procs/Approximation.  Minor
wenzelm@57504
  2554
INCOMPATIBILITY.
wenzelm@57452
  2555
nipkow@57112
  2556
wenzelm@55622
  2557
*** Scala ***
wenzelm@55622
  2558
wenzelm@55622
  2559
* The signature and semantics of Document.Snapshot.cumulate_markup /
wenzelm@55622
  2560
select_markup have been clarified.  Markup is now traversed in the
wenzelm@55622
  2561
order of reports given by the prover: later markup is usually more
wenzelm@55622
  2562
specific and may override results accumulated so far.  The elements
wenzelm@55622
  2563
guard is mandatory and checked precisely.  Subtle INCOMPATIBILITY.
wenzelm@55622
  2564
wenzelm@57452
  2565
* Substantial reworking of internal PIDE protocol communication
wenzelm@57452
  2566
channels.  INCOMPATIBILITY.
wenzelm@57452
  2567
wenzelm@55622
  2568
wenzelm@54449
  2569
*** ML ***
wenzelm@54449
  2570
wenzelm@57504
  2571
* Subtle change of semantics of Thm.eq_thm: theory stamps are not
wenzelm@57504
  2572
compared (according to Thm.thm_ord), but assumed to be covered by the
wenzelm@57504
  2573
current background theory.  Thus equivalent data produced in different
wenzelm@57504
  2574
branches of the theory graph usually coincides (e.g. relevant for
wenzelm@57504
  2575
theory merge).  Note that the softer Thm.eq_thm_prop is often more
wenzelm@57504
  2576
appropriate than Thm.eq_thm.
wenzelm@57504
  2577
wenzelm@57504
  2578
* Proper context for basic Simplifier operations: rewrite_rule,
wenzelm@57504
  2579
rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
wenzelm@57504
  2580
pass runtime Proof.context (and ensure that the simplified entity
wenzelm@57504
  2581
actually belongs to it).
wenzelm@57504
  2582
wenzelm@57504
  2583
* Proper context discipline for read_instantiate and instantiate_tac:
wenzelm@57504
  2584
variables that are meant to become schematic need to be given as
wenzelm@57504
  2585
fixed, and are generalized by the explicit context of local variables.
wenzelm@57504
  2586
This corresponds to Isar attributes "where" and "of" with 'for'
wenzelm@57504
  2587
declaration.  INCOMPATIBILITY, also due to potential change of indices
wenzelm@57504
  2588
of schematic variables.
wenzelm@57504
  2589
wenzelm@56303
  2590
* Moved ML_Compiler.exn_trace and other operations on exceptions to
wenzelm@56303
  2591
structure Runtime.  Minor INCOMPATIBILITY.
wenzelm@56303
  2592
wenzelm@56279
  2593
* Discontinued old Toplevel.debug in favour of system option
wenzelm@57452
  2594
"ML_exception_trace", which may be also declared within the context
wenzelm@57452
  2595
via "declare [[ML_exception_trace = true]]".  Minor INCOMPATIBILITY.
wenzelm@56279
  2596
wenzelm@56281
  2597
* Renamed configuration option "ML_trace" to "ML_source_trace". Minor
wenzelm@56281
  2598
INCOMPATIBILITY.
wenzelm@56281
  2599
wenzelm@56281
  2600
* Configuration option "ML_print_depth" controls the pretty-printing
wenzelm@56281
  2601
depth of the ML compiler within the context.  The old print_depth in
wenzelm@56285
  2602
ML is still available as default_print_depth, but rarely used.  Minor
wenzelm@56285
  2603
INCOMPATIBILITY.
wenzelm@56279
  2604
wenzelm@54449
  2605
* Toplevel function "use" refers to raw ML bootstrap environment,
wenzelm@54449
  2606
without Isar context nor antiquotations.  Potential INCOMPATIBILITY.
wenzelm@54449
  2607
Note that 'ML_file' is the canonical command to load ML files into the
wenzelm@54449
  2608
formal context.
wenzelm@54449
  2609
wenzelm@56205
  2610
* Simplified programming interface to define ML antiquotations, see
wenzelm@56205
  2611
structure ML_Antiquotation.  Minor INCOMPATIBILITY.
wenzelm@56069
  2612
wenzelm@56071
  2613
* ML antiquotation @{here} refers to its source position, which is
wenzelm@56071
  2614
occasionally useful for experimentation and diagnostic purposes.
wenzelm@56071
  2615
wenzelm@56135
  2616
* ML antiquotation @{path} produces a Path.T value, similarly to
wenzelm@56135
  2617
Path.explode, but with compile-time check against the file-system and
wenzelm@56135
  2618
some PIDE markup.  Note that unlike theory source, ML does not have a
wenzelm@56135
  2619
well-defined master directory, so an absolute symbolic path
wenzelm@56135
  2620
specification is usually required, e.g. "~~/src/HOL".
wenzelm@56135
  2621
wenzelm@56399
  2622
* ML antiquotation @{print} inlines a function to print an arbitrary
wenzelm@56399
  2623
ML value, which is occasionally useful for diagnostic or demonstration
wenzelm@56399
  2624
purposes.
wenzelm@56399
  2625
wenzelm@54449
  2626
wenzelm@54683
  2627
*** System ***
wenzelm@54683
  2628
wenzelm@57443
  2629
* Proof General with its traditional helper scripts is now an optional
wenzelm@57504
  2630
Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle
wenzelm@57504
  2631
component repository http://isabelle.in.tum.de/components/.  Note that
wenzelm@57504
  2632
the "system" manual provides general explanations about add-on
wenzelm@57504
  2633
components, especially those that are not bundled with the release.
wenzelm@57443
  2634
wenzelm@56439
  2635
* The raw Isabelle process executable has been renamed from
wenzelm@56439
  2636
"isabelle-process" to "isabelle_process", which conforms to common
wenzelm@56439
  2637
shell naming conventions, and allows to define a shell function within
wenzelm@56439
  2638
the Isabelle environment to avoid dynamic path lookup.  Rare
wenzelm@57504
  2639
incompatibility for old tools that do not use the ISABELLE_PROCESS
wenzelm@57504
  2640
settings variable.
wenzelm@56439
  2641
wenzelm@57439
  2642
* Former "isabelle tty" has been superseded by "isabelle console",
wenzelm@57439
  2643
with implicit build like "isabelle jedit", and without the mostly
wenzelm@57439
  2644
obsolete Isar TTY loop.
wenzelm@57439
  2645
wenzelm@57452
  2646
* Simplified "isabelle display" tool.  Settings variables DVI_VIEWER
wenzelm@57452
  2647
and PDF_VIEWER now refer to the actual programs, not shell
wenzelm@57452
  2648
command-lines.  Discontinued option -c: invocation may be asynchronous
wenzelm@57452
  2649
via desktop environment, without any special precautions.  Potential
wenzelm@57452
  2650
INCOMPATIBILITY with ambitious private settings.
wenzelm@57452
  2651
wenzelm@57413
  2652
* Removed obsolete "isabelle unsymbolize".  Note that the usual format
wenzelm@57413
  2653
for email communication is the Unicode rendering of Isabelle symbols,
wenzelm@57413
  2654
as produced by Isabelle/jEdit, for example.
wenzelm@57413
  2655
wenzelm@57452
  2656
* Removed obsolete tool "wwwfind". Similar functionality may be
wenzelm@57452
  2657
integrated into Isabelle/jEdit eventually.
wenzelm@57452
  2658
wenzelm@57452
  2659
* Improved 'display_drafts' concerning desktop integration and
wenzelm@57452
  2660
repeated invocation in PIDE front-end: re-use single file
wenzelm@57452
  2661
$ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
wenzelm@57084
  2662
wenzelm@57452
  2663
* Session ROOT specifications require explicit 'document_files' for
wenzelm@57452
  2664
robust dependencies on LaTeX sources.  Only these explicitly given
wenzelm@57452
  2665
files are copied to the document output directory, before document
wenzelm@57452
  2666
processing is started.
wenzelm@57452
  2667
wenzelm@57504
  2668
* Windows: support for regular TeX installation (e.g. MiKTeX) instead
wenzelm@57504
  2669
of TeX Live from Cygwin.
wenzelm@57504
  2670
wenzelm@57084
  2671
wenzelm@57693
  2672
wenzelm@54639
  2673
New in Isabelle2013-2 (December 2013)
wenzelm@54639
  2674
-------------------------------------
wenzelm@54639
  2675
wenzelm@54639
  2676
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@54639
  2677
wenzelm@54639
  2678
* More robust editing of running commands with internal forks,
wenzelm@54639
  2679
e.g. non-terminating 'by' steps.
wenzelm@54639
  2680
wenzelm@54641
  2681
* More relaxed Sledgehammer panel: avoid repeated application of query
wenzelm@54641
  2682
after edits surrounding the command location.
wenzelm@54641
  2683
wenzelm@54648
  2684
* More status information about commands that are interrupted
wenzelm@54648
  2685
accidentally (via physical event or Poly/ML runtime system signal,
wenzelm@54648
  2686
e.g. out-of-memory).
wenzelm@54648
  2687
wenzelm@54653
  2688
wenzelm@54653
  2689
*** System ***
wenzelm@54653
  2690
wenzelm@54653
  2691
* More robust termination of external processes managed by
wenzelm@54664
  2692
Isabelle/ML: support cancellation of tasks within the range of
wenzelm@54664
  2693
milliseconds, as required for PIDE document editing with automatically
wenzelm@54664
  2694
tried tools (e.g. Sledgehammer).
wenzelm@54653
  2695
wenzelm@54648
  2696
* Reactivated Isabelle/Scala kill command for external processes on
wenzelm@54648
  2697
Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
wenzelm@54648
  2698
workaround for some Debian/Ubuntu Linux versions from 2013.
wenzelm@54648
  2699
wenzelm@54639
  2700
wenzelm@54639
  2701
wenzelm@53971
  2702
New in Isabelle2013-1 (November 2013)
wenzelm@53971
  2703
-------------------------------------
wenzelm@50994
  2704
wenzelm@51293
  2705
*** General ***
wenzelm@51293
  2706
wenzelm@53971
  2707
* Discontinued obsolete 'uses' within theory header.  Note that
wenzelm@53971
  2708
commands like 'ML_file' work without separate declaration of file
wenzelm@53971
  2709
dependencies.  Minor INCOMPATIBILITY.
wenzelm@53971
  2710
wenzelm@53971
  2711
* Discontinued redundant 'use' command, which was superseded by