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