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