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