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