NEWS
author wenzelm
Sun Dec 16 22:10:37 2012 +0100 (2012-12-16)
changeset 50572 b33912e68b84
parent 50526 899c9c4e4a4c
child 50592 a39250169636
permissions -rw-r--r--
updated README;
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@47887
     4
New in this Isabelle version
wenzelm@47887
     5
----------------------------
wenzelm@47887
     6
wenzelm@47967
     7
*** General ***
wenzelm@47967
     8
wenzelm@50126
     9
* Theorem status about oracles and unfinished/failed future proofs is
wenzelm@50126
    10
no longer printed by default, since it is incompatible with
wenzelm@50126
    11
incremental / parallel checking of the persistent document model.  ML
wenzelm@50126
    12
function Thm.peek_status may be used to inspect a snapshot of the
wenzelm@50126
    13
ongoing evaluation process.  Note that in batch mode --- notably
wenzelm@50126
    14
isabelle build --- the system ensures that future proofs of all
wenzelm@50126
    15
accessible theorems in the theory context are finished (as before).
wenzelm@50126
    16
wenzelm@49699
    17
* Configuration option show_markup controls direct inlining of markup
wenzelm@49699
    18
into the printed representation of formal entities --- notably type
wenzelm@49699
    19
and sort constraints.  This enables Prover IDE users to retrieve that
wenzelm@49699
    20
information via tooltips in the output window, for example.
wenzelm@49699
    21
wenzelm@48890
    22
* Command 'ML_file' evaluates ML text from a file directly within the
wenzelm@48890
    23
theory, without any predeclaration via 'uses' in the theory header.
wenzelm@48890
    24
wenzelm@49243
    25
* Old command 'use' command and corresponding keyword 'uses' in the
wenzelm@49243
    26
theory header are legacy features and will be discontinued soon.
wenzelm@49243
    27
Tools that load their additional source files may imitate the
wenzelm@49243
    28
'ML_file' implementation, such that the system can take care of
wenzelm@49243
    29
dependencies properly.
wenzelm@49243
    30
wenzelm@47967
    31
* Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
wenzelm@47967
    32
is called fastforce / fast_force_tac already since Isabelle2011-1.
wenzelm@47967
    33
wenzelm@50110
    34
* Updated and extended "isar-ref" and "implementation" manual, reduced
wenzelm@50110
    35
remaining material in old "ref" manual.
wenzelm@48120
    36
wenzelm@49841
    37
* Improved support for auxiliary contexts indicate block structure for
wenzelm@49841
    38
specifications: nesting of "context fixes ... context assumes ..."
wenzelm@49841
    39
and "class ... context ...".
wenzelm@49841
    40
wenzelm@49869
    41
* More informative error messages for Isar proof commands involving
wenzelm@49869
    42
lazy enumerations (method applications etc.).
wenzelm@49869
    43
wenzelm@50213
    44
* Refined 'help' command to retrieve outer syntax commands according
wenzelm@50213
    45
to name patterns (with clickable results).
wenzelm@50213
    46
wenzelm@47967
    47
wenzelm@49968
    48
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@49968
    49
wenzelm@49968
    50
* Parallel terminal proofs ('by') are enabled by default, likewise
wenzelm@49968
    51
proofs that are built into packages like 'datatype', 'function'.  This
wenzelm@49968
    52
allows to "run ahead" checking the theory specifications on the
wenzelm@49968
    53
surface, while the prover is still crunching on internal
wenzelm@49968
    54
justifications.  Unfinished / cancelled proofs are restarted as
wenzelm@49968
    55
required to complete full proof checking eventually.
wenzelm@49968
    56
wenzelm@49968
    57
* Improved output panel with tooltips, hyperlinks etc. based on the
wenzelm@49968
    58
same Rich_Text_Area as regular Isabelle/jEdit buffers.  Activation of
wenzelm@49968
    59
tooltips leads to some window that supports the same recursively,
wenzelm@49968
    60
which can lead to stacks of tooltips as the semantic document content
wenzelm@49968
    61
is explored.  ESCAPE closes the whole stack, individual windows may be
wenzelm@49968
    62
closed separately, or detached to become independent jEdit dockables.
wenzelm@49968
    63
wenzelm@49968
    64
* More robust incremental parsing of outer syntax (partial comments,
wenzelm@49968
    65
malformed symbols).  Changing the balance of open/close quotes and
wenzelm@49968
    66
comment delimiters works more conveniently with unfinished situations
wenzelm@49968
    67
that frequently occur in user interaction.
wenzelm@49968
    68
wenzelm@49968
    69
* More efficient painting and improved reactivity when editing large
wenzelm@49968
    70
files.  More scalable management of formal document content.
wenzelm@49968
    71
wenzelm@50505
    72
* Smarter handling of tracing messages: prover process pauses after
wenzelm@50505
    73
certain number of messages per command transaction, with some user
wenzelm@50505
    74
dialog to stop or continue.  This avoids swamping the front-end with
wenzelm@50119
    75
potentially infinite message streams.
wenzelm@49968
    76
wenzelm@49968
    77
* More plugin options and preferences, based on Isabelle/Scala.  The
wenzelm@49968
    78
jEdit plugin option panel provides access to some Isabelle/Scala
wenzelm@49968
    79
options, including tuning parameters for editor reactivity and color
wenzelm@49968
    80
schemes.
wenzelm@49968
    81
wenzelm@50184
    82
* Dockable window "Symbols" provides some editing support for Isabelle
wenzelm@50184
    83
symbols.
wenzelm@50184
    84
wenzelm@50183
    85
* Improved editing support for control styles: subscript, superscript,
wenzelm@50183
    86
bold, reset of style -- operating on single symbols or text
wenzelm@50198
    87
selections.  Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
wenzelm@50198
    88
wenzelm@50198
    89
* Actions isabelle.increase-font-size and isabelle.decrease-font-size
wenzelm@50198
    90
adjust the main text area font size, and its derivatives for output,
wenzelm@50198
    91
tooltips etc.  Cf. keyboard shortcuts C-PLUS and C-MINUS.
wenzelm@50183
    92
wenzelm@50406
    93
* Implicit check and build dialog of the specified logic session
wenzelm@50406
    94
image.  For example, HOL, HOLCF, HOL-Nominal can be produced on
wenzelm@50406
    95
demand, without bundling big platform-dependent heap images in the
wenzelm@50406
    96
Isabelle distribution.
wenzelm@50406
    97
wenzelm@49968
    98
* Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
wenzelm@49968
    99
from Oracle provide better multi-platform experience.  This version is
wenzelm@49968
   100
now bundled exclusively with Isabelle.
wenzelm@49968
   101
wenzelm@49968
   102
wenzelm@48205
   103
*** Pure ***
wenzelm@48205
   104
haftmann@48431
   105
* Code generation for Haskell: restrict unqualified imports from
haftmann@48431
   106
Haskell Prelude to a small set of fundamental operations.
haftmann@48431
   107
haftmann@48371
   108
* Command "export_code": relative file names are interpreted
haftmann@48371
   109
relatively to master directory of current theory rather than
haftmann@48371
   110
the rather arbitrary current working directory.
haftmann@48371
   111
INCOMPATIBILITY.
haftmann@48371
   112
wenzelm@48205
   113
* Discontinued obsolete attribute "COMP".  Potential INCOMPATIBILITY,
wenzelm@48205
   114
use regular rule composition via "OF" / "THEN", or explicit proof
wenzelm@48205
   115
structure instead.  Note that Isabelle/ML provides a variety of
wenzelm@48205
   116
operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
wenzelm@48205
   117
with some care where this is really required.
wenzelm@48205
   118
wenzelm@48792
   119
* Command 'typ' supports an additional variant with explicit sort
wenzelm@48792
   120
constraint, to infer and check the most general type conforming to a
wenzelm@48792
   121
given given sort.  Example (in HOL):
wenzelm@48792
   122
wenzelm@48792
   123
  typ "_ * _ * bool * unit" :: finite
wenzelm@48792
   124
wenzelm@48205
   125
bulwahn@48013
   126
*** HOL ***
bulwahn@48013
   127
haftmann@49972
   128
* Removed constant "chars".  Prefer "Enum.enum" on type "char"
haftmann@49972
   129
directly.  INCOMPATIBILITY.
haftmann@49972
   130
haftmann@49948
   131
* Moved operation product, sublists and n_lists from Enum.thy
haftmann@49948
   132
to List.thy.  INCOMPATIBILITY.
haftmann@49948
   133
wenzelm@49836
   134
* Simplified 'typedef' specifications: historical options for implicit
wenzelm@49836
   135
set definition and alternative name have been discontinued.  The
wenzelm@49836
   136
former behavior of "typedef (open) t = A" is now the default, but
wenzelm@49836
   137
written just "typedef t = A".  INCOMPATIBILITY, need to adapt theories
wenzelm@49836
   138
accordingly.
wenzelm@49836
   139
haftmann@49822
   140
* Theory "Library/Multiset":
haftmann@49822
   141
haftmann@49822
   142
  - Renamed constants
haftmann@49822
   143
      fold_mset ~> Multiset.fold  -- for coherence with other fold combinators
haftmann@49822
   144
haftmann@49822
   145
  - Renamed facts
haftmann@49822
   146
      fold_mset_commute ~> fold_mset_comm  -- for coherence with fold_comm
haftmann@49822
   147
haftmann@49822
   148
INCOMPATIBILITY.
haftmann@49822
   149
haftmann@49739
   150
* Theorem UN_o generalized to SUP_comp.  INCOMPATIBILITY.
haftmann@49739
   151
haftmann@49738
   152
* Class "comm_monoid_diff" formalises properties of bounded
haftmann@49388
   153
subtraction, with natural numbers and multisets as typical instances.
haftmann@49388
   154
haftmann@49190
   155
* Theory "Library/Option_ord" provides instantiation of option type
haftmann@49190
   156
to lattice type classes.
haftmann@49190
   157
haftmann@49738
   158
* New combinator "Option.these" with type "'a option set => 'a set".
haftmann@49189
   159
Christian@49145
   160
* Renamed theory Library/List_Prefix to Library/Sublist.
Christian@49145
   161
INCOMPATIBILITY.  Related changes are:
Christian@49145
   162
Christian@49145
   163
  - Renamed constants:
Christian@49145
   164
Christian@49145
   165
      prefix ~> prefixeq
Christian@49145
   166
      strict_prefix ~> prefix
Christian@49145
   167
Christian@49145
   168
    Renamed lemmas accordingly, INCOMPATIBILITY.
Christian@49145
   169
Christian@49145
   170
  - Replaced constant "postfix" by "suffixeq" with swapped argument order
Christian@49145
   171
    (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped old infix
Christian@49145
   172
    syntax "xs >>= ys"; use "suffixeq ys xs" instead.  Renamed lemmas
Christian@49145
   173
    accordingly.  INCOMPATIBILITY.
Christian@49145
   174
Christian@50516
   175
  - New constant "list_hembeq" for homeomorphic embedding on lists. New
Christian@50516
   176
    abbreviation "sublisteq" for special case "list_hembeq (op =)".
Christian@49145
   177
Christian@49145
   178
  - Library/Sublist does no longer provide "order" and "bot" type class
Christian@49145
   179
    instances for the prefix order (merely corresponding locale
Christian@49145
   180
    interpretations). The type class instances are to be found in
Christian@49145
   181
    Library/Prefix_Order. INCOMPATIBILITY.
Christian@49145
   182
Christian@49145
   183
  - The sublist relation from Library/Sublist_Order is now based on
Christian@50516
   184
    "Sublist.sublisteq". Replaced lemmas:
Christian@50516
   185
Christian@50516
   186
      le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
Christian@50516
   187
      le_list_append_mono ~> Sublist.list_hembeq_append_mono
Christian@50516
   188
      le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
Christian@50516
   189
      le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
Christian@50516
   190
      le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
Christian@50516
   191
      le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
Christian@50516
   192
      le_list_drop_Cons ~> Sublist.sublisteq_Cons'
Christian@50516
   193
      le_list_drop_many ~> Sublist.sublisteq_drop_many
Christian@50516
   194
      le_list_filter_left ~> Sublist.sublisteq_filter_left
Christian@50516
   195
      le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
Christian@50516
   196
      le_list_rev_take_iff ~> Sublist.sublisteq_append
Christian@50516
   197
      le_list_same_length ~> Sublist.sublisteq_same_length
Christian@50516
   198
      le_list_take_many_iff ~> Sublist.sublisteq_append'
Christian@49145
   199
      less_eq_list.drop ~> less_eq_list_drop
Christian@49145
   200
      less_eq_list.induct ~> less_eq_list_induct
Christian@50516
   201
      not_le_list_length ~> Sublist.not_sublisteq_length
Christian@49145
   202
Christian@49145
   203
    INCOMPATIBILITY.
Christian@49145
   204
hoelzl@50525
   205
* Further generalized the definition of limits:
hoelzl@50525
   206
hoelzl@50525
   207
  - Introduced the predicate filterlim (LIM x F. f x :> G) which expresses that
hoelzl@50525
   208
    when the input values x converge to F then the output f x converges to G.
hoelzl@50525
   209
hoelzl@50525
   210
  - Added filters for convergence to positive (at_top) and negative infinity (at_bot).
hoelzl@50525
   211
    Moved infinity in the norm (at_infinity) from Multivariate_Analysis to Complex_Main.
hoelzl@50525
   212
hoelzl@50525
   213
  - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :> at_top".
hoelzl@50525
   214
    INCOMPATIBILITY
hoelzl@50525
   215
webertj@49962
   216
* HOL/Rings: renamed lemmas
webertj@49962
   217
webertj@49962
   218
left_distrib ~> distrib_right
webertj@49962
   219
right_distrib ~> distrib_left
webertj@49962
   220
webertj@49962
   221
in class semiring.  INCOMPATIBILITY.
webertj@49962
   222
blanchet@49510
   223
* HOL/BNF: New (co)datatype package based on bounded natural
blanchet@49510
   224
functors with support for mixed, nested recursion and interesting
blanchet@49510
   225
non-free datatypes.
blanchet@48977
   226
blanchet@49310
   227
* HOL/Cardinals: Theories of ordinals and cardinals
blanchet@49310
   228
(supersedes the AFP entry "Ordinals_and_Cardinals").
blanchet@48977
   229
hoelzl@50526
   230
* HOL/Multivariate_Analysis:
hoelzl@50526
   231
  Replaced "basis :: 'a::euclidean_space => nat => real" and
hoelzl@50526
   232
  "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space" on euclidean spaces by
hoelzl@50526
   233
  using the inner product "_ \<bullet> _" with vectors from the Basis set.
hoelzl@50526
   234
  "\<Chi>\<Chi> i. f i" is replaced by "SUM i : Basis. f i *r i".
hoelzl@50526
   235
hoelzl@50526
   236
  With this change the following constants are also chanegd or removed:
hoelzl@50526
   237
hoelzl@50526
   238
    DIM('a) :: nat   ~>   card (Basis :: 'a set)   (is an abbreviation)
hoelzl@50526
   239
    a $$ i    ~>    inner a i  (where i : Basis)
hoelzl@50526
   240
    cart_base i     removed
hoelzl@50526
   241
    \<pi>, \<pi>'   removed
hoelzl@50526
   242
hoelzl@50526
   243
  Theorems about these constants where removed.
hoelzl@50526
   244
hoelzl@50526
   245
  Renamed lemmas:
hoelzl@50526
   246
hoelzl@50526
   247
    component_le_norm   ~>   Basis_le_norm
hoelzl@50526
   248
    euclidean_eq   ~>   euclidean_eq_iff
hoelzl@50526
   249
    differential_zero_maxmin_component   ~>   differential_zero_maxmin_cart
hoelzl@50526
   250
    euclidean_simps   ~>   inner_simps
hoelzl@50526
   251
    independent_basis   ~>   independent_Basis
hoelzl@50526
   252
    span_basis   ~>   span_Basis
hoelzl@50526
   253
    in_span_basis   ~>   in_span_Basis
hoelzl@50526
   254
    norm_bound_component_le   ~>   norm_boound_Basis_le
hoelzl@50526
   255
    norm_bound_component_lt   ~>   norm_boound_Basis_lt
hoelzl@50526
   256
    component_le_infnorm   ~>   Basis_le_infnorm
hoelzl@50526
   257
hoelzl@50526
   258
  INCOMPATIBILITY.
hoelzl@50526
   259
hoelzl@50141
   260
* HOL/Probability:
hoelzl@50141
   261
  - Add simproc "measurable" to automatically prove measurability
hoelzl@50141
   262
hoelzl@50141
   263
  - Add induction rules for sigma sets with disjoint union (sigma_sets_induct_disjoint)
hoelzl@50141
   264
    and for Borel-measurable functions (borel_measurable_induct).
hoelzl@50141
   265
hoelzl@50141
   266
  - The Daniell-Kolmogorov theorem (the existence the limit of a projective family)
hoelzl@50141
   267
hoelzl@50140
   268
* Library/Countable_Set.thy: Theory of countable sets.
hoelzl@50140
   269
haftmann@48428
   270
* Library/Debug.thy and Library/Parallel.thy: debugging and parallel
haftmann@48428
   271
execution for code generated towards Isabelle/ML.
haftmann@48428
   272
hoelzl@50139
   273
* Library/FuncSet.thy: Extended support for Pi and extensional and introduce the
hoelzl@50139
   274
extensional dependent function space "PiE". Replaces extensional_funcset by an
hoelzl@50139
   275
abbreviation, rename a couple of lemmas from extensional_funcset to PiE:
hoelzl@50139
   276
hoelzl@50139
   277
      extensional_empty ~> PiE_empty
hoelzl@50139
   278
      extensional_funcset_empty_domain ~> PiE_empty_domain
hoelzl@50139
   279
      extensional_funcset_empty_range ~> PiE_empty_range
hoelzl@50139
   280
      extensional_funcset_arb ~> PiE_arb
hoelzl@50139
   281
      extensional_funcset_mem > PiE_mem
hoelzl@50139
   282
      extensional_funcset_extend_domainI ~> PiE_fun_upd
hoelzl@50139
   283
      extensional_funcset_restrict_domain ~> fun_upd_in_PiE
hoelzl@50139
   284
      extensional_funcset_extend_domain_eq ~> PiE_insert_eq
hoelzl@50139
   285
      card_extensional_funcset ~> card_PiE
hoelzl@50139
   286
      finite_extensional_funcset ~> finite_PiE
hoelzl@50139
   287
wenzelm@50232
   288
  INCOMPATIBILITY.
hoelzl@50139
   289
Andreas@49481
   290
* Library/FinFun.thy: theory of almost everywhere constant functions
Andreas@49481
   291
(supersedes the AFP entry "Code Generation for Functions as Data").
Andreas@49481
   292
Andreas@49481
   293
* Library/Phantom.thy: generic phantom type to make a type parameter
Andreas@49481
   294
appear in a constant's type. This alternative to adding TYPE('a) as
Andreas@49481
   295
another parameter avoids unnecessary closures in generated code.
Andreas@49481
   296
Andreas@49770
   297
* Library/RBT_Impl.thy: efficient construction of red-black trees 
Andreas@49770
   298
from sorted associative lists. Merging two trees with rbt_union may
Andreas@49770
   299
return a structurally different tree than before. MINOR INCOMPATIBILITY.
Andreas@49770
   300
nipkow@50138
   301
* Library/IArray.thy: immutable arrays with code generation.
nipkow@50138
   302
wenzelm@48206
   303
* Simproc "finite_Collect" rewrites set comprehensions into pointfree
wenzelm@48206
   304
expressions.
bulwahn@48111
   305
bulwahn@50034
   306
* Preprocessing of the code generator rewrites set comprehensions into
bulwahn@50034
   307
pointfree expressions.
bulwahn@50034
   308
bulwahn@48013
   309
* Quickcheck:
bulwahn@48013
   310
bulwahn@48013
   311
  - added an optimisation for equality premises.
bulwahn@48013
   312
    It is switched on by default, and can be switched off by setting
blanchet@48977
   313
    the configuration quickcheck_optimise_equality to false.
wenzelm@47887
   314
boehmes@48069
   315
* The SMT solver Z3 has now by default a restricted set of directly
boehmes@48069
   316
supported features. For the full set of features (div/mod, nonlinear
boehmes@48069
   317
arithmetic, datatypes/records) with potential proof reconstruction
boehmes@48069
   318
failures, enable the configuration option "z3_with_extensions".
boehmes@48069
   319
Minor INCOMPATIBILITY.
boehmes@48069
   320
blanchet@48094
   321
* Sledgehammer:
blanchet@48094
   322
blanchet@48402
   323
  - Added MaSh relevance filter based on machine-learning; see the
blanchet@48402
   324
    Sledgehammer manual for details.
blanchet@50219
   325
  - Polished Isar proofs generated with "isar_proofs" option.
blanchet@48094
   326
  - Rationalized type encodings ("type_enc" option).
blanchet@50219
   327
  - Renamed "kill_provers" subcommand to "kill".
blanchet@48294
   328
  - Renamed options:
blanchet@49918
   329
      isar_proof ~> isar_proofs
blanchet@50020
   330
      isar_shrink_factor ~> isar_shrink
blanchet@48294
   331
      max_relevant ~> max_facts
blanchet@48294
   332
      relevance_thresholds ~> fact_thresholds
blanchet@48094
   333
wenzelm@48120
   334
wenzelm@48206
   335
*** Document preparation ***
wenzelm@48206
   336
wenzelm@48206
   337
* Default for \<euro> is now based on eurosym package, instead of
wenzelm@48206
   338
slightly exotic babel/greek.
wenzelm@48206
   339
wenzelm@48616
   340
* Document variant NAME may use different LaTeX entry point
wenzelm@48616
   341
document/root_NAME.tex if that file exists, instead of the common
wenzelm@48616
   342
document/root.tex.
wenzelm@48616
   343
wenzelm@48657
   344
* Simplified custom document/build script, instead of old-style
wenzelm@48657
   345
document/IsaMakefile.  Minor INCOMPATIBILITY.
wenzelm@48657
   346
wenzelm@48206
   347
wenzelm@48992
   348
*** ML ***
wenzelm@48992
   349
wenzelm@49869
   350
* Type Seq.results and related operations support embedded error
wenzelm@49869
   351
messages within lazy enumerations, and thus allow to provide
wenzelm@49869
   352
informative errors in the absence of any usable results.
wenzelm@49869
   353
wenzelm@48992
   354
* Renamed Position.str_of to Position.here to emphasize that this is a
wenzelm@48992
   355
formal device to inline positions into message text, but not
wenzelm@48992
   356
necessarily printing visible text.
wenzelm@48992
   357
wenzelm@48992
   358
wenzelm@48206
   359
*** System ***
wenzelm@48206
   360
wenzelm@50118
   361
* The default limit for maximum number of worker threads is now 8,
wenzelm@50118
   362
instead of 4.
wenzelm@50118
   363
wenzelm@49000
   364
* The ML system is configured as regular component, and no longer
wenzelm@49000
   365
picked up from some surrounding directory.  Potential INCOMPATIBILITY
wenzelm@49000
   366
for home-made configurations.
wenzelm@49000
   367
wenzelm@49072
   368
* The "isabelle logo" tool produces EPS and PDF format simultaneously.
wenzelm@49072
   369
Minor INCOMPATIBILITY in command-line options.
wenzelm@48936
   370
wenzelm@48585
   371
* Advanced support for Isabelle sessions and build management, see
wenzelm@48585
   372
"system" manual for the chapter of that name, especially the "isabelle
wenzelm@48736
   373
build" tool and its examples.  INCOMPATIBILITY, isabelle usedir /
wenzelm@48736
   374
mkdir / make are rendered obsolete.
wenzelm@48736
   375
wenzelm@48736
   376
* Discontinued obsolete "isabelle makeall".
wenzelm@48585
   377
wenzelm@48722
   378
* Discontinued obsolete IsaMakefile and ROOT.ML files from the
wenzelm@48722
   379
Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
wenzelm@48722
   380
provides some traditional targets that invoke "isabelle build".  Note
wenzelm@48722
   381
that this is inefficient!  Applications of Isabelle/HOL involving
wenzelm@48722
   382
"isabelle make" should be upgraded to use "isabelle build" directly.
wenzelm@48722
   383
wenzelm@48586
   384
* Discontinued obsolete Isabelle/build script, it is superseded by the
wenzelm@48586
   385
regular isabelle build tool.  For example:
wenzelm@48586
   386
wenzelm@48586
   387
  isabelle build -s -b HOLCF
wenzelm@48586
   388
wenzelm@48693
   389
* The "isabelle options" tool prints Isabelle system options, as
wenzelm@48693
   390
required for "isabelle build", for example.
wenzelm@48693
   391
wenzelm@48683
   392
* The "isabelle mkroot" tool prepares session root directories for use
wenzelm@48683
   393
with "isabelle build", similar to former "isabelle mkdir" for
wenzelm@48683
   394
"isabelle usedir".
wenzelm@48683
   395
wenzelm@48844
   396
* The "isabelle components" tool helps to resolve add-on components
wenzelm@48844
   397
that are not bundled, or referenced from a bare-bones repository
wenzelm@48844
   398
version of Isabelle.
wenzelm@48844
   399
wenzelm@50132
   400
* The "isabelle install" tool has now a simpler command-line.  Minor
wenzelm@50132
   401
INCOMPATIBILITY.
wenzelm@50132
   402
wenzelm@48206
   403
* Discontinued support for Poly/ML 5.2.1, which was the last version
wenzelm@48206
   404
without exception positions and advanced ML compiler/toplevel
wenzelm@48206
   405
configuration.
wenzelm@48206
   406
wenzelm@48574
   407
* Discontinued special treatment of Proof General -- no longer guess
wenzelm@48574
   408
PROOFGENERAL_HOME based on accidental file-system layout.  Minor
wenzelm@48574
   409
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
wenzelm@48574
   410
settings manually, or use a Proof General version that has been
wenzelm@48574
   411
bundled as Isabelle component.
wenzelm@48206
   412
wenzelm@50182
   413
* Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
wenzelm@50182
   414
platform family: "linux", "macos", "windows".
wenzelm@50182
   415
wenzelm@48120
   416
wenzelm@47462
   417
New in Isabelle2012 (May 2012)
wenzelm@47462
   418
------------------------------
wenzelm@45109
   419
wenzelm@45593
   420
*** General ***
wenzelm@45593
   421
wenzelm@45614
   422
* Prover IDE (PIDE) improvements:
wenzelm@45614
   423
wenzelm@47585
   424
  - more robust Sledgehammer integration (as before the sledgehammer
wenzelm@47806
   425
    command-line needs to be typed into the source buffer)
wenzelm@45614
   426
  - markup for bound variables
wenzelm@47806
   427
  - markup for types of term variables (displayed as tooltips)
wenzelm@46956
   428
  - support for user-defined Isar commands within the running session
wenzelm@47158
   429
  - improved support for Unicode outside original 16bit range
wenzelm@47158
   430
    e.g. glyph for \<A> (thanks to jEdit 4.5.1)
wenzelm@45614
   431
wenzelm@47806
   432
* Forward declaration of outer syntax keywords within the theory
wenzelm@47806
   433
header -- minor INCOMPATIBILITY for user-defined commands.  Allow new
wenzelm@47806
   434
commands to be used in the same theory where defined.
wenzelm@46485
   435
wenzelm@47482
   436
* Auxiliary contexts indicate block structure for specifications with
wenzelm@47482
   437
additional parameters and assumptions.  Such unnamed contexts may be
wenzelm@47482
   438
nested within other targets, like 'theory', 'locale', 'class',
wenzelm@47482
   439
'instantiation' etc.  Results from the local context are generalized
wenzelm@47482
   440
accordingly and applied to the enclosing target context.  Example:
wenzelm@47482
   441
wenzelm@47482
   442
  context
wenzelm@47482
   443
    fixes x y z :: 'a
wenzelm@47482
   444
    assumes xy: "x = y" and yz: "y = z"
wenzelm@47482
   445
  begin
wenzelm@47482
   446
wenzelm@47482
   447
  lemma my_trans: "x = z" using xy yz by simp
wenzelm@47482
   448
wenzelm@47482
   449
  end
wenzelm@47482
   450
wenzelm@47482
   451
  thm my_trans
wenzelm@47482
   452
wenzelm@47482
   453
The most basic application is to factor-out context elements of
wenzelm@47482
   454
several fixes/assumes/shows theorem statements, e.g. see
wenzelm@47482
   455
~~/src/HOL/Isar_Examples/Group_Context.thy
wenzelm@47482
   456
wenzelm@47482
   457
Any other local theory specification element works within the "context
wenzelm@47482
   458
... begin ... end" block as well.
wenzelm@47482
   459
wenzelm@47484
   460
* Bundled declarations associate attributed fact expressions with a
wenzelm@47484
   461
given name in the context.  These may be later included in other
wenzelm@47484
   462
contexts.  This allows to manage context extensions casually, without
wenzelm@47855
   463
the logical dependencies of locales and locale interpretation.  See
wenzelm@47855
   464
commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
wenzelm@47484
   465
wenzelm@47829
   466
* Commands 'lemmas' and 'theorems' allow local variables using 'for'
wenzelm@47829
   467
declaration, and results are standardized before being stored.  Thus
wenzelm@47829
   468
old-style "standard" after instantiation or composition of facts
wenzelm@47829
   469
becomes obsolete.  Minor INCOMPATIBILITY, due to potential change of
wenzelm@47829
   470
indices of schematic variables.
wenzelm@47829
   471
wenzelm@47829
   472
* Rule attributes in local theory declarations (e.g. locale or class)
wenzelm@47829
   473
are now statically evaluated: the resulting theorem is stored instead
wenzelm@47829
   474
of the original expression.  INCOMPATIBILITY in rare situations, where
wenzelm@47829
   475
the historic accident of dynamic re-evaluation in interpretations
wenzelm@47829
   476
etc. was exploited.
wenzelm@47829
   477
wenzelm@47829
   478
* New tutorial "Programming and Proving in Isabelle/HOL"
wenzelm@47829
   479
("prog-prove").  It completely supersedes "A Tutorial Introduction to
wenzelm@47829
   480
Structured Isar Proofs" ("isar-overview"), which has been removed.  It
wenzelm@47829
   481
also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
wenzelm@47829
   482
Logic" as the recommended beginners tutorial, but does not cover all
wenzelm@47829
   483
of the material of that old tutorial.
wenzelm@47829
   484
wenzelm@47829
   485
* Updated and extended reference manuals: "isar-ref",
wenzelm@47829
   486
"implementation", "system"; reduced remaining material in old "ref"
wenzelm@47829
   487
manual.
wenzelm@47829
   488
wenzelm@47829
   489
wenzelm@47829
   490
*** Pure ***
wenzelm@47829
   491
wenzelm@46976
   492
* Command 'definition' no longer exports the foundational "raw_def"
wenzelm@46976
   493
into the user context.  Minor INCOMPATIBILITY, may use the regular
wenzelm@46976
   494
"def" result with attribute "abs_def" to imitate the old version.
wenzelm@46976
   495
wenzelm@47855
   496
* Attribute "abs_def" turns an equation of the form "f x y == t" into
wenzelm@47855
   497
"f == %x y. t", which ensures that "simp" or "unfold" steps always
wenzelm@47855
   498
expand it.  This also works for object-logic equality.  (Formerly
wenzelm@47855
   499
undocumented feature.)
wenzelm@47855
   500
wenzelm@47856
   501
* Sort constraints are now propagated in simultaneous statements, just
wenzelm@47856
   502
like type constraints.  INCOMPATIBILITY in rare situations, where
wenzelm@47856
   503
distinct sorts used to be assigned accidentally.  For example:
wenzelm@47856
   504
wenzelm@47856
   505
  lemma "P (x::'a::foo)" and "Q (y::'a::bar)"  -- "now illegal"
wenzelm@47856
   506
wenzelm@47856
   507
  lemma "P (x::'a)" and "Q (y::'a::bar)"
wenzelm@47856
   508
    -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
wenzelm@47856
   509
wenzelm@47856
   510
* Rule composition via attribute "OF" (or ML functions OF/MRS) is more
wenzelm@47856
   511
tolerant against multiple unifiers, as long as the final result is
wenzelm@47856
   512
unique.  (As before, rules are composed in canonical right-to-left
wenzelm@47856
   513
order to accommodate newly introduced premises.)
wenzelm@47856
   514
wenzelm@47806
   515
* Renamed some inner syntax categories:
wenzelm@47806
   516
wenzelm@47806
   517
    num ~> num_token
wenzelm@47806
   518
    xnum ~> xnum_token
wenzelm@47806
   519
    xstr ~> str_token
wenzelm@47806
   520
wenzelm@47806
   521
Minor INCOMPATIBILITY.  Note that in practice "num_const" or
wenzelm@47806
   522
"num_position" etc. are mainly used instead (which also include
wenzelm@47806
   523
position information via constraints).
wenzelm@47806
   524
wenzelm@47829
   525
* Simplified configuration options for syntax ambiguity: see
wenzelm@47829
   526
"syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
wenzelm@47829
   527
manual.  Minor INCOMPATIBILITY.
wenzelm@47829
   528
wenzelm@47856
   529
* Discontinued configuration option "syntax_positions": atomic terms
wenzelm@47856
   530
in parse trees are always annotated by position constraints.
wenzelm@45134
   531
wenzelm@47464
   532
* Old code generator for SML and its commands 'code_module',
wenzelm@45383
   533
'code_library', 'consts_code', 'types_code' have been discontinued.
haftmann@46028
   534
Use commands of the generic code generator instead.  INCOMPATIBILITY.
wenzelm@45383
   535
wenzelm@47464
   536
* Redundant attribute "code_inline" has been discontinued. Use
wenzelm@47464
   537
"code_unfold" instead.  INCOMPATIBILITY.
wenzelm@47464
   538
wenzelm@47464
   539
* Dropped attribute "code_unfold_post" in favor of the its dual
wenzelm@47464
   540
"code_abbrev", which yields a common pattern in definitions like
haftmann@46028
   541
haftmann@46028
   542
  definition [code_abbrev]: "f = t"
haftmann@46028
   543
haftmann@46028
   544
INCOMPATIBILITY.
wenzelm@45383
   545
wenzelm@47856
   546
* Obsolete 'types' command has been discontinued.  Use 'type_synonym'
wenzelm@47856
   547
instead.  INCOMPATIBILITY.
wenzelm@47856
   548
wenzelm@47856
   549
* Discontinued old "prems" fact, which used to refer to the accidental
wenzelm@47856
   550
collection of foundational premises in the context (already marked as
wenzelm@47856
   551
legacy since Isabelle2011).
wenzelm@47855
   552
wenzelm@45427
   553
huffman@45122
   554
*** HOL ***
huffman@45122
   555
wenzelm@47464
   556
* Type 'a set is now a proper type constructor (just as before
wenzelm@47464
   557
Isabelle2008).  Definitions mem_def and Collect_def have disappeared.
wenzelm@47464
   558
Non-trivial INCOMPATIBILITY.  For developments keeping predicates and
wenzelm@47855
   559
sets separate, it is often sufficient to rephrase some set S that has
wenzelm@47855
   560
been accidentally used as predicates by "%x. x : S", and some
wenzelm@47855
   561
predicate P that has been accidentally used as set by "{x. P x}".
wenzelm@47855
   562
Corresponding proofs in a first step should be pruned from any
wenzelm@47855
   563
tinkering with former theorems mem_def and Collect_def as far as
wenzelm@47855
   564
possible.
wenzelm@47855
   565
wenzelm@47855
   566
For developments which deliberately mix predicates and sets, a
wenzelm@47464
   567
planning step is necessary to determine what should become a predicate
wenzelm@47464
   568
and what a set.  It can be helpful to carry out that step in
wenzelm@47464
   569
Isabelle2011-1 before jumping right into the current release.
wenzelm@47464
   570
wenzelm@47855
   571
* Code generation by default implements sets as container type rather
wenzelm@47855
   572
than predicates.  INCOMPATIBILITY.
wenzelm@47855
   573
wenzelm@47855
   574
* New type synonym 'a rel = ('a * 'a) set
wenzelm@47855
   575
wenzelm@47464
   576
* The representation of numerals has changed.  Datatype "num"
wenzelm@47464
   577
represents strictly positive binary numerals, along with functions
wenzelm@47464
   578
"numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
wenzelm@47855
   579
positive and negated numeric literals, respectively.  See also
wenzelm@47855
   580
definitions in ~~/src/HOL/Num.thy.  Potential INCOMPATIBILITY, some
wenzelm@47855
   581
user theories may require adaptations as follows:
huffman@47108
   582
huffman@47108
   583
  - Theorems with number_ring or number_semiring constraints: These
huffman@47108
   584
    classes are gone; use comm_ring_1 or comm_semiring_1 instead.
huffman@47108
   585
huffman@47108
   586
  - Theories defining numeric types: Remove number, number_semiring,
huffman@47108
   587
    and number_ring instances. Defer all theorems about numerals until
huffman@47108
   588
    after classes one and semigroup_add have been instantiated.
huffman@47108
   589
huffman@47108
   590
  - Numeral-only simp rules: Replace each rule having a "number_of v"
huffman@47108
   591
    pattern with two copies, one for numeral and one for neg_numeral.
huffman@47108
   592
huffman@47108
   593
  - Theorems about subclasses of semiring_1 or ring_1: These classes
huffman@47108
   594
    automatically support numerals now, so more simp rules and
huffman@47108
   595
    simprocs may now apply within the proof.
huffman@47108
   596
huffman@47108
   597
  - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
huffman@47108
   598
    Redefine using other integer operations.
huffman@47108
   599
wenzelm@47855
   600
* Transfer: New package intended to generalize the existing
wenzelm@47855
   601
"descending" method and related theorem attributes from the Quotient
wenzelm@47855
   602
package.  (Not all functionality is implemented yet, but future
wenzelm@47855
   603
development will focus on Transfer as an eventual replacement for the
wenzelm@47855
   604
corresponding parts of the Quotient package.)
wenzelm@47809
   605
wenzelm@47809
   606
  - transfer_rule attribute: Maintains a collection of transfer rules,
wenzelm@47809
   607
    which relate constants at two different types. Transfer rules may
wenzelm@47809
   608
    relate different type instances of the same polymorphic constant,
wenzelm@47809
   609
    or they may relate an operation on a raw type to a corresponding
wenzelm@47809
   610
    operation on an abstract type (quotient or subtype). For example:
wenzelm@47809
   611
wenzelm@47809
   612
    ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
wenzelm@47809
   613
    (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
wenzelm@47809
   614
wenzelm@47809
   615
  - transfer method: Replaces a subgoal on abstract types with an
wenzelm@47809
   616
    equivalent subgoal on the corresponding raw types. Constants are
wenzelm@47809
   617
    replaced with corresponding ones according to the transfer rules.
wenzelm@47809
   618
    Goals are generalized over all free variables by default; this is
huffman@47851
   619
    necessary for variables whose types change, but can be overridden
wenzelm@47855
   620
    for specific variables with e.g. "transfer fixing: x y z".  The
wenzelm@47809
   621
    variant transfer' method allows replacing a subgoal with one that
wenzelm@47809
   622
    is logically stronger (rather than equivalent).
wenzelm@47809
   623
wenzelm@47809
   624
  - relator_eq attribute: Collects identity laws for relators of
wenzelm@47809
   625
    various type constructors, e.g. "list_all2 (op =) = (op =)".  The
wenzelm@47809
   626
    transfer method uses these lemmas to infer transfer rules for
wenzelm@47809
   627
    non-polymorphic constants on the fly.
wenzelm@47809
   628
wenzelm@47809
   629
  - transfer_prover method: Assists with proving a transfer rule for a
wenzelm@47809
   630
    new constant, provided the constant is defined in terms of other
wenzelm@47809
   631
    constants that already have transfer rules. It should be applied
wenzelm@47809
   632
    after unfolding the constant definitions.
wenzelm@47809
   633
wenzelm@47809
   634
  - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
wenzelm@47809
   635
    from type nat to type int.
wenzelm@47809
   636
huffman@47851
   637
* Lifting: New package intended to generalize the quotient_definition
huffman@47851
   638
facility of the Quotient package; designed to work with Transfer.
wenzelm@47809
   639
wenzelm@47809
   640
  - lift_definition command: Defines operations on an abstract type in
wenzelm@47809
   641
    terms of a corresponding operation on a representation
wenzelm@47809
   642
    type.  Example syntax:
wenzelm@47809
   643
wenzelm@47809
   644
    lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
wenzelm@47809
   645
      is List.insert
wenzelm@47809
   646
wenzelm@47809
   647
    Users must discharge a respectfulness proof obligation when each
wenzelm@47809
   648
    constant is defined. (For a type copy, i.e. a typedef with UNIV,
wenzelm@47809
   649
    the proof is discharged automatically.) The obligation is
wenzelm@47809
   650
    presented in a user-friendly, readable form; a respectfulness
wenzelm@47809
   651
    theorem in the standard format and a transfer rule are generated
wenzelm@47809
   652
    by the package.
wenzelm@47809
   653
wenzelm@47809
   654
  - Integration with code_abstype: For typedefs (e.g. subtypes
wenzelm@47809
   655
    corresponding to a datatype invariant, such as dlist),
wenzelm@47809
   656
    lift_definition generates a code certificate theorem and sets up
wenzelm@47809
   657
    code generation for each constant.
wenzelm@47809
   658
wenzelm@47809
   659
  - setup_lifting command: Sets up the Lifting package to work with a
wenzelm@47809
   660
    user-defined type. The user must provide either a quotient theorem
wenzelm@47809
   661
    or a type_definition theorem.  The package configures transfer
wenzelm@47809
   662
    rules for equality and quantifiers on the type, and sets up the
wenzelm@47809
   663
    lift_definition command to work with the type.
wenzelm@47809
   664
wenzelm@47809
   665
  - Usage examples: See Quotient_Examples/Lift_DList.thy,
huffman@47851
   666
    Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
huffman@47851
   667
    Word/Word.thy and Library/Float.thy.
wenzelm@47809
   668
wenzelm@47809
   669
* Quotient package:
wenzelm@47809
   670
wenzelm@47809
   671
  - The 'quotient_type' command now supports a 'morphisms' option with
wenzelm@47809
   672
    rep and abs functions, similar to typedef.
wenzelm@47809
   673
wenzelm@47809
   674
  - 'quotient_type' sets up new types to work with the Lifting and
wenzelm@47809
   675
    Transfer packages, as with 'setup_lifting'.
wenzelm@47809
   676
wenzelm@47809
   677
  - The 'quotient_definition' command now requires the user to prove a
wenzelm@47809
   678
    respectfulness property at the point where the constant is
wenzelm@47809
   679
    defined, similar to lift_definition; INCOMPATIBILITY.
wenzelm@47809
   680
wenzelm@47809
   681
  - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
wenzelm@47809
   682
    accordingly, INCOMPATIBILITY.
wenzelm@47809
   683
wenzelm@47809
   684
* New diagnostic command 'find_unused_assms' to find potentially
wenzelm@47809
   685
superfluous assumptions in theorems using Quickcheck.
wenzelm@47809
   686
wenzelm@47809
   687
* Quickcheck:
wenzelm@47809
   688
wenzelm@47809
   689
  - Quickcheck returns variable assignments as counterexamples, which
wenzelm@47809
   690
    allows to reveal the underspecification of functions under test.
wenzelm@47809
   691
    For example, refuting "hd xs = x", it presents the variable
wenzelm@47809
   692
    assignment xs = [] and x = a1 as a counterexample, assuming that
wenzelm@47809
   693
    any property is false whenever "hd []" occurs in it.
wenzelm@47809
   694
wenzelm@47809
   695
    These counterexample are marked as potentially spurious, as
wenzelm@47809
   696
    Quickcheck also returns "xs = []" as a counterexample to the
wenzelm@47809
   697
    obvious theorem "hd xs = hd xs".
wenzelm@47809
   698
wenzelm@47809
   699
    After finding a potentially spurious counterexample, Quickcheck
wenzelm@47809
   700
    continues searching for genuine ones.
wenzelm@47809
   701
wenzelm@47809
   702
    By default, Quickcheck shows potentially spurious and genuine
wenzelm@47809
   703
    counterexamples. The option "genuine_only" sets quickcheck to only
wenzelm@47809
   704
    show genuine counterexamples.
wenzelm@47809
   705
wenzelm@47809
   706
  - The command 'quickcheck_generator' creates random and exhaustive
wenzelm@47809
   707
    value generators for a given type and operations.
wenzelm@47809
   708
wenzelm@47809
   709
    It generates values by using the operations as if they were
wenzelm@47809
   710
    constructors of that type.
wenzelm@47809
   711
wenzelm@47809
   712
  - Support for multisets.
wenzelm@47809
   713
wenzelm@47809
   714
  - Added "use_subtype" options.
wenzelm@47809
   715
wenzelm@47809
   716
  - Added "quickcheck_locale" configuration to specify how to process
wenzelm@47809
   717
    conjectures in a locale context.
wenzelm@47809
   718
wenzelm@47855
   719
* Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
wenzelm@47855
   720
and affecting 'rat' and 'real'.
wenzelm@47809
   721
wenzelm@47809
   722
* Sledgehammer:
wenzelm@47809
   723
  - Integrated more tightly with SPASS, as described in the ITP 2012
wenzelm@47809
   724
    paper "More SPASS with Isabelle".
wenzelm@47809
   725
  - Made it try "smt" as a fallback if "metis" fails or times out.
wenzelm@47809
   726
  - Added support for the following provers: Alt-Ergo (via Why3 and
wenzelm@47809
   727
    TFF1), iProver, iProver-Eq.
wenzelm@47809
   728
  - Sped up the minimizer.
wenzelm@47809
   729
  - Added "lam_trans", "uncurry_aliases", and "minimize" options.
wenzelm@47809
   730
  - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
wenzelm@47809
   731
  - Renamed "sound" option to "strict".
wenzelm@47809
   732
wenzelm@47855
   733
* Metis: Added possibility to specify lambda translations scheme as a
wenzelm@47855
   734
parenthesized argument (e.g., "by (metis (lifting) ...)").
wenzelm@47855
   735
wenzelm@47855
   736
* SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
wenzelm@47855
   737
wenzelm@47855
   738
* Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
wenzelm@47809
   739
wenzelm@47856
   740
* New "case_product" attribute to generate a case rule doing multiple
wenzelm@47856
   741
case distinctions at the same time.  E.g.
wenzelm@47856
   742
wenzelm@47856
   743
  list.exhaust [case_product nat.exhaust]
wenzelm@47856
   744
wenzelm@47856
   745
produces a rule which can be used to perform case distinction on both
wenzelm@47856
   746
a list and a nat.
wenzelm@47856
   747
wenzelm@47809
   748
* New "eventually_elim" method as a generalized variant of the
wenzelm@47855
   749
eventually_elim* rules.  Supports structured proofs.
wenzelm@47855
   750
wenzelm@47702
   751
* Typedef with implicit set definition is considered legacy.  Use
wenzelm@47702
   752
"typedef (open)" form instead, which will eventually become the
wenzelm@47702
   753
default.
wenzelm@47702
   754
wenzelm@47856
   755
* Record: code generation can be switched off manually with
wenzelm@47856
   756
wenzelm@47856
   757
  declare [[record_coden = false]]  -- "default true"
wenzelm@47856
   758
wenzelm@47856
   759
* Datatype: type parameters allow explicit sort constraints.
wenzelm@47856
   760
wenzelm@47855
   761
* Concrete syntax for case expressions includes constraints for source
wenzelm@47855
   762
positions, and thus produces Prover IDE markup for its bindings.
wenzelm@47855
   763
INCOMPATIBILITY for old-style syntax translations that augment the
wenzelm@47855
   764
pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
wenzelm@47855
   765
one_case.
wenzelm@47855
   766
wenzelm@47855
   767
* Clarified attribute "mono_set": pure declaration without modifying
wenzelm@47855
   768
the result of the fact expression.
wenzelm@47855
   769
haftmann@46752
   770
* More default pred/set conversions on a couple of relation operations
wenzelm@47464
   771
and predicates.  Added powers of predicate relations.  Consolidation
wenzelm@47464
   772
of some relation theorems:
haftmann@46752
   773
haftmann@46752
   774
  converse_def ~> converse_unfold
haftmann@47549
   775
  rel_comp_def ~> relcomp_unfold
haftmann@47820
   776
  symp_def ~> (modified, use symp_def and sym_def instead)
haftmann@46752
   777
  transp_def ~> transp_trans
haftmann@46752
   778
  Domain_def ~> Domain_unfold
haftmann@46752
   779
  Range_def ~> Domain_converse [symmetric]
haftmann@46752
   780
haftmann@46981
   781
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
haftmann@46981
   782
wenzelm@47464
   783
See theory "Relation" for examples for making use of pred/set
wenzelm@47464
   784
conversions by means of attributes "to_set" and "to_pred".
haftmann@47086
   785
haftmann@46752
   786
INCOMPATIBILITY.
haftmann@46752
   787
bulwahn@46363
   788
* Renamed facts about the power operation on relations, i.e., relpow
wenzelm@47464
   789
to match the constant's name:
wenzelm@47463
   790
wenzelm@46458
   791
  rel_pow_1 ~> relpow_1
bulwahn@46363
   792
  rel_pow_0_I ~> relpow_0_I
bulwahn@46363
   793
  rel_pow_Suc_I ~> relpow_Suc_I
bulwahn@46363
   794
  rel_pow_Suc_I2 ~> relpow_Suc_I2
bulwahn@46363
   795
  rel_pow_0_E ~> relpow_0_E
bulwahn@46363
   796
  rel_pow_Suc_E ~> relpow_Suc_E
bulwahn@46363
   797
  rel_pow_E ~> relpow_E
wenzelm@46458
   798
  rel_pow_Suc_D2 ~> relpow_Suc_D2
wenzelm@47463
   799
  rel_pow_Suc_E2 ~> relpow_Suc_E2
bulwahn@46363
   800
  rel_pow_Suc_D2' ~> relpow_Suc_D2'
bulwahn@46363
   801
  rel_pow_E2 ~> relpow_E2
bulwahn@46363
   802
  rel_pow_add ~> relpow_add
bulwahn@46363
   803
  rel_pow_commute ~> relpow
bulwahn@46363
   804
  rel_pow_empty ~> relpow_empty:
bulwahn@46363
   805
  rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
bulwahn@46363
   806
  rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
bulwahn@46363
   807
  rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
bulwahn@46363
   808
  rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
bulwahn@46363
   809
  rel_pow_fun_conv ~> relpow_fun_conv
bulwahn@46363
   810
  rel_pow_finite_bounded1 ~> relpow_finite_bounded1
bulwahn@46363
   811
  rel_pow_finite_bounded ~> relpow_finite_bounded
bulwahn@46363
   812
  rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
bulwahn@46363
   813
  trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
bulwahn@46363
   814
  single_valued_rel_pow ~> single_valued_relpow
wenzelm@47463
   815
bulwahn@46363
   816
INCOMPATIBILITY.
bulwahn@46363
   817
bulwahn@47448
   818
* Theory Relation: Consolidated constant name for relation composition
wenzelm@47464
   819
and corresponding theorem names:
wenzelm@47464
   820
haftmann@47549
   821
  - Renamed constant rel_comp to relcomp.
wenzelm@47464
   822
bulwahn@47448
   823
  - Dropped abbreviation pred_comp. Use relcompp instead.
wenzelm@47464
   824
bulwahn@47448
   825
  - Renamed theorems:
wenzelm@47464
   826
bulwahn@47448
   827
    rel_compI ~> relcompI
bulwahn@47448
   828
    rel_compEpair ~> relcompEpair
bulwahn@47448
   829
    rel_compE ~> relcompE
bulwahn@47448
   830
    pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
bulwahn@47448
   831
    rel_comp_empty1 ~> relcomp_empty1
bulwahn@47448
   832
    rel_comp_mono ~> relcomp_mono
bulwahn@47448
   833
    rel_comp_subset_Sigma ~> relcomp_subset_Sigma
bulwahn@47448
   834
    rel_comp_distrib ~> relcomp_distrib
bulwahn@47448
   835
    rel_comp_distrib2 ~> relcomp_distrib2
bulwahn@47448
   836
    rel_comp_UNION_distrib ~> relcomp_UNION_distrib
bulwahn@47448
   837
    rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
bulwahn@47448
   838
    single_valued_rel_comp ~> single_valued_relcomp
haftmann@47549
   839
    rel_comp_def ~> relcomp_unfold
bulwahn@47448
   840
    converse_rel_comp ~> converse_relcomp
bulwahn@47448
   841
    pred_compI ~> relcomppI
bulwahn@47448
   842
    pred_compE ~> relcomppE
bulwahn@47448
   843
    pred_comp_bot1 ~> relcompp_bot1
bulwahn@47448
   844
    pred_comp_bot2 ~> relcompp_bot2
bulwahn@47448
   845
    transp_pred_comp_less_eq ~> transp_relcompp_less_eq
bulwahn@47448
   846
    pred_comp_mono ~> relcompp_mono
bulwahn@47448
   847
    pred_comp_distrib ~> relcompp_distrib
bulwahn@47448
   848
    pred_comp_distrib2 ~> relcompp_distrib2
bulwahn@47448
   849
    converse_pred_comp ~> converse_relcompp
wenzelm@47464
   850
bulwahn@47448
   851
    finite_rel_comp ~> finite_relcomp
wenzelm@47464
   852
bulwahn@47448
   853
    set_rel_comp ~> set_relcomp
bulwahn@47448
   854
bulwahn@47448
   855
INCOMPATIBILITY.
bulwahn@47448
   856
haftmann@47550
   857
* Theory Divides: Discontinued redundant theorems about div and mod.
haftmann@47550
   858
INCOMPATIBILITY, use the corresponding generic theorems instead.
haftmann@47550
   859
haftmann@47550
   860
  DIVISION_BY_ZERO ~> div_by_0, mod_by_0
haftmann@47550
   861
  zdiv_self ~> div_self
haftmann@47550
   862
  zmod_self ~> mod_self
haftmann@47550
   863
  zdiv_zero ~> div_0
haftmann@47550
   864
  zmod_zero ~> mod_0
haftmann@47550
   865
  zdiv_zmod_equality ~> div_mod_equality2
haftmann@47550
   866
  zdiv_zmod_equality2 ~> div_mod_equality
haftmann@47550
   867
  zmod_zdiv_trivial ~> mod_div_trivial
haftmann@47550
   868
  zdiv_zminus_zminus ~> div_minus_minus
haftmann@47550
   869
  zmod_zminus_zminus ~> mod_minus_minus
haftmann@47550
   870
  zdiv_zminus2 ~> div_minus_right
haftmann@47550
   871
  zmod_zminus2 ~> mod_minus_right
haftmann@47550
   872
  zdiv_minus1_right ~> div_minus1_right
haftmann@47550
   873
  zmod_minus1_right ~> mod_minus1_right
haftmann@47550
   874
  zdvd_mult_div_cancel ~> dvd_mult_div_cancel
haftmann@47550
   875
  zmod_zmult1_eq ~> mod_mult_right_eq
haftmann@47550
   876
  zpower_zmod ~> power_mod
haftmann@47550
   877
  zdvd_zmod ~> dvd_mod
haftmann@47550
   878
  zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
haftmann@47550
   879
  mod_mult_distrib ~> mult_mod_left
haftmann@47550
   880
  mod_mult_distrib2 ~> mult_mod_right
haftmann@47550
   881
haftmann@47550
   882
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
haftmann@47550
   883
generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
haftmann@47550
   884
haftmann@47551
   885
* Finite_Set.fold now qualified.  INCOMPATIBILITY.
haftmann@47551
   886
haftmann@47552
   887
* Consolidated theorem names concerning fold combinators:
haftmann@47550
   888
haftmann@47550
   889
  inf_INFI_fold_inf ~> inf_INF_fold_inf
haftmann@47550
   890
  sup_SUPR_fold_sup ~> sup_SUP_fold_sup
haftmann@47550
   891
  INFI_fold_inf ~> INF_fold_inf
haftmann@47550
   892
  SUPR_fold_sup ~> SUP_fold_sup
haftmann@47550
   893
  union_set ~> union_set_fold
haftmann@47550
   894
  minus_set ~> minus_set_fold
haftmann@47550
   895
  INFI_set_fold ~> INF_set_fold
haftmann@47550
   896
  SUPR_set_fold ~> SUP_set_fold
haftmann@47550
   897
  INF_code ~> INF_set_foldr
haftmann@47550
   898
  SUP_code ~> SUP_set_foldr
haftmann@47550
   899
  foldr.simps ~> foldr.simps (in point-free formulation)
haftmann@47550
   900
  foldr_fold_rev ~> foldr_conv_fold
haftmann@47550
   901
  foldl_fold ~> foldl_conv_fold
haftmann@47550
   902
  foldr_foldr ~> foldr_conv_foldl
haftmann@47550
   903
  foldl_foldr ~> foldl_conv_foldr
haftmann@47552
   904
  fold_set_remdups ~> fold_set_fold_remdups
haftmann@47552
   905
  fold_set ~> fold_set_fold
haftmann@47552
   906
  fold1_set ~> fold1_set_fold
haftmann@47550
   907
haftmann@47550
   908
INCOMPATIBILITY.
haftmann@47550
   909
haftmann@47550
   910
* Dropped rarely useful theorems concerning fold combinators:
haftmann@47550
   911
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
haftmann@47550
   912
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
haftmann@47550
   913
concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
haftmann@47550
   914
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
haftmann@47550
   915
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
haftmann@47550
   916
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
haftmann@47550
   917
INCOMPATIBILITY.  For the common phrases "%xs. List.foldr plus xs 0"
haftmann@47550
   918
and "List.foldl plus 0", prefer "List.listsum".  Otherwise it can be
haftmann@47550
   919
useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
haftmann@47550
   920
unfolding "foldr_conv_fold" and "foldl_conv_fold".
haftmann@47550
   921
haftmann@47550
   922
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
haftmann@47550
   923
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
haftmann@47550
   924
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
haftmann@47550
   925
INF_set_foldr, SUP_set_foldr.  INCOMPATIBILITY.  Prefer corresponding
haftmann@47550
   926
lemmas over fold rather than foldr, or make use of lemmas
haftmann@47550
   927
fold_conv_foldr and fold_rev.
haftmann@47550
   928
haftmann@47550
   929
* Congruence rules Option.map_cong and Option.bind_cong for recursion
haftmann@47550
   930
through option types.
haftmann@47550
   931
wenzelm@47856
   932
* "Transitive_Closure.ntrancl": bounded transitive closure on
wenzelm@47856
   933
relations.
wenzelm@47856
   934
wenzelm@47856
   935
* Constant "Set.not_member" now qualified.  INCOMPATIBILITY.
wenzelm@47856
   936
wenzelm@47856
   937
* Theory Int: Discontinued many legacy theorems specific to type int.
wenzelm@47856
   938
INCOMPATIBILITY, use the corresponding generic theorems instead.
wenzelm@47856
   939
wenzelm@47856
   940
  zminus_zminus ~> minus_minus
wenzelm@47856
   941
  zminus_0 ~> minus_zero
wenzelm@47856
   942
  zminus_zadd_distrib ~> minus_add_distrib
wenzelm@47856
   943
  zadd_commute ~> add_commute
wenzelm@47856
   944
  zadd_assoc ~> add_assoc
wenzelm@47856
   945
  zadd_left_commute ~> add_left_commute
wenzelm@47856
   946
  zadd_ac ~> add_ac
wenzelm@47856
   947
  zmult_ac ~> mult_ac
wenzelm@47856
   948
  zadd_0 ~> add_0_left
wenzelm@47856
   949
  zadd_0_right ~> add_0_right
wenzelm@47856
   950
  zadd_zminus_inverse2 ~> left_minus
wenzelm@47856
   951
  zmult_zminus ~> mult_minus_left
wenzelm@47856
   952
  zmult_commute ~> mult_commute
wenzelm@47856
   953
  zmult_assoc ~> mult_assoc
wenzelm@47856
   954
  zadd_zmult_distrib ~> left_distrib
wenzelm@47856
   955
  zadd_zmult_distrib2 ~> right_distrib
wenzelm@47856
   956
  zdiff_zmult_distrib ~> left_diff_distrib
wenzelm@47856
   957
  zdiff_zmult_distrib2 ~> right_diff_distrib
wenzelm@47856
   958
  zmult_1 ~> mult_1_left
wenzelm@47856
   959
  zmult_1_right ~> mult_1_right
wenzelm@47856
   960
  zle_refl ~> order_refl
wenzelm@47856
   961
  zle_trans ~> order_trans
wenzelm@47856
   962
  zle_antisym ~> order_antisym
wenzelm@47856
   963
  zle_linear ~> linorder_linear
wenzelm@47856
   964
  zless_linear ~> linorder_less_linear
wenzelm@47856
   965
  zadd_left_mono ~> add_left_mono
wenzelm@47856
   966
  zadd_strict_right_mono ~> add_strict_right_mono
wenzelm@47856
   967
  zadd_zless_mono ~> add_less_le_mono
wenzelm@47856
   968
  int_0_less_1 ~> zero_less_one
wenzelm@47856
   969
  int_0_neq_1 ~> zero_neq_one
wenzelm@47856
   970
  zless_le ~> less_le
wenzelm@47856
   971
  zpower_zadd_distrib ~> power_add
wenzelm@47856
   972
  zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
wenzelm@47856
   973
  zero_le_zpower_abs ~> zero_le_power_abs
wenzelm@47856
   974
wenzelm@47856
   975
* Theory Deriv: Renamed
wenzelm@47856
   976
wenzelm@47856
   977
  DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
wenzelm@47856
   978
wenzelm@47856
   979
* Theory Library/Multiset: Improved code generation of multisets.
wenzelm@47856
   980
wenzelm@47855
   981
* Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
krauss@47703
   982
are expressed via type classes again. The special syntax
krauss@47703
   983
\<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
krauss@47703
   984
setsum_set, which is now subsumed by Big_Operators.setsum.
krauss@47703
   985
INCOMPATIBILITY.
krauss@47703
   986
wenzelm@46160
   987
* Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
wenzelm@46160
   988
use theory HOL/Library/Nat_Bijection instead.
wenzelm@46160
   989
wenzelm@47464
   990
* Theory HOL/Library/RBT_Impl: Backing implementation of red-black
wenzelm@47464
   991
trees is now inside a type class context.  Names of affected
wenzelm@47464
   992
operations and lemmas have been prefixed by rbt_.  INCOMPATIBILITY for
wenzelm@47464
   993
theories working directly with raw red-black trees, adapt the names as
wenzelm@47464
   994
follows:
Andreas@47452
   995
Andreas@47452
   996
  Operations:
Andreas@47452
   997
  bulkload -> rbt_bulkload
Andreas@47452
   998
  del_from_left -> rbt_del_from_left
Andreas@47452
   999
  del_from_right -> rbt_del_from_right
Andreas@47452
  1000
  del -> rbt_del
Andreas@47452
  1001
  delete -> rbt_delete
Andreas@47452
  1002
  ins -> rbt_ins
Andreas@47452
  1003
  insert -> rbt_insert
Andreas@47452
  1004
  insertw -> rbt_insert_with
Andreas@47452
  1005
  insert_with_key -> rbt_insert_with_key
Andreas@47452
  1006
  map_entry -> rbt_map_entry
Andreas@47452
  1007
  lookup -> rbt_lookup
Andreas@47452
  1008
  sorted -> rbt_sorted
Andreas@47452
  1009
  tree_greater -> rbt_greater
Andreas@47452
  1010
  tree_less -> rbt_less
Andreas@47452
  1011
  tree_less_symbol -> rbt_less_symbol
Andreas@47452
  1012
  union -> rbt_union
Andreas@47452
  1013
  union_with -> rbt_union_with
Andreas@47452
  1014
  union_with_key -> rbt_union_with_key
Andreas@47452
  1015
Andreas@47452
  1016
  Lemmas:
Andreas@47452
  1017
  balance_left_sorted -> balance_left_rbt_sorted
Andreas@47452
  1018
  balance_left_tree_greater -> balance_left_rbt_greater
Andreas@47452
  1019
  balance_left_tree_less -> balance_left_rbt_less
Andreas@47452
  1020
  balance_right_sorted -> balance_right_rbt_sorted
Andreas@47452
  1021
  balance_right_tree_greater -> balance_right_rbt_greater
Andreas@47452
  1022
  balance_right_tree_less -> balance_right_rbt_less
Andreas@47452
  1023
  balance_sorted -> balance_rbt_sorted
Andreas@47452
  1024
  balance_tree_greater -> balance_rbt_greater
Andreas@47452
  1025
  balance_tree_less -> balance_rbt_less
Andreas@47452
  1026
  bulkload_is_rbt -> rbt_bulkload_is_rbt
Andreas@47452
  1027
  combine_sorted -> combine_rbt_sorted
Andreas@47452
  1028
  combine_tree_greater -> combine_rbt_greater
Andreas@47452
  1029
  combine_tree_less -> combine_rbt_less
Andreas@47452
  1030
  delete_in_tree -> rbt_delete_in_tree
Andreas@47452
  1031
  delete_is_rbt -> rbt_delete_is_rbt
Andreas@47452
  1032
  del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
Andreas@47452
  1033
  del_from_left_tree_less -> rbt_del_from_left_rbt_less
Andreas@47452
  1034
  del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
Andreas@47452
  1035
  del_from_right_tree_less -> rbt_del_from_right_rbt_less
Andreas@47452
  1036
  del_in_tree -> rbt_del_in_tree
Andreas@47452
  1037
  del_inv1_inv2 -> rbt_del_inv1_inv2
Andreas@47452
  1038
  del_sorted -> rbt_del_rbt_sorted
Andreas@47452
  1039
  del_tree_greater -> rbt_del_rbt_greater
Andreas@47452
  1040
  del_tree_less -> rbt_del_rbt_less
Andreas@47452
  1041
  dom_lookup_Branch -> dom_rbt_lookup_Branch
Andreas@47452
  1042
  entries_lookup -> entries_rbt_lookup
Andreas@47452
  1043
  finite_dom_lookup -> finite_dom_rbt_lookup
Andreas@47452
  1044
  insert_sorted -> rbt_insert_rbt_sorted
Andreas@47452
  1045
  insertw_is_rbt -> rbt_insertw_is_rbt
Andreas@47452
  1046
  insertwk_is_rbt -> rbt_insertwk_is_rbt
Andreas@47452
  1047
  insertwk_sorted -> rbt_insertwk_rbt_sorted
Andreas@47452
  1048
  insertw_sorted -> rbt_insertw_rbt_sorted
Andreas@47452
  1049
  ins_sorted -> ins_rbt_sorted
Andreas@47452
  1050
  ins_tree_greater -> ins_rbt_greater
Andreas@47452
  1051
  ins_tree_less -> ins_rbt_less
Andreas@47452
  1052
  is_rbt_sorted -> is_rbt_rbt_sorted
Andreas@47452
  1053
  lookup_balance -> rbt_lookup_balance
Andreas@47452
  1054
  lookup_bulkload -> rbt_lookup_rbt_bulkload
Andreas@47452
  1055
  lookup_delete -> rbt_lookup_rbt_delete
Andreas@47452
  1056
  lookup_Empty -> rbt_lookup_Empty
Andreas@47452
  1057
  lookup_from_in_tree -> rbt_lookup_from_in_tree
Andreas@47452
  1058
  lookup_in_tree -> rbt_lookup_in_tree
Andreas@47452
  1059
  lookup_ins -> rbt_lookup_ins
Andreas@47452
  1060
  lookup_insert -> rbt_lookup_rbt_insert
Andreas@47452
  1061
  lookup_insertw -> rbt_lookup_rbt_insertw
Andreas@47452
  1062
  lookup_insertwk -> rbt_lookup_rbt_insertwk
Andreas@47452
  1063
  lookup_keys -> rbt_lookup_keys
Andreas@47452
  1064
  lookup_map -> rbt_lookup_map
Andreas@47452
  1065
  lookup_map_entry -> rbt_lookup_rbt_map_entry
Andreas@47452
  1066
  lookup_tree_greater -> rbt_lookup_rbt_greater
Andreas@47452
  1067
  lookup_tree_less -> rbt_lookup_rbt_less
Andreas@47452
  1068
  lookup_union -> rbt_lookup_rbt_union
Andreas@47452
  1069
  map_entry_color_of -> rbt_map_entry_color_of
Andreas@47452
  1070
  map_entry_inv1 -> rbt_map_entry_inv1
Andreas@47452
  1071
  map_entry_inv2 -> rbt_map_entry_inv2
Andreas@47452
  1072
  map_entry_is_rbt -> rbt_map_entry_is_rbt
Andreas@47452
  1073
  map_entry_sorted -> rbt_map_entry_rbt_sorted
Andreas@47452
  1074
  map_entry_tree_greater -> rbt_map_entry_rbt_greater
Andreas@47452
  1075
  map_entry_tree_less -> rbt_map_entry_rbt_less
Andreas@47452
  1076
  map_tree_greater -> map_rbt_greater
Andreas@47452
  1077
  map_tree_less -> map_rbt_less
Andreas@47452
  1078
  map_sorted -> map_rbt_sorted
Andreas@47452
  1079
  paint_sorted -> paint_rbt_sorted
Andreas@47452
  1080
  paint_lookup -> paint_rbt_lookup
Andreas@47452
  1081
  paint_tree_greater -> paint_rbt_greater
Andreas@47452
  1082
  paint_tree_less -> paint_rbt_less
Andreas@47452
  1083
  sorted_entries -> rbt_sorted_entries
Andreas@47452
  1084
  tree_greater_eq_trans -> rbt_greater_eq_trans
Andreas@47452
  1085
  tree_greater_nit -> rbt_greater_nit
Andreas@47452
  1086
  tree_greater_prop -> rbt_greater_prop
Andreas@47452
  1087
  tree_greater_simps -> rbt_greater_simps
Andreas@47452
  1088
  tree_greater_trans -> rbt_greater_trans
Andreas@47452
  1089
  tree_less_eq_trans -> rbt_less_eq_trans
Andreas@47452
  1090
  tree_less_nit -> rbt_less_nit
Andreas@47452
  1091
  tree_less_prop -> rbt_less_prop
Andreas@47452
  1092
  tree_less_simps -> rbt_less_simps
Andreas@47452
  1093
  tree_less_trans -> rbt_less_trans
Andreas@47452
  1094
  tree_ord_props -> rbt_ord_props
Andreas@47452
  1095
  union_Branch -> rbt_union_Branch
Andreas@47452
  1096
  union_is_rbt -> rbt_union_is_rbt
Andreas@47452
  1097
  unionw_is_rbt -> rbt_unionw_is_rbt
Andreas@47452
  1098
  unionwk_is_rbt -> rbt_unionwk_is_rbt
Andreas@47452
  1099
  unionwk_sorted -> rbt_unionwk_rbt_sorted
Andreas@47452
  1100
wenzelm@47807
  1101
* Theory HOL/Library/Float: Floating point numbers are now defined as
wenzelm@47807
  1102
a subset of the real numbers.  All operations are defined using the
wenzelm@47807
  1103
lifing-framework and proofs use the transfer method.  INCOMPATIBILITY.
hoelzl@47616
  1104
hoelzl@47616
  1105
  Changed Operations:
hoelzl@47622
  1106
  float_abs -> abs
hoelzl@47622
  1107
  float_nprt -> nprt
hoelzl@47622
  1108
  float_pprt -> pprt
hoelzl@47622
  1109
  pow2 -> use powr
hoelzl@47622
  1110
  round_down -> float_round_down
hoelzl@47622
  1111
  round_up -> float_round_up
hoelzl@47622
  1112
  scale -> exponent
hoelzl@47622
  1113
hoelzl@47622
  1114
  Removed Operations:
hoelzl@47622
  1115
  ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
hoelzl@47622
  1116
hoelzl@47622
  1117
  Renamed Lemmas:
hoelzl@47622
  1118
  abs_float_def -> Float.compute_float_abs
hoelzl@47622
  1119
  bitlen_ge0 -> bitlen_nonneg
hoelzl@47622
  1120
  bitlen.simps -> Float.compute_bitlen
hoelzl@47622
  1121
  float_components -> Float_mantissa_exponent
hoelzl@47622
  1122
  float_divl.simps -> Float.compute_float_divl
hoelzl@47622
  1123
  float_divr.simps -> Float.compute_float_divr
hoelzl@47622
  1124
  float_eq_odd -> mult_powr_eq_mult_powr_iff
hoelzl@47622
  1125
  float_power -> real_of_float_power
hoelzl@47622
  1126
  lapprox_posrat_def -> Float.compute_lapprox_posrat
hoelzl@47622
  1127
  lapprox_rat.simps -> Float.compute_lapprox_rat
hoelzl@47622
  1128
  le_float_def' -> Float.compute_float_le
hoelzl@47622
  1129
  le_float_def -> less_eq_float.rep_eq
hoelzl@47622
  1130
  less_float_def' -> Float.compute_float_less
hoelzl@47622
  1131
  less_float_def -> less_float.rep_eq
hoelzl@47622
  1132
  normfloat_def -> Float.compute_normfloat
hoelzl@47622
  1133
  normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
hoelzl@47622
  1134
  normfloat -> normfloat_def
hoelzl@47622
  1135
  normfloat_unique -> use normfloat_def
hoelzl@47622
  1136
  number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
hoelzl@47622
  1137
  one_float_def -> Float.compute_float_one
hoelzl@47622
  1138
  plus_float_def -> Float.compute_float_plus
hoelzl@47622
  1139
  rapprox_posrat_def -> Float.compute_rapprox_posrat
hoelzl@47622
  1140
  rapprox_rat.simps -> Float.compute_rapprox_rat
hoelzl@47622
  1141
  real_of_float_0 -> zero_float.rep_eq
hoelzl@47622
  1142
  real_of_float_1 -> one_float.rep_eq
hoelzl@47622
  1143
  real_of_float_abs -> abs_float.rep_eq
hoelzl@47622
  1144
  real_of_float_add -> plus_float.rep_eq
hoelzl@47622
  1145
  real_of_float_minus -> uminus_float.rep_eq
hoelzl@47622
  1146
  real_of_float_mult -> times_float.rep_eq
hoelzl@47622
  1147
  real_of_float_simp -> Float.rep_eq
hoelzl@47622
  1148
  real_of_float_sub -> minus_float.rep_eq
hoelzl@47622
  1149
  round_down.simps -> Float.compute_float_round_down
hoelzl@47622
  1150
  round_up.simps -> Float.compute_float_round_up
hoelzl@47622
  1151
  times_float_def -> Float.compute_float_times
hoelzl@47622
  1152
  uminus_float_def -> Float.compute_float_uminus
hoelzl@47622
  1153
  zero_float_def -> Float.compute_float_zero
hoelzl@47622
  1154
hoelzl@47622
  1155
  Lemmas not necessary anymore, use the transfer method:
hoelzl@47622
  1156
  bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
hoelzl@47622
  1157
  float_divr, float_le_simp, float_less1_mantissa_bound,
hoelzl@47622
  1158
  float_less_simp, float_less_zero, float_le_zero,
hoelzl@47622
  1159
  float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
hoelzl@47622
  1160
  floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
hoelzl@47622
  1161
  lapprox_rat_bottom, normalized_float, rapprox_posrat,
hoelzl@47622
  1162
  rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
hoelzl@47622
  1163
  real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
hoelzl@47622
  1164
  round_up, zero_le_float, zero_less_float
hoelzl@47616
  1165
wenzelm@47856
  1166
* New theory HOL/Library/DAList provides an abstract type for
wenzelm@47856
  1167
association lists with distinct keys.
noschinl@45791
  1168
wenzelm@47866
  1169
* Session HOL/IMP: Added new theory of abstract interpretation of
wenzelm@47866
  1170
annotated commands.
wenzelm@47866
  1171
wenzelm@47855
  1172
* Session HOL-Import: Re-implementation from scratch is faster,
wenzelm@47855
  1173
simpler, and more scalable.  Requires a proof bundle, which is
wenzelm@47855
  1174
available as an external component.  Discontinued old (and mostly
wenzelm@47855
  1175
dead) Importer for HOL4 and HOL Light.  INCOMPATIBILITY.
wenzelm@47855
  1176
wenzelm@47855
  1177
* Session HOL-Word: Discontinued many redundant theorems specific to
wenzelm@47855
  1178
type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
wenzelm@47855
  1179
instead.
wenzelm@47855
  1180
wenzelm@47855
  1181
  word_sub_alt ~> word_sub_wi
wenzelm@47855
  1182
  word_add_alt ~> word_add_def
wenzelm@47855
  1183
  word_mult_alt ~> word_mult_def
wenzelm@47855
  1184
  word_minus_alt ~> word_minus_def
wenzelm@47855
  1185
  word_0_alt ~> word_0_wi
wenzelm@47855
  1186
  word_1_alt ~> word_1_wi
wenzelm@47855
  1187
  word_add_0 ~> add_0_left
wenzelm@47855
  1188
  word_add_0_right ~> add_0_right
wenzelm@47855
  1189
  word_mult_1 ~> mult_1_left
wenzelm@47855
  1190
  word_mult_1_right ~> mult_1_right
wenzelm@47855
  1191
  word_add_commute ~> add_commute
wenzelm@47855
  1192
  word_add_assoc ~> add_assoc
wenzelm@47855
  1193
  word_add_left_commute ~> add_left_commute
wenzelm@47855
  1194
  word_mult_commute ~> mult_commute
wenzelm@47855
  1195
  word_mult_assoc ~> mult_assoc
wenzelm@47855
  1196
  word_mult_left_commute ~> mult_left_commute
wenzelm@47855
  1197
  word_left_distrib ~> left_distrib
wenzelm@47855
  1198
  word_right_distrib ~> right_distrib
wenzelm@47855
  1199
  word_left_minus ~> left_minus
wenzelm@47855
  1200
  word_diff_0_right ~> diff_0_right
wenzelm@47855
  1201
  word_diff_self ~> diff_self
wenzelm@47855
  1202
  word_sub_def ~> diff_minus
wenzelm@47855
  1203
  word_diff_minus ~> diff_minus
wenzelm@47855
  1204
  word_add_ac ~> add_ac
wenzelm@47855
  1205
  word_mult_ac ~> mult_ac
wenzelm@47855
  1206
  word_plus_ac0 ~> add_0_left add_0_right add_ac
wenzelm@47855
  1207
  word_times_ac1 ~> mult_1_left mult_1_right mult_ac
wenzelm@47855
  1208
  word_order_trans ~> order_trans
wenzelm@47855
  1209
  word_order_refl ~> order_refl
wenzelm@47855
  1210
  word_order_antisym ~> order_antisym
wenzelm@47855
  1211
  word_order_linear ~> linorder_linear
wenzelm@47855
  1212
  lenw1_zero_neq_one ~> zero_neq_one
wenzelm@47855
  1213
  word_number_of_eq ~> number_of_eq
wenzelm@47855
  1214
  word_of_int_add_hom ~> wi_hom_add
wenzelm@47855
  1215
  word_of_int_sub_hom ~> wi_hom_sub
wenzelm@47855
  1216
  word_of_int_mult_hom ~> wi_hom_mult
wenzelm@47855
  1217
  word_of_int_minus_hom ~> wi_hom_neg
wenzelm@47855
  1218
  word_of_int_succ_hom ~> wi_hom_succ
wenzelm@47855
  1219
  word_of_int_pred_hom ~> wi_hom_pred
wenzelm@47855
  1220
  word_of_int_0_hom ~> word_0_wi
wenzelm@47855
  1221
  word_of_int_1_hom ~> word_1_wi
wenzelm@47855
  1222
wenzelm@47809
  1223
* Session HOL-Word: New proof method "word_bitwise" for splitting
wenzelm@47809
  1224
machine word equalities and inequalities into logical circuits,
wenzelm@47809
  1225
defined in HOL/Word/WordBitwise.thy.  Supports addition, subtraction,
wenzelm@47809
  1226
multiplication, shifting by constants, bitwise operators and numeric
wenzelm@47809
  1227
constants.  Requires fixed-length word types, not 'a word.  Solves
wenzelm@47854
  1228
many standard word identities outright and converts more into first
wenzelm@47809
  1229
order problems amenable to blast or similar.  See also examples in
wenzelm@47809
  1230
HOL/Word/Examples/WordExamples.thy.
wenzelm@47809
  1231
wenzelm@47807
  1232
* Session HOL-Probability: Introduced the type "'a measure" to
wenzelm@47807
  1233
represent measures, this replaces the records 'a algebra and 'a
wenzelm@47807
  1234
measure_space.  The locales based on subset_class now have two
wenzelm@47856
  1235
locale-parameters the space \<Omega> and the set of measurable sets M.
wenzelm@47856
  1236
The product of probability spaces uses now the same constant as the
wenzelm@47856
  1237
finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
wenzelm@47807
  1238
measure".  Most constants are defined now outside of locales and gain
wenzelm@47807
  1239
an additional parameter, like null_sets, almost_eventually or \<mu>'.
wenzelm@47807
  1240
Measure space constructions for distributions and densities now got
wenzelm@47807
  1241
their own constants distr and density.  Instead of using locales to
wenzelm@47807
  1242
describe measure spaces with a finite space, the measure count_space
wenzelm@47807
  1243
and point_measure is introduced.  INCOMPATIBILITY.
hoelzl@47694
  1244
hoelzl@47694
  1245
  Renamed constants:
hoelzl@47694
  1246
  measure -> emeasure
hoelzl@47694
  1247
  finite_measure.\<mu>' -> measure
hoelzl@47694
  1248
  product_algebra_generator -> prod_algebra
hoelzl@47694
  1249
  product_prob_space.emb -> prod_emb
hoelzl@47694
  1250
  product_prob_space.infprod_algebra -> PiM
hoelzl@47694
  1251
hoelzl@47694
  1252
  Removed locales:
hoelzl@47694
  1253
  completeable_measure_space
hoelzl@47694
  1254
  finite_measure_space
hoelzl@47694
  1255
  finite_prob_space
hoelzl@47694
  1256
  finite_product_finite_prob_space
hoelzl@47694
  1257
  finite_product_sigma_algebra
hoelzl@47694
  1258
  finite_sigma_algebra
hoelzl@47694
  1259
  measure_space
hoelzl@47694
  1260
  pair_finite_prob_space
hoelzl@47694
  1261
  pair_finite_sigma_algebra
hoelzl@47694
  1262
  pair_finite_space
hoelzl@47694
  1263
  pair_sigma_algebra
hoelzl@47694
  1264
  product_sigma_algebra
hoelzl@47694
  1265
hoelzl@47694
  1266
  Removed constants:
hoelzl@47751
  1267
  conditional_space
hoelzl@47694
  1268
  distribution -> use distr measure, or distributed predicate
hoelzl@47751
  1269
  image_space
hoelzl@47694
  1270
  joint_distribution -> use distr measure, or distributed predicate
hoelzl@47751
  1271
  pair_measure_generator
hoelzl@47694
  1272
  product_prob_space.infprod_algebra -> use PiM
hoelzl@47694
  1273
  subvimage
hoelzl@47694
  1274
hoelzl@47694
  1275
  Replacement theorems:
hoelzl@47751
  1276
  finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
hoelzl@47751
  1277
  finite_measure.empty_measure -> measure_empty
hoelzl@47751
  1278
  finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
hoelzl@47751
  1279
  finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
hoelzl@47751
  1280
  finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
hoelzl@47751
  1281
  finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
hoelzl@47751
  1282
  finite_measure.finite_measure -> finite_measure.emeasure_finite
hoelzl@47751
  1283
  finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
hoelzl@47751
  1284
  finite_measure.positive_measure' -> measure_nonneg
hoelzl@47751
  1285
  finite_measure.real_measure -> finite_measure.emeasure_real
hoelzl@47751
  1286
  finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
hoelzl@47751
  1287
  finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
hoelzl@47751
  1288
  finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
hoelzl@47751
  1289
  information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
hoelzl@47751
  1290
  information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
hoelzl@47751
  1291
  information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
hoelzl@47751
  1292
  information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
hoelzl@47751
  1293
  information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
hoelzl@47751
  1294
  information_space.entropy_commute -> information_space.entropy_commute_simple
hoelzl@47751
  1295
  information_space.entropy_eq -> information_space.entropy_simple_distributed
hoelzl@47751
  1296
  information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
hoelzl@47751
  1297
  information_space.entropy_positive -> information_space.entropy_nonneg_simple
hoelzl@47751
  1298
  information_space.entropy_uniform_max -> information_space.entropy_uniform
hoelzl@47751
  1299
  information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
hoelzl@47751
  1300
  information_space.KL_eq_0 -> information_space.KL_same_eq_0
hoelzl@47751
  1301
  information_space.KL_ge_0 -> information_space.KL_nonneg
hoelzl@47751
  1302
  information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
hoelzl@47751
  1303
  information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
hoelzl@47751
  1304
  Int_stable_cuboids -> Int_stable_atLeastAtMost
hoelzl@47751
  1305
  Int_stable_product_algebra_generator -> positive_integral
hoelzl@47751
  1306
  measure_preserving -> equality "distr M N f = N" "f : measurable M N"
hoelzl@47694
  1307
  measure_space.additive -> emeasure_additive
hoelzl@47751
  1308
  measure_space.AE_iff_null_set -> AE_iff_null
hoelzl@47751
  1309
  measure_space.almost_everywhere_def -> eventually_ae_filter
hoelzl@47751
  1310
  measure_space.almost_everywhere_vimage -> AE_distrD
hoelzl@47751
  1311
  measure_space.continuity_from_above -> INF_emeasure_decseq
hoelzl@47751
  1312
  measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
hoelzl@47751
  1313
  measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
hoelzl@47694
  1314
  measure_space.continuity_from_below -> SUP_emeasure_incseq
hoelzl@47751
  1315
  measure_space_density -> emeasure_density
hoelzl@47751
  1316
  measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
hoelzl@47751
  1317
  measure_space.integrable_vimage -> integrable_distr
hoelzl@47751
  1318
  measure_space.integral_translated_density -> integral_density
hoelzl@47751
  1319
  measure_space.integral_vimage -> integral_distr
hoelzl@47751
  1320
  measure_space.measure_additive -> plus_emeasure
hoelzl@47751
  1321
  measure_space.measure_compl -> emeasure_compl
hoelzl@47751
  1322
  measure_space.measure_countable_increasing -> emeasure_countable_increasing
hoelzl@47751
  1323
  measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
hoelzl@47694
  1324
  measure_space.measure_decseq -> decseq_emeasure
hoelzl@47751
  1325
  measure_space.measure_Diff -> emeasure_Diff
hoelzl@47751
  1326
  measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
hoelzl@47694
  1327
  measure_space.measure_eq_0 -> emeasure_eq_0
hoelzl@47694
  1328
  measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
hoelzl@47751
  1329
  measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
hoelzl@47751
  1330
  measure_space.measure_incseq -> incseq_emeasure
hoelzl@47751
  1331
  measure_space.measure_insert -> emeasure_insert
hoelzl@47751
  1332
  measure_space.measure_mono -> emeasure_mono
hoelzl@47751
  1333
  measure_space.measure_not_negative -> emeasure_not_MInf
hoelzl@47751
  1334
  measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
hoelzl@47751
  1335
  measure_space.measure_setsum -> setsum_emeasure
hoelzl@47751
  1336
  measure_space.measure_setsum_split -> setsum_emeasure_cover
hoelzl@47694
  1337
  measure_space.measure_space_vimage -> emeasure_distr
hoelzl@47751
  1338
  measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
hoelzl@47751
  1339
  measure_space.measure_subadditive -> subadditive
hoelzl@47751
  1340
  measure_space.measure_top -> emeasure_space
hoelzl@47751
  1341
  measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
hoelzl@47751
  1342
  measure_space.measure_Un_null_set -> emeasure_Un_null_set
hoelzl@47751
  1343
  measure_space.positive_integral_translated_density -> positive_integral_density
hoelzl@47751
  1344
  measure_space.positive_integral_vimage -> positive_integral_distr
hoelzl@47694
  1345
  measure_space.real_continuity_from_above -> Lim_measure_decseq
hoelzl@47751
  1346
  measure_space.real_continuity_from_below -> Lim_measure_incseq
hoelzl@47694
  1347
  measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
hoelzl@47751
  1348
  measure_space.real_measure_Diff -> measure_Diff
hoelzl@47751
  1349
  measure_space.real_measure_finite_Union -> measure_finite_Union
hoelzl@47751
  1350
  measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
hoelzl@47751
  1351
  measure_space.real_measure_subadditive -> measure_subadditive
hoelzl@47751
  1352
  measure_space.real_measure_Union -> measure_Union
hoelzl@47751
  1353
  measure_space.real_measure_UNION -> measure_UNION
hoelzl@47694
  1354
  measure_space.simple_function_vimage -> simple_function_comp
hoelzl@47694
  1355
  measure_space.simple_integral_vimage -> simple_integral_distr
hoelzl@47751
  1356
  measure_space.simple_integral_vimage -> simple_integral_distr
hoelzl@47751
  1357
  measure_unique_Int_stable -> measure_eqI_generator_eq
hoelzl@47751
  1358
  measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
hoelzl@47694
  1359
  pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
hoelzl@47694
  1360
  pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
hoelzl@47694
  1361
  pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
hoelzl@47694
  1362
  pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
hoelzl@47694
  1363
  pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
hoelzl@47694
  1364
  pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
hoelzl@47694
  1365
  pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
hoelzl@47694
  1366
  pair_sigma_algebra.sets_swap -> sets_pair_swap
hoelzl@47751
  1367
  pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
hoelzl@47751
  1368
  pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
hoelzl@47751
  1369
  pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
hoelzl@47751
  1370
  pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
hoelzl@47751
  1371
  pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
hoelzl@47751
  1372
  pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
hoelzl@47751
  1373
  prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
hoelzl@47751
  1374
  prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
hoelzl@47694
  1375
  prob_space.measure_space_1 -> prob_space.emeasure_space_1
hoelzl@47694
  1376
  prob_space.prob_space_vimage -> prob_space_distr
hoelzl@47694
  1377
  prob_space.random_variable_restrict -> measurable_restrict
hoelzl@47751
  1378
  prob_space_unique_Int_stable -> measure_eqI_prob_space
hoelzl@47751
  1379
  product_algebraE -> prod_algebraE_all
hoelzl@47751
  1380
  product_algebra_generator_der -> prod_algebra_eq_finite
hoelzl@47751
  1381
  product_algebra_generator_into_space -> prod_algebra_sets_into_space
hoelzl@47751
  1382
  product_algebraI -> sets_PiM_I_finite
hoelzl@47751
  1383
  product_measure_exists -> product_sigma_finite.sigma_finite
hoelzl@47694
  1384
  product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
hoelzl@47694
  1385
  product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
hoelzl@47694
  1386
  product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
hoelzl@47694
  1387
  product_prob_space.measurable_component -> measurable_component_singleton
hoelzl@47694
  1388
  product_prob_space.measurable_emb -> measurable_prod_emb
hoelzl@47694
  1389
  product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
hoelzl@47694
  1390
  product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
hoelzl@47694
  1391
  product_prob_space.measure_emb -> emeasure_prod_emb
hoelzl@47751
  1392
  product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
hoelzl@47751
  1393
  product_sigma_algebra.product_algebra_into_space -> space_closed
hoelzl@47751
  1394
  product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
hoelzl@47751
  1395
  product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
hoelzl@47751
  1396
  product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
hoelzl@47694
  1397
  sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
hoelzl@47751
  1398
  sets_product_algebra -> sets_PiM
hoelzl@47751
  1399
  sigma_algebra.measurable_sigma -> measurable_measure_of
hoelzl@47751
  1400
  sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
hoelzl@47751
  1401
  sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
hoelzl@47751
  1402
  sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
hoelzl@47751
  1403
  space_product_algebra -> space_PiM
hoelzl@47694
  1404
wenzelm@47855
  1405
* Session HOL-TPTP: support to parse and import TPTP problems (all
wenzelm@47855
  1406
languages) into Isabelle/HOL.
wenzelm@47413
  1407
blanchet@45398
  1408
noschinl@45160
  1409
*** FOL ***
noschinl@45160
  1410
wenzelm@45383
  1411
* New "case_product" attribute (see HOL).
noschinl@45160
  1412
wenzelm@45109
  1413
wenzelm@47463
  1414
*** ZF ***
wenzelm@47463
  1415
wenzelm@47463
  1416
* Greater support for structured proofs involving induction or case
wenzelm@47463
  1417
analysis.
wenzelm@47463
  1418
wenzelm@47463
  1419
* Much greater use of mathematical symbols.
wenzelm@47463
  1420
wenzelm@47463
  1421
* Removal of many ML theorem bindings.  INCOMPATIBILITY.
wenzelm@47463
  1422
wenzelm@47463
  1423
wenzelm@45128
  1424
*** ML ***
wenzelm@45128
  1425
wenzelm@46948
  1426
* Antiquotation @{keyword "name"} produces a parser for outer syntax
wenzelm@46948
  1427
from a minor keyword introduced via theory header declaration.
wenzelm@46948
  1428
wenzelm@46961
  1429
* Antiquotation @{command_spec "name"} produces the
wenzelm@46961
  1430
Outer_Syntax.command_spec from a major keyword introduced via theory
wenzelm@46961
  1431
header declaration; it can be passed to Outer_Syntax.command etc.
wenzelm@46961
  1432
wenzelm@46916
  1433
* Local_Theory.define no longer hard-wires default theorem name
wenzelm@46992
  1434
"foo_def", but retains the binding as given.  If that is Binding.empty
wenzelm@46992
  1435
/ Attrib.empty_binding, the result is not registered as user-level
wenzelm@46992
  1436
fact.  The Local_Theory.define_internal variant allows to specify a
wenzelm@46992
  1437
non-empty name (used for the foundation in the background theory),
wenzelm@46992
  1438
while omitting the fact binding in the user-context.  Potential
wenzelm@46992
  1439
INCOMPATIBILITY for derived definitional packages: need to specify
wenzelm@46992
  1440
naming policy for primitive definitions more explicitly.
wenzelm@46916
  1441
wenzelm@46497
  1442
* Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
wenzelm@46497
  1443
conformance with similar operations in structure Term and Logic.
wenzelm@46497
  1444
wenzelm@45592
  1445
* Antiquotation @{attributes [...]} embeds attribute source
wenzelm@45592
  1446
representation into the ML text, which is particularly useful with
wenzelm@45592
  1447
declarations like Local_Theory.note.
wenzelm@45592
  1448
wenzelm@45128
  1449
* Structure Proof_Context follows standard naming scheme.  Old
wenzelm@45128
  1450
ProofContext has been discontinued.  INCOMPATIBILITY.
wenzelm@45128
  1451
wenzelm@45293
  1452
* Refined Local_Theory.declaration {syntax, pervasive}, with subtle
wenzelm@45298
  1453
change of semantics: update is applied to auxiliary local theory
wenzelm@45293
  1454
context as well.
wenzelm@45293
  1455
wenzelm@45620
  1456
* Modernized some old-style infix operations:
wenzelm@45620
  1457
wenzelm@45620
  1458
  addeqcongs    ~> Simplifier.add_eqcong
wenzelm@45620
  1459
  deleqcongs    ~> Simplifier.del_eqcong
wenzelm@45620
  1460
  addcongs      ~> Simplifier.add_cong
wenzelm@45620
  1461
  delcongs      ~> Simplifier.del_cong
wenzelm@45625
  1462
  setmksimps    ~> Simplifier.set_mksimps
wenzelm@45625
  1463
  setmkcong     ~> Simplifier.set_mkcong
wenzelm@45625
  1464
  setmksym      ~> Simplifier.set_mksym
wenzelm@45625
  1465
  setmkeqTrue   ~> Simplifier.set_mkeqTrue
wenzelm@45625
  1466
  settermless   ~> Simplifier.set_termless
wenzelm@45625
  1467
  setsubgoaler  ~> Simplifier.set_subgoaler
wenzelm@45620
  1468
  addsplits     ~> Splitter.add_split
wenzelm@45620
  1469
  delsplits     ~> Splitter.del_split
wenzelm@45620
  1470
wenzelm@45128
  1471
wenzelm@47461
  1472
*** System ***
wenzelm@47461
  1473
wenzelm@47661
  1474
* USER_HOME settings variable points to cross-platform user home
wenzelm@47661
  1475
directory, which coincides with HOME on POSIX systems only.  Likewise,
wenzelm@47661
  1476
the Isabelle path specification "~" now expands to $USER_HOME, instead
wenzelm@47661
  1477
of former $HOME.  A different default for USER_HOME may be set
wenzelm@47661
  1478
explicitly in shell environment, before Isabelle settings are
wenzelm@47661
  1479
evaluated.  Minor INCOMPATIBILITY: need to adapt Isabelle path where
wenzelm@47661
  1480
the generic user home was intended.
wenzelm@47661
  1481
wenzelm@47807
  1482
* ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
wenzelm@47807
  1483
notation, which is useful for the jEdit file browser, for example.
wenzelm@47807
  1484
wenzelm@47464
  1485
* ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
wenzelm@47464
  1486
(not just JRE).
wenzelm@47464
  1487
wenzelm@47461
  1488
wenzelm@45109
  1489
wenzelm@44801
  1490
New in Isabelle2011-1 (October 2011)
wenzelm@44801
  1491
------------------------------------
wenzelm@41651
  1492
wenzelm@41703
  1493
*** General ***
wenzelm@41703
  1494
wenzelm@44760
  1495
* Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
wenzelm@44968
  1496
"isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
wenzelm@44760
  1497
wenzelm@44777
  1498
  - Management of multiple theory files directly from the editor
wenzelm@44760
  1499
    buffer store -- bypassing the file-system (no requirement to save
wenzelm@44760
  1500
    files for checking).
wenzelm@44760
  1501
wenzelm@44777
  1502
  - Markup of formal entities within the text buffer, with semantic
wenzelm@44760
  1503
    highlighting, tooltips and hyperlinks to jump to defining source
wenzelm@44760
  1504
    positions.
wenzelm@44760
  1505
wenzelm@44777
  1506
  - Improved text rendering, with sub/superscripts in the source
wenzelm@44777
  1507
    buffer (including support for copy/paste wrt. output panel, HTML
wenzelm@44777
  1508
    theory output and other non-Isabelle text boxes).
wenzelm@44777
  1509
wenzelm@44777
  1510
  - Refined scheduling of proof checking and printing of results,
wenzelm@44760
  1511
    based on interactive editor view.  (Note: jEdit folding and
wenzelm@44760
  1512
    narrowing allows to restrict buffer perspectives explicitly.)
wenzelm@44760
  1513
wenzelm@44777
  1514
  - Reduced CPU performance requirements, usable on machines with few
wenzelm@44760
  1515
    cores.
wenzelm@44760
  1516
wenzelm@44777
  1517
  - Reduced memory requirements due to pruning of unused document
wenzelm@44760
  1518
    versions (garbage collection).
wenzelm@44760
  1519
wenzelm@44760
  1520
See also ~~/src/Tools/jEdit/README.html for further information,
wenzelm@44760
  1521
including some remaining limitations.
wenzelm@44760
  1522
wenzelm@44800
  1523
* Theory loader: source files are exclusively located via the master
wenzelm@44800
  1524
directory of each theory node (where the .thy file itself resides).
wenzelm@44800
  1525
The global load path (such as src/HOL/Library) has been discontinued.
wenzelm@44800
  1526
Note that the path element ~~ may be used to reference theories in the
wenzelm@44800
  1527
Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
wenzelm@44800
  1528
INCOMPATIBILITY.
wenzelm@44800
  1529
wenzelm@41955
  1530
* Theory loader: source files are identified by content via SHA1
wenzelm@41955
  1531
digests.  Discontinued former path/modtime identification and optional
wenzelm@41955
  1532
ISABELLE_FILE_IDENT plugin scripts.
wenzelm@41955
  1533
wenzelm@41703
  1534
* Parallelization of nested Isar proofs is subject to
wenzelm@41703
  1535
Goal.parallel_proofs_threshold (default 100).  See also isabelle
wenzelm@41703
  1536
usedir option -Q.
wenzelm@41703
  1537
wenzelm@42669
  1538
* Name space: former unsynchronized references are now proper
wenzelm@42669
  1539
configuration options, with more conventional names:
wenzelm@42669
  1540
wenzelm@42669
  1541
  long_names   ~> names_long
wenzelm@42669
  1542
  short_names  ~> names_short
wenzelm@42669
  1543
  unique_names ~> names_unique
wenzelm@42669
  1544
wenzelm@42669
  1545
Minor INCOMPATIBILITY, need to declare options in context like this:
wenzelm@42669
  1546
wenzelm@42669
  1547
  declare [[names_unique = false]]
wenzelm@42358
  1548
wenzelm@42502
  1549
* Literal facts `prop` may contain dummy patterns, e.g. `_ = _`.  Note
wenzelm@42502
  1550
that the result needs to be unique, which means fact specifications
wenzelm@42502
  1551
may have to be refined after enriching a proof context.
wenzelm@42502
  1552
wenzelm@44800
  1553
* Attribute "case_names" has been refined: the assumptions in each case
wenzelm@44800
  1554
can be named now by following the case name with [name1 name2 ...].
wenzelm@44800
  1555
wenzelm@44968
  1556
* Isabelle/Isar reference manual has been updated and extended:
wenzelm@44968
  1557
  - "Synopsis" provides a catalog of main Isar language concepts.
wenzelm@44968
  1558
  - Formal references in syntax diagrams, via @{rail} antiquotation.
wenzelm@44968
  1559
  - Updated material from classic "ref" manual, notably about
wenzelm@44968
  1560
    "Classical Reasoner".
wenzelm@42633
  1561
wenzelm@41703
  1562
blanchet@41727
  1563
*** HOL ***
blanchet@41727
  1564
wenzelm@44968
  1565
* Class bot and top require underlying partial order rather than
wenzelm@44800
  1566
preorder: uniqueness of bot and top is guaranteed.  INCOMPATIBILITY.
haftmann@43815
  1567
haftmann@43940
  1568
* Class complete_lattice: generalized a couple of lemmas from sets;
wenzelm@44800
  1569
generalized theorems INF_cong and SUP_cong.  New type classes for
wenzelm@44800
  1570
complete boolean algebras and complete linear orders.  Lemmas
wenzelm@44800
  1571
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
wenzelm@44800
  1572
class complete_linorder.
wenzelm@44800
  1573
wenzelm@44800
  1574
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
wenzelm@44800
  1575
Sup_fun_def, Inf_apply, Sup_apply.
wenzelm@44800
  1576
wenzelm@45088
  1577
Removed redundant lemmas (the right hand side gives hints how to
wenzelm@45088
  1578
replace them for (metis ...), or (simp only: ...) proofs):
hoelzl@45041
  1579
hoelzl@45041
  1580
  Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
hoelzl@45041
  1581
  Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
hoelzl@45041
  1582
  Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
hoelzl@45041
  1583
  Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
hoelzl@45041
  1584
  Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
hoelzl@45041
  1585
  Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
hoelzl@45041
  1586
  Inter_def ~> INF_def, image_def
hoelzl@45041
  1587
  Union_def ~> SUP_def, image_def
hoelzl@45041
  1588
  INT_eq ~> INF_def, and image_def
hoelzl@45041
  1589
  UN_eq ~> SUP_def, and image_def
hoelzl@45041
  1590
  INF_subset ~> INF_superset_mono [OF _ order_refl]
wenzelm@44800
  1591
wenzelm@44800
  1592
More consistent and comprehensive names:
wenzelm@44800
  1593
hoelzl@45041
  1594
  INTER_eq_Inter_image ~> INF_def
hoelzl@45041
  1595
  UNION_eq_Union_image ~> SUP_def
haftmann@43872
  1596
  INFI_def ~> INF_def
haftmann@43872
  1597
  SUPR_def ~> SUP_def
haftmann@44103
  1598
  INF_leI ~> INF_lower
haftmann@44103
  1599
  INF_leI2 ~> INF_lower2
haftmann@44103
  1600
  le_INFI ~> INF_greatest
haftmann@44103
  1601
  le_SUPI ~> SUP_upper
haftmann@44103
  1602
  le_SUPI2 ~> SUP_upper2
haftmann@44103
  1603
  SUP_leI ~> SUP_least
haftmann@43873
  1604
  INFI_bool_eq ~> INF_bool_eq
haftmann@43873
  1605
  SUPR_bool_eq ~> SUP_bool_eq
haftmann@43873
  1606
  INFI_apply ~> INF_apply
haftmann@43873
  1607
  SUPR_apply ~> SUP_apply
haftmann@44103
  1608
  INTER_def ~> INTER_eq
haftmann@44103
  1609
  UNION_def ~> UNION_eq
haftmann@44103
  1610
haftmann@43865
  1611
INCOMPATIBILITY.
haftmann@43865
  1612
wenzelm@44973
  1613
* Renamed theory Complete_Lattice to Complete_Lattices.
wenzelm@44973
  1614
INCOMPATIBILITY.
wenzelm@44973
  1615
wenzelm@44973
  1616
* Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
wenzelm@44973
  1617
INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
wenzelm@44973
  1618
Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
wenzelm@44973
  1619
Sup_insert are now declared as [simp].  INCOMPATIBILITY.
wenzelm@44973
  1620
wenzelm@44973
  1621
* Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
wenzelm@44973
  1622
compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
wenzelm@44973
  1623
sup_inf_absob, sup_left_idem are now declared as [simp].  Minor
wenzelm@44973
  1624
INCOMPATIBILITY.
wenzelm@44973
  1625
krauss@44845
  1626
* Added syntactic classes "inf" and "sup" for the respective
krauss@44845
  1627
constants.  INCOMPATIBILITY: Changes in the argument order of the
krauss@44845
  1628
(mostly internal) locale predicates for some derived classes.
krauss@44845
  1629
wenzelm@44800
  1630
* Theorem collections ball_simps and bex_simps do not contain theorems
wenzelm@44800
  1631
referring to UNION any longer; these have been moved to collection
wenzelm@44800
  1632
UN_ball_bex_simps.  INCOMPATIBILITY.
wenzelm@44800
  1633
wenzelm@44800
  1634
* Theory Archimedean_Field: floor now is defined as parameter of a
wenzelm@44800
  1635
separate type class floor_ceiling.
wenzelm@44800
  1636
wenzelm@44800
  1637
* Theory Finite_Set: more coherent development of fold_set locales:
haftmann@42874
  1638
haftmann@42874
  1639
    locale fun_left_comm ~> locale comp_fun_commute
haftmann@42874
  1640
    locale fun_left_comm_idem ~> locale comp_fun_idem
wenzelm@44800
  1641
wenzelm@44800
  1642
Both use point-free characterization; interpretation proofs may need
wenzelm@44800
  1643
adjustment.  INCOMPATIBILITY.
haftmann@42874
  1644
wenzelm@44800
  1645
* Theory Limits: Type "'a net" has been renamed to "'a filter", in
huffman@44081
  1646
accordance with standard mathematical terminology. INCOMPATIBILITY.
huffman@44081
  1647
wenzelm@44800
  1648
* Theory Complex_Main: The locale interpretations for the
wenzelm@44800
  1649
bounded_linear and bounded_bilinear locales have been removed, in
wenzelm@44800
  1650
order to reduce the number of duplicate lemmas. Users must use the
wenzelm@44800
  1651
original names for distributivity theorems, potential INCOMPATIBILITY.
huffman@44282
  1652
huffman@44282
  1653
  divide.add ~> add_divide_distrib
huffman@44282
  1654
  divide.diff ~> diff_divide_distrib
huffman@44282
  1655
  divide.setsum ~> setsum_divide_distrib
huffman@44282
  1656
  mult.add_right ~> right_distrib
huffman@44282
  1657
  mult.diff_right ~> right_diff_distrib
huffman@44282
  1658
  mult_right.setsum ~> setsum_right_distrib
huffman@44282
  1659
  mult_left.diff ~> left_diff_distrib
huffman@44282
  1660
wenzelm@44800
  1661
* Theory Complex_Main: Several redundant theorems have been removed or
huffman@44568
  1662
replaced by more general versions. INCOMPATIBILITY.
huffman@44522
  1663
huffman@45051
  1664
  real_diff_def ~> minus_real_def
huffman@45051
  1665
  real_divide_def ~> divide_real_def
huffman@45051
  1666
  real_less_def ~> less_le
huffman@45051
  1667
  real_abs_def ~> abs_real_def
huffman@45051
  1668
  real_sgn_def ~> sgn_real_def
huffman@45051
  1669
  real_mult_commute ~> mult_commute
huffman@45051
  1670
  real_mult_assoc ~> mult_assoc
huffman@45051
  1671
  real_mult_1 ~> mult_1_left
huffman@45051
  1672
  real_add_mult_distrib ~> left_distrib
huffman@45051
  1673
  real_zero_not_eq_one ~> zero_neq_one
huffman@45051
  1674
  real_mult_inverse_left ~> left_inverse
huffman@45051
  1675
  INVERSE_ZERO ~> inverse_zero
huffman@45051
  1676
  real_le_refl ~> order_refl
huffman@45051
  1677
  real_le_antisym ~> order_antisym
huffman@45051
  1678
  real_le_trans ~> order_trans
huffman@45051
  1679
  real_le_linear ~> linear
huffman@45051
  1680
  real_le_eq_diff ~> le_iff_diff_le_0
huffman@45051
  1681
  real_add_left_mono ~> add_left_mono
huffman@45051
  1682
  real_mult_order ~> mult_pos_pos
huffman@45051
  1683
  real_mult_less_mono2 ~> mult_strict_left_mono
huffman@44822
  1684
  real_of_int_real_of_nat ~> real_of_int_of_nat_eq
huffman@44522
  1685
  real_0_le_divide_iff ~> zero_le_divide_iff
huffman@44522
  1686
  realpow_two_disj ~> power2_eq_iff
huffman@44522
  1687
  real_squared_diff_one_factored ~> square_diff_one_factored
huffman@44522
  1688
  realpow_two_diff ~> square_diff_square_factored
huffman@44669
  1689
  reals_complete2 ~> complete_real
huffman@44749
  1690
  real_sum_squared_expand ~> power2_sum
huffman@44522
  1691
  exp_ln_eq ~> ln_unique
huffman@44711
  1692
  expi_add ~> exp_add
huffman@44711
  1693
  expi_zero ~> exp_zero
huffman@44522
  1694
  lemma_DERIV_subst ~> DERIV_cong
huffman@44568
  1695
  LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
huffman@44568
  1696
  LIMSEQ_const ~> tendsto_const
huffman@44568
  1697
  LIMSEQ_norm ~> tendsto_norm
huffman@44568
  1698
  LIMSEQ_add ~> tendsto_add
huffman@44568
  1699
  LIMSEQ_minus ~> tendsto_minus
huffman@44568
  1700
  LIMSEQ_minus_cancel ~> tendsto_minus_cancel
huffman@44568
  1701
  LIMSEQ_diff ~> tendsto_diff
huffman@44568
  1702
  bounded_linear.LIMSEQ ~> bounded_linear.tendsto
huffman@44568
  1703
  bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
huffman@44568
  1704
  LIMSEQ_mult ~> tendsto_mult
huffman@44568
  1705
  LIMSEQ_inverse ~> tendsto_inverse
huffman@44568
  1706
  LIMSEQ_divide ~> tendsto_divide
huffman@44568
  1707
  LIMSEQ_pow ~> tendsto_power
huffman@44568
  1708
  LIMSEQ_setsum ~> tendsto_setsum
huffman@44568
  1709
  LIMSEQ_setprod ~> tendsto_setprod
huffman@44568
  1710
  LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
huffman@44568
  1711
  LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
huffman@44568
  1712
  LIMSEQ_imp_rabs ~> tendsto_rabs
huffman@44710
  1713
  LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
huffman@44710
  1714
  LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
huffman@44710
  1715
  LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
huffman@44748
  1716
  LIMSEQ_Complex ~> tendsto_Complex
huffman@44568
  1717
  LIM_ident ~> tendsto_ident_at
huffman@44568
  1718
  LIM_const ~> tendsto_const
huffman@44568
  1719
  LIM_add ~> tendsto_add
huffman@44568
  1720
  LIM_add_zero ~> tendsto_add_zero
huffman@44568
  1721
  LIM_minus ~> tendsto_minus
huffman@44568
  1722
  LIM_diff ~> tendsto_diff
huffman@44568
  1723
  LIM_norm ~> tendsto_norm
huffman@44568
  1724
  LIM_norm_zero ~> tendsto_norm_zero
huffman@44568
  1725
  LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
huffman@44568
  1726
  LIM_norm_zero_iff ~> tendsto_norm_zero_iff
huffman@44568
  1727
  LIM_rabs ~> tendsto_rabs
huffman@44568
  1728
  LIM_rabs_zero ~> tendsto_rabs_zero
huffman@44568
  1729
  LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
huffman@44568
  1730
  LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
huffman@44568
  1731
  LIM_compose ~> tendsto_compose
huffman@44568
  1732
  LIM_mult ~> tendsto_mult
huffman@44568
  1733
  LIM_scaleR ~> tendsto_scaleR
huffman@44568
  1734
  LIM_of_real ~> tendsto_of_real
huffman@44568
  1735
  LIM_power ~> tendsto_power
huffman@44568
  1736
  LIM_inverse ~> tendsto_inverse
huffman@44568
  1737
  LIM_sgn ~> tendsto_sgn
huffman@44568
  1738
  isCont_LIM_compose ~> isCont_tendsto_compose
huffman@44568
  1739
  bounded_linear.LIM ~> bounded_linear.tendsto
huffman@44568
  1740
  bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
huffman@44568
  1741
  bounded_bilinear.LIM ~> bounded_bilinear.tendsto
huffman@44568
  1742
  bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
huffman@44568
  1743
  bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
huffman@44568
  1744
  bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
huffman@44568
  1745
  LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
huffman@44522
  1746
wenzelm@44967
  1747
* Theory Complex_Main: The definition of infinite series was
wenzelm@44967
  1748
generalized.  Now it is defined on the type class {topological_space,
wenzelm@44967
  1749
comm_monoid_add}.  Hence it is useable also for extended real numbers.
wenzelm@42484
  1750
huffman@44908
  1751
* Theory Complex_Main: The complex exponential function "expi" is now
huffman@44908
  1752
a type-constrained abbreviation for "exp :: complex => complex"; thus
huffman@44908
  1753
several polymorphic lemmas about "exp" are now applicable to "expi".
huffman@44908
  1754
wenzelm@44968
  1755
* Code generation:
wenzelm@44968
  1756
wenzelm@44968
  1757
  - Theory Library/Code_Char_ord provides native ordering of
wenzelm@44968
  1758
    characters in the target language.
wenzelm@44968
  1759
wenzelm@44968
  1760
  - Commands code_module and code_library are legacy, use export_code
wenzelm@44968
  1761
    instead.
wenzelm@44968
  1762
wenzelm@44968
  1763
  - Method "evaluation" is legacy, use method "eval" instead.
wenzelm@44968
  1764
wenzelm@44968
  1765
  - Legacy evaluator "SML" is deactivated by default.  May be
wenzelm@44968
  1766
    reactivated by the following theory command:
wenzelm@44968
  1767
wenzelm@44968
  1768
      setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
wenzelm@44968
  1769
wenzelm@44968
  1770
* Declare ext [intro] by default.  Rare INCOMPATIBILITY.
wenzelm@44968
  1771
wenzelm@45088
  1772
* New proof method "induction" that gives induction hypotheses the
wenzelm@45088
  1773
name "IH", thus distinguishing them from further hypotheses that come
wenzelm@45088
  1774
from rule induction.  The latter are still called "hyps".  Method
wenzelm@45088
  1775
"induction" is a thin wrapper around "induct" and follows the same
wenzelm@45088
  1776
syntax.
wenzelm@45088
  1777
wenzelm@44968
  1778
* Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
wenzelm@44968
  1779
still available as a legacy feature for some time.
wenzelm@44968
  1780
wenzelm@44968
  1781
* Nitpick:
wenzelm@44968
  1782
  - Added "need" and "total_consts" options.
wenzelm@44968
  1783
  - Reintroduced "show_skolems" option by popular demand.
wenzelm@44968
  1784
  - Renamed attribute: nitpick_def ~> nitpick_unfold.
wenzelm@44968
  1785
    INCOMPATIBILITY.
wenzelm@44968
  1786
wenzelm@44968
  1787
* Sledgehammer:
wenzelm@44968
  1788
  - Use quasi-sound (and efficient) translations by default.
wenzelm@44968
  1789
  - Added support for the following provers: E-ToFoF, LEO-II,
wenzelm@44968
  1790
    Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
wenzelm@44968
  1791
  - Automatically preplay and minimize proofs before showing them if
wenzelm@44968
  1792
    this can be done within reasonable time.
wenzelm@44968
  1793
  - sledgehammer available_provers ~> sledgehammer supported_provers.
wenzelm@44968
  1794
    INCOMPATIBILITY.
wenzelm@44968
  1795
  - Added "preplay_timeout", "slicing", "type_enc", "sound",
wenzelm@44968
  1796
    "max_mono_iters", and "max_new_mono_instances" options.
wenzelm@44968
  1797
  - Removed "explicit_apply" and "full_types" options as well as "Full
wenzelm@44968
  1798
    Types" Proof General menu item. INCOMPATIBILITY.
wenzelm@44968
  1799
wenzelm@44968
  1800
* Metis:
wenzelm@44968
  1801
  - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
wenzelm@44968
  1802
  - Obsoleted "metisFT" -- use "metis (full_types)" instead.
wenzelm@44968
  1803
    INCOMPATIBILITY.
wenzelm@44968
  1804
wenzelm@44968
  1805
* Command 'try':
wenzelm@44968
  1806
  - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
wenzelm@44968
  1807
    "elim:" options. INCOMPATIBILITY.
wenzelm@44968
  1808
  - Introduced 'try' that not only runs 'try_methods' but also
wenzelm@44968
  1809
    'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
wenzelm@44968
  1810
wenzelm@44968
  1811
* Quickcheck:
wenzelm@44968
  1812
  - Added "eval" option to evaluate terms for the found counterexample
wenzelm@44968
  1813
    (currently only supported by the default (exhaustive) tester).
wenzelm@44968
  1814
  - Added post-processing of terms to obtain readable counterexamples
wenzelm@44968
  1815
    (currently only supported by the default (exhaustive) tester).
wenzelm@44968
  1816
  - New counterexample generator quickcheck[narrowing] enables
wenzelm@44968
  1817
    narrowing-based testing.  Requires the Glasgow Haskell compiler
wenzelm@44968
  1818
    with its installation location defined in the Isabelle settings
wenzelm@44968
  1819
    environment as ISABELLE_GHC.
wenzelm@44968
  1820
  - Removed quickcheck tester "SML" based on the SML code generator
wenzelm@44968
  1821
    (formly in HOL/Library).
wenzelm@44968
  1822
wenzelm@44968
  1823
* Function package: discontinued option "tailrec".  INCOMPATIBILITY,
wenzelm@44968
  1824
use 'partial_function' instead.
wenzelm@44968
  1825
wenzelm@44968
  1826
* Theory Library/Extended_Reals replaces now the positive extended
wenzelm@44968
  1827
reals found in probability theory. This file is extended by
wenzelm@44968
  1828
Multivariate_Analysis/Extended_Real_Limits.
wenzelm@44968
  1829
wenzelm@44974
  1830
* Theory Library/Old_Recdef: old 'recdef' package has been moved here,
wenzelm@44974
  1831
from where it must be imported explicitly if it is really required.
wenzelm@44974
  1832
INCOMPATIBILITY.
wenzelm@44968
  1833
wenzelm@44968
  1834
* Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
wenzelm@44968
  1835
been moved here.  INCOMPATIBILITY.
wenzelm@44968
  1836
wenzelm@44968
  1837
* Theory Library/Saturated provides type of numbers with saturated
wenzelm@44968
  1838
arithmetic.
wenzelm@44968
  1839
wenzelm@44968
  1840
* Theory Library/Product_Lattice defines a pointwise ordering for the
wenzelm@44968
  1841
product type 'a * 'b, and provides instance proofs for various order
wenzelm@44968
  1842
and lattice type classes.
wenzelm@44968
  1843
wenzelm@44968
  1844
* Theory Library/Countable now provides the "countable_datatype" proof
wenzelm@44968
  1845
method for proving "countable" class instances for datatypes.
wenzelm@44968
  1846
wenzelm@44968
  1847
* Theory Library/Cset_Monad allows do notation for computable sets
wenzelm@44968
  1848
(cset) via the generic monad ad-hoc overloading facility.
wenzelm@44968
  1849
wenzelm@44968
  1850
* Library: Theories of common data structures are split into theories
wenzelm@44968
  1851
for implementation, an invariant-ensuring type, and connection to an
wenzelm@44968
  1852
abstract type. INCOMPATIBILITY.
wenzelm@44968
  1853
wenzelm@44968
  1854
  - RBT is split into RBT and RBT_Mapping.
wenzelm@44968
  1855
  - AssocList is split and renamed into AList and AList_Mapping.
wenzelm@44968
  1856
  - DList is split into DList_Impl, DList, and DList_Cset.
wenzelm@44968
  1857
  - Cset is split into Cset and List_Cset.
wenzelm@44968
  1858
wenzelm@44968
  1859
* Theory Library/Nat_Infinity has been renamed to
wenzelm@44968
  1860
Library/Extended_Nat, with name changes of the following types and
wenzelm@44968
  1861
constants:
wenzelm@44968
  1862
wenzelm@44968
  1863
  type inat   ~> type enat
wenzelm@44968
  1864
  Fin         ~> enat
wenzelm@44968
  1865
  Infty       ~> infinity (overloaded)
wenzelm@44968
  1866
  iSuc        ~> eSuc
wenzelm@44968
  1867
  the_Fin     ~> the_enat
wenzelm@44968
  1868
wenzelm@44968
  1869
Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
wenzelm@44968
  1870
been renamed accordingly. INCOMPATIBILITY.
wenzelm@44968
  1871
wenzelm@44968
  1872
* Session Multivariate_Analysis: The euclidean_space type class now
wenzelm@44968
  1873
fixes a constant "Basis :: 'a set" consisting of the standard
wenzelm@44968
  1874
orthonormal basis for the type. Users now have the option of
wenzelm@44968
  1875
quantifying over this set instead of using the "basis" function, e.g.
wenzelm@44968
  1876
"ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
wenzelm@44968
  1877
wenzelm@44968
  1878
* Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
wenzelm@44968
  1879
to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
wenzelm@44968
  1880
"Cart_nth" and "Cart_lambda" have been respectively renamed to
wenzelm@44968
  1881
"vec_nth" and "vec_lambda"; theorems mentioning those names have
wenzelm@44968
  1882
changed to match. Definition theorems for overloaded constants now use
wenzelm@44968
  1883
the standard "foo_vec_def" naming scheme. A few other theorems have
wenzelm@44968
  1884
been renamed as follows (INCOMPATIBILITY):
wenzelm@44968
  1885
wenzelm@44968
  1886
  Cart_eq          ~> vec_eq_iff
wenzelm@44968
  1887
  dist_nth_le_cart ~> dist_vec_nth_le
wenzelm@44968
  1888
  tendsto_vector   ~> vec_tendstoI
wenzelm@44968
  1889
  Cauchy_vector    ~> vec_CauchyI
wenzelm@44968
  1890
wenzelm@44968
  1891
* Session Multivariate_Analysis: Several duplicate theorems have been
wenzelm@44968
  1892
removed, and other theorems have been renamed or replaced with more
wenzelm@44968
  1893
general versions. INCOMPATIBILITY.
wenzelm@44968
  1894
wenzelm@44968
  1895
  finite_choice ~> finite_set_choice
wenzelm@44968
  1896
  eventually_conjI ~> eventually_conj
wenzelm@44968
  1897
  eventually_and ~> eventually_conj_iff
wenzelm@44968
  1898
  eventually_false ~> eventually_False
wenzelm@44968
  1899
  setsum_norm ~> norm_setsum
wenzelm@44968
  1900
  Lim_sequentially ~> LIMSEQ_def
wenzelm@44968
  1901
  Lim_ident_at ~> LIM_ident
wenzelm@44968
  1902
  Lim_const ~> tendsto_const
wenzelm@44968
  1903
  Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
wenzelm@44968
  1904
  Lim_neg ~> tendsto_minus
wenzelm@44968
  1905
  Lim_add ~> tendsto_add
wenzelm@44968
  1906
  Lim_sub ~> tendsto_diff
wenzelm@44968
  1907
  Lim_mul ~> tendsto_scaleR
wenzelm@44968
  1908
  Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
wenzelm@44968
  1909
  Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
wenzelm@44968
  1910
  Lim_linear ~> bounded_linear.tendsto
wenzelm@44968
  1911
  Lim_component ~> tendsto_euclidean_component
wenzelm@44968
  1912
  Lim_component_cart ~> tendsto_vec_nth
wenzelm@44968
  1913
  Lim_inner ~> tendsto_inner [OF tendsto_const]
wenzelm@44968
  1914
  dot_lsum ~> inner_setsum_left
wenzelm@44968
  1915
  dot_rsum ~> inner_setsum_right
wenzelm@44968
  1916
  continuous_cmul ~> continuous_scaleR [OF continuous_const]
wenzelm@44968
  1917
  continuous_neg ~> continuous_minus
wenzelm@44968
  1918
  continuous_sub ~> continuous_diff
wenzelm@44968
  1919
  continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
wenzelm@44968
  1920
  continuous_mul ~> continuous_scaleR
wenzelm@44968
  1921
  continuous_inv ~> continuous_inverse
wenzelm@44968
  1922
  continuous_at_within_inv ~> continuous_at_within_inverse
wenzelm@44968
  1923
  continuous_at_inv ~> continuous_at_inverse
wenzelm@44968
  1924
  continuous_at_norm ~> continuous_norm [OF continuous_at_id]
wenzelm@44968
  1925
  continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
wenzelm@44968
  1926
  continuous_at_component ~> continuous_component [OF continuous_at_id]
wenzelm@44968
  1927
  continuous_on_neg ~> continuous_on_minus
wenzelm@44968
  1928
  continuous_on_sub ~> continuous_on_diff
wenzelm@44968
  1929
  continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
wenzelm@44968
  1930
  continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
wenzelm@44968
  1931
  continuous_on_mul ~> continuous_on_scaleR
wenzelm@44968
  1932
  continuous_on_mul_real ~> continuous_on_mult
wenzelm@44968
  1933
  continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
wenzelm@44968
  1934
  continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
wenzelm@44968
  1935
  continuous_on_inverse ~> continuous_on_inv
wenzelm@44968
  1936
  uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
wenzelm@44968
  1937
  uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
wenzelm@44968
  1938
  subset_interior ~> interior_mono
wenzelm@44968
  1939
  subset_closure ~> closure_mono
wenzelm@44968
  1940
  closure_univ ~> closure_UNIV
wenzelm@44968
  1941
  real_arch_lt ~> reals_Archimedean2
wenzelm@44968
  1942
  real_arch ~> reals_Archimedean3
wenzelm@44968
  1943
  real_abs_norm ~> abs_norm_cancel
wenzelm@44968
  1944
  real_abs_sub_norm ~> norm_triangle_ineq3
wenzelm@44968
  1945
  norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
wenzelm@44968
  1946
wenzelm@44968
  1947
* Session HOL-Probability:
wenzelm@44968
  1948
  - Caratheodory's extension lemma is now proved for ring_of_sets.
wenzelm@44968
  1949
  - Infinite products of probability measures are now available.
wenzelm@44968
  1950
  - Sigma closure is independent, if the generator is independent
wenzelm@44968
  1951
  - Use extended reals instead of positive extended
wenzelm@44968
  1952
    reals. INCOMPATIBILITY.
wenzelm@44968
  1953
huffman@45049
  1954
* Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
huffman@45049
  1955
huffman@45049
  1956
  expand_fun_below ~> fun_below_iff
huffman@45049
  1957
  below_fun_ext ~> fun_belowI
huffman@45049
  1958
  expand_cfun_eq ~> cfun_eq_iff
huffman@45049
  1959
  ext_cfun ~> cfun_eqI
huffman@45049
  1960
  expand_cfun_below ~> cfun_below_iff
huffman@45049
  1961
  below_cfun_ext ~> cfun_belowI
huffman@45049
  1962
  monofun_fun_fun ~> fun_belowD
huffman@45049
  1963
  monofun_fun_arg ~> monofunE
huffman@45049
  1964
  monofun_lub_fun ~> adm_monofun [THEN admD]
huffman@45049
  1965
  cont_lub_fun ~> adm_cont [THEN admD]
huffman@45049
  1966
  cont2cont_Rep_CFun ~> cont2cont_APP
huffman@45049
  1967
  cont_Rep_CFun_app ~> cont_APP_app
huffman@45049
  1968
  cont_Rep_CFun_app_app ~> cont_APP_app_app
huffman@45049
  1969
  cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
huffman@45049
  1970
  cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
huffman@45049
  1971
  contlub_cfun ~> lub_APP [symmetric]
huffman@45049
  1972
  contlub_LAM ~> lub_LAM [symmetric]
huffman@45049
  1973
  thelubI ~> lub_eqI
huffman@45049
  1974
  UU_I ~> bottomI
huffman@45049
  1975
  lift_distinct1 ~> lift.distinct(1)
huffman@45049
  1976
  lift_distinct2 ~> lift.distinct(2)
huffman@45049
  1977
  Def_not_UU ~> lift.distinct(2)
huffman@45049
  1978
  Def_inject ~> lift.inject
huffman@45049
  1979
  below_UU_iff ~> below_bottom_iff
huffman@45049
  1980
  eq_UU_iff ~> eq_bottom_iff
huffman@45049
  1981
huffman@44903
  1982
krauss@41685
  1983
*** Document preparation ***
krauss@41685
  1984
wenzelm@44800
  1985
* Antiquotation @{rail} layouts railroad syntax diagrams, see also
wenzelm@44800
  1986
isar-ref manual, both for description and actual application of the
wenzelm@44800
  1987
same.
wenzelm@44800
  1988
wenzelm@44800
  1989
* Antiquotation @{value} evaluates the given term and presents its
wenzelm@44800
  1990
result.
wenzelm@44800
  1991
wenzelm@44800
  1992
* Antiquotations: term style "isub" provides ad-hoc conversion of
wenzelm@44800
  1993
variables x1, y23 into subscripted form x\<^isub>1,
wenzelm@44800
  1994
y\<^isub>2\<^isub>3.
wenzelm@41651
  1995
wenzelm@42484
  1996
* Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
wenzelm@42484
  1997
(e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
wenzelm@42484
  1998
wenzelm@44967
  1999
* Localized \isabellestyle switch can be used within blocks or groups
wenzelm@44967
  2000
like this:
wenzelm@44967
  2001
wenzelm@44967
  2002
  \isabellestyle{it}  %preferred default
wenzelm@44967
  2003
  {\isabellestylett @{text "typewriter stuff"}}
wenzelm@44967
  2004
wenzelm@44967
  2005
* Discontinued special treatment of hard tabulators.  Implicit
wenzelm@44967
  2006
tab-width is now defined as 1.  Potential INCOMPATIBILITY for visual
wenzelm@44967
  2007
layouts.
wenzelm@44800
  2008
wenzelm@41651
  2009
wenzelm@41944
  2010
*** ML ***
wenzelm@41944
  2011
wenzelm@43731
  2012
* The inner syntax of sort/type/term/prop supports inlined YXML
wenzelm@43731
  2013
representations within quoted string tokens.  By encoding logical
wenzelm@43731
  2014
entities via Term_XML (in ML or Scala) concrete syntax can be
wenzelm@43731
  2015
bypassed, which is particularly useful for producing bits of text
wenzelm@43731
  2016
under external program control.
wenzelm@43731
  2017
wenzelm@43565
  2018
* Antiquotations for ML and document preparation are managed as theory
wenzelm@43565
  2019
data, which requires explicit setup.
wenzelm@43565
  2020
wenzelm@42897
  2021
* Isabelle_Process.is_active allows tools to check if the official
wenzelm@42897
  2022
process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
wenzelm@42897
  2023
(better known as Proof General).
wenzelm@42897
  2024
wenzelm@42360
  2025
* Structure Proof_Context follows standard naming scheme.  Old
wenzelm@42360
  2026
ProofContext is still available for some time as legacy alias.
wenzelm@42360
  2027
wenzelm@42015
  2028
* Structure Timing provides various operations for timing; supersedes
wenzelm@42015
  2029
former start_timing/end_timing etc.
wenzelm@42015
  2030
wenzelm@41944
  2031
* Path.print is the official way to show file-system paths to users
wenzelm@41944
  2032
(including quotes etc.).
wenzelm@41944
  2033
wenzelm@42056
  2034
* Inner syntax: identifiers in parse trees of generic categories
wenzelm@42056
  2035
"logic", "aprop", "idt" etc. carry position information (disguised as
wenzelm@42056
  2036
type constraints).  Occasional INCOMPATIBILITY with non-compliant
wenzelm@42057
  2037
translations that choke on unexpected type constraints.  Positions can
wenzelm@42057
  2038
be stripped in ML translations via Syntax.strip_positions /
wenzelm@42057
  2039
Syntax.strip_positions_ast, or via the syntax constant
wenzelm@42057
  2040
"_strip_positions" within parse trees.  As last resort, positions can
wenzelm@42057
  2041
be disabled via the configuration option Syntax.positions, which is
wenzelm@42057
  2042
called "syntax_positions" in Isar attribute syntax.
wenzelm@42056
  2043
wenzelm@42290
  2044
* Discontinued special status of various ML structures that contribute
wenzelm@42290
  2045
to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
wenzelm@42290
  2046
pervasive content, no inclusion in structure Syntax.  INCOMPATIBILITY,
wenzelm@42290
  2047
refer directly to Ast.Constant, Lexicon.is_identifier,
wenzelm@42290
  2048
Syntax_Trans.mk_binder_tr etc.
wenzelm@42224
  2049
wenzelm@42247
  2050
* Typed print translation: discontinued show_sorts argument, which is
wenzelm@42247
  2051
already available via context of "advanced" translation.
wenzelm@42247
  2052
wenzelm@42370
  2053
* Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
wenzelm@42370
  2054
goal states; body tactic needs to address all subgoals uniformly.
wenzelm@42370
  2055
wenzelm@42403
  2056
* Slightly more special eq_list/eq_set, with shortcut involving
wenzelm@42403
  2057
pointer equality (assumes that eq relation is reflexive).
wenzelm@42403
  2058
wenzelm@42793
  2059
* Classical tactics use proper Proof.context instead of historic types
wenzelm@42793
  2060
claset/clasimpset.  Old-style declarations like addIs, addEs, addDs
wenzelm@42793
  2061
operate directly on Proof.context.  Raw type claset retains its use as
wenzelm@42793
  2062
snapshot of the classical context, which can be recovered via
wenzelm@42793
  2063
(put_claset HOL_cs) etc.  Type clasimpset has been discontinued.
wenzelm@42793
  2064
INCOMPATIBILITY, classical tactics and derived proof methods require
wenzelm@42793
  2065
proper Proof.context.
wenzelm@42793
  2066
wenzelm@44803
  2067
wenzelm@44803
  2068
*** System ***
wenzelm@44803
  2069
wenzelm@44968
  2070
* Discontinued support for Poly/ML 5.2, which was the last version
wenzelm@44968
  2071
without proper multithreading and TimeLimit implementation.
wenzelm@44968
  2072
wenzelm@44968
  2073
* Discontinued old lib/scripts/polyml-platform, which has been
wenzelm@44968
  2074
obsolete since Isabelle2009-2.
wenzelm@44968
  2075
wenzelm@44967
  2076
* Various optional external tools are referenced more robustly and
wenzelm@44967
  2077
uniformly by explicit Isabelle settings as follows:
wenzelm@44967
  2078
wenzelm@44967
  2079
  ISABELLE_CSDP   (formerly CSDP_EXE)
wenzelm@44967
  2080
  ISABELLE_GHC    (formerly EXEC_GHC or GHC_PATH)
wenzelm@44967
  2081
  ISABELLE_OCAML  (formerly EXEC_OCAML)
wenzelm@44967
  2082
  ISABELLE_SWIPL  (formerly EXEC_SWIPL)
wenzelm@44967
  2083
  ISABELLE_YAP    (formerly EXEC_YAP)
wenzelm@44967
  2084
wenzelm@44967
  2085
Note that automated detection from the file-system or search path has
wenzelm@44967
  2086
been discontinued.  INCOMPATIBILITY.
wenzelm@44967
  2087
wenzelm@43752
  2088
* Scala layer provides JVM method invocation service for static
wenzelm@44800
  2089
methods of type (String)String, see Invoke_Scala.method in ML.  For
wenzelm@44800
  2090
example:
wenzelm@43752
  2091
wenzelm@43752
  2092
  Invoke_Scala.method "java.lang.System.getProperty" "java.home"
wenzelm@43752
  2093
wenzelm@44967
  2094
Together with YXML.string_of_body/parse_body and XML.Encode/Decode
wenzelm@44967
  2095
this allows to pass structured values between ML and Scala.
wenzelm@44800
  2096
wenzelm@44803
  2097
* The IsabelleText fonts includes some further glyphs to support the
wenzelm@44803
  2098
Prover IDE.  Potential INCOMPATIBILITY: users who happen to have
wenzelm@44803
  2099
installed a local copy (which is normally *not* required) need to
wenzelm@44803
  2100
delete or update it from ~~/lib/fonts/.
wenzelm@41944
  2101
wenzelm@41703
  2102
wenzelm@45089
  2103
wenzelm@41512
  2104
New in Isabelle2011 (January 2011)
wenzelm@41512
  2105
----------------------------------
wenzelm@37383
  2106
wenzelm@37536
  2107
*** General ***
wenzelm@37536
  2108
wenzelm@41573
  2109
* Experimental Prover IDE based on Isabelle/Scala and jEdit (see
wenzelm@41612
  2110
src/Tools/jEdit).  This also serves as IDE for Isabelle/ML, with
wenzelm@41612
  2111
useful tooltips and hyperlinks produced from its static analysis.  The
wenzelm@41612
  2112
bundled component provides an executable Isabelle tool that can be run
wenzelm@41612
  2113
like this:
wenzelm@41612
  2114
wenzelm@41612
  2115
  Isabelle2011/bin/isabelle jedit
wenzelm@41573
  2116
wenzelm@40948
  2117
* Significantly improved Isabelle/Isar implementation manual.
wenzelm@40948
  2118
wenzelm@41594
  2119
* System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
wenzelm@41595
  2120
(and thus refers to something like $HOME/.isabelle/Isabelle2011),
wenzelm@41594
  2121
while the default heap location within that directory lacks that extra
wenzelm@41594
  2122
suffix.  This isolates multiple Isabelle installations from each
wenzelm@41594
  2123
other, avoiding problems with old settings in new versions.
wenzelm@41594
  2124
INCOMPATIBILITY, need to copy/upgrade old user settings manually.
wenzelm@41594
  2125
wenzelm@40947
  2126
* Source files are always encoded as UTF-8, instead of old-fashioned
wenzelm@40947
  2127
ISO-Latin-1.  INCOMPATIBILITY.  Isabelle LaTeX documents might require
wenzelm@40948
  2128
the following package declarations:
wenzelm@40947
  2129
wenzelm@40947
  2130
  \usepackage[utf8]{inputenc}
wenzelm@40947
  2131
  \usepackage{textcomp}
wenzelm@40947
  2132
krauss@41440
  2133
* Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
wenzelm@37536
  2134
a Unicode character is treated as a single symbol, not a sequence of
wenzelm@37536
  2135
non-ASCII bytes as before.  Since Isabelle/ML string literals may
wenzelm@37536
  2136
contain symbols without further backslash escapes, Unicode can now be
wenzelm@37536
  2137
used here as well.  Recall that Symbol.explode in ML provides a
wenzelm@37536
  2138
consistent view on symbols, while raw explode (or String.explode)
wenzelm@37536
  2139
merely give a byte-oriented representation.
wenzelm@37536
  2140
wenzelm@41594
  2141
* Theory loader: source files are primarily located via the master
wenzelm@41594
  2142
directory of each theory node (where the .thy file itself resides).
wenzelm@41594
  2143
The global load path is still partially available as legacy feature.
wenzelm@41594
  2144
Minor INCOMPATIBILITY due to subtle change in file lookup: use
wenzelm@41594
  2145
explicit paths, relatively to the theory.
wenzelm@38135
  2146
wenzelm@37939
  2147
* Special treatment of ML file names has been discontinued.
wenzelm@37939
  2148
Historically, optional extensions .ML or .sml were added on demand --
wenzelm@37939
  2149
at the cost of clarity of file dependencies.  Recall that Isabelle/ML
wenzelm@37939
  2150
files exclusively use the .ML extension.  Minor INCOMPATIBILTY.
wenzelm@37939
  2151
wenzelm@38980
  2152
* Various options that affect pretty printing etc. are now properly
wenzelm@38767
  2153
handled within the context via configuration options, instead of
wenzelm@40879
  2154
unsynchronized references or print modes.  There are both ML Config.T
wenzelm@40879
  2155
entities and Isar declaration attributes to access these.
wenzelm@38767
  2156
wenzelm@39125
  2157
  ML (Config.T)                 Isar (attribute)
wenzelm@39125
  2158
wenzelm@39128
  2159
  eta_contract                  eta_contract
wenzelm@39137
  2160
  show_brackets                 show_brackets
wenzelm@39134
  2161
  show_sorts                    show_sorts
wenzelm@39134
  2162
  show_types                    show_types
wenzelm@39126
  2163
  show_question_marks           show_question_marks
wenzelm@39126
  2164
  show_consts                   show_consts
wenzelm@40879
  2165
  show_abbrevs                  show_abbrevs
wenzelm@39126
  2166
wenzelm@41379
  2167
  Syntax.ast_trace              syntax_ast_trace
wenzelm@41379
  2168
  Syntax.ast_stat               syntax_ast_stat
wenzelm@39126
  2169
  Syntax.ambiguity_level        syntax_ambiguity_level
wenzelm@39126
  2170
wenzelm@39126
  2171
  Goal_Display.goals_limit      goals_limit
wenzelm@39126
  2172
  Goal_Display.show_main_goal   show_main_goal
wenzelm@39126
  2173
wenzelm@41379
  2174
  Method.rule_trace             rule_trace
wenzelm@41379
  2175
wenzelm@39125
  2176
  Thy_Output.display            thy_output_display
wenzelm@39125
  2177
  Thy_Output.quotes             thy_output_quotes
wenzelm@39125
  2178
  Thy_Output.indent             thy_output_indent
wenzelm@39125
  2179
  Thy_Output.source             thy_output_source
wenzelm@39125
  2180
  Thy_Output.break              thy_output_break
wenzelm@39125
  2181
krauss@41440
  2182
Note that corresponding "..._default" references in ML may only be
wenzelm@38767
  2183
changed globally at the ROOT session setup, but *not* within a theory.
wenzelm@40879
  2184
The option "show_abbrevs" supersedes the former print mode
wenzelm@40879
  2185
"no_abbrevs" with inverted meaning.
wenzelm@38767
  2186
wenzelm@40878
  2187
* More systematic naming of some configuration options.
huffman@41294
  2188
INCOMPATIBILITY.
wenzelm@40878
  2189
wenzelm@40878
  2190
  trace_simp  ~>  simp_trace
wenzelm@40878
  2191
  debug_simp  ~>  simp_debug
wenzelm@40878
  2192
wenzelm@40291
  2193
* Support for real valued configuration options, using simplistic
wenzelm@40291
  2194
floating-point notation that coincides with the inner syntax for
wenzelm@40291
  2195
float_token.
wenzelm@40291
  2196
wenzelm@41594
  2197
* Support for real valued preferences (with approximative PGIP type):
wenzelm@41594
  2198
front-ends need to accept "pgint" values in float notation.
wenzelm@41594
  2199
INCOMPATIBILITY.
wenzelm@41573
  2200
wenzelm@41573
  2201
* The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
wenzelm@41573
  2202
DejaVu Sans.
wenzelm@41573
  2203
wenzelm@41594
  2204
* Discontinued support for Poly/ML 5.0 and 5.1 versions.
wenzelm@41594
  2205
wenzelm@40948
  2206
wenzelm@40948
  2207
*** Pure ***
wenzelm@40948
  2208
wenzelm@41249
  2209
* Command 'type_synonym' (with single argument) replaces somewhat
wenzelm@41249
  2210
outdated 'types', which is still available as legacy feature for some
wenzelm@41249
  2211
time.
wenzelm@41249
  2212
wenzelm@41249
  2213
* Command 'nonterminal' (with 'and' separated list of arguments)
wenzelm@41249
  2214
replaces somewhat outdated 'nonterminals'.  INCOMPATIBILITY.
wenzelm@41229
  2215
wenzelm@40965
  2216
* Command 'notepad' replaces former 'example_proof' for
wenzelm@41020
  2217
experimentation in Isar without any result.  INCOMPATIBILITY.
wenzelm@40965
  2218
ballarin@41435
  2219
* Locale interpretation commands 'interpret' and 'sublocale' accept
ballarin@41435
  2220
lists of equations to map definitions in a locale to appropriate
ballarin@41435
  2221
entities in the context of the interpretation.  The 'interpretation'
ballarin@41435
  2222
command already provided this functionality.
ballarin@41435
  2223
wenzelm@41594
  2224
* Diagnostic command 'print_dependencies' prints the locale instances
wenzelm@41594
  2225
that would be activated if the specified expression was interpreted in
wenzelm@41594
  2226
the current context.  Variant "print_dependencies!" assumes a context
wenzelm@41594
  2227
without interpretations.
ballarin@38110
  2228
ballarin@38110
  2229
* Diagnostic command 'print_interps' prints interpretations in proofs
ballarin@38110
  2230
in addition to interpretations in theories.
ballarin@38110
  2231
wenzelm@38708
  2232
* Discontinued obsolete 'global' and 'local' commands to manipulate
wenzelm@38708
  2233
the theory name space.  Rare INCOMPATIBILITY.  The ML functions
wenzelm@38708
  2234
Sign.root_path and Sign.local_path may be applied directly where this
wenzelm@38708
  2235
feature is still required for historical reasons.
wenzelm@38708
  2236
wenzelm@40948
  2237
* Discontinued obsolete 'constdefs' command.  INCOMPATIBILITY, use
haftmann@39215
  2238
'definition' instead.
haftmann@39215
  2239
wenzelm@41574
  2240
* The "prems" fact, which refers to the accidental collection of
wenzelm@41574
  2241
foundational premises in the context, is now explicitly marked as
wenzelm@41594
  2242
legacy feature and will be discontinued soon.  Consider using "assms"
wenzelm@41594
  2243
of the head statement or reference facts by explicit names.
wenzelm@41574
  2244
wenzelm@40801
  2245
* Document antiquotations @{class} and @{type} print classes and type
wenzelm@40801
  2246
constructors.
wenzelm@40801
  2247
wenzelm@40801
  2248
* Document antiquotation @{file} checks file/directory entries within
wenzelm@40801
  2249
the local file system.
haftmann@39305
  2250
ballarin@38110
  2251
haftmann@37387
  2252
*** HOL ***
haftmann@37387
  2253
wenzelm@41594
  2254
* Coercive subtyping: functions can be declared as coercions and type
wenzelm@41594
  2255
inference will add them as necessary upon input of a term.  Theory
wenzelm@41594
  2256
Complex_Main declares real :: nat => real and real :: int => real as
wenzelm@41594
  2257
coercions. A coercion function f is declared like this:
wenzelm@40939
  2258
wenzelm@40939
  2259
  declare [[coercion f]]
nipkow@40866
  2260
wenzelm@41571
  2261
To lift coercions through type constructors (e.g. from nat => real to
nipkow@40866
  2262
nat list => real list), map functions can be declared, e.g.
nipkow@40866
  2263
wenzelm@40939
  2264
  declare [[coercion_map map]]
wenzelm@40939
  2265
wenzelm@40939
  2266
Currently coercion inference is activated only in theories including
wenzelm@40939
  2267
real numbers, i.e. descendants of Complex_Main.  This is controlled by
wenzelm@41020
  2268
the configuration option "coercion_enabled", e.g. it can be enabled in
wenzelm@40939
  2269
other theories like this:
wenzelm@40939
  2270
wenzelm@40939
  2271
  declare [[coercion_enabled]]
nipkow@40866
  2272
wenzelm@41571
  2273
* Command 'partial_function' provides basic support for recursive
wenzelm@41571
  2274
function definitions over complete partial orders.  Concrete instances
krauss@40183
  2275
are provided for i) the option type, ii) tail recursion on arbitrary
wenzelm@41571
  2276
types, and iii) the heap monad of Imperative_HOL.  See
wenzelm@41571
  2277
src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
wenzelm@41571
  2278
for examples.
krauss@40183
  2279
wenzelm@41571
  2280
* Function package: f.psimps rules are no longer implicitly declared
wenzelm@41571
  2281
as [simp].  INCOMPATIBILITY.
haftmann@41398
  2282
haftmann@41398
  2283
* Datatype package: theorems generated for executable equality (class
wenzelm@41571
  2284
"eq") carry proper names and are treated as default code equations.
wenzelm@41571
  2285
wenzelm@41594
  2286
* Inductive package: now offers command 'inductive_simps' to
wenzelm@41594
  2287
automatically derive instantiated and simplified equations for
wenzelm@41594
  2288
inductive predicates, similar to 'inductive_cases'.
wenzelm@41594
  2289
wenzelm@41571
  2290
* Command 'enriched_type' allows to register properties of the
wenzelm@41571
  2291
functorial structure of types.
haftmann@39771
  2292
haftmann@39644
  2293
* Improved infrastructure for term evaluation using code generator
haftmann@39644
  2294
techniques, in particular static evaluation conversions.
haftmann@39644
  2295
wenzelm@41594
  2296
* Code generator: Scala (2.8 or higher) has been added to the target
wenzelm@41594
  2297
languages.
wenzelm@41594
  2298
haftmann@41398
  2299
* Code generator: globbing constant expressions "*" and "Theory.*"
haftmann@41398
  2300
have been replaced by the more idiomatic "_" and "Theory._".
haftmann@41398
  2301
INCOMPATIBILITY.
haftmann@41398
  2302
haftmann@41398
  2303
* Code generator: export_code without explicit file declaration prints
haftmann@41398
  2304
to standard output.  INCOMPATIBILITY.
haftmann@41398
  2305
haftmann@41398
  2306
* Code generator: do not print function definitions for case
haftmann@41398
  2307
combinators any longer.
haftmann@41398
  2308
wenzelm@41594
  2309
* Code generator: simplification with rules determined with
wenzelm@41571
  2310
src/Tools/Code/code_simp.ML and method "code_simp".
wenzelm@41571
  2311
wenzelm@41594
  2312
* Code generator for records: more idiomatic representation of record
wenzelm@40948
  2313
types.  Warning: records are not covered by ancient SML code
wenzelm@40948
  2314
generation any longer.  INCOMPATIBILITY.  In cases of need, a suitable
wenzelm@40948
  2315
rep_datatype declaration helps to succeed then:
haftmann@38537
  2316
haftmann@38537
  2317
  record 'a foo = ...
haftmann@38537
  2318
  ...
haftmann@38537
  2319
  rep_datatype foo_ext ...
haftmann@38535
  2320
wenzelm@41594
  2321
* Records: logical foundation type for records does not carry a
wenzelm@41594
  2322
'_type' suffix any longer (obsolete due to authentic syntax).
wenzelm@41594
  2323
INCOMPATIBILITY.
wenzelm@41594
  2324
haftmann@41398
  2325
* Quickcheck now by default uses exhaustive testing instead of random
wenzelm@41571
  2326
testing.  Random testing can be invoked by "quickcheck [random]",
wenzelm@41571
  2327
exhaustive testing by "quickcheck [exhaustive]".
haftmann@41398
  2328
haftmann@41398
  2329
* Quickcheck instantiates polymorphic types with small finite
haftmann@41398
  2330
datatypes by default. This enables a simple execution mechanism to
haftmann@41398
  2331
handle quantifiers and function equality over the finite datatypes.
haftmann@41398
  2332
wenzelm@41571
  2333
* Quickcheck random generator has been renamed from "code" to
wenzelm@41571
  2334
"random".  INCOMPATIBILITY.
haftmann@41398
  2335
haftmann@41398
  2336
* Quickcheck now has a configurable time limit which is set to 30
haftmann@41398
  2337
seconds by default. This can be changed by adding [timeout = n] to the
haftmann@41398
  2338
quickcheck command. The time limit for Auto Quickcheck is still set
haftmann@41398
  2339
independently.
haftmann@38461
  2340
haftmann@38461
  2341
* Quickcheck in locales considers interpretations of that locale for
haftmann@38461
  2342
counter example search.
haftmann@38461
  2343
blanchet@40059
  2344
* Sledgehammer:
wenzelm@41571
  2345
  - Added "smt" and "remote_smt" provers based on the "smt" proof
wenzelm@41571
  2346
    method. See the Sledgehammer manual for details ("isabelle doc
wenzelm@41571
  2347
    sledgehammer").
blanchet@40059
  2348
  - Renamed commands:
blanchet@40059
  2349
    sledgehammer atp_info ~> sledgehammer running_provers
blanchet@40059
  2350
    sledgehammer atp_kill ~> sledgehammer kill_provers
blanchet@40059
  2351
    sledgehammer available_atps ~> sledgehammer available_provers
blanchet@40059
  2352
    INCOMPATIBILITY.
blanchet@40059
  2353
  - Renamed options:
blanchet@40059
  2354
    sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
blanchet@40062
  2355
    sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
blanchet@40341
  2356
    sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
blanchet@40341
  2357
    (and "ms" and "min" are no longer supported)
blanchet@40341
  2358
    INCOMPATIBILITY.
blanchet@40341
  2359
blanchet@40341
  2360
* Nitpick:
blanchet@40341
  2361
  - Renamed options:
blanchet@40341
  2362
    nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
blanchet@40341
  2363
    nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
blanchet@40059
  2364
    INCOMPATIBILITY.
blanchet@40725
  2365
  - Added support for partial quotient types.
blanchet@40725
  2366
  - Added local versions of the "Nitpick.register_xxx" functions.
blanchet@40725
  2367
  - Added "whack" option.
blanchet@40725
  2368
  - Allow registration of quotient types as codatatypes.
blanchet@40725
  2369
  - Improved "merge_type_vars" option to merge more types.
blanchet@40725
  2370
  - Removed unsound "fast_descrs" option.
blanchet@40725
  2371
  - Added custom symmetry breaking for datatypes, making it possible to reach
blanchet@40725
  2372
    higher cardinalities.
blanchet@40725
  2373
  - Prevent the expansion of too large definitions.
blanchet@39957
  2374
wenzelm@41571
  2375
* Proof methods "metis" and "meson" now have configuration options
wenzelm@41571
  2376
"meson_trace", "metis_trace", and "metis_verbose" that can be enabled
wenzelm@41571
  2377
to diagnose these tools. E.g.
wenzelm@41571
  2378
wenzelm@41571
  2379
    using [[metis_trace = true]]
wenzelm@41571
  2380
haftmann@41398
  2381
* Auto Solve: Renamed "Auto Solve Direct".  The tool is now available
haftmann@41398
  2382
manually as command 'solve_direct'.
haftmann@41398
  2383
boehmes@41601
  2384
* The default SMT solver Z3 must be enabled explicitly (due to
boehmes@41601
  2385
licensing issues) by setting the environment variable
wenzelm@41603
  2386
Z3_NON_COMMERCIAL in etc/settings of the component, for example.  For
wenzelm@41603
  2387
commercial applications, the SMT solver CVC3 is provided as fall-back;
wenzelm@41603
  2388
changing the SMT solver is done via the configuration option
wenzelm@41603
  2389
"smt_solver".
boehmes@41432
  2390
boehmes@41432
  2391
* Remote SMT solvers need to be referred to by the "remote_" prefix,
wenzelm@41571
  2392
i.e. "remote_cvc3" and "remote_z3".
wenzelm@41571
  2393
wenzelm@41571
  2394
* Added basic SMT support for datatypes, records, and typedefs using
wenzelm@41571
  2395
the oracle mode (no proofs).  Direct support of pairs has been dropped
wenzelm@41571
  2396
in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
wenzelm@41571
  2397
support for a similar behavior).  Minor INCOMPATIBILITY.
boehmes@41432
  2398
boehmes@40162
  2399
* Changed SMT configuration options:
boehmes@40162
  2400
  - Renamed:
boehmes@41432
  2401
    z3_proofs ~> smt_oracle (with inverted meaning)
boehmes@40162
  2402
    z3_trace_assms ~> smt_trace_used_facts
boehmes@40162
  2403
    INCOMPATIBILITY.
boehmes@40162
  2404
  - Added:
boehmes@40424
  2405
    smt_verbose
boehmes@41432
  2406
    smt_random_seed
boehmes@40424
  2407
    smt_datatypes
boehmes@41432
  2408
    smt_infer_triggers
boehmes@41432
  2409
    smt_monomorph_limit
boehmes@40162
  2410
    cvc3_options
boehmes@41432
  2411
    remote_cvc3_options
boehmes@41432
  2412
    remote_z3_options
boehmes@40162
  2413
    yices_options
blanchet@39957
  2414
wenzelm@40948
  2415
* Boogie output files (.b2i files) need to be declared in the theory
wenzelm@40948
  2416
header.
boehmes@40580
  2417
wenzelm@41594
  2418
* Simplification procedure "list_to_set_comprehension" rewrites list
wenzelm@41594
  2419
comprehensions applied to List.set to set comprehensions.  Occasional
wenzelm@41594
  2420
INCOMPATIBILITY, may be deactivated like this:
wenzelm@41594
  2421
wenzelm@41594
  2422
  declare [[simproc del: list_to_set_comprehension]]
wenzelm@41594
  2423
wenzelm@41573
  2424
* Removed old version of primrec package.  INCOMPATIBILITY.
haftmann@41398
  2425
haftmann@41398
  2426
* Removed simplifier congruence rule of "prod_case", as has for long
haftmann@41398
  2427
been the case with "split".  INCOMPATIBILITY.
haftmann@41398
  2428
haftmann@41398
  2429
* String.literal is a type, but not a datatype.  INCOMPATIBILITY.
haftmann@41398
  2430
krauss@40388
  2431
* Removed [split_format ... and ... and ...] version of
krauss@40388
  2432
[split_format].  Potential INCOMPATIBILITY.
krauss@40388
  2433
wenzelm@41571
  2434
* Predicate "sorted" now defined inductively, with nice induction
wenzelm@41571
  2435
rules.  INCOMPATIBILITY: former sorted.simps now named sorted_simps.
haftmann@41398
  2436
haftmann@41398
  2437
* Constant "contents" renamed to "the_elem", to free the generic name
haftmann@41398
  2438
contents for other uses.  INCOMPATIBILITY.
haftmann@41398
  2439
haftmann@41398
  2440
* Renamed class eq and constant eq (for code generation) to class
haftmann@41398
  2441
equal and constant equal, plus renaming of related facts and various
haftmann@41398
  2442
tuning.  INCOMPATIBILITY.
haftmann@41398
  2443
haftmann@41398
  2444
* Dropped type classes mult_mono and mult_mono1.  INCOMPATIBILITY.
haftmann@41398
  2445
wenzelm@41571
  2446
* Removed output syntax "'a ~=> 'b" for "'a => 'b option".
wenzelm@41571
  2447
INCOMPATIBILITY.
haftmann@41398
  2448
haftmann@41398
  2449
* Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
haftmann@41398
  2450
avoid confusion with finite sets.  INCOMPATIBILITY.
haftmann@41398
  2451
haftmann@41398
  2452
* Abandoned locales equiv, congruent and congruent2 for equivalence
haftmann@41398
  2453
relations.  INCOMPATIBILITY: use equivI rather than equiv_intro (same
haftmann@41398
  2454
for congruent(2)).
haftmann@41398
  2455
haftmann@41398
  2456
* Some previously unqualified names have been qualified:
haftmann@41398
  2457
haftmann@41398
  2458
  types
haftmann@41398
  2459
    bool ~> HOL.bool
haftmann@41398
  2460
    nat ~> Nat.nat
haftmann@41398
  2461
haftmann@41398
  2462
  constants
haftmann@41398
  2463
    Trueprop ~> HOL.Trueprop
haftmann@41398
  2464
    True ~> HOL.True
haftmann@41398
  2465
    False ~> HOL.False
haftmann@41398
  2466
    op & ~> HOL.conj
haftmann@41398
  2467
    op | ~> HOL.disj
haftmann@41398
  2468
    op --> ~> HOL.implies
haftmann@41398
  2469
    op = ~> HOL.eq
haftmann@41398
  2470
    Not ~> HOL.Not
haftmann@41398
  2471
    The ~> HOL.The
haftmann@41398
  2472
    All ~> HOL.All
haftmann@41398
  2473
    Ex ~> HOL.Ex
haftmann@41398
  2474
    Ex1 ~> HOL.Ex1
haftmann@41398
  2475
    Let ~> HOL.Let
haftmann@41398
  2476
    If ~> HOL.If
haftmann@41398
  2477
    Ball ~> Set.Ball
haftmann@41398
  2478
    Bex ~> Set.Bex
haftmann@41398
  2479
    Suc ~> Nat.Suc
haftmann@41398
  2480
    Pair ~> Product_Type.Pair
haftmann@41398
  2481
    fst ~> Product_Type.fst
haftmann@41398
  2482
    snd ~> Product_Type.snd
haftmann@41398
  2483
    curry ~> Product_Type.curry
haftmann@41398
  2484
    op : ~> Set.member
haftmann@41398
  2485
    Collect ~> Set.Collect
haftmann@41398
  2486
haftmann@41398
  2487
INCOMPATIBILITY.
haftmann@41398
  2488
haftmann@41398
  2489
* More canonical naming convention for some fundamental definitions:
haftmann@41398
  2490
haftmann@41398
  2491
    bot_bool_eq ~> bot_bool_def
haftmann@41398
  2492
    top_bool_eq ~> top_bool_def
haftmann@41398
  2493
    inf_bool_eq ~> inf_bool_def
haftmann@41398
  2494
    sup_bool_eq ~> sup_bool_def
haftmann@41398
  2495
    bot_fun_eq  ~> bot_fun_def
haftmann@41398
  2496
    top_fun_eq  ~> top_fun_def
haftmann@41398
  2497
    inf_fun_eq  ~> inf_fun_def
haftmann@41398
  2498
    sup_fun_eq  ~> sup_fun_def
haftmann@41398
  2499
haftmann@41398
  2500
INCOMPATIBILITY.
haftmann@41398
  2501
haftmann@41398
  2502
* More stylized fact names:
haftmann@41398
  2503
haftmann@41398
  2504
  expand_fun_eq ~> fun_eq_iff
haftmann@41398
  2505
  expand_set_eq ~> set_eq_iff
haftmann@41398
  2506
  set_ext       ~> set_eqI
haftmann@41398
  2507
  nat_number    ~> eval_nat_numeral
haftmann@41398
  2508
haftmann@41398
  2509
INCOMPATIBILITY.
haftmann@41398
  2510
wenzelm@41571
  2511
* Refactoring of code-generation specific operations in theory List:
haftmann@41398
  2512
haftmann@41398
  2513
  constants
haftmann@41398
  2514
    null ~> List.null
haftmann@41398
  2515
haftmann@41398
  2516
  facts
haftmann@41398
  2517
    mem_iff ~> member_def
haftmann@41398
  2518
    null_empty ~> null_def
haftmann@41398
  2519
haftmann@41398
  2520
INCOMPATIBILITY.  Note that these were not supposed to be used
haftmann@41398
  2521
regularly unless for striking reasons; their main purpose was code
haftmann@41398
  2522
generation.
haftmann@41398
  2523
haftmann@41398
  2524
Various operations from the Haskell prelude are used for generating
haftmann@41398
  2525
Haskell code.
haftmann@41398
  2526
wenzelm@41571
  2527
* Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV".  Term
wenzelm@41571
  2528
"surj f" is now an abbreviation of "range f = UNIV".  The theorems
wenzelm@41571
  2529
bij_def and surj_def are unchanged.  INCOMPATIBILITY.
haftmann@41398
  2530
haftmann@41398
  2531
* Abolished some non-alphabetic type names: "prod" and "sum" replace
haftmann@41398
  2532
"*" and "+" respectively.  INCOMPATIBILITY.
haftmann@41398
  2533
haftmann@41398
  2534
* Name "Plus" of disjoint sum operator "<+>" is now hidden.  Write
wenzelm@41571
  2535
"Sum_Type.Plus" instead.
haftmann@41398
  2536
haftmann@41398
  2537
* Constant "split" has been merged with constant "prod_case"; names of
haftmann@41398
  2538
ML functions, facts etc. involving split have been retained so far,
haftmann@41398
  2539
though.  INCOMPATIBILITY.
haftmann@41398
  2540
haftmann@41398
  2541
* Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
haftmann@41398
  2542
instead.  INCOMPATIBILITY.
haftmann@41398
  2543
wenzelm@41571
  2544
* Removed lemma "Option.is_none_none" which duplicates "is_none_def".
haftmann@41398
  2545
INCOMPATIBILITY.
haftmann@41398
  2546
wenzelm@41594
  2547
* Former theory Library/Enum is now part of the HOL-Main image.
wenzelm@41594
  2548
INCOMPATIBILITY: all constants of the Enum theory now have to be
wenzelm@41594
  2549
referred to by its qualified name.
wenzelm@41594
  2550
wenzelm@41594
  2551
  enum    ~>  Enum.enum
wenzelm@41594
  2552
  nlists  ~>  Enum.nlists
wenzelm@41594
  2553
  product ~>  Enum.product
wenzelm@41594
  2554
wenzelm@41594
  2555
* Theory Library/Monad_Syntax provides do-syntax for monad types.
wenzelm@41594
  2556
Syntax in Library/State_Monad has been changed to avoid ambiguities.
wenzelm@41594
  2557
INCOMPATIBILITY.
wenzelm@41594
  2558
wenzelm@41594
  2559
* Theory Library/SetsAndFunctions has been split into
wenzelm@41594
  2560
Library/Function_Algebras and Library/Set_Algebras; canonical names
wenzelm@41594
  2561
for instance definitions for functions; various improvements.
wenzelm@41594
  2562
INCOMPATIBILITY.
wenzelm@41594
  2563
wenzelm@41594
  2564
* Theory Library/Multiset provides stable quicksort implementation of
wenzelm@41594
  2565
sort_key.
wenzelm@41594
  2566
wenzelm@41594
  2567
* Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
wenzelm@41594
  2568
INCOMPATIBILITY.
wenzelm@41594
  2569
wenzelm@41594
  2570
* Session Multivariate_Analysis: introduced a type class for euclidean
wenzelm@41594
  2571
space.  Most theorems are now stated in terms of euclidean spaces
wenzelm@41594
  2572
instead of finite cartesian products.
wenzelm@41594
  2573
wenzelm@41594
  2574
  types
wenzelm@41594
  2575
    real ^ 'n ~>  'a::real_vector
wenzelm@41594
  2576
              ~>  'a::euclidean_space
wenzelm@41594
  2577
              ~>  'a::ordered_euclidean_space
wenzelm@41594
  2578
        (depends on your needs)
wenzelm@41594
  2579
wenzelm@41594
  2580
  constants
wenzelm@41594
  2581
     _ $ _        ~> _ $$ _
wenzelm@41594
  2582
     \<chi> x. _  ~> \<chi>\<chi> x. _
wenzelm@41594
  2583
     CARD('n)     ~> DIM('a)
wenzelm@41594
  2584
wenzelm@41594
  2585
Also note that the indices are now natural numbers and not from some
wenzelm@41594
  2586
finite type. Finite cartesian products of euclidean spaces, products
wenzelm@41594
  2587
of euclidean spaces the real and complex numbers are instantiated to
wenzelm@41594
  2588
be euclidean_spaces.  INCOMPATIBILITY.
wenzelm@41594
  2589
wenzelm@41594
  2590
* Session Probability: introduced pextreal as positive extended real
wenzelm@41594
  2591
numbers.  Use pextreal as value for measures.  Introduce the
wenzelm@41594
  2592
Radon-Nikodym derivative, product spaces and Fubini's theorem for
wenzelm@41594
  2593
arbitrary sigma finite measures.  Introduces Lebesgue measure based on
wenzelm@41594
  2594
the integral in Multivariate Analysis.  INCOMPATIBILITY.
wenzelm@41594
  2595
wenzelm@41594
  2596
* Session Imperative_HOL: revamped, corrected dozens of inadequacies.
wenzelm@41594
  2597
INCOMPATIBILITY.
wenzelm@41594
  2598
wenzelm@41594
  2599
* Session SPARK (with image HOL-SPARK) provides commands to load and
wenzelm@41594
  2600
prove verification conditions generated by the SPARK Ada program
wenzelm@41594
  2601
verifier.  See also src/HOL/SPARK and src/HOL/SPARK/Examples.
berghofe@41567
  2602
huffman@40621
  2603
ballarin@41433
  2604
*** HOL-Algebra ***
ballarin@41433
  2605
ballarin@41433
  2606
* Theorems for additive ring operations (locale abelian_monoid and
ballarin@41433
  2607
descendants) are generated by interpretation from their multiplicative
ballarin@41434
  2608
counterparts.  Names (in particular theorem names) have the mandatory
ballarin@41434
  2609
qualifier 'add'.  Previous theorem names are redeclared for
ballarin@41434
  2610
compatibility.
ballarin@41434
  2611
wenzelm@41571
  2612
* Structure "int_ring" is now an abbreviation (previously a
ballarin@41434
  2613
definition).  This fits more natural with advanced interpretations.
ballarin@41433
  2614
ballarin@41433
  2615
huffman@40621
  2616
*** HOLCF ***
huffman@40621
  2617
huffman@40621
  2618
* The domain package now runs in definitional mode by default: The
wenzelm@41571
  2619
former command 'new_domain' is now called 'domain'.  To use the domain
huffman@40621
  2620
package in its original axiomatic mode, use 'domain (unsafe)'.
huffman@40621
  2621
INCOMPATIBILITY.
huffman@40621
  2622
wenzelm@41571
  2623
* The new class "domain" is now the default sort.  Class "predomain"
wenzelm@41571
  2624
is an unpointed version of "domain". Theories can be updated by
wenzelm@41571
  2625
replacing sort annotations as shown below.  INCOMPATIBILITY.
huffman@40621
  2626
huffman@40621
  2627
  'a::type ~> 'a::countable
huffman@40621
  2628
  'a::cpo  ~> 'a::predomain
huffman@40621
  2629
  'a::pcpo ~> 'a::domain
huffman@40621
  2630
wenzelm@41571
  2631
* The old type class "rep" has been superseded by class "domain".
huffman@40621
  2632
Accordingly, users of the definitional package must remove any
wenzelm@41571
  2633
"default_sort rep" declarations.  INCOMPATIBILITY.
huffman@40621
  2634
huffman@41401
  2635
* The domain package (definitional mode) now supports unpointed
huffman@41401
  2636
predomain argument types, as long as they are marked 'lazy'. (Strict
wenzelm@41571
  2637
arguments must be in class "domain".) For example, the following
huffman@41401
  2638
domain definition now works:
huffman@41401
  2639
huffman@41401
  2640
  domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
huffman@41401
  2641
huffman@41401
  2642
* Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
wenzelm@41571
  2643
instances for types from main HOL: bool, nat, int, char, 'a + 'b,
wenzelm@41571
  2644
'a option, and 'a list.  Additionally, it configures fixrec and the
wenzelm@41571
  2645
domain package to work with these types.  For example:
huffman@41401
  2646
huffman@41401
  2647
  fixrec isInl :: "('a + 'b) u -> tr"
huffman@41401
  2648
    where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
huffman@41401
  2649
huffman@41401
  2650
  domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
huffman@41401
  2651
wenzelm@41571
  2652
* The "(permissive)" option of fixrec has been replaced with a
wenzelm@41571
  2653
per-equation "(unchecked)" option. See
wenzelm@41571
  2654
src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
wenzelm@41571
  2655
wenzelm@41571
  2656
* The "bifinite" class no longer fixes a constant "approx"; the class
wenzelm@41571
  2657
now just asserts that such a function exists.  INCOMPATIBILITY.
wenzelm@41571
  2658
wenzelm@41571
  2659
* Former type "alg_defl" has been renamed to "defl".  HOLCF no longer
huffman@41287
  2660
defines an embedding of type 'a defl into udom by default; instances
wenzelm@41571
  2661
of "bifinite" and "domain" classes are available in
wenzelm@41571
  2662
src/HOL/HOLCF/Library/Defl_Bifinite.thy.
wenzelm@41571
  2663
wenzelm@41571
  2664
* The syntax "REP('a)" has been replaced with "DEFL('a)".
wenzelm@41571
  2665
wenzelm@41571
  2666
* The predicate "directed" has been removed.  INCOMPATIBILITY.
wenzelm@41571
  2667
wenzelm@41571
  2668
* The type class "finite_po" has been removed.  INCOMPATIBILITY.
wenzelm@41571
  2669
wenzelm@41571
  2670
* The function "cprod_map" has been renamed to "prod_map".
huffman@41401
  2671
INCOMPATIBILITY.
huffman@41401
  2672
huffman@41401
  2673
* The monadic bind operator on each powerdomain has new binder syntax
wenzelm@41571
  2674
similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
wenzelm@41571
  2675
"upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
huffman@41401
  2676
huffman@41401
  2677
* The infix syntax for binary union on each powerdomain has changed
wenzelm@41571
  2678
from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
wenzelm@41571
  2679
syntax.  INCOMPATIBILITY.
wenzelm@41571
  2680
wenzelm@41571
  2681
* The constant "UU" has been renamed to "bottom".  The syntax "UU" is
huffman@41429
  2682
still supported as an input translation.
huffman@41429
  2683
huffman@40621
  2684
* Renamed some theorems (the original names are also still available).
wenzelm@41571
  2685
huffman@40621
  2686
  expand_fun_below   ~> fun_below_iff
huffman@40621
  2687
  below_fun_ext      ~> fun_belowI
huffman@40621
  2688
  expand_cfun_eq     ~> cfun_eq_iff
huffman@40621
  2689
  ext_cfun           ~> cfun_eqI
huffman@40621
  2690
  expand_cfun_below  ~> cfun_below_iff