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