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