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