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