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