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