NEWS
author hoelzl
Mon Apr 23 12:14:35 2012 +0200 (2012-04-23)
changeset 47694 05663f75964c
parent 47673 dd253cfa5b23
child 47702 5f9ce06f281e
child 47703 400fccb77ec8
permissions -rw-r--r--
reworked Probability theory
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
hoelzl@47694
   650
* Theory Library/Multiset: Improved code generation of multisets.
hoelzl@47694
   651
hoelzl@47694
   652
* Session HOL-Probability: Introduced the type "'a measure" to represent
hoelzl@47694
   653
measures, this replaces the records 'a algebra and 'a measure_space. The
hoelzl@47694
   654
locales based on subset_class now have two locale-parameters the space
hoelzl@47694
   655
\<Omega> and the set of measurables sets M. The product of probability spaces
hoelzl@47694
   656
uses now the same constant as the finite product of sigma-finite measure
hoelzl@47694
   657
spaces "PiM :: ('i => 'a) measure". Most constants are defined now
hoelzl@47694
   658
outside of locales and gain an additional parameter, like null_sets,
hoelzl@47694
   659
almost_eventually or \<mu>'. Measure space constructions for distributions
hoelzl@47694
   660
and densities now got their own constants distr and density. Instead of
hoelzl@47694
   661
using locales to describe measure spaces with a finite space, the
hoelzl@47694
   662
measure count_space and point_measure is introduced. INCOMPATIBILITY.
hoelzl@47694
   663
hoelzl@47694
   664
  Renamed constants:
hoelzl@47694
   665
  measure -> emeasure
hoelzl@47694
   666
  finite_measure.\<mu>' -> measure
hoelzl@47694
   667
  product_algebra_generator -> prod_algebra
hoelzl@47694
   668
  product_prob_space.emb -> prod_emb
hoelzl@47694
   669
  product_prob_space.infprod_algebra -> PiM
hoelzl@47694
   670
hoelzl@47694
   671
  Removed locales:
hoelzl@47694
   672
  completeable_measure_space
hoelzl@47694
   673
  finite_measure_space
hoelzl@47694
   674
  finite_prob_space
hoelzl@47694
   675
  finite_product_finite_prob_space
hoelzl@47694
   676
  finite_product_sigma_algebra
hoelzl@47694
   677
  finite_sigma_algebra
hoelzl@47694
   678
  measure_space
hoelzl@47694
   679
  pair_finite_prob_space
hoelzl@47694
   680
  pair_finite_sigma_algebra
hoelzl@47694
   681
  pair_finite_space
hoelzl@47694
   682
  pair_sigma_algebra
hoelzl@47694
   683
  product_sigma_algebra
hoelzl@47694
   684
hoelzl@47694
   685
  Removed constants:
hoelzl@47694
   686
  distribution -> use distr measure, or distributed predicate
hoelzl@47694
   687
  joint_distribution -> use distr measure, or distributed predicate
hoelzl@47694
   688
  product_prob_space.infprod_algebra -> use PiM
hoelzl@47694
   689
  subvimage
hoelzl@47694
   690
  image_space
hoelzl@47694
   691
  conditional_space
hoelzl@47694
   692
  pair_measure_generator
hoelzl@47694
   693
hoelzl@47694
   694
  Replacement theorems:
hoelzl@47694
   695
  sigma_algebra.measurable_sigma -> measurable_measure_of
hoelzl@47694
   696
  measure_space.additive -> emeasure_additive
hoelzl@47694
   697
  measure_space.measure_additive -> plus_emeasure
hoelzl@47694
   698
  measure_space.measure_mono -> emeasure_mono
hoelzl@47694
   699
  measure_space.measure_top -> emeasure_space
hoelzl@47694
   700
  measure_space.measure_compl -> emeasure_compl
hoelzl@47694
   701
  measure_space.measure_Diff -> emeasure_Diff
hoelzl@47694
   702
  measure_space.measure_countable_increasing -> emeasure_countable_increasing
hoelzl@47694
   703
  measure_space.continuity_from_below -> SUP_emeasure_incseq
hoelzl@47694
   704
  measure_space.measure_incseq -> incseq_emeasure
hoelzl@47694
   705
  measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
hoelzl@47694
   706
  measure_space.measure_decseq -> decseq_emeasure
hoelzl@47694
   707
  measure_space.continuity_from_above -> INF_emeasure_decseq
hoelzl@47694
   708
  measure_space.measure_insert -> emeasure_insert
hoelzl@47694
   709
  measure_space.measure_setsum -> setsum_emeasure
hoelzl@47694
   710
  measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
hoelzl@47694
   711
  finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
hoelzl@47694
   712
  measure_space.measure_setsum_split -> setsum_emeasure_cover
hoelzl@47694
   713
  measure_space.measure_subadditive -> subadditive
hoelzl@47694
   714
  measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
hoelzl@47694
   715
  measure_space.measure_eq_0 -> emeasure_eq_0
hoelzl@47694
   716
  measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
hoelzl@47694
   717
  measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
hoelzl@47694
   718
  measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
hoelzl@47694
   719
  measure_unique_Int_stable -> measure_eqI_generator_eq
hoelzl@47694
   720
  measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
hoelzl@47694
   721
  measure_space.measure_Un_null_set -> emeasure_Un_null_set
hoelzl@47694
   722
  measure_space.almost_everywhere_def -> eventually_ae_filter
hoelzl@47694
   723
  measure_space.almost_everywhere_vimage -> AE_distrD
hoelzl@47694
   724
  measure_space.measure_space_vimage -> emeasure_distr
hoelzl@47694
   725
  measure_space.AE_iff_null_set -> AE_iff_null
hoelzl@47694
   726
  measure_space.real_measure_Union -> measure_Union
hoelzl@47694
   727
  measure_space.real_measure_finite_Union -> measure_finite_Union
hoelzl@47694
   728
  measure_space.real_measure_Diff -> measure_Diff
hoelzl@47694
   729
  measure_space.real_measure_UNION -> measure_UNION
hoelzl@47694
   730
  measure_space.real_measure_subadditive -> measure_subadditive
hoelzl@47694
   731
  measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
hoelzl@47694
   732
  measure_space.real_continuity_from_below -> Lim_measure_incseq
hoelzl@47694
   733
  measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
hoelzl@47694
   734
  measure_space.real_continuity_from_above -> Lim_measure_decseq
hoelzl@47694
   735
  measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
hoelzl@47694
   736
  finite_measure.finite_measure -> finite_measure.emeasure_finite
hoelzl@47694
   737
  finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
hoelzl@47694
   738
  finite_measure.positive_measure' -> measure_nonneg
hoelzl@47694
   739
  finite_measure.real_measure -> finite_measure.emeasure_real
hoelzl@47694
   740
  finite_measure.empty_measure -> measure_empty
hoelzl@47694
   741
  finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
hoelzl@47694
   742
  finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
hoelzl@47694
   743
  finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
hoelzl@47694
   744
  finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
hoelzl@47694
   745
  measure_space.simple_integral_vimage -> simple_integral_distr
hoelzl@47694
   746
  measure_space.integrable_vimage -> integrable_distr
hoelzl@47694
   747
  measure_space.positive_integral_translated_density -> positive_integral_density
hoelzl@47694
   748
  measure_space.integral_translated_density -> integral_density
hoelzl@47694
   749
  measure_space.integral_vimage -> integral_distr
hoelzl@47694
   750
  measure_space_density -> emeasure_density
hoelzl@47694
   751
  measure_space.positive_integral_vimage -> positive_integral_distr
hoelzl@47694
   752
  measure_space.simple_function_vimage -> simple_function_comp
hoelzl@47694
   753
  measure_space.simple_integral_vimage -> simple_integral_distr
hoelzl@47694
   754
  pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
hoelzl@47694
   755
  pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
hoelzl@47694
   756
  pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
hoelzl@47694
   757
  pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
hoelzl@47694
   758
  pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
hoelzl@47694
   759
  pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
hoelzl@47694
   760
  pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
hoelzl@47694
   761
  measure_space.measure_not_negative -> emeasure_not_MInf
hoelzl@47694
   762
  pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
hoelzl@47694
   763
  pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
hoelzl@47694
   764
  pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
hoelzl@47694
   765
  pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
hoelzl@47694
   766
  pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
hoelzl@47694
   767
  pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
hoelzl@47694
   768
  pair_sigma_algebra.sets_swap -> sets_pair_swap
hoelzl@47694
   769
  finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
hoelzl@47694
   770
  Int_stable_product_algebra_generator -> positive_integral
hoelzl@47694
   771
  product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
hoelzl@47694
   772
  product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
hoelzl@47694
   773
  product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
hoelzl@47694
   774
  finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
hoelzl@47694
   775
  product_algebra_generator_der -> prod_algebra_eq_finite
hoelzl@47694
   776
  product_algebra_generator_into_space -> prod_algebra_sets_into_space
hoelzl@47694
   777
  product_sigma_algebra.product_algebra_into_space -> space_closed
hoelzl@47694
   778
  product_algebraE -> prod_algebraE_all
hoelzl@47694
   779
  product_algebraI -> sets_PiM_I_finite
hoelzl@47694
   780
  product_measure_exists -> product_sigma_finite.sigma_finite
hoelzl@47694
   781
  sets_product_algebra -> sets_PiM
hoelzl@47694
   782
  sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
hoelzl@47694
   783
  space_product_algebra -> space_PiM
hoelzl@47694
   784
  Int_stable_cuboids -> Int_stable_atLeastAtMost
hoelzl@47694
   785
  measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
hoelzl@47694
   786
  sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
hoelzl@47694
   787
  prob_space_unique_Int_stable -> measure_eqI_prob_space
hoelzl@47694
   788
  sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
hoelzl@47694
   789
  prob_space.measure_space_1 -> prob_space.emeasure_space_1
hoelzl@47694
   790
  prob_space.prob_space_vimage -> prob_space_distr
hoelzl@47694
   791
  prob_space.random_variable_restrict -> measurable_restrict
hoelzl@47694
   792
  measure_preserving -> equality "distr M N f = N" "f : measurable M N"
hoelzl@47694
   793
  measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
hoelzl@47694
   794
  measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
hoelzl@47694
   795
  product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
hoelzl@47694
   796
  product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
hoelzl@47694
   797
  finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
hoelzl@47694
   798
  product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
hoelzl@47694
   799
  product_prob_space.measurable_component -> measurable_component_singleton
hoelzl@47694
   800
  product_prob_space.measurable_emb -> measurable_prod_emb
hoelzl@47694
   801
  product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
hoelzl@47694
   802
  product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
hoelzl@47694
   803
  product_prob_space.measure_emb -> emeasure_prod_emb
hoelzl@47694
   804
  sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
hoelzl@47694
   805
  product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
hoelzl@47694
   806
  prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
hoelzl@47694
   807
  prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
hoelzl@47694
   808
  conditional_entropy_positive -> conditional_entropy_nonneg_simple
hoelzl@47694
   809
  conditional_entropy_eq -> conditional_entropy_simple_distributed
hoelzl@47694
   810
  conditional_mutual_information_eq_mutual_information -> conditional_mutual_information_eq_mutual_information_simple
hoelzl@47694
   811
  conditional_mutual_information_generic_positive -> conditional_mutual_information_nonneg_simple
hoelzl@47694
   812
  conditional_mutual_information_positive -> conditional_mutual_information_nonneg_simple
hoelzl@47694
   813
  entropy_commute -> entropy_commute_simple
hoelzl@47694
   814
  entropy_eq -> entropy_simple_distributed
hoelzl@47694
   815
  entropy_generic_eq -> entropy_simple_distributed
hoelzl@47694
   816
  entropy_positive -> entropy_nonneg_simple
hoelzl@47694
   817
  entropy_uniform_max -> entropy_uniform
hoelzl@47694
   818
  KL_eq_0 -> KL_same_eq_0
hoelzl@47694
   819
  KL_eq_0_imp -> KL_eq_0_iff_eq
hoelzl@47694
   820
  KL_ge_0 -> KL_nonneg
hoelzl@47694
   821
  mutual_information_eq -> mutual_information_simple_distributed
hoelzl@47694
   822
  mutual_information_positive -> mutual_information_nonneg_simple
hoelzl@47694
   823
wenzelm@45383
   824
* New "case_product" attribute to generate a case rule doing multiple
wenzelm@45383
   825
case distinctions at the same time.  E.g.
wenzelm@45383
   826
wenzelm@45383
   827
  list.exhaust [case_product nat.exhaust]
wenzelm@45383
   828
wenzelm@45383
   829
produces a rule which can be used to perform case distinction on both
wenzelm@45383
   830
a list and a nat.
wenzelm@45383
   831
huffman@47655
   832
* New Transfer package:
huffman@47655
   833
huffman@47655
   834
  - transfer_rule attribute: Maintains a collection of transfer rules,
huffman@47655
   835
    which relate constants at two different types. Transfer rules may
huffman@47655
   836
    relate different type instances of the same polymorphic constant,
huffman@47655
   837
    or they may relate an operation on a raw type to a corresponding
huffman@47655
   838
    operation on an abstract type (quotient or subtype). For example:
huffman@47655
   839
huffman@47655
   840
    ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
huffman@47655
   841
    (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
huffman@47655
   842
huffman@47655
   843
  - transfer method: Replaces a subgoal on abstract types with an
huffman@47655
   844
    equivalent subgoal on the corresponding raw types. Constants are
huffman@47655
   845
    replaced with corresponding ones according to the transfer rules.
huffman@47655
   846
    Goals are generalized over all free variables by default; this is
huffman@47655
   847
    necessary for variables whose types changes, but can be overridden
huffman@47655
   848
    for specific variables with e.g. 'transfer fixing: x y z'.
huffman@47659
   849
    The variant transfer' method allows replacing a subgoal with
huffman@47659
   850
    one that is logically stronger (rather than equivalent).
huffman@47655
   851
huffman@47655
   852
  - relator_eq attribute: Collects identity laws for relators of
huffman@47655
   853
    various type constructors, e.g. "list_all2 (op =) = (op =)". The
huffman@47655
   854
    transfer method uses these lemmas to infer transfer rules for
huffman@47655
   855
    non-polymorphic constants on the fly.
huffman@47655
   856
huffman@47655
   857
  - transfer_prover method: Assists with proving a transfer rule for a
huffman@47655
   858
    new constant, provided the constant is defined in terms of other
huffman@47655
   859
    constants that already have transfer rules. It should be applied
huffman@47655
   860
    after unfolding the constant definitions.
huffman@47655
   861
huffman@47655
   862
  - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
huffman@47655
   863
    from type nat to type int.
huffman@47655
   864
huffman@47655
   865
* New Lifting package:
huffman@47655
   866
huffman@47655
   867
  - lift_definition command: Defines operations on an abstract type in
huffman@47655
   868
    terms of a corresponding operation on a representation type. Example
huffman@47655
   869
    syntax:
huffman@47655
   870
huffman@47655
   871
    lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
huffman@47655
   872
      is List.insert
huffman@47655
   873
huffman@47655
   874
    Users must discharge a respectfulness proof obligation when each
huffman@47655
   875
    constant is defined. (For a type copy, i.e. a typedef with UNIV,
huffman@47655
   876
    the proof is discharged automatically.) The obligation is
huffman@47655
   877
    presented in a user-friendly, readable form; a respectfulness
huffman@47655
   878
    theorem in the standard format and a transfer rule are generated
huffman@47655
   879
    by the package.
huffman@47655
   880
huffman@47655
   881
  - Integration with code_abstype: For typedefs (e.g. subtypes
huffman@47655
   882
    corresponding to a datatype invariant, such as dlist),
huffman@47655
   883
    lift_definition generates a code certificate theorem and sets up
huffman@47655
   884
    code generation for each constant.
huffman@47655
   885
huffman@47655
   886
  - setup_lifting command: Sets up the Lifting package to work with
huffman@47655
   887
    a user-defined type. The user must provide either a quotient
huffman@47655
   888
    theorem or a type_definition theorem. The package configures
huffman@47655
   889
    transfer rules for equality and quantifiers on the type, and sets
huffman@47655
   890
    up the lift_definition command to work with the type.
huffman@47655
   891
huffman@47655
   892
  - Usage examples: See Quotient_Examples/Lift_DList.thy,
huffman@47655
   893
    Quotient_Examples/Lift_RBT.thy, Word/Word.thy and
huffman@47655
   894
    Library/Float.thy.
huffman@47655
   895
huffman@47655
   896
* Quotient package:
huffman@47655
   897
huffman@47655
   898
  - The 'quotient_type' command now supports a 'morphisms' option with
huffman@47655
   899
    rep and abs functions, similar to typedef.
huffman@47655
   900
huffman@47655
   901
  - 'quotient_type' sets up new types to work with the Lifting and
huffman@47655
   902
    Transfer packages, as with 'setup_lifting'.
huffman@47655
   903
huffman@47655
   904
  - The 'quotient_definition' command now requires the user to prove a
huffman@47655
   905
    respectfulness property at the point where the constant is
huffman@47659
   906
    defined, similar to lift_definition; INCOMPATIBILITY.
huffman@47655
   907
huffman@47655
   908
  - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
huffman@47655
   909
    accordingly, INCOMPATIBILITY.
huffman@47655
   910
wenzelm@47464
   911
* New diagnostic command 'find_unused_assms' to find potentially
wenzelm@47464
   912
superfluous assumptions in theorems using Quickcheck.
bulwahn@46591
   913
bulwahn@45759
   914
* Quickcheck:
wenzelm@47464
   915
bulwahn@45759
   916
  - Quickcheck returns variable assignments as counterexamples, which
bulwahn@45759
   917
    allows to reveal the underspecification of functions under test.
bulwahn@45759
   918
    For example, refuting "hd xs = x", it presents the variable
bulwahn@45759
   919
    assignment xs = [] and x = a1 as a counterexample, assuming that
bulwahn@45759
   920
    any property is false whenever "hd []" occurs in it.
wenzelm@47464
   921
bulwahn@45759
   922
    These counterexample are marked as potentially spurious, as
bulwahn@45759
   923
    Quickcheck also returns "xs = []" as a counterexample to the
bulwahn@45759
   924
    obvious theorem "hd xs = hd xs".
wenzelm@47464
   925
bulwahn@45759
   926
    After finding a potentially spurious counterexample, Quickcheck
bulwahn@45759
   927
    continues searching for genuine ones.
wenzelm@47464
   928
bulwahn@45759
   929
    By default, Quickcheck shows potentially spurious and genuine
wenzelm@47464
   930
    counterexamples. The option "genuine_only" sets quickcheck to only
wenzelm@47464
   931
    show genuine counterexamples.
bulwahn@45941
   932
bulwahn@45941
   933
  - The command 'quickcheck_generator' creates random and exhaustive
bulwahn@45941
   934
    value generators for a given type and operations.
wenzelm@47464
   935
bulwahn@45941
   936
    It generates values by using the operations as if they were
wenzelm@47463
   937
    constructors of that type.
bulwahn@46170
   938
bulwahn@46170
   939
  - Support for multisets.
bulwahn@46170
   940
bulwahn@46591
   941
  - Added "use_subtype" options.
wenzelm@47464
   942
bulwahn@47349
   943
  - Added "quickcheck_locale" configuration to specify how to process
bulwahn@47349
   944
    conjectures in a locale context.
bulwahn@47349
   945
blanchet@45398
   946
* Nitpick:
blanchet@45516
   947
  - Fixed infinite loop caused by the 'peephole_optim' option and
blanchet@45516
   948
    affecting 'rat' and 'real'.
blanchet@45516
   949
blanchet@45516
   950
* Sledgehammer:
blanchet@47563
   951
  - Integrated more tightly with SPASS, as described in the ITP 2012 paper "More
blanchet@47563
   952
    SPASS with Isabelle".
blanchet@47563
   953
  - Made it try "smt" as a fallback if "metis" fails or times out.
blanchet@47563
   954
  - Added support for the following provers: Alt-Ergo (via Why3 and TFF1),
blanchet@47563
   955
    iProver, iProver-Eq.
blanchet@47563
   956
  - Replaced remote E-SInE with remote Satallax in the default setup.
blanchet@47563
   957
  - Sped up the minimizer.
blanchet@46409
   958
  - Added "lam_trans", "uncurry_aliases", and "minimize" options.
blanchet@45706
   959
  - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
blanchet@46301
   960
  - Renamed "sound" option to "strict".
blanchet@45516
   961
blanchet@45516
   962
* Metis:
blanchet@45516
   963
  - Added possibility to specify lambda translations scheme as a
blanchet@46366
   964
    parenthesized argument (e.g., "by (metis (lifting) ...)").
blanchet@45398
   965
bulwahn@47197
   966
* SMT:
blanchet@47563
   967
  - Renamed "smt_fixed" option to "smt_read_only_certificates".
wenzelm@47463
   968
blanchet@46641
   969
* Command 'try0':
blanchet@46641
   970
  - Renamed from 'try_methods'. INCOMPATIBILITY.
blanchet@46641
   971
noschinl@46888
   972
* New "eventually_elim" method as a generalized variant of the
wenzelm@47464
   973
eventually_elim* rules. Supports structured proofs.
noschinl@46888
   974
wenzelm@47413
   975
* HOL/TPTP: support to parse and import TPTP problems (all languages)
wenzelm@47464
   976
into Isabelle/HOL.
wenzelm@47413
   977
blanchet@45398
   978
noschinl@45160
   979
*** FOL ***
noschinl@45160
   980
wenzelm@45383
   981
* New "case_product" attribute (see HOL).
noschinl@45160
   982
wenzelm@45109
   983
wenzelm@47463
   984
*** ZF ***
wenzelm@47463
   985
wenzelm@47463
   986
* Greater support for structured proofs involving induction or case
wenzelm@47463
   987
analysis.
wenzelm@47463
   988
wenzelm@47463
   989
* Much greater use of mathematical symbols.
wenzelm@47463
   990
wenzelm@47463
   991
* Removal of many ML theorem bindings.  INCOMPATIBILITY.
wenzelm@47463
   992
wenzelm@47463
   993
wenzelm@45128
   994
*** ML ***
wenzelm@45128
   995
wenzelm@46948
   996
* Antiquotation @{keyword "name"} produces a parser for outer syntax
wenzelm@46948
   997
from a minor keyword introduced via theory header declaration.
wenzelm@46948
   998
wenzelm@46961
   999
* Antiquotation @{command_spec "name"} produces the
wenzelm@46961
  1000
Outer_Syntax.command_spec from a major keyword introduced via theory
wenzelm@46961
  1001
header declaration; it can be passed to Outer_Syntax.command etc.
wenzelm@46961
  1002
wenzelm@46916
  1003
* Local_Theory.define no longer hard-wires default theorem name
wenzelm@46992
  1004
"foo_def", but retains the binding as given.  If that is Binding.empty
wenzelm@46992
  1005
/ Attrib.empty_binding, the result is not registered as user-level
wenzelm@46992
  1006
fact.  The Local_Theory.define_internal variant allows to specify a
wenzelm@46992
  1007
non-empty name (used for the foundation in the background theory),
wenzelm@46992
  1008
while omitting the fact binding in the user-context.  Potential
wenzelm@46992
  1009
INCOMPATIBILITY for derived definitional packages: need to specify
wenzelm@46992
  1010
naming policy for primitive definitions more explicitly.
wenzelm@46916
  1011
wenzelm@46497
  1012
* Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
wenzelm@46497
  1013
conformance with similar operations in structure Term and Logic.
wenzelm@46497
  1014
wenzelm@45592
  1015
* Antiquotation @{attributes [...]} embeds attribute source
wenzelm@45592
  1016
representation into the ML text, which is particularly useful with
wenzelm@45592
  1017
declarations like Local_Theory.note.
wenzelm@45592
  1018
wenzelm@45128
  1019
* Structure Proof_Context follows standard naming scheme.  Old
wenzelm@45128
  1020
ProofContext has been discontinued.  INCOMPATIBILITY.
wenzelm@45128
  1021
wenzelm@45293
  1022
* Refined Local_Theory.declaration {syntax, pervasive}, with subtle
wenzelm@45298
  1023
change of semantics: update is applied to auxiliary local theory
wenzelm@45293
  1024
context as well.
wenzelm@45293
  1025
wenzelm@45620
  1026
* Modernized some old-style infix operations:
wenzelm@45620
  1027
wenzelm@45620
  1028
  addeqcongs    ~> Simplifier.add_eqcong
wenzelm@45620
  1029
  deleqcongs    ~> Simplifier.del_eqcong
wenzelm@45620
  1030
  addcongs      ~> Simplifier.add_cong
wenzelm@45620
  1031
  delcongs      ~> Simplifier.del_cong
wenzelm@45625
  1032
  setmksimps    ~> Simplifier.set_mksimps
wenzelm@45625
  1033
  setmkcong     ~> Simplifier.set_mkcong
wenzelm@45625
  1034
  setmksym      ~> Simplifier.set_mksym
wenzelm@45625
  1035
  setmkeqTrue   ~> Simplifier.set_mkeqTrue
wenzelm@45625
  1036
  settermless   ~> Simplifier.set_termless
wenzelm@45625
  1037
  setsubgoaler  ~> Simplifier.set_subgoaler
wenzelm@45620
  1038
  addsplits     ~> Splitter.add_split
wenzelm@45620
  1039
  delsplits     ~> Splitter.del_split
wenzelm@45620
  1040
wenzelm@45128
  1041
wenzelm@47461
  1042
*** System ***
wenzelm@47461
  1043
wenzelm@47661
  1044
* USER_HOME settings variable points to cross-platform user home
wenzelm@47661
  1045
directory, which coincides with HOME on POSIX systems only.  Likewise,
wenzelm@47661
  1046
the Isabelle path specification "~" now expands to $USER_HOME, instead
wenzelm@47661
  1047
of former $HOME.  A different default for USER_HOME may be set
wenzelm@47661
  1048
explicitly in shell environment, before Isabelle settings are
wenzelm@47661
  1049
evaluated.  Minor INCOMPATIBILITY: need to adapt Isabelle path where
wenzelm@47661
  1050
the generic user home was intended.
wenzelm@47661
  1051
wenzelm@47464
  1052
* ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
wenzelm@47464
  1053
(not just JRE).
wenzelm@47464
  1054
wenzelm@47461
  1055
* ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
wenzelm@47461
  1056
notation, which is useful for the jEdit file browser, for example.
wenzelm@47461
  1057
wenzelm@47461
  1058
wenzelm@45109
  1059
wenzelm@44801
  1060
New in Isabelle2011-1 (October 2011)
wenzelm@44801
  1061
------------------------------------
wenzelm@41651
  1062
wenzelm@41703
  1063
*** General ***
wenzelm@41703
  1064
wenzelm@44760
  1065
* Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
wenzelm@44968
  1066
"isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
wenzelm@44760
  1067
wenzelm@44777
  1068
  - Management of multiple theory files directly from the editor
wenzelm@44760
  1069
    buffer store -- bypassing the file-system (no requirement to save
wenzelm@44760
  1070
    files for checking).
wenzelm@44760
  1071
wenzelm@44777
  1072
  - Markup of formal entities within the text buffer, with semantic
wenzelm@44760
  1073
    highlighting, tooltips and hyperlinks to jump to defining source
wenzelm@44760
  1074
    positions.
wenzelm@44760
  1075
wenzelm@44777
  1076
  - Improved text rendering, with sub/superscripts in the source
wenzelm@44777
  1077
    buffer (including support for copy/paste wrt. output panel, HTML
wenzelm@44777
  1078
    theory output and other non-Isabelle text boxes).
wenzelm@44777
  1079
wenzelm@44777
  1080
  - Refined scheduling of proof checking and printing of results,
wenzelm@44760
  1081
    based on interactive editor view.  (Note: jEdit folding and
wenzelm@44760
  1082
    narrowing allows to restrict buffer perspectives explicitly.)
wenzelm@44760
  1083
wenzelm@44777
  1084
  - Reduced CPU performance requirements, usable on machines with few
wenzelm@44760
  1085
    cores.
wenzelm@44760
  1086
wenzelm@44777
  1087
  - Reduced memory requirements due to pruning of unused document
wenzelm@44760
  1088
    versions (garbage collection).
wenzelm@44760
  1089
wenzelm@44760
  1090
See also ~~/src/Tools/jEdit/README.html for further information,
wenzelm@44760
  1091
including some remaining limitations.
wenzelm@44760
  1092
wenzelm@44800
  1093
* Theory loader: source files are exclusively located via the master
wenzelm@44800
  1094
directory of each theory node (where the .thy file itself resides).
wenzelm@44800
  1095
The global load path (such as src/HOL/Library) has been discontinued.
wenzelm@44800
  1096
Note that the path element ~~ may be used to reference theories in the
wenzelm@44800
  1097
Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
wenzelm@44800
  1098
INCOMPATIBILITY.
wenzelm@44800
  1099
wenzelm@41955
  1100
* Theory loader: source files are identified by content via SHA1
wenzelm@41955
  1101
digests.  Discontinued former path/modtime identification and optional
wenzelm@41955
  1102
ISABELLE_FILE_IDENT plugin scripts.
wenzelm@41955
  1103
wenzelm@41703
  1104
* Parallelization of nested Isar proofs is subject to
wenzelm@41703
  1105
Goal.parallel_proofs_threshold (default 100).  See also isabelle
wenzelm@41703
  1106
usedir option -Q.
wenzelm@41703
  1107
wenzelm@42669
  1108
* Name space: former unsynchronized references are now proper
wenzelm@42669
  1109
configuration options, with more conventional names:
wenzelm@42669
  1110
wenzelm@42669
  1111
  long_names   ~> names_long
wenzelm@42669
  1112
  short_names  ~> names_short
wenzelm@42669
  1113
  unique_names ~> names_unique
wenzelm@42669
  1114
wenzelm@42669
  1115
Minor INCOMPATIBILITY, need to declare options in context like this:
wenzelm@42669
  1116
wenzelm@42669
  1117
  declare [[names_unique = false]]
wenzelm@42358
  1118
wenzelm@42502
  1119
* Literal facts `prop` may contain dummy patterns, e.g. `_ = _`.  Note
wenzelm@42502
  1120
that the result needs to be unique, which means fact specifications
wenzelm@42502
  1121
may have to be refined after enriching a proof context.
wenzelm@42502
  1122
wenzelm@44800
  1123
* Attribute "case_names" has been refined: the assumptions in each case
wenzelm@44800
  1124
can be named now by following the case name with [name1 name2 ...].
wenzelm@44800
  1125
wenzelm@44968
  1126
* Isabelle/Isar reference manual has been updated and extended:
wenzelm@44968
  1127
  - "Synopsis" provides a catalog of main Isar language concepts.
wenzelm@44968
  1128
  - Formal references in syntax diagrams, via @{rail} antiquotation.
wenzelm@44968
  1129
  - Updated material from classic "ref" manual, notably about
wenzelm@44968
  1130
    "Classical Reasoner".
wenzelm@42633
  1131
wenzelm@41703
  1132
blanchet@41727
  1133
*** HOL ***
blanchet@41727
  1134
wenzelm@44968
  1135
* Class bot and top require underlying partial order rather than
wenzelm@44800
  1136
preorder: uniqueness of bot and top is guaranteed.  INCOMPATIBILITY.
haftmann@43815
  1137
haftmann@43940
  1138
* Class complete_lattice: generalized a couple of lemmas from sets;
wenzelm@44800
  1139
generalized theorems INF_cong and SUP_cong.  New type classes for
wenzelm@44800
  1140
complete boolean algebras and complete linear orders.  Lemmas
wenzelm@44800
  1141
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
wenzelm@44800
  1142
class complete_linorder.
wenzelm@44800
  1143
wenzelm@44800
  1144
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
wenzelm@44800
  1145
Sup_fun_def, Inf_apply, Sup_apply.
wenzelm@44800
  1146
wenzelm@45088
  1147
Removed redundant lemmas (the right hand side gives hints how to
wenzelm@45088
  1148
replace them for (metis ...), or (simp only: ...) proofs):
hoelzl@45041
  1149
hoelzl@45041
  1150
  Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
hoelzl@45041
  1151
  Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
hoelzl@45041
  1152
  Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
hoelzl@45041
  1153
  Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
hoelzl@45041
  1154
  Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
hoelzl@45041
  1155
  Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
hoelzl@45041
  1156
  Inter_def ~> INF_def, image_def
hoelzl@45041
  1157
  Union_def ~> SUP_def, image_def
hoelzl@45041
  1158
  INT_eq ~> INF_def, and image_def
hoelzl@45041
  1159
  UN_eq ~> SUP_def, and image_def
hoelzl@45041
  1160
  INF_subset ~> INF_superset_mono [OF _ order_refl]
wenzelm@44800
  1161
wenzelm@44800
  1162
More consistent and comprehensive names:
wenzelm@44800
  1163
hoelzl@45041
  1164
  INTER_eq_Inter_image ~> INF_def
hoelzl@45041
  1165
  UNION_eq_Union_image ~> SUP_def
haftmann@43872
  1166
  INFI_def ~> INF_def
haftmann@43872
  1167
  SUPR_def ~> SUP_def
haftmann@44103
  1168
  INF_leI ~> INF_lower
haftmann@44103
  1169
  INF_leI2 ~> INF_lower2
haftmann@44103
  1170
  le_INFI ~> INF_greatest
haftmann@44103
  1171
  le_SUPI ~> SUP_upper
haftmann@44103
  1172
  le_SUPI2 ~> SUP_upper2
haftmann@44103
  1173
  SUP_leI ~> SUP_least
haftmann@43873
  1174
  INFI_bool_eq ~> INF_bool_eq
haftmann@43873
  1175
  SUPR_bool_eq ~> SUP_bool_eq
haftmann@43873
  1176
  INFI_apply ~> INF_apply
haftmann@43873
  1177
  SUPR_apply ~> SUP_apply
haftmann@44103
  1178
  INTER_def ~> INTER_eq
haftmann@44103
  1179
  UNION_def ~> UNION_eq
haftmann@44103
  1180
haftmann@43865
  1181
INCOMPATIBILITY.
haftmann@43865
  1182
wenzelm@44973
  1183
* Renamed theory Complete_Lattice to Complete_Lattices.
wenzelm@44973
  1184
INCOMPATIBILITY.
wenzelm@44973
  1185
wenzelm@44973
  1186
* Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
wenzelm@44973
  1187
INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
wenzelm@44973
  1188
Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
wenzelm@44973
  1189
Sup_insert are now declared as [simp].  INCOMPATIBILITY.
wenzelm@44973
  1190
wenzelm@44973
  1191
* Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
wenzelm@44973
  1192
compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
wenzelm@44973
  1193
sup_inf_absob, sup_left_idem are now declared as [simp].  Minor
wenzelm@44973
  1194
INCOMPATIBILITY.
wenzelm@44973
  1195
krauss@44845
  1196
* Added syntactic classes "inf" and "sup" for the respective
krauss@44845
  1197
constants.  INCOMPATIBILITY: Changes in the argument order of the
krauss@44845
  1198
(mostly internal) locale predicates for some derived classes.
krauss@44845
  1199
wenzelm@44800
  1200
* Theorem collections ball_simps and bex_simps do not contain theorems
wenzelm@44800
  1201
referring to UNION any longer; these have been moved to collection
wenzelm@44800
  1202
UN_ball_bex_simps.  INCOMPATIBILITY.
wenzelm@44800
  1203
wenzelm@44800
  1204
* Theory Archimedean_Field: floor now is defined as parameter of a
wenzelm@44800
  1205
separate type class floor_ceiling.
wenzelm@44800
  1206
wenzelm@44800
  1207
* Theory Finite_Set: more coherent development of fold_set locales:
haftmann@42874
  1208
haftmann@42874
  1209
    locale fun_left_comm ~> locale comp_fun_commute
haftmann@42874
  1210
    locale fun_left_comm_idem ~> locale comp_fun_idem
wenzelm@44800
  1211
wenzelm@44800
  1212
Both use point-free characterization; interpretation proofs may need
wenzelm@44800
  1213
adjustment.  INCOMPATIBILITY.
haftmann@42874
  1214
wenzelm@44800
  1215
* Theory Limits: Type "'a net" has been renamed to "'a filter", in
huffman@44081
  1216
accordance with standard mathematical terminology. INCOMPATIBILITY.
huffman@44081
  1217
wenzelm@44800
  1218
* Theory Complex_Main: The locale interpretations for the
wenzelm@44800
  1219
bounded_linear and bounded_bilinear locales have been removed, in
wenzelm@44800
  1220
order to reduce the number of duplicate lemmas. Users must use the
wenzelm@44800
  1221
original names for distributivity theorems, potential INCOMPATIBILITY.
huffman@44282
  1222
huffman@44282
  1223
  divide.add ~> add_divide_distrib
huffman@44282
  1224
  divide.diff ~> diff_divide_distrib
huffman@44282
  1225
  divide.setsum ~> setsum_divide_distrib
huffman@44282
  1226
  mult.add_right ~> right_distrib
huffman@44282
  1227
  mult.diff_right ~> right_diff_distrib
huffman@44282
  1228
  mult_right.setsum ~> setsum_right_distrib
huffman@44282
  1229
  mult_left.diff ~> left_diff_distrib
huffman@44282
  1230
wenzelm@44800
  1231
* Theory Complex_Main: Several redundant theorems have been removed or
huffman@44568
  1232
replaced by more general versions. INCOMPATIBILITY.
huffman@44522
  1233
huffman@45051
  1234
  real_diff_def ~> minus_real_def
huffman@45051
  1235
  real_divide_def ~> divide_real_def
huffman@45051
  1236
  real_less_def ~> less_le
huffman@45051
  1237
  real_abs_def ~> abs_real_def
huffman@45051
  1238
  real_sgn_def ~> sgn_real_def
huffman@45051
  1239
  real_mult_commute ~> mult_commute
huffman@45051
  1240
  real_mult_assoc ~> mult_assoc
huffman@45051
  1241
  real_mult_1 ~> mult_1_left
huffman@45051
  1242
  real_add_mult_distrib ~> left_distrib
huffman@45051
  1243
  real_zero_not_eq_one ~> zero_neq_one
huffman@45051
  1244
  real_mult_inverse_left ~> left_inverse
huffman@45051
  1245
  INVERSE_ZERO ~> inverse_zero
huffman@45051
  1246
  real_le_refl ~> order_refl
huffman@45051
  1247
  real_le_antisym ~> order_antisym
huffman@45051
  1248
  real_le_trans ~> order_trans
huffman@45051
  1249
  real_le_linear ~> linear
huffman@45051
  1250
  real_le_eq_diff ~> le_iff_diff_le_0
huffman@45051
  1251
  real_add_left_mono ~> add_left_mono
huffman@45051
  1252
  real_mult_order ~> mult_pos_pos
huffman@45051
  1253
  real_mult_less_mono2 ~> mult_strict_left_mono
huffman@44822
  1254
  real_of_int_real_of_nat ~> real_of_int_of_nat_eq
huffman@44522
  1255
  real_0_le_divide_iff ~> zero_le_divide_iff
huffman@44522
  1256
  realpow_two_disj ~> power2_eq_iff
huffman@44522
  1257
  real_squared_diff_one_factored ~> square_diff_one_factored
huffman@44522
  1258
  realpow_two_diff ~> square_diff_square_factored
huffman@44669
  1259
  reals_complete2 ~> complete_real
huffman@44749
  1260
  real_sum_squared_expand ~> power2_sum
huffman@44522
  1261
  exp_ln_eq ~> ln_unique
huffman@44711
  1262
  expi_add ~> exp_add
huffman@44711
  1263
  expi_zero ~> exp_zero
huffman@44522
  1264
  lemma_DERIV_subst ~> DERIV_cong
huffman@44568
  1265
  LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
huffman@44568
  1266
  LIMSEQ_const ~> tendsto_const
huffman@44568
  1267
  LIMSEQ_norm ~> tendsto_norm
huffman@44568
  1268
  LIMSEQ_add ~> tendsto_add
huffman@44568
  1269
  LIMSEQ_minus ~> tendsto_minus
huffman@44568
  1270
  LIMSEQ_minus_cancel ~> tendsto_minus_cancel
huffman@44568
  1271
  LIMSEQ_diff ~> tendsto_diff
huffman@44568
  1272
  bounded_linear.LIMSEQ ~> bounded_linear.tendsto
huffman@44568
  1273
  bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
huffman@44568
  1274
  LIMSEQ_mult ~> tendsto_mult
huffman@44568
  1275
  LIMSEQ_inverse ~> tendsto_inverse
huffman@44568
  1276
  LIMSEQ_divide ~> tendsto_divide
huffman@44568
  1277
  LIMSEQ_pow ~> tendsto_power
huffman@44568
  1278
  LIMSEQ_setsum ~> tendsto_setsum
huffman@44568
  1279
  LIMSEQ_setprod ~> tendsto_setprod
huffman@44568
  1280
  LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
huffman@44568
  1281
  LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
huffman@44568
  1282
  LIMSEQ_imp_rabs ~> tendsto_rabs
huffman@44710
  1283
  LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
huffman@44710
  1284
  LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
huffman@44710
  1285
  LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
huffman@44748
  1286
  LIMSEQ_Complex ~> tendsto_Complex
huffman@44568
  1287
  LIM_ident ~> tendsto_ident_at
huffman@44568
  1288
  LIM_const ~> tendsto_const
huffman@44568
  1289
  LIM_add ~> tendsto_add
huffman@44568
  1290
  LIM_add_zero ~> tendsto_add_zero
huffman@44568
  1291
  LIM_minus ~> tendsto_minus
huffman@44568
  1292
  LIM_diff ~> tendsto_diff
huffman@44568
  1293
  LIM_norm ~> tendsto_norm
huffman@44568
  1294
  LIM_norm_zero ~> tendsto_norm_zero
huffman@44568
  1295
  LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
huffman@44568
  1296
  LIM_norm_zero_iff ~> tendsto_norm_zero_iff
huffman@44568
  1297
  LIM_rabs ~> tendsto_rabs
huffman@44568
  1298
  LIM_rabs_zero ~> tendsto_rabs_zero
huffman@44568
  1299
  LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
huffman@44568
  1300
  LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
huffman@44568
  1301
  LIM_compose ~> tendsto_compose
huffman@44568
  1302
  LIM_mult ~> tendsto_mult
huffman@44568
  1303
  LIM_scaleR ~> tendsto_scaleR
huffman@44568
  1304
  LIM_of_real ~> tendsto_of_real
huffman@44568
  1305
  LIM_power ~> tendsto_power
huffman@44568
  1306
  LIM_inverse ~> tendsto_inverse
huffman@44568
  1307
  LIM_sgn ~> tendsto_sgn
huffman@44568
  1308
  isCont_LIM_compose ~> isCont_tendsto_compose
huffman@44568
  1309
  bounded_linear.LIM ~> bounded_linear.tendsto
huffman@44568
  1310
  bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
huffman@44568
  1311
  bounded_bilinear.LIM ~> bounded_bilinear.tendsto
huffman@44568
  1312
  bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
huffman@44568
  1313
  bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
huffman@44568
  1314
  bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
huffman@44568
  1315
  LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
huffman@44522
  1316
wenzelm@44967
  1317
* Theory Complex_Main: The definition of infinite series was
wenzelm@44967
  1318
generalized.  Now it is defined on the type class {topological_space,
wenzelm@44967
  1319
comm_monoid_add}.  Hence it is useable also for extended real numbers.
wenzelm@42484
  1320
huffman@44908
  1321
* Theory Complex_Main: The complex exponential function "expi" is now
huffman@44908
  1322
a type-constrained abbreviation for "exp :: complex => complex"; thus
huffman@44908
  1323
several polymorphic lemmas about "exp" are now applicable to "expi".
huffman@44908
  1324
wenzelm@44968
  1325
* Code generation:
wenzelm@44968
  1326
wenzelm@44968
  1327
  - Theory Library/Code_Char_ord provides native ordering of
wenzelm@44968
  1328
    characters in the target language.
wenzelm@44968
  1329
wenzelm@44968
  1330
  - Commands code_module and code_library are legacy, use export_code
wenzelm@44968
  1331
    instead.
wenzelm@44968
  1332
wenzelm@44968
  1333
  - Method "evaluation" is legacy, use method "eval" instead.
wenzelm@44968
  1334
wenzelm@44968
  1335
  - Legacy evaluator "SML" is deactivated by default.  May be
wenzelm@44968
  1336
    reactivated by the following theory command:
wenzelm@44968
  1337
wenzelm@44968
  1338
      setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
wenzelm@44968
  1339
wenzelm@44968
  1340
* Declare ext [intro] by default.  Rare INCOMPATIBILITY.
wenzelm@44968
  1341
wenzelm@45088
  1342
* New proof method "induction" that gives induction hypotheses the
wenzelm@45088
  1343
name "IH", thus distinguishing them from further hypotheses that come
wenzelm@45088
  1344
from rule induction.  The latter are still called "hyps".  Method
wenzelm@45088
  1345
"induction" is a thin wrapper around "induct" and follows the same
wenzelm@45088
  1346
syntax.
wenzelm@45088
  1347
wenzelm@44968
  1348
* Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
wenzelm@44968
  1349
still available as a legacy feature for some time.
wenzelm@44968
  1350
wenzelm@44968
  1351
* Nitpick:
wenzelm@44968
  1352
  - Added "need" and "total_consts" options.
wenzelm@44968
  1353
  - Reintroduced "show_skolems" option by popular demand.
wenzelm@44968
  1354
  - Renamed attribute: nitpick_def ~> nitpick_unfold.
wenzelm@44968
  1355
    INCOMPATIBILITY.
wenzelm@44968
  1356
wenzelm@44968
  1357
* Sledgehammer:
wenzelm@44968
  1358
  - Use quasi-sound (and efficient) translations by default.
wenzelm@44968
  1359
  - Added support for the following provers: E-ToFoF, LEO-II,
wenzelm@44968
  1360
    Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
wenzelm@44968
  1361
  - Automatically preplay and minimize proofs before showing them if
wenzelm@44968
  1362
    this can be done within reasonable time.
wenzelm@44968
  1363
  - sledgehammer available_provers ~> sledgehammer supported_provers.
wenzelm@44968
  1364
    INCOMPATIBILITY.
wenzelm@44968
  1365
  - Added "preplay_timeout", "slicing", "type_enc", "sound",
wenzelm@44968
  1366
    "max_mono_iters", and "max_new_mono_instances" options.
wenzelm@44968
  1367
  - Removed "explicit_apply" and "full_types" options as well as "Full
wenzelm@44968
  1368
    Types" Proof General menu item. INCOMPATIBILITY.
wenzelm@44968
  1369
wenzelm@44968
  1370
* Metis:
wenzelm@44968
  1371
  - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
wenzelm@44968
  1372
  - Obsoleted "metisFT" -- use "metis (full_types)" instead.
wenzelm@44968
  1373
    INCOMPATIBILITY.
wenzelm@44968
  1374
wenzelm@44968
  1375
* Command 'try':
wenzelm@44968
  1376
  - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
wenzelm@44968
  1377
    "elim:" options. INCOMPATIBILITY.
wenzelm@44968
  1378
  - Introduced 'try' that not only runs 'try_methods' but also
wenzelm@44968
  1379
    'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
wenzelm@44968
  1380
wenzelm@44968
  1381
* Quickcheck:
wenzelm@44968
  1382
  - Added "eval" option to evaluate terms for the found counterexample
wenzelm@44968
  1383
    (currently only supported by the default (exhaustive) tester).
wenzelm@44968
  1384
  - Added post-processing of terms to obtain readable counterexamples
wenzelm@44968
  1385
    (currently only supported by the default (exhaustive) tester).
wenzelm@44968
  1386
  - New counterexample generator quickcheck[narrowing] enables
wenzelm@44968
  1387
    narrowing-based testing.  Requires the Glasgow Haskell compiler
wenzelm@44968
  1388
    with its installation location defined in the Isabelle settings
wenzelm@44968
  1389
    environment as ISABELLE_GHC.
wenzelm@44968
  1390
  - Removed quickcheck tester "SML" based on the SML code generator
wenzelm@44968
  1391
    (formly in HOL/Library).
wenzelm@44968
  1392
wenzelm@44968
  1393
* Function package: discontinued option "tailrec".  INCOMPATIBILITY,
wenzelm@44968
  1394
use 'partial_function' instead.
wenzelm@44968
  1395
wenzelm@44968
  1396
* Theory Library/Extended_Reals replaces now the positive extended
wenzelm@44968
  1397
reals found in probability theory. This file is extended by
wenzelm@44968
  1398
Multivariate_Analysis/Extended_Real_Limits.
wenzelm@44968
  1399
wenzelm@44974
  1400
* Theory Library/Old_Recdef: old 'recdef' package has been moved here,
wenzelm@44974
  1401
from where it must be imported explicitly if it is really required.
wenzelm@44974
  1402
INCOMPATIBILITY.
wenzelm@44968
  1403
wenzelm@44968
  1404
* Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
wenzelm@44968
  1405
been moved here.  INCOMPATIBILITY.
wenzelm@44968
  1406
wenzelm@44968
  1407
* Theory Library/Saturated provides type of numbers with saturated
wenzelm@44968
  1408
arithmetic.
wenzelm@44968
  1409
wenzelm@44968
  1410
* Theory Library/Product_Lattice defines a pointwise ordering for the
wenzelm@44968
  1411
product type 'a * 'b, and provides instance proofs for various order
wenzelm@44968
  1412
and lattice type classes.
wenzelm@44968
  1413
wenzelm@44968
  1414
* Theory Library/Countable now provides the "countable_datatype" proof
wenzelm@44968
  1415
method for proving "countable" class instances for datatypes.
wenzelm@44968
  1416
wenzelm@44968
  1417
* Theory Library/Cset_Monad allows do notation for computable sets
wenzelm@44968
  1418
(cset) via the generic monad ad-hoc overloading facility.
wenzelm@44968
  1419
wenzelm@44968
  1420
* Library: Theories of common data structures are split into theories
wenzelm@44968
  1421
for implementation, an invariant-ensuring type, and connection to an
wenzelm@44968
  1422
abstract type. INCOMPATIBILITY.
wenzelm@44968
  1423
wenzelm@44968
  1424
  - RBT is split into RBT and RBT_Mapping.
wenzelm@44968
  1425
  - AssocList is split and renamed into AList and AList_Mapping.
wenzelm@44968
  1426
  - DList is split into DList_Impl, DList, and DList_Cset.
wenzelm@44968
  1427
  - Cset is split into Cset and List_Cset.
wenzelm@44968
  1428
wenzelm@44968
  1429
* Theory Library/Nat_Infinity has been renamed to
wenzelm@44968
  1430
Library/Extended_Nat, with name changes of the following types and
wenzelm@44968
  1431
constants:
wenzelm@44968
  1432
wenzelm@44968
  1433
  type inat   ~> type enat
wenzelm@44968
  1434
  Fin         ~> enat
wenzelm@44968
  1435
  Infty       ~> infinity (overloaded)
wenzelm@44968
  1436
  iSuc        ~> eSuc
wenzelm@44968
  1437
  the_Fin     ~> the_enat
wenzelm@44968
  1438
wenzelm@44968
  1439
Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
wenzelm@44968
  1440
been renamed accordingly. INCOMPATIBILITY.
wenzelm@44968
  1441
wenzelm@44968
  1442
* Session Multivariate_Analysis: The euclidean_space type class now
wenzelm@44968
  1443
fixes a constant "Basis :: 'a set" consisting of the standard
wenzelm@44968
  1444
orthonormal basis for the type. Users now have the option of
wenzelm@44968
  1445
quantifying over this set instead of using the "basis" function, e.g.
wenzelm@44968
  1446
"ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
wenzelm@44968
  1447
wenzelm@44968
  1448
* Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
wenzelm@44968
  1449
to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
wenzelm@44968
  1450
"Cart_nth" and "Cart_lambda" have been respectively renamed to
wenzelm@44968
  1451
"vec_nth" and "vec_lambda"; theorems mentioning those names have
wenzelm@44968
  1452
changed to match. Definition theorems for overloaded constants now use
wenzelm@44968
  1453
the standard "foo_vec_def" naming scheme. A few other theorems have
wenzelm@44968
  1454
been renamed as follows (INCOMPATIBILITY):
wenzelm@44968
  1455
wenzelm@44968
  1456
  Cart_eq          ~> vec_eq_iff
wenzelm@44968
  1457
  dist_nth_le_cart ~> dist_vec_nth_le
wenzelm@44968
  1458
  tendsto_vector   ~> vec_tendstoI
wenzelm@44968
  1459
  Cauchy_vector    ~> vec_CauchyI
wenzelm@44968
  1460
wenzelm@44968
  1461
* Session Multivariate_Analysis: Several duplicate theorems have been
wenzelm@44968
  1462
removed, and other theorems have been renamed or replaced with more
wenzelm@44968
  1463
general versions. INCOMPATIBILITY.
wenzelm@44968
  1464
wenzelm@44968
  1465
  finite_choice ~> finite_set_choice
wenzelm@44968
  1466
  eventually_conjI ~> eventually_conj
wenzelm@44968
  1467
  eventually_and ~> eventually_conj_iff
wenzelm@44968
  1468
  eventually_false ~> eventually_False
wenzelm@44968
  1469
  setsum_norm ~> norm_setsum
wenzelm@44968
  1470
  Lim_sequentially ~> LIMSEQ_def
wenzelm@44968
  1471
  Lim_ident_at ~> LIM_ident
wenzelm@44968
  1472
  Lim_const ~> tendsto_const
wenzelm@44968
  1473
  Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
wenzelm@44968
  1474
  Lim_neg ~> tendsto_minus
wenzelm@44968
  1475
  Lim_add ~> tendsto_add
wenzelm@44968
  1476
  Lim_sub ~> tendsto_diff
wenzelm@44968
  1477
  Lim_mul ~> tendsto_scaleR
wenzelm@44968
  1478
  Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
wenzelm@44968
  1479
  Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
wenzelm@44968
  1480
  Lim_linear ~> bounded_linear.tendsto
wenzelm@44968
  1481
  Lim_component ~> tendsto_euclidean_component
wenzelm@44968
  1482
  Lim_component_cart ~> tendsto_vec_nth
wenzelm@44968
  1483
  Lim_inner ~> tendsto_inner [OF tendsto_const]
wenzelm@44968
  1484
  dot_lsum ~> inner_setsum_left
wenzelm@44968
  1485
  dot_rsum ~> inner_setsum_right
wenzelm@44968
  1486
  continuous_cmul ~> continuous_scaleR [OF continuous_const]
wenzelm@44968
  1487
  continuous_neg ~> continuous_minus
wenzelm@44968
  1488
  continuous_sub ~> continuous_diff
wenzelm@44968
  1489
  continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
wenzelm@44968
  1490
  continuous_mul ~> continuous_scaleR
wenzelm@44968
  1491
  continuous_inv ~> continuous_inverse
wenzelm@44968
  1492
  continuous_at_within_inv ~> continuous_at_within_inverse
wenzelm@44968
  1493
  continuous_at_inv ~> continuous_at_inverse
wenzelm@44968
  1494
  continuous_at_norm ~> continuous_norm [OF continuous_at_id]
wenzelm@44968
  1495
  continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
wenzelm@44968
  1496
  continuous_at_component ~> continuous_component [OF continuous_at_id]
wenzelm@44968
  1497
  continuous_on_neg ~> continuous_on_minus
wenzelm@44968
  1498
  continuous_on_sub ~> continuous_on_diff
wenzelm@44968
  1499
  continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
wenzelm@44968
  1500
  continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
wenzelm@44968
  1501
  continuous_on_mul ~> continuous_on_scaleR
wenzelm@44968
  1502
  continuous_on_mul_real ~> continuous_on_mult
wenzelm@44968
  1503
  continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
wenzelm@44968
  1504
  continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
wenzelm@44968
  1505
  continuous_on_inverse ~> continuous_on_inv
wenzelm@44968
  1506
  uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
wenzelm@44968
  1507
  uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
wenzelm@44968
  1508
  subset_interior ~> interior_mono
wenzelm@44968
  1509
  subset_closure ~> closure_mono
wenzelm@44968
  1510
  closure_univ ~> closure_UNIV
wenzelm@44968
  1511
  real_arch_lt ~> reals_Archimedean2
wenzelm@44968
  1512
  real_arch ~> reals_Archimedean3
wenzelm@44968
  1513
  real_abs_norm ~> abs_norm_cancel
wenzelm@44968
  1514
  real_abs_sub_norm ~> norm_triangle_ineq3
wenzelm@44968
  1515
  norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
wenzelm@44968
  1516
wenzelm@44968
  1517
* Session HOL-Probability:
wenzelm@44968
  1518
  - Caratheodory's extension lemma is now proved for ring_of_sets.
wenzelm@44968
  1519
  - Infinite products of probability measures are now available.
wenzelm@44968
  1520
  - Sigma closure is independent, if the generator is independent
wenzelm@44968
  1521
  - Use extended reals instead of positive extended
wenzelm@44968
  1522
    reals. INCOMPATIBILITY.
wenzelm@44968
  1523
huffman@45049
  1524
* Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
huffman@45049
  1525
huffman@45049
  1526
  expand_fun_below ~> fun_below_iff
huffman@45049
  1527
  below_fun_ext ~> fun_belowI
huffman@45049
  1528
  expand_cfun_eq ~> cfun_eq_iff
huffman@45049
  1529
  ext_cfun ~> cfun_eqI
huffman@45049
  1530
  expand_cfun_below ~> cfun_below_iff
huffman@45049
  1531
  below_cfun_ext ~> cfun_belowI
huffman@45049
  1532
  monofun_fun_fun ~> fun_belowD
huffman@45049
  1533
  monofun_fun_arg ~> monofunE
huffman@45049
  1534
  monofun_lub_fun ~> adm_monofun [THEN admD]
huffman@45049
  1535
  cont_lub_fun ~> adm_cont [THEN admD]
huffman@45049
  1536
  cont2cont_Rep_CFun ~> cont2cont_APP
huffman@45049
  1537
  cont_Rep_CFun_app ~> cont_APP_app
huffman@45049
  1538
  cont_Rep_CFun_app_app ~> cont_APP_app_app
huffman@45049
  1539
  cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
huffman@45049
  1540
  cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
huffman@45049
  1541
  contlub_cfun ~> lub_APP [symmetric]
huffman@45049
  1542
  contlub_LAM ~> lub_LAM [symmetric]
huffman@45049
  1543
  thelubI ~> lub_eqI
huffman@45049
  1544
  UU_I ~> bottomI
huffman@45049
  1545
  lift_distinct1 ~> lift.distinct(1)
huffman@45049
  1546
  lift_distinct2 ~> lift.distinct(2)
huffman@45049
  1547
  Def_not_UU ~> lift.distinct(2)
huffman@45049
  1548
  Def_inject ~> lift.inject
huffman@45049
  1549
  below_UU_iff ~> below_bottom_iff
huffman@45049
  1550
  eq_UU_iff ~> eq_bottom_iff
huffman@45049
  1551
huffman@44903
  1552
krauss@41685
  1553
*** Document preparation ***
krauss@41685
  1554
wenzelm@44800
  1555
* Antiquotation @{rail} layouts railroad syntax diagrams, see also
wenzelm@44800
  1556
isar-ref manual, both for description and actual application of the
wenzelm@44800
  1557
same.
wenzelm@44800
  1558
wenzelm@44800
  1559
* Antiquotation @{value} evaluates the given term and presents its
wenzelm@44800
  1560
result.
wenzelm@44800
  1561
wenzelm@44800
  1562
* Antiquotations: term style "isub" provides ad-hoc conversion of
wenzelm@44800
  1563
variables x1, y23 into subscripted form x\<^isub>1,
wenzelm@44800
  1564
y\<^isub>2\<^isub>3.
wenzelm@41651
  1565
wenzelm@42484
  1566
* Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
wenzelm@42484
  1567
(e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
wenzelm@42484
  1568
wenzelm@44967
  1569
* Localized \isabellestyle switch can be used within blocks or groups
wenzelm@44967
  1570
like this:
wenzelm@44967
  1571
wenzelm@44967
  1572
  \isabellestyle{it}  %preferred default
wenzelm@44967
  1573
  {\isabellestylett @{text "typewriter stuff"}}
wenzelm@44967
  1574
wenzelm@44967
  1575
* Discontinued special treatment of hard tabulators.  Implicit
wenzelm@44967
  1576
tab-width is now defined as 1.  Potential INCOMPATIBILITY for visual
wenzelm@44967
  1577
layouts.
wenzelm@44800
  1578
wenzelm@41651
  1579
wenzelm@41944
  1580
*** ML ***
wenzelm@41944
  1581
wenzelm@43731
  1582
* The inner syntax of sort/type/term/prop supports inlined YXML
wenzelm@43731
  1583
representations within quoted string tokens.  By encoding logical
wenzelm@43731
  1584
entities via Term_XML (in ML or Scala) concrete syntax can be
wenzelm@43731
  1585
bypassed, which is particularly useful for producing bits of text
wenzelm@43731
  1586
under external program control.
wenzelm@43731
  1587
wenzelm@43565
  1588
* Antiquotations for ML and document preparation are managed as theory
wenzelm@43565
  1589
data, which requires explicit setup.
wenzelm@43565
  1590
wenzelm@42897
  1591
* Isabelle_Process.is_active allows tools to check if the official
wenzelm@42897
  1592
process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
wenzelm@42897
  1593
(better known as Proof General).
wenzelm@42897
  1594
wenzelm@42360
  1595
* Structure Proof_Context follows standard naming scheme.  Old
wenzelm@42360
  1596
ProofContext is still available for some time as legacy alias.
wenzelm@42360
  1597
wenzelm@42015
  1598
* Structure Timing provides various operations for timing; supersedes
wenzelm@42015
  1599
former start_timing/end_timing etc.
wenzelm@42015
  1600
wenzelm@41944
  1601
* Path.print is the official way to show file-system paths to users
wenzelm@41944
  1602
(including quotes etc.).
wenzelm@41944
  1603
wenzelm@42056
  1604
* Inner syntax: identifiers in parse trees of generic categories
wenzelm@42056
  1605
"logic", "aprop", "idt" etc. carry position information (disguised as
wenzelm@42056
  1606
type constraints).  Occasional INCOMPATIBILITY with non-compliant
wenzelm@42057
  1607
translations that choke on unexpected type constraints.  Positions can
wenzelm@42057
  1608
be stripped in ML translations via Syntax.strip_positions /
wenzelm@42057
  1609
Syntax.strip_positions_ast, or via the syntax constant
wenzelm@42057
  1610
"_strip_positions" within parse trees.  As last resort, positions can
wenzelm@42057
  1611
be disabled via the configuration option Syntax.positions, which is
wenzelm@42057
  1612
called "syntax_positions" in Isar attribute syntax.
wenzelm@42056
  1613
wenzelm@42290
  1614
* Discontinued special status of various ML structures that contribute
wenzelm@42290
  1615
to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
wenzelm@42290
  1616
pervasive content, no inclusion in structure Syntax.  INCOMPATIBILITY,
wenzelm@42290
  1617
refer directly to Ast.Constant, Lexicon.is_identifier,
wenzelm@42290
  1618
Syntax_Trans.mk_binder_tr etc.
wenzelm@42224
  1619
wenzelm@42247
  1620
* Typed print translation: discontinued show_sorts argument, which is
wenzelm@42247
  1621
already available via context of "advanced" translation.
wenzelm@42247
  1622
wenzelm@42370
  1623
* Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
wenzelm@42370
  1624
goal states; body tactic needs to address all subgoals uniformly.
wenzelm@42370
  1625
wenzelm@42403
  1626
* Slightly more special eq_list/eq_set, with shortcut involving
wenzelm@42403
  1627
pointer equality (assumes that eq relation is reflexive).
wenzelm@42403
  1628
wenzelm@42793
  1629
* Classical tactics use proper Proof.context instead of historic types
wenzelm@42793
  1630
claset/clasimpset.  Old-style declarations like addIs, addEs, addDs
wenzelm@42793
  1631
operate directly on Proof.context.  Raw type claset retains its use as
wenzelm@42793
  1632
snapshot of the classical context, which can be recovered via
wenzelm@42793
  1633
(put_claset HOL_cs) etc.  Type clasimpset has been discontinued.
wenzelm@42793
  1634
INCOMPATIBILITY, classical tactics and derived proof methods require
wenzelm@42793
  1635
proper Proof.context.
wenzelm@42793
  1636
wenzelm@44803
  1637
wenzelm@44803
  1638
*** System ***
wenzelm@44803
  1639
wenzelm@44968
  1640
* Discontinued support for Poly/ML 5.2, which was the last version
wenzelm@44968
  1641
without proper multithreading and TimeLimit implementation.
wenzelm@44968
  1642
wenzelm@44968
  1643
* Discontinued old lib/scripts/polyml-platform, which has been
wenzelm@44968
  1644
obsolete since Isabelle2009-2.
wenzelm@44968
  1645
wenzelm@44967
  1646
* Various optional external tools are referenced more robustly and
wenzelm@44967
  1647
uniformly by explicit Isabelle settings as follows:
wenzelm@44967
  1648
wenzelm@44967
  1649
  ISABELLE_CSDP   (formerly CSDP_EXE)
wenzelm@44967
  1650
  ISABELLE_GHC    (formerly EXEC_GHC or GHC_PATH)
wenzelm@44967
  1651
  ISABELLE_OCAML  (formerly EXEC_OCAML)
wenzelm@44967
  1652
  ISABELLE_SWIPL  (formerly EXEC_SWIPL)
wenzelm@44967
  1653
  ISABELLE_YAP    (formerly EXEC_YAP)
wenzelm@44967
  1654
wenzelm@44967
  1655
Note that automated detection from the file-system or search path has
wenzelm@44967
  1656
been discontinued.  INCOMPATIBILITY.
wenzelm@44967
  1657
wenzelm@43752
  1658
* Scala layer provides JVM method invocation service for static
wenzelm@44800
  1659
methods of type (String)String, see Invoke_Scala.method in ML.  For
wenzelm@44800
  1660
example:
wenzelm@43752
  1661
wenzelm@43752
  1662
  Invoke_Scala.method "java.lang.System.getProperty" "java.home"
wenzelm@43752
  1663
wenzelm@44967
  1664
Together with YXML.string_of_body/parse_body and XML.Encode/Decode
wenzelm@44967
  1665
this allows to pass structured values between ML and Scala.
wenzelm@44800
  1666
wenzelm@44803
  1667
* The IsabelleText fonts includes some further glyphs to support the
wenzelm@44803
  1668
Prover IDE.  Potential INCOMPATIBILITY: users who happen to have
wenzelm@44803
  1669
installed a local copy (which is normally *not* required) need to
wenzelm@44803
  1670
delete or update it from ~~/lib/fonts/.
wenzelm@41944
  1671
wenzelm@41703
  1672
wenzelm@45089
  1673
wenzelm@41512
  1674
New in Isabelle2011 (January 2011)
wenzelm@41512
  1675
----------------------------------
wenzelm@37383
  1676
wenzelm@37536
  1677
*** General ***
wenzelm@37536
  1678
wenzelm@41573
  1679
* Experimental Prover IDE based on Isabelle/Scala and jEdit (see
wenzelm@41612
  1680
src/Tools/jEdit).  This also serves as IDE for Isabelle/ML, with
wenzelm@41612
  1681
useful tooltips and hyperlinks produced from its static analysis.  The
wenzelm@41612
  1682
bundled component provides an executable Isabelle tool that can be run
wenzelm@41612
  1683
like this:
wenzelm@41612
  1684
wenzelm@41612
  1685
  Isabelle2011/bin/isabelle jedit
wenzelm@41573
  1686
wenzelm@40948
  1687
* Significantly improved Isabelle/Isar implementation manual.
wenzelm@40948
  1688
wenzelm@41594
  1689
* System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
wenzelm@41595
  1690
(and thus refers to something like $HOME/.isabelle/Isabelle2011),
wenzelm@41594
  1691
while the default heap location within that directory lacks that extra
wenzelm@41594
  1692
suffix.  This isolates multiple Isabelle installations from each
wenzelm@41594
  1693
other, avoiding problems with old settings in new versions.
wenzelm@41594
  1694
INCOMPATIBILITY, need to copy/upgrade old user settings manually.
wenzelm@41594
  1695
wenzelm@40947
  1696
* Source files are always encoded as UTF-8, instead of old-fashioned
wenzelm@40947
  1697
ISO-Latin-1.  INCOMPATIBILITY.  Isabelle LaTeX documents might require
wenzelm@40948
  1698
the following package declarations:
wenzelm@40947
  1699
wenzelm@40947
  1700
  \usepackage[utf8]{inputenc}
wenzelm@40947
  1701
  \usepackage{textcomp}
wenzelm@40947
  1702
krauss@41440
  1703
* Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
wenzelm@37536
  1704
a Unicode character is treated as a single symbol, not a sequence of
wenzelm@37536
  1705
non-ASCII bytes as before.  Since Isabelle/ML string literals may
wenzelm@37536
  1706
contain symbols without further backslash escapes, Unicode can now be
wenzelm@37536
  1707
used here as well.  Recall that Symbol.explode in ML provides a
wenzelm@37536
  1708
consistent view on symbols, while raw explode (or String.explode)
wenzelm@37536
  1709
merely give a byte-oriented representation.
wenzelm@37536
  1710
wenzelm@41594
  1711
* Theory loader: source files are primarily located via the master
wenzelm@41594
  1712
directory of each theory node (where the .thy file itself resides).
wenzelm@41594
  1713
The global load path is still partially available as legacy feature.
wenzelm@41594
  1714
Minor INCOMPATIBILITY due to subtle change in file lookup: use
wenzelm@41594
  1715
explicit paths, relatively to the theory.
wenzelm@38135
  1716
wenzelm@37939
  1717
* Special treatment of ML file names has been discontinued.
wenzelm@37939
  1718
Historically, optional extensions .ML or .sml were added on demand --
wenzelm@37939
  1719
at the cost of clarity of file dependencies.  Recall that Isabelle/ML
wenzelm@37939
  1720
files exclusively use the .ML extension.  Minor INCOMPATIBILTY.
wenzelm@37939
  1721
wenzelm@38980
  1722
* Various options that affect pretty printing etc. are now properly
wenzelm@38767
  1723
handled within the context via configuration options, instead of
wenzelm@40879
  1724
unsynchronized references or print modes.  There are both ML Config.T
wenzelm@40879
  1725
entities and Isar declaration attributes to access these.
wenzelm@38767
  1726
wenzelm@39125
  1727
  ML (Config.T)                 Isar (attribute)
wenzelm@39125
  1728
wenzelm@39128
  1729
  eta_contract                  eta_contract
wenzelm@39137
  1730
  show_brackets                 show_brackets
wenzelm@39134
  1731
  show_sorts                    show_sorts
wenzelm@39134
  1732
  show_types                    show_types
wenzelm@39126
  1733
  show_question_marks           show_question_marks
wenzelm@39126
  1734
  show_consts                   show_consts
wenzelm@40879
  1735
  show_abbrevs                  show_abbrevs
wenzelm@39126
  1736
wenzelm@41379
  1737
  Syntax.ast_trace              syntax_ast_trace
wenzelm@41379
  1738
  Syntax.ast_stat               syntax_ast_stat
wenzelm@39126
  1739
  Syntax.ambiguity_level        syntax_ambiguity_level
wenzelm@39126
  1740
wenzelm@39126
  1741
  Goal_Display.goals_limit      goals_limit
wenzelm@39126
  1742
  Goal_Display.show_main_goal   show_main_goal
wenzelm@39126
  1743
wenzelm@41379
  1744
  Method.rule_trace             rule_trace
wenzelm@41379
  1745
wenzelm@39125
  1746
  Thy_Output.display            thy_output_display
wenzelm@39125
  1747
  Thy_Output.quotes             thy_output_quotes
wenzelm@39125
  1748
  Thy_Output.indent             thy_output_indent
wenzelm@39125
  1749
  Thy_Output.source             thy_output_source
wenzelm@39125
  1750
  Thy_Output.break              thy_output_break
wenzelm@39125
  1751
krauss@41440
  1752
Note that corresponding "..._default" references in ML may only be
wenzelm@38767
  1753
changed globally at the ROOT session setup, but *not* within a theory.
wenzelm@40879
  1754
The option "show_abbrevs" supersedes the former print mode
wenzelm@40879
  1755
"no_abbrevs" with inverted meaning.
wenzelm@38767
  1756
wenzelm@40878
  1757
* More systematic naming of some configuration options.
huffman@41294
  1758
INCOMPATIBILITY.
wenzelm@40878
  1759
wenzelm@40878
  1760
  trace_simp  ~>  simp_trace
wenzelm@40878
  1761
  debug_simp  ~>  simp_debug
wenzelm@40878
  1762
wenzelm@40291
  1763
* Support for real valued configuration options, using simplistic
wenzelm@40291
  1764
floating-point notation that coincides with the inner syntax for
wenzelm@40291
  1765
float_token.
wenzelm@40291
  1766
wenzelm@41594
  1767
* Support for real valued preferences (with approximative PGIP type):
wenzelm@41594
  1768
front-ends need to accept "pgint" values in float notation.
wenzelm@41594
  1769
INCOMPATIBILITY.
wenzelm@41573
  1770
wenzelm@41573
  1771
* The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
wenzelm@41573
  1772
DejaVu Sans.
wenzelm@41573
  1773
wenzelm@41594
  1774
* Discontinued support for Poly/ML 5.0 and 5.1 versions.
wenzelm@41594
  1775
wenzelm@40948
  1776
wenzelm@40948
  1777
*** Pure ***
wenzelm@40948
  1778
wenzelm@41249
  1779
* Command 'type_synonym' (with single argument) replaces somewhat
wenzelm@41249
  1780
outdated 'types', which is still available as legacy feature for some
wenzelm@41249
  1781
time.
wenzelm@41249
  1782
wenzelm@41249
  1783
* Command 'nonterminal' (with 'and' separated list of arguments)
wenzelm@41249
  1784
replaces somewhat outdated 'nonterminals'.  INCOMPATIBILITY.
wenzelm@41229
  1785
wenzelm@40965
  1786
* Command 'notepad' replaces former 'example_proof' for
wenzelm@41020
  1787
experimentation in Isar without any result.  INCOMPATIBILITY.
wenzelm@40965
  1788
ballarin@41435
  1789
* Locale interpretation commands 'interpret' and 'sublocale' accept
ballarin@41435
  1790
lists of equations to map definitions in a locale to appropriate
ballarin@41435
  1791
entities in the context of the interpretation.  The 'interpretation'
ballarin@41435
  1792
command already provided this functionality.
ballarin@41435
  1793
wenzelm@41594
  1794
* Diagnostic command 'print_dependencies' prints the locale instances
wenzelm@41594
  1795
that would be activated if the specified expression was interpreted in
wenzelm@41594
  1796
the current context.  Variant "print_dependencies!" assumes a context
wenzelm@41594
  1797
without interpretations.
ballarin@38110
  1798
ballarin@38110
  1799
* Diagnostic command 'print_interps' prints interpretations in proofs
ballarin@38110
  1800
in addition to interpretations in theories.
ballarin@38110
  1801
wenzelm@38708
  1802
* Discontinued obsolete 'global' and 'local' commands to manipulate
wenzelm@38708
  1803
the theory name space.  Rare INCOMPATIBILITY.  The ML functions
wenzelm@38708
  1804
Sign.root_path and Sign.local_path may be applied directly where this
wenzelm@38708
  1805
feature is still required for historical reasons.
wenzelm@38708
  1806
wenzelm@40948
  1807
* Discontinued obsolete 'constdefs' command.  INCOMPATIBILITY, use
haftmann@39215
  1808
'definition' instead.
haftmann@39215
  1809
wenzelm@41574
  1810
* The "prems" fact, which refers to the accidental collection of
wenzelm@41574
  1811
foundational premises in the context, is now explicitly marked as
wenzelm@41594
  1812
legacy feature and will be discontinued soon.  Consider using "assms"
wenzelm@41594
  1813
of the head statement or reference facts by explicit names.
wenzelm@41574
  1814
wenzelm@40801
  1815
* Document antiquotations @{class} and @{type} print classes and type
wenzelm@40801
  1816
constructors.
wenzelm@40801
  1817
wenzelm@40801
  1818
* Document antiquotation @{file} checks file/directory entries within
wenzelm@40801
  1819
the local file system.
haftmann@39305
  1820
ballarin@38110
  1821
haftmann@37387
  1822
*** HOL ***
haftmann@37387
  1823
wenzelm@41594
  1824
* Coercive subtyping: functions can be declared as coercions and type
wenzelm@41594
  1825
inference will add them as necessary upon input of a term.  Theory
wenzelm@41594
  1826
Complex_Main declares real :: nat => real and real :: int => real as
wenzelm@41594
  1827
coercions. A coercion function f is declared like this:
wenzelm@40939
  1828
wenzelm@40939
  1829
  declare [[coercion f]]
nipkow@40866
  1830
wenzelm@41571
  1831
To lift coercions through type constructors (e.g. from nat => real to
nipkow@40866
  1832
nat list => real list), map functions can be declared, e.g.
nipkow@40866
  1833
wenzelm@40939
  1834
  declare [[coercion_map map]]
wenzelm@40939
  1835
wenzelm@40939
  1836
Currently coercion inference is activated only in theories including
wenzelm@40939
  1837
real numbers, i.e. descendants of Complex_Main.  This is controlled by
wenzelm@41020
  1838
the configuration option "coercion_enabled", e.g. it can be enabled in
wenzelm@40939
  1839
other theories like this:
wenzelm@40939
  1840
wenzelm@40939
  1841
  declare [[coercion_enabled]]
nipkow@40866
  1842
wenzelm@41571
  1843
* Command 'partial_function' provides basic support for recursive
wenzelm@41571
  1844
function definitions over complete partial orders.  Concrete instances
krauss@40183
  1845
are provided for i) the option type, ii) tail recursion on arbitrary
wenzelm@41571
  1846
types, and iii) the heap monad of Imperative_HOL.  See
wenzelm@41571
  1847
src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
wenzelm@41571
  1848
for examples.
krauss@40183
  1849
wenzelm@41571
  1850
* Function package: f.psimps rules are no longer implicitly declared
wenzelm@41571
  1851
as [simp].  INCOMPATIBILITY.
haftmann@41398
  1852
haftmann@41398
  1853
* Datatype package: theorems generated for executable equality (class
wenzelm@41571
  1854
"eq") carry proper names and are treated as default code equations.
wenzelm@41571
  1855
wenzelm@41594
  1856
* Inductive package: now offers command 'inductive_simps' to
wenzelm@41594
  1857
automatically derive instantiated and simplified equations for
wenzelm@41594
  1858
inductive predicates, similar to 'inductive_cases'.
wenzelm@41594
  1859
wenzelm@41571
  1860
* Command 'enriched_type' allows to register properties of the
wenzelm@41571
  1861
functorial structure of types.
haftmann@39771
  1862
haftmann@39644
  1863
* Improved infrastructure for term evaluation using code generator
haftmann@39644
  1864
techniques, in particular static evaluation conversions.
haftmann@39644
  1865
wenzelm@41594
  1866
* Code generator: Scala (2.8 or higher) has been added to the target
wenzelm@41594
  1867
languages.
wenzelm@41594
  1868
haftmann@41398
  1869
* Code generator: globbing constant expressions "*" and "Theory.*"
haftmann@41398
  1870
have been replaced by the more idiomatic "_" and "Theory._".
haftmann@41398
  1871
INCOMPATIBILITY.
haftmann@41398
  1872
haftmann@41398
  1873
* Code generator: export_code without explicit file declaration prints
haftmann@41398
  1874
to standard output.  INCOMPATIBILITY.
haftmann@41398
  1875
haftmann@41398
  1876
* Code generator: do not print function definitions for case
haftmann@41398
  1877
combinators any longer.
haftmann@41398
  1878
wenzelm@41594
  1879
* Code generator: simplification with rules determined with
wenzelm@41571
  1880
src/Tools/Code/code_simp.ML and method "code_simp".
wenzelm@41571
  1881
wenzelm@41594
  1882
* Code generator for records: more idiomatic representation of record
wenzelm@40948
  1883
types.  Warning: records are not covered by ancient SML code
wenzelm@40948
  1884
generation any longer.  INCOMPATIBILITY.  In cases of need, a suitable
wenzelm@40948
  1885
rep_datatype declaration helps to succeed then:
haftmann@38537
  1886
haftmann@38537
  1887
  record 'a foo = ...
haftmann@38537
  1888
  ...
haftmann@38537
  1889
  rep_datatype foo_ext ...
haftmann@38535
  1890
wenzelm@41594
  1891
* Records: logical foundation type for records does not carry a
wenzelm@41594
  1892
'_type' suffix any longer (obsolete due to authentic syntax).
wenzelm@41594
  1893
INCOMPATIBILITY.
wenzelm@41594
  1894
haftmann@41398
  1895
* Quickcheck now by default uses exhaustive testing instead of random
wenzelm@41571
  1896
testing.  Random testing can be invoked by "quickcheck [random]",
wenzelm@41571
  1897
exhaustive testing by "quickcheck [exhaustive]".
haftmann@41398
  1898
haftmann@41398
  1899
* Quickcheck instantiates polymorphic types with small finite
haftmann@41398
  1900
datatypes by default. This enables a simple execution mechanism to
haftmann@41398
  1901
handle quantifiers and function equality over the finite datatypes.
haftmann@41398
  1902
wenzelm@41571
  1903
* Quickcheck random generator has been renamed from "code" to
wenzelm@41571
  1904
"random".  INCOMPATIBILITY.
haftmann@41398
  1905
haftmann@41398
  1906
* Quickcheck now has a configurable time limit which is set to 30
haftmann@41398
  1907
seconds by default. This can be changed by adding [timeout = n] to the
haftmann@41398
  1908
quickcheck command. The time limit for Auto Quickcheck is still set
haftmann@41398
  1909
independently.
haftmann@38461
  1910
haftmann@38461
  1911
* Quickcheck in locales considers interpretations of that locale for
haftmann@38461
  1912
counter example search.
haftmann@38461
  1913
blanchet@40059
  1914
* Sledgehammer:
wenzelm@41571
  1915
  - Added "smt" and "remote_smt" provers based on the "smt" proof
wenzelm@41571
  1916
    method. See the Sledgehammer manual for details ("isabelle doc
wenzelm@41571
  1917
    sledgehammer").
blanchet@40059
  1918
  - Renamed commands:
blanchet@40059
  1919
    sledgehammer atp_info ~> sledgehammer running_provers
blanchet@40059
  1920
    sledgehammer atp_kill ~> sledgehammer kill_provers
blanchet@40059
  1921
    sledgehammer available_atps ~> sledgehammer available_provers
blanchet@40059
  1922
    INCOMPATIBILITY.
blanchet@40059
  1923
  - Renamed options:
blanchet@40059
  1924
    sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
blanchet@40062
  1925
    sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
blanchet@40341
  1926
    sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
blanchet@40341
  1927
    (and "ms" and "min" are no longer supported)
blanchet@40341
  1928
    INCOMPATIBILITY.
blanchet@40341
  1929
blanchet@40341
  1930
* Nitpick:
blanchet@40341
  1931
  - Renamed options:
blanchet@40341
  1932
    nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
blanchet@40341
  1933
    nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
blanchet@40059
  1934
    INCOMPATIBILITY.
blanchet@40725
  1935
  - Added support for partial quotient types.
blanchet@40725
  1936
  - Added local versions of the "Nitpick.register_xxx" functions.
blanchet@40725
  1937
  - Added "whack" option.
blanchet@40725
  1938
  - Allow registration of quotient types as codatatypes.
blanchet@40725
  1939
  - Improved "merge_type_vars" option to merge more types.
blanchet@40725
  1940
  - Removed unsound "fast_descrs" option.
blanchet@40725
  1941
  - Added custom symmetry breaking for datatypes, making it possible to reach
blanchet@40725
  1942
    higher cardinalities.
blanchet@40725
  1943
  - Prevent the expansion of too large definitions.
blanchet@39957
  1944
wenzelm@41571
  1945
* Proof methods "metis" and "meson" now have configuration options
wenzelm@41571
  1946
"meson_trace", "metis_trace", and "metis_verbose" that can be enabled
wenzelm@41571
  1947
to diagnose these tools. E.g.
wenzelm@41571
  1948
wenzelm@41571
  1949
    using [[metis_trace = true]]
wenzelm@41571
  1950
haftmann@41398
  1951
* Auto Solve: Renamed "Auto Solve Direct".  The tool is now available
haftmann@41398
  1952
manually as command 'solve_direct'.
haftmann@41398
  1953
boehmes@41601
  1954
* The default SMT solver Z3 must be enabled explicitly (due to
boehmes@41601
  1955
licensing issues) by setting the environment variable
wenzelm@41603
  1956
Z3_NON_COMMERCIAL in etc/settings of the component, for example.  For
wenzelm@41603
  1957
commercial applications, the SMT solver CVC3 is provided as fall-back;
wenzelm@41603
  1958
changing the SMT solver is done via the configuration option
wenzelm@41603
  1959
"smt_solver".
boehmes@41432
  1960
boehmes@41432
  1961
* Remote SMT solvers need to be referred to by the "remote_" prefix,
wenzelm@41571
  1962
i.e. "remote_cvc3" and "remote_z3".
wenzelm@41571
  1963
wenzelm@41571
  1964
* Added basic SMT support for datatypes, records, and typedefs using
wenzelm@41571
  1965
the oracle mode (no proofs).  Direct support of pairs has been dropped
wenzelm@41571
  1966
in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
wenzelm@41571
  1967
support for a similar behavior).  Minor INCOMPATIBILITY.
boehmes@41432
  1968
boehmes@40162
  1969
* Changed SMT configuration options:
boehmes@40162
  1970
  - Renamed:
boehmes@41432
  1971
    z3_proofs ~> smt_oracle (with inverted meaning)
boehmes@40162
  1972
    z3_trace_assms ~> smt_trace_used_facts
boehmes@40162
  1973
    INCOMPATIBILITY.
boehmes@40162
  1974
  - Added:
boehmes@40424
  1975
    smt_verbose
boehmes@41432
  1976
    smt_random_seed
boehmes@40424
  1977
    smt_datatypes
boehmes@41432
  1978
    smt_infer_triggers
boehmes@41432
  1979
    smt_monomorph_limit
boehmes@40162
  1980
    cvc3_options
boehmes@41432
  1981
    remote_cvc3_options
boehmes@41432
  1982
    remote_z3_options
boehmes@40162
  1983
    yices_options
blanchet@39957
  1984
wenzelm@40948
  1985
* Boogie output files (.b2i files) need to be declared in the theory
wenzelm@40948
  1986
header.
boehmes@40580
  1987
wenzelm@41594
  1988
* Simplification procedure "list_to_set_comprehension" rewrites list
wenzelm@41594
  1989
comprehensions applied to List.set to set comprehensions.  Occasional
wenzelm@41594
  1990
INCOMPATIBILITY, may be deactivated like this:
wenzelm@41594
  1991
wenzelm@41594
  1992
  declare [[simproc del: list_to_set_comprehension]]
wenzelm@41594
  1993
wenzelm@41573
  1994
* Removed old version of primrec package.  INCOMPATIBILITY.
haftmann@41398
  1995
haftmann@41398
  1996
* Removed simplifier congruence rule of "prod_case", as has for long
haftmann@41398
  1997
been the case with "split".  INCOMPATIBILITY.
haftmann@41398
  1998
haftmann@41398
  1999
* String.literal is a type, but not a datatype.  INCOMPATIBILITY.
haftmann@41398
  2000
krauss@40388
  2001
* Removed [split_format ... and ... and ...] version of
krauss@40388
  2002
[split_format].  Potential INCOMPATIBILITY.
krauss@40388
  2003
wenzelm@41571
  2004
* Predicate "sorted" now defined inductively, with nice induction
wenzelm@41571
  2005
rules.  INCOMPATIBILITY: former sorted.simps now named sorted_simps.
haftmann@41398
  2006
haftmann@41398
  2007
* Constant "contents" renamed to "the_elem", to free the generic name
haftmann@41398
  2008
contents for other uses.  INCOMPATIBILITY.
haftmann@41398
  2009
haftmann@41398
  2010
* Renamed class eq and constant eq (for code generation) to class
haftmann@41398
  2011
equal and constant equal, plus renaming of related facts and various
haftmann@41398
  2012
tuning.  INCOMPATIBILITY.
haftmann@41398
  2013
haftmann@41398
  2014
* Dropped type classes mult_mono and mult_mono1.  INCOMPATIBILITY.
haftmann@41398
  2015
wenzelm@41571
  2016
* Removed output syntax "'a ~=> 'b" for "'a => 'b option".
wenzelm@41571
  2017
INCOMPATIBILITY.
haftmann@41398
  2018
haftmann@41398
  2019
* Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
haftmann@41398
  2020
avoid confusion with finite sets.  INCOMPATIBILITY.
haftmann@41398
  2021
haftmann@41398
  2022
* Abandoned locales equiv, congruent and congruent2 for equivalence
haftmann@41398
  2023
relations.  INCOMPATIBILITY: use equivI rather than equiv_intro (same
haftmann@41398
  2024
for congruent(2)).
haftmann@41398
  2025
haftmann@41398
  2026
* Some previously unqualified names have been qualified:
haftmann@41398
  2027
haftmann@41398
  2028
  types
haftmann@41398
  2029
    bool ~> HOL.bool
haftmann@41398
  2030
    nat ~> Nat.nat
haftmann@41398
  2031
haftmann@41398
  2032
  constants
haftmann@41398
  2033
    Trueprop ~> HOL.Trueprop
haftmann@41398
  2034
    True ~> HOL.True
haftmann@41398
  2035
    False ~> HOL.False
haftmann@41398
  2036
    op & ~> HOL.conj
haftmann@41398
  2037
    op | ~> HOL.disj
haftmann@41398
  2038
    op --> ~> HOL.implies
haftmann@41398
  2039
    op = ~> HOL.eq
haftmann@41398
  2040
    Not ~> HOL.Not
haftmann@41398
  2041
    The ~> HOL.The
haftmann@41398
  2042
    All ~> HOL.All
haftmann@41398
  2043
    Ex ~> HOL.Ex
haftmann@41398
  2044
    Ex1 ~> HOL.Ex1
haftmann@41398
  2045
    Let ~> HOL.Let
haftmann@41398
  2046
    If ~> HOL.If
haftmann@41398
  2047
    Ball ~> Set.Ball
haftmann@41398
  2048
    Bex ~> Set.Bex
haftmann@41398
  2049
    Suc ~> Nat.Suc
haftmann@41398
  2050
    Pair ~> Product_Type.Pair
haftmann@41398
  2051
    fst ~> Product_Type.fst
haftmann@41398
  2052
    snd ~> Product_Type.snd
haftmann@41398
  2053
    curry ~> Product_Type.curry
haftmann@41398
  2054
    op : ~> Set.member
haftmann@41398
  2055
    Collect ~> Set.Collect
haftmann@41398
  2056
haftmann@41398
  2057
INCOMPATIBILITY.
haftmann@41398
  2058
haftmann@41398
  2059
* More canonical naming convention for some fundamental definitions:
haftmann@41398
  2060
haftmann@41398
  2061
    bot_bool_eq ~> bot_bool_def
haftmann@41398
  2062
    top_bool_eq ~> top_bool_def
haftmann@41398
  2063
    inf_bool_eq ~> inf_bool_def
haftmann@41398
  2064
    sup_bool_eq ~> sup_bool_def
haftmann@41398
  2065
    bot_fun_eq  ~> bot_fun_def
haftmann@41398
  2066
    top_fun_eq  ~> top_fun_def
haftmann@41398
  2067
    inf_fun_eq  ~> inf_fun_def
haftmann@41398
  2068
    sup_fun_eq  ~> sup_fun_def
haftmann@41398
  2069
haftmann@41398
  2070
INCOMPATIBILITY.
haftmann@41398
  2071
haftmann@41398
  2072
* More stylized fact names:
haftmann@41398
  2073
haftmann@41398
  2074
  expand_fun_eq ~> fun_eq_iff
haftmann@41398
  2075
  expand_set_eq ~> set_eq_iff
haftmann@41398
  2076
  set_ext       ~> set_eqI
haftmann@41398
  2077
  nat_number    ~> eval_nat_numeral
haftmann@41398
  2078
haftmann@41398
  2079
INCOMPATIBILITY.
haftmann@41398
  2080
wenzelm@41571
  2081
* Refactoring of code-generation specific operations in theory List:
haftmann@41398
  2082
haftmann@41398
  2083
  constants
haftmann@41398
  2084
    null ~> List.null
haftmann@41398
  2085
haftmann@41398
  2086
  facts
haftmann@41398
  2087
    mem_iff ~> member_def
haftmann@41398
  2088
    null_empty ~> null_def
haftmann@41398
  2089
haftmann@41398
  2090
INCOMPATIBILITY.  Note that these were not supposed to be used
haftmann@41398
  2091
regularly unless for striking reasons; their main purpose was code
haftmann@41398
  2092
generation.
haftmann@41398
  2093
haftmann@41398
  2094
Various operations from the Haskell prelude are used for generating
haftmann@41398
  2095
Haskell code.
haftmann@41398
  2096
wenzelm@41571
  2097
* Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV".  Term
wenzelm@41571
  2098
"surj f" is now an abbreviation of "range f = UNIV".  The theorems
wenzelm@41571
  2099
bij_def and surj_def are unchanged.  INCOMPATIBILITY.
haftmann@41398
  2100
haftmann@41398
  2101
* Abolished some non-alphabetic type names: "prod" and "sum" replace
haftmann@41398
  2102
"*" and "+" respectively.  INCOMPATIBILITY.
haftmann@41398
  2103
haftmann@41398
  2104
* Name "Plus" of disjoint sum operator "<+>" is now hidden.  Write
wenzelm@41571
  2105
"Sum_Type.Plus" instead.
haftmann@41398
  2106
haftmann@41398
  2107
* Constant "split" has been merged with constant "prod_case"; names of
haftmann@41398
  2108
ML functions, facts etc. involving split have been retained so far,
haftmann@41398
  2109
though.  INCOMPATIBILITY.
haftmann@41398
  2110
haftmann@41398
  2111
* Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
haftmann@41398
  2112
instead.  INCOMPATIBILITY.
haftmann@41398
  2113
wenzelm@41571
  2114
* Removed lemma "Option.is_none_none" which duplicates "is_none_def".
haftmann@41398
  2115
INCOMPATIBILITY.
haftmann@41398
  2116
wenzelm@41594
  2117
* Former theory Library/Enum is now part of the HOL-Main image.
wenzelm@41594
  2118
INCOMPATIBILITY: all constants of the Enum theory now have to be
wenzelm@41594
  2119
referred to by its qualified name.
wenzelm@41594
  2120
wenzelm@41594
  2121
  enum    ~>  Enum.enum
wenzelm@41594
  2122
  nlists  ~>  Enum.nlists
wenzelm@41594
  2123
  product ~>  Enum.product
wenzelm@41594
  2124
wenzelm@41594
  2125
* Theory Library/Monad_Syntax provides do-syntax for monad types.
wenzelm@41594
  2126
Syntax in Library/State_Monad has been changed to avoid ambiguities.
wenzelm@41594
  2127
INCOMPATIBILITY.
wenzelm@41594
  2128
wenzelm@41594
  2129
* Theory Library/SetsAndFunctions has been split into
wenzelm@41594
  2130
Library/Function_Algebras and Library/Set_Algebras; canonical names
wenzelm@41594
  2131
for instance definitions for functions; various improvements.
wenzelm@41594
  2132
INCOMPATIBILITY.
wenzelm@41594
  2133
wenzelm@41594
  2134
* Theory Library/Multiset provides stable quicksort implementation of
wenzelm@41594
  2135
sort_key.
wenzelm@41594
  2136
wenzelm@41594
  2137
* Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
wenzelm@41594
  2138
INCOMPATIBILITY.
wenzelm@41594
  2139
wenzelm@41594
  2140
* Session Multivariate_Analysis: introduced a type class for euclidean
wenzelm@41594
  2141
space.  Most theorems are now stated in terms of euclidean spaces
wenzelm@41594
  2142
instead of finite cartesian products.
wenzelm@41594
  2143
wenzelm@41594
  2144
  types
wenzelm@41594
  2145
    real ^ 'n ~>  'a::real_vector
wenzelm@41594
  2146
              ~>  'a::euclidean_space
wenzelm@41594
  2147
              ~>  'a::ordered_euclidean_space
wenzelm@41594
  2148
        (depends on your needs)
wenzelm@41594
  2149
wenzelm@41594
  2150
  constants
wenzelm@41594
  2151
     _ $ _        ~> _ $$ _
wenzelm@41594
  2152
     \<chi> x. _  ~> \<chi>\<chi> x. _
wenzelm@41594
  2153
     CARD('n)     ~> DIM('a)
wenzelm@41594
  2154
wenzelm@41594
  2155
Also note that the indices are now natural numbers and not from some
wenzelm@41594
  2156
finite type. Finite cartesian products of euclidean spaces, products
wenzelm@41594
  2157
of euclidean spaces the real and complex numbers are instantiated to
wenzelm@41594
  2158
be euclidean_spaces.  INCOMPATIBILITY.
wenzelm@41594
  2159
wenzelm@41594
  2160
* Session Probability: introduced pextreal as positive extended real
wenzelm@41594
  2161
numbers.  Use pextreal as value for measures.  Introduce the
wenzelm@41594
  2162
Radon-Nikodym derivative, product spaces and Fubini's theorem for
wenzelm@41594
  2163
arbitrary sigma finite measures.  Introduces Lebesgue measure based on
wenzelm@41594
  2164
the integral in Multivariate Analysis.  INCOMPATIBILITY.
wenzelm@41594
  2165
wenzelm@41594
  2166
* Session Imperative_HOL: revamped, corrected dozens of inadequacies.
wenzelm@41594
  2167
INCOMPATIBILITY.
wenzelm@41594
  2168
wenzelm@41594
  2169
* Session SPARK (with image HOL-SPARK) provides commands to load and
wenzelm@41594
  2170
prove verification conditions generated by the SPARK Ada program
wenzelm@41594
  2171
verifier.  See also src/HOL/SPARK and src/HOL/SPARK/Examples.
berghofe@41567
  2172
huffman@40621
  2173
ballarin@41433
  2174
*** HOL-Algebra ***
ballarin@41433
  2175
ballarin@41433
  2176
* Theorems for additive ring operations (locale abelian_monoid and
ballarin@41433
  2177
descendants) are generated by interpretation from their multiplicative
ballarin@41434
  2178
counterparts.  Names (in particular theorem names) have the mandatory
ballarin@41434
  2179
qualifier 'add'.  Previous theorem names are redeclared for
ballarin@41434
  2180
compatibility.
ballarin@41434
  2181
wenzelm@41571
  2182
* Structure "int_ring" is now an abbreviation (previously a
ballarin@41434
  2183
definition).  This fits more natural with advanced interpretations.
ballarin@41433
  2184
ballarin@41433
  2185
huffman@40621
  2186
*** HOLCF ***
huffman@40621
  2187
huffman@40621
  2188
* The domain package now runs in definitional mode by default: The
wenzelm@41571
  2189
former command 'new_domain' is now called 'domain'.  To use the domain
huffman@40621
  2190
package in its original axiomatic mode, use 'domain (unsafe)'.
huffman@40621
  2191
INCOMPATIBILITY.
huffman@40621
  2192
wenzelm@41571
  2193
* The new class "domain" is now the default sort.  Class "predomain"
wenzelm@41571
  2194
is an unpointed version of "domain". Theories can be updated by
wenzelm@41571
  2195
replacing sort annotations as shown below.  INCOMPATIBILITY.
huffman@40621
  2196
huffman@40621
  2197
  'a::type ~> 'a::countable
huffman@40621
  2198
  'a::cpo  ~> 'a::predomain
huffman@40621
  2199
  'a::pcpo ~> 'a::domain
huffman@40621
  2200
wenzelm@41571
  2201
* The old type class "rep" has been superseded by class "domain".
huffman@40621
  2202
Accordingly, users of the definitional package must remove any
wenzelm@41571
  2203
"default_sort rep" declarations.  INCOMPATIBILITY.
huffman@40621
  2204
huffman@41401
  2205
* The domain package (definitional mode) now supports unpointed
huffman@41401
  2206
predomain argument types, as long as they are marked 'lazy'. (Strict
wenzelm@41571
  2207
arguments must be in class "domain".) For example, the following
huffman@41401
  2208
domain definition now works:
huffman@41401
  2209
huffman@41401
  2210
  domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
huffman@41401
  2211
huffman@41401
  2212
* Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
wenzelm@41571
  2213
instances for types from main HOL: bool, nat, int, char, 'a + 'b,
wenzelm@41571
  2214
'a option, and 'a list.  Additionally, it configures fixrec and the
wenzelm@41571
  2215
domain package to work with these types.  For example:
huffman@41401
  2216
huffman@41401
  2217
  fixrec isInl :: "('a + 'b) u -> tr"
huffman@41401
  2218
    where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
huffman@41401
  2219
huffman@41401
  2220
  domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
huffman@41401
  2221
wenzelm@41571
  2222
* The "(permissive)" option of fixrec has been replaced with a
wenzelm@41571
  2223
per-equation "(unchecked)" option. See
wenzelm@41571
  2224
src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
wenzelm@41571
  2225
wenzelm@41571
  2226
* The "bifinite" class no longer fixes a constant "approx"; the class
wenzelm@41571
  2227
now just asserts that such a function exists.  INCOMPATIBILITY.
wenzelm@41571
  2228
wenzelm@41571
  2229
* Former type "alg_defl" has been renamed to "defl".  HOLCF no longer
huffman@41287
  2230
defines an embedding of type 'a defl into udom by default; instances
wenzelm@41571
  2231
of "bifinite" and "domain" classes are available in
wenzelm@41571
  2232
src/HOL/HOLCF/Library/Defl_Bifinite.thy.
wenzelm@41571
  2233
wenzelm@41571
  2234
* The syntax "REP('a)" has been replaced with "DEFL('a)".
wenzelm@41571
  2235
wenzelm@41571
  2236
* The predicate "directed" has been removed.  INCOMPATIBILITY.
wenzelm@41571
  2237
wenzelm@41571
  2238
* The type class "finite_po" has been removed.  INCOMPATIBILITY.
wenzelm@41571
  2239
wenzelm@41571
  2240
* The function "cprod_map" has been renamed to "prod_map".
huffman@41401
  2241
INCOMPATIBILITY.
huffman@41401
  2242
huffman@41401
  2243
* The monadic bind operator on each powerdomain has new binder syntax
wenzelm@41571
  2244
similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
wenzelm@41571
  2245
"upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
huffman@41401
  2246
huffman@41401
  2247
* The infix syntax for binary union on each powerdomain has changed
wenzelm@41571
  2248
from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
wenzelm@41571
  2249
syntax.  INCOMPATIBILITY.
wenzelm@41571
  2250
wenzelm@41571
  2251
* The constant "UU" has been renamed to "bottom".  The syntax "UU" is
huffman@41429
  2252
still supported as an input translation.
huffman@41429
  2253
huffman@40621
  2254
* Renamed some theorems (the original names are also still available).
wenzelm@41571
  2255
huffman@40621
  2256
  expand_fun_below   ~> fun_below_iff
huffman@40621
  2257
  below_fun_ext      ~> fun_belowI
huffman@40621
  2258
  expand_cfun_eq     ~> cfun_eq_iff
huffman@40621
  2259
  ext_cfun           ~> cfun_eqI
huffman@40621
  2260
  expand_cfun_below  ~> cfun_below_iff
huffman@40621
  2261
  below_cfun_ext     ~> cfun_belowI
huffman@40621
  2262
  cont2cont_Rep_CFun ~> cont2cont_APP
huffman@40621
  2263
huffman@40621
  2264
* The Abs and Rep functions for various types have changed names.
wenzelm@40948
  2265
Related theorem names have also changed to match. INCOMPATIBILITY.
wenzelm@41571
  2266
huffman@40621
  2267
  Rep_CFun  ~> Rep_cfun
huffman@40621
  2268
  Abs_CFun  ~> Abs_cfun
huffman@40621
  2269
  Rep_Sprod ~> Rep_sprod
huffman@40621
  2270
  Abs_Sprod ~> Abs_sprod
huffman@40621
  2271
  Rep_Ssum  ~> Rep_ssum
huffman@40621
  2272
  Abs_Ssum  ~> Abs_ssum
huffman@40621
  2273
huffman@40621
  2274
* Lemmas with names of the form *_defined_iff or *_strict_iff have
wenzelm@41571
  2275
been renamed to *_bottom_iff.  INCOMPATIBILITY.
huffman@40621
  2276
huffman@40621
  2277
* Various changes to bisimulation/coinduction with domain package:
wenzelm@41571
  2278
wenzelm@41571
  2279
  - Definitions of "bisim" constants no longer mention definedness.
wenzelm@41571
  2280
  - With mutual recursion, "bisim" predicate is now curried.
huffman@40621
  2281
  - With mutual recursion, each type gets a separate coind theorem.
huffman@40621
  2282
  - Variable names in bisim_def and coinduct rules have changed.
wenzelm@41571
  2283
huffman@40621
  2284
INCOMPATIBILITY.
huffman@40621
  2285
wenzelm@41571
  2286
* Case combinators generated by the domain package for type "foo" are
wenzelm@41571
  2287
now named "foo_case" instead of "foo_when".  INCOMPATIBILITY.
huffman@40621
  2288
huffman@40771
  2289
* Several theorems have been renamed to more accurately reflect the
wenzelm@41571
  2290
names of constants and types involved.  INCOMPATIBILITY.
wenzelm@41571
  2291
huffman@40771
  2292
  thelub_const    ~> lub_const
huffman@40771
  2293
  lub_const       ~> is_lub_const
huffman@40771
  2294
  thelubI         ~> lub_eqI
huffman@40771
  2295
  is_lub_lub      ~> is_lubD2
huffman@40771
  2296
  lubI            ~> is_lub_lub
huffman@40771
  2297
  unique_lub      ~> is_lub_unique
huffman@40771
  2298
  is_ub_lub       ~> is_lub_rangeD1
huffman@40771
  2299
  lub_bin_chain   ~> is_lub_bin_chain
huffman@41030
  2300
  lub_fun         ~> is_lub_fun
huffman@41030
  2301
  thelub_fun      ~> lub_fun
huffman@41031
  2302
  thelub_cfun     ~> lub_cfun
huffman@40771
  2303
  thelub_Pair     ~> lub_Pair
huffman@40771
  2304
  lub_cprod       ~> is_lub_prod
huffman@40771
  2305
  thelub_cprod    ~> lub_prod
huffman@40771
  2306
  minimal_cprod   ~> minimal_prod
huffman@40771
  2307
  inst_cprod_pcpo ~> inst_prod_pcpo
huffman@41430
  2308
  UU_I            ~> bottomI
huffman@41430
  2309
  compact_UU      ~> compact_bottom
huffman@41430
  2310
  deflation_UU    ~> deflation_bottom
huffman@41430
  2311
  finite_deflation_UU ~> finite_deflation_bottom
huffman@40771
  2312
wenzelm@41571
  2313
* Many legacy theorem names have been discontinued.  INCOMPATIBILITY.
wenzelm@41571
  2314
huffman@40621
  2315
  sq_ord_less_eq_trans ~> below_eq_trans
huffman@40621
  2316
  sq_ord_eq_less_trans ~> eq_below_trans
huffman@40621
  2317
  refl_less            ~> below_refl
huffman@40621
  2318
  trans_less           ~> below_trans
huffman@40621
  2319
  antisym_less         ~> below_antisym
huffman@40621
  2320
  antisym_less_inverse ~> po_eq_conv [THEN iffD1]
huffman@40621
  2321
  box_less             ~> box_below
huffman@40621
  2322
  rev_trans_less       ~> rev_below_trans
huffman@40621
  2323
  not_less2not_eq      ~> not_below2not_eq
huffman@40621
  2324
  less_UU_iff          ~> below_UU_iff
huffman@40621
  2325
  flat_less_iff        ~> flat_below_iff
huffman@40621
  2326
  adm_less             ~> adm_below
huffman@40621
  2327
  adm_not_less         ~> adm_not_below
huffman@40621
  2328
  adm_compact_not_less ~> adm_compact_not_below
huffman@40621
  2329
  less_fun_def         ~> below_fun_def
huffman@40621
  2330
  expand_fun_less      ~> fun_below_iff
huffman@40621
  2331
  less_fun_ext         ~> fun_belowI
huffman@40621
  2332
  less_discr_def       ~> below_discr_def
huffman@40621
  2333
  discr_less_eq        ~> discr_below_eq
huffman@40621
  2334
  less_unit_def        ~> below_unit_def
huffman@40621
  2335
  less_cprod_def       ~> below_prod_def
huffman@40621
  2336
  prod_lessI           ~> prod_belowI
huffman@40621
  2337
  Pair_less_iff        ~> Pair_below_iff
huffman@40621
  2338
  fst_less_iff         ~> fst_below_iff
huffman@40621
  2339
  snd_less_iff         ~> snd_below_iff
huffman@40621
  2340
  expand_cfun_less     ~> cfun_below_iff
huffman@40621
  2341
  less_cfun_ext        ~> cfun_belowI
huffman@40621
  2342
  injection_less       ~> injection_below
huffman@40621
  2343
  less_up_def          ~> below_up_def
huffman@40621
  2344
  not_Iup_less         ~> not_Iup_below
huffman@40621
  2345
  Iup_less             ~> Iup_below
huffman@40621
  2346
  up_less              ~> up_below
huffman@40621
  2347
  Def_inject_less_eq   ~> Def_below_Def
huffman@40621
  2348
  Def_less_is_eq       ~> Def_below_iff
huffman@40621
  2349
  spair_less_iff       ~> spair_below_iff
huffman@40621
  2350
  less_sprod           ~> below_sprod
huffman@40621
  2351
  spair_less           ~> spair_below
huffman@40621
  2352
  sfst_less_iff        ~> sfst_below_iff
huffman@40621
  2353
  ssnd_less_iff        ~> ssnd_below_iff
huffman@40621
  2354
  fix_least_less       ~> fix_least_below
huffman@40621
  2355
  dist_less_one        ~> dist_below_one
huffman@40621
  2356
  less_ONE             ~> below_ONE
huffman@40621
  2357
  ONE_less_iff         ~> ONE_below_iff
huffman@40621
  2358
  less_sinlD           ~> below_sinlD
huffman@40621
  2359
  less_sinrD           ~> below_sinrD
huffman@40621
  2360
huffman@40621
  2361
wenzelm@40948
  2362
*** FOL and ZF ***
haftmann@38522
  2363
wenzelm@41310
  2364
* All constant names are now qualified internally and use proper
wenzelm@41310
  2365
identifiers, e.g. "IFOL.eq" instead of "op =".  INCOMPATIBILITY.
wenzelm@41310
  2366
haftmann@38522
  2367
wenzelm@37868
  2368
*** ML ***
wenzelm@37868
  2369
wenzelm@41594
  2370
* Antiquotation @{assert} inlines a function bool -> unit that raises
wenzelm@41594
  2371
Fail if the argument is false.  Due to inlining the source position of
wenzelm@41594
  2372
failed assertions is included in the error output.
wenzelm@41594
  2373
wenzelm@41594
  2374
* Discontinued antiquotation @{theory_ref}, which is obsolete since ML
wenzelm@41594
  2375
text is in practice always evaluated with a stable theory checkpoint.
wenzelm@41594
  2376
Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
wenzelm@41594
  2377
wenzelm@41594
  2378
* Antiquotation @{theory A} refers to theory A from the ancestry of
wenzelm@41594
  2379
the current context, not any accidental theory loader state as before.
wenzelm@41594
  2380
Potential INCOMPATIBILITY, subtle change in semantics.
wenzelm@41228
  2381
wenzelm@40956
  2382
* Syntax.pretty_priority (default 0) configures the required priority
wenzelm@40956
  2383
of pretty-printed output and thus affects insertion of parentheses.
wenzelm@40956
  2384
wenzelm@40959
  2385
* Syntax.default_root (default "any") configures the inner syntax
wenzelm@40959
  2386
category (nonterminal symbol) for parsing of terms.
wenzelm@40959
  2387
wenzelm@40722
  2388
* Former exception Library.UnequalLengths now coincides with
wenzelm@40722
  2389
ListPair.UnequalLengths.
wenzelm@40722
  2390
wenzelm@41594
  2391
* Renamed structure MetaSimplifier to Raw_Simplifier.  Note that the
wenzelm@41594
  2392
main functionality is provided by structure Simplifier.
wenzelm@41594
  2393
wenzelm@40627
  2394
* Renamed raw "explode" function to "raw_explode" to emphasize its
wenzelm@40627
  2395
meaning.  Note that internally to Isabelle, Symbol.explode is used in
wenzelm@40627
  2396
almost all situations.
wenzelm@40627
  2397
wenzelm@40318
  2398
* Discontinued obsolete function sys_error and exception SYS_ERROR.
wenzelm@40318
  2399
See implementation manual for further details on exceptions in
wenzelm@40318
  2400
Isabelle/ML.
wenzelm@40318
  2401
wenzelm@39616
  2402
* Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
wenzelm@39616
  2403
meaning.
wenzelm@39616
  2404
wenzelm@39557
  2405
* Renamed structure PureThy to Pure_Thy and moved most of its
wenzelm@39557
  2406
operations to structure Global_Theory, to emphasize that this is
wenzelm@39557
  2407
rarely-used global-only stuff.
wenzelm@39557
  2408
wenzelm@39513
  2409
* Discontinued Output.debug.  Minor INCOMPATIBILITY, use plain writeln
wenzelm@39513
  2410
instead (or tracing for high-volume output).
wenzelm@39513
  2411
wenzelm@38980
  2412
* Configuration option show_question_marks only affects regular pretty
wenzelm@38980
  2413
printing of types and terms, not raw Term.string_of_vname.
wenzelm@38980
  2414
wenzelm@39164
  2415
* ML_Context.thm and ML_Context.thms are no longer pervasive.  Rare
wenzelm@39164
  2416
INCOMPATIBILITY, superseded by static antiquotations @{thm} and
wenzelm@39164
  2417
@{thms} for most purposes.
wenzelm@39164
  2418
wenzelm@41594
  2419
* ML structure Unsynchronized is never opened, not even in Isar
wenzelm@38980
  2420
interaction mode as before.  Old Unsynchronized.set etc. have been
wenzelm@38980
  2421
discontinued -- use plain := instead.  This should be *rare* anyway,
wenzelm@38980
  2422
since modern tools always work via official context data, notably
wenzelm@38980
  2423
configuration options.
wenzelm@38980
  2424
wenzelm@39239
  2425
* Parallel and asynchronous execution requires special care concerning
wenzelm@39239
  2426
interrupts.  Structure Exn provides some convenience functions that
wenzelm@39239
  2427
avoid working directly with raw Interrupt.  User code must not absorb
wenzelm@39239
  2428
interrupts -- intermediate handling (for cleanup etc.) needs to be
wenzelm@39239
  2429
followed by re-raising of the original exception.  Another common
wenzelm@39239
  2430
source of mistakes are "handle _" patterns, which make the meaning of
wenzelm@39239
  2431
the program subject to physical effects of the environment.
wenzelm@39239
  2432
wenzelm@37868
  2433
wenzelm@37868
  2434
wenzelm@37144
  2435
New in Isabelle2009-2 (June 2010)
wenzelm@37144
  2436
---------------------------------
haftmann@33993
  2437
wenzelm@35260
  2438
*** General ***
wenzelm@35260
  2439
wenzelm@35436
  2440
* Authentic syntax for *all* logical entities (type classes, type
wenzelm@35436
  2441
constructors, term constants): provides simple and robust
wenzelm@35436
  2442
correspondence between formal entities and concrete syntax.  Within
wenzelm@35436
  2443
the parse tree / AST representations, "constants" are decorated by
wenzelm@35436
  2444
their category (class, type, const) and spelled out explicitly with
wenzelm@35436
  2445
their full internal name.
wenzelm@35436
  2446
wenzelm@35436
  2447
Substantial INCOMPATIBILITY concerning low-level syntax declarations
wenzelm@35436
  2448
and translations (translation rules and translation functions in ML).
wenzelm@35436
  2449
Some hints on upgrading:
wenzelm@35260
  2450
wenzelm@35260
  2451
  - Many existing uses of 'syntax' and 'translations' can be replaced
wenzelm@35436
  2452
    by more modern 'type_notation', 'notation' and 'abbreviation',
wenzelm@35436
  2453
    which are independent of this issue.
wenzelm@35260
  2454
wenzelm@35260
  2455
  - 'translations' require markup within the AST; the term syntax
wenzelm@35260
  2456
    provides the following special forms:
wenzelm@35260
  2457
wenzelm@35260
  2458
      CONST c   -- produces syntax version of constant c from context
wenzelm@35261
  2459
      XCONST c  -- literally c, checked as constant from context
wenzelm@35261
  2460
      c         -- literally c, if declared by 'syntax'
wenzelm@35261
  2461
wenzelm@35261
  2462
    Plain identifiers are treated as AST variables -- occasionally the
wenzelm@35261
  2463
    system indicates accidental variables via the error "rhs contains
wenzelm@35261
  2464
    extra variables".
wenzelm@35260
  2465
wenzelm@35436
  2466
    Type classes and type constructors are marked according to their
wenzelm@35436
  2467
    concrete syntax.  Some old translations rules need to be written
wenzelm@35436
  2468
    for the "type" category, using type constructor application
wenzelm@35436
  2469
    instead of pseudo-term application of the default category
wenzelm@35436
  2470
    "logic".
wenzelm@35436
  2471
wenzelm@35260
  2472
  - 'parse_translation' etc. in ML may use the following
wenzelm@35260
  2473
    antiquotations:
wenzelm@35260
  2474
wenzelm@35436
  2475
      @{class_syntax c}   -- type class c within parse tree / AST
wenzelm@35436
  2476
      @{term_syntax c}    -- type constructor c within parse tree / AST
wenzelm@35260
  2477
      @{const_syntax c}   -- ML version of "CONST c" above
wenzelm@35260
  2478
      @{syntax_const c}   -- literally c (checked wrt. 'syntax' declarations)
wenzelm@35260
  2479
wenzelm@35436
  2480
  - Literal types within 'typed_print_translations', i.e. those *not*
wenzelm@35436
  2481
    represented as pseudo-terms are represented verbatim.  Use @{class
wenzelm@35436
  2482
    c} or @{type_name c} here instead of the above syntax
wenzelm@35436
  2483
    antiquotations.
wenzelm@35436
  2484
wenzelm@35260
  2485
Note that old non-authentic syntax was based on unqualified base
wenzelm@35436
  2486
names, so all of the above "constant" names would coincide.  Recall
wenzelm@35436
  2487
that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
wenzelm@35436
  2488
diagnose syntax problems.
wenzelm@35260
  2489
wenzelm@35351
  2490
* Type constructors admit general mixfix syntax, not just infix.
wenzelm@35351
  2491
wenzelm@36508
  2492
* Concrete syntax may be attached to local entities without a proof
wenzelm@36508
  2493
body, too.  This works via regular mixfix annotations for 'fix',
wenzelm@36508
  2494
'def', 'obtain' etc. or via the explicit 'write' command, which is
wenzelm@36508
  2495
similar to the 'notation' command in theory specifications.
wenzelm@36508
  2496
wenzelm@37351
  2497
* Discontinued unnamed infix syntax (legacy feature for many years) --
wenzelm@37351
  2498
need to specify constant name and syntax separately.  Internal ML
wenzelm@37351
  2499
datatype constructors have been renamed from InfixName to Infix etc.
wenzelm@37351
  2500
Minor INCOMPATIBILITY.
wenzelm@37351
  2501
wenzelm@37351
  2502
* Schematic theorem statements need to be explicitly markup as such,
wenzelm@37351
  2503
via commands 'schematic_lemma', 'schematic_theorem',
wenzelm@37351
  2504
'schematic_corollary'.  Thus the relevance of the proof is made
wenzelm@37351
  2505
syntactically clear, which impacts performance in a parallel or
wenzelm@37351
  2506
asynchronous interactive environment.  Minor INCOMPATIBILITY.
wenzelm@37351
  2507
wenzelm@35613
  2508
* Use of cumulative prems via "!" in some proof methods has been
wenzelm@37351
  2509
discontinued (old legacy feature).
wenzelm@35613
  2510
boehmes@35979
  2511
* References 'trace_simp' and 'debug_simp' have been replaced by
wenzelm@36857
  2512
configuration options stored in the context. Enabling tracing (the
wenzelm@36857
  2513
case of debugging is similar) in proofs works via
wenzelm@36857
  2514
wenzelm@36857
  2515
  using [[trace_simp = true]]
wenzelm@36857
  2516
wenzelm@36857
  2517
Tracing is then active for all invocations of the simplifier in
wenzelm@36857
  2518
subsequent goal refinement steps. Tracing may also still be enabled or
wenzelm@40780
  2519
disabled via the ProofGeneral settings menu.
boehmes@35979
  2520
wenzelm@36177
  2521
* Separate commands 'hide_class', 'hide_type', 'hide_const',
wenzelm@36177
  2522
'hide_fact' replace the former 'hide' KIND command.  Minor
wenzelm@36177
  2523
INCOMPATIBILITY.
wenzelm@36177
  2524
wenzelm@37298
  2525
* Improved parallelism of proof term normalization: usedir -p2 -q0 is
wenzelm@37298
  2526
more efficient than combinations with -q1 or -q2.
wenzelm@37298
  2527
wenzelm@35260
  2528
haftmann@34170
  2529
*** Pure ***
haftmann@34170
  2530
wenzelm@37351
  2531
* Proofterms record type-class reasoning explicitly, using the
wenzelm@37351
  2532
"unconstrain" operation internally.  This eliminates all sort
wenzelm@37351
  2533
constraints from a theorem and proof, introducing explicit
wenzelm@37351
  2534
OFCLASS-premises.  On the proof term level, this operation is
wenzelm@37351
  2535
automatically applied at theorem boundaries, such that closed proofs
wenzelm@37351
  2536
are always free of sort constraints.  INCOMPATIBILITY for tools that
wenzelm@37351
  2537
inspect proof terms.
haftmann@36147
  2538
wenzelm@35765
  2539
* Local theory specifications may depend on extra type variables that
wenzelm@35765
  2540
are not present in the result type -- arguments TYPE('a) :: 'a itself
wenzelm@35765
  2541
are added internally.  For example:
wenzelm@35765
  2542
wenzelm@35765
  2543
  definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
wenzelm@35765
  2544
wenzelm@37351
  2545
* Predicates of locales introduced by classes carry a mandatory
wenzelm@37351
  2546
"class" prefix.  INCOMPATIBILITY.
wenzelm@37351
  2547
wenzelm@37351
  2548
* Vacuous class specifications observe default sort.  INCOMPATIBILITY.
wenzelm@37351
  2549
wenzelm@37351
  2550
* Old 'axclass' command has been discontinued.  INCOMPATIBILITY, use
wenzelm@37351
  2551
'class' instead.
wenzelm@37351
  2552
wenzelm@37351
  2553
* Command 'code_reflect' allows to incorporate generated ML code into
wenzelm@37351
  2554
runtime environment; replaces immature code_datatype antiquotation.
wenzelm@37351
  2555
INCOMPATIBILITY.
wenzelm@37351
  2556
wenzelm@37351
  2557
* Code generator: simple concept for abstract datatypes obeying
wenzelm@37351
  2558
invariants.
wenzelm@37351
  2559
wenzelm@36857
  2560
* Code generator: details of internal data cache have no impact on the
wenzelm@36857
  2561
user space functionality any longer.
wenzelm@36857
  2562
wenzelm@37351
  2563
* Methods "unfold_locales" and "intro_locales" ignore non-locale
wenzelm@37351
  2564
subgoals.  This is more appropriate for interpretations with 'where'.
wenzelm@36857
  2565
INCOMPATIBILITY.
haftmann@34170
  2566
wenzelm@36356
  2567
* Command 'example_proof' opens an empty proof body.  This allows to
wenzelm@36356
  2568
experiment with Isar, without producing any persistent result.
wenzelm@36356
  2569
wenzelm@35413
  2570
* Commands 'type_notation' and 'no_type_notation' declare type syntax
wenzelm@35413
  2571
within a local theory context, with explicit checking of the
wenzelm@35413
  2572
constructors involved (in contrast to the raw 'syntax' versions).
wenzelm@35413
  2573
wenzelm@36178
  2574
* Commands 'types' and 'typedecl' now work within a local theory
wenzelm@36178
  2575
context -- without introducing dependencies on parameters or
wenzelm@36178
  2576
assumptions, which is not possible in Isabelle/Pure.
wenzelm@35681
  2577
wenzelm@36857
  2578
* Command 'defaultsort' has been renamed to 'default_sort', it works
wenzelm@36857
  2579
within a local theory context.  Minor INCOMPATIBILITY.
wenzelm@36454
  2580
haftmann@34170
  2581
haftmann@33993
  2582
*** HOL ***
haftmann@33993
  2583
wenzelm@37351
  2584
* Command 'typedef' now works within a local theory context -- without
wenzelm@37351
  2585
introducing dependencies on parameters or assumptions, which is not
wenzelm@37351
  2586
possible in Isabelle/Pure/HOL.  Note that the logical environment may
wenzelm@37351
  2587
contain multiple interpretations of local typedefs (with different
wenzelm@37351
  2588
non-emptiness proofs), even in a global theory context.
wenzelm@37351
  2589
wenzelm@37351
  2590
* New package for quotient types.  Commands 'quotient_type' and
wenzelm@37351
  2591
'quotient_definition' may be used for defining types and constants by
wenzelm@37351
  2592
quotient constructions.  An example is the type of integers created by
wenzelm@37351
  2593
quotienting pairs of natural numbers:
wenzelm@37380
  2594
wenzelm@37351
  2595
  fun
wenzelm@37380
  2596
    intrel :: "(nat * nat) => (nat * nat) => bool"
wenzelm@37351
  2597
  where
wenzelm@37351
  2598
    "intrel (x, y) (u, v) = (x + v = u + y)"
wenzelm@37351
  2599
wenzelm@37380
  2600
  quotient_type int = "nat * nat" / intrel
wenzelm@37351
  2601
    by (auto simp add: equivp_def expand_fun_eq)
wenzelm@37380
  2602
wenzelm@37351
  2603
  quotient_definition
wenzelm@37351
  2604
    "0::int" is "(0::nat, 0::nat)"
wenzelm@37351
  2605
wenzelm@37351
  2606
The method "lifting" can be used to lift of theorems from the
wenzelm@37351
  2607
underlying "raw" type to the quotient type.  The example
wenzelm@37351
  2608
src/HOL/Quotient_Examples/FSet.thy includes such a quotient
wenzelm@37351
  2609
construction and provides a reasoning infrastructure for finite sets.
wenzelm@37351
  2610
wenzelm@37351
  2611
* Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
wenzelm@37351
  2612
clash with new theory Quotient in Main HOL.
wenzelm@37351
  2613
wenzelm@37351
  2614
* Moved the SMT binding into the main HOL session, eliminating
wenzelm@37351
  2615
separate HOL-SMT session.
wenzelm@37351
  2616
haftmann@37020
  2617
* List membership infix mem operation is only an input abbreviation.
haftmann@37020
  2618
INCOMPATIBILITY.
haftmann@37020
  2619
wenzelm@37144
  2620
* Theory Library/Word.thy has been removed.  Use library Word/Word.thy
wenzelm@37144
  2621
for future developements; former Library/Word.thy is still present in
wenzelm@37144
  2622
the AFP entry RSAPPS.
haftmann@36963
  2623
wenzelm@36857
  2624
* Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
wenzelm@36857
  2625
longer shadowed.  INCOMPATIBILITY.
haftmann@36808
  2626
huffman@36836
  2627
* Dropped theorem duplicate comp_arith; use semiring_norm instead.
huffman@36836
  2628
INCOMPATIBILITY.
huffman@36836
  2629
huffman@36836
  2630
* Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
huffman@36836
  2631
INCOMPATIBILITY.
haftmann@36714
  2632
wenzelm@36857
  2633
* Dropped normalizing_semiring etc; use the facts in semiring classes
wenzelm@36857
  2634
instead.  INCOMPATIBILITY.
wenzelm@36857
  2635
huffman@36979
  2636
* Dropped several real-specific versions of lemmas about floor and
wenzelm@37351
  2637
ceiling; use the generic lemmas from theory "Archimedean_Field"
wenzelm@37351
  2638
instead.  INCOMPATIBILITY.
huffman@36979
  2639
huffman@36979
  2640
  floor_number_of_eq         ~> floor_number_of
huffman@36979
  2641
  le_floor_eq_number_of      ~> number_of_le_floor
huffman@36979
  2642
  le_floor_eq_zero           ~> zero_le_floor
huffman@36979
  2643
  le_floor_eq_one            ~> one_le_floor
huffman@36979
  2644
  floor_less_eq_number_of    ~> floor_less_number_of
huffman@36979
  2645
  floor_less_eq_zero         ~> floor_less_zero
huffman@36979
  2646
  floor_less_eq_one          ~> floor_less_one
huffman@36979
  2647
  less_floor_eq_number_of    ~> number_of_less_floor
huffman@36979
  2648
  less_floor_eq_zero         ~> zero_less_floor
huffman@36979
  2649
  less_floor_eq_one          ~> one_less_floor
huffman@36979
  2650
  floor_le_eq_number_of      ~> floor_le_number_of
huffman@36979
  2651
  floor_le_eq_zero           ~> floor_le_zero
huffman@36979
  2652
  floor_le_eq_one            ~> floor_le_one
huffman@36979
  2653
  floor_subtract_number_of   ~> floor_diff_number_of
huffman@36979
  2654
  floor_subtract_one         ~> floor_diff_one
huffman@36979
  2655
  ceiling_number_of_eq       ~> ceiling_number_of
huffman@36979
  2656
  ceiling_le_eq_number_of    ~> ceiling_le_number_of
huffman@36979
  2657
  ceiling_le_zero_eq         ~> ceiling_le_zero
huffman@36979
  2658
  ceiling_le_eq_one          ~> ceiling_le_one
huffman@36979
  2659
  less_ceiling_eq_number_of  ~> number_of_less_ceiling
huffman@36979
  2660
  less_ceiling_eq_zero       ~> zero_less_ceiling
huffman@36979
  2661
  less_ceiling_eq_one        ~> one_less_ceiling
huffman@36979
  2662
  ceiling_less_eq_number_of  ~> ceiling_less_number_of
huffman@36979
  2663
  ceiling_less_eq_zero       ~> ceiling_less_zero
huffman@36979
  2664
  ceiling_less_eq_one        ~> ceiling_less_one
huffman@36979
  2665
  le_ceiling_eq_number_of    ~> number_of_le_ceiling
huffman@36979
  2666
  le_ceiling_eq_zero         ~> zero_le_ceiling
huffman@36979
  2667
  le_ceiling_eq_one          ~> one_le_ceiling
huffman@36979
  2668
  ceiling_subtract_number_of ~> ceiling_diff_number_of
huffman@36979
  2669
  ceiling_subtract_one       ~> ceiling_diff_one
huffman@36979
  2670
wenzelm@37144
  2671
* Theory "Finite_Set": various folding_XXX locales facilitate the
wenzelm@36857
  2672
application of the various fold combinators on finite sets.
wenzelm@36857
  2673
wenzelm@36857
  2674
* Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
wenzelm@36857
  2675
provides abstract red-black tree type which is backed by "RBT_Impl" as
wenzelm@36857
  2676
implementation.  INCOMPATIBILTY.
haftmann@36147
  2677
huffman@36830
  2678
* Theory Library/Coinductive_List has been removed -- superseded by
wenzelm@35763
  2679
AFP/thys/Coinductive.
wenzelm@35763
  2680
huffman@36829
  2681
* Theory PReal, including the type "preal" and related operations, has
huffman@36829
  2682
been removed.  INCOMPATIBILITY.
huffman@36829
  2683
wenzelm@37380
  2684
* Real: new development using Cauchy Sequences.
wenzelm@37380
  2685
wenzelm@37351
  2686
* Split off theory "Big_Operators" containing setsum, setprod,
wenzelm@37351
  2687
Inf_fin, Sup_fin, Min, Max from theory Finite_Set.  INCOMPATIBILITY.
wenzelm@36857
  2688
wenzelm@36857
  2689
* Theory "Rational" renamed to "Rat", for consistency with "Nat",
wenzelm@36857
  2690
"Int" etc.  INCOMPATIBILITY.
wenzelm@36857
  2691
wenzelm@37351
  2692
* Constant Rat.normalize needs to be qualified.  INCOMPATIBILITY.
wenzelm@37143
  2693
wenzelm@36857
  2694
* New set of rules "ac_simps" provides combined assoc / commute
wenzelm@36857
  2695
rewrites for all interpretations of the appropriate generic locales.
wenzelm@36857
  2696