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