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