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