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