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