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