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