NEWS
author huffman
Sat Apr 21 13:54:29 2012 +0200 (2012-04-21)
changeset 47655 b9e132e54d25
parent 47622 6d53f2ef4a97
child 47659 e3c4d1b0b351
permissions -rw-r--r--
NEWS for transfer, lifting, and quotient
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@47462
     4
New in Isabelle2012 (May 2012)
wenzelm@47462
     5
------------------------------
wenzelm@45109
     6
wenzelm@45593
     7
*** General ***
wenzelm@45593
     8
wenzelm@45614
     9
* Prover IDE (PIDE) improvements:
wenzelm@45614
    10
wenzelm@47585
    11
  - more robust Sledgehammer integration (as before the sledgehammer
wenzelm@47585
    12
    command line needs to be typed into the source buffer)
wenzelm@45614
    13
  - markup for bound variables
wenzelm@45614
    14
  - markup for types of term variables (e.g. displayed as tooltips)
wenzelm@46956
    15
  - support for user-defined Isar commands within the running session
wenzelm@47158
    16
  - improved support for Unicode outside original 16bit range
wenzelm@47158
    17
    e.g. glyph for \<A> (thanks to jEdit 4.5.1)
wenzelm@45614
    18
wenzelm@46485
    19
* Updated and extended reference manuals ("isar-ref" and
wenzelm@46485
    20
"implementation"); reduced remaining material in old "ref" manual.
wenzelm@46485
    21
wenzelm@45593
    22
* Rule attributes in local theory declarations (e.g. locale or class)
wenzelm@45593
    23
are now statically evaluated: the resulting theorem is stored instead
wenzelm@45593
    24
of the original expression.  INCOMPATIBILITY in rare situations, where
wenzelm@45593
    25
the historic accident of dynamic re-evaluation in interpretations
wenzelm@45593
    26
etc. was exploited.
wenzelm@45593
    27
wenzelm@45600
    28
* Commands 'lemmas' and 'theorems' allow local variables using 'for'
wenzelm@45600
    29
declaration, and results are standardized before being stored.  Thus
wenzelm@45600
    30
old-style "standard" after instantiation or composition of facts
wenzelm@45600
    31
becomes obsolete.  Minor INCOMPATIBILITY, due to potential change of
wenzelm@45600
    32
indices of schematic variables.
wenzelm@45600
    33
wenzelm@46483
    34
* Renamed some inner syntax categories:
wenzelm@46483
    35
wenzelm@46483
    36
    num ~> num_token
wenzelm@46483
    37
    xnum ~> xnum_token
wenzelm@46483
    38
    xstr ~> str_token
wenzelm@46483
    39
wenzelm@46483
    40
Minor INCOMPATIBILITY.  Note that in practice "num_const" or
wenzelm@46483
    41
"num_position" etc. are mainly used instead (which also include
wenzelm@46483
    42
position information via constraints).
wenzelm@45703
    43
wenzelm@46506
    44
* Simplified configuration options for syntax ambiguity: see
wenzelm@46512
    45
"syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
wenzelm@46512
    46
manual.  Minor INCOMPATIBILITY.
wenzelm@46506
    47
wenzelm@46959
    48
* Forward declaration of outer syntax keywords within the theory
wenzelm@46959
    49
header -- minor INCOMPATIBILITY for user-defined commands.  Allow new
wenzelm@46959
    50
commands to be used in the same theory where defined.
wenzelm@46959
    51
wenzelm@45593
    52
wenzelm@45134
    53
*** Pure ***
wenzelm@45134
    54
wenzelm@47482
    55
* Auxiliary contexts indicate block structure for specifications with
wenzelm@47482
    56
additional parameters and assumptions.  Such unnamed contexts may be
wenzelm@47482
    57
nested within other targets, like 'theory', 'locale', 'class',
wenzelm@47482
    58
'instantiation' etc.  Results from the local context are generalized
wenzelm@47482
    59
accordingly and applied to the enclosing target context.  Example:
wenzelm@47482
    60
wenzelm@47482
    61
  context
wenzelm@47482
    62
    fixes x y z :: 'a
wenzelm@47482
    63
    assumes xy: "x = y" and yz: "y = z"
wenzelm@47482
    64
  begin
wenzelm@47482
    65
wenzelm@47482
    66
  lemma my_trans: "x = z" using xy yz by simp
wenzelm@47482
    67
wenzelm@47482
    68
  end
wenzelm@47482
    69
wenzelm@47482
    70
  thm my_trans
wenzelm@47482
    71
wenzelm@47482
    72
The most basic application is to factor-out context elements of
wenzelm@47482
    73
several fixes/assumes/shows theorem statements, e.g. see
wenzelm@47482
    74
~~/src/HOL/Isar_Examples/Group_Context.thy
wenzelm@47482
    75
wenzelm@47482
    76
Any other local theory specification element works within the "context
wenzelm@47482
    77
... begin ... end" block as well.
wenzelm@47482
    78
wenzelm@47484
    79
* Bundled declarations associate attributed fact expressions with a
wenzelm@47484
    80
given name in the context.  These may be later included in other
wenzelm@47484
    81
contexts.  This allows to manage context extensions casually, without
wenzelm@47484
    82
the logical dependencies of locales and locale interpretation.
wenzelm@47484
    83
wenzelm@47484
    84
See commands 'bundle', 'include', 'including' etc. in the isar-ref
wenzelm@47484
    85
manual.
wenzelm@47484
    86
wenzelm@47427
    87
* Rule composition via attribute "OF" (or ML functions OF/MRS) is more
wenzelm@47427
    88
tolerant against multiple unifiers, as long as the final result is
wenzelm@47427
    89
unique.  (As before, rules are composed in canonical right-to-left
wenzelm@47427
    90
order to accommodate newly introduced premises.)
wenzelm@47427
    91
wenzelm@46976
    92
* Command 'definition' no longer exports the foundational "raw_def"
wenzelm@46976
    93
into the user context.  Minor INCOMPATIBILITY, may use the regular
wenzelm@46976
    94
"def" result with attribute "abs_def" to imitate the old version.
wenzelm@46976
    95
wenzelm@46903
    96
* Attribute "abs_def" turns an equation of the form "f x y == t" into
wenzelm@46903
    97
"f == %x y. t", which ensures that "simp" or "unfold" steps always
wenzelm@46903
    98
expand it.  This also works for object-logic equality.  (Formerly
wenzelm@46903
    99
undocumented feature.)
wenzelm@46903
   100
wenzelm@46493
   101
* Discontinued old "prems" fact, which used to refer to the accidental
wenzelm@47464
   102
collection of foundational premises in the context (already marked as
wenzelm@47464
   103
legacy since Isabelle2011).
wenzelm@46493
   104
wenzelm@45134
   105
* Obsolete command 'types' has been discontinued.  Use 'type_synonym'
wenzelm@45134
   106
instead.  INCOMPATIBILITY.
wenzelm@45134
   107
wenzelm@47464
   108
* Old code generator for SML and its commands 'code_module',
wenzelm@45383
   109
'code_library', 'consts_code', 'types_code' have been discontinued.
haftmann@46028
   110
Use commands of the generic code generator instead.  INCOMPATIBILITY.
wenzelm@45383
   111
wenzelm@47464
   112
* Redundant attribute "code_inline" has been discontinued. Use
wenzelm@47464
   113
"code_unfold" instead.  INCOMPATIBILITY.
wenzelm@47464
   114
wenzelm@47464
   115
* Dropped attribute "code_unfold_post" in favor of the its dual
wenzelm@47464
   116
"code_abbrev", which yields a common pattern in definitions like
haftmann@46028
   117
haftmann@46028
   118
  definition [code_abbrev]: "f = t"
haftmann@46028
   119
haftmann@46028
   120
INCOMPATIBILITY.
wenzelm@45383
   121
wenzelm@45427
   122
* Sort constraints are now propagated in simultaneous statements, just
wenzelm@45427
   123
like type constraints.  INCOMPATIBILITY in rare situations, where
wenzelm@45427
   124
distinct sorts used to be assigned accidentally.  For example:
wenzelm@45427
   125
wenzelm@45427
   126
  lemma "P (x::'a::foo)" and "Q (y::'a::bar)"  -- "now illegal"
wenzelm@45427
   127
wenzelm@45427
   128
  lemma "P (x::'a)" and "Q (y::'a::bar)"
wenzelm@47462
   129
    -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
wenzelm@45427
   130
wenzelm@45427
   131
huffman@45122
   132
*** HOL ***
huffman@45122
   133
nipkow@47495
   134
* New tutorial "Programming and Proving in Isabelle/HOL" ("prog-prove").
nipkow@47494
   135
It completely supercedes "A Tutorial Introduction to Structured Isar Proofs",
nipkow@47494
   136
which has been removed. It supercedes "Isabelle/HOL, A Proof Assistant
nipkow@47494
   137
for Higher-Order Logic" as the recommended beginners tutorial
nipkow@47494
   138
but does not cover all of the material of that old tutorial.
wenzelm@47464
   139
wenzelm@47464
   140
* Discontinued old Tutorial on Isar ("isar-overview");
wenzelm@47464
   141
wenzelm@47464
   142
* Type 'a set is now a proper type constructor (just as before
wenzelm@47464
   143
Isabelle2008).  Definitions mem_def and Collect_def have disappeared.
wenzelm@47464
   144
Non-trivial INCOMPATIBILITY.  For developments keeping predicates and
wenzelm@47464
   145
sets separate, it is often sufficient to rephrase sets S accidentally
wenzelm@47464
   146
used as predicates by "%x. x : S" and predicates P accidentally used
wenzelm@47464
   147
as sets by "{x. P x}".  Corresponding proofs in a first step should be
wenzelm@47464
   148
pruned from any tinkering with former theorems mem_def and Collect_def
wenzelm@47464
   149
as far as possible.
wenzelm@47464
   150
wenzelm@47464
   151
For developments which deliberately mixed predicates and sets, a
wenzelm@47464
   152
planning step is necessary to determine what should become a predicate
wenzelm@47464
   153
and what a set.  It can be helpful to carry out that step in
wenzelm@47464
   154
Isabelle2011-1 before jumping right into the current release.
wenzelm@47464
   155
wenzelm@47464
   156
* The representation of numerals has changed.  Datatype "num"
wenzelm@47464
   157
represents strictly positive binary numerals, along with functions
wenzelm@47464
   158
"numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
wenzelm@47464
   159
positive and negated numeric literals, respectively. (See definitions
wenzelm@47464
   160
in ~~/src/HOL/Num.thy.) Potential INCOMPATIBILITY, some user theories
wenzelm@47464
   161
may require adaptations as follows:
huffman@47108
   162
huffman@47108
   163
  - Theorems with number_ring or number_semiring constraints: These
huffman@47108
   164
    classes are gone; use comm_ring_1 or comm_semiring_1 instead.
huffman@47108
   165
huffman@47108
   166
  - Theories defining numeric types: Remove number, number_semiring,
huffman@47108
   167
    and number_ring instances. Defer all theorems about numerals until
huffman@47108
   168
    after classes one and semigroup_add have been instantiated.
huffman@47108
   169
huffman@47108
   170
  - Numeral-only simp rules: Replace each rule having a "number_of v"
huffman@47108
   171
    pattern with two copies, one for numeral and one for neg_numeral.
huffman@47108
   172
huffman@47108
   173
  - Theorems about subclasses of semiring_1 or ring_1: These classes
huffman@47108
   174
    automatically support numerals now, so more simp rules and
huffman@47108
   175
    simprocs may now apply within the proof.
huffman@47108
   176
huffman@47108
   177
  - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
huffman@47108
   178
    Redefine using other integer operations.
huffman@47108
   179
haftmann@46834
   180
* Code generation by default implements sets as container type rather
haftmann@46834
   181
than predicates.  INCOMPATIBILITY.
haftmann@46834
   182
krauss@47265
   183
* New proof import from HOL Light: Faster, simpler, and more scalable.
krauss@47265
   184
Requires a proof bundle, which is available as an external component.
wenzelm@47464
   185
Discontinued old (and mostly dead) Importer for HOL4 and HOL Light.
krauss@47265
   186
INCOMPATIBILITY.
krauss@47264
   187
nipkow@46373
   188
* New type synonym 'a rel = ('a * 'a) set
nipkow@46373
   189
haftmann@46752
   190
* More default pred/set conversions on a couple of relation operations
wenzelm@47464
   191
and predicates.  Added powers of predicate relations.  Consolidation
wenzelm@47464
   192
of some relation theorems:
haftmann@46752
   193
haftmann@46752
   194
  converse_def ~> converse_unfold
haftmann@47549
   195
  rel_comp_def ~> relcomp_unfold
haftmann@46752
   196
  symp_def ~> (dropped, use symp_def and sym_def instead)
haftmann@46752
   197
  transp_def ~> transp_trans
haftmann@46752
   198
  Domain_def ~> Domain_unfold
haftmann@46752
   199
  Range_def ~> Domain_converse [symmetric]
haftmann@46752
   200
haftmann@46981
   201
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
haftmann@46981
   202
wenzelm@47464
   203
See theory "Relation" for examples for making use of pred/set
wenzelm@47464
   204
conversions by means of attributes "to_set" and "to_pred".
haftmann@47086
   205
haftmann@46752
   206
INCOMPATIBILITY.
haftmann@46752
   207
bulwahn@46363
   208
* Renamed facts about the power operation on relations, i.e., relpow
wenzelm@47464
   209
to match the constant's name:
wenzelm@47463
   210
wenzelm@46458
   211
  rel_pow_1 ~> relpow_1
bulwahn@46363
   212
  rel_pow_0_I ~> relpow_0_I
bulwahn@46363
   213
  rel_pow_Suc_I ~> relpow_Suc_I
bulwahn@46363
   214
  rel_pow_Suc_I2 ~> relpow_Suc_I2
bulwahn@46363
   215
  rel_pow_0_E ~> relpow_0_E
bulwahn@46363
   216
  rel_pow_Suc_E ~> relpow_Suc_E
bulwahn@46363
   217
  rel_pow_E ~> relpow_E
wenzelm@46458
   218
  rel_pow_Suc_D2 ~> relpow_Suc_D2
wenzelm@47463
   219
  rel_pow_Suc_E2 ~> relpow_Suc_E2
bulwahn@46363
   220
  rel_pow_Suc_D2' ~> relpow_Suc_D2'
bulwahn@46363
   221
  rel_pow_E2 ~> relpow_E2
bulwahn@46363
   222
  rel_pow_add ~> relpow_add
bulwahn@46363
   223
  rel_pow_commute ~> relpow
bulwahn@46363
   224
  rel_pow_empty ~> relpow_empty:
bulwahn@46363
   225
  rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
bulwahn@46363
   226
  rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
bulwahn@46363
   227
  rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
bulwahn@46363
   228
  rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
bulwahn@46363
   229
  rel_pow_fun_conv ~> relpow_fun_conv
bulwahn@46363
   230
  rel_pow_finite_bounded1 ~> relpow_finite_bounded1
bulwahn@46363
   231
  rel_pow_finite_bounded ~> relpow_finite_bounded
bulwahn@46363
   232
  rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
bulwahn@46363
   233
  trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
bulwahn@46363
   234
  single_valued_rel_pow ~> single_valued_relpow
wenzelm@47463
   235
bulwahn@46363
   236
INCOMPATIBILITY.
bulwahn@46363
   237
bulwahn@47448
   238
* Theory Relation: Consolidated constant name for relation composition
wenzelm@47464
   239
and corresponding theorem names:
wenzelm@47464
   240
haftmann@47549
   241
  - Renamed constant rel_comp to relcomp.
wenzelm@47464
   242
bulwahn@47448
   243
  - Dropped abbreviation pred_comp. Use relcompp instead.
wenzelm@47464
   244
bulwahn@47448
   245
  - Renamed theorems:
wenzelm@47464
   246
bulwahn@47448
   247
    rel_compI ~> relcompI
bulwahn@47448
   248
    rel_compEpair ~> relcompEpair
bulwahn@47448
   249
    rel_compE ~> relcompE
bulwahn@47448
   250
    pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
bulwahn@47448
   251
    rel_comp_empty1 ~> relcomp_empty1
bulwahn@47448
   252
    rel_comp_mono ~> relcomp_mono
bulwahn@47448
   253
    rel_comp_subset_Sigma ~> relcomp_subset_Sigma
bulwahn@47448
   254
    rel_comp_distrib ~> relcomp_distrib
bulwahn@47448
   255
    rel_comp_distrib2 ~> relcomp_distrib2
bulwahn@47448
   256
    rel_comp_UNION_distrib ~> relcomp_UNION_distrib
bulwahn@47448
   257
    rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
bulwahn@47448
   258
    single_valued_rel_comp ~> single_valued_relcomp
haftmann@47549
   259
    rel_comp_def ~> relcomp_unfold
bulwahn@47448
   260
    converse_rel_comp ~> converse_relcomp
bulwahn@47448
   261
    pred_compI ~> relcomppI
bulwahn@47448
   262
    pred_compE ~> relcomppE
bulwahn@47448
   263
    pred_comp_bot1 ~> relcompp_bot1
bulwahn@47448
   264
    pred_comp_bot2 ~> relcompp_bot2
bulwahn@47448
   265
    transp_pred_comp_less_eq ~> transp_relcompp_less_eq
bulwahn@47448
   266
    pred_comp_mono ~> relcompp_mono
bulwahn@47448
   267
    pred_comp_distrib ~> relcompp_distrib
bulwahn@47448
   268
    pred_comp_distrib2 ~> relcompp_distrib2
bulwahn@47448
   269
    converse_pred_comp ~> converse_relcompp
wenzelm@47464
   270
bulwahn@47448
   271
    finite_rel_comp ~> finite_relcomp
wenzelm@47464
   272
bulwahn@47448
   273
    set_rel_comp ~> set_relcomp
bulwahn@47448
   274
bulwahn@47448
   275
INCOMPATIBILITY.
bulwahn@47448
   276
haftmann@47550
   277
* Theory Divides: Discontinued redundant theorems about div and mod.
haftmann@47550
   278
INCOMPATIBILITY, use the corresponding generic theorems instead.
haftmann@47550
   279
haftmann@47550
   280
  DIVISION_BY_ZERO ~> div_by_0, mod_by_0
haftmann@47550
   281
  zdiv_self ~> div_self
haftmann@47550
   282
  zmod_self ~> mod_self
haftmann@47550
   283
  zdiv_zero ~> div_0
haftmann@47550
   284
  zmod_zero ~> mod_0
haftmann@47550
   285
  zdiv_zmod_equality ~> div_mod_equality2
haftmann@47550
   286
  zdiv_zmod_equality2 ~> div_mod_equality
haftmann@47550
   287
  zmod_zdiv_trivial ~> mod_div_trivial
haftmann@47550
   288
  zdiv_zminus_zminus ~> div_minus_minus
haftmann@47550
   289
  zmod_zminus_zminus ~> mod_minus_minus
haftmann@47550
   290
  zdiv_zminus2 ~> div_minus_right
haftmann@47550
   291
  zmod_zminus2 ~> mod_minus_right
haftmann@47550
   292
  zdiv_minus1_right ~> div_minus1_right
haftmann@47550
   293
  zmod_minus1_right ~> mod_minus1_right
haftmann@47550
   294
  zdvd_mult_div_cancel ~> dvd_mult_div_cancel
haftmann@47550
   295
  zmod_zmult1_eq ~> mod_mult_right_eq
haftmann@47550
   296
  zpower_zmod ~> power_mod
haftmann@47550
   297
  zdvd_zmod ~> dvd_mod
haftmann@47550
   298
  zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
haftmann@47550
   299
  mod_mult_distrib ~> mult_mod_left
haftmann@47550
   300
  mod_mult_distrib2 ~> mult_mod_right
haftmann@47550
   301
haftmann@47550
   302
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
haftmann@47550
   303
generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
haftmann@47550
   304
haftmann@47551
   305
* Finite_Set.fold now qualified.  INCOMPATIBILITY.
haftmann@47551
   306
haftmann@47552
   307
* Consolidated theorem names concerning fold combinators:
haftmann@47550
   308
haftmann@47550
   309
  inf_INFI_fold_inf ~> inf_INF_fold_inf
haftmann@47550
   310
  sup_SUPR_fold_sup ~> sup_SUP_fold_sup
haftmann@47550
   311
  INFI_fold_inf ~> INF_fold_inf
haftmann@47550
   312
  SUPR_fold_sup ~> SUP_fold_sup
haftmann@47550
   313
  union_set ~> union_set_fold
haftmann@47550
   314
  minus_set ~> minus_set_fold
haftmann@47550
   315
  INFI_set_fold ~> INF_set_fold
haftmann@47550
   316
  SUPR_set_fold ~> SUP_set_fold
haftmann@47550
   317
  INF_code ~> INF_set_foldr
haftmann@47550
   318
  SUP_code ~> SUP_set_foldr
haftmann@47550
   319
  foldr.simps ~> foldr.simps (in point-free formulation)
haftmann@47550
   320
  foldr_fold_rev ~> foldr_conv_fold
haftmann@47550
   321
  foldl_fold ~> foldl_conv_fold
haftmann@47550
   322
  foldr_foldr ~> foldr_conv_foldl
haftmann@47550
   323
  foldl_foldr ~> foldl_conv_foldr
haftmann@47552
   324
  fold_set_remdups ~> fold_set_fold_remdups
haftmann@47552
   325
  fold_set ~> fold_set_fold
haftmann@47552
   326
  fold1_set ~> fold1_set_fold
haftmann@47550
   327
haftmann@47550
   328
INCOMPATIBILITY.
haftmann@47550
   329
haftmann@47550
   330
* Dropped rarely useful theorems concerning fold combinators:
haftmann@47550
   331
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
haftmann@47550
   332
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
haftmann@47550
   333
concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
haftmann@47550
   334
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
haftmann@47550
   335
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
haftmann@47550
   336
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
haftmann@47550
   337
INCOMPATIBILITY.  For the common phrases "%xs. List.foldr plus xs 0"
haftmann@47550
   338
and "List.foldl plus 0", prefer "List.listsum".  Otherwise it can be
haftmann@47550
   339
useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
haftmann@47550
   340
unfolding "foldr_conv_fold" and "foldl_conv_fold".
haftmann@47550
   341
haftmann@47550
   342
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
haftmann@47550
   343
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
haftmann@47550
   344
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
haftmann@47550
   345
INF_set_foldr, SUP_set_foldr.  INCOMPATIBILITY.  Prefer corresponding
haftmann@47550
   346
lemmas over fold rather than foldr, or make use of lemmas
haftmann@47550
   347
fold_conv_foldr and fold_rev.
haftmann@47550
   348
haftmann@47550
   349
* Congruence rules Option.map_cong and Option.bind_cong for recursion
haftmann@47550
   350
through option types.
haftmann@47550
   351
haftmann@47550
   352
* Concrete syntax for case expressions includes constraints for source
haftmann@47550
   353
positions, and thus produces Prover IDE markup for its bindings.
haftmann@47550
   354
INCOMPATIBILITY for old-style syntax translations that augment the
haftmann@47550
   355
pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
haftmann@47550
   356
one_case.
haftmann@47550
   357
haftmann@47550
   358
* Discontinued configuration option "syntax_positions": atomic terms
haftmann@47550
   359
in parse trees are always annotated by position constraints.
haftmann@47550
   360
wenzelm@47464
   361
* New theory HOL/Library/DAList provides an abstract type for
wenzelm@47464
   362
association lists with distinct keys.
bulwahn@45874
   363
wenzelm@45839
   364
* 'datatype' specifications allow explicit sort constraints.
wenzelm@45839
   365
wenzelm@46160
   366
* Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
wenzelm@46160
   367
use theory HOL/Library/Nat_Bijection instead.
wenzelm@46160
   368
wenzelm@47464
   369
* Theory HOL/Library/RBT_Impl: Backing implementation of red-black
wenzelm@47464
   370
trees is now inside a type class context.  Names of affected
wenzelm@47464
   371
operations and lemmas have been prefixed by rbt_.  INCOMPATIBILITY for
wenzelm@47464
   372
theories working directly with raw red-black trees, adapt the names as
wenzelm@47464
   373
follows:
Andreas@47452
   374
Andreas@47452
   375
  Operations:
Andreas@47452
   376
  bulkload -> rbt_bulkload
Andreas@47452
   377
  del_from_left -> rbt_del_from_left
Andreas@47452
   378
  del_from_right -> rbt_del_from_right
Andreas@47452
   379
  del -> rbt_del
Andreas@47452
   380
  delete -> rbt_delete
Andreas@47452
   381
  ins -> rbt_ins
Andreas@47452
   382
  insert -> rbt_insert
Andreas@47452
   383
  insertw -> rbt_insert_with
Andreas@47452
   384
  insert_with_key -> rbt_insert_with_key
Andreas@47452
   385
  map_entry -> rbt_map_entry
Andreas@47452
   386
  lookup -> rbt_lookup
Andreas@47452
   387
  sorted -> rbt_sorted
Andreas@47452
   388
  tree_greater -> rbt_greater
Andreas@47452
   389
  tree_less -> rbt_less
Andreas@47452
   390
  tree_less_symbol -> rbt_less_symbol
Andreas@47452
   391
  union -> rbt_union
Andreas@47452
   392
  union_with -> rbt_union_with
Andreas@47452
   393
  union_with_key -> rbt_union_with_key
Andreas@47452
   394
Andreas@47452
   395
  Lemmas:
Andreas@47452
   396
  balance_left_sorted -> balance_left_rbt_sorted
Andreas@47452
   397
  balance_left_tree_greater -> balance_left_rbt_greater
Andreas@47452
   398
  balance_left_tree_less -> balance_left_rbt_less
Andreas@47452
   399
  balance_right_sorted -> balance_right_rbt_sorted
Andreas@47452
   400
  balance_right_tree_greater -> balance_right_rbt_greater
Andreas@47452
   401
  balance_right_tree_less -> balance_right_rbt_less
Andreas@47452
   402
  balance_sorted -> balance_rbt_sorted
Andreas@47452
   403
  balance_tree_greater -> balance_rbt_greater
Andreas@47452
   404
  balance_tree_less -> balance_rbt_less
Andreas@47452
   405
  bulkload_is_rbt -> rbt_bulkload_is_rbt
Andreas@47452
   406
  combine_sorted -> combine_rbt_sorted
Andreas@47452
   407
  combine_tree_greater -> combine_rbt_greater
Andreas@47452
   408
  combine_tree_less -> combine_rbt_less
Andreas@47452
   409
  delete_in_tree -> rbt_delete_in_tree
Andreas@47452
   410
  delete_is_rbt -> rbt_delete_is_rbt
Andreas@47452
   411
  del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
Andreas@47452
   412
  del_from_left_tree_less -> rbt_del_from_left_rbt_less
Andreas@47452
   413
  del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
Andreas@47452
   414
  del_from_right_tree_less -> rbt_del_from_right_rbt_less
Andreas@47452
   415
  del_in_tree -> rbt_del_in_tree
Andreas@47452
   416
  del_inv1_inv2 -> rbt_del_inv1_inv2
Andreas@47452
   417
  del_sorted -> rbt_del_rbt_sorted
Andreas@47452
   418
  del_tree_greater -> rbt_del_rbt_greater
Andreas@47452
   419
  del_tree_less -> rbt_del_rbt_less
Andreas@47452
   420
  dom_lookup_Branch -> dom_rbt_lookup_Branch
Andreas@47452
   421
  entries_lookup -> entries_rbt_lookup
Andreas@47452
   422
  finite_dom_lookup -> finite_dom_rbt_lookup
Andreas@47452
   423
  insert_sorted -> rbt_insert_rbt_sorted
Andreas@47452
   424
  insertw_is_rbt -> rbt_insertw_is_rbt
Andreas@47452
   425
  insertwk_is_rbt -> rbt_insertwk_is_rbt
Andreas@47452
   426
  insertwk_sorted -> rbt_insertwk_rbt_sorted
Andreas@47452
   427
  insertw_sorted -> rbt_insertw_rbt_sorted
Andreas@47452
   428
  ins_sorted -> ins_rbt_sorted
Andreas@47452
   429
  ins_tree_greater -> ins_rbt_greater
Andreas@47452
   430
  ins_tree_less -> ins_rbt_less
Andreas@47452
   431
  is_rbt_sorted -> is_rbt_rbt_sorted
Andreas@47452
   432
  lookup_balance -> rbt_lookup_balance
Andreas@47452
   433
  lookup_bulkload -> rbt_lookup_rbt_bulkload
Andreas@47452
   434
  lookup_delete -> rbt_lookup_rbt_delete
Andreas@47452
   435
  lookup_Empty -> rbt_lookup_Empty
Andreas@47452
   436
  lookup_from_in_tree -> rbt_lookup_from_in_tree
Andreas@47452
   437
  lookup_in_tree -> rbt_lookup_in_tree
Andreas@47452
   438
  lookup_ins -> rbt_lookup_ins
Andreas@47452
   439
  lookup_insert -> rbt_lookup_rbt_insert
Andreas@47452
   440
  lookup_insertw -> rbt_lookup_rbt_insertw
Andreas@47452
   441
  lookup_insertwk -> rbt_lookup_rbt_insertwk
Andreas@47452
   442
  lookup_keys -> rbt_lookup_keys
Andreas@47452
   443
  lookup_map -> rbt_lookup_map
Andreas@47452
   444
  lookup_map_entry -> rbt_lookup_rbt_map_entry
Andreas@47452
   445
  lookup_tree_greater -> rbt_lookup_rbt_greater
Andreas@47452
   446
  lookup_tree_less -> rbt_lookup_rbt_less
Andreas@47452
   447
  lookup_union -> rbt_lookup_rbt_union
Andreas@47452
   448
  map_entry_color_of -> rbt_map_entry_color_of
Andreas@47452
   449
  map_entry_inv1 -> rbt_map_entry_inv1
Andreas@47452
   450
  map_entry_inv2 -> rbt_map_entry_inv2
Andreas@47452
   451
  map_entry_is_rbt -> rbt_map_entry_is_rbt
Andreas@47452
   452
  map_entry_sorted -> rbt_map_entry_rbt_sorted
Andreas@47452
   453
  map_entry_tree_greater -> rbt_map_entry_rbt_greater
Andreas@47452
   454
  map_entry_tree_less -> rbt_map_entry_rbt_less
Andreas@47452
   455
  map_tree_greater -> map_rbt_greater
Andreas@47452
   456
  map_tree_less -> map_rbt_less
Andreas@47452
   457
  map_sorted -> map_rbt_sorted
Andreas@47452
   458
  paint_sorted -> paint_rbt_sorted
Andreas@47452
   459
  paint_lookup -> paint_rbt_lookup
Andreas@47452
   460
  paint_tree_greater -> paint_rbt_greater
Andreas@47452
   461
  paint_tree_less -> paint_rbt_less
Andreas@47452
   462
  sorted_entries -> rbt_sorted_entries
Andreas@47452
   463
  tree_greater_eq_trans -> rbt_greater_eq_trans
Andreas@47452
   464
  tree_greater_nit -> rbt_greater_nit
Andreas@47452
   465
  tree_greater_prop -> rbt_greater_prop
Andreas@47452
   466
  tree_greater_simps -> rbt_greater_simps
Andreas@47452
   467
  tree_greater_trans -> rbt_greater_trans
Andreas@47452
   468
  tree_less_eq_trans -> rbt_less_eq_trans
Andreas@47452
   469
  tree_less_nit -> rbt_less_nit
Andreas@47452
   470
  tree_less_prop -> rbt_less_prop
Andreas@47452
   471
  tree_less_simps -> rbt_less_simps
Andreas@47452
   472
  tree_less_trans -> rbt_less_trans
Andreas@47452
   473
  tree_ord_props -> rbt_ord_props
Andreas@47452
   474
  union_Branch -> rbt_union_Branch
Andreas@47452
   475
  union_is_rbt -> rbt_union_is_rbt
Andreas@47452
   476
  unionw_is_rbt -> rbt_unionw_is_rbt
Andreas@47452
   477
  unionwk_is_rbt -> rbt_unionwk_is_rbt
Andreas@47452
   478
  unionwk_sorted -> rbt_unionwk_rbt_sorted
Andreas@47452
   479
hoelzl@47616
   480
* Theory HOL/Library/Float: Floating point numbers are now defined as a
hoelzl@47616
   481
subset of the real numbers. All operations are defined using the
hoelzl@47622
   482
lifing-framework and proofs use the transfer method.
hoelzl@47616
   483
INCOMPATIBILITY.
hoelzl@47616
   484
hoelzl@47616
   485
  Changed Operations:
hoelzl@47622
   486
  float_abs -> abs
hoelzl@47622
   487
  float_nprt -> nprt
hoelzl@47622
   488
  float_pprt -> pprt
hoelzl@47622
   489
  pow2 -> use powr
hoelzl@47622
   490
  round_down -> float_round_down
hoelzl@47622
   491
  round_up -> float_round_up
hoelzl@47622
   492
  scale -> exponent
hoelzl@47622
   493
hoelzl@47622
   494
  Removed Operations:
hoelzl@47622
   495
  ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
hoelzl@47622
   496
hoelzl@47622
   497
  Renamed Lemmas:
hoelzl@47622
   498
  abs_float_def -> Float.compute_float_abs
hoelzl@47622
   499
  bitlen_ge0 -> bitlen_nonneg
hoelzl@47622
   500
  bitlen.simps -> Float.compute_bitlen
hoelzl@47622
   501
  float_components -> Float_mantissa_exponent
hoelzl@47622
   502
  float_divl.simps -> Float.compute_float_divl
hoelzl@47622
   503
  float_divr.simps -> Float.compute_float_divr
hoelzl@47622
   504
  float_eq_odd -> mult_powr_eq_mult_powr_iff
hoelzl@47622
   505
  float_power -> real_of_float_power
hoelzl@47622
   506
  lapprox_posrat_def -> Float.compute_lapprox_posrat
hoelzl@47622
   507
  lapprox_rat.simps -> Float.compute_lapprox_rat
hoelzl@47622
   508
  le_float_def' -> Float.compute_float_le
hoelzl@47622
   509
  le_float_def -> less_eq_float.rep_eq
hoelzl@47622
   510
  less_float_def' -> Float.compute_float_less
hoelzl@47622
   511
  less_float_def -> less_float.rep_eq
hoelzl@47622
   512
  normfloat_def -> Float.compute_normfloat
hoelzl@47622
   513
  normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
hoelzl@47622
   514
  normfloat -> normfloat_def
hoelzl@47622
   515
  normfloat_unique -> use normfloat_def
hoelzl@47622
   516
  number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
hoelzl@47622
   517
  one_float_def -> Float.compute_float_one
hoelzl@47622
   518
  plus_float_def -> Float.compute_float_plus
hoelzl@47622
   519
  rapprox_posrat_def -> Float.compute_rapprox_posrat
hoelzl@47622
   520
  rapprox_rat.simps -> Float.compute_rapprox_rat
hoelzl@47622
   521
  real_of_float_0 -> zero_float.rep_eq
hoelzl@47622
   522
  real_of_float_1 -> one_float.rep_eq
hoelzl@47622
   523
  real_of_float_abs -> abs_float.rep_eq
hoelzl@47622
   524
  real_of_float_add -> plus_float.rep_eq
hoelzl@47622
   525
  real_of_float_minus -> uminus_float.rep_eq
hoelzl@47622
   526
  real_of_float_mult -> times_float.rep_eq
hoelzl@47622
   527
  real_of_float_simp -> Float.rep_eq
hoelzl@47622
   528
  real_of_float_sub -> minus_float.rep_eq
hoelzl@47622
   529
  round_down.simps -> Float.compute_float_round_down
hoelzl@47622
   530
  round_up.simps -> Float.compute_float_round_up
hoelzl@47622
   531
  times_float_def -> Float.compute_float_times
hoelzl@47622
   532
  uminus_float_def -> Float.compute_float_uminus
hoelzl@47622
   533
  zero_float_def -> Float.compute_float_zero
hoelzl@47622
   534
hoelzl@47622
   535
  Lemmas not necessary anymore, use the transfer method:
hoelzl@47622
   536
  bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
hoelzl@47622
   537
  float_divr, float_le_simp, float_less1_mantissa_bound,
hoelzl@47622
   538
  float_less_simp, float_less_zero, float_le_zero,
hoelzl@47622
   539
  float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
hoelzl@47622
   540
  floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
hoelzl@47622
   541
  lapprox_rat_bottom, normalized_float, rapprox_posrat,
hoelzl@47622
   542
  rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
hoelzl@47622
   543
  real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
hoelzl@47622
   544
  round_up, zero_le_float, zero_less_float
hoelzl@47616
   545
wenzelm@46160
   546
* Session HOL-Word: Discontinued many redundant theorems specific to
wenzelm@46160
   547
type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
wenzelm@46160
   548
instead.
huffman@45546
   549
huffman@45546
   550
  word_sub_alt ~> word_sub_wi
huffman@45546
   551
  word_add_alt ~> word_add_def
huffman@45546
   552
  word_mult_alt ~> word_mult_def
huffman@45546
   553
  word_minus_alt ~> word_minus_def
huffman@45546
   554
  word_0_alt ~> word_0_wi
huffman@45546
   555
  word_1_alt ~> word_1_wi
huffman@45546
   556
  word_add_0 ~> add_0_left
huffman@45546
   557
  word_add_0_right ~> add_0_right
huffman@45546
   558
  word_mult_1 ~> mult_1_left
huffman@45546
   559
  word_mult_1_right ~> mult_1_right
huffman@45546
   560
  word_add_commute ~> add_commute
huffman@45546
   561
  word_add_assoc ~> add_assoc
huffman@45546
   562
  word_add_left_commute ~> add_left_commute
huffman@45546
   563
  word_mult_commute ~> mult_commute
huffman@45546
   564
  word_mult_assoc ~> mult_assoc
huffman@45546
   565
  word_mult_left_commute ~> mult_left_commute
huffman@45546
   566
  word_left_distrib ~> left_distrib
huffman@45546
   567
  word_right_distrib ~> right_distrib
huffman@45546
   568
  word_left_minus ~> left_minus
huffman@45546
   569
  word_diff_0_right ~> diff_0_right
huffman@45546
   570
  word_diff_self ~> diff_self
huffman@45957
   571
  word_sub_def ~> diff_minus
huffman@45804
   572
  word_diff_minus ~> diff_minus
huffman@45546
   573
  word_add_ac ~> add_ac
huffman@45546
   574
  word_mult_ac ~> mult_ac
huffman@45546
   575
  word_plus_ac0 ~> add_0_left add_0_right add_ac
huffman@45546
   576
  word_times_ac1 ~> mult_1_left mult_1_right mult_ac
huffman@45547
   577
  word_order_trans ~> order_trans
huffman@45547
   578
  word_order_refl ~> order_refl
huffman@45547
   579
  word_order_antisym ~> order_antisym
huffman@45547
   580
  word_order_linear ~> linorder_linear
huffman@45810
   581
  lenw1_zero_neq_one ~> zero_neq_one
huffman@45810
   582
  word_number_of_eq ~> number_of_eq
huffman@46013
   583
  word_of_int_add_hom ~> wi_hom_add
huffman@46013
   584
  word_of_int_sub_hom ~> wi_hom_sub
huffman@46013
   585
  word_of_int_mult_hom ~> wi_hom_mult
huffman@46013
   586
  word_of_int_minus_hom ~> wi_hom_neg
huffman@46013
   587
  word_of_int_succ_hom ~> wi_hom_succ
huffman@46013
   588
  word_of_int_pred_hom ~> wi_hom_pred
huffman@46013
   589
  word_of_int_0_hom ~> word_0_wi
huffman@46013
   590
  word_of_int_1_hom ~> word_1_wi
huffman@45546
   591
thomas@47567
   592
* New tactic "word_bitwise" for splitting machine word equalities and
thomas@47567
   593
inequalities into logical circuits. Requires theory "WordBitwise" from HOL-Word
thomas@47567
   594
session. Supports addition, subtraction, multiplication, shifting by
thomas@47567
   595
constants, bitwise operators and numeric constants. Requires fixed-length word
thomas@47567
   596
types, cannot operate on 'a word. Solves many standard word identies outright
thomas@47567
   597
and converts more into first order problems amenable to blast or similar. See
thomas@47567
   598
HOL/Word/WordBitwise.thy and examples in HOL/Word/Examples/WordExamples.thy.
thomas@47567
   599
huffman@46014
   600
* Clarified attribute "mono_set": pure declaration without modifying
wenzelm@45384
   601
the result of the fact expression.
wenzelm@45384
   602
wenzelm@45383
   603
* "Transitive_Closure.ntrancl": bounded transitive closure on
wenzelm@45383
   604
relations.
wenzelm@45383
   605
huffman@46014
   606
* Constant "Set.not_member" now qualified.  INCOMPATIBILITY.
wenzelm@45383
   607
huffman@45122
   608
* Theory Int: Discontinued many legacy theorems specific to type int.
wenzelm@45383
   609
INCOMPATIBILITY, use the corresponding generic theorems instead.
huffman@45122
   610
huffman@45122
   611
  zminus_zminus ~> minus_minus
huffman@45122
   612
  zminus_0 ~> minus_zero
huffman@45122
   613
  zminus_zadd_distrib ~> minus_add_distrib
huffman@45122
   614
  zadd_commute ~> add_commute
huffman@45122
   615
  zadd_assoc ~> add_assoc
huffman@45122
   616
  zadd_left_commute ~> add_left_commute
wenzelm@45196
   617
  zadd_ac ~> add_ac
huffman@45122
   618
  zmult_ac ~> mult_ac
huffman@45122
   619
  zadd_0 ~> add_0_left
huffman@45122
   620
  zadd_0_right ~> add_0_right
huffman@45122
   621
  zadd_zminus_inverse2 ~> left_minus
huffman@45122
   622
  zmult_zminus ~> mult_minus_left
huffman@45122
   623
  zmult_commute ~> mult_commute
huffman@45122
   624
  zmult_assoc ~> mult_assoc
huffman@45122
   625
  zadd_zmult_distrib ~> left_distrib
huffman@45122
   626
  zadd_zmult_distrib2 ~> right_distrib
huffman@45122
   627
  zdiff_zmult_distrib ~> left_diff_distrib
huffman@45122
   628
  zdiff_zmult_distrib2 ~> right_diff_distrib
huffman@45122
   629
  zmult_1 ~> mult_1_left
huffman@45122
   630
  zmult_1_right ~> mult_1_right
huffman@45122
   631
  zle_refl ~> order_refl
huffman@45122
   632
  zle_trans ~> order_trans
huffman@45122
   633
  zle_antisym ~> order_antisym
huffman@45122
   634
  zle_linear ~> linorder_linear
huffman@45122
   635
  zless_linear ~> linorder_less_linear
huffman@45122
   636
  zadd_left_mono ~> add_left_mono
huffman@45122
   637
  zadd_strict_right_mono ~> add_strict_right_mono
huffman@45122
   638
  zadd_zless_mono ~> add_less_le_mono
huffman@45122
   639
  int_0_less_1 ~> zero_less_one
huffman@45122
   640
  int_0_neq_1 ~> zero_neq_one
huffman@45122
   641
  zless_le ~> less_le
huffman@45122
   642
  zpower_zadd_distrib ~> power_add
huffman@45122
   643
  zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
huffman@45122
   644
  zero_le_zpower_abs ~> zero_le_power_abs
huffman@45122
   645
noschinl@45791
   646
* Theory Deriv: Renamed
noschinl@45791
   647
noschinl@45791
   648
  DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
noschinl@45791
   649
wenzelm@45383
   650
* New "case_product" attribute to generate a case rule doing multiple
wenzelm@45383
   651
case distinctions at the same time.  E.g.
wenzelm@45383
   652
wenzelm@45383
   653
  list.exhaust [case_product nat.exhaust]
wenzelm@45383
   654
wenzelm@45383
   655
produces a rule which can be used to perform case distinction on both
wenzelm@45383
   656
a list and a nat.
wenzelm@45383
   657
wenzelm@47464
   658
* Theory Library/Multiset: Improved code generation of multisets.
wenzelm@47464
   659
huffman@47655
   660
* New Transfer package:
huffman@47655
   661
huffman@47655
   662
  - transfer_rule attribute: Maintains a collection of transfer rules,
huffman@47655
   663
    which relate constants at two different types. Transfer rules may
huffman@47655
   664
    relate different type instances of the same polymorphic constant,
huffman@47655
   665
    or they may relate an operation on a raw type to a corresponding
huffman@47655
   666
    operation on an abstract type (quotient or subtype). For example:
huffman@47655
   667
huffman@47655
   668
    ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
huffman@47655
   669
    (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
huffman@47655
   670
huffman@47655
   671
  - transfer method: Replaces a subgoal on abstract types with an
huffman@47655
   672
    equivalent subgoal on the corresponding raw types. Constants are
huffman@47655
   673
    replaced with corresponding ones according to the transfer rules.
huffman@47655
   674
    Goals are generalized over all free variables by default; this is
huffman@47655
   675
    necessary for variables whose types changes, but can be overridden
huffman@47655
   676
    for specific variables with e.g. 'transfer fixing: x y z'.
huffman@47655
   677
huffman@47655
   678
  - relator_eq attribute: Collects identity laws for relators of
huffman@47655
   679
    various type constructors, e.g. "list_all2 (op =) = (op =)". The
huffman@47655
   680
    transfer method uses these lemmas to infer transfer rules for
huffman@47655
   681
    non-polymorphic constants on the fly.
huffman@47655
   682
huffman@47655
   683
  - transfer_prover method: Assists with proving a transfer rule for a
huffman@47655
   684
    new constant, provided the constant is defined in terms of other
huffman@47655
   685
    constants that already have transfer rules. It should be applied
huffman@47655
   686
    after unfolding the constant definitions.
huffman@47655
   687
huffman@47655
   688
  - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
huffman@47655
   689
    from type nat to type int.
huffman@47655
   690
huffman@47655
   691
* New Lifting package:
huffman@47655
   692
huffman@47655
   693
  - lift_definition command: Defines operations on an abstract type in
huffman@47655
   694
    terms of a corresponding operation on a representation type. Example
huffman@47655
   695
    syntax:
huffman@47655
   696
huffman@47655
   697
    lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
huffman@47655
   698
      is List.insert
huffman@47655
   699
huffman@47655
   700
    Users must discharge a respectfulness proof obligation when each
huffman@47655
   701
    constant is defined. (For a type copy, i.e. a typedef with UNIV,
huffman@47655
   702
    the proof is discharged automatically.) The obligation is
huffman@47655
   703
    presented in a user-friendly, readable form; a respectfulness
huffman@47655
   704
    theorem in the standard format and a transfer rule are generated
huffman@47655
   705
    by the package.
huffman@47655
   706
huffman@47655
   707
  - Integration with code_abstype: For typedefs (e.g. subtypes
huffman@47655
   708
    corresponding to a datatype invariant, such as dlist),
huffman@47655
   709
    lift_definition generates a code certificate theorem and sets up
huffman@47655
   710
    code generation for each constant.
huffman@47655
   711
huffman@47655
   712
  - setup_lifting command: Sets up the Lifting package to work with
huffman@47655
   713
    a user-defined type. The user must provide either a quotient
huffman@47655
   714
    theorem or a type_definition theorem. The package configures
huffman@47655
   715
    transfer rules for equality and quantifiers on the type, and sets
huffman@47655
   716
    up the lift_definition command to work with the type.
huffman@47655
   717
huffman@47655
   718
  - Usage examples: See Quotient_Examples/Lift_DList.thy,
huffman@47655
   719
    Quotient_Examples/Lift_RBT.thy, Word/Word.thy and
huffman@47655
   720
    Library/Float.thy.
huffman@47655
   721
huffman@47655
   722
* Quotient package:
huffman@47655
   723
huffman@47655
   724
  - The 'quotient_type' command now supports a 'morphisms' option with
huffman@47655
   725
    rep and abs functions, similar to typedef.
huffman@47655
   726
huffman@47655
   727
  - 'quotient_type' sets up new types to work with the Lifting and
huffman@47655
   728
    Transfer packages, as with 'setup_lifting'.
huffman@47655
   729
huffman@47655
   730
  - The 'quotient_definition' command now requires the user to prove a
huffman@47655
   731
    respectfulness property at the point where the constant is
huffman@47655
   732
    defined, similar to lift_definition; INCOMPATIBILITY. Users are
huffman@47655
   733
    encouraged to use lift_definition + transfer instead of
huffman@47655
   734
    quotient_definition + descending, which will eventually be
huffman@47655
   735
    deprecated.
huffman@47655
   736
huffman@47655
   737
  - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
huffman@47655
   738
    accordingly, INCOMPATIBILITY.
huffman@47655
   739
wenzelm@47464
   740
* New diagnostic command 'find_unused_assms' to find potentially
wenzelm@47464
   741
superfluous assumptions in theorems using Quickcheck.
bulwahn@46591
   742
bulwahn@45759
   743
* Quickcheck:
wenzelm@47464
   744
bulwahn@45759
   745
  - Quickcheck returns variable assignments as counterexamples, which
bulwahn@45759
   746
    allows to reveal the underspecification of functions under test.
bulwahn@45759
   747
    For example, refuting "hd xs = x", it presents the variable
bulwahn@45759
   748
    assignment xs = [] and x = a1 as a counterexample, assuming that
bulwahn@45759
   749
    any property is false whenever "hd []" occurs in it.
wenzelm@47464
   750
bulwahn@45759
   751
    These counterexample are marked as potentially spurious, as
bulwahn@45759
   752
    Quickcheck also returns "xs = []" as a counterexample to the
bulwahn@45759
   753
    obvious theorem "hd xs = hd xs".
wenzelm@47464
   754
bulwahn@45759
   755
    After finding a potentially spurious counterexample, Quickcheck
bulwahn@45759
   756
    continues searching for genuine ones.
wenzelm@47464
   757
bulwahn@45759
   758
    By default, Quickcheck shows potentially spurious and genuine
wenzelm@47464
   759
    counterexamples. The option "genuine_only" sets quickcheck to only
wenzelm@47464
   760
    show genuine counterexamples.
bulwahn@45941
   761
bulwahn@45941
   762
  - The command 'quickcheck_generator' creates random and exhaustive
bulwahn@45941
   763
    value generators for a given type and operations.
wenzelm@47464
   764
bulwahn@45941
   765
    It generates values by using the operations as if they were
wenzelm@47463
   766
    constructors of that type.
bulwahn@46170
   767
bulwahn@46170
   768
  - Support for multisets.
bulwahn@46170
   769
bulwahn@46591
   770
  - Added "use_subtype" options.
wenzelm@47464
   771
bulwahn@47349
   772
  - Added "quickcheck_locale" configuration to specify how to process
bulwahn@47349
   773
    conjectures in a locale context.
bulwahn@47349
   774
blanchet@45398
   775
* Nitpick:
blanchet@45516
   776
  - Fixed infinite loop caused by the 'peephole_optim' option and
blanchet@45516
   777
    affecting 'rat' and 'real'.
blanchet@45516
   778
blanchet@45516
   779
* Sledgehammer:
blanchet@47563
   780
  - Integrated more tightly with SPASS, as described in the ITP 2012 paper "More
blanchet@47563
   781
    SPASS with Isabelle".
blanchet@47563
   782
  - Made it try "smt" as a fallback if "metis" fails or times out.
blanchet@47563
   783
  - Added support for the following provers: Alt-Ergo (via Why3 and TFF1),
blanchet@47563
   784
    iProver, iProver-Eq.
blanchet@47563
   785
  - Replaced remote E-SInE with remote Satallax in the default setup.
blanchet@47563
   786
  - Sped up the minimizer.
blanchet@46409
   787
  - Added "lam_trans", "uncurry_aliases", and "minimize" options.
blanchet@45706
   788
  - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
blanchet@46301
   789
  - Renamed "sound" option to "strict".
blanchet@45516
   790
blanchet@45516
   791
* Metis:
blanchet@45516
   792
  - Added possibility to specify lambda translations scheme as a
blanchet@46366
   793
    parenthesized argument (e.g., "by (metis (lifting) ...)").
blanchet@45398
   794
bulwahn@47197
   795
* SMT:
blanchet@47563
   796
  - Renamed "smt_fixed" option to "smt_read_only_certificates".
wenzelm@47463
   797
blanchet@46641
   798
* Command 'try0':
blanchet@46641
   799
  - Renamed from 'try_methods'. INCOMPATIBILITY.
blanchet@46641
   800
noschinl@46888
   801
* New "eventually_elim" method as a generalized variant of the
wenzelm@47464
   802
eventually_elim* rules. Supports structured proofs.
noschinl@46888
   803
wenzelm@47413
   804
* HOL/TPTP: support to parse and import TPTP problems (all languages)
wenzelm@47464
   805
into Isabelle/HOL.
wenzelm@47413
   806
blanchet@45398
   807
noschinl@45160
   808
*** FOL ***
noschinl@45160
   809
wenzelm@45383
   810
* New "case_product" attribute (see HOL).
noschinl@45160
   811
wenzelm@45109
   812
wenzelm@47463
   813
*** ZF ***
wenzelm@47463
   814
wenzelm@47463
   815
* Greater support for structured proofs involving induction or case
wenzelm@47463
   816
analysis.
wenzelm@47463
   817
wenzelm@47463
   818
* Much greater use of mathematical symbols.
wenzelm@47463
   819
wenzelm@47463
   820
* Removal of many ML theorem bindings.  INCOMPATIBILITY.
wenzelm@47463
   821
wenzelm@47463
   822
wenzelm@45128
   823
*** ML ***
wenzelm@45128
   824
wenzelm@46948
   825
* Antiquotation @{keyword "name"} produces a parser for outer syntax
wenzelm@46948
   826
from a minor keyword introduced via theory header declaration.
wenzelm@46948
   827
wenzelm@46961
   828
* Antiquotation @{command_spec "name"} produces the
wenzelm@46961
   829
Outer_Syntax.command_spec from a major keyword introduced via theory
wenzelm@46961
   830
header declaration; it can be passed to Outer_Syntax.command etc.
wenzelm@46961
   831
wenzelm@46916
   832
* Local_Theory.define no longer hard-wires default theorem name
wenzelm@46992
   833
"foo_def", but retains the binding as given.  If that is Binding.empty
wenzelm@46992
   834
/ Attrib.empty_binding, the result is not registered as user-level
wenzelm@46992
   835
fact.  The Local_Theory.define_internal variant allows to specify a
wenzelm@46992
   836
non-empty name (used for the foundation in the background theory),
wenzelm@46992
   837
while omitting the fact binding in the user-context.  Potential
wenzelm@46992
   838
INCOMPATIBILITY for derived definitional packages: need to specify
wenzelm@46992
   839
naming policy for primitive definitions more explicitly.
wenzelm@46916
   840
wenzelm@46497
   841
* Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
wenzelm@46497
   842
conformance with similar operations in structure Term and Logic.
wenzelm@46497
   843
wenzelm@45592
   844
* Antiquotation @{attributes [...]} embeds attribute source
wenzelm@45592
   845
representation into the ML text, which is particularly useful with
wenzelm@45592
   846
declarations like Local_Theory.note.
wenzelm@45592
   847
wenzelm@45128
   848
* Structure Proof_Context follows standard naming scheme.  Old
wenzelm@45128
   849
ProofContext has been discontinued.  INCOMPATIBILITY.
wenzelm@45128
   850
wenzelm@45293
   851
* Refined Local_Theory.declaration {syntax, pervasive}, with subtle
wenzelm@45298
   852
change of semantics: update is applied to auxiliary local theory
wenzelm@45293
   853
context as well.
wenzelm@45293
   854
wenzelm@45620
   855
* Modernized some old-style infix operations:
wenzelm@45620
   856
wenzelm@45620
   857
  addeqcongs    ~> Simplifier.add_eqcong
wenzelm@45620
   858
  deleqcongs    ~> Simplifier.del_eqcong
wenzelm@45620
   859
  addcongs      ~> Simplifier.add_cong
wenzelm@45620
   860
  delcongs      ~> Simplifier.del_cong
wenzelm@45625
   861
  setmksimps    ~> Simplifier.set_mksimps
wenzelm@45625
   862
  setmkcong     ~> Simplifier.set_mkcong
wenzelm@45625
   863
  setmksym      ~> Simplifier.set_mksym
wenzelm@45625
   864
  setmkeqTrue   ~> Simplifier.set_mkeqTrue
wenzelm@45625
   865
  settermless   ~> Simplifier.set_termless
wenzelm@45625
   866
  setsubgoaler  ~> Simplifier.set_subgoaler
wenzelm@45620
   867
  addsplits     ~> Splitter.add_split
wenzelm@45620
   868
  delsplits     ~> Splitter.del_split
wenzelm@45620
   869
wenzelm@45128
   870
wenzelm@47461
   871
*** System ***
wenzelm@47461
   872
wenzelm@47464
   873
* ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
wenzelm@47464
   874
(not just JRE).
wenzelm@47464
   875
wenzelm@47461
   876
* ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
wenzelm@47461
   877
notation, which is useful for the jEdit file browser, for example.
wenzelm@47461
   878
wenzelm@47461
   879
wenzelm@45109
   880
wenzelm@44801
   881
New in Isabelle2011-1 (October 2011)
wenzelm@44801
   882
------------------------------------
wenzelm@41651
   883
wenzelm@41703
   884
*** General ***
wenzelm@41703
   885
wenzelm@44760
   886
* Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
wenzelm@44968
   887
"isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
wenzelm@44760
   888
wenzelm@44777
   889
  - Management of multiple theory files directly from the editor
wenzelm@44760
   890
    buffer store -- bypassing the file-system (no requirement to save
wenzelm@44760
   891
    files for checking).
wenzelm@44760
   892
wenzelm@44777
   893
  - Markup of formal entities within the text buffer, with semantic
wenzelm@44760
   894
    highlighting, tooltips and hyperlinks to jump to defining source
wenzelm@44760
   895
    positions.
wenzelm@44760
   896
wenzelm@44777
   897
  - Improved text rendering, with sub/superscripts in the source
wenzelm@44777
   898
    buffer (including support for copy/paste wrt. output panel, HTML
wenzelm@44777
   899
    theory output and other non-Isabelle text boxes).
wenzelm@44777
   900
wenzelm@44777
   901
  - Refined scheduling of proof checking and printing of results,
wenzelm@44760
   902
    based on interactive editor view.  (Note: jEdit folding and
wenzelm@44760
   903
    narrowing allows to restrict buffer perspectives explicitly.)
wenzelm@44760
   904
wenzelm@44777
   905
  - Reduced CPU performance requirements, usable on machines with few
wenzelm@44760
   906
    cores.
wenzelm@44760
   907
wenzelm@44777
   908
  - Reduced memory requirements due to pruning of unused document
wenzelm@44760
   909
    versions (garbage collection).
wenzelm@44760
   910
wenzelm@44760
   911
See also ~~/src/Tools/jEdit/README.html for further information,
wenzelm@44760
   912
including some remaining limitations.
wenzelm@44760
   913
wenzelm@44800
   914
* Theory loader: source files are exclusively located via the master
wenzelm@44800
   915
directory of each theory node (where the .thy file itself resides).
wenzelm@44800
   916
The global load path (such as src/HOL/Library) has been discontinued.
wenzelm@44800
   917
Note that the path element ~~ may be used to reference theories in the
wenzelm@44800
   918
Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
wenzelm@44800
   919
INCOMPATIBILITY.
wenzelm@44800
   920
wenzelm@41955
   921
* Theory loader: source files are identified by content via SHA1
wenzelm@41955
   922
digests.  Discontinued former path/modtime identification and optional
wenzelm@41955
   923
ISABELLE_FILE_IDENT plugin scripts.
wenzelm@41955
   924
wenzelm@41703
   925
* Parallelization of nested Isar proofs is subject to
wenzelm@41703
   926
Goal.parallel_proofs_threshold (default 100).  See also isabelle
wenzelm@41703
   927
usedir option -Q.
wenzelm@41703
   928
wenzelm@42669
   929
* Name space: former unsynchronized references are now proper
wenzelm@42669
   930
configuration options, with more conventional names:
wenzelm@42669
   931
wenzelm@42669
   932
  long_names   ~> names_long
wenzelm@42669
   933
  short_names  ~> names_short
wenzelm@42669
   934
  unique_names ~> names_unique
wenzelm@42669
   935
wenzelm@42669
   936
Minor INCOMPATIBILITY, need to declare options in context like this:
wenzelm@42669
   937
wenzelm@42669
   938
  declare [[names_unique = false]]
wenzelm@42358
   939
wenzelm@42502
   940
* Literal facts `prop` may contain dummy patterns, e.g. `_ = _`.  Note
wenzelm@42502
   941
that the result needs to be unique, which means fact specifications
wenzelm@42502
   942
may have to be refined after enriching a proof context.
wenzelm@42502
   943
wenzelm@44800
   944
* Attribute "case_names" has been refined: the assumptions in each case
wenzelm@44800
   945
can be named now by following the case name with [name1 name2 ...].
wenzelm@44800
   946
wenzelm@44968
   947
* Isabelle/Isar reference manual has been updated and extended:
wenzelm@44968
   948
  - "Synopsis" provides a catalog of main Isar language concepts.
wenzelm@44968
   949
  - Formal references in syntax diagrams, via @{rail} antiquotation.
wenzelm@44968
   950
  - Updated material from classic "ref" manual, notably about
wenzelm@44968
   951
    "Classical Reasoner".
wenzelm@42633
   952
wenzelm@41703
   953
blanchet@41727
   954
*** HOL ***
blanchet@41727
   955
wenzelm@44968
   956
* Class bot and top require underlying partial order rather than
wenzelm@44800
   957
preorder: uniqueness of bot and top is guaranteed.  INCOMPATIBILITY.
haftmann@43815
   958
haftmann@43940
   959
* Class complete_lattice: generalized a couple of lemmas from sets;
wenzelm@44800
   960
generalized theorems INF_cong and SUP_cong.  New type classes for
wenzelm@44800
   961
complete boolean algebras and complete linear orders.  Lemmas
wenzelm@44800
   962
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
wenzelm@44800
   963
class complete_linorder.
wenzelm@44800
   964
wenzelm@44800
   965
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
wenzelm@44800
   966
Sup_fun_def, Inf_apply, Sup_apply.
wenzelm@44800
   967
wenzelm@45088
   968
Removed redundant lemmas (the right hand side gives hints how to
wenzelm@45088
   969
replace them for (metis ...), or (simp only: ...) proofs):
hoelzl@45041
   970
hoelzl@45041
   971
  Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
hoelzl@45041
   972
  Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
hoelzl@45041
   973
  Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
hoelzl@45041
   974
  Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
hoelzl@45041
   975
  Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
hoelzl@45041
   976
  Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
hoelzl@45041
   977
  Inter_def ~> INF_def, image_def
hoelzl@45041
   978
  Union_def ~> SUP_def, image_def
hoelzl@45041
   979
  INT_eq ~> INF_def, and image_def
hoelzl@45041
   980
  UN_eq ~> SUP_def, and image_def
hoelzl@45041
   981
  INF_subset ~> INF_superset_mono [OF _ order_refl]
wenzelm@44800
   982
wenzelm@44800
   983
More consistent and comprehensive names:
wenzelm@44800
   984
hoelzl@45041
   985
  INTER_eq_Inter_image ~> INF_def
hoelzl@45041
   986
  UNION_eq_Union_image ~> SUP_def
haftmann@43872
   987
  INFI_def ~> INF_def
haftmann@43872
   988
  SUPR_def ~> SUP_def
haftmann@44103
   989
  INF_leI ~> INF_lower
haftmann@44103
   990
  INF_leI2 ~> INF_lower2
haftmann@44103
   991
  le_INFI ~> INF_greatest
haftmann@44103
   992
  le_SUPI ~> SUP_upper
haftmann@44103
   993
  le_SUPI2 ~> SUP_upper2
haftmann@44103
   994
  SUP_leI ~> SUP_least
haftmann@43873
   995
  INFI_bool_eq ~> INF_bool_eq
haftmann@43873
   996
  SUPR_bool_eq ~> SUP_bool_eq
haftmann@43873
   997
  INFI_apply ~> INF_apply
haftmann@43873
   998
  SUPR_apply ~> SUP_apply
haftmann@44103
   999
  INTER_def ~> INTER_eq
haftmann@44103
  1000
  UNION_def ~> UNION_eq
haftmann@44103
  1001
haftmann@43865
  1002
INCOMPATIBILITY.
haftmann@43865
  1003
wenzelm@44973
  1004
* Renamed theory Complete_Lattice to Complete_Lattices.
wenzelm@44973
  1005
INCOMPATIBILITY.
wenzelm@44973
  1006
wenzelm@44973
  1007
* Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
wenzelm@44973
  1008
INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
wenzelm@44973
  1009
Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
wenzelm@44973
  1010
Sup_insert are now declared as [simp].  INCOMPATIBILITY.
wenzelm@44973
  1011
wenzelm@44973
  1012
* Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
wenzelm@44973
  1013
compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
wenzelm@44973
  1014
sup_inf_absob, sup_left_idem are now declared as [simp].  Minor
wenzelm@44973
  1015
INCOMPATIBILITY.
wenzelm@44973
  1016
krauss@44845
  1017
* Added syntactic classes "inf" and "sup" for the respective
krauss@44845
  1018
constants.  INCOMPATIBILITY: Changes in the argument order of the
krauss@44845
  1019
(mostly internal) locale predicates for some derived classes.
krauss@44845
  1020
wenzelm@44800
  1021
* Theorem collections ball_simps and bex_simps do not contain theorems
wenzelm@44800
  1022
referring to UNION any longer; these have been moved to collection
wenzelm@44800
  1023
UN_ball_bex_simps.  INCOMPATIBILITY.
wenzelm@44800
  1024
wenzelm@44800
  1025
* Theory Archimedean_Field: floor now is defined as parameter of a
wenzelm@44800
  1026
separate type class floor_ceiling.
wenzelm@44800
  1027
wenzelm@44800
  1028
* Theory Finite_Set: more coherent development of fold_set locales:
haftmann@42874
  1029
haftmann@42874
  1030
    locale fun_left_comm ~> locale comp_fun_commute
haftmann@42874
  1031
    locale fun_left_comm_idem ~> locale comp_fun_idem
wenzelm@44800
  1032
wenzelm@44800
  1033
Both use point-free characterization; interpretation proofs may need
wenzelm@44800
  1034
adjustment.  INCOMPATIBILITY.
haftmann@42874
  1035
wenzelm@44800
  1036
* Theory Limits: Type "'a net" has been renamed to "'a filter", in
huffman@44081
  1037
accordance with standard mathematical terminology. INCOMPATIBILITY.
huffman@44081
  1038
wenzelm@44800
  1039
* Theory Complex_Main: The locale interpretations for the
wenzelm@44800
  1040
bounded_linear and bounded_bilinear locales have been removed, in
wenzelm@44800
  1041
order to reduce the number of duplicate lemmas. Users must use the
wenzelm@44800
  1042
original names for distributivity theorems, potential INCOMPATIBILITY.
huffman@44282
  1043
huffman@44282
  1044
  divide.add ~> add_divide_distrib
huffman@44282
  1045
  divide.diff ~> diff_divide_distrib
huffman@44282
  1046
  divide.setsum ~> setsum_divide_distrib
huffman@44282
  1047
  mult.add_right ~> right_distrib
huffman@44282
  1048
  mult.diff_right ~> right_diff_distrib
huffman@44282
  1049
  mult_right.setsum ~> setsum_right_distrib
huffman@44282
  1050
  mult_left.diff ~> left_diff_distrib
huffman@44282
  1051
wenzelm@44800
  1052
* Theory Complex_Main: Several redundant theorems have been removed or
huffman@44568
  1053
replaced by more general versions. INCOMPATIBILITY.
huffman@44522
  1054
huffman@45051
  1055
  real_diff_def ~> minus_real_def
huffman@45051
  1056
  real_divide_def ~> divide_real_def
huffman@45051
  1057
  real_less_def ~> less_le
huffman@45051
  1058
  real_abs_def ~> abs_real_def
huffman@45051
  1059
  real_sgn_def ~> sgn_real_def
huffman@45051
  1060
  real_mult_commute ~> mult_commute
huffman@45051
  1061
  real_mult_assoc ~> mult_assoc
huffman@45051
  1062
  real_mult_1 ~> mult_1_left
huffman@45051
  1063
  real_add_mult_distrib ~> left_distrib
huffman@45051
  1064
  real_zero_not_eq_one ~> zero_neq_one
huffman@45051
  1065
  real_mult_inverse_left ~> left_inverse
huffman@45051
  1066
  INVERSE_ZERO ~> inverse_zero
huffman@45051
  1067
  real_le_refl ~> order_refl
huffman@45051
  1068
  real_le_antisym ~> order_antisym
huffman@45051
  1069
  real_le_trans ~> order_trans
huffman@45051
  1070
  real_le_linear ~> linear
huffman@45051
  1071
  real_le_eq_diff ~> le_iff_diff_le_0
huffman@45051
  1072
  real_add_left_mono ~> add_left_mono
huffman@45051
  1073
  real_mult_order ~> mult_pos_pos
huffman@45051
  1074
  real_mult_less_mono2 ~> mult_strict_left_mono
huffman@44822
  1075
  real_of_int_real_of_nat ~> real_of_int_of_nat_eq
huffman@44522
  1076
  real_0_le_divide_iff ~> zero_le_divide_iff
huffman@44522
  1077
  realpow_two_disj ~> power2_eq_iff
huffman@44522
  1078
  real_squared_diff_one_factored ~> square_diff_one_factored
huffman@44522
  1079
  realpow_two_diff ~> square_diff_square_factored
huffman@44669
  1080
  reals_complete2 ~> complete_real
huffman@44749
  1081
  real_sum_squared_expand ~> power2_sum
huffman@44522
  1082
  exp_ln_eq ~> ln_unique
huffman@44711
  1083
  expi_add ~> exp_add
huffman@44711
  1084
  expi_zero ~> exp_zero
huffman@44522
  1085
  lemma_DERIV_subst ~> DERIV_cong
huffman@44568
  1086
  LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
huffman@44568
  1087
  LIMSEQ_const ~> tendsto_const
huffman@44568
  1088
  LIMSEQ_norm ~> tendsto_norm
huffman@44568
  1089
  LIMSEQ_add ~> tendsto_add
huffman@44568
  1090
  LIMSEQ_minus ~> tendsto_minus
huffman@44568
  1091
  LIMSEQ_minus_cancel ~> tendsto_minus_cancel
huffman@44568
  1092
  LIMSEQ_diff ~> tendsto_diff
huffman@44568
  1093
  bounded_linear.LIMSEQ ~> bounded_linear.tendsto
huffman@44568
  1094
  bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
huffman@44568
  1095
  LIMSEQ_mult ~> tendsto_mult
huffman@44568
  1096
  LIMSEQ_inverse ~> tendsto_inverse
huffman@44568
  1097
  LIMSEQ_divide ~> tendsto_divide
huffman@44568
  1098
  LIMSEQ_pow ~> tendsto_power
huffman@44568
  1099
  LIMSEQ_setsum ~> tendsto_setsum
huffman@44568
  1100
  LIMSEQ_setprod ~> tendsto_setprod
huffman@44568
  1101
  LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
huffman@44568
  1102
  LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
huffman@44568
  1103
  LIMSEQ_imp_rabs ~> tendsto_rabs
huffman@44710
  1104
  LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
huffman@44710
  1105
  LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
huffman@44710
  1106
  LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
huffman@44748
  1107
  LIMSEQ_Complex ~> tendsto_Complex
huffman@44568
  1108
  LIM_ident ~> tendsto_ident_at
huffman@44568
  1109
  LIM_const ~> tendsto_const
huffman@44568
  1110
  LIM_add ~> tendsto_add
huffman@44568
  1111
  LIM_add_zero ~> tendsto_add_zero
huffman@44568
  1112
  LIM_minus ~> tendsto_minus
huffman@44568
  1113
  LIM_diff ~> tendsto_diff
huffman@44568
  1114
  LIM_norm ~> tendsto_norm
huffman@44568
  1115
  LIM_norm_zero ~> tendsto_norm_zero
huffman@44568
  1116
  LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
huffman@44568
  1117
  LIM_norm_zero_iff ~> tendsto_norm_zero_iff
huffman@44568
  1118
  LIM_rabs ~> tendsto_rabs
huffman@44568
  1119
  LIM_rabs_zero ~> tendsto_rabs_zero
huffman@44568
  1120
  LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
huffman@44568
  1121
  LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
huffman@44568
  1122
  LIM_compose ~> tendsto_compose
huffman@44568
  1123
  LIM_mult ~> tendsto_mult
huffman@44568
  1124
  LIM_scaleR ~> tendsto_scaleR
huffman@44568
  1125
  LIM_of_real ~> tendsto_of_real
huffman@44568
  1126
  LIM_power ~> tendsto_power
huffman@44568
  1127
  LIM_inverse ~> tendsto_inverse
huffman@44568
  1128
  LIM_sgn ~> tendsto_sgn
huffman@44568
  1129
  isCont_LIM_compose ~> isCont_tendsto_compose
huffman@44568
  1130
  bounded_linear.LIM ~> bounded_linear.tendsto
huffman@44568
  1131
  bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
huffman@44568
  1132
  bounded_bilinear.LIM ~> bounded_bilinear.tendsto
huffman@44568
  1133
  bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
huffman@44568
  1134
  bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
huffman@44568
  1135
  bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
huffman@44568
  1136
  LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
huffman@44522
  1137
wenzelm@44967
  1138
* Theory Complex_Main: The definition of infinite series was
wenzelm@44967
  1139
generalized.  Now it is defined on the type class {topological_space,
wenzelm@44967
  1140
comm_monoid_add}.  Hence it is useable also for extended real numbers.
wenzelm@42484
  1141
huffman@44908
  1142
* Theory Complex_Main: The complex exponential function "expi" is now
huffman@44908
  1143
a type-constrained abbreviation for "exp :: complex => complex"; thus
huffman@44908
  1144
several polymorphic lemmas about "exp" are now applicable to "expi".
huffman@44908
  1145
wenzelm@44968
  1146
* Code generation:
wenzelm@44968
  1147
wenzelm@44968
  1148
  - Theory Library/Code_Char_ord provides native ordering of
wenzelm@44968
  1149
    characters in the target language.
wenzelm@44968
  1150
wenzelm@44968
  1151
  - Commands code_module and code_library are legacy, use export_code
wenzelm@44968
  1152
    instead.
wenzelm@44968
  1153
wenzelm@44968
  1154
  - Method "evaluation" is legacy, use method "eval" instead.
wenzelm@44968
  1155
wenzelm@44968
  1156
  - Legacy evaluator "SML" is deactivated by default.  May be
wenzelm@44968
  1157
    reactivated by the following theory command:
wenzelm@44968
  1158
wenzelm@44968
  1159
      setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
wenzelm@44968
  1160
wenzelm@44968
  1161
* Declare ext [intro] by default.  Rare INCOMPATIBILITY.
wenzelm@44968
  1162
wenzelm@45088
  1163
* New proof method "induction" that gives induction hypotheses the
wenzelm@45088
  1164
name "IH", thus distinguishing them from further hypotheses that come
wenzelm@45088
  1165
from rule induction.  The latter are still called "hyps".  Method
wenzelm@45088
  1166
"induction" is a thin wrapper around "induct" and follows the same
wenzelm@45088
  1167
syntax.
wenzelm@45088
  1168
wenzelm@44968
  1169
* Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
wenzelm@44968
  1170
still available as a legacy feature for some time.
wenzelm@44968
  1171
wenzelm@44968
  1172
* Nitpick:
wenzelm@44968
  1173
  - Added "need" and "total_consts" options.
wenzelm@44968
  1174
  - Reintroduced "show_skolems" option by popular demand.
wenzelm@44968
  1175
  - Renamed attribute: nitpick_def ~> nitpick_unfold.
wenzelm@44968
  1176
    INCOMPATIBILITY.
wenzelm@44968
  1177
wenzelm@44968
  1178
* Sledgehammer:
wenzelm@44968
  1179
  - Use quasi-sound (and efficient) translations by default.
wenzelm@44968
  1180
  - Added support for the following provers: E-ToFoF, LEO-II,
wenzelm@44968
  1181
    Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
wenzelm@44968
  1182
  - Automatically preplay and minimize proofs before showing them if
wenzelm@44968
  1183
    this can be done within reasonable time.
wenzelm@44968
  1184
  - sledgehammer available_provers ~> sledgehammer supported_provers.
wenzelm@44968
  1185
    INCOMPATIBILITY.
wenzelm@44968
  1186
  - Added "preplay_timeout", "slicing", "type_enc", "sound",
wenzelm@44968
  1187
    "max_mono_iters", and "max_new_mono_instances" options.
wenzelm@44968
  1188
  - Removed "explicit_apply" and "full_types" options as well as "Full
wenzelm@44968
  1189
    Types" Proof General menu item. INCOMPATIBILITY.
wenzelm@44968
  1190
wenzelm@44968
  1191
* Metis:
wenzelm@44968
  1192
  - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
wenzelm@44968
  1193
  - Obsoleted "metisFT" -- use "metis (full_types)" instead.
wenzelm@44968
  1194
    INCOMPATIBILITY.
wenzelm@44968
  1195
wenzelm@44968
  1196
* Command 'try':
wenzelm@44968
  1197
  - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
wenzelm@44968
  1198
    "elim:" options. INCOMPATIBILITY.
wenzelm@44968
  1199
  - Introduced 'try' that not only runs 'try_methods' but also
wenzelm@44968
  1200
    'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
wenzelm@44968
  1201
wenzelm@44968
  1202
* Quickcheck:
wenzelm@44968
  1203
  - Added "eval" option to evaluate terms for the found counterexample
wenzelm@44968
  1204
    (currently only supported by the default (exhaustive) tester).
wenzelm@44968
  1205
  - Added post-processing of terms to obtain readable counterexamples
wenzelm@44968
  1206
    (currently only supported by the default (exhaustive) tester).
wenzelm@44968
  1207
  - New counterexample generator quickcheck[narrowing] enables
wenzelm@44968
  1208
    narrowing-based testing.  Requires the Glasgow Haskell compiler
wenzelm@44968
  1209
    with its installation location defined in the Isabelle settings
wenzelm@44968
  1210
    environment as ISABELLE_GHC.
wenzelm@44968
  1211
  - Removed quickcheck tester "SML" based on the SML code generator
wenzelm@44968
  1212
    (formly in HOL/Library).
wenzelm@44968
  1213
wenzelm@44968
  1214
* Function package: discontinued option "tailrec".  INCOMPATIBILITY,
wenzelm@44968
  1215
use 'partial_function' instead.
wenzelm@44968
  1216
wenzelm@44968
  1217
* Theory Library/Extended_Reals replaces now the positive extended
wenzelm@44968
  1218
reals found in probability theory. This file is extended by
wenzelm@44968
  1219
Multivariate_Analysis/Extended_Real_Limits.
wenzelm@44968
  1220
wenzelm@44974
  1221
* Theory Library/Old_Recdef: old 'recdef' package has been moved here,
wenzelm@44974
  1222
from where it must be imported explicitly if it is really required.
wenzelm@44974
  1223
INCOMPATIBILITY.
wenzelm@44968
  1224
wenzelm@44968
  1225
* Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
wenzelm@44968
  1226
been moved here.  INCOMPATIBILITY.
wenzelm@44968
  1227
wenzelm@44968
  1228
* Theory Library/Saturated provides type of numbers with saturated
wenzelm@44968
  1229
arithmetic.
wenzelm@44968
  1230
wenzelm@44968
  1231
* Theory Library/Product_Lattice defines a pointwise ordering for the
wenzelm@44968
  1232
product type 'a * 'b, and provides instance proofs for various order
wenzelm@44968
  1233
and lattice type classes.
wenzelm@44968
  1234
wenzelm@44968
  1235
* Theory Library/Countable now provides the "countable_datatype" proof
wenzelm@44968
  1236
method for proving "countable" class instances for datatypes.
wenzelm@44968
  1237
wenzelm@44968
  1238
* Theory Library/Cset_Monad allows do notation for computable sets
wenzelm@44968
  1239
(cset) via the generic monad ad-hoc overloading facility.
wenzelm@44968
  1240
wenzelm@44968
  1241
* Library: Theories of common data structures are split into theories
wenzelm@44968
  1242
for implementation, an invariant-ensuring type, and connection to an
wenzelm@44968
  1243
abstract type. INCOMPATIBILITY.
wenzelm@44968
  1244
wenzelm@44968
  1245
  - RBT is split into RBT and RBT_Mapping.
wenzelm@44968
  1246
  - AssocList is split and renamed into AList and AList_Mapping.
wenzelm@44968
  1247
  - DList is split into DList_Impl, DList, and DList_Cset.
wenzelm@44968
  1248
  - Cset is split into Cset and List_Cset.
wenzelm@44968
  1249
wenzelm@44968
  1250
* Theory Library/Nat_Infinity has been renamed to
wenzelm@44968
  1251
Library/Extended_Nat, with name changes of the following types and
wenzelm@44968
  1252
constants:
wenzelm@44968
  1253
wenzelm@44968
  1254
  type inat   ~> type enat
wenzelm@44968
  1255
  Fin         ~> enat
wenzelm@44968
  1256
  Infty       ~> infinity (overloaded)
wenzelm@44968
  1257
  iSuc        ~> eSuc
wenzelm@44968
  1258
  the_Fin     ~> the_enat
wenzelm@44968
  1259
wenzelm@44968
  1260
Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
wenzelm@44968
  1261
been renamed accordingly. INCOMPATIBILITY.
wenzelm@44968
  1262
wenzelm@44968
  1263
* Session Multivariate_Analysis: The euclidean_space type class now
wenzelm@44968
  1264
fixes a constant "Basis :: 'a set" consisting of the standard
wenzelm@44968
  1265
orthonormal basis for the type. Users now have the option of
wenzelm@44968
  1266
quantifying over this set instead of using the "basis" function, e.g.
wenzelm@44968
  1267
"ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
wenzelm@44968
  1268
wenzelm@44968
  1269
* Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
wenzelm@44968
  1270
to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
wenzelm@44968
  1271
"Cart_nth" and "Cart_lambda" have been respectively renamed to
wenzelm@44968
  1272
"vec_nth" and "vec_lambda"; theorems mentioning those names have
wenzelm@44968
  1273
changed to match. Definition theorems for overloaded constants now use
wenzelm@44968
  1274
the standard "foo_vec_def" naming scheme. A few other theorems have
wenzelm@44968
  1275
been renamed as follows (INCOMPATIBILITY):
wenzelm@44968
  1276
wenzelm@44968
  1277
  Cart_eq          ~> vec_eq_iff
wenzelm@44968
  1278
  dist_nth_le_cart ~> dist_vec_nth_le
wenzelm@44968
  1279
  tendsto_vector   ~> vec_tendstoI
wenzelm@44968
  1280
  Cauchy_vector    ~> vec_CauchyI
wenzelm@44968
  1281
wenzelm@44968
  1282
* Session Multivariate_Analysis: Several duplicate theorems have been
wenzelm@44968
  1283
removed, and other theorems have been renamed or replaced with more
wenzelm@44968
  1284
general versions. INCOMPATIBILITY.
wenzelm@44968
  1285
wenzelm@44968
  1286
  finite_choice ~> finite_set_choice
wenzelm@44968
  1287
  eventually_conjI ~> eventually_conj
wenzelm@44968
  1288
  eventually_and ~> eventually_conj_iff
wenzelm@44968
  1289
  eventually_false ~> eventually_False
wenzelm@44968
  1290
  setsum_norm ~> norm_setsum
wenzelm@44968
  1291
  Lim_sequentially ~> LIMSEQ_def
wenzelm@44968
  1292
  Lim_ident_at ~> LIM_ident
wenzelm@44968
  1293
  Lim_const ~> tendsto_const
wenzelm@44968
  1294
  Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
wenzelm@44968
  1295
  Lim_neg ~> tendsto_minus
wenzelm@44968
  1296
  Lim_add ~> tendsto_add
wenzelm@44968
  1297
  Lim_sub ~> tendsto_diff
wenzelm@44968
  1298
  Lim_mul ~> tendsto_scaleR
wenzelm@44968
  1299
  Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
wenzelm@44968
  1300
  Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
wenzelm@44968
  1301
  Lim_linear ~> bounded_linear.tendsto
wenzelm@44968
  1302
  Lim_component ~> tendsto_euclidean_component
wenzelm@44968
  1303
  Lim_component_cart ~> tendsto_vec_nth
wenzelm@44968
  1304
  Lim_inner ~> tendsto_inner [OF tendsto_const]
wenzelm@44968
  1305
  dot_lsum ~> inner_setsum_left
wenzelm@44968
  1306
  dot_rsum ~> inner_setsum_right
wenzelm@44968
  1307
  continuous_cmul ~> continuous_scaleR [OF continuous_const]
wenzelm@44968
  1308
  continuous_neg ~> continuous_minus
wenzelm@44968
  1309
  continuous_sub ~> continuous_diff
wenzelm@44968
  1310
  continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
wenzelm@44968
  1311
  continuous_mul ~> continuous_scaleR
wenzelm@44968
  1312
  continuous_inv ~> continuous_inverse
wenzelm@44968
  1313
  continuous_at_within_inv ~> continuous_at_within_inverse
wenzelm@44968
  1314
  continuous_at_inv ~> continuous_at_inverse
wenzelm@44968
  1315
  continuous_at_norm ~> continuous_norm [OF continuous_at_id]
wenzelm@44968
  1316
  continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
wenzelm@44968
  1317
  continuous_at_component ~> continuous_component [OF continuous_at_id]
wenzelm@44968
  1318
  continuous_on_neg ~> continuous_on_minus
wenzelm@44968
  1319
  continuous_on_sub ~> continuous_on_diff
wenzelm@44968
  1320
  continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
wenzelm@44968
  1321
  continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
wenzelm@44968
  1322
  continuous_on_mul ~> continuous_on_scaleR
wenzelm@44968
  1323
  continuous_on_mul_real ~> continuous_on_mult
wenzelm@44968
  1324
  continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
wenzelm@44968
  1325
  continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
wenzelm@44968
  1326
  continuous_on_inverse ~> continuous_on_inv
wenzelm@44968
  1327
  uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
wenzelm@44968
  1328
  uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
wenzelm@44968
  1329
  subset_interior ~> interior_mono
wenzelm@44968
  1330
  subset_closure ~> closure_mono
wenzelm@44968
  1331
  closure_univ ~> closure_UNIV
wenzelm@44968
  1332
  real_arch_lt ~> reals_Archimedean2
wenzelm@44968
  1333
  real_arch ~> reals_Archimedean3
wenzelm@44968
  1334
  real_abs_norm ~> abs_norm_cancel
wenzelm@44968
  1335
  real_abs_sub_norm ~> norm_triangle_ineq3
wenzelm@44968
  1336
  norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
wenzelm@44968
  1337
wenzelm@44968
  1338
* Session HOL-Probability:
wenzelm@44968
  1339
  - Caratheodory's extension lemma is now proved for ring_of_sets.
wenzelm@44968
  1340
  - Infinite products of probability measures are now available.
wenzelm@44968
  1341
  - Sigma closure is independent, if the generator is independent
wenzelm@44968
  1342
  - Use extended reals instead of positive extended
wenzelm@44968
  1343
    reals. INCOMPATIBILITY.
wenzelm@44968
  1344
huffman@45049
  1345
* Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
huffman@45049
  1346
huffman@45049
  1347
  expand_fun_below ~> fun_below_iff
huffman@45049
  1348
  below_fun_ext ~> fun_belowI
huffman@45049
  1349
  expand_cfun_eq ~> cfun_eq_iff
huffman@45049
  1350
  ext_cfun ~> cfun_eqI
huffman@45049
  1351
  expand_cfun_below ~> cfun_below_iff
huffman@45049
  1352
  below_cfun_ext ~> cfun_belowI
huffman@45049
  1353
  monofun_fun_fun ~> fun_belowD
huffman@45049
  1354
  monofun_fun_arg ~> monofunE
huffman@45049
  1355
  monofun_lub_fun ~> adm_monofun [THEN admD]
huffman@45049
  1356
  cont_lub_fun ~> adm_cont [THEN admD]
huffman@45049
  1357
  cont2cont_Rep_CFun ~> cont2cont_APP
huffman@45049
  1358
  cont_Rep_CFun_app ~> cont_APP_app
huffman@45049
  1359
  cont_Rep_CFun_app_app ~> cont_APP_app_app
huffman@45049
  1360
  cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
huffman@45049
  1361
  cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
huffman@45049
  1362
  contlub_cfun ~> lub_APP [symmetric]
huffman@45049
  1363
  contlub_LAM ~> lub_LAM [symmetric]
huffman@45049
  1364
  thelubI ~> lub_eqI
huffman@45049
  1365
  UU_I ~> bottomI
huffman@45049
  1366
  lift_distinct1 ~> lift.distinct(1)
huffman@45049
  1367
  lift_distinct2 ~> lift.distinct(2)
huffman@45049
  1368
  Def_not_UU ~> lift.distinct(2)
huffman@45049
  1369
  Def_inject ~> lift.inject
huffman@45049
  1370
  below_UU_iff ~> below_bottom_iff
huffman@45049
  1371
  eq_UU_iff ~> eq_bottom_iff
huffman@45049
  1372
huffman@44903
  1373
krauss@41685
  1374
*** Document preparation ***
krauss@41685
  1375
wenzelm@44800
  1376
* Antiquotation @{rail} layouts railroad syntax diagrams, see also
wenzelm@44800
  1377
isar-ref manual, both for description and actual application of the
wenzelm@44800
  1378
same.
wenzelm@44800
  1379
wenzelm@44800
  1380
* Antiquotation @{value} evaluates the given term and presents its
wenzelm@44800
  1381
result.
wenzelm@44800
  1382
wenzelm@44800
  1383
* Antiquotations: term style "isub" provides ad-hoc conversion of
wenzelm@44800
  1384
variables x1, y23 into subscripted form x\<^isub>1,
wenzelm@44800
  1385
y\<^isub>2\<^isub>3.
wenzelm@41651
  1386
wenzelm@42484
  1387
* Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
wenzelm@42484
  1388
(e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
wenzelm@42484
  1389
wenzelm@44967
  1390
* Localized \isabellestyle switch can be used within blocks or groups
wenzelm@44967
  1391
like this:
wenzelm@44967
  1392
wenzelm@44967
  1393
  \isabellestyle{it}  %preferred default
wenzelm@44967
  1394
  {\isabellestylett @{text "typewriter stuff"}}
wenzelm@44967
  1395
wenzelm@44967
  1396
* Discontinued special treatment of hard tabulators.  Implicit
wenzelm@44967
  1397
tab-width is now defined as 1.  Potential INCOMPATIBILITY for visual
wenzelm@44967
  1398
layouts.
wenzelm@44800
  1399
wenzelm@41651
  1400
wenzelm@41944
  1401
*** ML ***
wenzelm@41944
  1402
wenzelm@43731
  1403
* The inner syntax of sort/type/term/prop supports inlined YXML
wenzelm@43731
  1404
representations within quoted string tokens.  By encoding logical
wenzelm@43731
  1405
entities via Term_XML (in ML or Scala) concrete syntax can be
wenzelm@43731
  1406
bypassed, which is particularly useful for producing bits of text
wenzelm@43731
  1407
under external program control.
wenzelm@43731
  1408
wenzelm@43565
  1409
* Antiquotations for ML and document preparation are managed as theory
wenzelm@43565
  1410
data, which requires explicit setup.
wenzelm@43565
  1411
wenzelm@42897
  1412
* Isabelle_Process.is_active allows tools to check if the official
wenzelm@42897
  1413
process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
wenzelm@42897
  1414
(better known as Proof General).
wenzelm@42897
  1415
wenzelm@42360
  1416
* Structure Proof_Context follows standard naming scheme.  Old
wenzelm@42360
  1417
ProofContext is still available for some time as legacy alias.
wenzelm@42360
  1418
wenzelm@42015
  1419
* Structure Timing provides various operations for timing; supersedes
wenzelm@42015
  1420
former start_timing/end_timing etc.
wenzelm@42015
  1421
wenzelm@41944
  1422
* Path.print is the official way to show file-system paths to users
wenzelm@41944
  1423
(including quotes etc.).
wenzelm@41944
  1424
wenzelm@42056
  1425
* Inner syntax: identifiers in parse trees of generic categories
wenzelm@42056
  1426
"logic", "aprop", "idt" etc. carry position information (disguised as
wenzelm@42056
  1427
type constraints).  Occasional INCOMPATIBILITY with non-compliant
wenzelm@42057
  1428
translations that choke on unexpected type constraints.  Positions can
wenzelm@42057
  1429
be stripped in ML translations via Syntax.strip_positions /
wenzelm@42057
  1430
Syntax.strip_positions_ast, or via the syntax constant
wenzelm@42057
  1431
"_strip_positions" within parse trees.  As last resort, positions can
wenzelm@42057
  1432
be disabled via the configuration option Syntax.positions, which is
wenzelm@42057
  1433
called "syntax_positions" in Isar attribute syntax.
wenzelm@42056
  1434
wenzelm@42290
  1435
* Discontinued special status of various ML structures that contribute
wenzelm@42290
  1436
to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
wenzelm@42290
  1437
pervasive content, no inclusion in structure Syntax.  INCOMPATIBILITY,
wenzelm@42290
  1438
refer directly to Ast.Constant, Lexicon.is_identifier,
wenzelm@42290
  1439
Syntax_Trans.mk_binder_tr etc.
wenzelm@42224
  1440
wenzelm@42247
  1441
* Typed print translation: discontinued show_sorts argument, which is
wenzelm@42247
  1442
already available via context of "advanced" translation.
wenzelm@42247
  1443
wenzelm@42370
  1444
* Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
wenzelm@42370
  1445
goal states; body tactic needs to address all subgoals uniformly.
wenzelm@42370
  1446
wenzelm@42403
  1447
* Slightly more special eq_list/eq_set, with shortcut involving
wenzelm@42403
  1448
pointer equality (assumes that eq relation is reflexive).
wenzelm@42403
  1449
wenzelm@42793
  1450
* Classical tactics use proper Proof.context instead of historic types
wenzelm@42793
  1451
claset/clasimpset.  Old-style declarations like addIs, addEs, addDs
wenzelm@42793
  1452
operate directly on Proof.context.  Raw type claset retains its use as
wenzelm@42793
  1453
snapshot of the classical context, which can be recovered via
wenzelm@42793
  1454
(put_claset HOL_cs) etc.  Type clasimpset has been discontinued.
wenzelm@42793
  1455
INCOMPATIBILITY, classical tactics and derived proof methods require
wenzelm@42793
  1456
proper Proof.context.
wenzelm@42793
  1457
wenzelm@44803
  1458
wenzelm@44803
  1459
*** System ***
wenzelm@44803
  1460
wenzelm@44968
  1461
* Discontinued support for Poly/ML 5.2, which was the last version
wenzelm@44968
  1462
without proper multithreading and TimeLimit implementation.
wenzelm@44968
  1463
wenzelm@44968
  1464
* Discontinued old lib/scripts/polyml-platform, which has been
wenzelm@44968
  1465
obsolete since Isabelle2009-2.
wenzelm@44968
  1466
wenzelm@44967
  1467
* Various optional external tools are referenced more robustly and
wenzelm@44967
  1468
uniformly by explicit Isabelle settings as follows:
wenzelm@44967
  1469
wenzelm@44967
  1470
  ISABELLE_CSDP   (formerly CSDP_EXE)
wenzelm@44967
  1471
  ISABELLE_GHC    (formerly EXEC_GHC or GHC_PATH)
wenzelm@44967
  1472
  ISABELLE_OCAML  (formerly EXEC_OCAML)
wenzelm@44967
  1473
  ISABELLE_SWIPL  (formerly EXEC_SWIPL)
wenzelm@44967
  1474
  ISABELLE_YAP    (formerly EXEC_YAP)
wenzelm@44967
  1475
wenzelm@44967
  1476
Note that automated detection from the file-system or search path has
wenzelm@44967
  1477
been discontinued.  INCOMPATIBILITY.
wenzelm@44967
  1478
wenzelm@43752
  1479
* Scala layer provides JVM method invocation service for static
wenzelm@44800
  1480
methods of type (String)String, see Invoke_Scala.method in ML.  For
wenzelm@44800
  1481
example:
wenzelm@43752
  1482
wenzelm@43752
  1483
  Invoke_Scala.method "java.lang.System.getProperty" "java.home"
wenzelm@43752
  1484
wenzelm@44967
  1485
Together with YXML.string_of_body/parse_body and XML.Encode/Decode
wenzelm@44967
  1486
this allows to pass structured values between ML and Scala.
wenzelm@44800
  1487
wenzelm@44803
  1488
* The IsabelleText fonts includes some further glyphs to support the
wenzelm@44803
  1489
Prover IDE.  Potential INCOMPATIBILITY: users who happen to have
wenzelm@44803
  1490
installed a local copy (which is normally *not* required) need to
wenzelm@44803
  1491
delete or update it from ~~/lib/fonts/.
wenzelm@41944
  1492
wenzelm@41703
  1493
wenzelm@45089
  1494
wenzelm@41512
  1495
New in Isabelle2011 (January 2011)
wenzelm@41512
  1496
----------------------------------
wenzelm@37383
  1497
wenzelm@37536
  1498
*** General ***
wenzelm@37536
  1499
wenzelm@41573
  1500
* Experimental Prover IDE based on Isabelle/Scala and jEdit (see
wenzelm@41612
  1501
src/Tools/jEdit).  This also serves as IDE for Isabelle/ML, with
wenzelm@41612
  1502
useful tooltips and hyperlinks produced from its static analysis.  The
wenzelm@41612
  1503
bundled component provides an executable Isabelle tool that can be run
wenzelm@41612
  1504
like this:
wenzelm@41612
  1505
wenzelm@41612
  1506
  Isabelle2011/bin/isabelle jedit
wenzelm@41573
  1507
wenzelm@40948
  1508
* Significantly improved Isabelle/Isar implementation manual.
wenzelm@40948
  1509
wenzelm@41594
  1510
* System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
wenzelm@41595
  1511
(and thus refers to something like $HOME/.isabelle/Isabelle2011),
wenzelm@41594
  1512
while the default heap location within that directory lacks that extra
wenzelm@41594
  1513
suffix.  This isolates multiple Isabelle installations from each
wenzelm@41594
  1514
other, avoiding problems with old settings in new versions.
wenzelm@41594
  1515
INCOMPATIBILITY, need to copy/upgrade old user settings manually.
wenzelm@41594
  1516
wenzelm@40947
  1517
* Source files are always encoded as UTF-8, instead of old-fashioned
wenzelm@40947
  1518
ISO-Latin-1.  INCOMPATIBILITY.  Isabelle LaTeX documents might require
wenzelm@40948
  1519
the following package declarations:
wenzelm@40947
  1520
wenzelm@40947
  1521
  \usepackage[utf8]{inputenc}
wenzelm@40947
  1522
  \usepackage{textcomp}
wenzelm@40947
  1523
krauss@41440
  1524
* Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
wenzelm@37536
  1525
a Unicode character is treated as a single symbol, not a sequence of
wenzelm@37536
  1526
non-ASCII bytes as before.  Since Isabelle/ML string literals may
wenzelm@37536
  1527
contain symbols without further backslash escapes, Unicode can now be
wenzelm@37536
  1528
used here as well.  Recall that Symbol.explode in ML provides a
wenzelm@37536
  1529
consistent view on symbols, while raw explode (or String.explode)
wenzelm@37536
  1530
merely give a byte-oriented representation.
wenzelm@37536
  1531
wenzelm@41594
  1532
* Theory loader: source files are primarily located via the master
wenzelm@41594
  1533
directory of each theory node (where the .thy file itself resides).
wenzelm@41594
  1534
The global load path is still partially available as legacy feature.
wenzelm@41594
  1535
Minor INCOMPATIBILITY due to subtle change in file lookup: use
wenzelm@41594
  1536
explicit paths, relatively to the theory.
wenzelm@38135
  1537
wenzelm@37939
  1538
* Special treatment of ML file names has been discontinued.
wenzelm@37939
  1539
Historically, optional extensions .ML or .sml were added on demand --
wenzelm@37939
  1540
at the cost of clarity of file dependencies.  Recall that Isabelle/ML
wenzelm@37939
  1541
files exclusively use the .ML extension.  Minor INCOMPATIBILTY.
wenzelm@37939
  1542
wenzelm@38980
  1543
* Various options that affect pretty printing etc. are now properly
wenzelm@38767
  1544
handled within the context via configuration options, instead of
wenzelm@40879
  1545
unsynchronized references or print modes.  There are both ML Config.T
wenzelm@40879
  1546
entities and Isar declaration attributes to access these.
wenzelm@38767
  1547
wenzelm@39125
  1548
  ML (Config.T)                 Isar (attribute)
wenzelm@39125
  1549
wenzelm@39128
  1550
  eta_contract                  eta_contract
wenzelm@39137
  1551
  show_brackets                 show_brackets
wenzelm@39134
  1552
  show_sorts                    show_sorts
wenzelm@39134
  1553
  show_types                    show_types
wenzelm@39126
  1554
  show_question_marks           show_question_marks
wenzelm@39126
  1555
  show_consts                   show_consts
wenzelm@40879
  1556
  show_abbrevs                  show_abbrevs
wenzelm@39126
  1557
wenzelm@41379
  1558
  Syntax.ast_trace              syntax_ast_trace
wenzelm@41379
  1559
  Syntax.ast_stat               syntax_ast_stat
wenzelm@39126
  1560
  Syntax.ambiguity_level        syntax_ambiguity_level
wenzelm@39126
  1561
wenzelm@39126
  1562
  Goal_Display.goals_limit      goals_limit
wenzelm@39126
  1563
  Goal_Display.show_main_goal   show_main_goal
wenzelm@39126
  1564
wenzelm@41379
  1565
  Method.rule_trace             rule_trace
wenzelm@41379
  1566
wenzelm@39125
  1567
  Thy_Output.display            thy_output_display
wenzelm@39125
  1568
  Thy_Output.quotes             thy_output_quotes
wenzelm@39125
  1569
  Thy_Output.indent             thy_output_indent
wenzelm@39125
  1570
  Thy_Output.source             thy_output_source
wenzelm@39125
  1571
  Thy_Output.break              thy_output_break
wenzelm@39125
  1572
krauss@41440
  1573
Note that corresponding "..._default" references in ML may only be
wenzelm@38767
  1574
changed globally at the ROOT session setup, but *not* within a theory.
wenzelm@40879
  1575
The option "show_abbrevs" supersedes the former print mode
wenzelm@40879
  1576
"no_abbrevs" with inverted meaning.
wenzelm@38767
  1577
wenzelm@40878
  1578
* More systematic naming of some configuration options.
huffman@41294
  1579
INCOMPATIBILITY.
wenzelm@40878
  1580
wenzelm@40878
  1581
  trace_simp  ~>  simp_trace
wenzelm@40878
  1582
  debug_simp  ~>  simp_debug
wenzelm@40878
  1583
wenzelm@40291
  1584
* Support for real valued configuration options, using simplistic
wenzelm@40291
  1585
floating-point notation that coincides with the inner syntax for
wenzelm@40291
  1586
float_token.
wenzelm@40291
  1587
wenzelm@41594
  1588
* Support for real valued preferences (with approximative PGIP type):
wenzelm@41594
  1589
front-ends need to accept "pgint" values in float notation.
wenzelm@41594
  1590
INCOMPATIBILITY.
wenzelm@41573
  1591
wenzelm@41573
  1592
* The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
wenzelm@41573
  1593
DejaVu Sans.
wenzelm@41573
  1594
wenzelm@41594
  1595
* Discontinued support for Poly/ML 5.0 and 5.1 versions.
wenzelm@41594
  1596
wenzelm@40948
  1597
wenzelm@40948
  1598
*** Pure ***
wenzelm@40948
  1599
wenzelm@41249
  1600
* Command 'type_synonym' (with single argument) replaces somewhat
wenzelm@41249
  1601
outdated 'types', which is still available as legacy feature for some
wenzelm@41249
  1602
time.
wenzelm@41249
  1603
wenzelm@41249
  1604
* Command 'nonterminal' (with 'and' separated list of arguments)
wenzelm@41249
  1605
replaces somewhat outdated 'nonterminals'.  INCOMPATIBILITY.
wenzelm@41229
  1606
wenzelm@40965
  1607
* Command 'notepad' replaces former 'example_proof' for
wenzelm@41020
  1608
experimentation in Isar without any result.  INCOMPATIBILITY.
wenzelm@40965
  1609
ballarin@41435
  1610
* Locale interpretation commands 'interpret' and 'sublocale' accept
ballarin@41435
  1611
lists of equations to map definitions in a locale to appropriate
ballarin@41435
  1612
entities in the context of the interpretation.  The 'interpretation'
ballarin@41435
  1613
command already provided this functionality.
ballarin@41435
  1614
wenzelm@41594
  1615
* Diagnostic command 'print_dependencies' prints the locale instances
wenzelm@41594
  1616
that would be activated if the specified expression was interpreted in
wenzelm@41594
  1617
the current context.  Variant "print_dependencies!" assumes a context
wenzelm@41594
  1618
without interpretations.
ballarin@38110
  1619
ballarin@38110
  1620
* Diagnostic command 'print_interps' prints interpretations in proofs
ballarin@38110
  1621
in addition to interpretations in theories.
ballarin@38110
  1622
wenzelm@38708
  1623
* Discontinued obsolete 'global' and 'local' commands to manipulate
wenzelm@38708
  1624
the theory name space.  Rare INCOMPATIBILITY.  The ML functions
wenzelm@38708
  1625
Sign.root_path and Sign.local_path may be applied directly where this
wenzelm@38708
  1626
feature is still required for historical reasons.
wenzelm@38708
  1627
wenzelm@40948
  1628
* Discontinued obsolete 'constdefs' command.  INCOMPATIBILITY, use
haftmann@39215
  1629
'definition' instead.
haftmann@39215
  1630
wenzelm@41574
  1631
* The "prems" fact, which refers to the accidental collection of
wenzelm@41574
  1632
foundational premises in the context, is now explicitly marked as
wenzelm@41594
  1633
legacy feature and will be discontinued soon.  Consider using "assms"
wenzelm@41594
  1634
of the head statement or reference facts by explicit names.
wenzelm@41574
  1635
wenzelm@40801
  1636
* Document antiquotations @{class} and @{type} print classes and type
wenzelm@40801
  1637
constructors.
wenzelm@40801
  1638
wenzelm@40801
  1639
* Document antiquotation @{file} checks file/directory entries within
wenzelm@40801
  1640
the local file system.
haftmann@39305
  1641
ballarin@38110
  1642
haftmann@37387
  1643
*** HOL ***
haftmann@37387
  1644
wenzelm@41594
  1645
* Coercive subtyping: functions can be declared as coercions and type
wenzelm@41594
  1646
inference will add them as necessary upon input of a term.  Theory
wenzelm@41594
  1647
Complex_Main declares real :: nat => real and real :: int => real as
wenzelm@41594
  1648
coercions. A coercion function f is declared like this:
wenzelm@40939
  1649
wenzelm@40939
  1650
  declare [[coercion f]]
nipkow@40866
  1651
wenzelm@41571
  1652
To lift coercions through type constructors (e.g. from nat => real to
nipkow@40866
  1653
nat list => real list), map functions can be declared, e.g.
nipkow@40866
  1654
wenzelm@40939
  1655
  declare [[coercion_map map]]
wenzelm@40939
  1656
wenzelm@40939
  1657
Currently coercion inference is activated only in theories including
wenzelm@40939
  1658
real numbers, i.e. descendants of Complex_Main.  This is controlled by
wenzelm@41020
  1659
the configuration option "coercion_enabled", e.g. it can be enabled in
wenzelm@40939
  1660
other theories like this:
wenzelm@40939
  1661
wenzelm@40939
  1662
  declare [[coercion_enabled]]
nipkow@40866
  1663
wenzelm@41571
  1664
* Command 'partial_function' provides basic support for recursive
wenzelm@41571
  1665
function definitions over complete partial orders.  Concrete instances
krauss@40183
  1666
are provided for i) the option type, ii) tail recursion on arbitrary
wenzelm@41571
  1667
types, and iii) the heap monad of Imperative_HOL.  See
wenzelm@41571
  1668
src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
wenzelm@41571
  1669
for examples.
krauss@40183
  1670
wenzelm@41571
  1671
* Function package: f.psimps rules are no longer implicitly declared
wenzelm@41571
  1672
as [simp].  INCOMPATIBILITY.
haftmann@41398
  1673
haftmann@41398
  1674
* Datatype package: theorems generated for executable equality (class
wenzelm@41571
  1675
"eq") carry proper names and are treated as default code equations.
wenzelm@41571
  1676
wenzelm@41594
  1677
* Inductive package: now offers command 'inductive_simps' to
wenzelm@41594
  1678
automatically derive instantiated and simplified equations for
wenzelm@41594
  1679
inductive predicates, similar to 'inductive_cases'.
wenzelm@41594
  1680
wenzelm@41571
  1681
* Command 'enriched_type' allows to register properties of the
wenzelm@41571
  1682
functorial structure of types.
haftmann@39771
  1683
haftmann@39644
  1684
* Improved infrastructure for term evaluation using code generator
haftmann@39644
  1685
techniques, in particular static evaluation conversions.
haftmann@39644
  1686
wenzelm@41594
  1687
* Code generator: Scala (2.8 or higher) has been added to the target
wenzelm@41594
  1688
languages.
wenzelm@41594
  1689
haftmann@41398
  1690
* Code generator: globbing constant expressions "*" and "Theory.*"
haftmann@41398
  1691
have been replaced by the more idiomatic "_" and "Theory._".
haftmann@41398
  1692
INCOMPATIBILITY.
haftmann@41398
  1693
haftmann@41398
  1694
* Code generator: export_code without explicit file declaration prints
haftmann@41398
  1695
to standard output.  INCOMPATIBILITY.
haftmann@41398
  1696
haftmann@41398
  1697
* Code generator: do not print function definitions for case
haftmann@41398
  1698
combinators any longer.
haftmann@41398
  1699
wenzelm@41594
  1700
* Code generator: simplification with rules determined with
wenzelm@41571
  1701
src/Tools/Code/code_simp.ML and method "code_simp".
wenzelm@41571
  1702
wenzelm@41594
  1703
* Code generator for records: more idiomatic representation of record
wenzelm@40948
  1704
types.  Warning: records are not covered by ancient SML code
wenzelm@40948
  1705
generation any longer.  INCOMPATIBILITY.  In cases of need, a suitable
wenzelm@40948
  1706
rep_datatype declaration helps to succeed then:
haftmann@38537
  1707
haftmann@38537
  1708
  record 'a foo = ...
haftmann@38537
  1709
  ...
haftmann@38537
  1710
  rep_datatype foo_ext ...
haftmann@38535
  1711
wenzelm@41594
  1712
* Records: logical foundation type for records does not carry a
wenzelm@41594
  1713
'_type' suffix any longer (obsolete due to authentic syntax).
wenzelm@41594
  1714
INCOMPATIBILITY.
wenzelm@41594
  1715
haftmann@41398
  1716
* Quickcheck now by default uses exhaustive testing instead of random
wenzelm@41571
  1717
testing.  Random testing can be invoked by "quickcheck [random]",
wenzelm@41571
  1718
exhaustive testing by "quickcheck [exhaustive]".
haftmann@41398
  1719
haftmann@41398
  1720
* Quickcheck instantiates polymorphic types with small finite
haftmann@41398
  1721
datatypes by default. This enables a simple execution mechanism to
haftmann@41398
  1722
handle quantifiers and function equality over the finite datatypes.
haftmann@41398
  1723
wenzelm@41571
  1724
* Quickcheck random generator has been renamed from "code" to
wenzelm@41571
  1725
"random".  INCOMPATIBILITY.
haftmann@41398
  1726
haftmann@41398
  1727
* Quickcheck now has a configurable time limit which is set to 30
haftmann@41398
  1728
seconds by default. This can be changed by adding [timeout = n] to the
haftmann@41398
  1729
quickcheck command. The time limit for Auto Quickcheck is still set
haftmann@41398
  1730
independently.
haftmann@38461
  1731
haftmann@38461
  1732
* Quickcheck in locales considers interpretations of that locale for
haftmann@38461
  1733
counter example search.
haftmann@38461
  1734
blanchet@40059
  1735
* Sledgehammer:
wenzelm@41571
  1736
  - Added "smt" and "remote_smt" provers based on the "smt" proof
wenzelm@41571
  1737
    method. See the Sledgehammer manual for details ("isabelle doc
wenzelm@41571
  1738
    sledgehammer").
blanchet@40059
  1739
  - Renamed commands:
blanchet@40059
  1740
    sledgehammer atp_info ~> sledgehammer running_provers
blanchet@40059
  1741
    sledgehammer atp_kill ~> sledgehammer kill_provers
blanchet@40059
  1742
    sledgehammer available_atps ~> sledgehammer available_provers
blanchet@40059
  1743
    INCOMPATIBILITY.
blanchet@40059
  1744
  - Renamed options:
blanchet@40059
  1745
    sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
blanchet@40062
  1746
    sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
blanchet@40341
  1747
    sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
blanchet@40341
  1748
    (and "ms" and "min" are no longer supported)
blanchet@40341
  1749
    INCOMPATIBILITY.
blanchet@40341
  1750
blanchet@40341
  1751
* Nitpick:
blanchet@40341
  1752
  - Renamed options:
blanchet@40341
  1753
    nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
blanchet@40341
  1754
    nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
blanchet@40059
  1755
    INCOMPATIBILITY.
blanchet@40725
  1756
  - Added support for partial quotient types.
blanchet@40725
  1757
  - Added local versions of the "Nitpick.register_xxx" functions.
blanchet@40725
  1758
  - Added "whack" option.
blanchet@40725
  1759
  - Allow registration of quotient types as codatatypes.
blanchet@40725
  1760
  - Improved "merge_type_vars" option to merge more types.
blanchet@40725
  1761
  - Removed unsound "fast_descrs" option.
blanchet@40725
  1762
  - Added custom symmetry breaking for datatypes, making it possible to reach
blanchet@40725
  1763
    higher cardinalities.
blanchet@40725
  1764
  - Prevent the expansion of too large definitions.
blanchet@39957
  1765
wenzelm@41571
  1766
* Proof methods "metis" and "meson" now have configuration options
wenzelm@41571
  1767
"meson_trace", "metis_trace", and "metis_verbose" that can be enabled
wenzelm@41571
  1768
to diagnose these tools. E.g.
wenzelm@41571
  1769
wenzelm@41571
  1770
    using [[metis_trace = true]]
wenzelm@41571
  1771
haftmann@41398
  1772
* Auto Solve: Renamed "Auto Solve Direct".  The tool is now available
haftmann@41398
  1773
manually as command 'solve_direct'.
haftmann@41398
  1774
boehmes@41601
  1775
* The default SMT solver Z3 must be enabled explicitly (due to
boehmes@41601
  1776
licensing issues) by setting the environment variable
wenzelm@41603
  1777
Z3_NON_COMMERCIAL in etc/settings of the component, for example.  For
wenzelm@41603
  1778
commercial applications, the SMT solver CVC3 is provided as fall-back;
wenzelm@41603
  1779
changing the SMT solver is done via the configuration option
wenzelm@41603
  1780
"smt_solver".
boehmes@41432
  1781
boehmes@41432
  1782
* Remote SMT solvers need to be referred to by the "remote_" prefix,
wenzelm@41571
  1783
i.e. "remote_cvc3" and "remote_z3".
wenzelm@41571
  1784
wenzelm@41571
  1785
* Added basic SMT support for datatypes, records, and typedefs using
wenzelm@41571
  1786
the oracle mode (no proofs).  Direct support of pairs has been dropped
wenzelm@41571
  1787
in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
wenzelm@41571
  1788
support for a similar behavior).  Minor INCOMPATIBILITY.
boehmes@41432
  1789
boehmes@40162
  1790
* Changed SMT configuration options:
boehmes@40162
  1791
  - Renamed:
boehmes@41432
  1792
    z3_proofs ~> smt_oracle (with inverted meaning)
boehmes@40162
  1793
    z3_trace_assms ~> smt_trace_used_facts
boehmes@40162
  1794
    INCOMPATIBILITY.
boehmes@40162
  1795
  - Added:
boehmes@40424
  1796
    smt_verbose
boehmes@41432
  1797
    smt_random_seed
boehmes@40424
  1798
    smt_datatypes
boehmes@41432
  1799
    smt_infer_triggers
boehmes@41432
  1800
    smt_monomorph_limit
boehmes@40162
  1801
    cvc3_options
boehmes@41432
  1802
    remote_cvc3_options
boehmes@41432
  1803
    remote_z3_options
boehmes@40162
  1804
    yices_options
blanchet@39957
  1805
wenzelm@40948
  1806
* Boogie output files (.b2i files) need to be declared in the theory
wenzelm@40948
  1807
header.
boehmes@40580
  1808
wenzelm@41594
  1809
* Simplification procedure "list_to_set_comprehension" rewrites list
wenzelm@41594
  1810
comprehensions applied to List.set to set comprehensions.  Occasional
wenzelm@41594
  1811
INCOMPATIBILITY, may be deactivated like this:
wenzelm@41594
  1812
wenzelm@41594
  1813
  declare [[simproc del: list_to_set_comprehension]]
wenzelm@41594
  1814
wenzelm@41573
  1815
* Removed old version of primrec package.  INCOMPATIBILITY.
haftmann@41398
  1816
haftmann@41398
  1817
* Removed simplifier congruence rule of "prod_case", as has for long
haftmann@41398
  1818
been the case with "split".  INCOMPATIBILITY.
haftmann@41398
  1819
haftmann@41398
  1820
* String.literal is a type, but not a datatype.  INCOMPATIBILITY.
haftmann@41398
  1821
krauss@40388
  1822
* Removed [split_format ... and ... and ...] version of
krauss@40388
  1823
[split_format].  Potential INCOMPATIBILITY.
krauss@40388
  1824
wenzelm@41571
  1825
* Predicate "sorted" now defined inductively, with nice induction
wenzelm@41571
  1826
rules.  INCOMPATIBILITY: former sorted.simps now named sorted_simps.
haftmann@41398
  1827
haftmann@41398
  1828
* Constant "contents" renamed to "the_elem", to free the generic name
haftmann@41398
  1829
contents for other uses.  INCOMPATIBILITY.
haftmann@41398
  1830
haftmann@41398
  1831
* Renamed class eq and constant eq (for code generation) to class
haftmann@41398
  1832
equal and constant equal, plus renaming of related facts and various
haftmann@41398
  1833
tuning.  INCOMPATIBILITY.
haftmann@41398
  1834
haftmann@41398
  1835
* Dropped type classes mult_mono and mult_mono1.  INCOMPATIBILITY.
haftmann@41398
  1836
wenzelm@41571
  1837
* Removed output syntax "'a ~=> 'b" for "'a => 'b option".
wenzelm@41571
  1838
INCOMPATIBILITY.
haftmann@41398
  1839
haftmann@41398
  1840
* Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
haftmann@41398
  1841
avoid confusion with finite sets.  INCOMPATIBILITY.
haftmann@41398
  1842
haftmann@41398
  1843
* Abandoned locales equiv, congruent and congruent2 for equivalence
haftmann@41398
  1844
relations.  INCOMPATIBILITY: use equivI rather than equiv_intro (same
haftmann@41398
  1845
for congruent(2)).
haftmann@41398
  1846
haftmann@41398
  1847
* Some previously unqualified names have been qualified:
haftmann@41398
  1848
haftmann@41398
  1849
  types
haftmann@41398
  1850
    bool ~> HOL.bool
haftmann@41398
  1851
    nat ~> Nat.nat
haftmann@41398
  1852
haftmann@41398
  1853
  constants
haftmann@41398
  1854
    Trueprop ~> HOL.Trueprop
haftmann@41398
  1855
    True ~> HOL.True
haftmann@41398
  1856
    False ~> HOL.False
haftmann@41398
  1857
    op & ~> HOL.conj
haftmann@41398
  1858
    op | ~> HOL.disj
haftmann@41398
  1859
    op --> ~> HOL.implies
haftmann@41398
  1860
    op = ~> HOL.eq
haftmann@41398
  1861
    Not ~> HOL.Not
haftmann@41398
  1862
    The ~> HOL.The
haftmann@41398
  1863
    All ~> HOL.All
haftmann@41398
  1864
    Ex ~> HOL.Ex
haftmann@41398
  1865
    Ex1 ~> HOL.Ex1
haftmann@41398
  1866
    Let ~> HOL.Let
haftmann@41398
  1867
    If ~> HOL.If
haftmann@41398
  1868
    Ball ~> Set.Ball
haftmann@41398
  1869
    Bex ~> Set.Bex
haftmann@41398
  1870
    Suc ~> Nat.Suc
haftmann@41398
  1871
    Pair ~> Product_Type.Pair
haftmann@41398
  1872
    fst ~> Product_Type.fst
haftmann@41398
  1873
    snd ~> Product_Type.snd
haftmann@41398
  1874
    curry ~> Product_Type.curry
haftmann@41398
  1875
    op : ~> Set.member
haftmann@41398
  1876
    Collect ~> Set.Collect
haftmann@41398
  1877
haftmann@41398
  1878
INCOMPATIBILITY.
haftmann@41398
  1879
haftmann@41398
  1880
* More canonical naming convention for some fundamental definitions:
haftmann@41398
  1881
haftmann@41398
  1882
    bot_bool_eq ~> bot_bool_def
haftmann@41398
  1883
    top_bool_eq ~> top_bool_def
haftmann@41398
  1884
    inf_bool_eq ~> inf_bool_def
haftmann@41398
  1885
    sup_bool_eq ~> sup_bool_def
haftmann@41398
  1886
    bot_fun_eq  ~> bot_fun_def
haftmann@41398
  1887
    top_fun_eq  ~> top_fun_def
haftmann@41398
  1888
    inf_fun_eq  ~> inf_fun_def
haftmann@41398
  1889
    sup_fun_eq  ~> sup_fun_def
haftmann@41398
  1890
haftmann@41398
  1891
INCOMPATIBILITY.
haftmann@41398
  1892
haftmann@41398
  1893
* More stylized fact names:
haftmann@41398
  1894
haftmann@41398
  1895
  expand_fun_eq ~> fun_eq_iff
haftmann@41398
  1896
  expand_set_eq ~> set_eq_iff
haftmann@41398
  1897
  set_ext       ~> set_eqI
haftmann@41398
  1898
  nat_number    ~> eval_nat_numeral
haftmann@41398
  1899
haftmann@41398
  1900
INCOMPATIBILITY.
haftmann@41398
  1901
wenzelm@41571
  1902
* Refactoring of code-generation specific operations in theory List:
haftmann@41398
  1903
haftmann@41398
  1904
  constants
haftmann@41398
  1905
    null ~> List.null
haftmann@41398
  1906
haftmann@41398
  1907
  facts
haftmann@41398
  1908
    mem_iff ~> member_def
haftmann@41398
  1909
    null_empty ~> null_def
haftmann@41398
  1910
haftmann@41398
  1911
INCOMPATIBILITY.  Note that these were not supposed to be used
haftmann@41398
  1912
regularly unless for striking reasons; their main purpose was code
haftmann@41398
  1913
generation.
haftmann@41398
  1914
haftmann@41398
  1915
Various operations from the Haskell prelude are used for generating
haftmann@41398
  1916
Haskell code.
haftmann@41398
  1917
wenzelm@41571
  1918
* Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV".  Term
wenzelm@41571
  1919
"surj f" is now an abbreviation of "range f = UNIV".  The theorems
wenzelm@41571
  1920
bij_def and surj_def are unchanged.  INCOMPATIBILITY.
haftmann@41398
  1921
haftmann@41398
  1922
* Abolished some non-alphabetic type names: "prod" and "sum" replace
haftmann@41398
  1923
"*" and "+" respectively.  INCOMPATIBILITY.
haftmann@41398
  1924
haftmann@41398
  1925
* Name "Plus" of disjoint sum operator "<+>" is now hidden.  Write
wenzelm@41571
  1926
"Sum_Type.Plus" instead.
haftmann@41398
  1927
haftmann@41398
  1928
* Constant "split" has been merged with constant "prod_case"; names of
haftmann@41398
  1929
ML functions, facts etc. involving split have been retained so far,
haftmann@41398
  1930
though.  INCOMPATIBILITY.
haftmann@41398
  1931
haftmann@41398
  1932
* Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
haftmann@41398
  1933
instead.  INCOMPATIBILITY.
haftmann@41398
  1934
wenzelm@41571
  1935
* Removed lemma "Option.is_none_none" which duplicates "is_none_def".
haftmann@41398
  1936
INCOMPATIBILITY.
haftmann@41398
  1937
wenzelm@41594
  1938
* Former theory Library/Enum is now part of the HOL-Main image.
wenzelm@41594
  1939
INCOMPATIBILITY: all constants of the Enum theory now have to be
wenzelm@41594
  1940
referred to by its qualified name.
wenzelm@41594
  1941
wenzelm@41594
  1942
  enum    ~>  Enum.enum
wenzelm@41594
  1943
  nlists  ~>  Enum.nlists
wenzelm@41594
  1944
  product ~>  Enum.product
wenzelm@41594
  1945
wenzelm@41594
  1946
* Theory Library/Monad_Syntax provides do-syntax for monad types.
wenzelm@41594
  1947
Syntax in Library/State_Monad has been changed to avoid ambiguities.
wenzelm@41594
  1948
INCOMPATIBILITY.
wenzelm@41594
  1949
wenzelm@41594
  1950
* Theory Library/SetsAndFunctions has been split into
wenzelm@41594
  1951
Library/Function_Algebras and Library/Set_Algebras; canonical names
wenzelm@41594
  1952
for instance definitions for functions; various improvements.
wenzelm@41594
  1953
INCOMPATIBILITY.
wenzelm@41594
  1954
wenzelm@41594
  1955
* Theory Library/Multiset provides stable quicksort implementation of
wenzelm@41594
  1956
sort_key.
wenzelm@41594
  1957
wenzelm@41594
  1958
* Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
wenzelm@41594
  1959
INCOMPATIBILITY.
wenzelm@41594
  1960
wenzelm@41594
  1961
* Session Multivariate_Analysis: introduced a type class for euclidean
wenzelm@41594
  1962
space.  Most theorems are now stated in terms of euclidean spaces
wenzelm@41594
  1963
instead of finite cartesian products.
wenzelm@41594
  1964
wenzelm@41594
  1965
  types
wenzelm@41594
  1966
    real ^ 'n ~>  'a::real_vector
wenzelm@41594
  1967
              ~>  'a::euclidean_space
wenzelm@41594
  1968
              ~>  'a::ordered_euclidean_space
wenzelm@41594
  1969
        (depends on your needs)
wenzelm@41594
  1970
wenzelm@41594
  1971
  constants
wenzelm@41594
  1972
     _ $ _        ~> _ $$ _
wenzelm@41594
  1973
     \<chi> x. _  ~> \<chi>\<chi> x. _
wenzelm@41594
  1974
     CARD('n)     ~> DIM('a)
wenzelm@41594
  1975
wenzelm@41594
  1976
Also note that the indices are now natural numbers and not from some
wenzelm@41594
  1977
finite type. Finite cartesian products of euclidean spaces, products
wenzelm@41594
  1978
of euclidean spaces the real and complex numbers are instantiated to
wenzelm@41594
  1979
be euclidean_spaces.  INCOMPATIBILITY.
wenzelm@41594
  1980
wenzelm@41594
  1981
* Session Probability: introduced pextreal as positive extended real
wenzelm@41594
  1982
numbers.  Use pextreal as value for measures.  Introduce the
wenzelm@41594
  1983
Radon-Nikodym derivative, product spaces and Fubini's theorem for
wenzelm@41594
  1984
arbitrary sigma finite measures.  Introduces Lebesgue measure based on
wenzelm@41594
  1985
the integral in Multivariate Analysis.  INCOMPATIBILITY.
wenzelm@41594
  1986
wenzelm@41594
  1987
* Session Imperative_HOL: revamped, corrected dozens of inadequacies.
wenzelm@41594
  1988
INCOMPATIBILITY.
wenzelm@41594
  1989
wenzelm@41594
  1990
* Session SPARK (with image HOL-SPARK) provides commands to load and
wenzelm@41594
  1991
prove verification conditions generated by the SPARK Ada program
wenzelm@41594
  1992
verifier.  See also src/HOL/SPARK and src/HOL/SPARK/Examples.
berghofe@41567
  1993
huffman@40621
  1994
ballarin@41433
  1995
*** HOL-Algebra ***
ballarin@41433
  1996
ballarin@41433
  1997
* Theorems for additive ring operations (locale abelian_monoid and
ballarin@41433
  1998
descendants) are generated by interpretation from their multiplicative
ballarin@41434
  1999
counterparts.  Names (in particular theorem names) have the mandatory
ballarin@41434
  2000
qualifier 'add'.  Previous theorem names are redeclared for
ballarin@41434
  2001
compatibility.
ballarin@41434
  2002
wenzelm@41571
  2003
* Structure "int_ring" is now an abbreviation (previously a
ballarin@41434
  2004
definition).  This fits more natural with advanced interpretations.
ballarin@41433
  2005
ballarin@41433
  2006
huffman@40621
  2007
*** HOLCF ***
huffman@40621
  2008
huffman@40621
  2009
* The domain package now runs in definitional mode by default: The
wenzelm@41571
  2010
former command 'new_domain' is now called 'domain'.  To use the domain
huffman@40621
  2011
package in its original axiomatic mode, use 'domain (unsafe)'.
huffman@40621
  2012
INCOMPATIBILITY.
huffman@40621
  2013
wenzelm@41571
  2014
* The new class "domain" is now the default sort.  Class "predomain"
wenzelm@41571
  2015
is an unpointed version of "domain". Theories can be updated by
wenzelm@41571
  2016
replacing sort annotations as shown below.  INCOMPATIBILITY.
huffman@40621
  2017
huffman@40621
  2018
  'a::type ~> 'a::countable
huffman@40621
  2019
  'a::cpo  ~> 'a::predomain
huffman@40621
  2020
  'a::pcpo ~> 'a::domain
huffman@40621
  2021
wenzelm@41571
  2022
* The old type class "rep" has been superseded by class "domain".
huffman@40621
  2023
Accordingly, users of the definitional package must remove any
wenzelm@41571
  2024
"default_sort rep" declarations.  INCOMPATIBILITY.
huffman@40621
  2025
huffman@41401
  2026
* The domain package (definitional mode) now supports unpointed
huffman@41401
  2027
predomain argument types, as long as they are marked 'lazy'. (Strict
wenzelm@41571
  2028
arguments must be in class "domain".) For example, the following
huffman@41401
  2029
domain definition now works:
huffman@41401
  2030
huffman@41401
  2031
  domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
huffman@41401
  2032
huffman@41401
  2033
* Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
wenzelm@41571
  2034
instances for types from main HOL: bool, nat, int, char, 'a + 'b,
wenzelm@41571
  2035
'a option, and 'a list.  Additionally, it configures fixrec and the
wenzelm@41571
  2036
domain package to work with these types.  For example:
huffman@41401
  2037
huffman@41401
  2038
  fixrec isInl :: "('a + 'b) u -> tr"
huffman@41401
  2039
    where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
huffman@41401
  2040
huffman@41401
  2041
  domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
huffman@41401
  2042
wenzelm@41571
  2043
* The "(permissive)" option of fixrec has been replaced with a
wenzelm@41571
  2044
per-equation "(unchecked)" option. See
wenzelm@41571
  2045
src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
wenzelm@41571
  2046
wenzelm@41571
  2047
* The "bifinite" class no longer fixes a constant "approx"; the class
wenzelm@41571
  2048
now just asserts that such a function exists.  INCOMPATIBILITY.
wenzelm@41571
  2049
wenzelm@41571
  2050
* Former type "alg_defl" has been renamed to "defl".  HOLCF no longer
huffman@41287
  2051
defines an embedding of type 'a defl into udom by default; instances
wenzelm@41571
  2052
of "bifinite" and "domain" classes are available in
wenzelm@41571
  2053
src/HOL/HOLCF/Library/Defl_Bifinite.thy.
wenzelm@41571
  2054
wenzelm@41571
  2055
* The syntax "REP('a)" has been replaced with "DEFL('a)".
wenzelm@41571
  2056
wenzelm@41571
  2057
* The predicate "directed" has been removed.  INCOMPATIBILITY.
wenzelm@41571
  2058
wenzelm@41571
  2059
* The type class "finite_po" has been removed.  INCOMPATIBILITY.
wenzelm@41571
  2060
wenzelm@41571
  2061
* The function "cprod_map" has been renamed to "prod_map".
huffman@41401
  2062
INCOMPATIBILITY.
huffman@41401
  2063
huffman@41401
  2064
* The monadic bind operator on each powerdomain has new binder syntax
wenzelm@41571
  2065
similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
wenzelm@41571
  2066
"upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
huffman@41401
  2067
huffman@41401
  2068
* The infix syntax for binary union on each powerdomain has changed
wenzelm@41571
  2069
from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
wenzelm@41571
  2070
syntax.  INCOMPATIBILITY.
wenzelm@41571
  2071
wenzelm@41571
  2072
* The constant "UU" has been renamed to "bottom".  The syntax "UU" is
huffman@41429
  2073
still supported as an input translation.
huffman@41429
  2074
huffman@40621
  2075
* Renamed some theorems (the original names are also still available).
wenzelm@41571
  2076
huffman@40621
  2077
  expand_fun_below   ~> fun_below_iff
huffman@40621
  2078
  below_fun_ext      ~> fun_belowI
huffman@40621
  2079
  expand_cfun_eq     ~> cfun_eq_iff
huffman@40621
  2080
  ext_cfun           ~> cfun_eqI
huffman@40621
  2081
  expand_cfun_below  ~> cfun_below_iff
huffman@40621
  2082
  below_cfun_ext     ~> cfun_belowI
huffman@40621
  2083
  cont2cont_Rep_CFun ~> cont2cont_APP
huffman@40621
  2084
huffman@40621
  2085
* The Abs and Rep functions for various types have changed names.
wenzelm@40948
  2086
Related theorem names have also changed to match. INCOMPATIBILITY.
wenzelm@41571
  2087
huffman@40621
  2088
  Rep_CFun  ~> Rep_cfun
huffman@40621
  2089
  Abs_CFun  ~> Abs_cfun
huffman@40621
  2090
  Rep_Sprod ~> Rep_sprod
huffman@40621
  2091
  Abs_Sprod ~> Abs_sprod
huffman@40621
  2092
  Rep_Ssum  ~> Rep_ssum
huffman@40621
  2093
  Abs_Ssum  ~> Abs_ssum
huffman@40621
  2094
huffman@40621
  2095
* Lemmas with names of the form *_defined_iff or *_strict_iff have
wenzelm@41571
  2096
been renamed to *_bottom_iff.  INCOMPATIBILITY.
huffman@40621
  2097
huffman@40621
  2098
* Various changes to bisimulation/coinduction with domain package:
wenzelm@41571
  2099
wenzelm@41571
  2100
  - Definitions of "bisim" constants no longer mention definedness.
wenzelm@41571
  2101
  - With mutual recursion, "bisim" predicate is now curried.
huffman@40621
  2102
  - With mutual recursion, each type gets a separate coind theorem.
huffman@40621
  2103
  - Variable names in bisim_def and coinduct rules have changed.
wenzelm@41571
  2104
huffman@40621
  2105
INCOMPATIBILITY.
huffman@40621
  2106
wenzelm@41571
  2107
* Case combinators generated by the domain package for type "foo" are
wenzelm@41571
  2108
now named "foo_case" instead of "foo_when".  INCOMPATIBILITY.
huffman@40621
  2109
huffman@40771
  2110
* Several theorems have been renamed to more accurately reflect the
wenzelm@41571
  2111
names of constants and types involved.  INCOMPATIBILITY.
wenzelm@41571
  2112
huffman@40771
  2113
  thelub_const    ~> lub_const
huffman@40771
  2114
  lub_const       ~> is_lub_const
huffman@40771
  2115
  thelubI         ~> lub_eqI
huffman@40771
  2116
  is_lub_lub      ~> is_lubD2
huffman@40771
  2117
  lubI            ~> is_lub_lub
huffman@40771
  2118
  unique_lub      ~> is_lub_unique
huffman@40771
  2119
  is_ub_lub       ~> is_lub_rangeD1
huffman@40771
  2120
  lub_bin_chain   ~> is_lub_bin_chain
huffman@41030
  2121
  lub_fun         ~> is_lub_fun
huffman@41030
  2122
  thelub_fun      ~> lub_fun
huffman@41031
  2123
  thelub_cfun     ~> lub_cfun
huffman@40771
  2124
  thelub_Pair     ~> lub_Pair
huffman@40771
  2125
  lub_cprod       ~> is_lub_prod
huffman@40771
  2126
  thelub_cprod    ~> lub_prod
huffman@40771
  2127
  minimal_cprod   ~> minimal_prod
huffman@40771
  2128
  inst_cprod_pcpo ~> inst_prod_pcpo
huffman@41430
  2129
  UU_I            ~> bottomI
huffman@41430
  2130
  compact_UU      ~> compact_bottom
huffman@41430
  2131
  deflation_UU    ~> deflation_bottom
huffman@41430
  2132
  finite_deflation_UU ~> finite_deflation_bottom
huffman@40771
  2133
wenzelm@41571
  2134
* Many legacy theorem names have been discontinued.  INCOMPATIBILITY.
wenzelm@41571
  2135
huffman@40621
  2136
  sq_ord_less_eq_trans ~> below_eq_trans
huffman@40621
  2137
  sq_ord_eq_less_trans ~> eq_below_trans
huffman@40621
  2138
  refl_less            ~> below_refl
huffman@40621
  2139
  trans_less           ~> below_trans
huffman@40621
  2140
  antisym_less         ~> below_antisym
huffman@40621
  2141
  antisym_less_inverse ~> po_eq_conv [THEN iffD1]
huffman@40621
  2142
  box_less             ~> box_below
huffman@40621
  2143
  rev_trans_less       ~> rev_below_trans
huffman@40621
  2144
  not_less2not_eq      ~> not_below2not_eq
huffman@40621
  2145
  less_UU_iff          ~> below_UU_iff
huffman@40621
  2146
  flat_less_iff        ~> flat_below_iff
huffman@40621
  2147
  adm_less             ~> adm_below
huffman@40621
  2148
  adm_not_less         ~> adm_not_below
huffman@40621
  2149
  adm_compact_not_less ~> adm_compact_not_below
huffman@40621
  2150
  less_fun_def         ~> below_fun_def
huffman@40621
  2151
  expand_fun_less      ~> fun_below_iff
huffman@40621
  2152
  less_fun_ext         ~> fun_belowI
huffman@40621
  2153
  less_discr_def       ~> below_discr_def
huffman@40621
  2154
  discr_less_eq        ~> discr_below_eq
huffman@40621
  2155
  less_unit_def        ~> below_unit_def
huffman@40621
  2156
  less_cprod_def       ~> below_prod_def
huffman@40621
  2157
  prod_lessI           ~> prod_belowI
huffman@40621
  2158
  Pair_less_iff        ~> Pair_below_iff
huffman@40621
  2159
  fst_less_iff         ~> fst_below_iff
huffman@40621
  2160
  snd_less_iff         ~> snd_below_iff
huffman@40621
  2161
  expand_cfun_less     ~> cfun_below_iff
huffman@40621
  2162
  less_cfun_ext        ~> cfun_belowI
huffman@40621
  2163
  injection_less       ~> injection_below
huffman@40621
  2164
  less_up_def          ~> below_up_def
huffman@40621
  2165
  not_Iup_less         ~> not_Iup_below
huffman@40621
  2166
  Iup_less             ~> Iup_below
huffman@40621
  2167
  up_less              ~> up_below
huffman@40621
  2168
  Def_inject_less_eq   ~> Def_below_Def
huffman@40621
  2169
  Def_less_is_eq       ~> Def_below_iff
huffman@40621
  2170
  spair_less_iff       ~> spair_below_iff
huffman@40621
  2171
  less_sprod           ~> below_sprod
huffman@40621
  2172
  spair_less           ~> spair_below
huffman@40621
  2173
  sfst_less_iff        ~> sfst_below_iff
huffman@40621
  2174
  ssnd_less_iff        ~> ssnd_below_iff
huffman@40621
  2175
  fix_least_less       ~> fix_least_below
huffman@40621
  2176
  dist_less_one        ~> dist_below_one
huffman@40621
  2177
  less_ONE             ~> below_ONE
huffman@40621
  2178
  ONE_less_iff         ~> ONE_below_iff
huffman@40621
  2179
  less_sinlD           ~> below_sinlD
huffman@40621
  2180
  less_sinrD           ~> below_sinrD
huffman@40621
  2181
huffman@40621
  2182
wenzelm@40948
  2183
*** FOL and ZF ***
haftmann@38522
  2184
wenzelm@41310
  2185
* All constant names are now qualified internally and use proper
wenzelm@41310
  2186
identifiers, e.g. "IFOL.eq" instead of "op =".  INCOMPATIBILITY.
wenzelm@41310
  2187
haftmann@38522
  2188
wenzelm@37868
  2189
*** ML ***
wenzelm@37868
  2190
wenzelm@41594
  2191
* Antiquotation @{assert} inlines a function bool -> unit that raises
wenzelm@41594
  2192
Fail if the argument is false.  Due to inlining the source position of
wenzelm@41594
  2193
failed assertions is included in the error output.
wenzelm@41594
  2194
wenzelm@41594
  2195
* Discontinued antiquotation @{theory_ref}, which is obsolete since ML
wenzelm@41594
  2196
text is in practice always evaluated with a stable theory checkpoint.
wenzelm@41594
  2197
Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
wenzelm@41594
  2198
wenzelm@41594
  2199
* Antiquotation @{theory A} refers to theory A from the ancestry of
wenzelm@41594
  2200
the current context, not any accidental theory loader state as before.
wenzelm@41594
  2201
Potential INCOMPATIBILITY, subtle change in semantics.
wenzelm@41228
  2202
wenzelm@40956
  2203
* Syntax.pretty_priority (default 0) configures the required priority
wenzelm@40956
  2204
of pretty-printed output and thus affects insertion of parentheses.
wenzelm@40956
  2205
wenzelm@40959
  2206
* Syntax.default_root (default "any") configures the inner syntax
wenzelm@40959
  2207
category (nonterminal symbol) for parsing of terms.
wenzelm@40959
  2208
wenzelm@40722
  2209
* Former exception Library.UnequalLengths now coincides with
wenzelm@40722
  2210
ListPair.UnequalLengths.
wenzelm@40722
  2211
wenzelm@41594
  2212
* Renamed structure MetaSimplifier to Raw_Simplifier.  Note that the
wenzelm@41594
  2213
main functionality is provided by structure Simplifier.
wenzelm@41594
  2214
wenzelm@40627
  2215
* Renamed raw "explode" function to "raw_explode" to emphasize its
wenzelm@40627
  2216
meaning.  Note that internally to Isabelle, Symbol.explode is used in
wenzelm@40627
  2217
almost all situations.
wenzelm@40627
  2218
wenzelm@40318
  2219
* Discontinued obsolete function sys_error and exception SYS_ERROR.
wenzelm@40318
  2220
See implementation manual for further details on exceptions in
wenzelm@40318
  2221
Isabelle/ML.
wenzelm@40318
  2222
wenzelm@39616
  2223
* Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
wenzelm@39616
  2224
meaning.
wenzelm@39616
  2225
wenzelm@39557
  2226
* Renamed structure PureThy to Pure_Thy and moved most of its
wenzelm@39557
  2227
operations to structure Global_Theory, to emphasize that this is
wenzelm@39557
  2228
rarely-used global-only stuff.
wenzelm@39557
  2229
wenzelm@39513
  2230
* Discontinued Output.debug.  Minor INCOMPATIBILITY, use plain writeln
wenzelm@39513
  2231
instead (or tracing for high-volume output).
wenzelm@39513
  2232
wenzelm@38980
  2233
* Configuration option show_question_marks only affects regular pretty
wenzelm@38980
  2234
printing of types and terms, not raw Term.string_of_vname.
wenzelm@38980
  2235
wenzelm@39164
  2236
* ML_Context.thm and ML_Context.thms are no longer pervasive.  Rare
wenzelm@39164
  2237
INCOMPATIBILITY, superseded by static antiquotations @{thm} and
wenzelm@39164
  2238
@{thms} for most purposes.
wenzelm@39164
  2239
wenzelm@41594
  2240
* ML structure Unsynchronized is never opened, not even in Isar
wenzelm@38980
  2241
interaction mode as before.  Old Unsynchronized.set etc. have been
wenzelm@38980
  2242
discontinued -- use plain := instead.  This should be *rare* anyway,
wenzelm@38980
  2243
since modern tools always work via official context data, notably
wenzelm@38980
  2244
configuration options.
wenzelm@38980
  2245
wenzelm@39239
  2246
* Parallel and asynchronous execution requires special care concerning
wenzelm@39239
  2247
interrupts.  Structure Exn provides some convenience functions that
wenzelm@39239
  2248
avoid working directly with raw Interrupt.  User code must not absorb
wenzelm@39239
  2249
interrupts -- intermediate handling (for cleanup etc.) needs to be
wenzelm@39239
  2250
followed by re-raising of the original exception.  Another common
wenzelm@39239
  2251
source of mistakes are "handle _" patterns, which make the meaning of
wenzelm@39239
  2252
the program subject to physical effects of the environment.
wenzelm@39239
  2253
wenzelm@37868
  2254
wenzelm@37868
  2255
wenzelm@37144
  2256
New in Isabelle2009-2 (June 2010)
wenzelm@37144
  2257
---------------------------------
haftmann@33993
  2258
wenzelm@35260
  2259
*** General ***
wenzelm@35260
  2260
wenzelm@35436
  2261
* Authentic syntax for *all* logical entities (type classes, type
wenzelm@35436
  2262
constructors, term constants): provides simple and robust
wenzelm@35436
  2263
correspondence between formal entities and concrete syntax.  Within
wenzelm@35436
  2264
the parse tree / AST representations, "constants" are decorated by
wenzelm@35436
  2265
their category (class, type, const) and spelled out explicitly with
wenzelm@35436
  2266
their full internal name.
wenzelm@35436
  2267
wenzelm@35436
  2268
Substantial INCOMPATIBILITY concerning low-level syntax declarations
wenzelm@35436
  2269
and translations (translation rules and translation functions in ML).
wenzelm@35436
  2270
Some hints on upgrading:
wenzelm@35260
  2271
wenzelm@35260
  2272
  - Many existing uses of 'syntax' and 'translations' can be replaced
wenzelm@35436
  2273
    by more modern 'type_notation', 'notation' and 'abbreviation',
wenzelm@35436
  2274
    which are independent of this issue.
wenzelm@35260
  2275
wenzelm@35260
  2276
  - 'translations' require markup within the AST; the term syntax
wenzelm@35260
  2277
    provides the following special forms:
wenzelm@35260
  2278
wenzelm@35260
  2279
      CONST c   -- produces syntax version of constant c from context
wenzelm@35261
  2280
      XCONST c  -- literally c, checked as constant from context
wenzelm@35261
  2281
      c         -- literally c, if declared by 'syntax'
wenzelm@35261
  2282
wenzelm@35261
  2283
    Plain identifiers are treated as AST variables -- occasionally the
wenzelm@35261
  2284
    system indicates accidental variables via the error "rhs contains
wenzelm@35261
  2285
    extra variables".
wenzelm@35260
  2286
wenzelm@35436
  2287
    Type classes and type constructors are marked according to their
wenzelm@35436
  2288
    concrete syntax.  Some old translations rules need to be written
wenzelm@35436
  2289
    for the "type" category, using type constructor application
wenzelm@35436
  2290
    instead of pseudo-term application of the default category
wenzelm@35436
  2291
    "logic".
wenzelm@35436
  2292
wenzelm@35260
  2293
  - 'parse_translation' etc. in ML may use the following
wenzelm@35260
  2294
    antiquotations:
wenzelm@35260
  2295
wenzelm@35436
  2296
      @{class_syntax c}   -- type class c within parse tree / AST
wenzelm@35436
  2297
      @{term_syntax c}    -- type constructor c within parse tree / AST
wenzelm@35260
  2298
      @{const_syntax c}   -- ML version of "CONST c" above
wenzelm@35260
  2299
      @{syntax_const c}   -- literally c (checked wrt. 'syntax' declarations)
wenzelm@35260
  2300
wenzelm@35436
  2301
  - Literal types within 'typed_print_translations', i.e. those *not*
wenzelm@35436
  2302
    represented as pseudo-terms are represented verbatim.  Use @{class
wenzelm@35436
  2303
    c} or @{type_name c} here instead of the above syntax
wenzelm@35436
  2304
    antiquotations.
wenzelm@35436
  2305
wenzelm@35260
  2306
Note that old non-authentic syntax was based on unqualified base
wenzelm@35436
  2307
names, so all of the above "constant" names would coincide.  Recall
wenzelm@35436
  2308
that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
wenzelm@35436
  2309
diagnose syntax problems.
wenzelm@35260
  2310
wenzelm@35351
  2311
* Type constructors admit general mixfix syntax, not just infix.
wenzelm@35351
  2312
wenzelm@36508
  2313
* Concrete syntax may be attached to local entities without a proof
wenzelm@36508
  2314
body, too.  This works via regular mixfix annotations for 'fix',
wenzelm@36508
  2315
'def', 'obtain' etc. or via the explicit 'write' command, which is
wenzelm@36508
  2316
similar to the 'notation' command in theory specifications.
wenzelm@36508
  2317
wenzelm@37351
  2318
* Discontinued unnamed infix syntax (legacy feature for many years) --
wenzelm@37351
  2319
need to specify constant name and syntax separately.  Internal ML
wenzelm@37351
  2320
datatype constructors have been renamed from InfixName to Infix etc.
wenzelm@37351
  2321
Minor INCOMPATIBILITY.
wenzelm@37351
  2322
wenzelm@37351
  2323
* Schematic theorem statements need to be explicitly markup as such,
wenzelm@37351
  2324
via commands 'schematic_lemma', 'schematic_theorem',
wenzelm@37351
  2325
'schematic_corollary'.  Thus the relevance of the proof is made
wenzelm@37351
  2326
syntactically clear, which impacts performance in a parallel or
wenzelm@37351
  2327
asynchronous interactive environment.  Minor INCOMPATIBILITY.
wenzelm@37351
  2328
wenzelm@35613
  2329
* Use of cumulative prems via "!" in some proof methods has been
wenzelm@37351
  2330
discontinued (old legacy feature).
wenzelm@35613
  2331
boehmes@35979
  2332
* References 'trace_simp' and 'debug_simp' have been replaced by
wenzelm@36857
  2333
configuration options stored in the context. Enabling tracing (the
wenzelm@36857
  2334
case of debugging is similar) in proofs works via
wenzelm@36857
  2335
wenzelm@36857
  2336
  using [[trace_simp = true]]
wenzelm@36857
  2337
wenzelm@36857
  2338
Tracing is then active for all invocations of the simplifier in
wenzelm@36857
  2339
subsequent goal refinement steps. Tracing may also still be enabled or
wenzelm@40780
  2340
disabled via the ProofGeneral settings menu.
boehmes@35979
  2341
wenzelm@36177
  2342
* Separate commands 'hide_class', 'hide_type', 'hide_const',
wenzelm@36177
  2343
'hide_fact' replace the former 'hide' KIND command.  Minor
wenzelm@36177
  2344
INCOMPATIBILITY.
wenzelm@36177
  2345
wenzelm@37298
  2346
* Improved parallelism of proof term normalization: usedir -p2 -q0 is
wenzelm@37298
  2347
more efficient than combinations with -q1 or -q2.
wenzelm@37298
  2348
wenzelm@35260
  2349
haftmann@34170
  2350
*** Pure ***
haftmann@34170
  2351
wenzelm@37351
  2352
* Proofterms record type-class reasoning explicitly, using the
wenzelm@37351
  2353
"unconstrain" operation internally.  This eliminates all sort
wenzelm@37351
  2354
constraints from a theorem and proof, introducing explicit
wenzelm@37351
  2355
OFCLASS-premises.  On the proof term level, this operation is
wenzelm@37351
  2356
automatically applied at theorem boundaries, such that closed proofs
wenzelm@37351
  2357
are always free of sort constraints.  INCOMPATIBILITY for tools that
wenzelm@37351
  2358
inspect proof terms.
haftmann@36147
  2359
wenzelm@35765
  2360
* Local theory specifications may depend on extra type variables that
wenzelm@35765
  2361
are not present in the result type -- arguments TYPE('a) :: 'a itself
wenzelm@35765
  2362
are added internally.  For example:
wenzelm@35765
  2363
wenzelm@35765
  2364
  definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
wenzelm@35765
  2365
wenzelm@37351
  2366
* Predicates of locales introduced by classes carry a mandatory
wenzelm@37351
  2367
"class" prefix.  INCOMPATIBILITY.
wenzelm@37351
  2368
wenzelm@37351
  2369
* Vacuous class specifications observe default sort.  INCOMPATIBILITY.
wenzelm@37351
  2370
wenzelm@37351
  2371
* Old 'axclass' command has been discontinued.  INCOMPATIBILITY, use
wenzelm@37351
  2372
'class' instead.
wenzelm@37351
  2373
wenzelm@37351
  2374
* Command 'code_reflect' allows to incorporate generated ML code into
wenzelm@37351
  2375
runtime environment; replaces immature code_datatype antiquotation.
wenzelm@37351
  2376
INCOMPATIBILITY.
wenzelm@37351
  2377
wenzelm@37351
  2378
* Code generator: simple concept for abstract datatypes obeying
wenzelm@37351
  2379
invariants.
wenzelm@37351
  2380
wenzelm@36857
  2381
* Code generator: details of internal data cache have no impact on the
wenzelm@36857
  2382
user space functionality any longer.
wenzelm@36857
  2383
wenzelm@37351
  2384
* Methods "unfold_locales" and "intro_locales" ignore non-locale
wenzelm@37351
  2385
subgoals.  This is more appropriate for interpretations with 'where'.
wenzelm@36857
  2386
INCOMPATIBILITY.
haftmann@34170
  2387
wenzelm@36356
  2388
* Command 'example_proof' opens an empty proof body.  This allows to
wenzelm@36356
  2389
experiment with Isar, without producing any persistent result.
wenzelm@36356
  2390
wenzelm@35413
  2391
* Commands 'type_notation' and 'no_type_notation' declare type syntax
wenzelm@35413
  2392
within a local theory context, with explicit checking of the
wenzelm@35413
  2393
constructors involved (in contrast to the raw 'syntax' versions).
wenzelm@35413
  2394
wenzelm@36178
  2395
* Commands 'types' and 'typedecl' now work within a local theory
wenzelm@36178
  2396
context -- without introducing dependencies on parameters or
wenzelm@36178
  2397
assumptions, which is not possible in Isabelle/Pure.
wenzelm@35681
  2398
wenzelm@36857
  2399
* Command 'defaultsort' has been renamed to 'default_sort', it works
wenzelm@36857
  2400
within a local theory context.  Minor INCOMPATIBILITY.
wenzelm@36454
  2401
haftmann@34170
  2402
haftmann@33993
  2403
*** HOL ***
haftmann@33993
  2404
wenzelm@37351
  2405
* Command 'typedef' now works within a local theory context -- without
wenzelm@37351
  2406
introducing dependencies on parameters or assumptions, which is not
wenzelm@37351
  2407
possible in Isabelle/Pure/HOL.  Note that the logical environment may
wenzelm@37351
  2408
contain multiple interpretations of local typedefs (with different
wenzelm@37351
  2409
non-emptiness proofs), even in a global theory context.
wenzelm@37351
  2410
wenzelm@37351
  2411
* New package for quotient types.  Commands 'quotient_type' and
wenzelm@37351
  2412
'quotient_definition' may be used for defining types and constants by
wenzelm@37351
  2413
quotient constructions.  An example is the type of integers created by
wenzelm@37351
  2414
quotienting pairs of natural numbers:
wenzelm@37380
  2415
wenzelm@37351
  2416
  fun
wenzelm@37380
  2417
    intrel :: "(nat * nat) => (nat * nat) => bool"
wenzelm@37351
  2418
  where
wenzelm@37351
  2419
    "intrel (x, y) (u, v) = (x + v = u + y)"
wenzelm@37351
  2420
wenzelm@37380
  2421
  quotient_type int = "nat * nat" / intrel
wenzelm@37351
  2422
    by (auto simp add: equivp_def expand_fun_eq)
wenzelm@37380
  2423
wenzelm@37351
  2424
  quotient_definition
wenzelm@37351
  2425
    "0::int" is "(0::nat, 0::nat)"
wenzelm@37351
  2426
wenzelm@37351
  2427
The method "lifting" can be used to lift of theorems from the
wenzelm@37351
  2428
underlying "raw" type to the quotient type.  The example
wenzelm@37351
  2429
src/HOL/Quotient_Examples/FSet.thy includes such a quotient
wenzelm@37351
  2430
construction and provides a reasoning infrastructure for finite sets.
wenzelm@37351
  2431
wenzelm@37351
  2432
* Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
wenzelm@37351
  2433
clash with new theory Quotient in Main HOL.
wenzelm@37351
  2434
wenzelm@37351
  2435
* Moved the SMT binding into the main HOL session, eliminating
wenzelm@37351
  2436
separate HOL-SMT session.
wenzelm@37351
  2437
haftmann@37020
  2438
* List membership infix mem operation is only an input abbreviation.
haftmann@37020
  2439
INCOMPATIBILITY.
haftmann@37020
  2440
wenzelm@37144
  2441
* Theory Library/Word.thy has been removed.  Use library Word/Word.thy
wenzelm@37144
  2442
for future developements; former Library/Word.thy is still present in
wenzelm@37144
  2443
the AFP entry RSAPPS.
haftmann@36963
  2444
wenzelm@36857
  2445
* Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
wenzelm@36857
  2446
longer shadowed.  INCOMPATIBILITY.
haftmann@36808
  2447
huffman@36836
  2448
* Dropped theorem duplicate comp_arith; use semiring_norm instead.
huffman@36836
  2449
INCOMPATIBILITY.
huffman@36836
  2450
huffman@36836
  2451
* Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
huffman@36836
  2452
INCOMPATIBILITY.
haftmann@36714
  2453
wenzelm@36857
  2454
* Dropped normalizing_semiring etc; use the facts in semiring classes
wenzelm@36857
  2455
instead.  INCOMPATIBILITY.
wenzelm@36857
  2456
huffman@36979
  2457
* Dropped several real-specific versions of lemmas about floor and
wenzelm@37351
  2458
ceiling; use the generic lemmas from theory "Archimedean_Field"
wenzelm@37351
  2459
instead.  INCOMPATIBILITY.
huffman@36979
  2460
huffman@36979
  2461
  floor_number_of_eq         ~> floor_number_of
huffman@36979
  2462
  le_floor_eq_number_of      ~> number_of_le_floor
huffman@36979
  2463
  le_floor_eq_zero           ~> zero_le_floor
huffman@36979
  2464
  le_floor_eq_one            ~> one_le_floor
huffman@36979
  2465
  floor_less_eq_number_of    ~> floor_less_number_of
huffman@36979
  2466
  floor_less_eq_zero         ~> floor_less_zero
huffman@36979
  2467
  floor_less_eq_one          ~> floor_less_one
huffman@36979
  2468
  less_floor_eq_number_of    ~> number_of_less_floor
huffman@36979
  2469
  less_floor_eq_zero         ~> zero_less_floor
huffman@36979
  2470
  less_floor_eq_one          ~> one_less_floor
huffman@36979
  2471
  floor_le_eq_number_of      ~> floor_le_number_of
huffman@36979
  2472
  floor_le_eq_zero           ~> floor_le_zero
huffman@36979
  2473
  floor_le_eq_one            ~> floor_le_one
huffman@36979
  2474
  floor_subtract_number_of   ~> floor_diff_number_of
huffman@36979
  2475
  floor_subtract_one         ~> floor_diff_one
huffman@36979
  2476
  ceiling_number_of_eq       ~> ceiling_number_of
huffman@36979
  2477
  ceiling_le_eq_number_of    ~> ceiling_le_number_of
huffman@36979
  2478
  ceiling_le_zero_eq         ~> ceiling_le_zero
huffman@36979
  2479
  ceiling_le_eq_one          ~> ceiling_le_one
huffman@36979
  2480
  less_ceiling_eq_number_of  ~> number_of_less_ceiling
huffman@36979
  2481
  less_ceiling_eq_zero       ~> zero_less_ceiling
huffman@36979
  2482
  less_ceiling_eq_one        ~> one_less_ceiling
huffman@36979
  2483
  ceiling_less_eq_number_of  ~> ceiling_less_number_of
huffman@36979
  2484
  ceiling_less_eq_zero       ~> ceiling_less_zero
huffman@36979
  2485
  ceiling_less_eq_one        ~> ceiling_less_one
huffman@36979
  2486
  le_ceiling_eq_number_of    ~> number_of_le_ceiling
huffman@36979
  2487
  le_ceiling_eq_zero         ~> zero_le_ceiling
huffman@36979
  2488
  le_ceiling_eq_one          ~> one_le_ceiling
huffman@36979
  2489
  ceiling_subtract_number_of ~> ceiling_diff_number_of
huffman@36979
  2490
  ceiling_subtract_one       ~> ceiling_diff_one
huffman@36979
  2491
wenzelm@37144
  2492
* Theory "Finite_Set": various folding_XXX locales facilitate the
wenzelm@36857
  2493
application of the various fold combinators on finite sets.
wenzelm@36857
  2494
wenzelm@36857
  2495
* Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
wenzelm@36857
  2496
provides abstract red-black tree type which is backed by "RBT_Impl" as
wenzelm@36857
  2497
implementation.  INCOMPATIBILTY.
haftmann@36147
  2498
huffman@36830
  2499
* Theory Library/Coinductive_List has been removed -- superseded by
wenzelm@35763
  2500
AFP/thys/Coinductive.
wenzelm@35763
  2501
huffman@36829
  2502
* Theory PReal, including the type "preal" and related operations, has
huffman@36829
  2503
been removed.  INCOMPATIBILITY.
huffman@36829
  2504
wenzelm@37380
  2505
* Real: new development using Cauchy Sequences.
wenzelm@37380
  2506
wenzelm@37351
  2507
* Split off theory "Big_Operators" containing setsum, setprod,
wenzelm@37351
  2508
Inf_fin, Sup_fin, Min, Max from theory Finite_Set.  INCOMPATIBILITY.
wenzelm@36857
  2509
wenzelm@36857
  2510
* Theory "Rational" renamed to "Rat", for consistency with "Nat",
wenzelm@36857
  2511
"Int" etc.  INCOMPATIBILITY.
wenzelm@36857
  2512
wenzelm@37351
  2513
* Constant Rat.normalize needs to be qualified.  INCOMPATIBILITY.
wenzelm@37143
  2514
wenzelm@36857
  2515
* New set of rules "ac_simps" provides combined assoc / commute
wenzelm@36857
  2516
rewrites for all interpretations of the appropriate generic locales.
wenzelm@36857
  2517
wenzelm@36857
  2518
* Renamed theory "OrderedGroup" to "Groups" and split theory
wenzelm@36857
  2519
"Ring_and_Field" into theories "Rings" and "Fields"; for more
wenzelm@36857
  2520
appropriate and more consistent names suitable for name prefixes
wenzelm@36857
  2521
within the HOL theories.  INCOMPATIBILITY.
haftmann@35050
  2522
haftmann@35084
  2523
* Some generic constants have been put to appropriate theories:
wenzelm@36857
  2524
  - less_eq, less: Orderings
wenzelm@36857
  2525
  - zero, one, plus, minus, uminus, times, abs, sgn: Groups
wenzelm@36857
  2526
  - inverse, divide: Rings
haftmann@35084
  2527
INCOMPATIBILITY.
haftmann@35084
  2528
wenzelm@36857
  2529
* More consistent naming of type classes involving orderings (and
wenzelm@36857
  2530
lattices):
haftmann@35027
  2531
haftmann@35027
  2532
    lower_semilattice                   ~> semilattice_inf
haftmann@35027
  2533
    upper_semilattice                   ~> semilattice_sup
haftmann@35027
  2534
haftmann@35027
  2535
    dense_linear_order                  ~> dense_linorder
haftmann@35027
  2536
haftmann@35027
  2537
    pordered_ab_group_add               ~> ordered_ab_group_add
haftmann@35027
  2538
    pordered_ab_group_add_abs           ~> ordered_ab_group_add_abs
haftmann@35027
  2539
    pordered_ab_semigroup_add           ~> ordered_ab_semigroup_add
haftmann@35027
  2540
    pordered_ab_semigroup_add_imp_le    ~> ordered_ab_semigroup_add_imp_le
haftmann@35027
  2541
    pordered_cancel_ab_semigroup_add    ~> ordered_cancel_ab_semigroup_add
haftmann@35027
  2542
    pordered_cancel_comm_semiring       ~> ordered_cancel_comm_semiring
haftmann@35027
  2543
    pordered_cancel_semiring            ~> ordered_cancel_semiring
haftmann@35027
  2544
    pordered_comm_monoid_add            ~> ordered_comm_monoid_add
haftmann@35027
  2545
    pordered_comm_ring                  ~> ordered_comm_ring
haftmann@35027
  2546
    pordered_comm_semiring              ~> ordered_comm_semiring
haftmann@35027
  2547
    pordered_ring                       ~> ordered_ring
haftmann@35027
  2548
    pordered_ring_abs                   ~> ordered_ring_abs
haftmann@35027
  2549
    pordered_semiring                   ~> ordered_semiring
haftmann@35027
  2550
haftmann@35027
  2551
    ordered_ab_group_add                ~> linordered_ab_group_add
haftmann@35027
  2552
    ordered_ab_semigroup_add            ~> linordered_ab_semigroup_add
haftmann@35027
  2553
    ordered_cancel_ab_semigroup_add     ~> linordered_cancel_ab_semigroup_add
haftmann@35027
  2554
    ordered_comm_semiring_strict        ~> linordered_comm_semiring_strict
haftmann@35027
  2555
    ordered_field                       ~> linordered_field
haftmann@35027
  2556
    ordered_field_no_lb                 ~> linordered_field_no_lb
haftmann@35027
  2557
    ordered_field_no_ub                 ~> linordered_field_no_ub
haftmann@35027
  2558
    ordered_field_dense_linear_order    ~> dense_linordered_field
haftmann@35027
  2559
    ordered_idom                        ~> linordered_idom
haftmann@35027
  2560
    ordered_ring                        ~> linordered_ring
haftmann@35027
  2561
    ordered_ring_le_cancel_factor       ~> linordered_ring_le_cancel_factor
haftmann@35027
  2562
    ordered_ring_less_cancel_factor     ~> linordered_ring_less_cancel_factor
haftmann@35027
  2563
    ordered_ring_strict                 ~> linordered_ring_strict
haftmann@35027
  2564
    ordered_semidom                     ~> linordered_semidom
haftmann@35027
  2565
    ordered_semiring                    ~> linordered_semiring
haftmann@35027
  2566
    ordered_semiring_1                  ~> linordered_semiring_1
haftmann@35027
  2567
    ordered_semiring_1_strict           ~> linordered_semiring_1_strict
haftmann@35027
  2568
    ordered_semiring_strict             ~> linordered_semiring_strict
haftmann@35027
  2569
wenzelm@36857
  2570
  The following slightly odd type classes have been moved to a
wenzelm@37351
  2571
  separate theory Library/Lattice_Algebras:
haftmann@35032
  2572
haftmann@35032
  2573
    lordered_ab_group_add               ~> lattice_ab_group_add
haftmann@35032
  2574
    lordered_ab_group_add_abs           ~> lattice_ab_group_add_abs
haftmann@35032
  2575
    lordered_ab_group_add_meet          ~> semilattice_inf_ab_group_add
haftmann@35032
  2576
    lordered_ab_group_add_join          ~> semilattice_sup_ab_group_add
haftmann@35032
  2577
    lordered_ring                       ~> lattice_ring
haftmann@35032
  2578
haftmann@35027
  2579
INCOMPATIBILITY.
haftmann@35027
  2580
haftmann@36416
  2581
* Refined field classes:
wenzelm@36857
  2582
  - classes division_ring_inverse_zero, field_inverse_zero,
wenzelm@36857
  2583
    linordered_field_inverse_zero include rule inverse 0 = 0 --
wenzelm@36857
  2584
    subsumes former division_by_zero class;
wenzelm@36857
  2585
  - numerous lemmas have been ported from field to division_ring.
wenzelm@36857
  2586
INCOMPATIBILITY.
haftmann@36416
  2587
haftmann@36416
  2588
* Refined algebra theorem collections:
wenzelm@36857
  2589
  - dropped theorem group group_simps, use algebra_simps instead;
wenzelm@36857
  2590
  - dropped theorem group ring_simps, use field_simps instead;
wenzelm@36857
  2591
  - proper theorem collection field_simps subsumes former theorem
wenzelm@36857
  2592
    groups field_eq_simps and field_simps;
wenzelm@36857
  2593
  - dropped lemma eq_minus_self_iff which is a duplicate for
wenzelm@36857
  2594
    equal_neg_zero.
wenzelm@36857
  2595
INCOMPATIBILITY.
wenzelm@35009
  2596
wenzelm@35009
  2597
* Theory Finite_Set and List: some lemmas have been generalized from
wenzelm@34076
  2598
sets to lattices:
wenzelm@34076
  2599
haftmann@34007
  2600
  fun_left_comm_idem_inter      ~> fun_left_comm_idem_inf
haftmann@34007
  2601
  fun_left_comm_idem_union      ~> fun_left_comm_idem_sup
haftmann@34007
  2602
  inter_Inter_fold_inter        ~> inf_Inf_fold_inf
haftmann@34007
  2603
  union_Union_fold_union        ~> sup_Sup_fold_sup
haftmann@34007
  2604
  Inter_fold_inter              ~> Inf_fold_inf
haftmann@34007
  2605
  Union_fold_union              ~> Sup_fold_sup
haftmann@34007
  2606
  inter_INTER_fold_inter        ~> inf_INFI_fold_inf
haftmann@34007
  2607
  union_UNION_fold_union        ~> sup_SUPR_fold_sup
haftmann@34007
  2608
  INTER_fold_inter              ~> INFI_fold_inf
haftmann@34007
  2609
  UNION_fold_union              ~> SUPR_fold_sup
haftmann@34007
  2610
wenzelm@44973
  2611
* Theory "Complete_Lattice": lemmas top_def and bot_def have been
wenzelm@44973
  2612
replaced by the more convenient lemmas Inf_empty and Sup_empty.
wenzelm@44973
  2613
Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
wenzelm@44973
  2614
by Inf_insert and Sup_insert.  Lemmas Inf_UNIV and Sup_UNIV replace
wenzelm@44973
  2615
former Inf_Univ and Sup_Univ.  Lemmas inf_top_right and sup_bot_right
wenzelm@44973
  2616
subsume inf_top and sup_bot respectively.  INCOMPATIBILITY.
haftmann@36416
  2617
wenzelm@36857
  2618
* Reorganized theory Multiset: swapped notation of pointwise and
wenzelm@36857
  2619
multiset order:
wenzelm@37351
  2620
wenzelm@36857
  2621
  - pointwise ordering is instance of class order with standard syntax
wenzelm@36857
  2622
    <= and <;
wenzelm@36857
  2623
  - multiset ordering has syntax <=# and <#; partial order properties
wenzelm@36857
  2624
    are provided by means of interpretation with prefix
wenzelm@36857
  2625
    multiset_order;
wenzelm@36857
  2626
  - less duplication, less historical organization of sections,
wenzelm@36857
  2627
    conversion from associations lists to multisets, rudimentary code
wenzelm@36857
  2628
    generation;
wenzelm@36857
  2629
  - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
wenzelm@36857
  2630
    if needed.
wenzelm@37351
  2631
nipkow@36903
  2632
Renamed:
wenzelm@37351
  2633
wenzelm@37351
  2634
  multiset_eq_conv_count_eq  ~>  multiset_ext_iff
wenzelm@37351
  2635
  multi_count_ext  ~>  multiset_ext
wenzelm@37351
  2636
  diff_union_inverse2  ~>  diff_union_cancelR
wenzelm@37351
  2637
wenzelm@36857
  2638
INCOMPATIBILITY.
haftmann@36416
  2639
nipkow@36903
  2640
* Theory Permutation: replaced local "remove" by List.remove1.
nipkow@36903
  2641
haftmann@36416
  2642
* Code generation: ML and OCaml code is decorated with signatures.
haftmann@36416
  2643
wenzelm@35009
  2644
* Theory List: added transpose.
wenzelm@35009
  2645
huffman@35810
  2646
* Library/Nat_Bijection.thy is a collection of bijective functions
huffman@35810
  2647
between nat and other types, which supersedes the older libraries
huffman@35810
  2648
Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy.  INCOMPATIBILITY.
huffman@35810
  2649
huffman@35810
  2650
  Constants:
huffman@35810
  2651
  Nat_Int_Bij.nat2_to_nat         ~> prod_encode
huffman@35810
  2652
  Nat_Int_Bij.nat_to_nat2         ~> prod_decode
huffman@35810
  2653
  Nat_Int_Bij.int_to_nat_bij      ~> int_encode
huffman@35810
  2654
  Nat_Int_Bij.nat_to_int_bij      ~> int_decode
huffman@35810
  2655
  Countable.pair_encode           ~> prod_encode
huffman@35810
  2656
  NatIso.prod2nat                 ~> prod_encode
huffman@35810
  2657
  NatIso.nat2prod                 ~> prod_decode
huffman@35810
  2658
  NatIso.sum2nat                  ~> sum_encode
huffman@35810
  2659
  NatIso.nat2sum                  ~> sum_decode
huffman@35810
  2660
  NatIso.list2nat                 ~> list_encode
huffman@35810
  2661
  NatIso.nat2list                 ~> list_decode
huffman@35810
  2662
  NatIso.set2nat                  ~> set_encode
huffman@35810
  2663
  NatIso.nat2set                  ~> set_decode
huffman@35810
  2664
huffman@35810
  2665
  Lemmas:
huffman@35810
  2666
  Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_decode
huffman@35810
  2667
  Nat_Int_Bij.nat2_to_nat_inj     ~> inj_prod_encode
huffman@35810
  2668
  Nat_Int_Bij.nat2_to_nat_surj    ~> surj_prod_encode
huffman@35810
  2669
  Nat_Int_Bij.nat_to_nat2_inj     ~> inj_prod_decode
huffman@35810
  2670
  Nat_Int_Bij.nat_to_nat2_surj    ~> surj_prod_decode
huffman@35810
  2671
  Nat_Int_Bij.i2n_n2i_id          ~> int_encode_inverse
huffman@35810
  2672
  Nat_Int_Bij.n2i_i2n_id          ~> int_decode_inverse
huffman@35810
  2673
  Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
huffman@35810
  2674
  Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
huffman@35810
  2675
  Nat_Int_Bij.inj_nat_to_int_bij  ~> inj_int_encode
huffman@35810
  2676
  Nat_Int_Bij.inj_int_to_nat_bij  ~> inj_int_decode
huffman@35810
  2677
  Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_encode
huffman@35810
  2678
  Nat_Int_Bij.bij_int_to_nat_bij  ~> bij_int_decode
huffman@35810
  2679
blanchet@36929
  2680
* Sledgehammer:
blanchet@36929
  2681
  - Renamed ATP commands:
blanchet@36929
  2682
    atp_info     ~> sledgehammer running_atps
blanchet@36929
  2683
    atp_kill     ~> sledgehammer kill_atps
blanchet@36929
  2684
    atp_messages ~> sledgehammer messages
blanchet@36929
  2685
    atp_minimize ~> sledgehammer minimize
blanchet@36929
  2686
    print_atps   ~> sledgehammer available_atps
blanchet@36929
  2687
    INCOMPATIBILITY.
blanchet@36929
  2688
  - Added user's manual ("isabelle doc sledgehammer").
blanchet@36929
  2689
  - Added option syntax and "sledgehammer_params" to customize
blanchet@36929
  2690
    Sledgehammer's behavior.  See the manual for details.
blanchet@36929
  2691
  - Modified the Isar proof reconstruction code so that it produces
blanchet@36929
  2692
    direct proofs rather than proofs by contradiction.  (This feature
blanchet@36929
  2693
    is still experimental.)
blanchet@36929
  2694
  - Made Isar proof reconstr