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