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