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