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