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