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