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