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