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