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