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