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