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