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