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