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