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