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