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