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