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