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