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