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