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