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