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