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