NEWS
author blanchet
Mon Feb 03 17:18:38 2014 +0100 (2014-02-03)
changeset 55289 30d874dc7000
parent 55183 17ec4a29ef71
child 55297 1dfcd49f5dcb
permissions -rw-r--r--
added new option to documentation
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@54055
     4
New in this Isabelle version
wenzelm@54055
     5
----------------------------
wenzelm@54055
     6
wenzelm@54702
     7
*** General ***
wenzelm@54702
     8
wenzelm@54702
     9
* Document antiquotation @{url} produces markup for the given URL,
wenzelm@54702
    10
which results in an active hyperlink within the text.
wenzelm@54702
    11
wenzelm@54705
    12
* Document antiquotation @{file_unchecked} is like @{file}, but does
wenzelm@54705
    13
not check existence within the file-system.
wenzelm@54705
    14
wenzelm@54732
    15
* Discontinued legacy_isub_isup, which was a temporary Isabelle/ML
wenzelm@54732
    16
workaround in Isabelle2013-1.  The prover process no longer accepts
wenzelm@54732
    17
old identifier syntax with \<^isub> or \<^isup>.
wenzelm@54732
    18
wenzelm@55029
    19
* Syntax of document antiquotation @{rail} now uses \<newline> instead
wenzelm@55029
    20
of "\\", to avoid the optical illusion of escaped backslash within
wenzelm@55029
    21
string token.  Minor INCOMPATIBILITY.
wenzelm@55029
    22
wenzelm@55122
    23
* Lexical syntax (inner and outer) supports text cartouches with
wenzelm@55122
    24
arbitrary nesting, and without escapes of quotes etc.
wenzelm@55122
    25
wenzelm@54702
    26
wenzelm@54533
    27
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@54533
    28
wenzelm@54533
    29
* Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
wenzelm@54533
    30
Open text buffers take precedence over copies within the file-system.
wenzelm@54533
    31
wenzelm@54688
    32
* Document panel: simplied interaction where every single mouse click
wenzelm@54688
    33
(re)opens document via desktop environment or as jEdit buffer.
wenzelm@54688
    34
wenzelm@54881
    35
* Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
wenzelm@54881
    36
General") allows to specify additional print modes for the prover
wenzelm@54881
    37
process, without requiring old-fashioned command-line invocation of
wenzelm@54881
    38
"isabelle jedit -m MODE".
wenzelm@54881
    39
wenzelm@54533
    40
wenzelm@55001
    41
*** Pure ***
wenzelm@55001
    42
wenzelm@55143
    43
* Attributes "where" and "of" allow an optional context of local
wenzelm@55143
    44
variables ('for' declaration): these variables become schematic in the
wenzelm@55143
    45
instantiated theorem.
wenzelm@55143
    46
wenzelm@55152
    47
* Obsolete attribute "standard" has been discontinued (legacy since
wenzelm@55152
    48
Isabelle2012).  Potential INCOMPATIBILITY, use explicit 'for' context
wenzelm@55152
    49
where instantiations with schematic variables are intended (for
wenzelm@55152
    50
declaration commands like 'lemmas' or attributes like "of").  The
wenzelm@55152
    51
following temporary definition may help to port old applications:
wenzelm@55152
    52
wenzelm@55152
    53
  attribute_setup standard =
wenzelm@55152
    54
    "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
wenzelm@55152
    55
wenzelm@55001
    56
* More thorough check of proof context for goal statements and
wenzelm@55006
    57
attributed fact expressions (concerning background theory, declared
wenzelm@55006
    58
hyps).  Potential INCOMPATIBILITY, tools need to observe standard
wenzelm@55006
    59
context discipline.  See also Assumption.add_assumes and the more
wenzelm@55006
    60
primitive Thm.assume_hyps.
wenzelm@55001
    61
wenzelm@55108
    62
* Inner syntax token language allows regular quoted strings "..."
wenzelm@55108
    63
(only makes sense in practice, if outer syntax is delimited
wenzelm@55108
    64
differently).
wenzelm@55108
    65
wenzelm@55001
    66
haftmann@54227
    67
*** HOL ***
haftmann@54227
    68
wenzelm@55139
    69
* Simproc "finite_Collect" is no longer enabled by default, due to
wenzelm@55139
    70
spurious crashes and other surprises.  Potential INCOMPATIBILITY.
wenzelm@55139
    71
blanchet@55098
    72
* Moved new (co)datatype package and its dependencies from "HOL-BNF" to "HOL".
blanchet@55098
    73
  The "bnf", "wrap_free_constructors", "datatype_new", "codatatype",
blanchet@55098
    74
  "primrec_new", "primcorec", and "primcorecursive" command are now part of
blanchet@55098
    75
  "Main".
blanchet@55098
    76
  INCOMPATIBILITY.
blanchet@55098
    77
  Theory renamings:
blanchet@55098
    78
    FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
blanchet@55098
    79
    Library/Wfrec.thy ~> Wfrec.thy
blanchet@55098
    80
    Library/Zorn.thy ~> Zorn.thy
blanchet@55098
    81
    Cardinals/Order_Relation.thy ~> Order_Relation.thy
blanchet@55098
    82
    Library/Order_Union.thy ~> Cardinals/Order_Union.thy
blanchet@55098
    83
    Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
blanchet@55098
    84
    Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
blanchet@55098
    85
    Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
blanchet@55098
    86
    Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
blanchet@55098
    87
    Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
blanchet@55098
    88
    BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
blanchet@55098
    89
    BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
blanchet@55098
    90
    BNF/BNF_Comp.thy ~> BNF_Comp.thy
blanchet@55098
    91
    BNF/BNF_Def.thy ~> BNF_Def.thy
blanchet@55098
    92
    BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
blanchet@55098
    93
    BNF/BNF_GFP.thy ~> BNF_GFP.thy
blanchet@55098
    94
    BNF/BNF_LFP.thy ~> BNF_LFP.thy
blanchet@55098
    95
    BNF/BNF_Util.thy ~> BNF_Util.thy
blanchet@55098
    96
    BNF/Coinduction.thy ~> Coinduction.thy
blanchet@55098
    97
    BNF/More_BNFs.thy ~> Library/More_BNFs.thy
blanchet@55098
    98
    BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
blanchet@55098
    99
    BNF/Examples/* ~> BNF_Examples/*
blanchet@55098
   100
  New theories:
blanchet@55098
   101
    List_Prefix.thy (split from Library/Sublist.thy)
blanchet@55098
   102
    Wellorder_Extension.thy (split from Zorn.thy)
blanchet@55098
   103
    Library/Cardinal_Notations.thy
blanchet@55098
   104
    Library/BNF_Decl.thy
blanchet@55098
   105
    BNF_Examples/Misc_Primcorec.thy
blanchet@55098
   106
    BNF_Examples/Stream_Processor.thy
blanchet@55098
   107
  Discontinued theory:
blanchet@55098
   108
    BNF/BNF.thy
blanchet@55098
   109
    BNF/Equiv_Relations_More.thy
blanchet@55098
   110
blanchet@55098
   111
* New theory:
blanchet@55098
   112
    Cardinals/Ordinal_Arithmetic.thy
blanchet@55098
   113
blanchet@55098
   114
* Theory reorganizations:
blanchet@55098
   115
  * Big_Operators.thy ~> Groups_Big.thy and Lattices_Big.thy
blanchet@55098
   116
blanchet@55183
   117
* Sledgehammer:
blanchet@55289
   118
  - New option:
blanchet@55289
   119
      smt
blanchet@55183
   120
  - Renamed options:
blanchet@55183
   121
      isar_compress ~> compress_isar
blanchet@55183
   122
      isar_try0 ~> try0_isar
blanchet@55183
   123
    INCOMPATIBILITY.
blanchet@55183
   124
blanchet@55183
   125
* Try0: Added 'algebra' and 'meson' to the set of proof methods.
blanchet@55183
   126
wenzelm@55015
   127
* The symbol "\<newline>" may be used within char or string literals
wenzelm@55015
   128
to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
wenzelm@55015
   129
wenzelm@55007
   130
* Activation of Z3 now works via "z3_non_commercial" system option
wenzelm@55007
   131
(without requiring restart), instead of former settings variable
wenzelm@55007
   132
"Z3_NON_COMMERCIAL".  The option can be edited in Isabelle/jEdit menu
wenzelm@55007
   133
Plugin Options / Isabelle / General.
wenzelm@55007
   134
wenzelm@54893
   135
* "declare [[code abort: ...]]" replaces "code_abort ...".
wenzelm@54893
   136
INCOMPATIBILITY.
wenzelm@54893
   137
wenzelm@54893
   138
* "declare [[code drop: ...]]" drops all code equations associated
haftmann@54890
   139
with the given constants.
haftmann@54890
   140
haftmann@54864
   141
* Abolished slightly odd global lattice interpretation for min/max.
haftmann@54864
   142
haftmann@54864
   143
Fact consolidations:
haftmann@54864
   144
    min_max.inf_assoc ~> min.assoc
haftmann@54864
   145
    min_max.inf_commute ~> min.commute
haftmann@54864
   146
    min_max.inf_left_commute ~> min.left_commute
haftmann@54864
   147
    min_max.inf_idem ~> min.idem
haftmann@54864
   148
    min_max.inf_left_idem ~> min.left_idem
haftmann@54864
   149
    min_max.inf_right_idem ~> min.right_idem
haftmann@54864
   150
    min_max.sup_assoc ~> max.assoc
haftmann@54864
   151
    min_max.sup_commute ~> max.commute
haftmann@54864
   152
    min_max.sup_left_commute ~> max.left_commute
haftmann@54864
   153
    min_max.sup_idem ~> max.idem
haftmann@54864
   154
    min_max.sup_left_idem ~> max.left_idem
haftmann@54864
   155
    min_max.sup_inf_distrib1 ~> max_min_distrib2
haftmann@54864
   156
    min_max.sup_inf_distrib2 ~> max_min_distrib1
haftmann@54864
   157
    min_max.inf_sup_distrib1 ~> min_max_distrib2
haftmann@54864
   158
    min_max.inf_sup_distrib2 ~> min_max_distrib1
haftmann@54864
   159
    min_max.distrib ~> min_max_distribs
haftmann@54864
   160
    min_max.inf_absorb1 ~> min.absorb1
haftmann@54864
   161
    min_max.inf_absorb2 ~> min.absorb2
haftmann@54864
   162
    min_max.sup_absorb1 ~> max.absorb1
haftmann@54864
   163
    min_max.sup_absorb2 ~> max.absorb2
haftmann@54864
   164
    min_max.le_iff_inf ~> min.absorb_iff1
haftmann@54864
   165
    min_max.le_iff_sup ~> max.absorb_iff2
haftmann@54864
   166
    min_max.inf_le1 ~> min.cobounded1
haftmann@54864
   167
    min_max.inf_le2 ~> min.cobounded2
haftmann@54864
   168
    le_maxI1, min_max.sup_ge1 ~> max.cobounded1
haftmann@54864
   169
    le_maxI2, min_max.sup_ge2 ~> max.cobounded2
haftmann@54864
   170
    min_max.le_infI1 ~> min.coboundedI1
haftmann@54864
   171
    min_max.le_infI2 ~> min.coboundedI2
haftmann@54864
   172
    min_max.le_supI1 ~> max.coboundedI1
haftmann@54864
   173
    min_max.le_supI2 ~> max.coboundedI2
haftmann@54864
   174
    min_max.less_infI1 ~> min.strict_coboundedI1
haftmann@54864
   175
    min_max.less_infI2 ~> min.strict_coboundedI2
haftmann@54864
   176
    min_max.less_supI1 ~> max.strict_coboundedI1
haftmann@54864
   177
    min_max.less_supI2 ~> max.strict_coboundedI2
haftmann@54864
   178
    min_max.inf_mono ~> min.mono
haftmann@54864
   179
    min_max.sup_mono ~> max.mono
haftmann@54864
   180
    min_max.le_infI, min_max.inf_greatest ~> min.boundedI
haftmann@54864
   181
    min_max.le_supI, min_max.sup_least ~> max.boundedI
haftmann@54864
   182
    min_max.le_inf_iff ~> min.bounded_iff
haftmann@54864
   183
    min_max.le_sup_iff ~> max.bounded_iff
haftmann@54864
   184
haftmann@54864
   185
For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
haftmann@54864
   186
min.left_commute, min.left_idem, max.commute, max.assoc,
haftmann@54864
   187
max.left_commute, max.left_idem directly.
haftmann@54864
   188
haftmann@54864
   189
For min_max.inf_sup_ord, prefer (one of) min.cobounded1, min.cobounded2,
haftmann@54864
   190
max.cobounded1m max.cobounded2 directly.
haftmann@54864
   191
haftmann@54864
   192
For min_ac or max_ac, prefor more general collection ac_simps.
haftmann@54864
   193
haftmann@54864
   194
INCOMPATBILITY. 
haftmann@54864
   195
haftmann@54850
   196
* Word library: bit representations prefer type bool over type bit.
haftmann@54850
   197
INCOMPATIBILITY.
haftmann@54850
   198
haftmann@54745
   199
* Theorem disambiguation Inf_le_Sup (on finite sets) ~> Inf_fin_le_Sup_fin.
haftmann@54850
   200
INCOMPATIBILITY.
haftmann@54745
   201
haftmann@54708
   202
* Code generations are provided for make, fields, extend and truncate
haftmann@54708
   203
operations on records.
haftmann@54708
   204
haftmann@54295
   205
* Qualified constant names Wellfounded.acc, Wellfounded.accp.
haftmann@54295
   206
INCOMPATIBILITY.
haftmann@54295
   207
haftmann@54228
   208
* Fact generalization and consolidation:
haftmann@54228
   209
    neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
haftmann@54228
   210
INCOMPATIBILITY.
haftmann@54228
   211
haftmann@54228
   212
* Purely algebraic definition of even.  Fact generalization and consolidation:
haftmann@54228
   213
    nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
haftmann@54228
   214
    even_zero_(nat|int) ~> even_zero
haftmann@54228
   215
INCOMPATIBILITY.
wenzelm@54055
   216
haftmann@54489
   217
* Abolished neg_numeral.
haftmann@54489
   218
  * Canonical representation for minus one is "- 1".
haftmann@54489
   219
  * Canonical representation for other negative numbers is "- (numeral _)".
haftmann@54502
   220
  * When devising rule sets for number calculation, consider the
haftmann@54587
   221
    following canonical cases: 0, 1, numeral _, - 1, - numeral _.
haftmann@54587
   222
  * HOLogic.dest_number also recognizes numerals in non-canonical forms
wenzelm@54893
   223
    like "numeral One", "- numeral One", "- 0" and even "- ... - _".
haftmann@54489
   224
  * Syntax for negative numerals is mere input syntax.
haftmann@54489
   225
INCOMPATBILITY.
haftmann@54489
   226
haftmann@54230
   227
* Elimination of fact duplicates:
haftmann@54230
   228
    equals_zero_I ~> minus_unique
haftmann@54230
   229
    diff_eq_0_iff_eq ~> right_minus_eq
traytel@54588
   230
    nat_infinite ~> infinite_UNIV_nat
traytel@54588
   231
    int_infinite ~> infinite_UNIV_int
haftmann@54230
   232
INCOMPATIBILITY.
haftmann@54230
   233
haftmann@54230
   234
* Fact name consolidation:
haftmann@54230
   235
    diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
haftmann@54250
   236
    minus_le_self_iff ~> neg_less_eq_nonneg
haftmann@54250
   237
    le_minus_self_iff ~> less_eq_neg_nonpos
haftmann@54250
   238
    neg_less_nonneg ~> neg_less_pos
haftmann@54250
   239
    less_minus_self_iff ~> less_neg_neg [simp]
haftmann@54230
   240
INCOMPATIBILITY.
haftmann@54230
   241
haftmann@54230
   242
* More simplification rules on unary and binary minus:
haftmann@54230
   243
add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
haftmann@54230
   244
add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
haftmann@54230
   245
add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
haftmann@54230
   246
le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
haftmann@54230
   247
minus_add_cancel, uminus_add_conv_diff.  These correspondingly
haftmann@54230
   248
have been taken away from fact collections algebra_simps and
haftmann@54230
   249
field_simps.  INCOMPATIBILITY.
haftmann@54230
   250
haftmann@54230
   251
To restore proofs, the following patterns are helpful:
haftmann@54230
   252
haftmann@54230
   253
a) Arbitrary failing proof not involving "diff_def":
haftmann@54230
   254
Consider simplification with algebra_simps or field_simps.
haftmann@54230
   255
haftmann@54230
   256
b) Lifting rules from addition to subtraction:
wenzelm@54893
   257
Try with "using <rule for addition> of [... "- _" ...]" by simp".
haftmann@54230
   258
haftmann@54230
   259
c) Simplification with "diff_def": just drop "diff_def".
haftmann@54230
   260
Consider simplification with algebra_simps or field_simps;
haftmann@54230
   261
or the brute way with
haftmann@54230
   262
"simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
haftmann@54230
   263
hoelzl@54264
   264
* SUP and INF generalized to conditionally_complete_lattice
hoelzl@54264
   265
hoelzl@54264
   266
* Theory Lubs moved HOL image to HOL-Library. It is replaced by
hoelzl@54264
   267
Conditionally_Complete_Lattices.   INCOMPATIBILITY.
hoelzl@54264
   268
hoelzl@54264
   269
* Introduce bdd_above and bdd_below in Conditionally_Complete_Lattices, use them
hoelzl@54264
   270
instead of explicitly stating boundedness of sets.
hoelzl@54264
   271
Andreas@54631
   272
* ccpo.admissible quantifies only over non-empty chains to allow
Andreas@54631
   273
more syntax-directed proof rules; the case of the empty chain
Andreas@54631
   274
shows up as additional case in fixpoint induction proofs.
Andreas@54631
   275
INCOMPATIBILITY
hoelzl@54264
   276
boehmes@55049
   277
* Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
boehmes@55049
   278
wenzelm@54672
   279
* Nitpick:
wenzelm@54672
   280
  - Fixed soundness bug whereby mutually recursive datatypes could take
wenzelm@54672
   281
    infinite values.
wenzelm@54672
   282
immler@54787
   283
* HOL-Multivariate_Analysis:
immler@54787
   284
  - type class ordered_real_vector for ordered vector spaces
immler@54787
   285
  - changed order of ordered_euclidean_space to be compatible with
immler@54787
   286
    pointwise ordering on products. Therefore instance of
immler@54787
   287
    conditionally_complete_lattice and ordered_real_vector.
immler@54787
   288
    INCOMPATIBILITY: use box instead of greaterThanLessThan or
immler@54787
   289
    explicit set-comprehensions with eucl_less for other (half-) open
immler@54787
   290
    intervals.
immler@54787
   291
wenzelm@54672
   292
wenzelm@54449
   293
*** ML ***
wenzelm@54449
   294
wenzelm@55143
   295
* Proper context discipline for read_instantiate and instantiate_tac:
wenzelm@55143
   296
variables that are meant to become schematic need to be given as
wenzelm@55143
   297
fixed, and are generalized by the explicit context of local variables.
wenzelm@55143
   298
This corresponds to Isar attributes "where" and "of" with 'for'
wenzelm@55143
   299
declaration.  INCOMPATIBILITY, also due to potential change of indices
wenzelm@55143
   300
of schematic variables.
wenzelm@55143
   301
wenzelm@54449
   302
* Toplevel function "use" refers to raw ML bootstrap environment,
wenzelm@54449
   303
without Isar context nor antiquotations.  Potential INCOMPATIBILITY.
wenzelm@54449
   304
Note that 'ML_file' is the canonical command to load ML files into the
wenzelm@54449
   305
formal context.
wenzelm@54449
   306
wenzelm@54742
   307
* Proper context for basic Simplifier operations: rewrite_rule,
wenzelm@54742
   308
rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
wenzelm@54742
   309
pass runtime Proof.context (and ensure that the simplified entity
wenzelm@54742
   310
actually belongs to it).
wenzelm@54742
   311
wenzelm@54449
   312
wenzelm@54683
   313
*** System ***
wenzelm@54683
   314
wenzelm@54683
   315
* Simplified "isabelle display" tool.  Settings variables DVI_VIEWER
wenzelm@54683
   316
and PDF_VIEWER now refer to the actual programs, not shell
wenzelm@54683
   317
command-lines.  Discontinued option -c: invocation may be asynchronous
wenzelm@54683
   318
via desktop environment, without any special precautions.  Potential
wenzelm@54683
   319
INCOMPATIBILITY with ambitious private settings.
wenzelm@54683
   320
wenzelm@54683
   321
* Improved 'display_drafts' concerning desktop integration and
wenzelm@54683
   322
repeated invocation in PIDE front-end: re-use single file
wenzelm@54683
   323
$ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
wenzelm@54683
   324
wenzelm@54683
   325
wenzelm@54449
   326
wenzelm@54639
   327
New in Isabelle2013-2 (December 2013)
wenzelm@54639
   328
-------------------------------------
wenzelm@54639
   329
wenzelm@54639
   330
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@54639
   331
wenzelm@54639
   332
* More robust editing of running commands with internal forks,
wenzelm@54639
   333
e.g. non-terminating 'by' steps.
wenzelm@54639
   334
wenzelm@54641
   335
* More relaxed Sledgehammer panel: avoid repeated application of query
wenzelm@54641
   336
after edits surrounding the command location.
wenzelm@54641
   337
wenzelm@54648
   338
* More status information about commands that are interrupted
wenzelm@54648
   339
accidentally (via physical event or Poly/ML runtime system signal,
wenzelm@54648
   340
e.g. out-of-memory).
wenzelm@54648
   341
wenzelm@54653
   342
wenzelm@54653
   343
*** System ***
wenzelm@54653
   344
wenzelm@54653
   345
* More robust termination of external processes managed by
wenzelm@54664
   346
Isabelle/ML: support cancellation of tasks within the range of
wenzelm@54664
   347
milliseconds, as required for PIDE document editing with automatically
wenzelm@54664
   348
tried tools (e.g. Sledgehammer).
wenzelm@54653
   349
wenzelm@54648
   350
* Reactivated Isabelle/Scala kill command for external processes on
wenzelm@54648
   351
Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
wenzelm@54648
   352
workaround for some Debian/Ubuntu Linux versions from 2013.
wenzelm@54648
   353
wenzelm@54639
   354
wenzelm@54639
   355
wenzelm@53971
   356
New in Isabelle2013-1 (November 2013)
wenzelm@53971
   357
-------------------------------------
wenzelm@50994
   358
wenzelm@51293
   359
*** General ***
wenzelm@51293
   360
wenzelm@53971
   361
* Discontinued obsolete 'uses' within theory header.  Note that
wenzelm@53971
   362
commands like 'ML_file' work without separate declaration of file
wenzelm@53971
   363
dependencies.  Minor INCOMPATIBILITY.
wenzelm@53971
   364
wenzelm@53971
   365
* Discontinued redundant 'use' command, which was superseded by
wenzelm@53971
   366
'ML_file' in Isabelle2013.  Minor INCOMPATIBILITY.
wenzelm@53971
   367
wenzelm@53016
   368
* Simplified subscripts within identifiers, using plain \<^sub>
wenzelm@53016
   369
instead of the second copy \<^isub> and \<^isup>.  Superscripts are
wenzelm@53016
   370
only for literal tokens within notation; explicit mixfix annotations
wenzelm@53016
   371
for consts or fixed variables may be used as fall-back for unusual
wenzelm@53016
   372
names.  Obsolete \<twosuperior> has been expanded to \<^sup>2 in
wenzelm@53016
   373
Isabelle/HOL.  INCOMPATIBILITY, use "isabelle update_sub_sup" to
wenzelm@53016
   374
standardize symbols as a starting point for further manual cleanup.
wenzelm@53016
   375
The ML reference variable "legacy_isub_isup" may be set as temporary
wenzelm@53016
   376
workaround, to make the prover accept a subset of the old identifier
wenzelm@53016
   377
syntax.
wenzelm@53016
   378
wenzelm@53021
   379
* Document antiquotations: term style "isub" has been renamed to
wenzelm@53021
   380
"sub".  Minor INCOMPATIBILITY.
wenzelm@53021
   381
wenzelm@52487
   382
* Uniform management of "quick_and_dirty" as system option (see also
wenzelm@52487
   383
"isabelle options"), configuration option within the context (see also
wenzelm@52487
   384
Config.get in Isabelle/ML), and attribute in Isabelle/Isar.  Minor
wenzelm@52487
   385
INCOMPATIBILITY, need to use more official Isabelle means to access
wenzelm@52487
   386
quick_and_dirty, instead of historical poking into mutable reference.
wenzelm@52059
   387
wenzelm@52060
   388
* Renamed command 'print_configs' to 'print_options'.  Minor
wenzelm@52060
   389
INCOMPATIBILITY.
wenzelm@52060
   390
wenzelm@52430
   391
* Proper diagnostic command 'print_state'.  Old 'pr' (with its
wenzelm@52430
   392
implicit change of some global references) is retained for now as
wenzelm@52430
   393
control command, e.g. for ProofGeneral 3.7.x.
wenzelm@52430
   394
wenzelm@52549
   395
* Discontinued 'print_drafts' command with its old-fashioned PS output
wenzelm@52549
   396
and Unix command-line print spooling.  Minor INCOMPATIBILITY: use
wenzelm@52549
   397
'display_drafts' instead and print via the regular document viewer.
wenzelm@52549
   398
wenzelm@53971
   399
* Updated and extended "isar-ref" and "implementation" manual,
wenzelm@53971
   400
eliminated old "ref" manual.
wenzelm@53971
   401
wenzelm@51293
   402
wenzelm@51533
   403
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@51533
   404
wenzelm@53971
   405
* New manual "jedit" for Isabelle/jEdit, see isabelle doc or
wenzelm@53852
   406
Documentation panel.
wenzelm@53852
   407
wenzelm@53971
   408
* Dockable window "Documentation" provides access to Isabelle
wenzelm@53971
   409
documentation.
wenzelm@52646
   410
wenzelm@52949
   411
* Dockable window "Find" provides query operations for formal entities
wenzelm@52949
   412
(GUI front-end to 'find_theorems' command).
wenzelm@52949
   413
wenzelm@53050
   414
* Dockable window "Sledgehammer" manages asynchronous / parallel
wenzelm@53050
   415
sledgehammer runs over existing document sources, independently of
wenzelm@53050
   416
normal editing and checking process.
wenzelm@53050
   417
wenzelm@51533
   418
* Dockable window "Timing" provides an overview of relevant command
wenzelm@54332
   419
timing information, depending on option jedit_timing_threshold.  The
wenzelm@54332
   420
same timing information is shown in the extended tooltip of the
wenzelm@54332
   421
command keyword, when hovering the mouse over it while the CONTROL or
wenzelm@54332
   422
COMMAND modifier is pressed.
wenzelm@51533
   423
wenzelm@53971
   424
* Improved dockable window "Theories": Continuous checking of proof
wenzelm@53971
   425
document (visible and required parts) may be controlled explicitly,
wenzelm@53971
   426
using check box or shortcut "C+e ENTER".  Individual theory nodes may
wenzelm@53971
   427
be marked explicitly as required and checked in full, using check box
wenzelm@53971
   428
or shortcut "C+e SPACE".
wenzelm@53971
   429
wenzelm@54305
   430
* Improved completion mechanism, which is now managed by the
wenzelm@54305
   431
Isabelle/jEdit plugin instead of SideKick.  Refined table of Isabelle
wenzelm@54305
   432
symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
wenzelm@54305
   433
wenzelm@54319
   434
* Standard jEdit keyboard shortcut C+b complete-word is remapped to
wenzelm@54319
   435
isabelle.complete for explicit completion in Isabelle sources.
wenzelm@54319
   436
INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
wenzelm@54319
   437
to resolve conflict.
wenzelm@54319
   438
wenzelm@54305
   439
* Improved support of various "minor modes" for Isabelle NEWS,
wenzelm@54305
   440
options, session ROOT etc., with completion and SideKick tree view.
wenzelm@54305
   441
wenzelm@53971
   442
* Strictly monotonic document update, without premature cancellation of
wenzelm@53971
   443
running transactions that are still needed: avoid reset/restart of
wenzelm@53971
   444
such command executions while editing.
wenzelm@53271
   445
wenzelm@53971
   446
* Support for asynchronous print functions, as overlay to existing
wenzelm@53971
   447
document content.
wenzelm@53971
   448
wenzelm@53971
   449
* Support for automatic tools in HOL, which try to prove or disprove
wenzelm@53971
   450
toplevel theorem statements.
wenzelm@53971
   451
wenzelm@53971
   452
* Action isabelle.reset-font-size resets main text area font size
wenzelm@54365
   453
according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
wenzelm@54365
   454
also "Plugin Options / Isabelle / General").  It can be bound to some
wenzelm@54365
   455
keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
wenzelm@53971
   456
wenzelm@53971
   457
* File specifications in jEdit (e.g. file browser) may refer to
wenzelm@54351
   458
$ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms.  Discontinued
wenzelm@54351
   459
obsolete $ISABELLE_HOME_WINDOWS variable.
wenzelm@53971
   460
wenzelm@53971
   461
* Improved support for Linux look-and-feel "GTK+", see also "Utilities
wenzelm@53971
   462
/ Global Options / Appearance".
wenzelm@53971
   463
wenzelm@53971
   464
* Improved support of native Mac OS X functionality via "MacOSX"
wenzelm@53971
   465
plugin, which is now enabled by default.
wenzelm@53971
   466
wenzelm@51533
   467
wenzelm@51313
   468
*** Pure ***
wenzelm@51313
   469
ballarin@54049
   470
* Commands 'interpretation' and 'sublocale' are now target-sensitive.
ballarin@54049
   471
In particular, 'interpretation' allows for non-persistent
ballarin@54049
   472
interpretation within "context ... begin ... end" blocks offering a
ballarin@54049
   473
light-weight alternative to 'sublocale'.  See "isar-ref" manual for
ballarin@54049
   474
details.
haftmann@51747
   475
ballarin@51565
   476
* Improved locales diagnostic command 'print_dependencies'.
ballarin@51565
   477
wenzelm@51313
   478
* Discontinued obsolete 'axioms' command, which has been marked as
wenzelm@51313
   479
legacy since Isabelle2009-2.  INCOMPATIBILITY, use 'axiomatization'
wenzelm@51313
   480
instead, while observing its uniform scope for polymorphism.
wenzelm@51313
   481
wenzelm@51316
   482
* Discontinued empty name bindings in 'axiomatization'.
wenzelm@51316
   483
INCOMPATIBILITY.
wenzelm@51316
   484
wenzelm@53971
   485
* System option "proofs" has been discontinued.  Instead the global
wenzelm@53971
   486
state of Proofterm.proofs is persistently compiled into logic images
wenzelm@53971
   487
as required, notably HOL-Proofs.  Users no longer need to change
wenzelm@53971
   488
Proofterm.proofs dynamically.  Minor INCOMPATIBILITY.
wenzelm@53971
   489
wenzelm@53971
   490
* Syntax translation functions (print_translation etc.) always depend
wenzelm@53971
   491
on Proof.context.  Discontinued former "(advanced)" option -- this is
wenzelm@53971
   492
now the default.  Minor INCOMPATIBILITY.
wenzelm@53971
   493
wenzelm@53971
   494
* Former global reference trace_unify_fail is now available as
wenzelm@53971
   495
configuration option "unify_trace_failure" (global context only).
wenzelm@53971
   496
wenzelm@52463
   497
* SELECT_GOAL now retains the syntactic context of the overall goal
wenzelm@52463
   498
state (schematic variables etc.).  Potential INCOMPATIBILITY in rare
wenzelm@52463
   499
situations.
wenzelm@52463
   500
wenzelm@51313
   501
hoelzl@51002
   502
*** HOL ***
hoelzl@51002
   503
wenzelm@54032
   504
* Stronger precedence of syntax for big intersection and union on
wenzelm@54032
   505
sets, in accordance with corresponding lattice operations.
wenzelm@54032
   506
INCOMPATIBILITY.
wenzelm@54032
   507
wenzelm@54032
   508
* Notation "{p:A. P}" now allows tuple patterns as well.
wenzelm@54032
   509
wenzelm@54032
   510
* Nested case expressions are now translated in a separate check phase
wenzelm@54032
   511
rather than during parsing. The data for case combinators is separated
wenzelm@54032
   512
from the datatype package. The declaration attribute
wenzelm@54032
   513
"case_translation" can be used to register new case combinators:
wenzelm@54032
   514
wenzelm@54032
   515
  declare [[case_translation case_combinator constructor1 ... constructorN]]
haftmann@52637
   516
haftmann@52435
   517
* Code generator:
wenzelm@53160
   518
  - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
wenzelm@53160
   519
    'code_instance'.
wenzelm@53160
   520
  - 'code_identifier' declares name hints for arbitrary identifiers in
wenzelm@53160
   521
    generated code, subsuming 'code_modulename'.
wenzelm@53983
   522
wenzelm@53983
   523
See the isar-ref manual for syntax diagrams, and the HOL theories for
wenzelm@53983
   524
examples.
haftmann@52435
   525
wenzelm@54032
   526
* Attibute 'code': 'code' now declares concrete and abstract code
wenzelm@54032
   527
equations uniformly.  Use explicit 'code equation' and 'code abstract'
wenzelm@54032
   528
to distinguish both when desired.
wenzelm@54032
   529
wenzelm@54032
   530
* Discontinued theories Code_Integer and Efficient_Nat by a more
wenzelm@54032
   531
fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
wenzelm@54032
   532
Code_Target_Nat and Code_Target_Numeral.  See the tutorial on code
wenzelm@54032
   533
generation for details.  INCOMPATIBILITY.
wenzelm@54032
   534
wenzelm@54032
   535
* Numeric types are mapped by default to target language numerals:
wenzelm@54032
   536
natural (replaces former code_numeral) and integer (replaces former
wenzelm@54032
   537
code_int).  Conversions are available as integer_of_natural /
wenzelm@54032
   538
natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
wenzelm@54032
   539
Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
wenzelm@54032
   540
ML).  INCOMPATIBILITY.
wenzelm@54032
   541
wenzelm@54032
   542
* Function package: For mutually recursive functions f and g, separate
wenzelm@54032
   543
cases rules f.cases and g.cases are generated instead of unusable
wenzelm@54032
   544
f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
wenzelm@54032
   545
in the case that the unusable rule was used nevertheless.
wenzelm@54032
   546
wenzelm@54032
   547
* Function package: For each function f, new rules f.elims are
wenzelm@54032
   548
generated, which eliminate equalities of the form "f x = t".
wenzelm@54032
   549
wenzelm@54032
   550
* New command 'fun_cases' derives ad-hoc elimination rules for
wenzelm@54032
   551
function equations as simplified instances of f.elims, analogous to
wenzelm@54032
   552
inductive_cases.  See ~~/src/HOL/ex/Fundefs.thy for some examples.
blanchet@53307
   553
kuncar@54021
   554
* Lifting:
kuncar@54021
   555
  - parametrized correspondence relations are now supported:
wenzelm@54378
   556
    + parametricity theorems for the raw term can be specified in
kuncar@54021
   557
      the command lift_definition, which allow us to generate stronger
kuncar@54021
   558
      transfer rules
kuncar@54021
   559
    + setup_lifting generates stronger transfer rules if parametric
kuncar@54021
   560
      correspondence relation can be generated
kuncar@54021
   561
    + various new properties of the relator must be specified to support
kuncar@54021
   562
      parametricity
kuncar@54021
   563
    + parametricity theorem for the Quotient relation can be specified
kuncar@54021
   564
  - setup_lifting generates domain rules for the Transfer package
kuncar@54021
   565
  - stronger reflexivity prover of respectfulness theorems for type
kuncar@54021
   566
    copies
kuncar@54021
   567
  - ===> and --> are now local. The symbols can be introduced
kuncar@54021
   568
    by interpreting the locale lifting_syntax (typically in an
kuncar@54021
   569
    anonymous context)
wenzelm@54378
   570
  - Lifting/Transfer relevant parts of Library/Quotient_* are now in
kuncar@54021
   571
    Main. Potential INCOMPATIBILITY
kuncar@54021
   572
  - new commands for restoring and deleting Lifting/Transfer context:
kuncar@54021
   573
    lifting_forget, lifting_update
wenzelm@54378
   574
  - the command print_quotmaps was renamed to print_quot_maps.
kuncar@54021
   575
    INCOMPATIBILITY
kuncar@54021
   576
kuncar@54021
   577
* Transfer:
wenzelm@54378
   578
  - better support for domains in Transfer: replace Domainp T
kuncar@54021
   579
    by the actual invariant in a transferred goal
kuncar@54021
   580
  - transfer rules can have as assumptions other transfer rules
kuncar@54021
   581
  - Experimental support for transferring from the raw level to the
kuncar@54021
   582
    abstract level: Transfer.transferred attribute
kuncar@54021
   583
  - Attribute version of the transfer method: untransferred attribute
kuncar@54021
   584
haftmann@52286
   585
* Reification and reflection:
wenzelm@53160
   586
  - Reification is now directly available in HOL-Main in structure
wenzelm@53160
   587
    "Reification".
wenzelm@53160
   588
  - Reflection now handles multiple lists with variables also.
wenzelm@53160
   589
  - The whole reflection stack has been decomposed into conversions.
haftmann@52286
   590
INCOMPATIBILITY.
haftmann@52286
   591
haftmann@51489
   592
* Revised devices for recursive definitions over finite sets:
haftmann@51489
   593
  - Only one fundamental fold combinator on finite set remains:
haftmann@51489
   594
    Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
haftmann@51489
   595
    This is now identity on infinite sets.
wenzelm@52745
   596
  - Locales ("mini packages") for fundamental definitions with
haftmann@51489
   597
    Finite_Set.fold: folding, folding_idem.
haftmann@51489
   598
  - Locales comm_monoid_set, semilattice_order_set and
haftmann@51489
   599
    semilattice_neutr_order_set for big operators on sets.
haftmann@51489
   600
    See theory Big_Operators for canonical examples.
haftmann@51489
   601
    Note that foundational constants comm_monoid_set.F and
haftmann@51489
   602
    semilattice_set.F correspond to former combinators fold_image
haftmann@51489
   603
    and fold1 respectively.  These are now gone.  You may use
haftmann@51490
   604
    those foundational constants as substitutes, but it is
wenzelm@53983
   605
    preferable to interpret the above locales accordingly.
haftmann@51489
   606
  - Dropped class ab_semigroup_idem_mult (special case of lattice,
haftmann@51489
   607
    no longer needed in connection with Finite_Set.fold etc.)
haftmann@51489
   608
  - Fact renames:
haftmann@51489
   609
      card.union_inter ~> card_Un_Int [symmetric]
haftmann@51489
   610
      card.union_disjoint ~> card_Un_disjoint
haftmann@51489
   611
INCOMPATIBILITY.
haftmann@51489
   612
haftmann@51487
   613
* Locale hierarchy for abstract orderings and (semi)lattices.
haftmann@51487
   614
wenzelm@53526
   615
* Complete_Partial_Order.admissible is defined outside the type class
wenzelm@53526
   616
ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
wenzelm@53526
   617
class predicate assumption or sort constraint when possible.
Andreas@53362
   618
INCOMPATIBILITY.
Andreas@53362
   619
wenzelm@53160
   620
* Introduce type class "conditionally_complete_lattice": Like a
wenzelm@53160
   621
complete lattice but does not assume the existence of the top and
wenzelm@53160
   622
bottom elements.  Allows to generalize some lemmas about reals and
wenzelm@53160
   623
extended reals.  Removed SupInf and replaced it by the instantiation
wenzelm@53160
   624
of conditionally_complete_lattice for real. Renamed lemmas about
wenzelm@53160
   625
conditionally-complete lattice from Sup_... to cSup_... and from
wenzelm@53160
   626
Inf_...  to cInf_... to avoid hidding of similar complete lattice
wenzelm@53160
   627
lemmas.
wenzelm@53160
   628
wenzelm@53160
   629
* Introduce type class linear_continuum as combination of
wenzelm@53160
   630
conditionally-complete lattices and inner dense linorders which have
wenzelm@53160
   631
more than one element.  INCOMPATIBILITY.
wenzelm@53160
   632
wenzelm@53983
   633
* Introduced type classes order_top and order_bot. The old classes top
wenzelm@53983
   634
and bot only contain the syntax without assumptions.  INCOMPATIBILITY:
wenzelm@53983
   635
Rename bot -> order_bot, top -> order_top
lammich@53683
   636
wenzelm@53160
   637
* Introduce type classes "no_top" and "no_bot" for orderings without
wenzelm@53160
   638
top and bottom elements.
hoelzl@51732
   639
hoelzl@51732
   640
* Split dense_linorder into inner_dense_order and no_top, no_bot.
hoelzl@51732
   641
hoelzl@51732
   642
* Complex_Main: Unify and move various concepts from
wenzelm@53160
   643
HOL-Multivariate_Analysis to HOL-Complex_Main.
hoelzl@51732
   644
wenzelm@53983
   645
 - Introduce type class (lin)order_topology and
wenzelm@53983
   646
   linear_continuum_topology.  Allows to generalize theorems about
wenzelm@53983
   647
   limits and order.  Instances are reals and extended reals.
hoelzl@51732
   648
hoelzl@51732
   649
 - continuous and continuos_on from Multivariate_Analysis:
wenzelm@53983
   650
   "continuous" is the continuity of a function at a filter.  "isCont"
wenzelm@53983
   651
   is now an abbrevitation: "isCont x f == continuous (at _) f".
wenzelm@53983
   652
wenzelm@53983
   653
   Generalized continuity lemmas from isCont to continuous on an
wenzelm@53983
   654
   arbitrary filter.
wenzelm@53983
   655
wenzelm@53983
   656
 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
wenzelm@53983
   657
   compactness of closed intervals on reals. Continuous functions
wenzelm@53983
   658
   attain infimum and supremum on compact sets. The inverse of a
wenzelm@53983
   659
   continuous function is continuous, when the function is continuous
wenzelm@53983
   660
   on a compact set.
hoelzl@51732
   661
hoelzl@51732
   662
 - connected from Multivariate_Analysis. Use it to prove the
hoelzl@51775
   663
   intermediate value theorem. Show connectedness of intervals on
hoelzl@51775
   664
   linear_continuum_topology).
hoelzl@51732
   665
hoelzl@51732
   666
 - first_countable_topology from Multivariate_Analysis. Is used to
wenzelm@53983
   667
   show equivalence of properties on the neighbourhood filter of x and
wenzelm@53983
   668
   on all sequences converging to x.
wenzelm@53983
   669
wenzelm@53983
   670
 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
wenzelm@53983
   671
   theorems from Library/FDERIV.thy to Deriv.thy and base the
wenzelm@53983
   672
   definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
wenzelm@53983
   673
   which are restricted to sets, i.e. to represent derivatives from
wenzelm@53983
   674
   left or right.
hoelzl@51732
   675
hoelzl@51732
   676
 - Removed the within-filter. It is replaced by the principal filter:
hoelzl@51732
   677
hoelzl@51732
   678
     F within X = inf F (principal X)
hoelzl@51732
   679
hoelzl@51732
   680
 - Introduce "at x within U" as a single constant, "at x" is now an
hoelzl@51732
   681
   abbreviation for "at x within UNIV"
hoelzl@51732
   682
wenzelm@53983
   683
 - Introduce named theorem collections tendsto_intros,
wenzelm@53983
   684
   continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
wenzelm@53983
   685
   in tendsto_intros (or FDERIV_intros) are also available as
wenzelm@53983
   686
   tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
wenzelm@53983
   687
   is replaced by a congruence rule. This allows to apply them as
wenzelm@53983
   688
   intro rules and then proving equivalence by the simplifier.
hoelzl@51732
   689
hoelzl@51732
   690
 - Restructured theories in HOL-Complex_Main:
hoelzl@51732
   691
hoelzl@51732
   692
   + Moved RealDef and RComplete into Real
hoelzl@51732
   693
hoelzl@51732
   694
   + Introduced Topological_Spaces and moved theorems about
hoelzl@51732
   695
     topological spaces, filters, limits and continuity to it
hoelzl@51732
   696
hoelzl@51732
   697
   + Renamed RealVector to Real_Vector_Spaces
hoelzl@51732
   698
wenzelm@53983
   699
   + Split Lim, SEQ, Series into Topological_Spaces,
wenzelm@53983
   700
     Real_Vector_Spaces, and Limits
hoelzl@51732
   701
hoelzl@51732
   702
   + Moved Ln and Log to Transcendental
hoelzl@51732
   703
hoelzl@51732
   704
   + Moved theorems about continuity from Deriv to Topological_Spaces
hoelzl@51732
   705
hoelzl@51732
   706
 - Remove various auxiliary lemmas.
hoelzl@51732
   707
hoelzl@51732
   708
INCOMPATIBILITY.
hoelzl@51002
   709
blanchet@53738
   710
* Nitpick:
blanchet@53803
   711
  - Added option "spy"
blanchet@53738
   712
  - Reduce incidence of "too high arity" errors
blanchet@53738
   713
blanchet@51137
   714
* Sledgehammer:
blanchet@51137
   715
  - Renamed option:
blanchet@51137
   716
      isar_shrink ~> isar_compress
blanchet@53738
   717
    INCOMPATIBILITY.
blanchet@53801
   718
  - Added options "isar_try0", "spy"
blanchet@53728
   719
  - Better support for "isar_proofs"
blanchet@53766
   720
  - MaSh has been fined-tuned and now runs as a local server
blanchet@51137
   721
wenzelm@54032
   722
* Improved support for ad hoc overloading of constants (see also
wenzelm@54032
   723
isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
wenzelm@54032
   724
wenzelm@54032
   725
* Library/Polynomial.thy:
wenzelm@54032
   726
  - Use lifting for primitive definitions.
wenzelm@54032
   727
  - Explicit conversions from and to lists of coefficients, used for
wenzelm@54032
   728
    generated code.
wenzelm@54032
   729
  - Replaced recursion operator poly_rec by fold_coeffs.
wenzelm@54032
   730
  - Prefer pre-existing gcd operation for gcd.
wenzelm@54032
   731
  - Fact renames:
wenzelm@54032
   732
    poly_eq_iff ~> poly_eq_poly_eq_iff
wenzelm@54032
   733
    poly_ext ~> poly_eqI
wenzelm@54032
   734
    expand_poly_eq ~> poly_eq_iff
wenzelm@54032
   735
IMCOMPATIBILITY.
wenzelm@54032
   736
wenzelm@54032
   737
* New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
wenzelm@54032
   738
case_of_simps to convert function definitions between a list of
wenzelm@54032
   739
equations with patterns on the lhs and a single equation with case
wenzelm@54032
   740
expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
wenzelm@54032
   741
wenzelm@54032
   742
* New Library/FSet.thy: type of finite sets defined as a subtype of
wenzelm@54032
   743
sets defined by Lifting/Transfer.
wenzelm@54032
   744
wenzelm@54032
   745
* Discontinued theory src/HOL/Library/Eval_Witness.  INCOMPATIBILITY.
wenzelm@54032
   746
wenzelm@54032
   747
* Consolidation of library theories on product orders:
wenzelm@54032
   748
wenzelm@54032
   749
    Product_Lattice ~> Product_Order -- pointwise order on products
wenzelm@54032
   750
    Product_ord ~> Product_Lexorder -- lexicographic order on products
wenzelm@54032
   751
wenzelm@54032
   752
INCOMPATIBILITY.
wenzelm@54032
   753
wenzelm@53160
   754
* Imperative-HOL: The MREC combinator is considered legacy and no
wenzelm@53160
   755
longer included by default. INCOMPATIBILITY, use partial_function
wenzelm@53160
   756
instead, or import theory Legacy_Mrec as a fallback.
wenzelm@53160
   757
wenzelm@53983
   758
* HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
wenzelm@53983
   759
~~/src/HOL/Algebra/poly.  Existing theories should be based on
wenzelm@53983
   760
~~/src/HOL/Library/Polynomial instead.  The latter provides
wenzelm@53983
   761
integration with HOL's type classes for rings.  INCOMPATIBILITY.
ballarin@51517
   762
wenzelm@54033
   763
* HOL-BNF:
wenzelm@54032
   764
  - Various improvements to BNF-based (co)datatype package, including
wenzelm@54032
   765
    new commands "primrec_new", "primcorec", and
wenzelm@54032
   766
    "datatype_new_compat", as well as documentation. See
wenzelm@54032
   767
    "datatypes.pdf" for details.
wenzelm@54032
   768
  - New "coinduction" method to avoid some boilerplate (compared to
wenzelm@54032
   769
    coinduct).
wenzelm@54032
   770
  - Renamed keywords:
wenzelm@54032
   771
    data ~> datatype_new
wenzelm@54032
   772
    codata ~> codatatype
wenzelm@54032
   773
    bnf_def ~> bnf
wenzelm@54032
   774
  - Renamed many generated theorems, including
wenzelm@54032
   775
    discs ~> disc
wenzelm@54032
   776
    map_comp' ~> map_comp
wenzelm@54032
   777
    map_id' ~> map_id
wenzelm@54032
   778
    sels ~> sel
wenzelm@54032
   779
    set_map' ~> set_map
wenzelm@54032
   780
    sets ~> set
wenzelm@54032
   781
IMCOMPATIBILITY.
wenzelm@54032
   782
ballarin@51517
   783
wenzelm@51551
   784
*** ML ***
wenzelm@51551
   785
wenzelm@53971
   786
* Spec_Check is a Quickcheck tool for Isabelle/ML.  The ML function
wenzelm@53971
   787
"check_property" allows to check specifications of the form "ALL x y
wenzelm@53971
   788
z. prop x y z".  See also ~~/src/Tools/Spec_Check/ with its
wenzelm@53971
   789
Examples.thy in particular.
wenzelm@53971
   790
wenzelm@53709
   791
* Improved printing of exception trace in Poly/ML 5.5.1, with regular
wenzelm@53709
   792
tracing output in the command transaction context instead of physical
wenzelm@53709
   793
stdout.  See also Toplevel.debug, Toplevel.debugging and
wenzelm@53709
   794
ML_Compiler.exn_trace.
wenzelm@53709
   795
wenzelm@53971
   796
* ML type "theory" is now immutable, without any special treatment of
wenzelm@53971
   797
drafts or linear updates (which could lead to "stale theory" errors in
wenzelm@53971
   798
the past).  Discontinued obsolete operations like Theory.copy,
wenzelm@53971
   799
Theory.checkpoint, and the auxiliary type theory_ref.  Minor
wenzelm@53971
   800
INCOMPATIBILITY.
wenzelm@53164
   801
wenzelm@51551
   802
* More uniform naming of goal functions for skipped proofs:
wenzelm@51551
   803
wenzelm@51551
   804
    Skip_Proof.prove  ~>  Goal.prove_sorry
wenzelm@51551
   805
    Skip_Proof.prove_global  ~>  Goal.prove_sorry_global
wenzelm@51551
   806
wenzelm@53971
   807
Minor INCOMPATIBILITY.
wenzelm@51703
   808
wenzelm@51717
   809
* Simplifier tactics and tools use proper Proof.context instead of
wenzelm@51717
   810
historic type simpset.  Old-style declarations like addsimps,
wenzelm@51717
   811
addsimprocs etc. operate directly on Proof.context.  Raw type simpset
wenzelm@51717
   812
retains its use as snapshot of the main Simplifier context, using
wenzelm@51717
   813
simpset_of and put_simpset on Proof.context.  INCOMPATIBILITY -- port
wenzelm@51717
   814
old tools by making them depend on (ctxt : Proof.context) instead of
wenzelm@51717
   815
(ss : simpset), then turn (simpset_of ctxt) into ctxt.
wenzelm@51717
   816
wenzelm@53971
   817
* Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
wenzelm@53971
   818
operate on Proof.context instead of claset, for uniformity with addIs,
wenzelm@53971
   819
addEs, addDs etc. Note that claset_of and put_claset allow to manage
wenzelm@53971
   820
clasets separately from the context.
wenzelm@53971
   821
wenzelm@51717
   822
* Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
wenzelm@51717
   823
INCOMPATIBILITY, use @{context} instead.
wenzelm@51717
   824
wenzelm@53971
   825
* Antiquotation @{theory_context A} is similar to @{theory A}, but
wenzelm@53971
   826
presents the result as initial Proof.context.
wenzelm@53971
   827
wenzelm@51551
   828
wenzelm@51398
   829
*** System ***
wenzelm@51398
   830
wenzelm@52052
   831
* Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
wenzelm@52052
   832
"isabelle build" in Isabelle2013.  INCOMPATIBILITY.
wenzelm@51398
   833
wenzelm@52054
   834
* Discontinued obsolete isabelle-process options -f and -u (former
wenzelm@52054
   835
administrative aliases of option -e).  Minor INCOMPATIBILITY.
wenzelm@52054
   836
wenzelm@52550
   837
* Discontinued obsolete isabelle print tool, and PRINT_COMMAND
wenzelm@52550
   838
settings variable.
wenzelm@52550
   839
wenzelm@52746
   840
* Discontinued ISABELLE_DOC_FORMAT settings variable and historic
wenzelm@52746
   841
document formats: dvi.gz, ps, ps.gz -- the default document format is
wenzelm@52746
   842
always pdf.
wenzelm@52743
   843
wenzelm@52053
   844
* Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
wenzelm@52053
   845
specify global resources of the JVM process run by isabelle build.
wenzelm@52053
   846
wenzelm@52116
   847
* Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
wenzelm@52116
   848
to run Isabelle/Scala source files as standalone programs.
wenzelm@52116
   849
wenzelm@52439
   850
* Improved "isabelle keywords" tool (for old-style ProofGeneral
wenzelm@52439
   851
keyword tables): use Isabelle/Scala operations, which inspect outer
wenzelm@52439
   852
syntax without requiring to build sessions first.
wenzelm@52439
   853
wenzelm@53971
   854
* Sessions may be organized via 'chapter' specifications in the ROOT
wenzelm@53971
   855
file, which determines a two-level hierarchy of browser info.  The old
wenzelm@53971
   856
tree-like organization via implicit sub-session relation (with its
wenzelm@53971
   857
tendency towards erratic fluctuation of URLs) has been discontinued.
wenzelm@53971
   858
The default chapter is called "Unsorted".  Potential INCOMPATIBILITY
wenzelm@53971
   859
for HTML presentation of theories.
wenzelm@53971
   860
wenzelm@51398
   861
wenzelm@51398
   862
wenzelm@50993
   863
New in Isabelle2013 (February 2013)
wenzelm@50993
   864
-----------------------------------
wenzelm@47887
   865
wenzelm@47967
   866
*** General ***
wenzelm@47967
   867
wenzelm@50126
   868
* Theorem status about oracles and unfinished/failed future proofs is
wenzelm@50126
   869
no longer printed by default, since it is incompatible with
wenzelm@50126
   870
incremental / parallel checking of the persistent document model.  ML
wenzelm@50126
   871
function Thm.peek_status may be used to inspect a snapshot of the
wenzelm@50126
   872
ongoing evaluation process.  Note that in batch mode --- notably
wenzelm@50126
   873
isabelle build --- the system ensures that future proofs of all
wenzelm@50126
   874
accessible theorems in the theory context are finished (as before).
wenzelm@50126
   875
wenzelm@49699
   876
* Configuration option show_markup controls direct inlining of markup
wenzelm@49699
   877
into the printed representation of formal entities --- notably type
wenzelm@49699
   878
and sort constraints.  This enables Prover IDE users to retrieve that
wenzelm@49699
   879
information via tooltips in the output window, for example.
wenzelm@49699
   880
wenzelm@48890
   881
* Command 'ML_file' evaluates ML text from a file directly within the
wenzelm@48890
   882
theory, without any predeclaration via 'uses' in the theory header.
wenzelm@48890
   883
wenzelm@49243
   884
* Old command 'use' command and corresponding keyword 'uses' in the
wenzelm@49243
   885
theory header are legacy features and will be discontinued soon.
wenzelm@49243
   886
Tools that load their additional source files may imitate the
wenzelm@49243
   887
'ML_file' implementation, such that the system can take care of
wenzelm@49243
   888
dependencies properly.
wenzelm@49243
   889
wenzelm@47967
   890
* Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
wenzelm@47967
   891
is called fastforce / fast_force_tac already since Isabelle2011-1.
wenzelm@47967
   892
wenzelm@50110
   893
* Updated and extended "isar-ref" and "implementation" manual, reduced
wenzelm@50110
   894
remaining material in old "ref" manual.
wenzelm@48120
   895
wenzelm@51050
   896
* Improved support for auxiliary contexts that indicate block structure
wenzelm@51050
   897
for specifications.  Nesting of "context fixes ... context assumes ..."
wenzelm@49841
   898
and "class ... context ...".
wenzelm@49841
   899
wenzelm@50772
   900
* Attribute "consumes" allows a negative value as well, which is
wenzelm@50778
   901
interpreted relatively to the total number of premises of the rule in
wenzelm@50772
   902
the target context.  This form of declaration is stable when exported
wenzelm@50772
   903
from a nested 'context' with additional assumptions.  It is the
wenzelm@50772
   904
preferred form for definitional packages, notably cases/rules produced
wenzelm@50772
   905
in HOL/inductive and HOL/function.
wenzelm@50772
   906
wenzelm@49869
   907
* More informative error messages for Isar proof commands involving
wenzelm@49869
   908
lazy enumerations (method applications etc.).
wenzelm@49869
   909
wenzelm@50213
   910
* Refined 'help' command to retrieve outer syntax commands according
wenzelm@50213
   911
to name patterns (with clickable results).
wenzelm@50213
   912
wenzelm@47967
   913
wenzelm@49968
   914
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@49968
   915
wenzelm@49968
   916
* Parallel terminal proofs ('by') are enabled by default, likewise
wenzelm@49968
   917
proofs that are built into packages like 'datatype', 'function'.  This
wenzelm@49968
   918
allows to "run ahead" checking the theory specifications on the
wenzelm@49968
   919
surface, while the prover is still crunching on internal
wenzelm@49968
   920
justifications.  Unfinished / cancelled proofs are restarted as
wenzelm@49968
   921
required to complete full proof checking eventually.
wenzelm@49968
   922
wenzelm@49968
   923
* Improved output panel with tooltips, hyperlinks etc. based on the
wenzelm@49968
   924
same Rich_Text_Area as regular Isabelle/jEdit buffers.  Activation of
wenzelm@49968
   925
tooltips leads to some window that supports the same recursively,
wenzelm@49968
   926
which can lead to stacks of tooltips as the semantic document content
wenzelm@49968
   927
is explored.  ESCAPE closes the whole stack, individual windows may be
wenzelm@49968
   928
closed separately, or detached to become independent jEdit dockables.
wenzelm@49968
   929
wenzelm@50717
   930
* Improved support for commands that produce graph output: the text
wenzelm@50717
   931
message contains a clickable area to open a new instance of the graph
wenzelm@50717
   932
browser on demand.
wenzelm@50717
   933
wenzelm@49968
   934
* More robust incremental parsing of outer syntax (partial comments,
wenzelm@49968
   935
malformed symbols).  Changing the balance of open/close quotes and
wenzelm@49968
   936
comment delimiters works more conveniently with unfinished situations
wenzelm@49968
   937
that frequently occur in user interaction.
wenzelm@49968
   938
wenzelm@49968
   939
* More efficient painting and improved reactivity when editing large
wenzelm@49968
   940
files.  More scalable management of formal document content.
wenzelm@49968
   941
wenzelm@50505
   942
* Smarter handling of tracing messages: prover process pauses after
wenzelm@50505
   943
certain number of messages per command transaction, with some user
wenzelm@50505
   944
dialog to stop or continue.  This avoids swamping the front-end with
wenzelm@50119
   945
potentially infinite message streams.
wenzelm@49968
   946
wenzelm@49968
   947
* More plugin options and preferences, based on Isabelle/Scala.  The
wenzelm@49968
   948
jEdit plugin option panel provides access to some Isabelle/Scala
wenzelm@49968
   949
options, including tuning parameters for editor reactivity and color
wenzelm@49968
   950
schemes.
wenzelm@49968
   951
wenzelm@50184
   952
* Dockable window "Symbols" provides some editing support for Isabelle
wenzelm@50184
   953
symbols.
wenzelm@50184
   954
wenzelm@51082
   955
* Dockable window "Monitor" shows ML runtime statistics.  Note that
wenzelm@51082
   956
continuous display of the chart slows down the system.
wenzelm@50701
   957
wenzelm@50183
   958
* Improved editing support for control styles: subscript, superscript,
wenzelm@50183
   959
bold, reset of style -- operating on single symbols or text
wenzelm@50198
   960
selections.  Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
wenzelm@50198
   961
wenzelm@50198
   962
* Actions isabelle.increase-font-size and isabelle.decrease-font-size
wenzelm@50198
   963
adjust the main text area font size, and its derivatives for output,
wenzelm@50836
   964
tooltips etc.  Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
wenzelm@50836
   965
need to be adapted to local keyboard layouts.
wenzelm@50183
   966
wenzelm@50730
   967
* More reactive completion popup by default: use \t (TAB) instead of
wenzelm@50730
   968
\n (NEWLINE) to minimize intrusion into regular flow of editing.  See
wenzelm@50730
   969
also "Plugin Options / SideKick / General / Code Completion Options".
wenzelm@50730
   970
wenzelm@50406
   971
* Implicit check and build dialog of the specified logic session
wenzelm@50406
   972
image.  For example, HOL, HOLCF, HOL-Nominal can be produced on
wenzelm@50406
   973
demand, without bundling big platform-dependent heap images in the
wenzelm@50406
   974
Isabelle distribution.
wenzelm@50406
   975
wenzelm@49968
   976
* Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
wenzelm@49968
   977
from Oracle provide better multi-platform experience.  This version is
wenzelm@49968
   978
now bundled exclusively with Isabelle.
wenzelm@49968
   979
wenzelm@49968
   980
wenzelm@48205
   981
*** Pure ***
wenzelm@48205
   982
haftmann@48431
   983
* Code generation for Haskell: restrict unqualified imports from
haftmann@48431
   984
Haskell Prelude to a small set of fundamental operations.
haftmann@48431
   985
wenzelm@50646
   986
* Command 'export_code': relative file names are interpreted
wenzelm@50646
   987
relatively to master directory of current theory rather than the
wenzelm@50646
   988
rather arbitrary current working directory.  INCOMPATIBILITY.
haftmann@48371
   989
wenzelm@48205
   990
* Discontinued obsolete attribute "COMP".  Potential INCOMPATIBILITY,
wenzelm@48205
   991
use regular rule composition via "OF" / "THEN", or explicit proof
wenzelm@48205
   992
structure instead.  Note that Isabelle/ML provides a variety of
wenzelm@48205
   993
operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
wenzelm@48205
   994
with some care where this is really required.
wenzelm@48205
   995
wenzelm@48792
   996
* Command 'typ' supports an additional variant with explicit sort
wenzelm@48792
   997
constraint, to infer and check the most general type conforming to a
wenzelm@51063
   998
given sort.  Example (in HOL):
wenzelm@48792
   999
wenzelm@48792
  1000
  typ "_ * _ * bool * unit" :: finite
wenzelm@48792
  1001
wenzelm@50716
  1002
* Command 'locale_deps' visualizes all locales and their relations as
wenzelm@50716
  1003
a Hasse diagram.
wenzelm@50716
  1004
wenzelm@48205
  1005
bulwahn@48013
  1006
*** HOL ***
bulwahn@48013
  1007
wenzelm@50646
  1008
* Sledgehammer:
wenzelm@50646
  1009
wenzelm@50646
  1010
  - Added MaSh relevance filter based on machine-learning; see the
wenzelm@50646
  1011
    Sledgehammer manual for details.
wenzelm@50646
  1012
  - Polished Isar proofs generated with "isar_proofs" option.
wenzelm@50646
  1013
  - Rationalized type encodings ("type_enc" option).
blanchet@50720
  1014
  - Renamed "kill_provers" subcommand to "kill_all".
wenzelm@50646
  1015
  - Renamed options:
wenzelm@50646
  1016
      isar_proof ~> isar_proofs
wenzelm@50646
  1017
      isar_shrink_factor ~> isar_shrink
wenzelm@50646
  1018
      max_relevant ~> max_facts
wenzelm@50646
  1019
      relevance_thresholds ~> fact_thresholds
wenzelm@50646
  1020
wenzelm@50646
  1021
* Quickcheck: added an optimisation for equality premises.  It is
wenzelm@50646
  1022
switched on by default, and can be switched off by setting the
wenzelm@50646
  1023
configuration quickcheck_optimise_equality to false.
wenzelm@50646
  1024
kuncar@50878
  1025
* Quotient: only one quotient can be defined by quotient_type
kuncar@50878
  1026
INCOMPATIBILITY.
kuncar@50878
  1027
kuncar@50878
  1028
* Lifting:
kuncar@50878
  1029
  - generation of an abstraction function equation in lift_definition
kuncar@50878
  1030
  - quot_del attribute
kuncar@50878
  1031
  - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
kuncar@50878
  1032
wenzelm@50646
  1033
* Simproc "finite_Collect" rewrites set comprehensions into pointfree
wenzelm@50646
  1034
expressions.
wenzelm@50646
  1035
wenzelm@50646
  1036
* Preprocessing of the code generator rewrites set comprehensions into
wenzelm@50646
  1037
pointfree expressions.
wenzelm@50646
  1038
wenzelm@50646
  1039
* The SMT solver Z3 has now by default a restricted set of directly
wenzelm@50646
  1040
supported features. For the full set of features (div/mod, nonlinear
wenzelm@50646
  1041
arithmetic, datatypes/records) with potential proof reconstruction
wenzelm@50646
  1042
failures, enable the configuration option "z3_with_extensions".  Minor
wenzelm@50646
  1043
INCOMPATIBILITY.
haftmann@49948
  1044
wenzelm@49836
  1045
* Simplified 'typedef' specifications: historical options for implicit
wenzelm@49836
  1046
set definition and alternative name have been discontinued.  The
wenzelm@49836
  1047
former behavior of "typedef (open) t = A" is now the default, but
wenzelm@49836
  1048
written just "typedef t = A".  INCOMPATIBILITY, need to adapt theories
wenzelm@49836
  1049
accordingly.
wenzelm@49836
  1050
wenzelm@50646
  1051
* Removed constant "chars"; prefer "Enum.enum" on type "char"
wenzelm@50646
  1052
directly.  INCOMPATIBILITY.
wenzelm@50646
  1053
wenzelm@50646
  1054
* Moved operation product, sublists and n_lists from theory Enum to
wenzelm@50646
  1055
List.  INCOMPATIBILITY.
haftmann@49822
  1056
haftmann@49739
  1057
* Theorem UN_o generalized to SUP_comp.  INCOMPATIBILITY.
haftmann@49739
  1058
haftmann@49738
  1059
* Class "comm_monoid_diff" formalises properties of bounded
haftmann@49388
  1060
subtraction, with natural numbers and multisets as typical instances.
haftmann@49388
  1061
wenzelm@50646
  1062
* Added combinator "Option.these" with type "'a option set => 'a set".
wenzelm@50646
  1063
wenzelm@50646
  1064
* Theory "Transitive_Closure": renamed lemmas
wenzelm@50646
  1065
wenzelm@50646
  1066
  reflcl_tranclp -> reflclp_tranclp
wenzelm@50646
  1067
  rtranclp_reflcl -> rtranclp_reflclp
wenzelm@50646
  1068
wenzelm@50646
  1069
INCOMPATIBILITY.
wenzelm@50646
  1070
wenzelm@50646
  1071
* Theory "Rings": renamed lemmas (in class semiring)
wenzelm@50646
  1072
wenzelm@50646
  1073
  left_distrib ~> distrib_right
wenzelm@50646
  1074
  right_distrib ~> distrib_left
wenzelm@50646
  1075
wenzelm@50646
  1076
INCOMPATIBILITY.
wenzelm@50646
  1077
wenzelm@50646
  1078
* Generalized the definition of limits:
wenzelm@50646
  1079
wenzelm@50646
  1080
  - Introduced the predicate filterlim (LIM x F. f x :> G) which
wenzelm@50646
  1081
    expresses that when the input values x converge to F then the
wenzelm@50646
  1082
    output f x converges to G.
wenzelm@50646
  1083
wenzelm@50646
  1084
  - Added filters for convergence to positive (at_top) and negative
wenzelm@50646
  1085
    infinity (at_bot).
wenzelm@50646
  1086
wenzelm@50646
  1087
  - Moved infinity in the norm (at_infinity) from
wenzelm@50646
  1088
    Multivariate_Analysis to Complex_Main.
wenzelm@50646
  1089
wenzelm@50646
  1090
  - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
wenzelm@50646
  1091
    at_top".
wenzelm@50646
  1092
wenzelm@50646
  1093
INCOMPATIBILITY.
wenzelm@50646
  1094
wenzelm@50646
  1095
* Theory "Library/Option_ord" provides instantiation of option type to
wenzelm@50646
  1096
lattice type classes.
wenzelm@50646
  1097
wenzelm@50646
  1098
* Theory "Library/Multiset": renamed
wenzelm@50646
  1099
wenzelm@50646
  1100
    constant fold_mset ~> Multiset.fold
wenzelm@50646
  1101
    fact fold_mset_commute ~> fold_mset_comm
wenzelm@50646
  1102
wenzelm@50646
  1103
INCOMPATIBILITY.
wenzelm@50646
  1104
wenzelm@50646
  1105
* Renamed theory Library/List_Prefix to Library/Sublist, with related
wenzelm@50646
  1106
changes as follows.
wenzelm@50646
  1107
wenzelm@50646
  1108
  - Renamed constants (and related lemmas)
Christian@49145
  1109
Christian@49145
  1110
      prefix ~> prefixeq
Christian@49145
  1111
      strict_prefix ~> prefix
Christian@49145
  1112
wenzelm@50646
  1113
  - Replaced constant "postfix" by "suffixeq" with swapped argument
wenzelm@50646
  1114
    order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
wenzelm@50646
  1115
    old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
wenzelm@50646
  1116
    Renamed lemmas accordingly.
wenzelm@50646
  1117
wenzelm@50646
  1118
  - Added constant "list_hembeq" for homeomorphic embedding on
wenzelm@50646
  1119
    lists. Added abbreviation "sublisteq" for special case
wenzelm@50646
  1120
    "list_hembeq (op =)".
wenzelm@50646
  1121
wenzelm@50646
  1122
  - Theory Library/Sublist no longer provides "order" and "bot" type
wenzelm@50646
  1123
    class instances for the prefix order (merely corresponding locale
wenzelm@50646
  1124
    interpretations). The type class instances are now in theory
wenzelm@50646
  1125
    Library/Prefix_Order.
wenzelm@50646
  1126
wenzelm@50646
  1127
  - The sublist relation of theory Library/Sublist_Order is now based
wenzelm@50646
  1128
    on "Sublist.sublisteq".  Renamed lemmas accordingly:
Christian@50516
  1129
Christian@50516
  1130
      le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
Christian@50516
  1131
      le_list_append_mono ~> Sublist.list_hembeq_append_mono
Christian@50516
  1132
      le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
Christian@50516
  1133
      le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
Christian@50516
  1134
      le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
Christian@50516
  1135
      le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
Christian@50516
  1136
      le_list_drop_Cons ~> Sublist.sublisteq_Cons'
Christian@50516
  1137
      le_list_drop_many ~> Sublist.sublisteq_drop_many
Christian@50516
  1138
      le_list_filter_left ~> Sublist.sublisteq_filter_left
Christian@50516
  1139
      le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
Christian@50516
  1140
      le_list_rev_take_iff ~> Sublist.sublisteq_append
Christian@50516
  1141
      le_list_same_length ~> Sublist.sublisteq_same_length
Christian@50516
  1142
      le_list_take_many_iff ~> Sublist.sublisteq_append'
Christian@49145
  1143
      less_eq_list.drop ~> less_eq_list_drop
Christian@49145
  1144
      less_eq_list.induct ~> less_eq_list_induct
Christian@50516
  1145
      not_le_list_length ~> Sublist.not_sublisteq_length
Christian@49145
  1146
wenzelm@50646
  1147
INCOMPATIBILITY.
wenzelm@50646
  1148
wenzelm@50646
  1149
* New theory Library/Countable_Set.
wenzelm@50646
  1150
wenzelm@50646
  1151
* Theory Library/Debug and Library/Parallel provide debugging and
wenzelm@50646
  1152
parallel execution for code generated towards Isabelle/ML.
wenzelm@50646
  1153
wenzelm@50646
  1154
* Theory Library/FuncSet: Extended support for Pi and extensional and
wenzelm@50646
  1155
introduce the extensional dependent function space "PiE". Replaced
wenzelm@50646
  1156
extensional_funcset by an abbreviation, and renamed lemmas from
wenzelm@50646
  1157
extensional_funcset to PiE as follows:
wenzelm@50646
  1158
wenzelm@50646
  1159
  extensional_empty  ~>  PiE_empty
wenzelm@50646
  1160
  extensional_funcset_empty_domain  ~>  PiE_empty_domain
wenzelm@50646
  1161
  extensional_funcset_empty_range  ~>  PiE_empty_range
wenzelm@50646
  1162
  extensional_funcset_arb  ~>  PiE_arb
wenzelm@50646
  1163
  extensional_funcset_mem  ~>  PiE_mem
wenzelm@50646
  1164
  extensional_funcset_extend_domainI  ~>  PiE_fun_upd
wenzelm@50646
  1165
  extensional_funcset_restrict_domain  ~>  fun_upd_in_PiE
wenzelm@50646
  1166
  extensional_funcset_extend_domain_eq  ~>  PiE_insert_eq
wenzelm@50646
  1167
  card_extensional_funcset  ~>  card_PiE
wenzelm@50646
  1168
  finite_extensional_funcset  ~>  finite_PiE
wenzelm@50646
  1169
wenzelm@50646
  1170
INCOMPATIBILITY.
wenzelm@50646
  1171
wenzelm@50646
  1172
* Theory Library/FinFun: theory of almost everywhere constant
wenzelm@50646
  1173
functions (supersedes the AFP entry "Code Generation for Functions as
wenzelm@50646
  1174
Data").
wenzelm@50646
  1175
wenzelm@50646
  1176
* Theory Library/Phantom: generic phantom type to make a type
wenzelm@50646
  1177
parameter appear in a constant's type.  This alternative to adding
wenzelm@50646
  1178
TYPE('a) as another parameter avoids unnecessary closures in generated
wenzelm@50646
  1179
code.
wenzelm@50646
  1180
wenzelm@50646
  1181
* Theory Library/RBT_Impl: efficient construction of red-black trees
wenzelm@50646
  1182
from sorted associative lists. Merging two trees with rbt_union may
wenzelm@50646
  1183
return a structurally different tree than before.  Potential
wenzelm@50646
  1184
INCOMPATIBILITY.
wenzelm@50646
  1185
wenzelm@50646
  1186
* Theory Library/IArray: immutable arrays with code generation.
wenzelm@50646
  1187
wenzelm@50646
  1188
* Theory Library/Finite_Lattice: theory of finite lattices.
wenzelm@50646
  1189
wenzelm@50646
  1190
* HOL/Multivariate_Analysis: replaced
wenzelm@50646
  1191
wenzelm@50646
  1192
  "basis :: 'a::euclidean_space => nat => real"
wenzelm@50646
  1193
  "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
wenzelm@50646
  1194
wenzelm@50646
  1195
on euclidean spaces by using the inner product "_ \<bullet> _" with
wenzelm@50646
  1196
vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
wenzelm@50646
  1197
"SUM i : Basis. f i * r i".
wenzelm@50646
  1198
wenzelm@50646
  1199
  With this change the following constants are also changed or removed:
wenzelm@50646
  1200
wenzelm@50646
  1201
    DIM('a) :: nat  ~>  card (Basis :: 'a set)   (is an abbreviation)
wenzelm@50646
  1202
    a $$ i  ~>  inner a i  (where i : Basis)
wenzelm@50646
  1203
    cart_base i  removed
wenzelm@50646
  1204
    \<pi>, \<pi>'  removed
hoelzl@50526
  1205
hoelzl@50526
  1206
  Theorems about these constants where removed.
hoelzl@50526
  1207
hoelzl@50526
  1208
  Renamed lemmas:
hoelzl@50526
  1209
wenzelm@50646
  1210
    component_le_norm  ~>  Basis_le_norm
wenzelm@50646
  1211
    euclidean_eq  ~>  euclidean_eq_iff
wenzelm@50646
  1212
    differential_zero_maxmin_component  ~>  differential_zero_maxmin_cart
wenzelm@50646
  1213
    euclidean_simps  ~>  inner_simps
wenzelm@50646
  1214
    independent_basis  ~>  independent_Basis
wenzelm@50646
  1215
    span_basis  ~>  span_Basis
wenzelm@50646
  1216
    in_span_basis  ~>  in_span_Basis
wenzelm@50646
  1217
    norm_bound_component_le  ~>  norm_boound_Basis_le
wenzelm@50646
  1218
    norm_bound_component_lt  ~>  norm_boound_Basis_lt
wenzelm@50646
  1219
    component_le_infnorm  ~>  Basis_le_infnorm
wenzelm@50646
  1220
wenzelm@50646
  1221
INCOMPATIBILITY.
hoelzl@50526
  1222
hoelzl@50141
  1223
* HOL/Probability:
wenzelm@50646
  1224
wenzelm@50646
  1225
  - Added simproc "measurable" to automatically prove measurability.
wenzelm@50646
  1226
wenzelm@50646
  1227
  - Added induction rules for sigma sets with disjoint union
wenzelm@50646
  1228
    (sigma_sets_induct_disjoint) and for Borel-measurable functions
wenzelm@50646
  1229
    (borel_measurable_induct).
wenzelm@50646
  1230
wenzelm@50646
  1231
  - Added the Daniell-Kolmogorov theorem (the existence the limit of a
wenzelm@50646
  1232
    projective family).
wenzelm@50646
  1233
wenzelm@50646
  1234
* HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
wenzelm@50646
  1235
AFP entry "Ordinals_and_Cardinals").
wenzelm@50646
  1236
wenzelm@50646
  1237
* HOL/BNF: New (co)datatype package based on bounded natural functors
wenzelm@50646
  1238
with support for mixed, nested recursion and interesting non-free
wenzelm@50646
  1239
datatypes.
blanchet@48094
  1240
wenzelm@50991
  1241
* HOL/Finite_Set and Relation: added new set and relation operations
kuncar@50878
  1242
expressed by Finite_Set.fold.
kuncar@50878
  1243
kuncar@50878
  1244
* New theory HOL/Library/RBT_Set: implementation of sets by red-black
kuncar@50878
  1245
trees for the code generator.
kuncar@50878
  1246
kuncar@50878
  1247
* HOL/Library/RBT and HOL/Library/Mapping have been converted to
kuncar@50878
  1248
Lifting/Transfer.
kuncar@50878
  1249
possible INCOMPATIBILITY.
kuncar@50878
  1250
kuncar@50878
  1251
* HOL/Set: renamed Set.project -> Set.filter
kuncar@50878
  1252
INCOMPATIBILITY.
kuncar@50878
  1253
wenzelm@48120
  1254
wenzelm@48206
  1255
*** Document preparation ***
wenzelm@48206
  1256
wenzelm@50646
  1257
* Dropped legacy antiquotations "term_style" and "thm_style", since
wenzelm@50646
  1258
styles may be given as arguments to "term" and "thm" already.
wenzelm@50646
  1259
Discontinued legacy styles "prem1" .. "prem19".
wenzelm@50646
  1260
wenzelm@50646
  1261
* Default LaTeX rendering for \<euro> is now based on eurosym package,
wenzelm@50646
  1262
instead of slightly exotic babel/greek.
wenzelm@48206
  1263
wenzelm@48616
  1264
* Document variant NAME may use different LaTeX entry point
wenzelm@48616
  1265
document/root_NAME.tex if that file exists, instead of the common
wenzelm@48616
  1266
document/root.tex.
wenzelm@48616
  1267
wenzelm@48657
  1268
* Simplified custom document/build script, instead of old-style
wenzelm@48657
  1269
document/IsaMakefile.  Minor INCOMPATIBILITY.
wenzelm@48657
  1270
wenzelm@48206
  1271
wenzelm@48992
  1272
*** ML ***
wenzelm@48992
  1273
wenzelm@50646
  1274
* The default limit for maximum number of worker threads is now 8,
wenzelm@50646
  1275
instead of 4, in correspondence to capabilities of contemporary
wenzelm@50646
  1276
hardware and Poly/ML runtime system.
wenzelm@50646
  1277
wenzelm@49869
  1278
* Type Seq.results and related operations support embedded error
wenzelm@49869
  1279
messages within lazy enumerations, and thus allow to provide
wenzelm@49869
  1280
informative errors in the absence of any usable results.
wenzelm@49869
  1281
wenzelm@48992
  1282
* Renamed Position.str_of to Position.here to emphasize that this is a
wenzelm@48992
  1283
formal device to inline positions into message text, but not
wenzelm@48992
  1284
necessarily printing visible text.
wenzelm@48992
  1285
wenzelm@48992
  1286
wenzelm@48206
  1287
*** System ***
wenzelm@48206
  1288
wenzelm@48585
  1289
* Advanced support for Isabelle sessions and build management, see
wenzelm@48585
  1290
"system" manual for the chapter of that name, especially the "isabelle
wenzelm@51056
  1291
build" tool and its examples.  The "isabelle mkroot" tool prepares
wenzelm@51056
  1292
session root directories for use with "isabelle build", similar to
wenzelm@51056
  1293
former "isabelle mkdir" for "isabelle usedir".  Note that this affects
wenzelm@51056
  1294
document preparation as well.  INCOMPATIBILITY, isabelle usedir /
wenzelm@48736
  1295
mkdir / make are rendered obsolete.
wenzelm@48736
  1296
wenzelm@51056
  1297
* Discontinued obsolete Isabelle/build script, it is superseded by the
wenzelm@51056
  1298
regular isabelle build tool.  For example:
wenzelm@51056
  1299
wenzelm@51056
  1300
  isabelle build -s -b HOL
wenzelm@51056
  1301
wenzelm@48736
  1302
* Discontinued obsolete "isabelle makeall".
wenzelm@48585
  1303
wenzelm@48722
  1304
* Discontinued obsolete IsaMakefile and ROOT.ML files from the
wenzelm@48722
  1305
Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
wenzelm@48722
  1306
provides some traditional targets that invoke "isabelle build".  Note
wenzelm@48722
  1307
that this is inefficient!  Applications of Isabelle/HOL involving
wenzelm@48722
  1308
"isabelle make" should be upgraded to use "isabelle build" directly.
wenzelm@48722
  1309
wenzelm@48693
  1310
* The "isabelle options" tool prints Isabelle system options, as
wenzelm@48693
  1311
required for "isabelle build", for example.
wenzelm@48693
  1312
wenzelm@50646
  1313
* The "isabelle logo" tool produces EPS and PDF format simultaneously.
wenzelm@50646
  1314
Minor INCOMPATIBILITY in command-line options.
wenzelm@50646
  1315
wenzelm@50646
  1316
* The "isabelle install" tool has now a simpler command-line.  Minor
wenzelm@50646
  1317
INCOMPATIBILITY.
wenzelm@50646
  1318
wenzelm@48844
  1319
* The "isabelle components" tool helps to resolve add-on components
wenzelm@48844
  1320
that are not bundled, or referenced from a bare-bones repository
wenzelm@48844
  1321
version of Isabelle.
wenzelm@48844
  1322
wenzelm@50646
  1323
* Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
wenzelm@50646
  1324
platform family: "linux", "macos", "windows".
wenzelm@50646
  1325
wenzelm@50646
  1326
* The ML system is configured as regular component, and no longer
wenzelm@50646
  1327
picked up from some surrounding directory.  Potential INCOMPATIBILITY
wenzelm@50646
  1328
for home-made settings.
wenzelm@50132
  1329
wenzelm@50701
  1330
* Improved ML runtime statistics (heap, threads, future tasks etc.).
wenzelm@50701
  1331
wenzelm@48206
  1332
* Discontinued support for Poly/ML 5.2.1, which was the last version
wenzelm@48206
  1333
without exception positions and advanced ML compiler/toplevel
wenzelm@48206
  1334
configuration.
wenzelm@48206
  1335
wenzelm@48574
  1336
* Discontinued special treatment of Proof General -- no longer guess
wenzelm@48574
  1337
PROOFGENERAL_HOME based on accidental file-system layout.  Minor
wenzelm@48574
  1338
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
wenzelm@48574
  1339
settings manually, or use a Proof General version that has been
wenzelm@48574
  1340
bundled as Isabelle component.
wenzelm@48206
  1341
wenzelm@50182
  1342
wenzelm@48120
  1343
wenzelm@47462
  1344
New in Isabelle2012 (May 2012)
wenzelm@47462
  1345
------------------------------
wenzelm@45109
  1346
wenzelm@45593
  1347
*** General ***
wenzelm@45593
  1348
wenzelm@45614
  1349
* Prover IDE (PIDE) improvements:
wenzelm@45614
  1350
wenzelm@47585
  1351
  - more robust Sledgehammer integration (as before the sledgehammer
wenzelm@47806
  1352
    command-line needs to be typed into the source buffer)
wenzelm@45614
  1353
  - markup for bound variables
wenzelm@47806
  1354
  - markup for types of term variables (displayed as tooltips)
wenzelm@46956
  1355
  - support for user-defined Isar commands within the running session
wenzelm@47158
  1356
  - improved support for Unicode outside original 16bit range
wenzelm@47158
  1357
    e.g. glyph for \<A> (thanks to jEdit 4.5.1)
wenzelm@45614
  1358
wenzelm@47806
  1359
* Forward declaration of outer syntax keywords within the theory
wenzelm@47806
  1360
header -- minor INCOMPATIBILITY for user-defined commands.  Allow new
wenzelm@47806
  1361
commands to be used in the same theory where defined.
wenzelm@46485
  1362
wenzelm@47482
  1363
* Auxiliary contexts indicate block structure for specifications with
wenzelm@47482
  1364
additional parameters and assumptions.  Such unnamed contexts may be
wenzelm@47482
  1365
nested within other targets, like 'theory', 'locale', 'class',
wenzelm@47482
  1366
'instantiation' etc.  Results from the local context are generalized
wenzelm@47482
  1367
accordingly and applied to the enclosing target context.  Example:
wenzelm@47482
  1368
wenzelm@47482
  1369
  context
wenzelm@47482
  1370
    fixes x y z :: 'a
wenzelm@47482
  1371
    assumes xy: "x = y" and yz: "y = z"
wenzelm@47482
  1372
  begin
wenzelm@47482
  1373
wenzelm@47482
  1374
  lemma my_trans: "x = z" using xy yz by simp
wenzelm@47482
  1375
wenzelm@47482
  1376
  end
wenzelm@47482
  1377
wenzelm@47482
  1378
  thm my_trans
wenzelm@47482
  1379
wenzelm@47482
  1380
The most basic application is to factor-out context elements of
wenzelm@47482
  1381
several fixes/assumes/shows theorem statements, e.g. see
wenzelm@47482
  1382
~~/src/HOL/Isar_Examples/Group_Context.thy
wenzelm@47482
  1383
wenzelm@47482
  1384
Any other local theory specification element works within the "context
wenzelm@47482
  1385
... begin ... end" block as well.
wenzelm@47482
  1386
wenzelm@47484
  1387
* Bundled declarations associate attributed fact expressions with a
wenzelm@47484
  1388
given name in the context.  These may be later included in other
wenzelm@47484
  1389
contexts.  This allows to manage context extensions casually, without
wenzelm@47855
  1390
the logical dependencies of locales and locale interpretation.  See
wenzelm@47855
  1391
commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
wenzelm@47484
  1392
wenzelm@47829
  1393
* Commands 'lemmas' and 'theorems' allow local variables using 'for'
wenzelm@47829
  1394
declaration, and results are standardized before being stored.  Thus
wenzelm@47829
  1395
old-style "standard" after instantiation or composition of facts
wenzelm@47829
  1396
becomes obsolete.  Minor INCOMPATIBILITY, due to potential change of
wenzelm@47829
  1397
indices of schematic variables.
wenzelm@47829
  1398
wenzelm@47829
  1399
* Rule attributes in local theory declarations (e.g. locale or class)
wenzelm@47829
  1400
are now statically evaluated: the resulting theorem is stored instead
wenzelm@47829
  1401
of the original expression.  INCOMPATIBILITY in rare situations, where
wenzelm@47829
  1402
the historic accident of dynamic re-evaluation in interpretations
wenzelm@47829
  1403
etc. was exploited.
wenzelm@47829
  1404
wenzelm@47829
  1405
* New tutorial "Programming and Proving in Isabelle/HOL"
wenzelm@47829
  1406
("prog-prove").  It completely supersedes "A Tutorial Introduction to
wenzelm@47829
  1407
Structured Isar Proofs" ("isar-overview"), which has been removed.  It
wenzelm@47829
  1408
also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
wenzelm@47829
  1409
Logic" as the recommended beginners tutorial, but does not cover all
wenzelm@47829
  1410
of the material of that old tutorial.
wenzelm@47829
  1411
wenzelm@47829
  1412
* Updated and extended reference manuals: "isar-ref",
wenzelm@47829
  1413
"implementation", "system"; reduced remaining material in old "ref"
wenzelm@47829
  1414
manual.
wenzelm@47829
  1415
wenzelm@47829
  1416
wenzelm@47829
  1417
*** Pure ***
wenzelm@47829
  1418
wenzelm@46976
  1419
* Command 'definition' no longer exports the foundational "raw_def"
wenzelm@46976
  1420
into the user context.  Minor INCOMPATIBILITY, may use the regular
wenzelm@46976
  1421
"def" result with attribute "abs_def" to imitate the old version.
wenzelm@46976
  1422
wenzelm@47855
  1423
* Attribute "abs_def" turns an equation of the form "f x y == t" into
wenzelm@47855
  1424
"f == %x y. t", which ensures that "simp" or "unfold" steps always
wenzelm@47855
  1425
expand it.  This also works for object-logic equality.  (Formerly
wenzelm@47855
  1426
undocumented feature.)
wenzelm@47855
  1427
wenzelm@47856
  1428
* Sort constraints are now propagated in simultaneous statements, just
wenzelm@47856
  1429
like type constraints.  INCOMPATIBILITY in rare situations, where
wenzelm@47856
  1430
distinct sorts used to be assigned accidentally.  For example:
wenzelm@47856
  1431
wenzelm@47856
  1432
  lemma "P (x::'a::foo)" and "Q (y::'a::bar)"  -- "now illegal"
wenzelm@47856
  1433
wenzelm@47856
  1434
  lemma "P (x::'a)" and "Q (y::'a::bar)"
wenzelm@47856
  1435
    -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
wenzelm@47856
  1436
wenzelm@47856
  1437
* Rule composition via attribute "OF" (or ML functions OF/MRS) is more
wenzelm@47856
  1438
tolerant against multiple unifiers, as long as the final result is
wenzelm@47856
  1439
unique.  (As before, rules are composed in canonical right-to-left
wenzelm@47856
  1440
order to accommodate newly introduced premises.)
wenzelm@47856
  1441
wenzelm@47806
  1442
* Renamed some inner syntax categories:
wenzelm@47806
  1443
wenzelm@47806
  1444
    num ~> num_token
wenzelm@47806
  1445
    xnum ~> xnum_token
wenzelm@47806
  1446
    xstr ~> str_token
wenzelm@47806
  1447
wenzelm@47806
  1448
Minor INCOMPATIBILITY.  Note that in practice "num_const" or
wenzelm@47806
  1449
"num_position" etc. are mainly used instead (which also include
wenzelm@47806
  1450
position information via constraints).
wenzelm@47806
  1451
wenzelm@47829
  1452
* Simplified configuration options for syntax ambiguity: see
wenzelm@47829
  1453
"syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
wenzelm@47829
  1454
manual.  Minor INCOMPATIBILITY.
wenzelm@47829
  1455
wenzelm@47856
  1456
* Discontinued configuration option "syntax_positions": atomic terms
wenzelm@47856
  1457
in parse trees are always annotated by position constraints.
wenzelm@45134
  1458
wenzelm@47464
  1459
* Old code generator for SML and its commands 'code_module',
wenzelm@45383
  1460
'code_library', 'consts_code', 'types_code' have been discontinued.
haftmann@46028
  1461
Use commands of the generic code generator instead.  INCOMPATIBILITY.
wenzelm@45383
  1462
wenzelm@47464
  1463
* Redundant attribute "code_inline" has been discontinued. Use
wenzelm@47464
  1464
"code_unfold" instead.  INCOMPATIBILITY.
wenzelm@47464
  1465
wenzelm@47464
  1466
* Dropped attribute "code_unfold_post" in favor of the its dual
wenzelm@47464
  1467
"code_abbrev", which yields a common pattern in definitions like
haftmann@46028
  1468
haftmann@46028
  1469
  definition [code_abbrev]: "f = t"
haftmann@46028
  1470
haftmann@46028
  1471
INCOMPATIBILITY.
wenzelm@45383
  1472
wenzelm@47856
  1473
* Obsolete 'types' command has been discontinued.  Use 'type_synonym'
wenzelm@47856
  1474
instead.  INCOMPATIBILITY.
wenzelm@47856
  1475
wenzelm@47856
  1476
* Discontinued old "prems" fact, which used to refer to the accidental
wenzelm@47856
  1477
collection of foundational premises in the context (already marked as
wenzelm@47856
  1478
legacy since Isabelle2011).
wenzelm@47855
  1479
wenzelm@45427
  1480
huffman@45122
  1481
*** HOL ***
huffman@45122
  1482
wenzelm@47464
  1483
* Type 'a set is now a proper type constructor (just as before
wenzelm@47464
  1484
Isabelle2008).  Definitions mem_def and Collect_def have disappeared.
wenzelm@47464
  1485
Non-trivial INCOMPATIBILITY.  For developments keeping predicates and
wenzelm@47855
  1486
sets separate, it is often sufficient to rephrase some set S that has
wenzelm@47855
  1487
been accidentally used as predicates by "%x. x : S", and some
wenzelm@47855
  1488
predicate P that has been accidentally used as set by "{x. P x}".
wenzelm@47855
  1489
Corresponding proofs in a first step should be pruned from any
wenzelm@47855
  1490
tinkering with former theorems mem_def and Collect_def as far as
wenzelm@47855
  1491
possible.
wenzelm@47855
  1492
wenzelm@47855
  1493
For developments which deliberately mix predicates and sets, a
wenzelm@47464
  1494
planning step is necessary to determine what should become a predicate
wenzelm@47464
  1495
and what a set.  It can be helpful to carry out that step in
wenzelm@47464
  1496
Isabelle2011-1 before jumping right into the current release.
wenzelm@47464
  1497
wenzelm@47855
  1498
* Code generation by default implements sets as container type rather
wenzelm@47855
  1499
than predicates.  INCOMPATIBILITY.
wenzelm@47855
  1500
wenzelm@47855
  1501
* New type synonym 'a rel = ('a * 'a) set
wenzelm@47855
  1502
wenzelm@47464
  1503
* The representation of numerals has changed.  Datatype "num"
wenzelm@47464
  1504
represents strictly positive binary numerals, along with functions
wenzelm@47464
  1505
"numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
wenzelm@47855
  1506
positive and negated numeric literals, respectively.  See also
wenzelm@47855
  1507
definitions in ~~/src/HOL/Num.thy.  Potential INCOMPATIBILITY, some
wenzelm@47855
  1508
user theories may require adaptations as follows:
huffman@47108
  1509
huffman@47108
  1510
  - Theorems with number_ring or number_semiring constraints: These
huffman@47108
  1511
    classes are gone; use comm_ring_1 or comm_semiring_1 instead.
huffman@47108
  1512
huffman@47108
  1513
  - Theories defining numeric types: Remove number, number_semiring,
huffman@47108
  1514
    and number_ring instances. Defer all theorems about numerals until
huffman@47108
  1515
    after classes one and semigroup_add have been instantiated.
huffman@47108
  1516
huffman@47108
  1517
  - Numeral-only simp rules: Replace each rule having a "number_of v"
huffman@47108
  1518
    pattern with two copies, one for numeral and one for neg_numeral.
huffman@47108
  1519
huffman@47108
  1520
  - Theorems about subclasses of semiring_1 or ring_1: These classes
huffman@47108
  1521
    automatically support numerals now, so more simp rules and
huffman@47108
  1522
    simprocs may now apply within the proof.
huffman@47108
  1523
huffman@47108
  1524
  - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
huffman@47108
  1525
    Redefine using other integer operations.
huffman@47108
  1526
wenzelm@47855
  1527
* Transfer: New package intended to generalize the existing
wenzelm@47855
  1528
"descending" method and related theorem attributes from the Quotient
wenzelm@47855
  1529
package.  (Not all functionality is implemented yet, but future
wenzelm@47855
  1530
development will focus on Transfer as an eventual replacement for the
wenzelm@47855
  1531
corresponding parts of the Quotient package.)
wenzelm@47809
  1532
wenzelm@47809
  1533
  - transfer_rule attribute: Maintains a collection of transfer rules,
wenzelm@47809
  1534
    which relate constants at two different types. Transfer rules may
wenzelm@47809
  1535
    relate different type instances of the same polymorphic constant,
wenzelm@47809
  1536
    or they may relate an operation on a raw type to a corresponding
wenzelm@47809
  1537
    operation on an abstract type (quotient or subtype). For example:
wenzelm@47809
  1538
wenzelm@47809
  1539
    ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
wenzelm@47809
  1540
    (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
wenzelm@47809
  1541
wenzelm@47809
  1542
  - transfer method: Replaces a subgoal on abstract types with an
wenzelm@47809
  1543
    equivalent subgoal on the corresponding raw types. Constants are
wenzelm@47809
  1544
    replaced with corresponding ones according to the transfer rules.
wenzelm@47809
  1545
    Goals are generalized over all free variables by default; this is
huffman@47851
  1546
    necessary for variables whose types change, but can be overridden
wenzelm@47855
  1547
    for specific variables with e.g. "transfer fixing: x y z".  The
wenzelm@47809
  1548
    variant transfer' method allows replacing a subgoal with one that
wenzelm@47809
  1549
    is logically stronger (rather than equivalent).
wenzelm@47809
  1550
wenzelm@47809
  1551
  - relator_eq attribute: Collects identity laws for relators of
wenzelm@47809
  1552
    various type constructors, e.g. "list_all2 (op =) = (op =)".  The
wenzelm@47809
  1553
    transfer method uses these lemmas to infer transfer rules for
wenzelm@47809
  1554
    non-polymorphic constants on the fly.
wenzelm@47809
  1555
wenzelm@47809
  1556
  - transfer_prover method: Assists with proving a transfer rule for a
wenzelm@47809
  1557
    new constant, provided the constant is defined in terms of other
wenzelm@47809
  1558
    constants that already have transfer rules. It should be applied
wenzelm@47809
  1559
    after unfolding the constant definitions.
wenzelm@47809
  1560
wenzelm@47809
  1561
  - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
wenzelm@47809
  1562
    from type nat to type int.
wenzelm@47809
  1563
huffman@47851
  1564
* Lifting: New package intended to generalize the quotient_definition
huffman@47851
  1565
facility of the Quotient package; designed to work with Transfer.
wenzelm@47809
  1566
wenzelm@47809
  1567
  - lift_definition command: Defines operations on an abstract type in
wenzelm@47809
  1568
    terms of a corresponding operation on a representation
wenzelm@47809
  1569
    type.  Example syntax:
wenzelm@47809
  1570
wenzelm@47809
  1571
    lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
wenzelm@47809
  1572
      is List.insert
wenzelm@47809
  1573
wenzelm@47809
  1574
    Users must discharge a respectfulness proof obligation when each
wenzelm@47809
  1575
    constant is defined. (For a type copy, i.e. a typedef with UNIV,
wenzelm@47809
  1576
    the proof is discharged automatically.) The obligation is
wenzelm@47809
  1577
    presented in a user-friendly, readable form; a respectfulness
wenzelm@47809
  1578
    theorem in the standard format and a transfer rule are generated
wenzelm@47809
  1579
    by the package.
wenzelm@47809
  1580
wenzelm@47809
  1581
  - Integration with code_abstype: For typedefs (e.g. subtypes
wenzelm@47809
  1582
    corresponding to a datatype invariant, such as dlist),
wenzelm@47809
  1583
    lift_definition generates a code certificate theorem and sets up
wenzelm@47809
  1584
    code generation for each constant.
wenzelm@47809
  1585
wenzelm@47809
  1586
  - setup_lifting command: Sets up the Lifting package to work with a
wenzelm@47809
  1587
    user-defined type. The user must provide either a quotient theorem
wenzelm@47809
  1588
    or a type_definition theorem.  The package configures transfer
wenzelm@47809
  1589
    rules for equality and quantifiers on the type, and sets up the
wenzelm@47809
  1590
    lift_definition command to work with the type.
wenzelm@47809
  1591
wenzelm@47809
  1592
  - Usage examples: See Quotient_Examples/Lift_DList.thy,
huffman@47851
  1593
    Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
huffman@47851
  1594
    Word/Word.thy and Library/Float.thy.
wenzelm@47809
  1595
wenzelm@47809
  1596
* Quotient package:
wenzelm@47809
  1597
wenzelm@47809
  1598
  - The 'quotient_type' command now supports a 'morphisms' option with
wenzelm@47809
  1599
    rep and abs functions, similar to typedef.
wenzelm@47809
  1600
wenzelm@47809
  1601
  - 'quotient_type' sets up new types to work with the Lifting and
wenzelm@47809
  1602
    Transfer packages, as with 'setup_lifting'.
wenzelm@47809
  1603
wenzelm@47809
  1604
  - The 'quotient_definition' command now requires the user to prove a
wenzelm@47809
  1605
    respectfulness property at the point where the constant is
wenzelm@47809
  1606
    defined, similar to lift_definition; INCOMPATIBILITY.
wenzelm@47809
  1607
wenzelm@47809
  1608
  - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
wenzelm@47809
  1609
    accordingly, INCOMPATIBILITY.
wenzelm@47809
  1610
wenzelm@47809
  1611
* New diagnostic command 'find_unused_assms' to find potentially
wenzelm@47809
  1612
superfluous assumptions in theorems using Quickcheck.
wenzelm@47809
  1613
wenzelm@47809
  1614
* Quickcheck:
wenzelm@47809
  1615
wenzelm@47809
  1616
  - Quickcheck returns variable assignments as counterexamples, which
wenzelm@47809
  1617
    allows to reveal the underspecification of functions under test.
wenzelm@47809
  1618
    For example, refuting "hd xs = x", it presents the variable
wenzelm@47809
  1619
    assignment xs = [] and x = a1 as a counterexample, assuming that
wenzelm@47809
  1620
    any property is false whenever "hd []" occurs in it.
wenzelm@47809
  1621
wenzelm@47809
  1622
    These counterexample are marked as potentially spurious, as
wenzelm@47809
  1623
    Quickcheck also returns "xs = []" as a counterexample to the
wenzelm@47809
  1624
    obvious theorem "hd xs = hd xs".
wenzelm@47809
  1625
wenzelm@47809
  1626
    After finding a potentially spurious counterexample, Quickcheck
wenzelm@47809
  1627
    continues searching for genuine ones.
wenzelm@47809
  1628
wenzelm@47809
  1629
    By default, Quickcheck shows potentially spurious and genuine
wenzelm@47809
  1630
    counterexamples. The option "genuine_only" sets quickcheck to only
wenzelm@47809
  1631
    show genuine counterexamples.
wenzelm@47809
  1632
wenzelm@47809
  1633
  - The command 'quickcheck_generator' creates random and exhaustive
wenzelm@47809
  1634
    value generators for a given type and operations.
wenzelm@47809
  1635
wenzelm@47809
  1636
    It generates values by using the operations as if they were
wenzelm@47809
  1637
    constructors of that type.
wenzelm@47809
  1638
wenzelm@47809
  1639
  - Support for multisets.
wenzelm@47809
  1640
wenzelm@47809
  1641
  - Added "use_subtype" options.
wenzelm@47809
  1642
wenzelm@47809
  1643
  - Added "quickcheck_locale" configuration to specify how to process
wenzelm@47809
  1644
    conjectures in a locale context.
wenzelm@47809
  1645
wenzelm@47855
  1646
* Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
wenzelm@47855
  1647
and affecting 'rat' and 'real'.
wenzelm@47809
  1648
wenzelm@47809
  1649
* Sledgehammer:
wenzelm@47809
  1650
  - Integrated more tightly with SPASS, as described in the ITP 2012
wenzelm@47809
  1651
    paper "More SPASS with Isabelle".
wenzelm@47809
  1652
  - Made it try "smt" as a fallback if "metis" fails or times out.
wenzelm@47809
  1653
  - Added support for the following provers: Alt-Ergo (via Why3 and
wenzelm@47809
  1654
    TFF1), iProver, iProver-Eq.
wenzelm@47809
  1655
  - Sped up the minimizer.
wenzelm@47809
  1656
  - Added "lam_trans", "uncurry_aliases", and "minimize" options.
wenzelm@47809
  1657
  - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
wenzelm@47809
  1658
  - Renamed "sound" option to "strict".
wenzelm@47809
  1659
wenzelm@47855
  1660
* Metis: Added possibility to specify lambda translations scheme as a
wenzelm@47855
  1661
parenthesized argument (e.g., "by (metis (lifting) ...)").
wenzelm@47855
  1662
wenzelm@47855
  1663
* SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
wenzelm@47855
  1664
wenzelm@47855
  1665
* Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
wenzelm@47809
  1666
wenzelm@47856
  1667
* New "case_product" attribute to generate a case rule doing multiple
wenzelm@47856
  1668
case distinctions at the same time.  E.g.
wenzelm@47856
  1669
wenzelm@47856
  1670
  list.exhaust [case_product nat.exhaust]
wenzelm@47856
  1671
wenzelm@47856
  1672
produces a rule which can be used to perform case distinction on both
wenzelm@47856
  1673
a list and a nat.
wenzelm@47856
  1674
wenzelm@47809
  1675
* New "eventually_elim" method as a generalized variant of the
wenzelm@47855
  1676
eventually_elim* rules.  Supports structured proofs.
wenzelm@47855
  1677
wenzelm@47702
  1678
* Typedef with implicit set definition is considered legacy.  Use
wenzelm@47702
  1679
"typedef (open)" form instead, which will eventually become the
wenzelm@47702
  1680
default.
wenzelm@47702
  1681
wenzelm@47856
  1682
* Record: code generation can be switched off manually with
wenzelm@47856
  1683
wenzelm@47856
  1684
  declare [[record_coden = false]]  -- "default true"
wenzelm@47856
  1685
wenzelm@47856
  1686
* Datatype: type parameters allow explicit sort constraints.
wenzelm@47856
  1687
wenzelm@47855
  1688
* Concrete syntax for case expressions includes constraints for source
wenzelm@47855
  1689
positions, and thus produces Prover IDE markup for its bindings.
wenzelm@47855
  1690
INCOMPATIBILITY for old-style syntax translations that augment the
wenzelm@47855
  1691
pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
wenzelm@47855
  1692
one_case.
wenzelm@47855
  1693
wenzelm@47855
  1694
* Clarified attribute "mono_set": pure declaration without modifying
wenzelm@47855
  1695
the result of the fact expression.
wenzelm@47855
  1696
haftmann@46752
  1697
* More default pred/set conversions on a couple of relation operations
wenzelm@47464
  1698
and predicates.  Added powers of predicate relations.  Consolidation
wenzelm@47464
  1699
of some relation theorems:
haftmann@46752
  1700
haftmann@46752
  1701
  converse_def ~> converse_unfold
haftmann@47549
  1702
  rel_comp_def ~> relcomp_unfold
haftmann@47820
  1703
  symp_def ~> (modified, use symp_def and sym_def instead)
haftmann@46752
  1704
  transp_def ~> transp_trans
haftmann@46752
  1705
  Domain_def ~> Domain_unfold
haftmann@46752
  1706
  Range_def ~> Domain_converse [symmetric]
haftmann@46752
  1707
haftmann@46981
  1708
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
haftmann@46981
  1709
wenzelm@47464
  1710
See theory "Relation" for examples for making use of pred/set
wenzelm@47464
  1711
conversions by means of attributes "to_set" and "to_pred".
haftmann@47086
  1712
haftmann@46752
  1713
INCOMPATIBILITY.
haftmann@46752
  1714
bulwahn@46363
  1715
* Renamed facts about the power operation on relations, i.e., relpow
wenzelm@47464
  1716
to match the constant's name:
wenzelm@47463
  1717
wenzelm@46458
  1718
  rel_pow_1 ~> relpow_1
bulwahn@46363
  1719
  rel_pow_0_I ~> relpow_0_I
bulwahn@46363
  1720
  rel_pow_Suc_I ~> relpow_Suc_I
bulwahn@46363
  1721
  rel_pow_Suc_I2 ~> relpow_Suc_I2
bulwahn@46363
  1722
  rel_pow_0_E ~> relpow_0_E
bulwahn@46363
  1723
  rel_pow_Suc_E ~> relpow_Suc_E
bulwahn@46363
  1724
  rel_pow_E ~> relpow_E
wenzelm@46458
  1725
  rel_pow_Suc_D2 ~> relpow_Suc_D2
wenzelm@47463
  1726
  rel_pow_Suc_E2 ~> relpow_Suc_E2
bulwahn@46363
  1727
  rel_pow_Suc_D2' ~> relpow_Suc_D2'
bulwahn@46363
  1728
  rel_pow_E2 ~> relpow_E2
bulwahn@46363
  1729
  rel_pow_add ~> relpow_add
bulwahn@46363
  1730
  rel_pow_commute ~> relpow
bulwahn@46363
  1731
  rel_pow_empty ~> relpow_empty:
bulwahn@46363
  1732
  rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
bulwahn@46363
  1733
  rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
bulwahn@46363
  1734
  rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
bulwahn@46363
  1735
  rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
bulwahn@46363
  1736
  rel_pow_fun_conv ~> relpow_fun_conv
bulwahn@46363
  1737
  rel_pow_finite_bounded1 ~> relpow_finite_bounded1
bulwahn@46363
  1738
  rel_pow_finite_bounded ~> relpow_finite_bounded
bulwahn@46363
  1739
  rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
bulwahn@46363
  1740
  trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
bulwahn@46363
  1741
  single_valued_rel_pow ~> single_valued_relpow
wenzelm@47463
  1742
bulwahn@46363
  1743
INCOMPATIBILITY.
bulwahn@46363
  1744
bulwahn@47448
  1745
* Theory Relation: Consolidated constant name for relation composition
wenzelm@47464
  1746
and corresponding theorem names:
wenzelm@47464
  1747
haftmann@47549
  1748
  - Renamed constant rel_comp to relcomp.
wenzelm@47464
  1749
bulwahn@47448
  1750
  - Dropped abbreviation pred_comp. Use relcompp instead.
wenzelm@47464
  1751
bulwahn@47448
  1752
  - Renamed theorems:
wenzelm@47464
  1753
bulwahn@47448
  1754
    rel_compI ~> relcompI
bulwahn@47448
  1755
    rel_compEpair ~> relcompEpair
bulwahn@47448
  1756
    rel_compE ~> relcompE
bulwahn@47448
  1757
    pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
bulwahn@47448
  1758
    rel_comp_empty1 ~> relcomp_empty1
bulwahn@47448
  1759
    rel_comp_mono ~> relcomp_mono
bulwahn@47448
  1760
    rel_comp_subset_Sigma ~> relcomp_subset_Sigma
bulwahn@47448
  1761
    rel_comp_distrib ~> relcomp_distrib
bulwahn@47448
  1762
    rel_comp_distrib2 ~> relcomp_distrib2
bulwahn@47448
  1763
    rel_comp_UNION_distrib ~> relcomp_UNION_distrib
bulwahn@47448
  1764
    rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
bulwahn@47448
  1765
    single_valued_rel_comp ~> single_valued_relcomp
haftmann@47549
  1766
    rel_comp_def ~> relcomp_unfold
bulwahn@47448
  1767
    converse_rel_comp ~> converse_relcomp
bulwahn@47448
  1768
    pred_compI ~> relcomppI
bulwahn@47448
  1769
    pred_compE ~> relcomppE
bulwahn@47448
  1770
    pred_comp_bot1 ~> relcompp_bot1
bulwahn@47448
  1771
    pred_comp_bot2 ~> relcompp_bot2
bulwahn@47448
  1772
    transp_pred_comp_less_eq ~> transp_relcompp_less_eq
bulwahn@47448
  1773
    pred_comp_mono ~> relcompp_mono
bulwahn@47448
  1774
    pred_comp_distrib ~> relcompp_distrib
bulwahn@47448
  1775
    pred_comp_distrib2 ~> relcompp_distrib2
bulwahn@47448
  1776
    converse_pred_comp ~> converse_relcompp
wenzelm@47464
  1777
bulwahn@47448
  1778
    finite_rel_comp ~> finite_relcomp
wenzelm@47464
  1779
bulwahn@47448
  1780
    set_rel_comp ~> set_relcomp
bulwahn@47448
  1781
bulwahn@47448
  1782
INCOMPATIBILITY.
bulwahn@47448
  1783
haftmann@47550
  1784
* Theory Divides: Discontinued redundant theorems about div and mod.
haftmann@47550
  1785
INCOMPATIBILITY, use the corresponding generic theorems instead.
haftmann@47550
  1786
haftmann@47550
  1787
  DIVISION_BY_ZERO ~> div_by_0, mod_by_0
haftmann@47550
  1788
  zdiv_self ~> div_self
haftmann@47550
  1789
  zmod_self ~> mod_self
haftmann@47550
  1790
  zdiv_zero ~> div_0
haftmann@47550
  1791
  zmod_zero ~> mod_0
haftmann@47550
  1792
  zdiv_zmod_equality ~> div_mod_equality2
haftmann@47550
  1793
  zdiv_zmod_equality2 ~> div_mod_equality
haftmann@47550
  1794
  zmod_zdiv_trivial ~> mod_div_trivial
haftmann@47550
  1795
  zdiv_zminus_zminus ~> div_minus_minus
haftmann@47550
  1796
  zmod_zminus_zminus ~> mod_minus_minus
haftmann@47550
  1797
  zdiv_zminus2 ~> div_minus_right
haftmann@47550
  1798
  zmod_zminus2 ~> mod_minus_right
haftmann@47550
  1799
  zdiv_minus1_right ~> div_minus1_right
haftmann@47550
  1800
  zmod_minus1_right ~> mod_minus1_right
haftmann@47550
  1801
  zdvd_mult_div_cancel ~> dvd_mult_div_cancel
haftmann@47550
  1802
  zmod_zmult1_eq ~> mod_mult_right_eq
haftmann@47550
  1803
  zpower_zmod ~> power_mod
haftmann@47550
  1804
  zdvd_zmod ~> dvd_mod
haftmann@47550
  1805
  zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
haftmann@47550
  1806
  mod_mult_distrib ~> mult_mod_left
haftmann@47550
  1807
  mod_mult_distrib2 ~> mult_mod_right
haftmann@47550
  1808
haftmann@47550
  1809
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
haftmann@47550
  1810
generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
haftmann@47550
  1811
haftmann@47551
  1812
* Finite_Set.fold now qualified.  INCOMPATIBILITY.
haftmann@47551
  1813
haftmann@47552
  1814
* Consolidated theorem names concerning fold combinators:
haftmann@47550
  1815
haftmann@47550
  1816
  inf_INFI_fold_inf ~> inf_INF_fold_inf
haftmann@47550
  1817
  sup_SUPR_fold_sup ~> sup_SUP_fold_sup
haftmann@47550
  1818
  INFI_fold_inf ~> INF_fold_inf
haftmann@47550
  1819
  SUPR_fold_sup ~> SUP_fold_sup
haftmann@47550
  1820
  union_set ~> union_set_fold
haftmann@47550
  1821
  minus_set ~> minus_set_fold
haftmann@47550
  1822
  INFI_set_fold ~> INF_set_fold
haftmann@47550
  1823
  SUPR_set_fold ~> SUP_set_fold
haftmann@47550
  1824
  INF_code ~> INF_set_foldr
haftmann@47550
  1825
  SUP_code ~> SUP_set_foldr
haftmann@47550
  1826
  foldr.simps ~> foldr.simps (in point-free formulation)
haftmann@47550
  1827
  foldr_fold_rev ~> foldr_conv_fold
haftmann@47550
  1828
  foldl_fold ~> foldl_conv_fold
haftmann@47550
  1829
  foldr_foldr ~> foldr_conv_foldl
haftmann@47550
  1830
  foldl_foldr ~> foldl_conv_foldr
haftmann@47552
  1831
  fold_set_remdups ~> fold_set_fold_remdups
haftmann@47552
  1832
  fold_set ~> fold_set_fold
haftmann@47552
  1833
  fold1_set ~> fold1_set_fold
haftmann@47550
  1834
haftmann@47550
  1835
INCOMPATIBILITY.
haftmann@47550
  1836
haftmann@47550
  1837
* Dropped rarely useful theorems concerning fold combinators:
haftmann@47550
  1838
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
haftmann@47550
  1839
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
haftmann@47550
  1840
concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
haftmann@47550
  1841
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
haftmann@47550
  1842
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
haftmann@47550
  1843
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
haftmann@47550
  1844
INCOMPATIBILITY.  For the common phrases "%xs. List.foldr plus xs 0"
haftmann@47550
  1845
and "List.foldl plus 0", prefer "List.listsum".  Otherwise it can be
haftmann@47550
  1846
useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
haftmann@47550
  1847
unfolding "foldr_conv_fold" and "foldl_conv_fold".
haftmann@47550
  1848
haftmann@47550
  1849
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
haftmann@47550
  1850
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
haftmann@47550
  1851
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
haftmann@47550
  1852
INF_set_foldr, SUP_set_foldr.  INCOMPATIBILITY.  Prefer corresponding
haftmann@47550
  1853
lemmas over fold rather than foldr, or make use of lemmas
haftmann@47550
  1854
fold_conv_foldr and fold_rev.
haftmann@47550
  1855
haftmann@47550
  1856
* Congruence rules Option.map_cong and Option.bind_cong for recursion
haftmann@47550
  1857
through option types.
haftmann@47550
  1858
wenzelm@47856
  1859
* "Transitive_Closure.ntrancl": bounded transitive closure on
wenzelm@47856
  1860
relations.
wenzelm@47856
  1861
wenzelm@47856
  1862
* Constant "Set.not_member" now qualified.  INCOMPATIBILITY.
wenzelm@47856
  1863
wenzelm@47856
  1864
* Theory Int: Discontinued many legacy theorems specific to type int.
wenzelm@47856
  1865
INCOMPATIBILITY, use the corresponding generic theorems instead.
wenzelm@47856
  1866
wenzelm@47856
  1867
  zminus_zminus ~> minus_minus
wenzelm@47856
  1868
  zminus_0 ~> minus_zero
wenzelm@47856
  1869
  zminus_zadd_distrib ~> minus_add_distrib
wenzelm@47856
  1870
  zadd_commute ~> add_commute
wenzelm@47856
  1871
  zadd_assoc ~> add_assoc
wenzelm@47856
  1872
  zadd_left_commute ~> add_left_commute
wenzelm@47856
  1873
  zadd_ac ~> add_ac
wenzelm@47856
  1874
  zmult_ac ~> mult_ac
wenzelm@47856
  1875
  zadd_0 ~> add_0_left
wenzelm@47856
  1876
  zadd_0_right ~> add_0_right
wenzelm@47856
  1877
  zadd_zminus_inverse2 ~> left_minus
wenzelm@47856
  1878
  zmult_zminus ~> mult_minus_left
wenzelm@47856
  1879
  zmult_commute ~> mult_commute
wenzelm@47856
  1880
  zmult_assoc ~> mult_assoc
wenzelm@47856
  1881
  zadd_zmult_distrib ~> left_distrib
wenzelm@47856
  1882
  zadd_zmult_distrib2 ~> right_distrib
wenzelm@47856
  1883
  zdiff_zmult_distrib ~> left_diff_distrib
wenzelm@47856
  1884
  zdiff_zmult_distrib2 ~> right_diff_distrib
wenzelm@47856
  1885
  zmult_1 ~> mult_1_left
wenzelm@47856
  1886
  zmult_1_right ~> mult_1_right
wenzelm@47856
  1887
  zle_refl ~> order_refl
wenzelm@47856
  1888
  zle_trans ~> order_trans
wenzelm@47856
  1889
  zle_antisym ~> order_antisym
wenzelm@47856
  1890
  zle_linear ~> linorder_linear
wenzelm@47856
  1891
  zless_linear ~> linorder_less_linear
wenzelm@47856
  1892
  zadd_left_mono ~> add_left_mono
wenzelm@47856
  1893
  zadd_strict_right_mono ~> add_strict_right_mono
wenzelm@47856
  1894
  zadd_zless_mono ~> add_less_le_mono
wenzelm@47856
  1895
  int_0_less_1 ~> zero_less_one
wenzelm@47856
  1896
  int_0_neq_1 ~> zero_neq_one
wenzelm@47856
  1897
  zless_le ~> less_le
wenzelm@47856
  1898
  zpower_zadd_distrib ~> power_add
wenzelm@47856
  1899
  zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
wenzelm@47856
  1900
  zero_le_zpower_abs ~> zero_le_power_abs
wenzelm@47856
  1901
wenzelm@47856
  1902
* Theory Deriv: Renamed
wenzelm@47856
  1903
wenzelm@47856
  1904
  DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
wenzelm@47856
  1905
wenzelm@47856
  1906
* Theory Library/Multiset: Improved code generation of multisets.
wenzelm@47856
  1907
wenzelm@47855
  1908
* Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
krauss@47703
  1909
are expressed via type classes again. The special syntax
krauss@47703
  1910
\<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
krauss@47703
  1911
setsum_set, which is now subsumed by Big_Operators.setsum.
krauss@47703
  1912
INCOMPATIBILITY.
krauss@47703
  1913
wenzelm@46160
  1914
* Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
wenzelm@46160
  1915
use theory HOL/Library/Nat_Bijection instead.
wenzelm@46160
  1916
wenzelm@47464
  1917
* Theory HOL/Library/RBT_Impl: Backing implementation of red-black
wenzelm@47464
  1918
trees is now inside a type class context.  Names of affected
wenzelm@47464
  1919
operations and lemmas have been prefixed by rbt_.  INCOMPATIBILITY for
wenzelm@47464
  1920
theories working directly with raw red-black trees, adapt the names as
wenzelm@47464
  1921
follows:
Andreas@47452
  1922
Andreas@47452
  1923
  Operations:
Andreas@47452
  1924
  bulkload -> rbt_bulkload
Andreas@47452
  1925
  del_from_left -> rbt_del_from_left
Andreas@47452
  1926
  del_from_right -> rbt_del_from_right
Andreas@47452
  1927
  del -> rbt_del
Andreas@47452
  1928
  delete -> rbt_delete
Andreas@47452
  1929
  ins -> rbt_ins
Andreas@47452
  1930
  insert -> rbt_insert
Andreas@47452
  1931
  insertw -> rbt_insert_with
Andreas@47452
  1932
  insert_with_key -> rbt_insert_with_key
Andreas@47452
  1933
  map_entry -> rbt_map_entry
Andreas@47452
  1934
  lookup -> rbt_lookup
Andreas@47452
  1935
  sorted -> rbt_sorted
Andreas@47452
  1936
  tree_greater -> rbt_greater
Andreas@47452
  1937
  tree_less -> rbt_less
Andreas@47452
  1938
  tree_less_symbol -> rbt_less_symbol
Andreas@47452
  1939
  union -> rbt_union
Andreas@47452
  1940
  union_with -> rbt_union_with
Andreas@47452
  1941
  union_with_key -> rbt_union_with_key
Andreas@47452
  1942
Andreas@47452
  1943
  Lemmas:
Andreas@47452
  1944
  balance_left_sorted -> balance_left_rbt_sorted
Andreas@47452
  1945
  balance_left_tree_greater -> balance_left_rbt_greater
Andreas@47452
  1946
  balance_left_tree_less -> balance_left_rbt_less
Andreas@47452
  1947
  balance_right_sorted -> balance_right_rbt_sorted
Andreas@47452
  1948
  balance_right_tree_greater -> balance_right_rbt_greater
Andreas@47452
  1949
  balance_right_tree_less -> balance_right_rbt_less
Andreas@47452
  1950
  balance_sorted -> balance_rbt_sorted
Andreas@47452
  1951
  balance_tree_greater -> balance_rbt_greater
Andreas@47452
  1952
  balance_tree_less -> balance_rbt_less
Andreas@47452
  1953
  bulkload_is_rbt -> rbt_bulkload_is_rbt
Andreas@47452
  1954
  combine_sorted -> combine_rbt_sorted
Andreas@47452
  1955
  combine_tree_greater -> combine_rbt_greater
Andreas@47452
  1956
  combine_tree_less -> combine_rbt_less
Andreas@47452
  1957
  delete_in_tree -> rbt_delete_in_tree
Andreas@47452
  1958
  delete_is_rbt -> rbt_delete_is_rbt
Andreas@47452
  1959
  del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
Andreas@47452
  1960
  del_from_left_tree_less -> rbt_del_from_left_rbt_less
Andreas@47452
  1961
  del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
Andreas@47452
  1962
  del_from_right_tree_less -> rbt_del_from_right_rbt_less
Andreas@47452
  1963
  del_in_tree -> rbt_del_in_tree
Andreas@47452
  1964
  del_inv1_inv2 -> rbt_del_inv1_inv2
Andreas@47452
  1965
  del_sorted -> rbt_del_rbt_sorted
Andreas@47452
  1966
  del_tree_greater -> rbt_del_rbt_greater
Andreas@47452
  1967
  del_tree_less -> rbt_del_rbt_less
Andreas@47452
  1968
  dom_lookup_Branch -> dom_rbt_lookup_Branch
Andreas@47452
  1969
  entries_lookup -> entries_rbt_lookup
Andreas@47452
  1970
  finite_dom_lookup -> finite_dom_rbt_lookup
Andreas@47452
  1971
  insert_sorted -> rbt_insert_rbt_sorted
Andreas@47452
  1972
  insertw_is_rbt -> rbt_insertw_is_rbt
Andreas@47452
  1973
  insertwk_is_rbt -> rbt_insertwk_is_rbt
Andreas@47452
  1974
  insertwk_sorted -> rbt_insertwk_rbt_sorted
Andreas@47452
  1975
  insertw_sorted -> rbt_insertw_rbt_sorted
Andreas@47452
  1976
  ins_sorted -> ins_rbt_sorted
Andreas@47452
  1977
  ins_tree_greater -> ins_rbt_greater
Andreas@47452
  1978
  ins_tree_less -> ins_rbt_less
Andreas@47452
  1979
  is_rbt_sorted -> is_rbt_rbt_sorted
Andreas@47452
  1980
  lookup_balance -> rbt_lookup_balance
Andreas@47452
  1981
  lookup_bulkload -> rbt_lookup_rbt_bulkload
Andreas@47452
  1982
  lookup_delete -> rbt_lookup_rbt_delete
Andreas@47452
  1983
  lookup_Empty -> rbt_lookup_Empty
Andreas@47452
  1984
  lookup_from_in_tree -> rbt_lookup_from_in_tree
Andreas@47452
  1985
  lookup_in_tree -> rbt_lookup_in_tree
Andreas@47452
  1986
  lookup_ins -> rbt_lookup_ins
Andreas@47452
  1987
  lookup_insert -> rbt_lookup_rbt_insert
Andreas@47452
  1988
  lookup_insertw -> rbt_lookup_rbt_insertw
Andreas@47452
  1989
  lookup_insertwk -> rbt_lookup_rbt_insertwk
Andreas@47452
  1990
  lookup_keys -> rbt_lookup_keys
Andreas@47452
  1991
  lookup_map -> rbt_lookup_map
Andreas@47452
  1992
  lookup_map_entry -> rbt_lookup_rbt_map_entry
Andreas@47452
  1993
  lookup_tree_greater -> rbt_lookup_rbt_greater
Andreas@47452
  1994
  lookup_tree_less -> rbt_lookup_rbt_less
Andreas@47452
  1995
  lookup_union -> rbt_lookup_rbt_union
Andreas@47452
  1996
  map_entry_color_of -> rbt_map_entry_color_of
Andreas@47452
  1997
  map_entry_inv1 -> rbt_map_entry_inv1
Andreas@47452
  1998
  map_entry_inv2 -> rbt_map_entry_inv2
Andreas@47452
  1999
  map_entry_is_rbt -> rbt_map_entry_is_rbt
Andreas@47452
  2000
  map_entry_sorted -> rbt_map_entry_rbt_sorted
Andreas@47452
  2001
  map_entry_tree_greater -> rbt_map_entry_rbt_greater
Andreas@47452
  2002
  map_entry_tree_less -> rbt_map_entry_rbt_less
Andreas@47452
  2003
  map_tree_greater -> map_rbt_greater
Andreas@47452
  2004
  map_tree_less -> map_rbt_less
Andreas@47452
  2005
  map_sorted -> map_rbt_sorted
Andreas@47452
  2006
  paint_sorted -> paint_rbt_sorted
Andreas@47452
  2007
  paint_lookup -> paint_rbt_lookup
Andreas@47452
  2008
  paint_tree_greater -> paint_rbt_greater
Andreas@47452
  2009
  paint_tree_less -> paint_rbt_less
Andreas@47452
  2010
  sorted_entries -> rbt_sorted_entries
Andreas@47452
  2011
  tree_greater_eq_trans -> rbt_greater_eq_trans
Andreas@47452
  2012
  tree_greater_nit -> rbt_greater_nit
Andreas@47452
  2013
  tree_greater_prop -> rbt_greater_prop
Andreas@47452
  2014
  tree_greater_simps -> rbt_greater_simps
Andreas@47452
  2015
  tree_greater_trans -> rbt_greater_trans
Andreas@47452
  2016
  tree_less_eq_trans -> rbt_less_eq_trans
Andreas@47452
  2017
  tree_less_nit -> rbt_less_nit
Andreas@47452
  2018
  tree_less_prop -> rbt_less_prop
Andreas@47452
  2019
  tree_less_simps -> rbt_less_simps
Andreas@47452
  2020
  tree_less_trans -> rbt_less_trans
Andreas@47452
  2021
  tree_ord_props -> rbt_ord_props
Andreas@47452
  2022
  union_Branch -> rbt_union_Branch
Andreas@47452
  2023
  union_is_rbt -> rbt_union_is_rbt
Andreas@47452
  2024
  unionw_is_rbt -> rbt_unionw_is_rbt
Andreas@47452
  2025
  unionwk_is_rbt -> rbt_unionwk_is_rbt
Andreas@47452
  2026
  unionwk_sorted -> rbt_unionwk_rbt_sorted
Andreas@47452
  2027
wenzelm@47807
  2028
* Theory HOL/Library/Float: Floating point numbers are now defined as
wenzelm@47807
  2029
a subset of the real numbers.  All operations are defined using the
wenzelm@47807
  2030
lifing-framework and proofs use the transfer method.  INCOMPATIBILITY.
hoelzl@47616
  2031
hoelzl@47616
  2032
  Changed Operations:
hoelzl@47622
  2033
  float_abs -> abs
hoelzl@47622
  2034
  float_nprt -> nprt
hoelzl@47622
  2035
  float_pprt -> pprt
hoelzl@47622
  2036
  pow2 -> use powr
hoelzl@47622
  2037
  round_down -> float_round_down
hoelzl@47622
  2038
  round_up -> float_round_up
hoelzl@47622
  2039
  scale -> exponent
hoelzl@47622
  2040
hoelzl@47622
  2041
  Removed Operations:
hoelzl@47622
  2042
  ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
hoelzl@47622
  2043
hoelzl@47622
  2044
  Renamed Lemmas:
hoelzl@47622
  2045
  abs_float_def -> Float.compute_float_abs
hoelzl@47622
  2046
  bitlen_ge0 -> bitlen_nonneg
hoelzl@47622
  2047
  bitlen.simps -> Float.compute_bitlen
hoelzl@47622
  2048
  float_components -> Float_mantissa_exponent
hoelzl@47622
  2049
  float_divl.simps -> Float.compute_float_divl
hoelzl@47622
  2050
  float_divr.simps -> Float.compute_float_divr
hoelzl@47622
  2051
  float_eq_odd -> mult_powr_eq_mult_powr_iff
hoelzl@47622
  2052
  float_power -> real_of_float_power
hoelzl@47622
  2053
  lapprox_posrat_def -> Float.compute_lapprox_posrat
hoelzl@47622
  2054
  lapprox_rat.simps -> Float.compute_lapprox_rat
hoelzl@47622
  2055
  le_float_def' -> Float.compute_float_le
hoelzl@47622
  2056
  le_float_def -> less_eq_float.rep_eq
hoelzl@47622
  2057
  less_float_def' -> Float.compute_float_less
hoelzl@47622
  2058
  less_float_def -> less_float.rep_eq
hoelzl@47622
  2059
  normfloat_def -> Float.compute_normfloat
hoelzl@47622
  2060
  normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
hoelzl@47622
  2061
  normfloat -> normfloat_def
hoelzl@47622
  2062
  normfloat_unique -> use normfloat_def
hoelzl@47622
  2063
  number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
hoelzl@47622
  2064
  one_float_def -> Float.compute_float_one
hoelzl@47622
  2065
  plus_float_def -> Float.compute_float_plus
hoelzl@47622
  2066
  rapprox_posrat_def -> Float.compute_rapprox_posrat
hoelzl@47622
  2067
  rapprox_rat.simps -> Float.compute_rapprox_rat
hoelzl@47622
  2068
  real_of_float_0 -> zero_float.rep_eq
hoelzl@47622
  2069
  real_of_float_1 -> one_float.rep_eq
hoelzl@47622
  2070
  real_of_float_abs -> abs_float.rep_eq
hoelzl@47622
  2071
  real_of_float_add -> plus_float.rep_eq
hoelzl@47622
  2072
  real_of_float_minus -> uminus_float.rep_eq
hoelzl@47622
  2073
  real_of_float_mult -> times_float.rep_eq
hoelzl@47622
  2074
  real_of_float_simp -> Float.rep_eq
hoelzl@47622
  2075
  real_of_float_sub -> minus_float.rep_eq
hoelzl@47622
  2076
  round_down.simps -> Float.compute_float_round_down
hoelzl@47622
  2077
  round_up.simps -> Float.compute_float_round_up
hoelzl@47622
  2078
  times_float_def -> Float.compute_float_times
hoelzl@47622
  2079
  uminus_float_def -> Float.compute_float_uminus
hoelzl@47622
  2080
  zero_float_def -> Float.compute_float_zero
hoelzl@47622
  2081
hoelzl@47622
  2082
  Lemmas not necessary anymore, use the transfer method:
hoelzl@47622
  2083
  bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
hoelzl@47622
  2084
  float_divr, float_le_simp, float_less1_mantissa_bound,
hoelzl@47622
  2085
  float_less_simp, float_less_zero, float_le_zero,
hoelzl@47622
  2086
  float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
hoelzl@47622
  2087
  floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
hoelzl@47622
  2088
  lapprox_rat_bottom, normalized_float, rapprox_posrat,
hoelzl@47622
  2089
  rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
hoelzl@47622
  2090
  real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
hoelzl@47622
  2091
  round_up, zero_le_float, zero_less_float
hoelzl@47616
  2092
wenzelm@47856
  2093
* New theory HOL/Library/DAList provides an abstract type for
wenzelm@47856
  2094
association lists with distinct keys.
noschinl@45791
  2095
wenzelm@47866
  2096
* Session HOL/IMP: Added new theory of abstract interpretation of
wenzelm@47866
  2097
annotated commands.
wenzelm@47866
  2098
wenzelm@47855
  2099
* Session HOL-Import: Re-implementation from scratch is faster,
wenzelm@47855
  2100
simpler, and more scalable.  Requires a proof bundle, which is
wenzelm@47855
  2101
available as an external component.  Discontinued old (and mostly
wenzelm@47855
  2102
dead) Importer for HOL4 and HOL Light.  INCOMPATIBILITY.
wenzelm@47855
  2103
wenzelm@47855
  2104
* Session HOL-Word: Discontinued many redundant theorems specific to
wenzelm@47855
  2105
type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
wenzelm@47855
  2106
instead.
wenzelm@47855
  2107
wenzelm@47855
  2108
  word_sub_alt ~> word_sub_wi
wenzelm@47855
  2109
  word_add_alt ~> word_add_def
wenzelm@47855
  2110
  word_mult_alt ~> word_mult_def
wenzelm@47855
  2111
  word_minus_alt ~> word_minus_def
wenzelm@47855
  2112
  word_0_alt ~> word_0_wi
wenzelm@47855
  2113
  word_1_alt ~> word_1_wi
wenzelm@47855
  2114
  word_add_0 ~> add_0_left
wenzelm@47855
  2115
  word_add_0_right ~> add_0_right
wenzelm@47855
  2116
  word_mult_1 ~> mult_1_left
wenzelm@47855
  2117
  word_mult_1_right ~> mult_1_right
wenzelm@47855
  2118
  word_add_commute ~> add_commute
wenzelm@47855
  2119
  word_add_assoc ~> add_assoc
wenzelm@47855
  2120
  word_add_left_commute ~> add_left_commute
wenzelm@47855
  2121
  word_mult_commute ~> mult_commute
wenzelm@47855
  2122
  word_mult_assoc ~> mult_assoc
wenzelm@47855
  2123
  word_mult_left_commute ~> mult_left_commute
wenzelm@47855
  2124
  word_left_distrib ~> left_distrib
wenzelm@47855
  2125
  word_right_distrib ~> right_distrib
wenzelm@47855
  2126
  word_left_minus ~> left_minus
wenzelm@47855
  2127
  word_diff_0_right ~> diff_0_right
wenzelm@47855
  2128
  word_diff_self ~> diff_self
wenzelm@47855
  2129
  word_sub_def ~> diff_minus
wenzelm@47855
  2130
  word_diff_minus ~> diff_minus
wenzelm@47855
  2131
  word_add_ac ~> add_ac
wenzelm@47855
  2132
  word_mult_ac ~> mult_ac
wenzelm@47855
  2133
  word_plus_ac0 ~> add_0_left add_0_right add_ac
wenzelm@47855
  2134
  word_times_ac1 ~> mult_1_left mult_1_right mult_ac
wenzelm@47855
  2135
  word_order_trans ~> order_trans
wenzelm@47855
  2136
  word_order_refl ~> order_refl
wenzelm@47855
  2137
  word_order_antisym ~> order_antisym
wenzelm@47855
  2138
  word_order_linear ~> linorder_linear
wenzelm@47855
  2139
  lenw1_zero_neq_one ~> zero_neq_one
wenzelm@47855
  2140
  word_number_of_eq ~> number_of_eq
wenzelm@47855
  2141
  word_of_int_add_hom ~> wi_hom_add
wenzelm@47855
  2142
  word_of_int_sub_hom ~> wi_hom_sub
wenzelm@47855
  2143
  word_of_int_mult_hom ~> wi_hom_mult
wenzelm@47855
  2144
  word_of_int_minus_hom ~> wi_hom_neg
wenzelm@47855
  2145
  word_of_int_succ_hom ~> wi_hom_succ
wenzelm@47855
  2146
  word_of_int_pred_hom ~> wi_hom_pred
wenzelm@47855
  2147
  word_of_int_0_hom ~> word_0_wi
wenzelm@47855
  2148
  word_of_int_1_hom ~> word_1_wi
wenzelm@47855
  2149
wenzelm@47809
  2150
* Session HOL-Word: New proof method "word_bitwise" for splitting
wenzelm@47809
  2151
machine word equalities and inequalities into logical circuits,
wenzelm@47809
  2152
defined in HOL/Word/WordBitwise.thy.  Supports addition, subtraction,
wenzelm@47809
  2153
multiplication, shifting by constants, bitwise operators and numeric
wenzelm@47809
  2154
constants.  Requires fixed-length word types, not 'a word.  Solves
wenzelm@47854
  2155
many standard word identities outright and converts more into first
wenzelm@47809
  2156
order problems amenable to blast or similar.  See also examples in
wenzelm@47809
  2157
HOL/Word/Examples/WordExamples.thy.
wenzelm@47809
  2158
wenzelm@47807
  2159
* Session HOL-Probability: Introduced the type "'a measure" to
wenzelm@47807
  2160
represent measures, this replaces the records 'a algebra and 'a
wenzelm@47807
  2161
measure_space.  The locales based on subset_class now have two
wenzelm@47856
  2162
locale-parameters the space \<Omega> and the set of measurable sets M.
wenzelm@47856
  2163
The product of probability spaces uses now the same constant as the
wenzelm@47856
  2164
finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
wenzelm@47807
  2165
measure".  Most constants are defined now outside of locales and gain
wenzelm@47807
  2166
an additional parameter, like null_sets, almost_eventually or \<mu>'.
wenzelm@47807
  2167
Measure space constructions for distributions and densities now got
wenzelm@47807
  2168
their own constants distr and density.  Instead of using locales to
wenzelm@47807
  2169
describe measure spaces with a finite space, the measure count_space
wenzelm@47807
  2170
and point_measure is introduced.  INCOMPATIBILITY.
hoelzl@47694
  2171
hoelzl@47694
  2172
  Renamed constants:
hoelzl@47694
  2173
  measure -> emeasure
hoelzl@47694
  2174
  finite_measure.\<mu>' -> measure
hoelzl@47694
  2175
  product_algebra_generator -> prod_algebra
hoelzl@47694
  2176
  product_prob_space.emb -> prod_emb
hoelzl@47694
  2177
  product_prob_space.infprod_algebra -> PiM
hoelzl@47694
  2178
hoelzl@47694
  2179
  Removed locales:
hoelzl@47694
  2180
  completeable_measure_space
hoelzl@47694
  2181
  finite_measure_space
hoelzl@47694
  2182
  finite_prob_space
hoelzl@47694
  2183
  finite_product_finite_prob_space
hoelzl@47694
  2184
  finite_product_sigma_algebra
hoelzl@47694
  2185
  finite_sigma_algebra
hoelzl@47694
  2186
  measure_space
hoelzl@47694
  2187
  pair_finite_prob_space
hoelzl@47694
  2188
  pair_finite_sigma_algebra
hoelzl@47694
  2189
  pair_finite_space
hoelzl@47694
  2190
  pair_sigma_algebra
hoelzl@47694
  2191
  product_sigma_algebra
hoelzl@47694
  2192
hoelzl@47694
  2193
  Removed constants:
hoelzl@47751
  2194
  conditional_space
hoelzl@47694
  2195
  distribution -> use distr measure, or distributed predicate
hoelzl@47751
  2196
  image_space
hoelzl@47694
  2197
  joint_distribution -> use distr measure, or distributed predicate
hoelzl@47751
  2198
  pair_measure_generator
hoelzl@47694
  2199
  product_prob_space.infprod_algebra -> use PiM
hoelzl@47694
  2200
  subvimage
hoelzl@47694
  2201
hoelzl@47694
  2202
  Replacement theorems:
hoelzl@47751
  2203
  finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
hoelzl@47751
  2204
  finite_measure.empty_measure -> measure_empty
hoelzl@47751
  2205
  finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
hoelzl@47751
  2206
  finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
hoelzl@47751
  2207
  finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
hoelzl@47751
  2208
  finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
hoelzl@47751
  2209
  finite_measure.finite_measure -> finite_measure.emeasure_finite
hoelzl@47751
  2210
  finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
hoelzl@47751
  2211
  finite_measure.positive_measure' -> measure_nonneg
hoelzl@47751
  2212
  finite_measure.real_measure -> finite_measure.emeasure_real
hoelzl@47751
  2213
  finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
hoelzl@47751
  2214
  finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
hoelzl@47751
  2215
  finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
hoelzl@47751
  2216
  information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
hoelzl@47751
  2217
  information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
hoelzl@47751
  2218
  information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
hoelzl@47751
  2219
  information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
hoelzl@47751
  2220
  information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
hoelzl@47751
  2221
  information_space.entropy_commute -> information_space.entropy_commute_simple
hoelzl@47751
  2222
  information_space.entropy_eq -> information_space.entropy_simple_distributed
hoelzl@47751
  2223
  information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
hoelzl@47751
  2224
  information_space.entropy_positive -> information_space.entropy_nonneg_simple
hoelzl@47751
  2225
  information_space.entropy_uniform_max -> information_space.entropy_uniform
hoelzl@47751
  2226
  information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
hoelzl@47751
  2227
  information_space.KL_eq_0 -> information_space.KL_same_eq_0
hoelzl@47751
  2228
  information_space.KL_ge_0 -> information_space.KL_nonneg
hoelzl@47751
  2229
  information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
hoelzl@47751
  2230
  information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
hoelzl@47751
  2231
  Int_stable_cuboids -> Int_stable_atLeastAtMost
hoelzl@47751
  2232
  Int_stable_product_algebra_generator -> positive_integral
hoelzl@47751
  2233
  measure_preserving -> equality "distr M N f = N" "f : measurable M N"
hoelzl@47694
  2234
  measure_space.additive -> emeasure_additive
hoelzl@47751
  2235
  measure_space.AE_iff_null_set -> AE_iff_null
hoelzl@47751
  2236
  measure_space.almost_everywhere_def -> eventually_ae_filter
hoelzl@47751
  2237
  measure_space.almost_everywhere_vimage -> AE_distrD
hoelzl@47751
  2238
  measure_space.continuity_from_above -> INF_emeasure_decseq
hoelzl@47751
  2239
  measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
hoelzl@47751
  2240
  measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
hoelzl@47694
  2241
  measure_space.continuity_from_below -> SUP_emeasure_incseq
hoelzl@47751
  2242
  measure_space_density -> emeasure_density
hoelzl@47751
  2243
  measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
hoelzl@47751
  2244
  measure_space.integrable_vimage -> integrable_distr
hoelzl@47751
  2245
  measure_space.integral_translated_density -> integral_density
hoelzl@47751
  2246
  measure_space.integral_vimage -> integral_distr
hoelzl@47751
  2247
  measure_space.measure_additive -> plus_emeasure
hoelzl@47751
  2248
  measure_space.measure_compl -> emeasure_compl
hoelzl@47751
  2249
  measure_space.measure_countable_increasing -> emeasure_countable_increasing
hoelzl@47751
  2250
  measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
hoelzl@47694
  2251
  measure_space.measure_decseq -> decseq_emeasure
hoelzl@47751
  2252
  measure_space.measure_Diff -> emeasure_Diff
hoelzl@47751
  2253
  measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
hoelzl@47694
  2254
  measure_space.measure_eq_0 -> emeasure_eq_0
hoelzl@47694
  2255
  measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
hoelzl@47751
  2256
  measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
hoelzl@47751
  2257
  measure_space.measure_incseq -> incseq_emeasure
hoelzl@47751
  2258
  measure_space.measure_insert -> emeasure_insert
hoelzl@47751
  2259
  measure_space.measure_mono -> emeasure_mono
hoelzl@47751
  2260
  measure_space.measure_not_negative -> emeasure_not_MInf
hoelzl@47751
  2261
  measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
hoelzl@47751
  2262
  measure_space.measure_setsum -> setsum_emeasure
hoelzl@47751
  2263
  measure_space.measure_setsum_split -> setsum_emeasure_cover
hoelzl@47694
  2264
  measure_space.measure_space_vimage -> emeasure_distr
hoelzl@47751
  2265
  measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
hoelzl@47751
  2266
  measure_space.measure_subadditive -> subadditive
hoelzl@47751
  2267
  measure_space.measure_top -> emeasure_space
hoelzl@47751
  2268
  measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
hoelzl@47751
  2269
  measure_space.measure_Un_null_set -> emeasure_Un_null_set
hoelzl@47751
  2270
  measure_space.positive_integral_translated_density -> positive_integral_density
hoelzl@47751
  2271
  measure_space.positive_integral_vimage -> positive_integral_distr
hoelzl@47694
  2272
  measure_space.real_continuity_from_above -> Lim_measure_decseq
hoelzl@47751
  2273
  measure_space.real_continuity_from_below -> Lim_measure_incseq
hoelzl@47694
  2274
  measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
hoelzl@47751
  2275
  measure_space.real_measure_Diff -> measure_Diff
hoelzl@47751
  2276
  measure_space.real_measure_finite_Union -> measure_finite_Union
hoelzl@47751
  2277
  measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
hoelzl@47751
  2278
  measure_space.real_measure_subadditive -> measure_subadditive
hoelzl@47751
  2279
  measure_space.real_measure_Union -> measure_Union
hoelzl@47751
  2280
  measure_space.real_measure_UNION -> measure_UNION
hoelzl@47694
  2281
  measure_space.simple_function_vimage -> simple_function_comp
hoelzl@47694
  2282
  measure_space.simple_integral_vimage -> simple_integral_distr
hoelzl@47751
  2283
  measure_space.simple_integral_vimage -> simple_integral_distr
hoelzl@47751
  2284
  measure_unique_Int_stable -> measure_eqI_generator_eq
hoelzl@47751
  2285
  measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
hoelzl@47694
  2286
  pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
hoelzl@47694
  2287
  pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
hoelzl@47694
  2288
  pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
hoelzl@47694
  2289
  pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
hoelzl@47694
  2290
  pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
hoelzl@47694
  2291
  pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
hoelzl@47694
  2292
  pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
hoelzl@47694
  2293
  pair_sigma_algebra.sets_swap -> sets_pair_swap
hoelzl@47751
  2294
  pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
hoelzl@47751
  2295
  pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
hoelzl@47751
  2296
  pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
hoelzl@47751
  2297
  pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
hoelzl@47751
  2298
  pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
hoelzl@47751
  2299
  pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
hoelzl@47751
  2300
  prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
hoelzl@47751
  2301
  prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
hoelzl@47694
  2302
  prob_space.measure_space_1 -> prob_space.emeasure_space_1
hoelzl@47694
  2303
  prob_space.prob_space_vimage -> prob_space_distr
hoelzl@47694
  2304
  prob_space.random_variable_restrict -> measurable_restrict
hoelzl@47751
  2305
  prob_space_unique_Int_stable -> measure_eqI_prob_space
hoelzl@47751
  2306
  product_algebraE -> prod_algebraE_all
hoelzl@47751
  2307
  product_algebra_generator_der -> prod_algebra_eq_finite
hoelzl@47751
  2308
  product_algebra_generator_into_space -> prod_algebra_sets_into_space
hoelzl@47751
  2309
  product_algebraI -> sets_PiM_I_finite
hoelzl@47751
  2310
  product_measure_exists -> product_sigma_finite.sigma_finite
hoelzl@47694
  2311
  product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
hoelzl@47694
  2312
  product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
hoelzl@47694
  2313
  product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
hoelzl@47694
  2314
  product_prob_space.measurable_component -> measurable_component_singleton
hoelzl@47694
  2315
  product_prob_space.measurable_emb -> measurable_prod_emb
hoelzl@47694
  2316
  product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
hoelzl@47694
  2317
  product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
hoelzl@47694
  2318
  product_prob_space.measure_emb -> emeasure_prod_emb
hoelzl@47751
  2319
  product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
hoelzl@47751
  2320
  product_sigma_algebra.product_algebra_into_space -> space_closed
hoelzl@47751
  2321
  product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
hoelzl@47751
  2322
  product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
hoelzl@47751
  2323
  product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
hoelzl@47694
  2324
  sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
hoelzl@47751
  2325
  sets_product_algebra -> sets_PiM
hoelzl@47751
  2326
  sigma_algebra.measurable_sigma -> measurable_measure_of
hoelzl@47751
  2327
  sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
hoelzl@47751
  2328
  sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
hoelzl@47751
  2329
  sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
hoelzl@47751
  2330
  space_product_algebra -> space_PiM
hoelzl@47694
  2331
wenzelm@47855
  2332
* Session HOL-TPTP: support to parse and import TPTP problems (all
wenzelm@47855
  2333
languages) into Isabelle/HOL.
wenzelm@47413
  2334
blanchet@45398
  2335
noschinl@45160
  2336
*** FOL ***
noschinl@45160
  2337
wenzelm@45383
  2338
* New "case_product" attribute (see HOL).
noschinl@45160
  2339
wenzelm@45109
  2340
wenzelm@47463
  2341
*** ZF ***
wenzelm@47463
  2342
wenzelm@47463
  2343
* Greater support for structured proofs involving induction or case
wenzelm@47463
  2344
analysis.
wenzelm@47463
  2345
wenzelm@47463
  2346
* Much greater use of mathematical symbols.
wenzelm@47463
  2347
wenzelm@47463
  2348
* Removal of many ML theorem bindings.  INCOMPATIBILITY.
wenzelm@47463
  2349
wenzelm@47463
  2350
wenzelm@45128
  2351
*** ML ***
wenzelm@45128
  2352
wenzelm@46948
  2353
* Antiquotation @{keyword "name"} produces a parser for outer syntax
wenzelm@46948
  2354
from a minor keyword introduced via theory header declaration.
wenzelm@46948
  2355
wenzelm@46961
  2356
* Antiquotation @{command_spec "name"} produces the
wenzelm@46961
  2357
Outer_Syntax.command_spec from a major keyword introduced via theory
wenzelm@46961
  2358
header declaration; it can be passed to Outer_Syntax.command etc.
wenzelm@46961
  2359
wenzelm@46916
  2360
* Local_Theory.define no longer hard-wires default theorem name
wenzelm@46992
  2361
"foo_def", but retains the binding as given.  If that is Binding.empty
wenzelm@46992
  2362
/ Attrib.empty_binding, the result is not registered as user-level
wenzelm@46992
  2363
fact.  The Local_Theory.define_internal variant allows to specify a
wenzelm@46992
  2364
non-empty name (used for the foundation in the background theory),
wenzelm@46992
  2365
while omitting the fact binding in the user-context.  Potential
wenzelm@46992
  2366
INCOMPATIBILITY for derived definitional packages: need to specify
wenzelm@46992
  2367
naming policy for primitive definitions more explicitly.
wenzelm@46916
  2368
wenzelm@46497
  2369
* Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
wenzelm@46497
  2370
conformance with similar operations in structure Term and Logic.
wenzelm@46497
  2371
wenzelm@45592
  2372
* Antiquotation @{attributes [...]} embeds attribute source
wenzelm@45592
  2373
representation into the ML text, which is particularly useful with
wenzelm@45592
  2374
declarations like Local_Theory.note.
wenzelm@45592
  2375
wenzelm@45128
  2376
* Structure Proof_Context follows standard naming scheme.  Old
wenzelm@45128
  2377
ProofContext has been discontinued.  INCOMPATIBILITY.
wenzelm@45128
  2378
wenzelm@45293
  2379
* Refined Local_Theory.declaration {syntax, pervasive}, with subtle
wenzelm@45298
  2380
change of semantics: update is applied to auxiliary local theory
wenzelm@45293
  2381
context as well.
wenzelm@45293
  2382
wenzelm@45620
  2383
* Modernized some old-style infix operations:
wenzelm@45620
  2384
wenzelm@45620
  2385
  addeqcongs    ~> Simplifier.add_eqcong
wenzelm@45620
  2386
  deleqcongs    ~> Simplifier.del_eqcong
wenzelm@45620
  2387
  addcongs      ~> Simplifier.add_cong
wenzelm@45620
  2388
  delcongs      ~> Simplifier.del_cong
wenzelm@45625
  2389
  setmksimps    ~> Simplifier.set_mksimps
wenzelm@45625
  2390
  setmkcong     ~> Simplifier.set_mkcong
wenzelm@45625
  2391
  setmksym      ~> Simplifier.set_mksym
wenzelm@45625
  2392
  setmkeqTrue   ~> Simplifier.set_mkeqTrue
wenzelm@45625
  2393
  settermless   ~> Simplifier.set_termless
wenzelm@45625
  2394
  setsubgoaler  ~> Simplifier.set_subgoaler
wenzelm@45620
  2395
  addsplits     ~> Splitter.add_split
wenzelm@45620
  2396
  delsplits     ~> Splitter.del_split
wenzelm@45620
  2397
wenzelm@45128
  2398
wenzelm@47461
  2399
*** System ***
wenzelm@47461
  2400
wenzelm@47661
  2401
* USER_HOME settings variable points to cross-platform user home
wenzelm@47661
  2402
directory, which coincides with HOME on POSIX systems only.  Likewise,
wenzelm@47661
  2403
the Isabelle path specification "~" now expands to $USER_HOME, instead
wenzelm@47661
  2404
of former $HOME.  A different default for USER_HOME may be set
wenzelm@47661
  2405
explicitly in shell environment, before Isabelle settings are
wenzelm@47661
  2406
evaluated.  Minor INCOMPATIBILITY: need to adapt Isabelle path where
wenzelm@47661
  2407
the generic user home was intended.
wenzelm@47661
  2408
wenzelm@47807
  2409
* ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
wenzelm@47807
  2410
notation, which is useful for the jEdit file browser, for example.
wenzelm@47807
  2411
wenzelm@47464
  2412
* ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
wenzelm@47464
  2413
(not just JRE).
wenzelm@47464
  2414
wenzelm@47461
  2415
wenzelm@45109
  2416
wenzelm@44801
  2417
New in Isabelle2011-1 (October 2011)
wenzelm@44801
  2418
------------------------------------
wenzelm@41651
  2419
wenzelm@41703
  2420
*** General ***
wenzelm@41703
  2421
wenzelm@44760
  2422
* Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
wenzelm@44968
  2423
"isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
wenzelm@44760
  2424
wenzelm@44777
  2425
  - Management of multiple theory files directly from the editor
wenzelm@44760
  2426
    buffer store -- bypassing the file-system (no requirement to save
wenzelm@44760
  2427
    files for checking).
wenzelm@44760
  2428
wenzelm@44777
  2429
  - Markup of formal entities within the text buffer, with semantic
wenzelm@44760
  2430
    highlighting, tooltips and hyperlinks to jump to defining source
wenzelm@44760
  2431
    positions.
wenzelm@44760
  2432
wenzelm@44777
  2433
  - Improved text rendering, with sub/superscripts in the source
wenzelm@44777
  2434
    buffer (including support for copy/paste wrt. output panel, HTML
wenzelm@44777
  2435
    theory output and other non-Isabelle text boxes).
wenzelm@44777
  2436
wenzelm@44777
  2437
  - Refined scheduling of proof checking and printing of results,
wenzelm@44760
  2438
    based on interactive editor view.  (Note: jEdit folding and
wenzelm@44760
  2439
    narrowing allows to restrict buffer perspectives explicitly.)
wenzelm@44760
  2440
wenzelm@44777
  2441
  - Reduced CPU performance requirements, usable on machines with few
wenzelm@44760
  2442
    cores.
wenzelm@44760
  2443
wenzelm@44777
  2444
  - Reduced memory requirements due to pruning of unused document
wenzelm@44760
  2445
    versions (garbage collection).
wenzelm@44760
  2446
wenzelm@44760
  2447
See also ~~/src/Tools/jEdit/README.html for further information,
wenzelm@44760
  2448
including some remaining limitations.
wenzelm@44760
  2449
wenzelm@44800
  2450
* Theory loader: source files are exclusively located via the master
wenzelm@44800
  2451
directory of each theory node (where the .thy file itself resides).
wenzelm@44800
  2452
The global load path (such as src/HOL/Library) has been discontinued.
wenzelm@44800
  2453
Note that the path element ~~ may be used to reference theories in the
wenzelm@44800
  2454
Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
wenzelm@44800
  2455
INCOMPATIBILITY.
wenzelm@44800
  2456
wenzelm@41955
  2457
* Theory loader: source files are identified by content via SHA1
wenzelm@41955
  2458
digests.  Discontinued former path/modtime identification and optional
wenzelm@41955
  2459
ISABELLE_FILE_IDENT plugin scripts.
wenzelm@41955
  2460
wenzelm@41703
  2461
* Parallelization of nested Isar proofs is subject to
wenzelm@41703
  2462
Goal.parallel_proofs_threshold (default 100).  See also isabelle
wenzelm@41703
  2463
usedir option -Q.
wenzelm@41703
  2464
wenzelm@42669
  2465
* Name space: former unsynchronized references are now proper
wenzelm@42669
  2466
configuration options, with more conventional names:
wenzelm@42669
  2467
wenzelm@42669
  2468
  long_names   ~> names_long
wenzelm@42669
  2469
  short_names  ~> names_short
wenzelm@42669
  2470
  unique_names ~> names_unique
wenzelm@42669
  2471
wenzelm@42669
  2472
Minor INCOMPATIBILITY, need to declare options in context like this:
wenzelm@42669
  2473
wenzelm@42669
  2474
  declare [[names_unique = false]]
wenzelm@42358
  2475
wenzelm@42502
  2476
* Literal facts `prop` may contain dummy patterns, e.g. `_ = _`.  Note
wenzelm@42502
  2477
that the result needs to be unique, which means fact specifications
wenzelm@42502
  2478
may have to be refined after enriching a proof context.
wenzelm@42502
  2479
wenzelm@44800
  2480
* Attribute "case_names" has been refined: the assumptions in each case
wenzelm@44800
  2481
can be named now by following the case name with [name1 name2 ...].
wenzelm@44800
  2482
wenzelm@44968
  2483
* Isabelle/Isar reference manual has been updated and extended:
wenzelm@44968
  2484
  - "Synopsis" provides a catalog of main Isar language concepts.
wenzelm@44968
  2485
  - Formal references in syntax diagrams, via @{rail} antiquotation.
wenzelm@44968
  2486
  - Updated material from classic "ref" manual, notably about
wenzelm@44968
  2487
    "Classical Reasoner".
wenzelm@42633
  2488
wenzelm@41703
  2489
blanchet@41727
  2490
*** HOL ***
blanchet@41727
  2491
wenzelm@44968
  2492
* Class bot and top require underlying partial order rather than
wenzelm@44800
  2493
preorder: uniqueness of bot and top is guaranteed.  INCOMPATIBILITY.
haftmann@43815
  2494
haftmann@43940
  2495
* Class complete_lattice: generalized a couple of lemmas from sets;
wenzelm@44800
  2496
generalized theorems INF_cong and SUP_cong.  New type classes for
wenzelm@44800
  2497
complete boolean algebras and complete linear orders.  Lemmas
wenzelm@44800
  2498
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
wenzelm@44800
  2499
class complete_linorder.
wenzelm@44800
  2500
wenzelm@44800
  2501
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
wenzelm@44800
  2502
Sup_fun_def, Inf_apply, Sup_apply.
wenzelm@44800
  2503
wenzelm@45088
  2504
Removed redundant lemmas (the right hand side gives hints how to
wenzelm@45088
  2505
replace them for (metis ...), or (simp only: ...) proofs):
hoelzl@45041
  2506
hoelzl@45041
  2507
  Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
hoelzl@45041
  2508
  Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
hoelzl@45041
  2509
  Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
hoelzl@45041
  2510
  Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
hoelzl@45041
  2511
  Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
hoelzl@45041
  2512
  Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
hoelzl@45041
  2513
  Inter_def ~> INF_def, image_def
hoelzl@45041
  2514
  Union_def ~> SUP_def, image_def
hoelzl@45041
  2515
  INT_eq ~> INF_def, and image_def
hoelzl@45041
  2516
  UN_eq ~> SUP_def, and image_def
hoelzl@45041
  2517
  INF_subset ~> INF_superset_mono [OF _ order_refl]
wenzelm@44800
  2518
wenzelm@44800
  2519
More consistent and comprehensive names:
wenzelm@44800
  2520
hoelzl@45041
  2521
  INTER_eq_Inter_image ~> INF_def
hoelzl@45041
  2522
  UNION_eq_Union_image ~> SUP_def
haftmann@43872
  2523
  INFI_def ~> INF_def
haftmann@43872
  2524
  SUPR_def ~> SUP_def
haftmann@44103
  2525
  INF_leI ~> INF_lower
haftmann@44103
  2526
  INF_leI2 ~> INF_lower2
haftmann@44103
  2527
  le_INFI ~> INF_greatest
haftmann@44103
  2528
  le_SUPI ~> SUP_upper
haftmann@44103
  2529
  le_SUPI2 ~> SUP_upper2
haftmann@44103
  2530
  SUP_leI ~> SUP_least
haftmann@43873
  2531
  INFI_bool_eq ~> INF_bool_eq
haftmann@43873
  2532
  SUPR_bool_eq ~> SUP_bool_eq
haftmann@43873
  2533
  INFI_apply ~> INF_apply
haftmann@43873
  2534
  SUPR_apply ~> SUP_apply
haftmann@44103
  2535
  INTER_def ~> INTER_eq
haftmann@44103
  2536
  UNION_def ~> UNION_eq
haftmann@44103
  2537
haftmann@43865
  2538
INCOMPATIBILITY.
haftmann@43865
  2539
wenzelm@44973
  2540
* Renamed theory Complete_Lattice to Complete_Lattices.
wenzelm@44973
  2541
INCOMPATIBILITY.
wenzelm@44973
  2542
wenzelm@44973
  2543
* Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
wenzelm@44973
  2544
INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
wenzelm@44973
  2545
Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
wenzelm@44973
  2546
Sup_insert are now declared as [simp].  INCOMPATIBILITY.
wenzelm@44973
  2547
wenzelm@44973
  2548
* Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
wenzelm@44973
  2549
compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
wenzelm@44973
  2550
sup_inf_absob, sup_left_idem are now declared as [simp].  Minor
wenzelm@44973
  2551
INCOMPATIBILITY.
wenzelm@44973
  2552
krauss@44845
  2553
* Added syntactic classes "inf" and "sup" for the respective
krauss@44845
  2554
constants.  INCOMPATIBILITY: Changes in the argument order of the
krauss@44845
  2555
(mostly internal) locale predicates for some derived classes.
krauss@44845
  2556
wenzelm@44800
  2557
* Theorem collections ball_simps and bex_simps do not contain theorems
wenzelm@44800
  2558
referring to UNION any longer; these have been moved to collection
wenzelm@44800
  2559
UN_ball_bex_simps.  INCOMPATIBILITY.
wenzelm@44800
  2560
wenzelm@44800
  2561
* Theory Archimedean_Field: floor now is defined as parameter of a
wenzelm@44800
  2562
separate type class floor_ceiling.
wenzelm@44800
  2563
wenzelm@44800
  2564
* Theory Finite_Set: more coherent development of fold_set locales:
haftmann@42874
  2565
haftmann@42874
  2566
    locale fun_left_comm ~> locale comp_fun_commute
haftmann@42874
  2567
    locale fun_left_comm_idem ~> locale comp_fun_idem
wenzelm@44800
  2568
wenzelm@44800
  2569
Both use point-free characterization; interpretation proofs may need
wenzelm@44800
  2570
adjustment.  INCOMPATIBILITY.
haftmann@42874
  2571
wenzelm@44800
  2572
* Theory Limits: Type "'a net" has been renamed to "'a filter", in
huffman@44081
  2573
accordance with standard mathematical terminology. INCOMPATIBILITY.
huffman@44081
  2574
wenzelm@44800
  2575
* Theory Complex_Main: The locale interpretations for the
wenzelm@44800
  2576
bounded_linear and bounded_bilinear locales have been removed, in
wenzelm@44800
  2577
order to reduce the number of duplicate lemmas. Users must use the
wenzelm@44800
  2578
original names for distributivity theorems, potential INCOMPATIBILITY.
huffman@44282
  2579
huffman@44282
  2580
  divide.add ~> add_divide_distrib
huffman@44282
  2581
  divide.diff ~> diff_divide_distrib
huffman@44282
  2582
  divide.setsum ~> setsum_divide_distrib
huffman@44282
  2583
  mult.add_right ~> right_distrib
huffman@44282
  2584
  mult.diff_right ~> right_diff_distrib
huffman@44282
  2585
  mult_right.setsum ~> setsum_right_distrib
huffman@44282
  2586
  mult_left.diff ~> left_diff_distrib
huffman@44282
  2587
wenzelm@44800
  2588
* Theory Complex_Main: Several redundant theorems have been removed or
huffman@44568
  2589
replaced by more general versions. INCOMPATIBILITY.
huffman@44522
  2590
huffman@45051
  2591
  real_diff_def ~> minus_real_def
huffman@45051
  2592
  real_divide_def ~> divide_real_def
huffman@45051
  2593
  real_less_def ~> less_le
huffman@45051
  2594
  real_abs_def ~> abs_real_def
huffman@45051
  2595
  real_sgn_def ~> sgn_real_def
huffman@45051
  2596
  real_mult_commute ~> mult_commute
huffman@45051
  2597
  real_mult_assoc ~> mult_assoc
huffman@45051
  2598
  real_mult_1 ~> mult_1_left
huffman@45051
  2599
  real_add_mult_distrib ~> left_distrib
huffman@45051
  2600
  real_zero_not_eq_one ~> zero_neq_one
huffman@45051
  2601
  real_mult_inverse_left ~> left_inverse
huffman@45051
  2602
  INVERSE_ZERO ~> inverse_zero
huffman@45051
  2603
  real_le_refl ~> order_refl
huffman@45051
  2604
  real_le_antisym ~> order_antisym
huffman@45051
  2605
  real_le_trans ~> order_trans
huffman@45051
  2606
  real_le_linear ~> linear
huffman@45051
  2607
  real_le_eq_diff ~> le_iff_diff_le_0
huffman@45051
  2608
  real_add_left_mono ~> add_left_mono
huffman@45051
  2609
  real_mult_order ~> mult_pos_pos
huffman@45051
  2610
  real_mult_less_mono2 ~> mult_strict_left_mono
huffman@44822
  2611
  real_of_int_real_of_nat ~> real_of_int_of_nat_eq
huffman@44522
  2612
  real_0_le_divide_iff ~> zero_le_divide_iff
huffman@44522
  2613
  realpow_two_disj ~> power2_eq_iff
huffman@44522
  2614
  real_squared_diff_one_factored ~> square_diff_one_factored
huffman@44522
  2615
  realpow_two_diff ~> square_diff_square_factored
huffman@44669
  2616
  reals_complete2 ~> complete_real
huffman@44749
  2617
  real_sum_squared_expand ~> power2_sum
huffman@44522
  2618
  exp_ln_eq ~> ln_unique
huffman@44711
  2619
  expi_add ~> exp_add
huffman@44711
  2620
  expi_zero ~> exp_zero
huffman@44522
  2621
  lemma_DERIV_subst ~> DERIV_cong
huffman@44568
  2622
  LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
huffman@44568
  2623
  LIMSEQ_const ~> tendsto_const
huffman@44568
  2624
  LIMSEQ_norm ~> tendsto_norm
huffman@44568
  2625
  LIMSEQ_add ~> tendsto_add
huffman@44568
  2626
  LIMSEQ_minus ~> tendsto_minus
huffman@44568
  2627
  LIMSEQ_minus_cancel ~> tendsto_minus_cancel
huffman@44568
  2628
  LIMSEQ_diff ~> tendsto_diff
huffman@44568
  2629
  bounded_linear.LIMSEQ ~> bounded_linear.tendsto
huffman@44568
  2630
  bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
huffman@44568
  2631
  LIMSEQ_mult ~> tendsto_mult
huffman@44568
  2632
  LIMSEQ_inverse ~> tendsto_inverse
huffman@44568
  2633
  LIMSEQ_divide ~> tendsto_divide
huffman@44568
  2634
  LIMSEQ_pow ~> tendsto_power
huffman@44568
  2635
  LIMSEQ_setsum ~> tendsto_setsum
huffman@44568
  2636
  LIMSEQ_setprod ~> tendsto_setprod
huffman@44568
  2637
  LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
huffman@44568
  2638
  LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
huffman@44568
  2639
  LIMSEQ_imp_rabs ~> tendsto_rabs
huffman@44710
  2640
  LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
huffman@44710
  2641
  LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
huffman@44710
  2642
  LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
huffman@44748
  2643
  LIMSEQ_Complex ~> tendsto_Complex
huffman@44568
  2644
  LIM_ident ~> tendsto_ident_at
huffman@44568
  2645
  LIM_const ~> tendsto_const
huffman@44568
  2646
  LIM_add ~> tendsto_add
huffman@44568
  2647
  LIM_add_zero ~> tendsto_add_zero
huffman@44568
  2648
  LIM_minus ~> tendsto_minus
huffman@44568
  2649
  LIM_diff ~> tendsto_diff
huffman@44568
  2650
  LIM_norm ~> tendsto_norm
huffman@44568
  2651
  LIM_norm_zero ~> tendsto_norm_zero
huffman@44568
  2652
  LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
huffman@44568
  2653
  LIM_norm_zero_iff ~> tendsto_norm_zero_iff
huffman@44568
  2654
  LIM_rabs ~> tendsto_rabs
huffman@44568
  2655
  LIM_rabs_zero ~> tendsto_rabs_zero
huffman@44568
  2656
  LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
huffman@44568
  2657
  LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
huffman@44568
  2658
  LIM_compose ~> tendsto_compose
huffman@44568
  2659
  LIM_mult ~> tendsto_mult
huffman@44568
  2660
  LIM_scaleR ~> tendsto_scaleR
huffman@44568
  2661
  LIM_of_real ~> tendsto_of_real
huffman@44568
  2662
  LIM_power ~> tendsto_power
huffman@44568
  2663
  LIM_inverse ~> tendsto_inverse
huffman@44568
  2664
  LIM_sgn ~> tendsto_sgn
huffman@44568
  2665
  isCont_LIM_compose ~> isCont_tendsto_compose
huffman@44568
  2666
  bounded_linear.LIM ~> bounded_linear.tendsto
huffman@44568
  2667
  bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
huffman@44568
  2668
  bounded_bilinear.LIM ~> bounded_bilinear.tendsto
huffman@44568
  2669
  bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
huffman@44568
  2670
  bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
huffman@44568
  2671
  bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
huffman@44568
  2672
  LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
huffman@44522
  2673
wenzelm@44967
  2674
* Theory Complex_Main: The definition of infinite series was
wenzelm@44967
  2675
generalized.  Now it is defined on the type class {topological_space,
wenzelm@44967
  2676
comm_monoid_add}.  Hence it is useable also for extended real numbers.
wenzelm@42484
  2677
huffman@44908
  2678
* Theory Complex_Main: The complex exponential function "expi" is now
huffman@44908
  2679
a type-constrained abbreviation for "exp :: complex => complex"; thus
huffman@44908
  2680
several polymorphic lemmas about "exp" are now applicable to "expi".
huffman@44908
  2681
wenzelm@44968
  2682
* Code generation:
wenzelm@44968
  2683
wenzelm@44968
  2684
  - Theory Library/Code_Char_ord provides native ordering of
wenzelm@44968
  2685
    characters in the target language.
wenzelm@44968
  2686
wenzelm@44968
  2687
  - Commands code_module and code_library are legacy, use export_code
wenzelm@44968
  2688
    instead.
wenzelm@44968
  2689
wenzelm@44968
  2690
  - Method "evaluation" is legacy, use method "eval" instead.
wenzelm@44968
  2691
wenzelm@44968
  2692
  - Legacy evaluator "SML" is deactivated by default.  May be
wenzelm@44968
  2693
    reactivated by the following theory command:
wenzelm@44968
  2694
wenzelm@44968
  2695
      setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
wenzelm@44968
  2696
wenzelm@44968
  2697
* Declare ext [intro] by default.  Rare INCOMPATIBILITY.
wenzelm@44968
  2698
wenzelm@45088
  2699
* New proof method "induction" that gives induction hypotheses the
wenzelm@45088
  2700
name "IH", thus distinguishing them from further hypotheses that come
wenzelm@45088
  2701
from rule induction.  The latter are still called "hyps".  Method
wenzelm@45088
  2702
"induction" is a thin wrapper around "induct" and follows the same
wenzelm@45088
  2703
syntax.
wenzelm@45088
  2704
wenzelm@44968
  2705
* Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
wenzelm@44968
  2706
still available as a legacy feature for some time.
wenzelm@44968
  2707
wenzelm@44968
  2708
* Nitpick:
wenzelm@44968
  2709
  - Added "need" and "total_consts" options.
wenzelm@44968
  2710
  - Reintroduced "show_skolems" option by popular demand.
wenzelm@44968
  2711
  - Renamed attribute: nitpick_def ~> nitpick_unfold.
wenzelm@44968
  2712
    INCOMPATIBILITY.
wenzelm@44968
  2713
wenzelm@44968
  2714
* Sledgehammer:
wenzelm@44968
  2715
  - Use quasi-sound (and efficient) translations by default.
wenzelm@44968
  2716
  - Added support for the following provers: E-ToFoF, LEO-II,
wenzelm@44968
  2717
    Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
wenzelm@44968
  2718
  - Automatically preplay and minimize proofs before showing them if
wenzelm@44968
  2719
    this can be done within reasonable time.
wenzelm@44968
  2720
  - sledgehammer available_provers ~> sledgehammer supported_provers.
wenzelm@44968
  2721
    INCOMPATIBILITY.
wenzelm@44968
  2722
  - Added "preplay_timeout", "slicing", "type_enc", "sound",
wenzelm@44968
  2723
    "max_mono_iters", and "max_new_mono_instances" options.
wenzelm@44968
  2724
  - Removed "explicit_apply" and "full_types" options as well as "Full
wenzelm@44968
  2725
    Types" Proof General menu item. INCOMPATIBILITY.
wenzelm@44968
  2726
wenzelm@44968
  2727
* Metis:
wenzelm@44968
  2728
  - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
wenzelm@44968
  2729
  - Obsoleted "metisFT" -- use "metis (full_types)" instead.
wenzelm@44968
  2730
    INCOMPATIBILITY.
wenzelm@44968
  2731