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