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