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