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