NEWS
author blanchet
Wed Jan 20 17:14:53 2016 +0100 (2016-01-20)
changeset 62208 ad43b3ab06e4
parent 62205 ca68dc26fbb6
child 62209 009c6e0b44bb
permissions -rw-r--r--
added 'supset' variants for new '<#' etc. symbols on multisets
wenzelm@57491
     1
Isabelle NEWS -- history of user-relevant changes
wenzelm@57491
     2
=================================================
wenzelm@2553
     3
wenzelm@62114
     4
(Note: Isabelle/jEdit shows a tree-view of the NEWS file in Sidekick.)
wenzelm@60006
     5
wenzelm@60331
     6
wenzelm@62031
     7
New in Isabelle2016 (February 2016)
wenzelm@62016
     8
-----------------------------------
wenzelm@60138
     9
wenzelm@61337
    10
*** General ***
wenzelm@61337
    11
wenzelm@62168
    12
* Eisbach is now based on Pure instead of HOL. Objects-logics may import
wenzelm@62168
    13
either the theory ~~/src/HOL/Eisbach/Eisbach (for HOL etc.) or
wenzelm@62168
    14
~~/src/HOL/Eisbach/Eisbach_Old_Appl_Syntax (for FOL, ZF etc.). Note that
wenzelm@62168
    15
the HOL-Eisbach session located in ~~/src/HOL/Eisbach/ contains further
wenzelm@62168
    16
examples that do require HOL.
wenzelm@62168
    17
wenzelm@62157
    18
* Better resource usage on all platforms (Linux, Windows, Mac OS X) for
wenzelm@62157
    19
both Isabelle/ML and Isabelle/Scala.  Slightly reduced heap space usage.
wenzelm@62157
    20
wenzelm@62017
    21
* Former "xsymbols" syntax with Isabelle symbols is used by default,
wenzelm@62017
    22
without any special print mode. Important ASCII replacement syntax
wenzelm@62017
    23
remains available under print mode "ASCII", but less important syntax
wenzelm@62017
    24
has been removed (see below).
wenzelm@62017
    25
wenzelm@62109
    26
* Support for more arrow symbols, with rendering in LaTeX and Isabelle
wenzelm@62109
    27
fonts: \<Lleftarrow> \<Rrightarrow> \<longlongleftarrow> \<longlongrightarrow> \<longlonglongleftarrow> \<longlonglongrightarrow>.
wenzelm@62017
    28
wenzelm@62108
    29
* Special notation \<struct> for the first implicit 'structure' in the
wenzelm@62108
    30
context has been discontinued. Rare INCOMPATIBILITY, use explicit
wenzelm@62108
    31
structure name instead, notably in indexed notation with block-subscript
wenzelm@62108
    32
(e.g. \<odot>\<^bsub>A\<^esub>).
wenzelm@62108
    33
wenzelm@62108
    34
* The glyph for \<diamond> in the IsabelleText font now corresponds better to its
wenzelm@62108
    35
counterpart \<box> as quantifier-like symbol. A small diamond is available as
wenzelm@62108
    36
\<diamondop>; the old symbol \<struct> loses this rendering and any special
wenzelm@62108
    37
meaning.
wenzelm@62108
    38
wenzelm@62017
    39
* Syntax for formal comments "-- text" now also supports the symbolic
wenzelm@62017
    40
form "\<comment> text". Command-line tool "isabelle update_cartouches -c" helps
wenzelm@62017
    41
to update old sources.
wenzelm@62017
    42
wenzelm@61337
    43
* Toplevel theorem statements have been simplified as follows:
wenzelm@61337
    44
wenzelm@61337
    45
  theorems             ~>  lemmas
wenzelm@61337
    46
  schematic_lemma      ~>  schematic_goal
wenzelm@61337
    47
  schematic_theorem    ~>  schematic_goal
wenzelm@61337
    48
  schematic_corollary  ~>  schematic_goal
wenzelm@61337
    49
wenzelm@61337
    50
Command-line tool "isabelle update_theorems" updates theory sources
wenzelm@61337
    51
accordingly.
wenzelm@61337
    52
wenzelm@61338
    53
* Toplevel theorem statement 'proposition' is another alias for
wenzelm@61338
    54
'theorem'.
wenzelm@61338
    55
wenzelm@62169
    56
* The old 'defs' command has been removed (legacy since Isabelle2014).
wenzelm@62169
    57
INCOMPATIBILITY, use regular 'definition' instead. Overloaded and/or
wenzelm@62169
    58
deferred definitions require a surrounding 'overloading' block.
wenzelm@62169
    59
wenzelm@61337
    60
wenzelm@60610
    61
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@60610
    62
wenzelm@60986
    63
* IDE support for the source-level debugger of Poly/ML, to work with
wenzelm@60984
    64
Isabelle/ML and official Standard ML. Configuration option "ML_debugger"
wenzelm@60984
    65
and commands 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',
wenzelm@60984
    66
'SML_file_no_debug' control compilation of sources with debugging
wenzelm@60984
    67
information. The Debugger panel allows to set breakpoints (via context
wenzelm@60984
    68
menu), step through stopped threads, evaluate local ML expressions etc.
wenzelm@60984
    69
At least one Debugger view needs to be active to have any effect on the
wenzelm@60984
    70
running ML program.
wenzelm@60984
    71
wenzelm@61803
    72
* The State panel manages explicit proof state output, with dynamic
wenzelm@61803
    73
auto-update according to cursor movement. Alternatively, the jEdit
wenzelm@61803
    74
action "isabelle.update-state" (shortcut S+ENTER) triggers manual
wenzelm@61803
    75
update.
wenzelm@61729
    76
wenzelm@61729
    77
* The Output panel no longer shows proof state output by default, to
wenzelm@61729
    78
avoid GUI overcrowding. INCOMPATIBILITY, use the State panel instead or
wenzelm@61729
    79
enable option "editor_output_state".
wenzelm@61215
    80
wenzelm@61803
    81
* The text overview column (status of errors, warnings etc.) is updated
wenzelm@61803
    82
asynchronously, leading to much better editor reactivity. Moreover, the
wenzelm@61803
    83
full document node content is taken into account. The width of the
wenzelm@61803
    84
column is scaled according to the main text area font, for improved
wenzelm@61803
    85
visibility.
wenzelm@61803
    86
wenzelm@61803
    87
* The main text area no longer changes its color hue in outdated
wenzelm@61803
    88
situations. The text overview column takes over the role to indicate
wenzelm@61803
    89
unfinished edits in the PIDE pipeline. This avoids flashing text display
wenzelm@61803
    90
due to ad-hoc updates by auxiliary GUI components, such as the State
wenzelm@61803
    91
panel.
wenzelm@61803
    92
wenzelm@62017
    93
* Improved scheduling for urgent print tasks (e.g. command state output,
wenzelm@62017
    94
interactive queries) wrt. long-running background tasks.
wenzelm@62017
    95
wenzelm@62017
    96
* Completion of symbols via prefix of \<name> or \<^name> or \name is
wenzelm@62017
    97
always possible, independently of the language context. It is never
wenzelm@62017
    98
implicit: a popup will show up unconditionally.
wenzelm@62017
    99
wenzelm@62017
   100
* Additional abbreviations for syntactic completion may be specified in
wenzelm@62017
   101
$ISABELLE_HOME/etc/abbrevs and $ISABELLE_HOME_USER/etc/abbrevs, with
wenzelm@62017
   102
support for simple templates using ASCII 007 (bell) as placeholder.
wenzelm@62017
   103
wenzelm@61483
   104
* Action "isabelle-emph" (with keyboard shortcut C+e LEFT) controls
wenzelm@61483
   105
emphasized text style; the effect is visible in document output, not in
wenzelm@61483
   106
the editor.
wenzelm@61483
   107
wenzelm@61483
   108
* Action "isabelle-reset" now uses keyboard shortcut C+e BACK_SPACE,
wenzelm@61483
   109
instead of former C+e LEFT.
wenzelm@61483
   110
wenzelm@61512
   111
* The command-line tool "isabelle jedit" and the isabelle.Main
wenzelm@62027
   112
application wrapper treat the default $USER_HOME/Scratch.thy more
wenzelm@61512
   113
uniformly, and allow the dummy file argument ":" to open an empty buffer
wenzelm@61512
   114
instead.
wenzelm@61512
   115
wenzelm@62017
   116
* New command-line tool "isabelle jedit_client" allows to connect to an
wenzelm@62017
   117
already running Isabelle/jEdit process. This achieves the effect of
wenzelm@62017
   118
single-instance applications seen on common GUI desktops.
wenzelm@62017
   119
wenzelm@61529
   120
* The default look-and-feel for Linux is the traditional "Metal", which
wenzelm@61529
   121
works better with GUI scaling for very high-resolution displays (e.g.
wenzelm@61529
   122
4K). Moreover, it is generally more robust than "Nimbus".
wenzelm@61529
   123
wenzelm@62163
   124
* Update to jedit-5.3.0, with improved GUI scaling and support of
wenzelm@62163
   125
high-resolution displays (e.g. 4K).
wenzelm@62163
   126
wenzelm@62034
   127
* The main Isabelle executable is managed as single-instance Desktop
wenzelm@62034
   128
application uniformly on all platforms: Linux, Windows, Mac OS X.
wenzelm@62034
   129
wenzelm@60610
   130
wenzelm@61405
   131
*** Document preparation ***
wenzelm@61405
   132
wenzelm@62017
   133
* Commands 'paragraph' and 'subparagraph' provide additional section
wenzelm@62017
   134
headings. Thus there are 6 levels of standard headings, as in HTML.
wenzelm@62017
   135
wenzelm@62017
   136
* Command 'text_raw' has been clarified: input text is processed as in
wenzelm@62017
   137
'text' (with antiquotations and control symbols). The key difference is
wenzelm@62017
   138
the lack of the surrounding isabelle markup environment in output.
wenzelm@62017
   139
wenzelm@62017
   140
* Text is structured in paragraphs and nested lists, using notation that
wenzelm@62017
   141
is similar to Markdown. The control symbols for list items are as
wenzelm@62017
   142
follows:
wenzelm@62017
   143
wenzelm@62017
   144
  \<^item>  itemize
wenzelm@62017
   145
  \<^enum>  enumerate
wenzelm@62017
   146
  \<^descr>  description
wenzelm@62017
   147
wenzelm@61491
   148
* There is a new short form for antiquotations with a single argument
wenzelm@61491
   149
that is a cartouche: \<^name>\<open>...\<close> is equivalent to @{name \<open>...\<close>} and
wenzelm@61595
   150
\<open>...\<close> without control symbol is equivalent to @{cartouche \<open>...\<close>}.
wenzelm@61595
   151
\<^name> without following cartouche is equivalent to @{name}. The
wenzelm@61501
   152
standard Isabelle fonts provide glyphs to render important control
wenzelm@61501
   153
symbols, e.g. "\<^verbatim>", "\<^emph>", "\<^bold>".
wenzelm@61491
   154
wenzelm@61595
   155
* Antiquotations @{noindent}, @{smallskip}, @{medskip}, @{bigskip} with
wenzelm@61595
   156
corresponding control symbols \<^noindent>, \<^smallskip>, \<^medskip>, \<^bigskip> specify spacing formally, using
wenzelm@61595
   157
standard LaTeX macros of the same names.
wenzelm@61595
   158
wenzelm@61491
   159
* Antiquotation @{cartouche} in Isabelle/Pure is the same as @{text}.
wenzelm@61491
   160
Consequently, \<open>...\<close> without any decoration prints literal quasi-formal
wenzelm@61492
   161
text. Command-line tool "isabelle update_cartouches -t" helps to update
wenzelm@61492
   162
old sources, by approximative patching of the content of string and
wenzelm@61492
   163
cartouche tokens seen in theory sources.
wenzelm@61491
   164
wenzelm@61491
   165
* The @{text} antiquotation now ignores the antiquotation option
wenzelm@61491
   166
"source". The given text content is output unconditionally, without any
wenzelm@61491
   167
surrounding quotes etc. Subtle INCOMPATIBILITY, put quotes into the
wenzelm@61494
   168
argument where they are really intended, e.g. @{text \<open>"foo"\<close>}. Initial
wenzelm@61494
   169
or terminal spaces are ignored.
wenzelm@61491
   170
wenzelm@62017
   171
* Antiquotations @{emph} and @{bold} output LaTeX source recursively,
wenzelm@62017
   172
adding appropriate text style markup. These may be used in the short
wenzelm@62017
   173
form \<^emph>\<open>...\<close> and \<^bold>\<open>...\<close>.
wenzelm@62017
   174
wenzelm@62017
   175
* Document antiquotation @{footnote} outputs LaTeX source recursively,
wenzelm@62017
   176
marked as \footnote{}. This may be used in the short form \<^footnote>\<open>...\<close>.
wenzelm@62017
   177
wenzelm@62017
   178
* Antiquotation @{verbatim [display]} supports option "indent".
wenzelm@62017
   179
wenzelm@62017
   180
* Antiquotation @{theory_text} prints uninterpreted theory source text
wenzelm@62017
   181
(outer syntax with command keywords etc.). This may be used in the short
wenzelm@62017
   182
form \<^theory_text>\<open>...\<close>. @{theory_text [display]} supports option "indent".
wenzelm@62017
   183
wenzelm@62017
   184
* Antiquotation @{doc ENTRY} provides a reference to the given
wenzelm@62017
   185
documentation, with a hyperlink in the Prover IDE.
wenzelm@62017
   186
wenzelm@62017
   187
* Antiquotations @{command}, @{method}, @{attribute} print checked
wenzelm@62017
   188
entities of the Isar language.
wenzelm@62017
   189
wenzelm@61471
   190
* HTML presentation uses the standard IsabelleText font and Unicode
wenzelm@61471
   191
rendering of Isabelle symbols like Isabelle/Scala/jEdit.  The former
wenzelm@61488
   192
print mode "HTML" loses its special meaning.
wenzelm@61471
   193
wenzelm@61405
   194
wenzelm@60406
   195
*** Isar ***
wenzelm@60406
   196
wenzelm@62205
   197
* Local goals ('have', 'show', 'hence', 'thus') allow structured rule
wenzelm@62205
   198
statements like fixes/assumes/shows in theorem specifications, but the
wenzelm@62205
   199
notation is postfix with keywords 'if' (or 'when') and 'for'. For
wenzelm@60555
   200
example:
wenzelm@60414
   201
wenzelm@60414
   202
  have result: "C x y"
wenzelm@60414
   203
    if "A x" and "B y"
wenzelm@60414
   204
    for x :: 'a and y :: 'a
wenzelm@60414
   205
    <proof>
wenzelm@60414
   206
wenzelm@60449
   207
The local assumptions are bound to the name "that". The result is
wenzelm@60449
   208
exported from context of the statement as usual. The above roughly
wenzelm@60414
   209
corresponds to a raw proof block like this:
wenzelm@60414
   210
wenzelm@60414
   211
  {
wenzelm@60414
   212
    fix x :: 'a and y :: 'a
wenzelm@60449
   213
    assume that: "A x" "B y"
wenzelm@60414
   214
    have "C x y" <proof>
wenzelm@60414
   215
  }
wenzelm@60414
   216
  note result = this
wenzelm@60406
   217
wenzelm@60555
   218
The keyword 'when' may be used instead of 'if', to indicate 'presume'
wenzelm@60555
   219
instead of 'assume' above.
wenzelm@60555
   220
wenzelm@61733
   221
* Assumptions ('assume', 'presume') allow structured rule statements
wenzelm@61733
   222
using 'if' and 'for', similar to 'have' etc. above. For example:
wenzelm@61658
   223
wenzelm@61658
   224
  assume result: "C x y"
wenzelm@61658
   225
    if "A x" and "B y"
wenzelm@61658
   226
    for x :: 'a and y :: 'a
wenzelm@61658
   227
wenzelm@61658
   228
This assumes "\<And>x y::'a. A x \<Longrightarrow> B y \<Longrightarrow> C x y" and produces a general
wenzelm@61658
   229
result as usual: "A ?x \<Longrightarrow> B ?y \<Longrightarrow> C ?x ?y".
wenzelm@61658
   230
wenzelm@61658
   231
Vacuous quantification in assumptions is omitted, i.e. a for-context
wenzelm@61658
   232
only effects propositions according to actual use of variables. For
wenzelm@61658
   233
example:
wenzelm@61658
   234
wenzelm@61658
   235
  assume "A x" and "B y" for x and y
wenzelm@61658
   236
wenzelm@61658
   237
is equivalent to:
wenzelm@61658
   238
wenzelm@61658
   239
  assume "\<And>x. A x" and "\<And>y. B y"
wenzelm@61658
   240
wenzelm@60595
   241
* The meaning of 'show' with Pure rule statements has changed: premises
wenzelm@60595
   242
are treated in the sense of 'assume', instead of 'presume'. This means,
wenzelm@62205
   243
a goal like "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" can be solved completely as
wenzelm@62205
   244
follows:
wenzelm@60595
   245
wenzelm@60595
   246
  show "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60595
   247
wenzelm@60595
   248
or:
wenzelm@60595
   249
wenzelm@60595
   250
  show "C x" if "A x" "B x" for x
wenzelm@60595
   251
wenzelm@60595
   252
Rare INCOMPATIBILITY, the old behaviour may be recovered as follows:
wenzelm@60595
   253
wenzelm@60595
   254
  show "C x" when "A x" "B x" for x
wenzelm@60595
   255
wenzelm@60459
   256
* New command 'consider' states rules for generalized elimination and
wenzelm@60459
   257
case splitting. This is like a toplevel statement "theorem obtains" used
wenzelm@60459
   258
within a proof body; or like a multi-branch 'obtain' without activation
wenzelm@60459
   259
of the local context elements yet.
wenzelm@60459
   260
wenzelm@60455
   261
* Proof method "cases" allows to specify the rule as first entry of
wenzelm@60455
   262
chained facts.  This is particularly useful with 'consider':
wenzelm@60455
   263
wenzelm@60455
   264
  consider (a) A | (b) B | (c) C <proof>
wenzelm@60455
   265
  then have something
wenzelm@60455
   266
  proof cases
wenzelm@60455
   267
    case a
wenzelm@60455
   268
    then show ?thesis <proof>
wenzelm@60455
   269
  next
wenzelm@60455
   270
    case b
wenzelm@60455
   271
    then show ?thesis <proof>
wenzelm@60455
   272
  next
wenzelm@60455
   273
    case c
wenzelm@60455
   274
    then show ?thesis <proof>
wenzelm@60455
   275
  qed
wenzelm@60455
   276
wenzelm@60565
   277
* Command 'case' allows fact name and attribute specification like this:
wenzelm@60565
   278
wenzelm@60565
   279
  case a: (c xs)
wenzelm@60565
   280
  case a [attributes]: (c xs)
wenzelm@60565
   281
wenzelm@60565
   282
Facts that are introduced by invoking the case context are uniformly
wenzelm@60565
   283
qualified by "a"; the same name is used for the cumulative fact. The old
wenzelm@60565
   284
form "case (c xs) [attributes]" is no longer supported. Rare
wenzelm@60565
   285
INCOMPATIBILITY, need to adapt uses of case facts in exotic situations,
wenzelm@60565
   286
and always put attributes in front.
wenzelm@60565
   287
wenzelm@60618
   288
* The standard proof method of commands 'proof' and '..' is now called
wenzelm@60618
   289
"standard" to make semantically clear what it is; the old name "default"
wenzelm@60618
   290
is still available as legacy for some time. Documentation now explains
wenzelm@60618
   291
'..' more accurately as "by standard" instead of "by rule".
wenzelm@60618
   292
wenzelm@62017
   293
* Nesting of Isar goal structure has been clarified: the context after
wenzelm@62017
   294
the initial backwards refinement is retained for the whole proof, within
wenzelm@62017
   295
all its context sections (as indicated via 'next'). This is e.g.
wenzelm@62017
   296
relevant for 'using', 'including', 'supply':
wenzelm@62017
   297
wenzelm@62017
   298
  have "A \<and> A" if a: A for A
wenzelm@62017
   299
    supply [simp] = a
wenzelm@62017
   300
  proof
wenzelm@62017
   301
    show A by simp
wenzelm@62017
   302
  next
wenzelm@62017
   303
    show A by simp
wenzelm@62017
   304
  qed
wenzelm@62017
   305
wenzelm@62017
   306
* Command 'obtain' binds term abbreviations (via 'is' patterns) in the
wenzelm@62017
   307
proof body as well, abstracted over relevant parameters.
wenzelm@62017
   308
wenzelm@62017
   309
* Improved type-inference for theorem statement 'obtains': separate
wenzelm@62017
   310
parameter scope for of each clause.
wenzelm@62017
   311
wenzelm@62017
   312
* Term abbreviations via 'is' patterns also work for schematic
wenzelm@62017
   313
statements: result is abstracted over unknowns.
wenzelm@62017
   314
wenzelm@60631
   315
* Command 'subgoal' allows to impose some structure on backward
wenzelm@60631
   316
refinements, to avoid proof scripts degenerating into long of 'apply'
wenzelm@60631
   317
sequences. Further explanations and examples are given in the isar-ref
wenzelm@60631
   318
manual.
wenzelm@60631
   319
wenzelm@62017
   320
* Command 'supply' supports fact definitions during goal refinement
wenzelm@62017
   321
('apply' scripts).
wenzelm@62017
   322
wenzelm@61166
   323
* Proof method "goal_cases" turns the current subgoals into cases within
wenzelm@61166
   324
the context; the conclusion is bound to variable ?case in each case. For
wenzelm@61166
   325
example:
wenzelm@60617
   326
wenzelm@60617
   327
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60622
   328
  and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
wenzelm@61166
   329
proof goal_cases
wenzelm@60622
   330
  case (1 x)
wenzelm@60622
   331
  then show ?case using \<open>A x\<close> \<open>B x\<close> sorry
wenzelm@60622
   332
next
wenzelm@60622
   333
  case (2 y z)
wenzelm@60622
   334
  then show ?case using \<open>U y\<close> \<open>V z\<close> sorry
wenzelm@60622
   335
qed
wenzelm@60622
   336
wenzelm@60622
   337
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60622
   338
  and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
wenzelm@61166
   339
proof goal_cases
wenzelm@60617
   340
  case prems: 1
wenzelm@60617
   341
  then show ?case using prems sorry
wenzelm@60617
   342
next
wenzelm@60617
   343
  case prems: 2
wenzelm@60617
   344
  then show ?case using prems sorry
wenzelm@60617
   345
qed
wenzelm@60578
   346
wenzelm@60581
   347
* The undocumented feature of implicit cases goal1, goal2, goal3, etc.
wenzelm@60617
   348
is marked as legacy, and will be removed eventually. The proof method
wenzelm@60617
   349
"goals" achieves a similar effect within regular Isar; often it can be
wenzelm@60617
   350
done more adequately by other means (e.g. 'consider').
wenzelm@60581
   351
wenzelm@62017
   352
* The vacuous fact "TERM x" may be established "by fact" or as `TERM x`
wenzelm@62017
   353
as well, not just "by this" or "." as before.
wenzelm@60551
   354
wenzelm@60554
   355
* Method "sleep" succeeds after a real-time delay (in seconds). This is
wenzelm@60554
   356
occasionally useful for demonstration and testing purposes.
wenzelm@60554
   357
wenzelm@60406
   358
wenzelm@60331
   359
*** Pure ***
wenzelm@60331
   360
wenzelm@61606
   361
* Qualifiers in locale expressions default to mandatory ('!') regardless
wenzelm@61606
   362
of the command. Previously, for 'locale' and 'sublocale' the default was
wenzelm@61606
   363
optional ('?'). The old synatx '!' has been discontinued.
wenzelm@61606
   364
INCOMPATIBILITY, remove '!' and add '?' as required.
ballarin@61565
   365
ballarin@61566
   366
* Keyword 'rewrites' identifies rewrite morphisms in interpretation
wenzelm@62017
   367
commands. Previously, the keyword was 'where'. INCOMPATIBILITY.
ballarin@61566
   368
ballarin@61701
   369
* More gentle suppression of syntax along locale morphisms while
wenzelm@62017
   370
printing terms. Previously 'abbreviation' and 'notation' declarations
wenzelm@62017
   371
would be suppressed for morphisms except term identity. Now
ballarin@61701
   372
'abbreviation' is also kept for morphims that only change the involved
wenzelm@62017
   373
parameters, and only 'notation' is suppressed. This can be of great help
wenzelm@62017
   374
when working with complex locale hierarchies, because proof states are
wenzelm@62017
   375
displayed much more succinctly. It also means that only notation needs
wenzelm@62017
   376
to be redeclared if desired, as illustrated by this example:
ballarin@61701
   377
ballarin@61701
   378
  locale struct = fixes composition :: "'a => 'a => 'a" (infixl "\<cdot>" 65)
ballarin@61701
   379
  begin
ballarin@61701
   380
    definition derived (infixl "\<odot>" 65) where ...
ballarin@61701
   381
  end
ballarin@61701
   382
ballarin@61701
   383
  locale morphism =
ballarin@61701
   384
    left: struct composition + right: struct composition'
ballarin@61701
   385
    for composition (infix "\<cdot>" 65) and composition' (infix "\<cdot>''" 65)
ballarin@61701
   386
  begin
ballarin@61701
   387
    notation right.derived ("\<odot>''")
ballarin@61701
   388
  end
ballarin@61701
   389
wenzelm@61895
   390
* Command 'global_interpretation' issues interpretations into global
wenzelm@61895
   391
theories, with optional rewrite definitions following keyword 'defines'.
wenzelm@61895
   392
wenzelm@61895
   393
* Command 'sublocale' accepts optional rewrite definitions after keyword
haftmann@61675
   394
'defines'.
haftmann@61675
   395
wenzelm@61895
   396
* Command 'permanent_interpretation' has been discontinued. Use
wenzelm@61895
   397
'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.
haftmann@61670
   398
wenzelm@61252
   399
* Command 'print_definitions' prints dependencies of definitional
wenzelm@61252
   400
specifications. This functionality used to be part of 'print_theory'.
wenzelm@61252
   401
wenzelm@60331
   402
* Configuration option rule_insts_schematic has been discontinued
wenzelm@62017
   403
(intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.
wenzelm@60331
   404
wenzelm@62205
   405
* Abbreviations in type classes now carry proper sort constraint. Rare
wenzelm@62205
   406
INCOMPATIBILITY in situations where the previous misbehaviour has been
wenzelm@62205
   407
exploited.
haftmann@60347
   408
haftmann@60347
   409
* Refinement of user-space type system in type classes: pseudo-local
wenzelm@62205
   410
operations behave more similar to abbreviations. Potential
haftmann@60347
   411
INCOMPATIBILITY in exotic situations.
haftmann@60347
   412
haftmann@60347
   413
nipkow@60171
   414
*** HOL ***
nipkow@60171
   415
wenzelm@62017
   416
* The 'typedef' command has been upgraded from a partially checked
wenzelm@62017
   417
"axiomatization", to a full definitional specification that takes the
wenzelm@62017
   418
global collection of overloaded constant / type definitions into
wenzelm@62017
   419
account. Type definitions with open dependencies on overloaded
wenzelm@62017
   420
definitions need to be specified as "typedef (overloaded)". This
wenzelm@62017
   421
provides extra robustness in theory construction. Rare INCOMPATIBILITY.
wenzelm@62017
   422
wenzelm@62017
   423
* Qualification of various formal entities in the libraries is done more
wenzelm@62017
   424
uniformly via "context begin qualified definition ... end" instead of
wenzelm@62017
   425
old-style "hide_const (open) ...". Consequently, both the defined
wenzelm@62017
   426
constant and its defining fact become qualified, e.g. Option.is_none and
wenzelm@62017
   427
Option.is_none_def. Occasional INCOMPATIBILITY in applications.
wenzelm@62017
   428
wenzelm@62017
   429
* Some old and rarely used ASCII replacement syntax has been removed.
wenzelm@62017
   430
INCOMPATIBILITY, standard syntax with symbols should be used instead.
wenzelm@62017
   431
The subsequent commands help to reproduce the old forms, e.g. to
wenzelm@62017
   432
simplify porting old theories:
wenzelm@62017
   433
wenzelm@62017
   434
  notation iff  (infixr "<->" 25)
wenzelm@62017
   435
wenzelm@62017
   436
  notation Times  (infixr "<*>" 80)
wenzelm@62017
   437
wenzelm@62017
   438
  type_notation Map.map  (infixr "~=>" 0)
wenzelm@62017
   439
  notation Map.map_comp  (infixl "o'_m" 55)
wenzelm@62017
   440
wenzelm@62017
   441
  type_notation FinFun.finfun ("(_ =>f /_)" [22, 21] 21)
wenzelm@62017
   442
wenzelm@62017
   443
  notation FuncSet.funcset  (infixr "->" 60)
wenzelm@62017
   444
  notation FuncSet.extensional_funcset  (infixr "->\<^sub>E" 60)
wenzelm@62017
   445
wenzelm@62017
   446
  notation Omega_Words_Fun.conc (infixr "conc" 65)
wenzelm@62017
   447
wenzelm@62017
   448
  notation Preorder.equiv ("op ~~")
wenzelm@62017
   449
    and Preorder.equiv ("(_/ ~~ _)" [51, 51] 50)
wenzelm@62017
   450
wenzelm@62017
   451
  notation (in topological_space) tendsto (infixr "--->" 55)
wenzelm@62017
   452
  notation (in topological_space) LIMSEQ ("((_)/ ----> (_))" [60, 60] 60)
wenzelm@62017
   453
  notation LIM ("((_)/ -- (_)/ --> (_))" [60, 0, 60] 60)
wenzelm@62017
   454
wenzelm@62017
   455
  notation NSA.approx (infixl "@=" 50)
wenzelm@62017
   456
  notation NSLIMSEQ ("((_)/ ----NS> (_))" [60, 60] 60)
wenzelm@62017
   457
  notation NSLIM ("((_)/ -- (_)/ --NS> (_))" [60, 0, 60] 60)
wenzelm@62017
   458
wenzelm@62017
   459
* The alternative notation "\<Colon>" for type and sort constraints has been
wenzelm@62017
   460
removed: in LaTeX document output it looks the same as "::".
wenzelm@62017
   461
INCOMPATIBILITY, use plain "::" instead.
wenzelm@62017
   462
wenzelm@62017
   463
* Commands 'inductive' and 'inductive_set' work better when names for
wenzelm@62017
   464
intro rules are omitted: the "cases" and "induct" rules no longer
wenzelm@62017
   465
declare empty case_names, but no case_names at all. This allows to use
wenzelm@62017
   466
numbered cases in proofs, without requiring method "goal_cases".
wenzelm@62017
   467
wenzelm@62017
   468
* Inductive definitions ('inductive', 'coinductive', etc.) expose
wenzelm@62017
   469
low-level facts of the internal construction only if the option
wenzelm@62093
   470
"inductive_internals" is enabled. This refers to the internal predicate
wenzelm@62017
   471
definition and its monotonicity result. Rare INCOMPATIBILITY.
wenzelm@62017
   472
wenzelm@62017
   473
* Recursive function definitions ('fun', 'function', 'partial_function')
wenzelm@62017
   474
expose low-level facts of the internal construction only if the option
wenzelm@62205
   475
"function_internals" is enabled. Its internal inductive definition is
wenzelm@62205
   476
also subject to "inductive_internals". Rare INCOMPATIBILITY.
wenzelm@62093
   477
wenzelm@62093
   478
* BNF datatypes ('datatype', 'codatatype', etc.) expose low-level facts
wenzelm@62093
   479
of the internal construction only if the option "bnf_internals" is
wenzelm@62093
   480
enabled. This supersedes the former option "bnf_note_all". Rare
wenzelm@62093
   481
INCOMPATIBILITY.
wenzelm@62017
   482
wenzelm@62017
   483
* Combinator to represent case distinction on products is named
wenzelm@62017
   484
"case_prod", uniformly, discontinuing any input aliasses. Very popular
wenzelm@62017
   485
theorem aliasses have been retained.
wenzelm@62017
   486
haftmann@61424
   487
Consolidated facts:
haftmann@61424
   488
  PairE ~> prod.exhaust
haftmann@61424
   489
  Pair_eq ~> prod.inject
haftmann@61424
   490
  pair_collapse ~> prod.collapse
haftmann@61424
   491
  Pair_fst_snd_eq ~> prod_eq_iff
haftmann@61424
   492
  split_twice ~> prod.case_distrib
haftmann@61424
   493
  split_weak_cong ~> prod.case_cong_weak
haftmann@61424
   494
  split_split ~> prod.split
haftmann@61424
   495
  split_split_asm ~> prod.split_asm
haftmann@61424
   496
  splitI ~> case_prodI
haftmann@61424
   497
  splitD ~> case_prodD
haftmann@61424
   498
  splitI2 ~> case_prodI2
haftmann@61424
   499
  splitI2' ~> case_prodI2'
haftmann@61424
   500
  splitE ~> case_prodE
haftmann@61424
   501
  splitE' ~> case_prodE'
haftmann@61424
   502
  split_pair ~> case_prod_Pair
haftmann@61424
   503
  split_eta ~> case_prod_eta
haftmann@61424
   504
  split_comp ~> case_prod_comp
haftmann@61424
   505
  mem_splitI ~> mem_case_prodI
haftmann@61424
   506
  mem_splitI2 ~> mem_case_prodI2
haftmann@61424
   507
  mem_splitE ~> mem_case_prodE
haftmann@61424
   508
  The_split ~> The_case_prod
haftmann@61424
   509
  cond_split_eta ~> cond_case_prod_eta
haftmann@61424
   510
  Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE
haftmann@61424
   511
  Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI
haftmann@61424
   512
  in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq
haftmann@61424
   513
  Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD
haftmann@61424
   514
  Collect_split_Grp_inD ~> Collect_case_prod_Grp_in
haftmann@61424
   515
  Domain_Collect_split ~> Domain_Collect_case_prod
haftmann@61424
   516
  Image_Collect_split ~> Image_Collect_case_prod
haftmann@61424
   517
  Range_Collect_split ~> Range_Collect_case_prod
haftmann@61424
   518
  Eps_split ~> Eps_case_prod
haftmann@61424
   519
  Eps_split_eq ~> Eps_case_prod_eq
haftmann@61424
   520
  split_rsp ~> case_prod_rsp
haftmann@61424
   521
  curry_split ~> curry_case_prod
haftmann@61424
   522
  split_curry ~> case_prod_curry
wenzelm@62017
   523
haftmann@61424
   524
Changes in structure HOLogic:
haftmann@61424
   525
  split_const ~> case_prod_const
haftmann@61424
   526
  mk_split ~> mk_case_prod
haftmann@61424
   527
  mk_psplits ~> mk_ptupleabs
haftmann@61424
   528
  strip_psplits ~> strip_ptupleabs
wenzelm@62017
   529
wenzelm@62017
   530
INCOMPATIBILITY.
wenzelm@62017
   531
wenzelm@62017
   532
* The coercions to type 'real' have been reorganised. The function
wenzelm@62017
   533
'real' is no longer overloaded, but has type 'nat => real' and
wenzelm@62017
   534
abbreviates of_nat for that type. Also 'real_of_int :: int => real'
wenzelm@62017
   535
abbreviates of_int for that type. Other overloaded instances of 'real'
wenzelm@62017
   536
have been replaced by 'real_of_ereal' and 'real_of_float'.
wenzelm@62017
   537
lp15@61694
   538
Consolidated facts (among others):
lp15@61694
   539
  real_of_nat_le_iff -> of_nat_le_iff
lp15@61694
   540
  real_of_nat_numeral of_nat_numeral
lp15@61694
   541
  real_of_int_zero of_int_0
lp15@61694
   542
  real_of_nat_zero of_nat_0
lp15@61694
   543
  real_of_one of_int_1
lp15@61694
   544
  real_of_int_add of_int_add
lp15@61694
   545
  real_of_nat_add of_nat_add
lp15@61694
   546
  real_of_int_diff of_int_diff
lp15@61694
   547
  real_of_nat_diff of_nat_diff
lp15@61694
   548
  floor_subtract floor_diff_of_int
lp15@61694
   549
  real_of_int_inject of_int_eq_iff
lp15@61694
   550
  real_of_int_gt_zero_cancel_iff of_int_0_less_iff
lp15@61694
   551
  real_of_int_ge_zero_cancel_iff of_int_0_le_iff
lp15@61694
   552
  real_of_nat_ge_zero of_nat_0_le_iff
lp15@61694
   553
  real_of_int_ceiling_ge le_of_int_ceiling
lp15@61694
   554
  ceiling_less_eq ceiling_less_iff
lp15@61694
   555
  ceiling_le_eq ceiling_le_iff
lp15@61694
   556
  less_floor_eq less_floor_iff
lp15@61694
   557
  floor_less_eq floor_less_iff
lp15@61694
   558
  floor_divide_eq_div floor_divide_of_int_eq
lp15@61694
   559
  real_of_int_zero_cancel of_nat_eq_0_iff
lp15@61694
   560
  ceiling_real_of_int ceiling_of_int
wenzelm@62017
   561
wenzelm@62017
   562
INCOMPATIBILITY.
wenzelm@61143
   563
wenzelm@60841
   564
* Theory Map: lemma map_of_is_SomeD was a clone of map_of_SomeD and has
wenzelm@60841
   565
been removed. INCOMPATIBILITY.
wenzelm@60841
   566
lars@60712
   567
* Quickcheck setup for finite sets.
lars@60712
   568
nipkow@60171
   569
* Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.
wenzelm@60138
   570
blanchet@60306
   571
* Sledgehammer:
blanchet@61318
   572
  - The MaSh relevance filter has been sped up.
blanchet@60306
   573
  - Proof reconstruction has been improved, to minimize the incidence of
blanchet@60306
   574
    cases where Sledgehammer gives a proof that does not work.
blanchet@60306
   575
  - Auto Sledgehammer now minimizes and preplays the results.
blanchet@61030
   576
  - Handle Vampire 4.0 proof output without raising exception.
blanchet@61043
   577
  - Eliminated "MASH" environment variable. Use the "MaSh" option in
blanchet@61043
   578
    Isabelle/jEdit instead. INCOMPATIBILITY.
blanchet@61317
   579
  - Eliminated obsolete "blocking" option and related subcommands.
blanchet@60306
   580
blanchet@60310
   581
* Nitpick:
blanchet@61325
   582
  - Fixed soundness bug in translation of "finite" predicate.
blanchet@61324
   583
  - Fixed soundness bug in "destroy_constrs" optimization.
blanchet@62080
   584
  - Fixed soundness bug in translation of "rat" type.
blanchet@60310
   585
  - Removed "check_potential" and "check_genuine" options.
blanchet@61317
   586
  - Eliminated obsolete "blocking" option.
blanchet@60310
   587
wenzelm@62027
   588
* (Co)datatype package:
blanchet@61345
   589
  - New commands "lift_bnf" and "copy_bnf" for lifting (copying) a BNF
blanchet@61345
   590
    structure on the raw type to an abstract type defined using typedef.
blanchet@61345
   591
  - Always generate "case_transfer" theorem.
blanchet@62159
   592
  - For mutual types, generate slightly stronger "rel_induct", "rel_coinduct",
blanchet@62159
   593
    and "coinduct" theorems. INCOMPATIBLITY.
blanchet@61551
   594
  - Allow discriminators and selectors with the same name as the type
blanchet@61551
   595
    being defined.
blanchet@61551
   596
  - Avoid various internal name clashes (e.g., 'datatype f = f').
traytel@60920
   597
wenzelm@62098
   598
* Transfer: new methods for interactive debugging of 'transfer' and
wenzelm@62098
   599
'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',
wenzelm@62098
   600
'transfer_prover_start' and 'transfer_prover_end'.
kuncar@61370
   601
kleing@62118
   602
* New diagnostic command print_record for displaying record definitions.
kleing@62118
   603
haftmann@60868
   604
* Division on integers is bootstrapped directly from division on
wenzelm@62017
   605
naturals and uses generic numeral algorithm for computations. Slight
wenzelm@62017
   606
INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former
wenzelm@62017
   607
simprocs binary_int_div and binary_int_mod
wenzelm@62017
   608
wenzelm@62017
   609
* Tightened specification of class semiring_no_zero_divisors. Minor
haftmann@60516
   610
INCOMPATIBILITY.
haftmann@60516
   611
haftmann@60688
   612
* Class algebraic_semidom introduces common algebraic notions of
wenzelm@62017
   613
integral (semi)domains, particularly units. Although logically subsumed
wenzelm@62017
   614
by fields, is is not a super class of these in order not to burden
wenzelm@62017
   615
fields with notions that are trivial there.
wenzelm@62017
   616
wenzelm@62017
   617
* Class normalization_semidom specifies canonical representants for
wenzelm@62017
   618
equivalence classes of associated elements in an integral (semi)domain.
wenzelm@62017
   619
This formalizes associated elements as well.
haftmann@60688
   620
haftmann@60688
   621
* Abstract specification of gcd/lcm operations in classes semiring_gcd,
wenzelm@62017
   622
semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute
wenzelm@62017
   623
and gcd_int.commute are subsumed by gcd.commute, as well as
wenzelm@62017
   624
gcd_nat.assoc and gcd_int.assoc by gcd.assoc.
wenzelm@62017
   625
wenzelm@62017
   626
* Former constants Fields.divide (_ / _) and Divides.div (_ div _) are
wenzelm@62017
   627
logically unified to Rings.divide in syntactic type class Rings.divide,
wenzelm@62017
   628
with infix syntax (_ div _). Infix syntax (_ / _) for field division is
wenzelm@62017
   629
added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,
wenzelm@62017
   630
instantiations must refer to Rings.divide rather than the former
wenzelm@62017
   631
separate constants, hence infix syntax (_ / _) is usually not available
wenzelm@62017
   632
during instantiation.
wenzelm@62017
   633
wenzelm@62017
   634
* New cancellation simprocs for boolean algebras to cancel complementary
wenzelm@62017
   635
terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to
wenzelm@62017
   636
"top". INCOMPATIBILITY.
Andreas@61629
   637
hoelzl@62101
   638
* Class uniform_space introduces uniform spaces btw topological spaces
hoelzl@62101
   639
and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be
wenzelm@62205
   640
introduced in the form of an uniformity. Some constants are more general
wenzelm@62205
   641
now, it may be necessary to add type class constraints.
hoelzl@62101
   642
hoelzl@62101
   643
  open_real_def \<leadsto> open_dist
hoelzl@62101
   644
  open_complex_def \<leadsto> open_dist
hoelzl@62101
   645
wenzelm@62026
   646
* Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.
wenzelm@62026
   647
Mathias@60397
   648
* Library/Multiset:
Mathias@60397
   649
  - Renamed multiset inclusion operators:
Mathias@60397
   650
      < ~> <#
blanchet@62208
   651
      > ~> >#
Mathias@60397
   652
      \<subset> ~> \<subset>#
blanchet@62208
   653
      \<supset> ~> \<supset>#
Mathias@60397
   654
      <= ~> <=#
blanchet@62208
   655
      >= ~> >=#
Mathias@60397
   656
      \<le> ~> \<le>#
blanchet@62208
   657
      \<ge> ~> \<ge>#
Mathias@60397
   658
      \<subseteq> ~> \<subseteq>#
blanchet@62208
   659
      \<supseteq> ~> \<supseteq>#
Mathias@60397
   660
    INCOMPATIBILITY.
Mathias@60397
   661
  - "'a multiset" is no longer an instance of the "order",
Mathias@60397
   662
    "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",
Mathias@60397
   663
    "semilattice_inf", and "semilattice_sup" type classes. The theorems
Mathias@60397
   664
    previously provided by these type classes (directly or indirectly)
Mathias@60397
   665
    are now available through the "subset_mset" interpretation
Mathias@60397
   666
    (e.g. add_mono ~> subset_mset.add_mono).
Mathias@60397
   667
    INCOMPATIBILITY.
nipkow@60497
   668
  - Renamed conversions:
nipkow@60515
   669
      multiset_of ~> mset
nipkow@60515
   670
      multiset_of_set ~> mset_set
nipkow@60497
   671
      set_of ~> set_mset
nipkow@60497
   672
    INCOMPATIBILITY
Mathias@60398
   673
  - Renamed lemmas:
Mathias@60398
   674
      mset_le_def ~> subseteq_mset_def
Mathias@60398
   675
      mset_less_def ~> subset_mset_def
Mathias@60400
   676
      less_eq_multiset.rep_eq ~> subseteq_mset_def
Mathias@60400
   677
    INCOMPATIBILITY
Mathias@60400
   678
  - Removed lemmas generated by lift_definition:
Mathias@60400
   679
    less_eq_multiset.abs_eq, less_eq_multiset.rsp less_eq_multiset.transfer
Mathias@60400
   680
    less_eq_multiset_def
Mathias@60400
   681
    INCOMPATIBILITY
wenzelm@60006
   682
wenzelm@62017
   683
* Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a.
wenzelm@62017
   684
wenzelm@62017
   685
* Library/Bourbaki_Witt_Fixpoint: Added formalisation of the
wenzelm@62017
   686
Bourbaki-Witt fixpoint theorem for increasing functions in
wenzelm@62017
   687
chain-complete partial orders.
wenzelm@62017
   688
wenzelm@62017
   689
* Library/Old_Recdef: discontinued obsolete 'defer_recdef' command.
wenzelm@62017
   690
Minor INCOMPATIBILITY, use 'function' instead.
wenzelm@62017
   691
wenzelm@62064
   692
* Library/Periodic_Fun: a locale that provides convenient lemmas for
wenzelm@62064
   693
periodic functions.
eberlm@62060
   694
wenzelm@62098
   695
* Library/Formal_Power_Series: proper definition of division (with
wenzelm@62098
   696
remainder) for formal power series; instances for Euclidean Ring and
wenzelm@62098
   697
GCD.
eberlm@62086
   698
wenzelm@62084
   699
* HOL-Imperative_HOL: obsolete theory Legacy_Mrec has been removed.
wenzelm@62084
   700
wenzelm@62084
   701
* HOL-Statespace: command 'statespace' uses mandatory qualifier for
wenzelm@62084
   702
import of parent, as for general 'locale' expressions. INCOMPATIBILITY,
wenzelm@62084
   703
remove '!' and add '?' as required.
wenzelm@62084
   704
wenzelm@62084
   705
* HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour
wenzelm@62084
   706
integrals (= complex path integrals), Cauchy's integral theorem, winding
wenzelm@62084
   707
numbers and Cauchy's integral formula, Liouville theorem, Fundamental
wenzelm@62084
   708
Theorem of Algebra. Ported from HOL Light.
wenzelm@62084
   709
wenzelm@62084
   710
* HOL-Multivariate_Analysis: topological concepts such as connected
wenzelm@62017
   711
components, homotopic paths and the inside or outside of a set.
wenzelm@61121
   712
wenzelm@62084
   713
* HOL-Multivariate_Analysis: radius of convergence of power series and
wenzelm@62064
   714
various summability tests; Harmonic numbers and the Euler–Mascheroni
wenzelm@62064
   715
constant; the Generalised Binomial Theorem; the complex and real
wenzelm@62064
   716
Gamma/log-Gamma/Digamma/ Polygamma functions and their most important
wenzelm@62064
   717
properties.
eberlm@62060
   718
wenzelm@62084
   719
* HOL-Probability: The central limit theorem based on Levy's uniqueness
wenzelm@62084
   720
and continuity theorems, weak convergence, and characterisitc functions.
wenzelm@62084
   721
wenzelm@62084
   722
* HOL-Data_Structures: new and growing session of standard data
wenzelm@62084
   723
structures.
lammich@61178
   724
wenzelm@60479
   725
wenzelm@60793
   726
*** ML ***
wenzelm@60793
   727
wenzelm@62017
   728
* The following combinators for low-level profiling of the ML runtime
wenzelm@62017
   729
system are available:
wenzelm@62017
   730
wenzelm@62017
   731
  profile_time          (*CPU time*)
wenzelm@62017
   732
  profile_time_thread   (*CPU time on this thread*)
wenzelm@62017
   733
  profile_allocations   (*overall heap allocations*)
wenzelm@62017
   734
wenzelm@62017
   735
* Antiquotation @{undefined} or \<^undefined> inlines (raise Match).
wenzelm@62017
   736
wenzelm@62075
   737
* Antiquotation @{method NAME} inlines the (checked) name of the given
wenzelm@62075
   738
Isar proof method.
wenzelm@62075
   739
wenzelm@61922
   740
* Pretty printing of Poly/ML compiler output in Isabelle has been
wenzelm@61922
   741
improved: proper treatment of break offsets and blocks with consistent
wenzelm@61922
   742
breaks.
wenzelm@61922
   743
wenzelm@61268
   744
* The auxiliary module Pure/display.ML has been eliminated. Its
wenzelm@61268
   745
elementary thm print operations are now in Pure/more_thm.ML and thus
wenzelm@61268
   746
called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY.
wenzelm@61268
   747
wenzelm@61144
   748
* Simproc programming interfaces have been simplified:
wenzelm@61144
   749
Simplifier.make_simproc and Simplifier.define_simproc supersede various
wenzelm@61144
   750
forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that
wenzelm@61144
   751
term patterns for the left-hand sides are specified with implicitly
wenzelm@61144
   752
fixed variables, like top-level theorem statements. INCOMPATIBILITY.
wenzelm@61144
   753
wenzelm@60802
   754
* Instantiation rules have been re-organized as follows:
wenzelm@60802
   755
wenzelm@60802
   756
  Thm.instantiate  (*low-level instantiation with named arguments*)
wenzelm@60802
   757
  Thm.instantiate' (*version with positional arguments*)
wenzelm@60802
   758
wenzelm@60802
   759
  Drule.infer_instantiate  (*instantiation with type inference*)
wenzelm@60802
   760
  Drule.infer_instantiate'  (*version with positional arguments*)
wenzelm@60802
   761
wenzelm@60802
   762
The LHS only requires variable specifications, instead of full terms.
wenzelm@60802
   763
Old cterm_instantiate is superseded by infer_instantiate.
wenzelm@60802
   764
INCOMPATIBILITY, need to re-adjust some ML names and types accordingly.
wenzelm@60802
   765
wenzelm@60793
   766
* Old tactic shorthands atac, rtac, etac, dtac, ftac have been
wenzelm@60793
   767
discontinued. INCOMPATIBILITY, use regular assume_tac, resolve_tac etc.
wenzelm@60793
   768
instead (with proper context).
wenzelm@60642
   769
wenzelm@60642
   770
* Thm.instantiate (and derivatives) no longer require the LHS of the
wenzelm@60642
   771
instantiation to be certified: plain variables are given directly.
wenzelm@60642
   772
wenzelm@60707
   773
* Subgoal.SUBPROOF and Subgoal.FOCUS combinators use anonymous
wenzelm@60707
   774
quasi-bound variables (like the Simplifier), instead of accidentally
wenzelm@60707
   775
named local fixes. This has the potential to improve stability of proof
wenzelm@60707
   776
tools, but can also cause INCOMPATIBILITY for tools that don't observe
wenzelm@60707
   777
the proof context discipline.
wenzelm@60707
   778
wenzelm@62017
   779
* Isar proof methods are based on a slightly more general type
wenzelm@62017
   780
context_tactic, which allows to change the proof context dynamically
wenzelm@62017
   781
(e.g. to update cases) and indicate explicit Seq.Error results. Former
wenzelm@62017
   782
METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are
wenzelm@62017
   783
provided in src/Pure/Isar/method.ML for convenience. INCOMPATIBILITY.
wenzelm@61885
   784
wenzelm@60642
   785
wenzelm@60983
   786
*** System ***
wenzelm@60983
   787
wenzelm@61958
   788
* Command-line tool "isabelle console" enables print mode "ASCII".
wenzelm@61958
   789
wenzelm@62017
   790
* Command-line tool "isabelle update_then" expands old Isar command
wenzelm@62017
   791
conflations:
wenzelm@62017
   792
wenzelm@62017
   793
    hence  ~>  then have
wenzelm@62017
   794
    thus   ~>  then show
wenzelm@62017
   795
wenzelm@62017
   796
This syntax is more orthogonal and improves readability and
wenzelm@62017
   797
maintainability of proofs.
wenzelm@62017
   798
wenzelm@61602
   799
* Global session timeout is multiplied by timeout_scale factor. This
wenzelm@61602
   800
allows to adjust large-scale tests (e.g. AFP) to overall hardware
wenzelm@61602
   801
performance.
wenzelm@61602
   802
wenzelm@61174
   803
* Property values in etc/symbols may contain spaces, if written with the
wenzelm@62205
   804
replacement character "␣" (Unicode point 0x2324). For example:
wenzelm@61174
   805
wenzelm@61602
   806
    \<star>  code: 0x0022c6  group: operator  font: Deja␣Vu␣Sans␣Mono
wenzelm@61174
   807
wenzelm@60995
   808
* Java runtime environment for x86_64-windows allows to use larger heap
wenzelm@60995
   809
space.
wenzelm@60995
   810
wenzelm@61135
   811
* Java runtime options are determined separately for 32bit vs. 64bit
wenzelm@61135
   812
platforms as follows.
wenzelm@61135
   813
wenzelm@61135
   814
  - Isabelle desktop application: platform-specific files that are
wenzelm@61135
   815
    associated with the main app bundle
wenzelm@61135
   816
wenzelm@61135
   817
  - isabelle jedit: settings
wenzelm@61135
   818
    JEDIT_JAVA_SYSTEM_OPTIONS
wenzelm@61135
   819
    JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64
wenzelm@61135
   820
wenzelm@61135
   821
  - isabelle build: settings
wenzelm@61135
   822
    ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64
wenzelm@61135
   823
wenzelm@61294
   824
* Bash shell function "jvmpath" has been renamed to "platform_path": it
wenzelm@61294
   825
is relevant both for Poly/ML and JVM processes.
wenzelm@61294
   826
wenzelm@62017
   827
* Poly/ML default platform architecture may be changed from 32bit to
wenzelm@62205
   828
64bit via system option ML_system_64. A system restart (and rebuild) is
wenzelm@62205
   829
required after change.
wenzelm@62017
   830
wenzelm@62017
   831
* Poly/ML 5.6 runs natively on x86-windows and x86_64-windows, which
wenzelm@62017
   832
both allow larger heap space than former x86-cygwin.
wenzelm@62017
   833
wenzelm@62157
   834
* Heap images are 10-15% smaller due to less wasteful persistent theory
wenzelm@62157
   835
content (using ML type theory_id instead of theory);
wenzelm@62157
   836
wenzelm@60983
   837
wenzelm@60479
   838
wenzelm@60009
   839
New in Isabelle2015 (May 2015)
wenzelm@60009
   840
------------------------------
wenzelm@57695
   841
wenzelm@57941
   842
*** General ***
wenzelm@57941
   843
wenzelm@59939
   844
* Local theory specification commands may have a 'private' or
wenzelm@59990
   845
'qualified' modifier to restrict name space accesses to the local scope,
wenzelm@59939
   846
as provided by some "context begin ... end" block. For example:
wenzelm@59926
   847
wenzelm@59926
   848
  context
wenzelm@59926
   849
  begin
wenzelm@59926
   850
wenzelm@59926
   851
  private definition ...
wenzelm@59926
   852
  private lemma ...
wenzelm@59926
   853
wenzelm@59990
   854
  qualified definition ...
wenzelm@59990
   855
  qualified lemma ...
wenzelm@59990
   856
wenzelm@59926
   857
  lemma ...
wenzelm@59926
   858
  theorem ...
wenzelm@59926
   859
wenzelm@59926
   860
  end
wenzelm@59926
   861
wenzelm@59901
   862
* Command 'experiment' opens an anonymous locale context with private
wenzelm@59901
   863
naming policy.
wenzelm@59901
   864
wenzelm@59951
   865
* Command 'notepad' requires proper nesting of begin/end and its proof
wenzelm@59951
   866
structure in the body: 'oops' is no longer supported here. Minor
wenzelm@59951
   867
INCOMPATIBILITY, use 'sorry' instead.
wenzelm@59951
   868
wenzelm@59951
   869
* Command 'named_theorems' declares a dynamic fact within the context,
wenzelm@59951
   870
together with an attribute to maintain the content incrementally. This
wenzelm@59951
   871
supersedes functor Named_Thms in Isabelle/ML, but with a subtle change
wenzelm@59951
   872
of semantics due to external visual order vs. internal reverse order.
wenzelm@59951
   873
wenzelm@59951
   874
* 'find_theorems': search patterns which are abstractions are
wenzelm@59951
   875
schematically expanded before search. Search results match the naive
wenzelm@59951
   876
expectation more closely, particularly wrt. abbreviations.
wenzelm@59951
   877
INCOMPATIBILITY.
wenzelm@59648
   878
wenzelm@59569
   879
* Commands 'method_setup' and 'attribute_setup' now work within a local
wenzelm@59569
   880
theory context.
wenzelm@57941
   881
wenzelm@58928
   882
* Outer syntax commands are managed authentically within the theory
wenzelm@59569
   883
context, without implicit global state. Potential for accidental
wenzelm@58928
   884
INCOMPATIBILITY, make sure that required theories are really imported.
wenzelm@58928
   885
wenzelm@60115
   886
* Historical command-line terminator ";" is no longer accepted (and
wenzelm@60115
   887
already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle
wenzelm@60115
   888
update_semicolons" to remove obsolete semicolons from old theory
wenzelm@60115
   889
sources.
wenzelm@60115
   890
wenzelm@59951
   891
* Structural composition of proof methods (meth1; meth2) in Isar
wenzelm@59951
   892
corresponds to (tac1 THEN_ALL_NEW tac2) in ML.
haftmann@59105
   893
wenzelm@60119
   894
* The Eisbach proof method language allows to define new proof methods
wenzelm@60119
   895
by combining existing ones with their usual syntax. The "match" proof
wenzelm@60119
   896
method provides basic fact/term matching in addition to
wenzelm@60119
   897
premise/conclusion matching through Subgoal.focus, and binds fact names
wenzelm@60288
   898
from matches as well as term patterns within matches. The Isabelle
wenzelm@60288
   899
documentation provides an entry "eisbach" for the Eisbach User Manual.
wenzelm@60288
   900
Sources and various examples are in ~~/src/HOL/Eisbach/.
wenzelm@60119
   901
wenzelm@57941
   902
wenzelm@58524
   903
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@58524
   904
wenzelm@59569
   905
* Improved folding mode "isabelle" based on Isar syntax. Alternatively,
wenzelm@59569
   906
the "sidekick" mode may be used for document structure.
wenzelm@59569
   907
wenzelm@59569
   908
* Extended bracket matching based on Isar language structure. System
wenzelm@59569
   909
option jedit_structure_limit determines maximum number of lines to scan
wenzelm@59569
   910
in the buffer.
wenzelm@58758
   911
wenzelm@58540
   912
* Support for BibTeX files: context menu, context-sensitive token
wenzelm@58540
   913
marker, SideKick parser.
wenzelm@58524
   914
wenzelm@58551
   915
* Document antiquotation @{cite} provides formal markup, which is
wenzelm@60265
   916
interpreted semi-formally based on .bib files that happen to be open in
wenzelm@60265
   917
the editor (hyperlinks, completion etc.).
wenzelm@58551
   918
wenzelm@58785
   919
* Less waste of vertical space via negative line spacing (see Global
wenzelm@58785
   920
Options / Text Area).
wenzelm@58785
   921
wenzelm@60089
   922
* Improved graphview panel with optional output of PNG or PDF, for
wenzelm@60273
   923
display of 'thy_deps', 'class_deps' etc.
wenzelm@60009
   924
wenzelm@60115
   925
* The commands 'thy_deps' and 'class_deps' allow optional bounds to
wenzelm@60115
   926
restrict the visualized hierarchy.
wenzelm@60093
   927
wenzelm@60072
   928
* Improved scheduling for asynchronous print commands (e.g. provers
wenzelm@60072
   929
managed by the Sledgehammer panel) wrt. ongoing document processing.
wenzelm@60072
   930
wenzelm@58524
   931
wenzelm@59951
   932
*** Document preparation ***
wenzelm@59951
   933
wenzelm@59951
   934
* Document markup commands 'chapter', 'section', 'subsection',
wenzelm@59951
   935
'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any
wenzelm@59951
   936
context, even before the initial 'theory' command. Obsolete proof
wenzelm@59951
   937
commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been
wenzelm@59951
   938
discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'
wenzelm@59951
   939
instead. The old 'header' command is still retained for some time, but
wenzelm@59951
   940
should be replaced by 'chapter', 'section' etc. (using "isabelle
wenzelm@59951
   941
update_header"). Minor INCOMPATIBILITY.
wenzelm@59951
   942
wenzelm@60009
   943
* Official support for "tt" style variants, via \isatt{...} or
wenzelm@60009
   944
\begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or
wenzelm@60009
   945
verbatim environment of LaTeX is no longer used. This allows @{ML} etc.
wenzelm@60009
   946
as argument to other macros (such as footnotes).
wenzelm@60009
   947
wenzelm@60009
   948
* Document antiquotation @{verbatim} prints ASCII text literally in "tt"
wenzelm@60009
   949
style.
wenzelm@60009
   950
wenzelm@60009
   951
* Discontinued obsolete option "document_graph": session_graph.pdf is
wenzelm@60009
   952
produced unconditionally for HTML browser_info and PDF-LaTeX document.
wenzelm@60009
   953
wenzelm@59951
   954
* Diagnostic commands and document markup commands within a proof do not
wenzelm@59951
   955
affect the command tag for output. Thus commands like 'thm' are subject
wenzelm@59951
   956
to proof document structure, and no longer "stick out" accidentally.
wenzelm@59951
   957
Commands 'text' and 'txt' merely differ in the LaTeX style, not their
wenzelm@59951
   958
tags. Potential INCOMPATIBILITY in exotic situations.
wenzelm@59951
   959
wenzelm@59951
   960
* System option "pretty_margin" is superseded by "thy_output_margin",
wenzelm@59951
   961
which is also accessible via document antiquotation option "margin".
wenzelm@59951
   962
Only the margin for document output may be changed, but not the global
wenzelm@59951
   963
pretty printing: that is 76 for plain console output, and adapted
wenzelm@59951
   964
dynamically in GUI front-ends. Implementations of document
wenzelm@59951
   965
antiquotations need to observe the margin explicitly according to
wenzelm@59951
   966
Thy_Output.string_of_margin. Minor INCOMPATIBILITY.
wenzelm@59951
   967
wenzelm@60299
   968
* Specification of 'document_files' in the session ROOT file is
wenzelm@60299
   969
mandatory for document preparation. The legacy mode with implicit
wenzelm@60299
   970
copying of the document/ directory is no longer supported. Minor
wenzelm@60299
   971
INCOMPATIBILITY.
wenzelm@60299
   972
wenzelm@59951
   973
haftmann@58202
   974
*** Pure ***
haftmann@58202
   975
wenzelm@59835
   976
* Proof methods with explicit instantiation ("rule_tac", "subgoal_tac"
wenzelm@59835
   977
etc.) allow an optional context of local variables ('for' declaration):
wenzelm@59835
   978
these variables become schematic in the instantiated theorem; this
wenzelm@59835
   979
behaviour is analogous to 'for' in attributes "where" and "of".
wenzelm@59835
   980
Configuration option rule_insts_schematic (default false) controls use
wenzelm@59835
   981
of schematic variables outside the context. Minor INCOMPATIBILITY,
wenzelm@59835
   982
declare rule_insts_schematic = true temporarily and update to use local
wenzelm@59835
   983
variable declarations or dummy patterns instead.
wenzelm@59835
   984
wenzelm@60009
   985
* Explicit instantiation via attributes "where", "of", and proof methods
wenzelm@60009
   986
"rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns
wenzelm@60009
   987
("_") that stand for anonymous local variables.
wenzelm@60009
   988
wenzelm@59951
   989
* Generated schematic variables in standard format of exported facts are
wenzelm@59951
   990
incremented to avoid material in the proof context. Rare
wenzelm@59951
   991
INCOMPATIBILITY, explicit instantiation sometimes needs to refer to
wenzelm@59951
   992
different index.
wenzelm@59951
   993
wenzelm@60010
   994
* Lexical separation of signed and unsigned numerals: categories "num"
wenzelm@60010
   995
and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence
wenzelm@60010
   996
of numeral signs, particularly in expressions involving infix syntax
wenzelm@60010
   997
like "(- 1) ^ n".
haftmann@58410
   998
wenzelm@58421
   999
* Old inner token category "xnum" has been discontinued.  Potential
wenzelm@58421
  1000
INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num"
wenzelm@58421
  1001
token category instead.
wenzelm@58421
  1002
haftmann@58202
  1003
blanchet@57737
  1004
*** HOL ***
blanchet@57737
  1005
blanchet@57983
  1006
* New (co)datatype package:
blanchet@58373
  1007
  - The 'datatype_new' command has been renamed 'datatype'. The old
blanchet@58373
  1008
    command of that name is now called 'old_datatype' and is provided
blanchet@58373
  1009
    by "~~/src/HOL/Library/Old_Datatype.thy". See
blanchet@58373
  1010
    'isabelle doc datatypes' for information on porting.
blanchet@58373
  1011
    INCOMPATIBILITY.
blanchet@57983
  1012
  - Renamed theorems:
blanchet@57983
  1013
      disc_corec ~> corec_disc
blanchet@57983
  1014
      disc_corec_iff ~> corec_disc_iff
blanchet@57983
  1015
      disc_exclude ~> distinct_disc
blanchet@57983
  1016
      disc_exhaust ~> exhaust_disc
blanchet@57983
  1017
      disc_map_iff ~> map_disc_iff
blanchet@57983
  1018
      sel_corec ~> corec_sel
blanchet@57983
  1019
      sel_exhaust ~> exhaust_sel
blanchet@57983
  1020
      sel_map ~> map_sel
blanchet@57983
  1021
      sel_set ~> set_sel
blanchet@57983
  1022
      sel_split ~> split_sel
blanchet@57983
  1023
      sel_split_asm ~> split_sel_asm
blanchet@57983
  1024
      strong_coinduct ~> coinduct_strong
blanchet@57983
  1025
      weak_case_cong ~> case_cong_weak
blanchet@57983
  1026
    INCOMPATIBILITY.
blanchet@58192
  1027
  - The "no_code" option to "free_constructors", "datatype_new", and
blanchet@58192
  1028
    "codatatype" has been renamed "plugins del: code".
blanchet@58192
  1029
    INCOMPATIBILITY.
blanchet@58044
  1030
  - The rules "set_empty" have been removed. They are easy
blanchet@58044
  1031
    consequences of other set rules "by auto".
blanchet@58044
  1032
    INCOMPATIBILITY.
blanchet@58044
  1033
  - The rule "set_cases" is now registered with the "[cases set]"
blanchet@57990
  1034
    attribute. This can influence the behavior of the "cases" proof
blanchet@57990
  1035
    method when more than one case rule is applicable (e.g., an
blanchet@57990
  1036
    assumption is of the form "w : set ws" and the method "cases w"
blanchet@57990
  1037
    is invoked). The solution is to specify the case rule explicitly
blanchet@57990
  1038
    (e.g. "cases w rule: widget.exhaust").
blanchet@57990
  1039
    INCOMPATIBILITY.
blanchet@59675
  1040
  - Renamed theories:
blanchet@59675
  1041
      BNF_Comp ~> BNF_Composition
blanchet@59675
  1042
      BNF_FP_Base ~> BNF_Fixpoint_Base
blanchet@59675
  1043
      BNF_GFP ~> BNF_Greatest_Fixpoint
blanchet@59675
  1044
      BNF_LFP ~> BNF_Least_Fixpoint
blanchet@59675
  1045
      BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions
blanchet@59675
  1046
      Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions
blanchet@59675
  1047
    INCOMPATIBILITY.
wenzelm@60114
  1048
  - Lifting and Transfer setup for basic HOL types sum and prod (also
wenzelm@60114
  1049
    option) is now performed by the BNF package. Theories Lifting_Sum,
wenzelm@60114
  1050
    Lifting_Product and Lifting_Option from Main became obsolete and
wenzelm@60114
  1051
    were removed. Changed definitions of the relators rel_prod and
wenzelm@60114
  1052
    rel_sum (using inductive).
traytel@60111
  1053
    INCOMPATIBILITY: use rel_prod.simps and rel_sum.simps instead
wenzelm@60114
  1054
    of rel_prod_def and rel_sum_def.
wenzelm@60114
  1055
    Minor INCOMPATIBILITY: (rarely used by name) transfer theorem names
wenzelm@60114
  1056
    changed (e.g. map_prod_transfer ~> prod.map_transfer).
wenzelm@60261
  1057
  - Parametricity theorems for map functions, relators, set functions,
wenzelm@60261
  1058
    constructors, case combinators, discriminators, selectors and
wenzelm@60261
  1059
    (co)recursors are automatically proved and registered as transfer
wenzelm@60261
  1060
    rules.
blanchet@57983
  1061
blanchet@57983
  1062
* Old datatype package:
blanchet@58310
  1063
  - The old 'datatype' command has been renamed 'old_datatype', and
blanchet@58373
  1064
    'rep_datatype' has been renamed 'old_rep_datatype'. They are
blanchet@58373
  1065
    provided by "~~/src/HOL/Library/Old_Datatype.thy". See
blanchet@58310
  1066
    'isabelle doc datatypes' for information on porting.
blanchet@58373
  1067
    INCOMPATIBILITY.
blanchet@57983
  1068
  - Renamed theorems:
blanchet@57983
  1069
      weak_case_cong ~> case_cong_weak
blanchet@57983
  1070
    INCOMPATIBILITY.
blanchet@58373
  1071
  - Renamed theory:
blanchet@58373
  1072
      ~~/src/HOL/Datatype.thy ~> ~~/src/HOL/Library/Old_Datatype.thy
blanchet@58373
  1073
    INCOMPATIBILITY.
blanchet@57983
  1074
blanchet@59039
  1075
* Nitpick:
wenzelm@60010
  1076
  - Fixed soundness bug related to the strict and non-strict subset
blanchet@59039
  1077
    operations.
blanchet@59039
  1078
blanchet@57737
  1079
* Sledgehammer:
blanchet@59511
  1080
  - CVC4 is now included with Isabelle instead of CVC3 and run by
blanchet@59511
  1081
    default.
blanchet@59965
  1082
  - Z3 is now always enabled by default, now that it is fully open
blanchet@59965
  1083
    source. The "z3_non_commercial" option is discontinued.
blanchet@57737
  1084
  - Minimization is now always enabled by default.
wenzelm@60010
  1085
    Removed sub-command:
blanchet@57737
  1086
      min
blanchet@59967
  1087
  - Proof reconstruction, both one-liners and Isar, has been
blanchet@59039
  1088
    dramatically improved.
blanchet@59039
  1089
  - Improved support for CVC4 and veriT.
blanchet@57737
  1090
blanchet@58062
  1091
* Old and new SMT modules:
blanchet@58067
  1092
  - The old 'smt' method has been renamed 'old_smt' and moved to
wenzelm@59569
  1093
    'src/HOL/Library/Old_SMT.thy'. It is provided for compatibility,
wenzelm@59569
  1094
    until applications have been ported to use the new 'smt' method. For
wenzelm@59569
  1095
    the method to work, an older version of Z3 (e.g. Z3 3.2 or 4.0) must
wenzelm@59569
  1096
    be installed, and the environment variable "OLD_Z3_SOLVER" must
wenzelm@59569
  1097
    point to it.
blanchet@58062
  1098
    INCOMPATIBILITY.
blanchet@58067
  1099
  - The 'smt2' method has been renamed 'smt'.
blanchet@58060
  1100
    INCOMPATIBILITY.
wenzelm@59569
  1101
  - New option 'smt_reconstruction_step_timeout' to limit the
wenzelm@59569
  1102
    reconstruction time of Z3 proof steps in the new 'smt' method.
boehmes@59216
  1103
  - New option 'smt_statistics' to display statistics of the new 'smt'
boehmes@59216
  1104
    method, especially runtime statistics of Z3 proof reconstruction.
blanchet@58060
  1105
wenzelm@60261
  1106
* Lifting: command 'lift_definition' allows to execute lifted constants
wenzelm@60261
  1107
that have as a return type a datatype containing a subtype. This
wenzelm@60261
  1108
overcomes long-time limitations in the area of code generation and
wenzelm@60261
  1109
lifting, and avoids tedious workarounds.
kuncar@60258
  1110
wenzelm@60009
  1111
* Command and antiquotation "value" provide different evaluation slots
wenzelm@60009
  1112
(again), where the previous strategy (NBE after ML) serves as default.
wenzelm@60009
  1113
Minor INCOMPATIBILITY.
wenzelm@60009
  1114
wenzelm@60009
  1115
* Add NO_MATCH-simproc, allows to check for syntactic non-equality.
wenzelm@60009
  1116
wenzelm@60009
  1117
* field_simps: Use NO_MATCH-simproc for distribution rules, to avoid
wenzelm@60009
  1118
non-termination in case of distributing a division. With this change
wenzelm@60009
  1119
field_simps is in some cases slightly less powerful, if it fails try to
wenzelm@60009
  1120
add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.
wenzelm@60009
  1121
wenzelm@60009
  1122
* Separate class no_zero_divisors has been given up in favour of fully
wenzelm@60009
  1123
algebraic semiring_no_zero_divisors. INCOMPATIBILITY.
wenzelm@60009
  1124
wenzelm@60009
  1125
* Class linordered_semidom really requires no zero divisors.
wenzelm@60009
  1126
INCOMPATIBILITY.
wenzelm@60009
  1127
wenzelm@60009
  1128
* Classes division_ring, field and linordered_field always demand
wenzelm@60009
  1129
"inverse 0 = 0". Given up separate classes division_ring_inverse_zero,
wenzelm@60009
  1130
field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.
wenzelm@60009
  1131
wenzelm@60009
  1132
* Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit
wenzelm@60009
  1133
additive inverse operation. INCOMPATIBILITY.
wenzelm@60009
  1134
lp15@60020
  1135
* Complex powers and square roots. The functions "ln" and "powr" are now
wenzelm@60025
  1136
overloaded for types real and complex, and 0 powr y = 0 by definition.
wenzelm@60025
  1137
INCOMPATIBILITY: type constraints may be necessary.
lp15@60020
  1138
wenzelm@60009
  1139
* The functions "sin" and "cos" are now defined for any type of sort
wenzelm@60009
  1140
"{real_normed_algebra_1,banach}" type, so in particular on "real" and
wenzelm@60009
  1141
"complex" uniformly. Minor INCOMPATIBILITY: type constraints may be
wenzelm@60009
  1142
needed.
wenzelm@60009
  1143
wenzelm@60009
  1144
* New library of properties of the complex transcendental functions sin,
wenzelm@60009
  1145
cos, tan, exp, Ln, Arctan, Arcsin, Arccos. Ported from HOL Light.
wenzelm@60009
  1146
wenzelm@60009
  1147
* The factorial function, "fact", now has type "nat => 'a" (of a sort
wenzelm@60009
  1148
that admits numeric types including nat, int, real and complex.
wenzelm@60009
  1149
INCOMPATIBILITY: an expression such as "fact 3 = 6" may require a type
wenzelm@60009
  1150
constraint, and the combination "real (fact k)" is likely to be
wenzelm@60009
  1151
unsatisfactory. If a type conversion is still necessary, then use
wenzelm@60009
  1152
"of_nat (fact k)" or "real_of_nat (fact k)".
wenzelm@60009
  1153
wenzelm@60009
  1154
* Removed functions "natfloor" and "natceiling", use "nat o floor" and
wenzelm@60009
  1155
"nat o ceiling" instead. A few of the lemmas have been retained and
wenzelm@60009
  1156
adapted: in their names "natfloor"/"natceiling" has been replaced by
wenzelm@60009
  1157
"nat_floor"/"nat_ceiling".
wenzelm@60009
  1158
wenzelm@60009
  1159
* Qualified some duplicated fact names required for boostrapping the
wenzelm@60009
  1160
type class hierarchy:
wenzelm@60009
  1161
  ab_add_uminus_conv_diff ~> diff_conv_add_uminus
wenzelm@60009
  1162
  field_inverse_zero ~> inverse_zero
wenzelm@60009
  1163
  field_divide_inverse ~> divide_inverse
wenzelm@60009
  1164
  field_inverse ~> left_inverse
wenzelm@60009
  1165
Minor INCOMPATIBILITY.
wenzelm@60009
  1166
wenzelm@60009
  1167
* Eliminated fact duplicates:
wenzelm@60009
  1168
  mult_less_imp_less_right ~> mult_right_less_imp_less
wenzelm@60009
  1169
  mult_less_imp_less_left ~> mult_left_less_imp_less
wenzelm@60009
  1170
Minor INCOMPATIBILITY.
wenzelm@60009
  1171
wenzelm@60009
  1172
* Fact consolidation: even_less_0_iff is subsumed by
wenzelm@60009
  1173
double_add_less_zero_iff_single_add_less_zero (simp by default anyway).
wenzelm@60009
  1174
wenzelm@60009
  1175
* Generalized and consolidated some theorems concerning divsibility:
wenzelm@60009
  1176
  dvd_reduce ~> dvd_add_triv_right_iff
wenzelm@60009
  1177
  dvd_plus_eq_right ~> dvd_add_right_iff
wenzelm@60009
  1178
  dvd_plus_eq_left ~> dvd_add_left_iff
wenzelm@60009
  1179
Minor INCOMPATIBILITY.
wenzelm@60009
  1180
wenzelm@60009
  1181
* "even" and "odd" are mere abbreviations for "2 dvd _" and "~ 2 dvd _"
wenzelm@60009
  1182
and part of theory Main.
wenzelm@60009
  1183
  even_def ~> even_iff_mod_2_eq_zero
wenzelm@60009
  1184
INCOMPATIBILITY.
wenzelm@60009
  1185
wenzelm@60009
  1186
* Lemma name consolidation: divide_Numeral1 ~> divide_numeral_1. Minor
wenzelm@60009
  1187
INCOMPATIBILITY.
wenzelm@60009
  1188
wenzelm@60009
  1189
* Bootstrap of listsum as special case of abstract product over lists.
wenzelm@60009
  1190
Fact rename:
wenzelm@60009
  1191
    listsum_def ~> listsum.eq_foldr
wenzelm@60009
  1192
INCOMPATIBILITY.
wenzelm@60009
  1193
wenzelm@60009
  1194
* Product over lists via constant "listprod".
wenzelm@60009
  1195
wenzelm@60009
  1196
* Theory List: renamed drop_Suc_conv_tl and nth_drop' to
wenzelm@60009
  1197
Cons_nth_drop_Suc.
nipkow@58247
  1198
Andreas@58626
  1199
* New infrastructure for compiling, running, evaluating and testing
wenzelm@59569
  1200
generated code in target languages in HOL/Library/Code_Test. See
wenzelm@59569
  1201
HOL/Codegenerator_Test/Code_Test* for examples.
wenzelm@58008
  1202
wenzelm@60009
  1203
* Library/Multiset:
blanchet@59813
  1204
  - Introduced "replicate_mset" operation.
blanchet@59813
  1205
  - Introduced alternative characterizations of the multiset ordering in
blanchet@59813
  1206
    "Library/Multiset_Order".
blanchet@59958
  1207
  - Renamed multiset ordering:
blanchet@59958
  1208
      <# ~> #<#
blanchet@59958
  1209
      <=# ~> #<=#
blanchet@59958
  1210
      \<subset># ~> #\<subset>#
blanchet@59958
  1211
      \<subseteq># ~> #\<subseteq>#
blanchet@59958
  1212
    INCOMPATIBILITY.
blanchet@59986
  1213
  - Introduced abbreviations for ill-named multiset operations:
blanchet@59986
  1214
      <#, \<subset># abbreviate < (strict subset)
blanchet@59986
  1215
      <=#, \<le>#, \<subseteq># abbreviate <= (subset or equal)
blanchet@59986
  1216
    INCOMPATIBILITY.
blanchet@59813
  1217
  - Renamed
blanchet@59813
  1218
      in_multiset_of ~> in_multiset_in_set
nipkow@59998
  1219
      Multiset.fold ~> fold_mset
nipkow@59998
  1220
      Multiset.filter ~> filter_mset
blanchet@59813
  1221
    INCOMPATIBILITY.
nipkow@59949
  1222
  - Removed mcard, is equal to size.
blanchet@59813
  1223
  - Added attributes:
blanchet@59813
  1224
      image_mset.id [simp]
blanchet@59813
  1225
      image_mset_id [simp]
blanchet@59813
  1226
      elem_multiset_of_set [simp, intro]
blanchet@59813
  1227
      comp_fun_commute_plus_mset [simp]
blanchet@59813
  1228
      comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]
blanchet@59813
  1229
      in_mset_fold_plus_iff [iff]
blanchet@59813
  1230
      set_of_Union_mset [simp]
blanchet@59813
  1231
      in_Union_mset_iff [iff]
blanchet@59813
  1232
    INCOMPATIBILITY.
blanchet@59813
  1233
wenzelm@60009
  1234
* Library/Sum_of_Squares: simplified and improved "sos" method. Always
wenzelm@60009
  1235
use local CSDP executable, which is much faster than the NEOS server.
wenzelm@60009
  1236
The "sos_cert" functionality is invoked as "sos" with additional
wenzelm@60009
  1237
argument. Minor INCOMPATIBILITY.
wenzelm@60009
  1238
wenzelm@60009
  1239
* HOL-Decision_Procs: New counterexample generator quickcheck
wenzelm@60009
  1240
[approximation] for inequalities of transcendental functions. Uses
wenzelm@60009
  1241
hardware floating point arithmetic to randomly discover potential
wenzelm@60010
  1242
counterexamples. Counterexamples are certified with the "approximation"
wenzelm@60009
  1243
method. See HOL/Decision_Procs/ex/Approximation_Quickcheck_Ex.thy for
wenzelm@60009
  1244
examples.
immler@58990
  1245
eberlm@62201
  1246
* HOL-Decision_Procs: The "approximation" method works with "powr" 
eberlm@62201
  1247
  (exponentiation on real numbers) again.
eberlm@62201
  1248
hoelzl@59354
  1249
* HOL-Probability: Reworked measurability prover
wenzelm@60010
  1250
  - applies destructor rules repeatedly
hoelzl@59354
  1251
  - removed application splitting (replaced by destructor rule)
wenzelm@59569
  1252
  - added congruence rules to rewrite measure spaces under the sets
wenzelm@59569
  1253
    projection
wenzelm@59569
  1254
wenzelm@60009
  1255
* New proof method "rewrite" (in theory ~~/src/HOL/Library/Rewrite) for
wenzelm@60009
  1256
single-step rewriting with subterm selection based on patterns.
wenzelm@60009
  1257
wenzelm@58630
  1258
blanchet@58066
  1259
*** ML ***
blanchet@58066
  1260
wenzelm@60009
  1261
* Subtle change of name space policy: undeclared entries are now
wenzelm@60009
  1262
considered inaccessible, instead of accessible via the fully-qualified
wenzelm@60009
  1263
internal name. This mainly affects Name_Space.intern (and derivatives),
wenzelm@60009
  1264
which may produce an unexpected Long_Name.hidden prefix. Note that
wenzelm@60010
  1265
contemporary applications use the strict Name_Space.check (and
wenzelm@60009
  1266
derivatives) instead, which is not affected by the change. Potential
wenzelm@60009
  1267
INCOMPATIBILITY in rare applications of Name_Space.intern.
wenzelm@59951
  1268
wenzelm@60094
  1269
* Subtle change of error semantics of Toplevel.proof_of: regular user
wenzelm@60094
  1270
ERROR instead of internal Toplevel.UNDEF.
wenzelm@60094
  1271
wenzelm@59951
  1272
* Basic combinators map, fold, fold_map, split_list, apply are available
wenzelm@59951
  1273
as parameterized antiquotations, e.g. @{map 4} for lists of quadruples.
wenzelm@59951
  1274
wenzelm@59951
  1275
* Renamed "pairself" to "apply2", in accordance to @{apply 2}.
wenzelm@59951
  1276
INCOMPATIBILITY.
wenzelm@59951
  1277
wenzelm@59951
  1278
* Former combinators NAMED_CRITICAL and CRITICAL for central critical
wenzelm@59951
  1279
sections have been discontinued, in favour of the more elementary
wenzelm@59951
  1280
Multithreading.synchronized and its high-level derivative
wenzelm@59951
  1281
Synchronized.var (which is usually sufficient in applications). Subtle
wenzelm@59951
  1282
INCOMPATIBILITY: synchronized access needs to be atomic and cannot be
wenzelm@59951
  1283
nested.
wenzelm@59951
  1284
wenzelm@60009
  1285
* Synchronized.value (ML) is actually synchronized (as in Scala): subtle
wenzelm@60009
  1286
change of semantics with minimal potential for INCOMPATIBILITY.
wenzelm@59899
  1287
wenzelm@59621
  1288
* The main operations to certify logical entities are Thm.ctyp_of and
wenzelm@59621
  1289
Thm.cterm_of with a local context; old-style global theory variants are
wenzelm@59621
  1290
available as Thm.global_ctyp_of and Thm.global_cterm_of.
wenzelm@59621
  1291
INCOMPATIBILITY.
wenzelm@59621
  1292
wenzelm@59582
  1293
* Elementary operations in module Thm are no longer pervasive.
wenzelm@59582
  1294
INCOMPATIBILITY, need to use qualified Thm.prop_of, Thm.cterm_of,
wenzelm@59582
  1295
Thm.term_of etc.
wenzelm@59582
  1296
wenzelm@58963
  1297
* Proper context for various elementary tactics: assume_tac,
wenzelm@59498
  1298
resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,
wenzelm@59498
  1299
compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.
wenzelm@58956
  1300
blanchet@58066
  1301
* Tactical PARALLEL_ALLGOALS is the most common way to refer to
blanchet@58066
  1302
PARALLEL_GOALS.
blanchet@58066
  1303
wenzelm@59564
  1304
* Goal.prove_multi is superseded by the fully general Goal.prove_common,
wenzelm@59564
  1305
which also allows to specify a fork priority.
wenzelm@59564
  1306
wenzelm@59936
  1307
* Antiquotation @{command_spec "COMMAND"} is superseded by
wenzelm@59936
  1308
@{command_keyword COMMAND} (usually without quotes and with PIDE
wenzelm@59936
  1309
markup). Minor INCOMPATIBILITY.
wenzelm@59936
  1310
wenzelm@60009
  1311
* Cartouches within ML sources are turned into values of type
wenzelm@60009
  1312
Input.source (with formal position information).
wenzelm@60009
  1313
blanchet@58066
  1314
wenzelm@58610
  1315
*** System ***
wenzelm@58610
  1316
wenzelm@59951
  1317
* The Isabelle tool "update_cartouches" changes theory files to use
wenzelm@59951
  1318
cartouches instead of old-style {* verbatim *} or `alt_string` tokens.
wenzelm@59951
  1319
wenzelm@60106
  1320
* The Isabelle tool "build" provides new options -X, -k, -x.
wenzelm@59951
  1321
wenzelm@59951
  1322
* Discontinued old-fashioned "codegen" tool. Code generation can always
wenzelm@59951
  1323
be externally triggered using an appropriate ROOT file plus a
wenzelm@59951
  1324
corresponding theory. Parametrization is possible using environment
wenzelm@59951
  1325
variables, or ML snippets in the most extreme cases. Minor
wenzelm@59951
  1326
INCOMPATIBILITY.
wenzelm@58842
  1327
wenzelm@59200
  1328
* JVM system property "isabelle.threads" determines size of Scala thread
wenzelm@59200
  1329
pool, like Isabelle system option "threads" for ML.
wenzelm@59200
  1330
wenzelm@59201
  1331
* JVM system property "isabelle.laf" determines the default Swing
wenzelm@59201
  1332
look-and-feel, via internal class name or symbolic name as in the jEdit
wenzelm@59201
  1333
menu Global Options / Appearance.
wenzelm@59201
  1334
wenzelm@59951
  1335
* Support for Proof General and Isar TTY loop has been discontinued.
wenzelm@60009
  1336
Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.
wenzelm@59891
  1337
wenzelm@58610
  1338
wenzelm@57695
  1339
wenzelm@57452
  1340
New in Isabelle2014 (August 2014)
wenzelm@57452
  1341
---------------------------------
wenzelm@54055
  1342
wenzelm@54702
  1343
*** General ***
wenzelm@54702
  1344
wenzelm@57452
  1345
* Support for official Standard ML within the Isabelle context.
wenzelm@57452
  1346
Command 'SML_file' reads and evaluates the given Standard ML file.
wenzelm@57452
  1347
Toplevel bindings are stored within the theory context; the initial
wenzelm@57452
  1348
environment is restricted to the Standard ML implementation of
wenzelm@57452
  1349
Poly/ML, without the add-ons of Isabelle/ML.  Commands 'SML_import'
wenzelm@57452
  1350
and 'SML_export' allow to exchange toplevel bindings between the two
wenzelm@57452
  1351
separate environments.  See also ~~/src/Tools/SML/Examples.thy for
wenzelm@57452
  1352
some examples.
wenzelm@56499
  1353
wenzelm@57504
  1354
* Standard tactics and proof methods such as "clarsimp", "auto" and
wenzelm@57504
  1355
"safe" now preserve equality hypotheses "x = expr" where x is a free
wenzelm@57504
  1356
variable.  Locale assumptions and chained facts containing "x"
wenzelm@57504
  1357
continue to be useful.  The new method "hypsubst_thin" and the
wenzelm@57504
  1358
configuration option "hypsubst_thin" (within the attribute name space)
wenzelm@57504
  1359
restore the previous behavior.  INCOMPATIBILITY, especially where
wenzelm@57504
  1360
induction is done after these methods or when the names of free and
wenzelm@57504
  1361
bound variables clash.  As first approximation, old proofs may be
wenzelm@57504
  1362
repaired by "using [[hypsubst_thin = true]]" in the critical spot.
wenzelm@57504
  1363
wenzelm@56232
  1364
* More static checking of proof methods, which allows the system to
wenzelm@56232
  1365
form a closure over the concrete syntax.  Method arguments should be
wenzelm@56232
  1366
processed in the original proof context as far as possible, before
wenzelm@56232
  1367
operating on the goal state.  In any case, the standard discipline for
wenzelm@56232
  1368
subgoal-addressing needs to be observed: no subgoals or a subgoal
wenzelm@56232
  1369
number that is out of range produces an empty result sequence, not an
wenzelm@56232
  1370
exception.  Potential INCOMPATIBILITY for non-conformant tactical
wenzelm@56232
  1371
proof tools.
wenzelm@56232
  1372
wenzelm@57452
  1373
* Lexical syntax (inner and outer) supports text cartouches with
wenzelm@57452
  1374
arbitrary nesting, and without escapes of quotes etc.  The Prover IDE
wenzelm@57452
  1375
supports input via ` (backquote).
wenzelm@57452
  1376
wenzelm@57452
  1377
* The outer syntax categories "text" (for formal comments and document
wenzelm@57452
  1378
markup commands) and "altstring" (for literal fact references) allow
wenzelm@57452
  1379
cartouches as well, in addition to the traditional mix of quotations.
wenzelm@57452
  1380
wenzelm@57452
  1381
* Syntax of document antiquotation @{rail} now uses \<newline> instead
wenzelm@57452
  1382
of "\\", to avoid the optical illusion of escaped backslash within
wenzelm@57491
  1383
string token.  General renovation of its syntax using text cartouches.
wenzelm@57452
  1384
Minor INCOMPATIBILITY.
wenzelm@57452
  1385
wenzelm@57452
  1386
* Discontinued legacy_isub_isup, which was a temporary workaround for
wenzelm@57452
  1387
Isabelle/ML in Isabelle2013-1.  The prover process no longer accepts
wenzelm@57452
  1388
old identifier syntax with \<^isub> or \<^isup>.  Potential
wenzelm@57452
  1389
INCOMPATIBILITY.
wenzelm@57452
  1390
wenzelm@57452
  1391
* Document antiquotation @{url} produces markup for the given URL,
wenzelm@57452
  1392
which results in an active hyperlink within the text.
wenzelm@57452
  1393
wenzelm@57452
  1394
* Document antiquotation @{file_unchecked} is like @{file}, but does
wenzelm@57452
  1395
not check existence within the file-system.
wenzelm@57452
  1396
wenzelm@57452
  1397
* Updated and extended manuals: codegen, datatypes, implementation,
wenzelm@57452
  1398
isar-ref, jedit, system.
wenzelm@57423
  1399
wenzelm@54702
  1400
wenzelm@54533
  1401
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@54533
  1402
wenzelm@57650
  1403
* Improved Document panel: simplified interaction where every single
wenzelm@57452
  1404
mouse click (re)opens document via desktop environment or as jEdit
wenzelm@57452
  1405
buffer.
wenzelm@57452
  1406
wenzelm@57452
  1407
* Support for Navigator plugin (with toolbar buttons), with connection
wenzelm@57452
  1408
to PIDE hyperlinks.
wenzelm@57452
  1409
wenzelm@57452
  1410
* Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
wenzelm@57452
  1411
Open text buffers take precedence over copies within the file-system.
wenzelm@57452
  1412
wenzelm@57452
  1413
* Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
wenzelm@57452
  1414
auxiliary ML files.
wenzelm@57423
  1415
wenzelm@57423
  1416
* Improved syntactic and semantic completion mechanism, with simple
wenzelm@57423
  1417
templates, completion language context, name-space completion,
wenzelm@57423
  1418
file-name completion, spell-checker completion.
wenzelm@57423
  1419
wenzelm@57423
  1420
* Refined GUI popup for completion: more robust key/mouse event
wenzelm@57423
  1421
handling and propagation to enclosing text area -- avoid loosing
wenzelm@57423
  1422
keystrokes with slow / remote graphics displays.
wenzelm@57423
  1423
wenzelm@57833
  1424
* Completion popup supports both ENTER and TAB (default) to select an
wenzelm@57833
  1425
item, depending on Isabelle options.
wenzelm@57833
  1426
wenzelm@57423
  1427
* Refined insertion of completion items wrt. jEdit text: multiple
wenzelm@57423
  1428
selections, rectangular selections, rectangular selection as "tall
wenzelm@57423
  1429
caret".
wenzelm@56342
  1430
wenzelm@56580
  1431
* Integrated spell-checker for document text, comments etc. with
wenzelm@57423
  1432
completion popup and context-menu.
wenzelm@56554
  1433
wenzelm@56879
  1434
* More general "Query" panel supersedes "Find" panel, with GUI access
wenzelm@56879
  1435
to commands 'find_theorems' and 'find_consts', as well as print
wenzelm@56879
  1436
operations for the context.  Minor incompatibility in keyboard
wenzelm@56879
  1437
shortcuts etc.: replace action isabelle-find by isabelle-query.
wenzelm@56761
  1438
wenzelm@56901
  1439
* Search field for all output panels ("Output", "Query", "Info" etc.)
wenzelm@56901
  1440
to highlight text via regular expression.
wenzelm@56901
  1441
wenzelm@54881
  1442
* Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
wenzelm@54881
  1443
General") allows to specify additional print modes for the prover
wenzelm@54881
  1444
process, without requiring old-fashioned command-line invocation of
wenzelm@54881
  1445
"isabelle jedit -m MODE".
wenzelm@54881
  1446
wenzelm@56505
  1447
* More support for remote files (e.g. http) using standard Java
wenzelm@56505
  1448
networking operations instead of jEdit virtual file-systems.
wenzelm@56505
  1449
wenzelm@57822
  1450
* Empty editors buffers that are no longer required (e.g.\ via theory
wenzelm@57822
  1451
imports) are automatically removed from the document model.
wenzelm@57822
  1452
wenzelm@57869
  1453
* Improved monitor panel.
wenzelm@57869
  1454
wenzelm@56838
  1455
* Improved Console/Scala plugin: more uniform scala.Console output,
wenzelm@56838
  1456
more robust treatment of threads and interrupts.
wenzelm@56838
  1457
wenzelm@56939
  1458
* Improved management of dockable windows: clarified keyboard focus
wenzelm@56939
  1459
and window placement wrt. main editor view; optional menu item to
wenzelm@56939
  1460
"Detach" a copy where this makes sense.
wenzelm@56939
  1461
wenzelm@57452
  1462
* New Simplifier Trace panel provides an interactive view of the
wenzelm@57591
  1463
simplification process, enabled by the "simp_trace_new" attribute
wenzelm@57452
  1464
within the context.
wenzelm@57452
  1465
wenzelm@57452
  1466
wenzelm@55001
  1467
*** Pure ***
wenzelm@55001
  1468
wenzelm@57504
  1469
* Low-level type-class commands 'classes', 'classrel', 'arities' have
wenzelm@57504
  1470
been discontinued to avoid the danger of non-trivial axiomatization
wenzelm@57504
  1471
that is not immediately visible.  INCOMPATIBILITY, use regular
wenzelm@57504
  1472
'instance' command with proof.  The required OFCLASS(...) theorem
wenzelm@57504
  1473
might be postulated via 'axiomatization' beforehand, or the proof
wenzelm@57504
  1474
finished trivially if the underlying class definition is made vacuous
wenzelm@57504
  1475
(without any assumptions).  See also Isabelle/ML operations
wenzelm@57504
  1476
Axclass.class_axiomatization, Axclass.classrel_axiomatization,
wenzelm@57504
  1477
Axclass.arity_axiomatization.
wenzelm@57504
  1478
wenzelm@56245
  1479
* Basic constants of Pure use more conventional names and are always
wenzelm@56245
  1480
qualified.  Rare INCOMPATIBILITY, but with potentially serious
wenzelm@56245
  1481
consequences, notably for tools in Isabelle/ML.  The following
wenzelm@56245
  1482
renaming needs to be applied:
wenzelm@56245
  1483
wenzelm@56245
  1484
  ==             ~>  Pure.eq
wenzelm@56245
  1485
  ==>            ~>  Pure.imp
wenzelm@56245
  1486
  all            ~>  Pure.all
wenzelm@56245
  1487
  TYPE           ~>  Pure.type
wenzelm@56245
  1488
  dummy_pattern  ~>  Pure.dummy_pattern
wenzelm@56245
  1489
wenzelm@56245
  1490
Systematic porting works by using the following theory setup on a
wenzelm@56245
  1491
*previous* Isabelle version to introduce the new name accesses for the
wenzelm@56245
  1492
old constants:
wenzelm@56245
  1493
wenzelm@56245
  1494
setup {*
wenzelm@56245
  1495
  fn thy => thy
wenzelm@56245
  1496
    |> Sign.root_path
wenzelm@56245
  1497
    |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
wenzelm@56245
  1498
    |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
wenzelm@56245
  1499
    |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
wenzelm@56245
  1500
    |> Sign.restore_naming thy
wenzelm@56245
  1501
*}
wenzelm@56245
  1502
wenzelm@56245
  1503
Thus ML antiquotations like @{const_name Pure.eq} may be used already.
wenzelm@56245
  1504
Later the application is moved to the current Isabelle version, and
wenzelm@56245
  1505
the auxiliary aliases are deleted.
wenzelm@56245
  1506
wenzelm@55143
  1507
* Attributes "where" and "of" allow an optional context of local
wenzelm@55143
  1508
variables ('for' declaration): these variables become schematic in the
wenzelm@55143
  1509
instantiated theorem.
wenzelm@55143
  1510
wenzelm@55152
  1511
* Obsolete attribute "standard" has been discontinued (legacy since
wenzelm@55152
  1512
Isabelle2012).  Potential INCOMPATIBILITY, use explicit 'for' context
wenzelm@55152
  1513
where instantiations with schematic variables are intended (for
wenzelm@55152
  1514
declaration commands like 'lemmas' or attributes like "of").  The
wenzelm@55152
  1515
following temporary definition may help to port old applications:
wenzelm@55152
  1516
wenzelm@55152
  1517
  attribute_setup standard =
wenzelm@55152
  1518
    "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
wenzelm@55152
  1519
wenzelm@55001
  1520
* More thorough check of proof context for goal statements and
wenzelm@55006
  1521
attributed fact expressions (concerning background theory, declared
wenzelm@55006
  1522
hyps).  Potential INCOMPATIBILITY, tools need to observe standard
wenzelm@55006
  1523
context discipline.  See also Assumption.add_assumes and the more
wenzelm@55006
  1524
primitive Thm.assume_hyps.
wenzelm@55001
  1525
wenzelm@55108
  1526
* Inner syntax token language allows regular quoted strings "..."
wenzelm@55108
  1527
(only makes sense in practice, if outer syntax is delimited
wenzelm@57452
  1528
differently, e.g. via cartouches).
wenzelm@57452
  1529
wenzelm@57504
  1530
* Command 'print_term_bindings' supersedes 'print_binds' for clarity,
wenzelm@57504
  1531
but the latter is retained some time as Proof General legacy.
wenzelm@57504
  1532
wenzelm@57452
  1533
* Code generator preprocessor: explicit control of simp tracing on a
wenzelm@57452
  1534
per-constant basis.  See attribute "code_preproc".
haftmann@57430
  1535
wenzelm@55001
  1536
haftmann@54227
  1537
*** HOL ***
haftmann@54227
  1538
wenzelm@57504
  1539
* Code generator: enforce case of identifiers only for strict target
wenzelm@57504
  1540
language requirements.  INCOMPATIBILITY.
wenzelm@57504
  1541
wenzelm@57504
  1542
* Code generator: explicit proof contexts in many ML interfaces.
wenzelm@57504
  1543
INCOMPATIBILITY.
wenzelm@57504
  1544
wenzelm@57504
  1545
* Code generator: minimize exported identifiers by default.  Minor
wenzelm@57504
  1546
INCOMPATIBILITY.
wenzelm@57504
  1547
wenzelm@57504
  1548
* Code generation for SML and OCaml: dropped arcane "no_signatures"
wenzelm@57504
  1549
option.  Minor INCOMPATIBILITY.
wenzelm@57504
  1550
wenzelm@57504
  1551
* "declare [[code abort: ...]]" replaces "code_abort ...".
wenzelm@57504
  1552
INCOMPATIBILITY.
wenzelm@57504
  1553
wenzelm@57504
  1554
* "declare [[code drop: ...]]" drops all code equations associated
wenzelm@57504
  1555
with the given constants.
wenzelm@57504
  1556
wenzelm@57504
  1557
* Code generations are provided for make, fields, extend and truncate
wenzelm@57504
  1558
operations on records.
haftmann@57437
  1559
wenzelm@57452
  1560
* Command and antiquotation "value" are now hardcoded against nbe and
wenzelm@57452
  1561
ML.  Minor INCOMPATIBILITY.
wenzelm@57452
  1562
wenzelm@57504
  1563
* Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.
wenzelm@57504
  1564
wenzelm@57504
  1565
* The symbol "\<newline>" may be used within char or string literals
wenzelm@57504
  1566
to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
wenzelm@57504
  1567
wenzelm@57504
  1568
* Qualified String.implode and String.explode.  INCOMPATIBILITY.
haftmann@56923
  1569
wenzelm@57452
  1570
* Simplifier: Enhanced solver of preconditions of rewrite rules can
wenzelm@57452
  1571
now deal with conjunctions.  For help with converting proofs, the old
wenzelm@57452
  1572
behaviour of the simplifier can be restored like this: declare/using
wenzelm@57452
  1573
[[simp_legacy_precond]].  This configuration option will disappear
wenzelm@57452
  1574
again in the future.  INCOMPATIBILITY.
nipkow@56073
  1575
wenzelm@55139
  1576
* Simproc "finite_Collect" is no longer enabled by default, due to
wenzelm@55139
  1577
spurious crashes and other surprises.  Potential INCOMPATIBILITY.
wenzelm@55139
  1578
wenzelm@57452
  1579
* Moved new (co)datatype package and its dependencies from session
wenzelm@57452
  1580
  "HOL-BNF" to "HOL".  The commands 'bnf', 'wrap_free_constructors',
wenzelm@57452
  1581
  'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now
wenzelm@57452
  1582
  part of theory "Main".
wenzelm@57452
  1583
blanchet@55098
  1584
  Theory renamings:
blanchet@55098
  1585
    FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
blanchet@55098
  1586
    Library/Wfrec.thy ~> Wfrec.thy
blanchet@55098
  1587
    Library/Zorn.thy ~> Zorn.thy
blanchet@55098
  1588
    Cardinals/Order_Relation.thy ~> Order_Relation.thy
blanchet@55098
  1589
    Library/Order_Union.thy ~> Cardinals/Order_Union.thy
blanchet@55098
  1590
    Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
blanchet@55098
  1591
    Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
blanchet@55098
  1592
    Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
blanchet@55098
  1593
    Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
blanchet@55098
  1594
    Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
blanchet@55098
  1595
    BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
blanchet@55098
  1596
    BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
blanchet@55098
  1597
    BNF/BNF_Comp.thy ~> BNF_Comp.thy
blanchet@55098
  1598
    BNF/BNF_Def.thy ~> BNF_Def.thy
blanchet@55098
  1599
    BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
blanchet@55098
  1600
    BNF/BNF_GFP.thy ~> BNF_GFP.thy
blanchet@55098
  1601
    BNF/BNF_LFP.thy ~> BNF_LFP.thy
blanchet@55098
  1602
    BNF/BNF_Util.thy ~> BNF_Util.thy
blanchet@55098
  1603
    BNF/Coinduction.thy ~> Coinduction.thy
blanchet@55098
  1604
    BNF/More_BNFs.thy ~> Library/More_BNFs.thy
blanchet@55098
  1605
    BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
blanchet@55098
  1606
    BNF/Examples/* ~> BNF_Examples/*
wenzelm@57452
  1607
blanchet@55098
  1608
  New theories:
blanchet@55098
  1609
    Wellorder_Extension.thy (split from Zorn.thy)
blanchet@55098
  1610
    Library/Cardinal_Notations.thy
traytel@56942
  1611
    Library/BNF_Axomatization.thy
blanchet@55098
  1612
    BNF_Examples/Misc_Primcorec.thy
blanchet@55098
  1613
    BNF_Examples/Stream_Processor.thy
wenzelm@57452
  1614
blanchet@55519
  1615
  Discontinued theories:
blanchet@55098
  1616
    BNF/BNF.thy
blanchet@55098
  1617
    BNF/Equiv_Relations_More.thy
wenzelm@57452
  1618
wenzelm@57452
  1619
INCOMPATIBILITY.
blanchet@55098
  1620
blanchet@56118
  1621
* New (co)datatype package:
wenzelm@57452
  1622
  - Command 'primcorec' is fully implemented.
wenzelm@57452
  1623
  - Command 'datatype_new' generates size functions ("size_xxx" and
wenzelm@57452
  1624
    "size") as required by 'fun'.
wenzelm@57452
  1625
  - BNFs are integrated with the Lifting tool and new-style
wenzelm@57452
  1626
    (co)datatypes with Transfer.
wenzelm@57452
  1627
  - Renamed commands:
blanchet@55875
  1628
      datatype_new_compat ~> datatype_compat
blanchet@55875
  1629
      primrec_new ~> primrec
blanchet@55875
  1630
      wrap_free_constructors ~> free_constructors
blanchet@55875
  1631
    INCOMPATIBILITY.
wenzelm@57452
  1632
  - The generated constants "xxx_case" and "xxx_rec" have been renamed
blanchet@55875
  1633
    "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
blanchet@55875
  1634
    INCOMPATIBILITY.
wenzelm@57452
  1635
  - The constant "xxx_(un)fold" and related theorems are no longer
wenzelm@57452
  1636
    generated.  Use "xxx_(co)rec" or define "xxx_(un)fold" manually
wenzelm@57452
  1637
    using "prim(co)rec".
blanchet@55875
  1638
    INCOMPATIBILITY.
wenzelm@57452
  1639
  - No discriminators are generated for nullary constructors by
wenzelm@57452
  1640
    default, eliminating the need for the odd "=:" syntax.
blanchet@57091
  1641
    INCOMPATIBILITY.
wenzelm@57452
  1642
  - No discriminators or selectors are generated by default by
blanchet@57094
  1643
    "datatype_new", unless custom names are specified or the new
blanchet@57094
  1644
    "discs_sels" option is passed.
blanchet@57094
  1645
    INCOMPATIBILITY.
blanchet@55875
  1646
blanchet@55643
  1647
* Old datatype package:
wenzelm@57452
  1648
  - The generated theorems "xxx.cases" and "xxx.recs" have been
wenzelm@57452
  1649
    renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->
wenzelm@57452
  1650
    "sum.case").  INCOMPATIBILITY.
wenzelm@57452
  1651
  - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have
wenzelm@57452
  1652
    been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,
wenzelm@57452
  1653
    "prod_case" ~> "case_prod").  INCOMPATIBILITY.
wenzelm@57452
  1654
wenzelm@57452
  1655
* The types "'a list" and "'a option", their set and map functions,
wenzelm@57452
  1656
  their relators, and their selectors are now produced using the new
wenzelm@57452
  1657
  BNF-based datatype package.
wenzelm@57452
  1658
blanchet@55519
  1659
  Renamed constants:
blanchet@55519
  1660
    Option.set ~> set_option
blanchet@55519
  1661
    Option.map ~> map_option
blanchet@55525
  1662
    option_rel ~> rel_option
wenzelm@57452
  1663
blanchet@55519
  1664
  Renamed theorems:
blanchet@55585
  1665
    set_def ~> set_rec[abs_def]
blanchet@55519
  1666
    map_def ~> map_rec[abs_def]
blanchet@55519
  1667
    Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
blanchet@56652
  1668
    option.recs ~> option.rec
blanchet@55524
  1669
    list_all2_def ~> list_all2_iff
blanchet@55585
  1670
    set.simps ~> set_simps (or the slightly different "list.set")
blanchet@55519
  1671
    map.simps ~> list.map
blanchet@55519
  1672
    hd.simps ~> list.sel(1)
blanchet@55519
  1673
    tl.simps ~> list.sel(2-3)
blanchet@55519
  1674
    the.simps ~> option.sel
wenzelm@57452
  1675
wenzelm@57452
  1676
INCOMPATIBILITY.
blanchet@55519
  1677
blanchet@55933
  1678
* The following map functions and relators have been renamed:
blanchet@55939
  1679
    sum_map ~> map_sum
blanchet@55939
  1680
    map_pair ~> map_prod
blanchet@55944
  1681
    prod_rel ~> rel_prod
blanchet@55943
  1682
    sum_rel ~> rel_sum
blanchet@55945
  1683
    fun_rel ~> rel_fun
blanchet@55942
  1684
    set_rel ~> rel_set
blanchet@55942
  1685
    filter_rel ~> rel_filter
wenzelm@57452
  1686
    fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")
wenzelm@57452
  1687
    cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")
wenzelm@57452
  1688
    vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")
wenzelm@57452
  1689
wenzelm@57452
  1690
INCOMPATIBILITY.
wenzelm@57452
  1691
kuncar@57826
  1692
* Lifting and Transfer:
kuncar@57826
  1693
  - a type variable as a raw type is supported
kuncar@57826
  1694
  - stronger reflexivity prover
kuncar@57826
  1695
  - rep_eq is always generated by lift_definition
wenzelm@57856
  1696
  - setup for Lifting/Transfer is now automated for BNFs
kuncar@57826
  1697
    + holds for BNFs that do not contain a dead variable
wenzelm@57856
  1698
    + relator_eq, relator_mono, relator_distr, relator_domain,
kuncar@57826
  1699
      relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,
kuncar@57826
  1700
      right_unique, right_total, left_unique, left_total are proved
kuncar@57826
  1701
      automatically
kuncar@57826
  1702
    + definition of a predicator is generated automatically
kuncar@57826
  1703
    + simplification rules for a predicator definition are proved
kuncar@57826
  1704
      automatically for datatypes
kuncar@57826
  1705
  - consolidation of the setup of Lifting/Transfer
wenzelm@57856
  1706
    + property that a relator preservers reflexivity is not needed any
kuncar@57826
  1707
      more
kuncar@57826
  1708
      Minor INCOMPATIBILITY.
wenzelm@57856
  1709
    + left_total and left_unique rules are now transfer rules
kuncar@57826
  1710
      (reflexivity_rule attribute not needed anymore)
kuncar@57826
  1711
      INCOMPATIBILITY.
wenzelm@57856
  1712
    + Domainp does not have to be a separate assumption in
kuncar@57826
  1713
      relator_domain theorems (=> more natural statement)
kuncar@57826
  1714
      INCOMPATIBILITY.
kuncar@57826
  1715
  - registration of code equations is more robust
kuncar@57826
  1716
    Potential INCOMPATIBILITY.
kuncar@57826
  1717
  - respectfulness proof obligation is preprocessed to a more readable
kuncar@57826
  1718
    form
kuncar@57826
  1719
    Potential INCOMPATIBILITY.
kuncar@57826
  1720
  - eq_onp is always unfolded in respectfulness proof obligation
kuncar@57826
  1721
    Potential INCOMPATIBILITY.
wenzelm@57856
  1722
  - unregister lifting setup for Code_Numeral.integer and
kuncar@57826
  1723
    Code_Numeral.natural
kuncar@57826
  1724
    Potential INCOMPATIBILITY.
kuncar@57826
  1725
  - Lifting.invariant -> eq_onp
kuncar@57826
  1726
    INCOMPATIBILITY.
wenzelm@57856
  1727
wenzelm@57508
  1728
* New internal SAT solver "cdclite" that produces models and proof
wenzelm@57508
  1729
traces.  This solver replaces the internal SAT solvers "enumerate" and
wenzelm@57508
  1730
"dpll".  Applications that explicitly used one of these two SAT
wenzelm@57508
  1731
solvers should use "cdclite" instead. In addition, "cdclite" is now
wenzelm@57508
  1732
the default SAT solver for the "sat" and "satx" proof methods and
wenzelm@57508
  1733
corresponding tactics; the old default can be restored using "declare
wenzelm@57508
  1734
[[sat_solver = zchaff_with_proofs]]".  Minor INCOMPATIBILITY.
wenzelm@57508
  1735
wenzelm@57508
  1736
* SMT module: A new version of the SMT module, temporarily called
wenzelm@57508
  1737
"SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,
wenzelm@57508
  1738
4.3). The new proof method is called "smt2". CVC3 and CVC4 are also
wenzelm@57508
  1739
supported as oracles. Yices is no longer supported, because no version
wenzelm@57508
  1740
of the solver can handle both SMT-LIB 2 and quantifiers.
wenzelm@57508
  1741
wenzelm@57508
  1742
* Activation of Z3 now works via "z3_non_commercial" system option
wenzelm@57508
  1743
(without requiring restart), instead of former settings variable
wenzelm@57508
  1744
"Z3_NON_COMMERCIAL".  The option can be edited in Isabelle/jEdit menu
wenzelm@57508
  1745
Plugin Options / Isabelle / General.
wenzelm@57508
  1746
wenzelm@57508
  1747
* Sledgehammer:
wenzelm@57508
  1748
  - Z3 can now produce Isar proofs.
wenzelm@57508
  1749
  - MaSh overhaul:
blanchet@57532
  1750
    . New SML-based learning algorithms eliminate the dependency on
wenzelm@57508
  1751
      Python and increase performance and reliability.
wenzelm@57508
  1752
    . MaSh and MeSh are now used by default together with the
wenzelm@57508
  1753
      traditional MePo (Meng-Paulson) relevance filter. To disable
wenzelm@57508
  1754
      MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin
wenzelm@57508
  1755
      Options / Isabelle / General to "none".
wenzelm@57508
  1756
  - New option:
wenzelm@57508
  1757
      smt_proofs
wenzelm@57508
  1758
  - Renamed options:
wenzelm@57508
  1759
      isar_compress ~> compress
wenzelm@57508
  1760
      isar_try0 ~> try0
wenzelm@57508
  1761
wenzelm@57508
  1762
INCOMPATIBILITY.
wenzelm@57508
  1763
wenzelm@57508
  1764
* Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
wenzelm@57508
  1765
wenzelm@57508
  1766
* Nitpick:
wenzelm@57508
  1767
  - Fixed soundness bug whereby mutually recursive datatypes could
wenzelm@57508
  1768
    take infinite values.
wenzelm@57508
  1769
  - Fixed soundness bug with low-level number functions such as
wenzelm@57508
  1770
    "Abs_Integ" and "Rep_Integ".
wenzelm@57508
  1771
  - Removed "std" option.
wenzelm@57508
  1772
  - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
wenzelm@57508
  1773
    "hide_types".
wenzelm@57508
  1774
wenzelm@57508
  1775
* Metis: Removed legacy proof method 'metisFT'. Use 'metis
wenzelm@57508
  1776
(full_types)' instead. INCOMPATIBILITY.
wenzelm@57508
  1777
wenzelm@57508
  1778
* Try0: Added 'algebra' and 'meson' to the set of proof methods.
wenzelm@57508
  1779
wenzelm@57508
  1780
* Adjustion of INF and SUP operations:
wenzelm@57508
  1781
  - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
wenzelm@57508
  1782
  - Consolidated theorem names containing INFI and SUPR: have INF and
wenzelm@57508
  1783
    SUP instead uniformly.
wenzelm@57508
  1784
  - More aggressive normalization of expressions involving INF and Inf
wenzelm@57508
  1785
    or SUP and Sup.
wenzelm@57508
  1786
  - INF_image and SUP_image do not unfold composition.
wenzelm@57508
  1787
  - Dropped facts INF_comp, SUP_comp.
wenzelm@57508
  1788
  - Default congruence rules strong_INF_cong and strong_SUP_cong, with
wenzelm@57508
  1789
    simplifier implication in premises.  Generalize and replace former
wenzelm@57508
  1790
    INT_cong, SUP_cong
wenzelm@57508
  1791
wenzelm@57508
  1792
INCOMPATIBILITY.
wenzelm@57508
  1793
wenzelm@57508
  1794
* SUP and INF generalized to conditionally_complete_lattice.
wenzelm@57508
  1795
wenzelm@57508
  1796
* Swapped orientation of facts image_comp and vimage_comp:
wenzelm@57508
  1797
wenzelm@57508
  1798
  image_compose ~> image_comp [symmetric]
wenzelm@57508
  1799
  image_comp ~> image_comp [symmetric]
wenzelm@57508
  1800
  vimage_compose ~> vimage_comp [symmetric]
wenzelm@57508
  1801
  vimage_comp ~> vimage_comp [symmetric]
wenzelm@57508
  1802
wenzelm@57508
  1803
INCOMPATIBILITY.
wenzelm@57508
  1804
wenzelm@57504
  1805
* Theory reorganization: split of Big_Operators.thy into
wenzelm@57504
  1806
Groups_Big.thy and Lattices_Big.thy.
blanchet@55098
  1807
haftmann@57418
  1808
* Consolidated some facts about big group operators:
haftmann@57418
  1809
haftmann@57418
  1810
    setsum_0' ~> setsum.neutral
haftmann@57418
  1811
    setsum_0 ~> setsum.neutral_const
haftmann@57418
  1812
    setsum_addf ~> setsum.distrib
haftmann@57418
  1813
    setsum_cartesian_product ~> setsum.cartesian_product
haftmann@57418
  1814
    setsum_cases ~> setsum.If_cases
haftmann@57418
  1815
    setsum_commute ~> setsum.commute
haftmann@57418
  1816
    setsum_cong ~> setsum.cong
haftmann@57418
  1817
    setsum_delta ~> setsum.delta
haftmann@57418
  1818
    setsum_delta' ~> setsum.delta'
haftmann@57418
  1819
    setsum_diff1' ~> setsum.remove
haftmann@57418
  1820
    setsum_empty ~> setsum.empty
haftmann@57418
  1821
    setsum_infinite ~> setsum.infinite
haftmann@57418
  1822
    setsum_insert ~> setsum.insert
haftmann@57418
  1823
    setsum_inter_restrict'' ~> setsum.inter_filter
haftmann@57418
  1824
    setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left
haftmann@57418
  1825
    setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right
haftmann@57418
  1826
    setsum_mono_zero_left ~> setsum.mono_neutral_left
haftmann@57418
  1827
    setsum_mono_zero_right ~> setsum.mono_neutral_right
haftmann@57418
  1828
    setsum_reindex ~> setsum.reindex
haftmann@57418
  1829
    setsum_reindex_cong ~> setsum.reindex_cong
haftmann@57418
  1830
    setsum_reindex_nonzero ~> setsum.reindex_nontrivial
haftmann@57418
  1831
    setsum_restrict_set ~> setsum.inter_restrict
haftmann@57418
  1832
    setsum_Plus ~> setsum.Plus
haftmann@57418
  1833
    setsum_setsum_restrict ~> setsum.commute_restrict
haftmann@57418
  1834
    setsum_Sigma ~> setsum.Sigma
haftmann@57418
  1835
    setsum_subset_diff ~> setsum.subset_diff
haftmann@57418
  1836
    setsum_Un_disjoint ~> setsum.union_disjoint
haftmann@57418
  1837
    setsum_UN_disjoint ~> setsum.UNION_disjoint
haftmann@57418
  1838
    setsum_Un_Int ~> setsum.union_inter
haftmann@57418
  1839
    setsum_Union_disjoint ~> setsum.Union_disjoint
haftmann@57418
  1840
    setsum_UNION_zero ~> setsum.Union_comp
haftmann@57418
  1841
    setsum_Un_zero ~> setsum.union_inter_neutral
haftmann@57418
  1842
    strong_setprod_cong ~> setprod.strong_cong
haftmann@57418
  1843
    strong_setsum_cong ~> setsum.strong_cong
haftmann@57418
  1844
    setprod_1' ~> setprod.neutral
haftmann@57418
  1845
    setprod_1 ~> setprod.neutral_const
haftmann@57418
  1846
    setprod_cartesian_product ~> setprod.cartesian_product
haftmann@57418
  1847
    setprod_cong ~> setprod.cong
haftmann@57418
  1848
    setprod_delta ~> setprod.delta
haftmann@57418
  1849
    setprod_delta' ~> setprod.delta'
haftmann@57418
  1850
    setprod_empty ~> setprod.empty
haftmann@57418
  1851
    setprod_infinite ~> setprod.infinite
haftmann@57418
  1852
    setprod_insert ~> setprod.insert
haftmann@57418
  1853
    setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left
haftmann@57418
  1854
    setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right
haftmann@57418
  1855
    setprod_mono_one_left ~> setprod.mono_neutral_left
haftmann@57418
  1856
    setprod_mono_one_right ~> setprod.mono_neutral_right
haftmann@57418
  1857
    setprod_reindex ~> setprod.reindex
haftmann@57418
  1858
    setprod_reindex_cong ~> setprod.reindex_cong
haftmann@57418
  1859
    setprod_reindex_nonzero ~> setprod.reindex_nontrivial
haftmann@57418
  1860
    setprod_Sigma ~> setprod.Sigma
haftmann@57418
  1861
    setprod_subset_diff ~> setprod.subset_diff
haftmann@57418
  1862
    setprod_timesf ~> setprod.distrib
haftmann@57418
  1863
    setprod_Un2 ~> setprod.union_diff2
haftmann@57418
  1864
    setprod_Un_disjoint ~> setprod.union_disjoint
haftmann@57418
  1865
    setprod_UN_disjoint ~> setprod.UNION_disjoint
haftmann@57418
  1866
    setprod_Un_Int ~> setprod.union_inter
haftmann@57418
  1867
    setprod_Union_disjoint ~> setprod.Union_disjoint
haftmann@57418
  1868
    setprod_Un_one ~> setprod.union_inter_neutral
haftmann@57418
  1869
haftmann@57418
  1870
  Dropped setsum_cong2 (simple variant of setsum.cong).
haftmann@57418
  1871
  Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)
haftmann@57418
  1872
  Dropped setsum_reindex_id, setprod_reindex_id
haftmann@57418
  1873
    (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).
haftmann@57418
  1874
wenzelm@57452
  1875
INCOMPATIBILITY.
wenzelm@57452
  1876
haftmann@54864
  1877
* Abolished slightly odd global lattice interpretation for min/max.
haftmann@54864
  1878
wenzelm@57452
  1879
  Fact consolidations:
haftmann@54864
  1880
    min_max.inf_assoc ~> min.assoc
haftmann@54864
  1881
    min_max.inf_commute ~> min.commute
haftmann@54864
  1882
    min_max.inf_left_commute ~> min.left_commute
haftmann@54864
  1883
    min_max.inf_idem ~> min.idem
haftmann@54864
  1884
    min_max.inf_left_idem ~> min.left_idem
haftmann@54864
  1885
    min_max.inf_right_idem ~> min.right_idem
haftmann@54864
  1886
    min_max.sup_assoc ~> max.assoc
haftmann@54864
  1887
    min_max.sup_commute ~> max.commute
haftmann@54864
  1888
    min_max.sup_left_commute ~> max.left_commute
haftmann@54864
  1889
    min_max.sup_idem ~> max.idem
haftmann@54864
  1890
    min_max.sup_left_idem ~> max.left_idem
haftmann@54864
  1891
    min_max.sup_inf_distrib1 ~> max_min_distrib2
haftmann@54864
  1892
    min_max.sup_inf_distrib2 ~> max_min_distrib1
haftmann@54864
  1893
    min_max.inf_sup_distrib1 ~> min_max_distrib2
haftmann@54864
  1894
    min_max.inf_sup_distrib2 ~> min_max_distrib1
haftmann@54864
  1895
    min_max.distrib ~> min_max_distribs
haftmann@54864
  1896
    min_max.inf_absorb1 ~> min.absorb1
haftmann@54864
  1897
    min_max.inf_absorb2 ~> min.absorb2
haftmann@54864
  1898
    min_max.sup_absorb1 ~> max.absorb1
haftmann@54864
  1899
    min_max.sup_absorb2 ~> max.absorb2
haftmann@54864
  1900
    min_max.le_iff_inf ~> min.absorb_iff1
haftmann@54864
  1901
    min_max.le_iff_sup ~> max.absorb_iff2
haftmann@54864
  1902
    min_max.inf_le1 ~> min.cobounded1
haftmann@54864
  1903
    min_max.inf_le2 ~> min.cobounded2
haftmann@54864
  1904
    le_maxI1, min_max.sup_ge1 ~> max.cobounded1
haftmann@54864
  1905
    le_maxI2, min_max.sup_ge2 ~> max.cobounded2
haftmann@54864
  1906
    min_max.le_infI1 ~> min.coboundedI1
haftmann@54864
  1907
    min_max.le_infI2 ~> min.coboundedI2
haftmann@54864
  1908
    min_max.le_supI1 ~> max.coboundedI1
haftmann@54864
  1909
    min_max.le_supI2 ~> max.coboundedI2
haftmann@54864
  1910
    min_max.less_infI1 ~> min.strict_coboundedI1
haftmann@54864
  1911
    min_max.less_infI2 ~> min.strict_coboundedI2
haftmann@54864
  1912
    min_max.less_supI1 ~> max.strict_coboundedI1
haftmann@54864
  1913
    min_max.less_supI2 ~> max.strict_coboundedI2
haftmann@54864
  1914
    min_max.inf_mono ~> min.mono
haftmann@54864
  1915
    min_max.sup_mono ~> max.mono
haftmann@54864
  1916
    min_max.le_infI, min_max.inf_greatest ~> min.boundedI
haftmann@54864
  1917
    min_max.le_supI, min_max.sup_least ~> max.boundedI
haftmann@54864
  1918
    min_max.le_inf_iff ~> min.bounded_iff
haftmann@54864
  1919
    min_max.le_sup_iff ~> max.bounded_iff
haftmann@54864
  1920
haftmann@54864
  1921
For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
haftmann@54864
  1922
min.left_commute, min.left_idem, max.commute, max.assoc,
haftmann@54864
  1923
max.left_commute, max.left_idem directly.
haftmann@54864
  1924
wenzelm@57452
  1925
For min_max.inf_sup_ord, prefer (one of) min.cobounded1,
wenzelm@57452
  1926
min.cobounded2, max.cobounded1m max.cobounded2 directly.
haftmann@54864
  1927
haftmann@56807
  1928
For min_ac or max_ac, prefer more general collection ac_simps.
haftmann@54864
  1929
wenzelm@58604
  1930
INCOMPATIBILITY.
haftmann@54864
  1931
wenzelm@57452
  1932
* Theorem disambiguation Inf_le_Sup (on finite sets) ~>
wenzelm@57452
  1933
Inf_fin_le_Sup_fin.  INCOMPATIBILITY.
haftmann@54745
  1934
haftmann@54295
  1935
* Qualified constant names Wellfounded.acc, Wellfounded.accp.
haftmann@54295
  1936
INCOMPATIBILITY.
haftmann@54295
  1937
haftmann@54228
  1938
* Fact generalization and consolidation:
haftmann@54228
  1939
    neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
wenzelm@57452
  1940
wenzelm@57452
  1941
INCOMPATIBILITY.
wenzelm@57452
  1942
wenzelm@57452
  1943
* Purely algebraic definition of even.  Fact generalization and
wenzelm@57452
  1944
  consolidation:
haftmann@54228
  1945
    nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
haftmann@54228
  1946
    even_zero_(nat|int) ~> even_zero
wenzelm@57452
  1947
haftmann@54228
  1948
INCOMPATIBILITY.
wenzelm@54055
  1949
haftmann@54489
  1950
* Abolished neg_numeral.
wenzelm@57452
  1951
  - Canonical representation for minus one is "- 1".
wenzelm@57452
  1952
  - Canonical representation for other negative numbers is "- (numeral _)".
wenzelm@57452
  1953
  - When devising rule sets for number calculation, consider the
haftmann@54587
  1954
    following canonical cases: 0, 1, numeral _, - 1, - numeral _.
wenzelm@57452
  1955
  - HOLogic.dest_number also recognizes numerals in non-canonical forms
wenzelm@54893
  1956
    like "numeral One", "- numeral One", "- 0" and even "- ... - _".
wenzelm@57452
  1957
  - Syntax for negative numerals is mere input syntax.
wenzelm@57452
  1958
haftmann@56964
  1959
INCOMPATIBILITY.
haftmann@54489
  1960
wenzelm@57517
  1961
* Reduced name variants for rules on associativity and commutativity:
wenzelm@57517
  1962
wenzelm@57517
  1963
    add_assoc ~> add.assoc
wenzelm@57517
  1964
    add_commute ~> add.commute
wenzelm@57517
  1965
    add_left_commute ~> add.left_commute
wenzelm@57517
  1966
    mult_assoc ~> mult.assoc
wenzelm@57517
  1967
    mult_commute ~> mult.commute
wenzelm@57517
  1968
    mult_left_commute ~> mult.left_commute
wenzelm@57517
  1969
    nat_add_assoc ~> add.assoc
wenzelm@57517
  1970
    nat_add_commute ~> add.commute
wenzelm@57517
  1971
    nat_add_left_commute ~> add.left_commute
wenzelm@57517
  1972
    nat_mult_assoc ~> mult.assoc
wenzelm@57517
  1973
    nat_mult_commute ~> mult.commute
wenzelm@57517
  1974
    eq_assoc ~> iff_assoc
wenzelm@57517
  1975
    eq_left_commute ~> iff_left_commute
wenzelm@57517
  1976
wenzelm@57517
  1977
INCOMPATIBILITY.
wenzelm@57517
  1978
wenzelm@57650
  1979
* Fact collections add_ac and mult_ac are considered old-fashioned.
wenzelm@57637
  1980
Prefer ac_simps instead, or specify rules
wenzelm@57637
  1981
(add|mult).(assoc|commute|left_commute) individually.
wenzelm@57517
  1982
haftmann@54230
  1983
* Elimination of fact duplicates:
haftmann@54230
  1984
    equals_zero_I ~> minus_unique
haftmann@54230
  1985
    diff_eq_0_iff_eq ~> right_minus_eq
traytel@54588
  1986
    nat_infinite ~> infinite_UNIV_nat
traytel@54588
  1987
    int_infinite ~> infinite_UNIV_int
wenzelm@57452
  1988
haftmann@54230
  1989
INCOMPATIBILITY.
haftmann@54230
  1990
haftmann@54230
  1991
* Fact name consolidation:
haftmann@54230
  1992
    diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
haftmann@54250
  1993
    minus_le_self_iff ~> neg_less_eq_nonneg
haftmann@54250
  1994
    le_minus_self_iff ~> less_eq_neg_nonpos
haftmann@54250
  1995
    neg_less_nonneg ~> neg_less_pos
haftmann@54250
  1996
    less_minus_self_iff ~> less_neg_neg [simp]
wenzelm@57452
  1997
haftmann@54230
  1998
INCOMPATIBILITY.
haftmann@54230
  1999
haftmann@54230
  2000
* More simplification rules on unary and binary minus:
haftmann@54230
  2001
add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
haftmann@54230
  2002
add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
haftmann@54230
  2003
add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
haftmann@54230
  2004
le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
wenzelm@57452
  2005
minus_add_cancel, uminus_add_conv_diff.  These correspondingly have
wenzelm@57452
  2006
been taken away from fact collections algebra_simps and field_simps.
wenzelm@57452
  2007
INCOMPATIBILITY.
haftmann@54230
  2008
haftmann@54230
  2009
To restore proofs, the following patterns are helpful:
haftmann@54230
  2010
haftmann@54230
  2011
a) Arbitrary failing proof not involving "diff_def":
haftmann@54230
  2012
Consider simplification with algebra_simps or field_simps.
haftmann@54230
  2013
haftmann@54230
  2014
b) Lifting rules from addition to subtraction:
wenzelm@54893
  2015
Try with "using <rule for addition> of [... "- _" ...]" by simp".
haftmann@54230
  2016
haftmann@54230
  2017
c) Simplification with "diff_def": just drop "diff_def".
haftmann@54230
  2018
Consider simplification with algebra_simps or field_simps;
haftmann@54230
  2019
or the brute way with
haftmann@54230
  2020
"simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
haftmann@54230
  2021
wenzelm@57452
  2022
* Introduce bdd_above and bdd_below in theory
wenzelm@57452
  2023
Conditionally_Complete_Lattices, use them instead of explicitly
wenzelm@57452
  2024
stating boundedness of sets.
wenzelm@57452
  2025
wenzelm@57452
  2026
* ccpo.admissible quantifies only over non-empty chains to allow more
wenzelm@57452
  2027
syntax-directed proof rules; the case of the empty chain shows up as
wenzelm@57452
  2028
additional case in fixpoint induction proofs.  INCOMPATIBILITY.
hoelzl@54264
  2029
hoelzl@56214
  2030
* Removed and renamed theorems in Series:
hoelzl@56214
  2031
  summable_le         ~>  suminf_le
hoelzl@56214
  2032
  suminf_le           ~>  suminf_le_const
hoelzl@56214
  2033
  series_pos_le       ~>  setsum_le_suminf
hoelzl@56214
  2034
  series_pos_less     ~>  setsum_less_suminf
hoelzl@56214
  2035
  suminf_ge_zero      ~>  suminf_nonneg
hoelzl@56214
  2036
  suminf_gt_zero      ~>  suminf_pos
hoelzl@56214
  2037
  suminf_gt_zero_iff  ~>  suminf_pos_iff
hoelzl@56214
  2038
  summable_sumr_LIMSEQ_suminf  ~>  summable_LIMSEQ
hoelzl@56214
  2039
  suminf_0_le         ~>  suminf_nonneg [rotate]
hoelzl@56214
  2040
  pos_summable        ~>  summableI_nonneg_bounded
hoelzl@56214
  2041
  ratio_test          ~>  summable_ratio_test
hoelzl@56214
  2042
hoelzl@56214
  2043
  removed series_zero, replaced by sums_finite
hoelzl@56214
  2044
hoelzl@56214
  2045
  removed auxiliary lemmas:
wenzelm@57452
  2046
hoelzl@56214
  2047
    sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
wenzelm@57452
  2048
    half, le_Suc_ex_iff, lemma_realpow_diff_sumr,
wenzelm@57452
  2049
    real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,
wenzelm@57452
  2050
    sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,
wenzelm@57452
  2051
    summable_convergent_sumr_iff, sumr_diff_mult_const
wenzelm@57452
  2052
hoelzl@56214
  2053
INCOMPATIBILITY.
hoelzl@56214
  2054
hoelzl@56214
  2055
* Replace (F)DERIV syntax by has_derivative:
hoelzl@56214
  2056
  - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
hoelzl@56214
  2057
hoelzl@56214
  2058
  - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
hoelzl@56214
  2059
hoelzl@56214
  2060
  - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
hoelzl@56214
  2061
hoelzl@56214
  2062
  - removed constant isDiff
hoelzl@56214
  2063
wenzelm@57452
  2064
  - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as
wenzelm@57452
  2065
    input syntax.
wenzelm@57452
  2066
wenzelm@57452
  2067
  - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.
hoelzl@56214
  2068
hoelzl@56214
  2069
  - Renamed FDERIV_... lemmas to has_derivative_...
hoelzl@56214
  2070
hoelzl@56381
  2071
  - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
hoelzl@56381
  2072
hoelzl@56381
  2073
  - removed DERIV_intros, has_derivative_eq_intros
hoelzl@56381
  2074
wenzelm@57452
  2075
  - introduced derivative_intros and deriative_eq_intros which
wenzelm@57452
  2076
    includes now rules for DERIV, has_derivative and
wenzelm@57452
  2077
    has_vector_derivative.
hoelzl@56381
  2078
hoelzl@56214
  2079
  - Other renamings:
hoelzl@56214
  2080
    differentiable_def        ~>  real_differentiable_def
hoelzl@56214
  2081
    differentiableE           ~>  real_differentiableE
hoelzl@56214
  2082
    fderiv_def                ~>  has_derivative_at
hoelzl@56214
  2083
    field_fderiv_def          ~>  field_has_derivative_at
hoelzl@56214
  2084
    isDiff_der                ~>  differentiable_def
hoelzl@56214
  2085
    deriv_fderiv              ~>  has_field_derivative_def
hoelzl@56381
  2086
    deriv_def                 ~>  DERIV_def
wenzelm@57452
  2087
wenzelm@57452
  2088
INCOMPATIBILITY.
wenzelm@57452
  2089
wenzelm@57452
  2090
* Include more theorems in continuous_intros. Remove the
wenzelm@57452
  2091
continuous_on_intros, isCont_intros collections, these facts are now
wenzelm@57452
  2092
in continuous_intros.
wenzelm@57452
  2093
wenzelm@57452
  2094
* Theorems about complex numbers are now stated only using Re and Im,
wenzelm@57452
  2095
the Complex constructor is not used anymore. It is possible to use
wenzelm@57452
  2096
primcorec to defined the behaviour of a complex-valued function.
wenzelm@57452
  2097
wenzelm@57452
  2098
Removed theorems about the Complex constructor from the simpset, they
wenzelm@57452
  2099
are available as the lemma collection legacy_Complex_simps. This
wenzelm@57452
  2100
especially removes
wenzelm@57452
  2101
hoelzl@56889
  2102
    i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
hoelzl@56889
  2103
wenzelm@57452
  2104
Instead the reverse direction is supported with
hoelzl@56889
  2105
    Complex_eq: "Complex a b = a + \<i> * b"
hoelzl@56889
  2106
wenzelm@57452
  2107
Moved csqrt from Fundamental_Algebra_Theorem to Complex.
hoelzl@56889
  2108
hoelzl@56889
  2109
  Renamings:
hoelzl@56889
  2110
    Re/Im                  ~>  complex.sel
hoelzl@56889
  2111
    complex_Re/Im_zero     ~>  zero_complex.sel
hoelzl@56889
  2112
    complex_Re/Im_add      ~>  plus_complex.sel
hoelzl@56889
  2113
    complex_Re/Im_minus    ~>  uminus_complex.sel
hoelzl@56889
  2114
    complex_Re/Im_diff     ~>  minus_complex.sel
hoelzl@56889
  2115
    complex_Re/Im_one      ~>  one_complex.sel
hoelzl@56889
  2116
    complex_Re/Im_mult     ~>  times_complex.sel
hoelzl@56889
  2117
    complex_Re/Im_inverse  ~>  inverse_complex.sel
hoelzl@56889
  2118
    complex_Re/Im_scaleR   ~>  scaleR_complex.sel
hoelzl@56889
  2119
    complex_Re/Im_i        ~>  ii.sel
hoelzl@56889
  2120
    complex_Re/Im_cnj      ~>  cnj.sel
hoelzl@56889
  2121
    Re/Im_cis              ~>  cis.sel
hoelzl@56889
  2122
hoelzl@56889
  2123
    complex_divide_def   ~>  divide_complex_def
hoelzl@56889
  2124
    complex_norm_def     ~>  norm_complex_def
hoelzl@56889
  2125
    cmod_def             ~>  norm_complex_de
hoelzl@56889
  2126
hoelzl@56889
  2127
  Removed theorems:
hoelzl@56889
  2128
    complex_zero_def
hoelzl@56889
  2129
    complex_add_def
hoelzl@56889
  2130
    complex_minus_def
hoelzl@56889
  2131
    complex_diff_def
hoelzl@56889
  2132
    complex_one_def
hoelzl@56889
  2133
    complex_mult_def
hoelzl@56889
  2134
    complex_inverse_def
hoelzl@56889
  2135
    complex_scaleR_def
hoelzl@56889
  2136
wenzelm@57452
  2137
INCOMPATIBILITY.
wenzelm@57452
  2138
wenzelm@57504
  2139
* Theory Lubs moved HOL image to HOL-Library. It is replaced by
wenzelm@57504
  2140
Conditionally_Complete_Lattices.  INCOMPATIBILITY.
wenzelm@57504
  2141
wenzelm@57504
  2142
* HOL-Library: new theory src/HOL/Library/Tree.thy.
wenzelm@57504
  2143
wenzelm@57504
  2144
* HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it
wenzelm@57504
  2145
is subsumed by session Kleene_Algebra in AFP.
wenzelm@57504
  2146
wenzelm@57856
  2147
* HOL-Library / theory RBT: various constants and facts are hidden;
wenzelm@57856
  2148
lifting setup is unregistered.  INCOMPATIBILITY.
kuncar@57826
  2149
wenzelm@57504
  2150
* HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
wenzelm@57504
  2151
wenzelm@57504
  2152
* HOL-Word: bit representations prefer type bool over type bit.
wenzelm@57504
  2153
INCOMPATIBILITY.
wenzelm@57504
  2154
wenzelm@57504
  2155
* HOL-Word:
wenzelm@57504
  2156
  - Abandoned fact collection "word_arith_alts", which is a duplicate
wenzelm@57504
  2157
    of "word_arith_wis".
wenzelm@57504
  2158
  - Dropped first (duplicated) element in fact collections
wenzelm@57504
  2159
    "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
wenzelm@57504
  2160
    "uint_word_arith_bintrs".
wenzelm@57504
  2161
wenzelm@57504
  2162
* HOL-Number_Theory:
wenzelm@57504
  2163
  - consolidated the proofs of the binomial theorem
wenzelm@57504
  2164
  - the function fib is again of type nat => nat and not overloaded
wenzelm@57504
  2165
  - no more references to Old_Number_Theory in the HOL libraries
wenzelm@57504
  2166
    (except the AFP)
wenzelm@57504
  2167
wenzelm@57504
  2168
INCOMPATIBILITY.
wenzelm@57504
  2169
immler@54787
  2170
* HOL-Multivariate_Analysis:
wenzelm@57452
  2171
  - Type class ordered_real_vector for ordered vector spaces.
wenzelm@57452
  2172
  - New theory Complex_Basic_Analysis defining complex derivatives,
lp15@57253
  2173
    holomorphic functions, etc., ported from HOL Light's canal.ml.
wenzelm@57452
  2174
  - Changed order of ordered_euclidean_space to be compatible with
immler@54787
  2175
    pointwise ordering on products. Therefore instance of
immler@54787
  2176
    conditionally_complete_lattice and ordered_real_vector.
immler@54787
  2177
    INCOMPATIBILITY: use box instead of greaterThanLessThan or
wenzelm@57452
  2178
    explicit set-comprehensions with eucl_less for other (half-)open
immler@54787
  2179
    intervals.
immler@57476
  2180
  - removed dependencies on type class ordered_euclidean_space with
immler@57476
  2181
    introduction of "cbox" on euclidean_space
immler@57476
  2182
    - renamed theorems:
immler@57476
  2183
        interval ~> box
immler@57476
  2184
        mem_interval ~> mem_box
immler@57476
  2185
        interval_eq_empty ~> box_eq_empty
immler@57476
  2186
        interval_ne_empty ~> box_ne_empty
immler@57476
  2187
        interval_sing(1) ~> cbox_sing
immler@57476
  2188
        interval_sing(2) ~> box_sing
immler@57476
  2189
        subset_interval_imp ~> subset_box_imp
immler@57476
  2190
        subset_interval ~> subset_box
immler@57476
  2191
        open_interval ~> open_box
immler@57476
  2192
        closed_interval ~> closed_cbox
immler@57476
  2193
        interior_closed_interval ~> interior_cbox
immler@57476
  2194
        bounded_closed_interval ~> bounded_cbox
immler@57476
  2195
        compact_interval ~> compact_cbox
immler@57476
  2196
        bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric
immler@57476
  2197
        bounded_subset_closed_interval ~> bounded_subset_cbox
immler@57476
  2198
        mem_interval_componentwiseI ~> mem_box_componentwiseI
immler@57476
  2199
        convex_box ~> convex_prod
immler@57476
  2200
        rel_interior_real_interval ~> rel_interior_real_box
immler@57476
  2201
        convex_interval ~> convex_box
immler@57476
  2202
        convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox
immler@57476
  2203
        frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox
immler@57476
  2204
        content_closed_interval' ~> content_cbox'
immler@57476
  2205
        elementary_subset_interval ~> elementary_subset_box
immler@57476
  2206
        diameter_closed_interval ~> diameter_cbox
immler@57476
  2207
        frontier_closed_interval ~> frontier_cbox
immler@57476
  2208
        frontier_open_interval ~> frontier_box
immler@57476
  2209
        bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric
immler@57476
  2210
        closure_open_interval ~> closure_box
immler@57476
  2211
        open_closed_interval_convex ~> open_cbox_convex
immler@57476
  2212
        open_interval_midpoint ~> box_midpoint
immler@57476
  2213
        content_image_affinity_interval ~> content_image_affinity_cbox
immler@57476
  2214
        is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval
immler@57476
  2215
        bounded_interval ~> bounded_closed_interval + bounded_boxes
immler@57476
  2216
immler@57476
  2217
    - respective theorems for intervals over the reals:
immler@57476
  2218
        content_closed_interval + content_cbox
immler@57476
  2219
        has_integral + has_integral_real
immler@57476
  2220
        fine_division_exists + fine_division_exists_real
immler@57476
  2221
        has_integral_null + has_integral_null_real
immler@57476
  2222
        tagged_division_union_interval + tagged_division_union_interval_real
immler@57476
  2223
        has_integral_const + has_integral_const_real
immler@57476
  2224
        integral_const + integral_const_real
immler@57476
  2225
        has_integral_bound + has_integral_bound_real
immler@57476
  2226
        integrable_continuous + integrable_continuous_real
immler@57476
  2227
        integrable_subinterval + integrable_subinterval_real
immler@57476
  2228
        has_integral_reflect_lemma + has_integral_reflect_lemma_real
immler@57476
  2229
        integrable_reflect + integrable_reflect_real
immler@57476
  2230
        integral_reflect + integral_reflect_real
immler@57476
  2231
        image_affinity_interval + image_affinity_cbox
immler@57476
  2232
        image_smult_interval + image_smult_cbox
immler@57476
  2233
        integrable_const + integrable_const_ivl
immler@57476
  2234
        integrable_on_subinterval + integrable_on_subcbox
immler@57476
  2235
hoelzl@56369
  2236
  - renamed theorems:
hoelzl@56369
  2237
    derivative_linear         ~>  has_derivative_bounded_linear
hoelzl@56369
  2238
    derivative_is_linear      ~>  has_derivative_linear
hoelzl@56369
  2239
    bounded_linear_imp_linear ~>  bounded_linear.linear
hoelzl@56369
  2240
hoelzl@56993
  2241
* HOL-Probability:
hoelzl@57825
  2242
  - Renamed positive_integral to nn_integral:
hoelzl@57825
  2243
hoelzl@57825
  2244
    . Renamed all lemmas "*positive_integral*" to *nn_integral*"
hoelzl@57825
  2245
      positive_integral_positive ~> nn_integral_nonneg
hoelzl@57825
  2246
hoelzl@57825
  2247
    . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
hoelzl@57825
  2248
wenzelm@57452
  2249
  - replaced the Lebesgue integral on real numbers by the more general
wenzelm@57452
  2250
    Bochner integral for functions into a real-normed vector space.
hoelzl@56993
  2251
hoelzl@56993
  2252
    integral_zero               ~>  integral_zero / integrable_zero
hoelzl@56993
  2253
    integral_minus              ~>  integral_minus / integrable_minus
hoelzl@56993
  2254
    integral_add                ~>  integral_add / integrable_add
hoelzl@56993
  2255
    integral_diff               ~>  integral_diff / integrable_diff
hoelzl@56993
  2256
    integral_setsum             ~>  integral_setsum / integrable_setsum
hoelzl@56993
  2257
    integral_multc              ~>  integral_mult_left / integrable_mult_left
hoelzl@56993
  2258
    integral_cmult              ~>  integral_mult_right / integrable_mult_right
hoelzl@56993
  2259
    integral_triangle_inequality~>  integral_norm_bound
hoelzl@56993
  2260
    integrable_nonneg           ~>  integrableI_nonneg
hoelzl@56993
  2261
    integral_positive           ~>  integral_nonneg_AE
hoelzl@56993
  2262
    integrable_abs_iff          ~>  integrable_abs_cancel
hoelzl@57825
  2263
    positive_integral_lim_INF   ~>  nn_integral_liminf
hoelzl@56993
  2264
    lebesgue_real_affine        ~>  lborel_real_affine
hoelzl@56993
  2265
    borel_integral_has_integral ~>  has_integral_lebesgue_integral
hoelzl@56993
  2266
    integral_indicator          ~>
hoelzl@56993
  2267
         integral_real_indicator / integrable_real_indicator
hoelzl@57825
  2268
    positive_integral_fst       ~>  nn_integral_fst'
hoelzl@57825
  2269
    positive_integral_fst_measurable ~> nn_integral_fst
hoelzl@57825
  2270
    positive_integral_snd_measurable ~> nn_integral_snd
hoelzl@56993
  2271
hoelzl@56993
  2272
    integrable_fst_measurable   ~>
hoelzl@56993
  2273
         integral_fst / integrable_fst / AE_integrable_fst
hoelzl@56993
  2274
hoelzl@56993
  2275
    integrable_snd_measurable   ~>
hoelzl@56993
  2276
         integral_snd / integrable_snd / AE_integrable_snd
hoelzl@56993
  2277
hoelzl@56993
  2278
    integral_monotone_convergence  ~>
hoelzl@56993
  2279
         integral_monotone_convergence / integrable_monotone_convergence
hoelzl@56993
  2280
hoelzl@56993
  2281
    integral_monotone_convergence_at_top  ~>
hoelzl@56993
  2282
         integral_monotone_convergence_at_top /
hoelzl@56993
  2283
         integrable_monotone_convergence_at_top
hoelzl@56993
  2284
hoelzl@56993
  2285
    has_integral_iff_positive_integral_lebesgue  ~>
hoelzl@56993
  2286
         has_integral_iff_has_bochner_integral_lebesgue_nonneg
hoelzl@56993
  2287
hoelzl@56993
  2288
    lebesgue_integral_has_integral  ~>
hoelzl@56993
  2289
         has_integral_integrable_lebesgue_nonneg
hoelzl@56993
  2290
hoelzl@56993
  2291
    positive_integral_lebesgue_has_integral  ~>
hoelzl@56993
  2292
         integral_has_integral_lebesgue_nonneg /
hoelzl@56993
  2293
         integrable_has_integral_lebesgue_nonneg
hoelzl@56993
  2294
hoelzl@56993
  2295
    lebesgue_integral_real_affine  ~>
hoelzl@57825
  2296
         nn_integral_real_affine
hoelzl@56993
  2297
hoelzl@56993
  2298
    has_integral_iff_positive_integral_lborel  ~>
hoelzl@56993
  2299
         integral_has_integral_nonneg / integrable_has_integral_nonneg
hoelzl@56993
  2300
hoelzl@56993
  2301
    The following theorems where removed:
hoelzl@56993
  2302
hoelzl@56993
  2303
    lebesgue_integral_nonneg
hoelzl@56993
  2304
    lebesgue_integral_uminus
hoelzl@56993
  2305
    lebesgue_integral_cmult
hoelzl@56993
  2306
    lebesgue_integral_multc
hoelzl@56993
  2307
    lebesgue_integral_cmult_nonneg
hoelzl@56993
  2308
    integral_cmul_indicator
hoelzl@56993
  2309
    integral_real
wenzelm@54672
  2310
wenzelm@57452
  2311
  - Formalized properties about exponentially, Erlang, and normal
wenzelm@57452
  2312
    distributed random variables.
wenzelm@57452
  2313
wenzelm@57504
  2314
* HOL-Decision_Procs: Separate command 'approximate' for approximative
wenzelm@57504
  2315
computation in src/HOL/Decision_Procs/Approximation.  Minor
wenzelm@57504
  2316
INCOMPATIBILITY.
wenzelm@57452
  2317
nipkow@57112
  2318
wenzelm@55622
  2319
*** Scala ***
wenzelm@55622
  2320
wenzelm@55622
  2321
* The signature and semantics of Document.Snapshot.cumulate_markup /
wenzelm@55622
  2322
select_markup have been clarified.  Markup is now traversed in the
wenzelm@55622
  2323
order of reports given by the prover: later markup is usually more
wenzelm@55622
  2324
specific and may override results accumulated so far.  The elements
wenzelm@55622
  2325
guard is mandatory and checked precisely.  Subtle INCOMPATIBILITY.
wenzelm@55622
  2326
wenzelm@57452
  2327
* Substantial reworking of internal PIDE protocol communication
wenzelm@57452
  2328
channels.  INCOMPATIBILITY.
wenzelm@57452
  2329
wenzelm@55622
  2330
wenzelm@54449
  2331
*** ML ***
wenzelm@54449
  2332
wenzelm@57504
  2333
* Subtle change of semantics of Thm.eq_thm: theory stamps are not
wenzelm@57504
  2334
compared (according to Thm.thm_ord), but assumed to be covered by the
wenzelm@57504
  2335
current background theory.  Thus equivalent data produced in different
wenzelm@57504
  2336
branches of the theory graph usually coincides (e.g. relevant for
wenzelm@57504
  2337
theory merge).  Note that the softer Thm.eq_thm_prop is often more
wenzelm@57504
  2338
appropriate than Thm.eq_thm.
wenzelm@57504
  2339
wenzelm@57504
  2340
* Proper context for basic Simplifier operations: rewrite_rule,
wenzelm@57504
  2341
rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
wenzelm@57504
  2342
pass runtime Proof.context (and ensure that the simplified entity
wenzelm@57504
  2343
actually belongs to it).
wenzelm@57504
  2344
wenzelm@57504
  2345
* Proper context discipline for read_instantiate and instantiate_tac:
wenzelm@57504
  2346
variables that are meant to become schematic need to be given as
wenzelm@57504
  2347
fixed, and are generalized by the explicit context of local variables.
wenzelm@57504
  2348
This corresponds to Isar attributes "where" and "of" with 'for'
wenzelm@57504
  2349
declaration.  INCOMPATIBILITY, also due to potential change of indices
wenzelm@57504
  2350
of schematic variables.
wenzelm@57504
  2351
wenzelm@56303
  2352
* Moved ML_Compiler.exn_trace and other operations on exceptions to
wenzelm@56303
  2353
structure Runtime.  Minor INCOMPATIBILITY.
wenzelm@56303
  2354
wenzelm@56279
  2355
* Discontinued old Toplevel.debug in favour of system option
wenzelm@57452
  2356
"ML_exception_trace", which may be also declared within the context
wenzelm@57452
  2357
via "declare [[ML_exception_trace = true]]".  Minor INCOMPATIBILITY.
wenzelm@56279
  2358
wenzelm@56281
  2359
* Renamed configuration option "ML_trace" to "ML_source_trace". Minor
wenzelm@56281
  2360
INCOMPATIBILITY.
wenzelm@56281
  2361
wenzelm@56281
  2362
* Configuration option "ML_print_depth" controls the pretty-printing
wenzelm@56281
  2363
depth of the ML compiler within the context.  The old print_depth in
wenzelm@56285
  2364
ML is still available as default_print_depth, but rarely used.  Minor
wenzelm@56285
  2365
INCOMPATIBILITY.
wenzelm@56279
  2366
wenzelm@54449
  2367
* Toplevel function "use" refers to raw ML bootstrap environment,
wenzelm@54449
  2368
without Isar context nor antiquotations.  Potential INCOMPATIBILITY.
wenzelm@54449
  2369
Note that 'ML_file' is the canonical command to load ML files into the
wenzelm@54449
  2370
formal context.
wenzelm@54449
  2371
wenzelm@56205
  2372
* Simplified programming interface to define ML antiquotations, see
wenzelm@56205
  2373
structure ML_Antiquotation.  Minor INCOMPATIBILITY.
wenzelm@56069
  2374
wenzelm@56071
  2375
* ML antiquotation @{here} refers to its source position, which is
wenzelm@56071
  2376
occasionally useful for experimentation and diagnostic purposes.
wenzelm@56071
  2377
wenzelm@56135
  2378
* ML antiquotation @{path} produces a Path.T value, similarly to
wenzelm@56135
  2379
Path.explode, but with compile-time check against the file-system and
wenzelm@56135
  2380
some PIDE markup.  Note that unlike theory source, ML does not have a
wenzelm@56135
  2381
well-defined master directory, so an absolute symbolic path
wenzelm@56135
  2382
specification is usually required, e.g. "~~/src/HOL".
wenzelm@56135
  2383
wenzelm@56399
  2384
* ML antiquotation @{print} inlines a function to print an arbitrary
wenzelm@56399
  2385
ML value, which is occasionally useful for diagnostic or demonstration
wenzelm@56399
  2386
purposes.
wenzelm@56399
  2387
wenzelm@54449
  2388
wenzelm@54683
  2389
*** System ***
wenzelm@54683
  2390
wenzelm@57443
  2391
* Proof General with its traditional helper scripts is now an optional
wenzelm@57504
  2392
Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle
wenzelm@57504
  2393
component repository http://isabelle.in.tum.de/components/.  Note that
wenzelm@57504
  2394
the "system" manual provides general explanations about add-on
wenzelm@57504
  2395
components, especially those that are not bundled with the release.
wenzelm@57443
  2396
wenzelm@56439
  2397
* The raw Isabelle process executable has been renamed from
wenzelm@56439
  2398
"isabelle-process" to "isabelle_process", which conforms to common
wenzelm@56439
  2399
shell naming conventions, and allows to define a shell function within
wenzelm@56439
  2400
the Isabelle environment to avoid dynamic path lookup.  Rare
wenzelm@57504
  2401
incompatibility for old tools that do not use the ISABELLE_PROCESS
wenzelm@57504
  2402
settings variable.
wenzelm@56439
  2403
wenzelm@57439
  2404
* Former "isabelle tty" has been superseded by "isabelle console",
wenzelm@57439
  2405
with implicit build like "isabelle jedit", and without the mostly
wenzelm@57439
  2406
obsolete Isar TTY loop.
wenzelm@57439
  2407
wenzelm@57452
  2408
* Simplified "isabelle display" tool.  Settings variables DVI_VIEWER
wenzelm@57452
  2409
and PDF_VIEWER now refer to the actual programs, not shell
wenzelm@57452
  2410
command-lines.  Discontinued option -c: invocation may be asynchronous
wenzelm@57452
  2411
via desktop environment, without any special precautions.  Potential
wenzelm@57452
  2412
INCOMPATIBILITY with ambitious private settings.
wenzelm@57452
  2413
wenzelm@57413
  2414
* Removed obsolete "isabelle unsymbolize".  Note that the usual format
wenzelm@57413
  2415
for email communication is the Unicode rendering of Isabelle symbols,
wenzelm@57413
  2416
as produced by Isabelle/jEdit, for example.
wenzelm@57413
  2417
wenzelm@57452
  2418
* Removed obsolete tool "wwwfind". Similar functionality may be
wenzelm@57452
  2419
integrated into Isabelle/jEdit eventually.
wenzelm@57452
  2420
wenzelm@57452
  2421
* Improved 'display_drafts' concerning desktop integration and
wenzelm@57452
  2422
repeated invocation in PIDE front-end: re-use single file
wenzelm@57452
  2423
$ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
wenzelm@57084
  2424
wenzelm@57452
  2425
* Session ROOT specifications require explicit 'document_files' for
wenzelm@57452
  2426
robust dependencies on LaTeX sources.  Only these explicitly given
wenzelm@57452
  2427
files are copied to the document output directory, before document
wenzelm@57452
  2428
processing is started.
wenzelm@57452
  2429
wenzelm@57504
  2430
* Windows: support for regular TeX installation (e.g. MiKTeX) instead
wenzelm@57504
  2431
of TeX Live from Cygwin.
wenzelm@57504
  2432
wenzelm@57084
  2433
wenzelm@57693
  2434
wenzelm@54639
  2435
New in Isabelle2013-2 (December 2013)
wenzelm@54639
  2436
-------------------------------------
wenzelm@54639
  2437
wenzelm@54639
  2438
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@54639
  2439
wenzelm@54639
  2440
* More robust editing of running commands with internal forks,
wenzelm@54639
  2441
e.g. non-terminating 'by' steps.
wenzelm@54639
  2442
wenzelm@54641
  2443
* More relaxed Sledgehammer panel: avoid repeated application of query
wenzelm@54641
  2444
after edits surrounding the command location.
wenzelm@54641
  2445
wenzelm@54648
  2446
* More status information about commands that are interrupted
wenzelm@54648
  2447
accidentally (via physical event or Poly/ML runtime system signal,
wenzelm@54648
  2448
e.g. out-of-memory).
wenzelm@54648
  2449
wenzelm@54653
  2450
wenzelm@54653
  2451
*** System ***
wenzelm@54653
  2452
wenzelm@54653
  2453
* More robust termination of external processes managed by
wenzelm@54664
  2454
Isabelle/ML: support cancellation of tasks within the range of
wenzelm@54664
  2455
milliseconds, as required for PIDE document editing with automatically
wenzelm@54664
  2456
tried tools (e.g. Sledgehammer).
wenzelm@54653
  2457
wenzelm@54648
  2458
* Reactivated Isabelle/Scala kill command for external processes on
wenzelm@54648
  2459
Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
wenzelm@54648
  2460
workaround for some Debian/Ubuntu Linux versions from 2013.
wenzelm@54648
  2461
wenzelm@54639
  2462
wenzelm@54639
  2463
wenzelm@53971
  2464
New in Isabelle2013-1 (November 2013)
wenzelm@53971
  2465
-------------------------------------
wenzelm@50994
  2466
wenzelm@51293
  2467
*** General ***
wenzelm@51293
  2468
wenzelm@53971
  2469
* Discontinued obsolete 'uses' within theory header.  Note that
wenzelm@53971
  2470
commands like 'ML_file' work without separate declaration of file
wenzelm@53971
  2471
dependencies.  Minor INCOMPATIBILITY.
wenzelm@53971
  2472
wenzelm@53971
  2473
* Discontinued redundant 'use' command, which was superseded by
wenzelm@53971
  2474
'ML_file' in Isabelle2013.  Minor INCOMPATIBILITY.
wenzelm@53971
  2475
wenzelm@53016
  2476
* Simplified subscripts within identifiers, using plain \<^sub>
wenzelm@53016
  2477
instead of the second copy \<^isub> and \<^isup>.  Superscripts are
wenzelm@53016
  2478
only for literal tokens within notation; explicit mixfix annotations
wenzelm@53016
  2479
for consts or fixed variables may be used as fall-back for unusual
wenzelm@53016
  2480
names.  Obsolete \<twosuperior> has been expanded to \<^sup>2 in
wenzelm@53016
  2481
Isabelle/HOL.  INCOMPATIBILITY, use "isabelle update_sub_sup" to
wenzelm@53016
  2482
standardize symbols as a starting point for further manual cleanup.
wenzelm@53016
  2483
The ML reference variable "legacy_isub_isup" may be set as temporary
wenzelm@53016
  2484
workaround, to make the prover accept a subset of the old identifier
wenzelm@53016
  2485
syntax.
wenzelm@53016
  2486
wenzelm@53021
  2487
* Document antiquotations: term style "isub" has been renamed to
wenzelm@53021
  2488
"sub".  Minor INCOMPATIBILITY.
wenzelm@53021
  2489
wenzelm@52487
  2490
* Uniform management of "quick_and_dirty" as system option (see also
wenzelm@52487
  2491
"isabelle options"), configuration option within the context (see also
wenzelm@52487
  2492
Config.get in Isabelle/ML), and attribute in Isabelle/Isar.  Minor
wenzelm@52487
  2493
INCOMPATIBILITY, need to use more official Isabelle means to access
wenzelm@52487
  2494
quick_and_dirty, instead of historical poking into mutable reference.
wenzelm@52059
  2495
wenzelm@52060
  2496
* Renamed command 'print_configs' to 'print_options'.  Minor
wenzelm@52060
  2497
INCOMPATIBILITY.
wenzelm@52060
  2498
wenzelm@52430
  2499
* Proper diagnostic command 'print_state'.  Old 'pr' (with its
wenzelm@52430
  2500
implicit change of some global references) is retained for now as
wenzelm@52430
  2501
control command, e.g. for ProofGeneral 3.7.x.
wenzelm@52430
  2502
wenzelm@52549
  2503
* Discontinued 'print_drafts' command with its old-fashioned PS output
wenzelm@52549
  2504
and Unix command-line print spooling.  Minor INCOMPATIBILITY: use
wenzelm@52549
  2505
'display_drafts' instead and print via the regular document viewer.
wenzelm@52549
  2506
wenzelm@53971
  2507
* Updated and extended "isar-ref" and "implementation" manual,
wenzelm@53971
  2508
eliminated old "ref" manual.
wenzelm@53971
  2509
wenzelm@51293
  2510
wenzelm@51533
  2511
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@51533
  2512
wenzelm@53971
  2513
* New manual "jedit" for Isabelle/jEdit, see isabelle doc or
wenzelm@53852
  2514
Documentation panel.
wenzelm@53852
  2515
wenzelm@53971
  2516
* Dockable window "Documentation" provides access to Isabelle
wenzelm@53971
  2517
documentation.
wenzelm@52646
  2518
wenzelm@52949
  2519
* Dockable window "Find" provides query operations for formal entities
wenzelm@52949
  2520
(GUI front-end to 'find_theorems' command).
wenzelm@52949
  2521
wenzelm@53050
  2522
* Dockable window "Sledgehammer" manages asynchronous / parallel
wenzelm@53050
  2523
sledgehammer runs over existing document sources, independently of
wenzelm@53050
  2524
normal editing and checking process.
wenzelm@53050
  2525
wenzelm@51533
  2526
* Dockable window "Timing" provides an overview of relevant command
wenzelm@54332
  2527
timing information, depending on option jedit_timing_threshold.  The
wenzelm@54332
  2528
same timing information is shown in the extended tooltip of the
wenzelm@54332
  2529
command keyword, when hovering the mouse over it while the CONTROL or
wenzelm@54332
  2530
COMMAND modifier is pressed.
wenzelm@51533
  2531
wenzelm@53971
  2532
* Improved dockable window "Theories": Continuous checking of proof
wenzelm@53971
  2533
document (visible and required parts) may be controlled explicitly,
wenzelm@53971
  2534
using check box or shortcut "C+e ENTER".  Individual theory nodes may
wenzelm@53971
  2535
be marked explicitly as required and checked in full, using check box
wenzelm@53971
  2536
or shortcut "C+e SPACE".
wenzelm@53971
  2537
wenzelm@54305
  2538
* Improved completion mechanism, which is now managed by the
wenzelm@54305
  2539
Isabelle/jEdit plugin instead of SideKick.  Refined table of Isabelle
wenzelm@54305
  2540
symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
wenzelm@54305
  2541
wenzelm@54319
  2542
* Standard jEdit keyboard shortcut C+b complete-word is remapped to
wenzelm@54319
  2543
isabelle.complete for explicit completion in Isabelle sources.
wenzelm@54319
  2544
INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
wenzelm@54319
  2545
to resolve conflict.
wenzelm@54319
  2546
wenzelm@54305
  2547
* Improved support of various "minor modes" for Isabelle NEWS,
wenzelm@54305
  2548
options, session ROOT etc., with completion and SideKick tree view.
wenzelm@54305
  2549
wenzelm@53971
  2550
* Strictly monotonic document update, without premature cancellation of
wenzelm@53971
  2551
running transactions that are still needed: avoid reset/restart of
wenzelm@53971
  2552
such command executions while editing.
wenzelm@53271
  2553
wenzelm@53971
  2554
* Support for asynchronous print functions, as overlay to existing
wenzelm@53971
  2555
document content.
wenzelm@53971
  2556
wenzelm@53971
  2557
* Support for automatic tools in HOL, which try to prove or disprove
wenzelm@53971
  2558
toplevel theorem statements.
wenzelm@53971
  2559
wenzelm@53971
  2560
* Action isabelle.reset-font-size resets main text area font size
wenzelm@54365
  2561
according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
wenzelm@54365
  2562
also "Plugin Options / Isabelle / General").  It can be bound to some
wenzelm@54365
  2563
keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
wenzelm@53971
  2564
wenzelm@53971
  2565
* File specifications in jEdit (e.g. file browser) may refer to
wenzelm@54351
  2566
$ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms.  Discontinued
wenzelm@54351
  2567
obsolete $ISABELLE_HOME_WINDOWS variable.
wenzelm@53971
  2568
wenzelm@53971
  2569
* Improved support for Linux look-and-feel "GTK+", see also "Utilities
wenzelm@53971
  2570
/ Global Options / Appearance".
wenzelm@53971
  2571
wenzelm@53971
  2572
* Improved support of native Mac OS X functionality via "MacOSX"
wenzelm@53971
  2573
plugin, which is now enabled by default.
wenzelm@53971
  2574
wenzelm@51533
  2575
wenzelm@51313
  2576
*** Pure ***
wenzelm@51313
  2577
ballarin@54049
  2578
* Commands 'interpretation' and 'sublocale' are now target-sensitive.
ballarin@54049
  2579
In particular, 'interpretation' allows for non-persistent
ballarin@54049
  2580
interpretation within "context ... begin ... end" blocks offering a
ballarin@54049
  2581
light-weight alternative to 'sublocale'.  See "isar-ref" manual for
ballarin@54049
  2582
details.
haftmann@51747
  2583
ballarin@51565
  2584
* Improved locales diagnostic command 'print_dependencies'.
ballarin@51565
  2585
wenzelm@51313
  2586
* Discontinued obsolete 'axioms' command, which has been marked as
wenzelm@51313
  2587
legacy since Isabelle2009-2.  INCOMPATIBILITY, use 'axiomatization'
wenzelm@51313
  2588
instead, while observing its uniform scope for polymorphism.
wenzelm@51313
  2589
wenzelm@51316
  2590
* Discontinued empty name bindings in 'axiomatization'.
wenzelm@51316
  2591
INCOMPATIBILITY.
wenzelm@51316
  2592
wenzelm@53971
  2593
* System option "proofs" has been discontinued.  Instead the global
wenzelm@53971
  2594
state of Proofterm.proofs is persistently compiled into logic images
wenzelm@53971
  2595
as required, notably HOL-Proofs.  Users no longer need to change
wenzelm@53971
  2596
Proofterm.proofs dynamically.  Minor INCOMPATIBILITY.
wenzelm@53971
  2597
wenzelm@53971
  2598
* Syntax translation functions (print_translation etc.) always depend
wenzelm@53971
  2599
on Proof.context.  Discontinued former "(advanced)" option -- this is
wenzelm@53971
  2600
now the default.  Minor INCOMPATIBILITY.
wenzelm@53971
  2601
wenzelm@53971
  2602
* Former global reference trace_unify_fail is now available as
wenzelm@53971
  2603
configuration option "unify_trace_failure" (global context only).
wenzelm@53971
  2604
wenzelm@52463
  2605
* SELECT_GOAL now retains the syntactic context of the overall goal
wenzelm@52463
  2606
state (schematic variables etc.).  Potential INCOMPATIBILITY in rare
wenzelm@52463
  2607
situations.
wenzelm@52463
  2608
wenzelm@51313
  2609
hoelzl@51002
  2610
*** HOL ***
hoelzl@51002
  2611
wenzelm@54032
  2612
* Stronger precedence of syntax for big intersection and union on
wenzelm@54032
  2613
sets, in accordance with corresponding lattice operations.
wenzelm@54032
  2614
INCOMPATIBILITY.
wenzelm@54032
  2615
wenzelm@54032
  2616
* Notation "{p:A. P}" now allows tuple patterns as well.
wenzelm@54032
  2617
wenzelm@54032
  2618
* Nested case expressions are now translated in a separate check phase
wenzelm@54032
  2619
rather than during parsing. The data for case combinators is separated
wenzelm@54032
  2620
from the datatype package. The declaration attribute
wenzelm@54032
  2621
"case_translation" can be used to register new case combinators:
wenzelm@54032
  2622
wenzelm@54032
  2623
  declare [[case_translation case_combinator constructor1 ... constructorN]]
haftmann@52637
  2624
haftmann@52435
  2625
* Code generator:
wenzelm@53160
  2626
  - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
wenzelm@53160
  2627
    'code_instance'.
wenzelm@53160
  2628
  - 'code_identifier' declares name hints for arbitrary identifiers in
wenzelm@53160
  2629
    generated code, subsuming 'code_modulename'.
wenzelm@53983
  2630
wenzelm@53983
  2631
See the isar-ref manual for syntax diagrams, and the HOL theories for
wenzelm@53983
  2632
examples.
haftmann@52435
  2633
wenzelm@54032
  2634
* Attibute 'code': 'code' now declares concrete and abstract code
wenzelm@54032
  2635
equations uniformly.  Use explicit 'code equation' and 'code abstract'
wenzelm@54032
  2636
to distinguish both when desired.
wenzelm@54032
  2637
wenzelm@54032
  2638
* Discontinued theories Code_Integer and Efficient_Nat by a more
wenzelm@54032
  2639
fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
wenzelm@54032
  2640
Code_Target_Nat and Code_Target_Numeral.  See the tutorial on code
wenzelm@54032
  2641
generation for details.  INCOMPATIBILITY.
wenzelm@54032
  2642
wenzelm@54032
  2643
* Numeric types are mapped by default to target language numerals:
wenzelm@54032
  2644
natural (replaces former code_numeral) and integer (replaces former
wenzelm@54032
  2645
code_int).  Conversions are available as integer_of_natural /
wenzelm@54032
  2646
natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
wenzelm@54032
  2647
Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
wenzelm@54032
  2648
ML).  INCOMPATIBILITY.
wenzelm@54032
  2649
wenzelm@54032
  2650
* Function package: For mutually recursive functions f and g, separate
wenzelm@54032
  2651
cases rules f.cases and g.cases are generated instead of unusable
wenzelm@54032
  2652
f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
wenzelm@54032
  2653
in the case that the unusable rule was used nevertheless.
wenzelm@54032
  2654
wenzelm@54032
  2655
* Function package: For each function f, new rules f.elims are
wenzelm@54032
  2656
generated, which eliminate equalities of the form "f x = t".
wenzelm@54032
  2657
wenzelm@54032
  2658
* New command 'fun_cases' derives ad-hoc elimination rules for
wenzelm@54032
  2659
function equations as simplified instances of f.elims, analogous to
wenzelm@54032
  2660
inductive_cases.  See ~~/src/HOL/ex/Fundefs.thy for some examples.
blanchet@53307
  2661
kuncar@54021
  2662
* Lifting:
kuncar@54021
  2663
  - parametrized correspondence relations are now supported:
wenzelm@54378
  2664
    + parametricity theorems for the raw term can be specified in
kuncar@54021
  2665
      the command lift_definition, which allow us to generate stronger
kuncar@54021
  2666
      transfer rules
kuncar@54021
  2667
    + setup_lifting generates stronger transfer rules if parametric
kuncar@54021
  2668
      correspondence relation can be generated
kuncar@54021
  2669
    + various new properties of the relator must be specified to support
kuncar@54021
  2670
      parametricity
kuncar@54021
  2671
    + parametricity theorem for the Quotient relation can be specified
kuncar@54021
  2672
  - setup_lifting generates domain rules for the Transfer package
kuncar@54021
  2673
  - stronger reflexivity prover of respectfulness theorems for type
kuncar@54021
  2674
    copies
kuncar@54021
  2675
  - ===> and --> are now local. The symbols can be introduced
kuncar@54021
  2676
    by interpreting the locale lifting_syntax (typically in an
kuncar@54021
  2677
    anonymous context)
wenzelm@54378
  2678
  - Lifting/Transfer relevant parts of Library/Quotient_* are now in
kuncar@54021
  2679
    Main. Potential INCOMPATIBILITY
kuncar@54021
  2680
  - new commands for restoring and deleting Lifting/Transfer context:
kuncar@54021
  2681
    lifting_forget, lifting_update
wenzelm@54378
  2682
  - the command print_quotmaps was renamed to print_quot_maps.
kuncar@54021
  2683
    INCOMPATIBILITY
kuncar@54021
  2684
kuncar@54021
  2685
* Transfer:
wenzelm@54378
  2686
  - better support for domains in Transfer: replace Domainp T
kuncar@54021
  2687
    by the actual invariant in a transferred goal
kuncar@54021
  2688
  - transfer rules can have as assumptions other transfer rules
kuncar@54021
  2689
  - Experimental support for transferring from the raw level to the
kuncar@54021
  2690
    abstract level: Transfer.transferred attribute
kuncar@54021
  2691
  - Attribute version of the transfer method: untransferred attribute
kuncar@54021
  2692
haftmann@52286
  2693
* Reification and reflection:
wenzelm@53160
  2694
  - Reification is now directly available in HOL-Main in structure
wenzelm@53160
  2695
    "Reification".
wenzelm@53160
  2696
  - Reflection now handles multiple lists with variables also.
wenzelm@53160
  2697
  - The whole reflection stack has been decomposed into conversions.
haftmann@52286
  2698
INCOMPATIBILITY.
haftmann@52286
  2699
haftmann@51489
  2700
* Revised devices for recursive definitions over finite sets:
haftmann@51489
  2701
  - Only one fundamental fold combinator on finite set remains:
haftmann@51489
  2702
    Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
haftmann@51489
  2703
    This is now identity on infinite sets.
wenzelm@52745
  2704
  - Locales ("mini packages") for fundamental definitions with
haftmann@51489
  2705
    Finite_Set.fold: folding, folding_idem.
haftmann@51489
  2706
  - Locales comm_monoid_set, semilattice_order_set and
haftmann@51489
  2707
    semilattice_neutr_order_set for big operators on sets.
haftmann@51489
  2708
    See theory Big_Operators for canonical examples.
haftmann@51489
  2709
    Note that foundational constants comm_monoid_set.F and
haftmann@51489
  2710
    semilattice_set.F correspond to former combinators fold_image
haftmann@51489
  2711
    and fold1 respectively.  These are now gone.  You may use
haftmann@51490
  2712
    those foundational constants as substitutes, but it is
wenzelm@53983
  2713
    preferable to interpret the above locales accordingly.
haftmann@51489
  2714
  - Dropped class ab_semigroup_idem_mult (special case of lattice,
haftmann@51489
  2715
    no longer needed in connection with Finite_Set.fold etc.)
haftmann@51489
  2716
  - Fact renames:
haftmann@51489
  2717
      card.union_inter ~> card_Un_Int [symmetric]
haftmann@51489
  2718
      card.union_disjoint ~> card_Un_disjoint
haftmann@51489
  2719
INCOMPATIBILITY.
haftmann@51489
  2720
haftmann@51487
  2721
* Locale hierarchy for abstract orderings and (semi)lattices.
haftmann@51487
  2722
wenzelm@53526
  2723
* Complete_Partial_Order.admissible is defined outside the type class
wenzelm@53526
  2724
ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
wenzelm@53526
  2725
class predicate assumption or sort constraint when possible.
Andreas@53362
  2726
INCOMPATIBILITY.