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