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