NEWS
author hoelzl
Tue Jul 29 17:13:25 2014 +0200 (2014-07-29)
changeset 57825 58f46c678352
parent 57822 9ea92df3631a
child 57826 a01caa7145d4
permissions -rw-r--r--
better ordering of positive_integral renaming to nn_integral in NEWS
     1 Isabelle NEWS -- history of user-relevant changes
     2 =================================================
     3 
     4 New in Isabelle2014 (August 2014)
     5 ---------------------------------
     6 
     7 *** General ***
     8 
     9 * Support for official Standard ML within the Isabelle context.
    10 Command 'SML_file' reads and evaluates the given Standard ML file.
    11 Toplevel bindings are stored within the theory context; the initial
    12 environment is restricted to the Standard ML implementation of
    13 Poly/ML, without the add-ons of Isabelle/ML.  Commands 'SML_import'
    14 and 'SML_export' allow to exchange toplevel bindings between the two
    15 separate environments.  See also ~~/src/Tools/SML/Examples.thy for
    16 some examples.
    17 
    18 * Standard tactics and proof methods such as "clarsimp", "auto" and
    19 "safe" now preserve equality hypotheses "x = expr" where x is a free
    20 variable.  Locale assumptions and chained facts containing "x"
    21 continue to be useful.  The new method "hypsubst_thin" and the
    22 configuration option "hypsubst_thin" (within the attribute name space)
    23 restore the previous behavior.  INCOMPATIBILITY, especially where
    24 induction is done after these methods or when the names of free and
    25 bound variables clash.  As first approximation, old proofs may be
    26 repaired by "using [[hypsubst_thin = true]]" in the critical spot.
    27 
    28 * More static checking of proof methods, which allows the system to
    29 form a closure over the concrete syntax.  Method arguments should be
    30 processed in the original proof context as far as possible, before
    31 operating on the goal state.  In any case, the standard discipline for
    32 subgoal-addressing needs to be observed: no subgoals or a subgoal
    33 number that is out of range produces an empty result sequence, not an
    34 exception.  Potential INCOMPATIBILITY for non-conformant tactical
    35 proof tools.
    36 
    37 * Lexical syntax (inner and outer) supports text cartouches with
    38 arbitrary nesting, and without escapes of quotes etc.  The Prover IDE
    39 supports input via ` (backquote).
    40 
    41 * The outer syntax categories "text" (for formal comments and document
    42 markup commands) and "altstring" (for literal fact references) allow
    43 cartouches as well, in addition to the traditional mix of quotations.
    44 
    45 * Syntax of document antiquotation @{rail} now uses \<newline> instead
    46 of "\\", to avoid the optical illusion of escaped backslash within
    47 string token.  General renovation of its syntax using text cartouches.
    48 Minor INCOMPATIBILITY.
    49 
    50 * Discontinued legacy_isub_isup, which was a temporary workaround for
    51 Isabelle/ML in Isabelle2013-1.  The prover process no longer accepts
    52 old identifier syntax with \<^isub> or \<^isup>.  Potential
    53 INCOMPATIBILITY.
    54 
    55 * Document antiquotation @{url} produces markup for the given URL,
    56 which results in an active hyperlink within the text.
    57 
    58 * Document antiquotation @{file_unchecked} is like @{file}, but does
    59 not check existence within the file-system.
    60 
    61 * Updated and extended manuals: codegen, datatypes, implementation,
    62 isar-ref, jedit, system.
    63 
    64 
    65 *** Prover IDE -- Isabelle/Scala/jEdit ***
    66 
    67 * Improved Document panel: simplified interaction where every single
    68 mouse click (re)opens document via desktop environment or as jEdit
    69 buffer.
    70 
    71 * Support for Navigator plugin (with toolbar buttons), with connection
    72 to PIDE hyperlinks.
    73 
    74 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
    75 Open text buffers take precedence over copies within the file-system.
    76 
    77 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
    78 auxiliary ML files.
    79 
    80 * Improved syntactic and semantic completion mechanism, with simple
    81 templates, completion language context, name-space completion,
    82 file-name completion, spell-checker completion.
    83 
    84 * Refined GUI popup for completion: more robust key/mouse event
    85 handling and propagation to enclosing text area -- avoid loosing
    86 keystrokes with slow / remote graphics displays.
    87 
    88 * Refined insertion of completion items wrt. jEdit text: multiple
    89 selections, rectangular selections, rectangular selection as "tall
    90 caret".
    91 
    92 * Integrated spell-checker for document text, comments etc. with
    93 completion popup and context-menu.
    94 
    95 * More general "Query" panel supersedes "Find" panel, with GUI access
    96 to commands 'find_theorems' and 'find_consts', as well as print
    97 operations for the context.  Minor incompatibility in keyboard
    98 shortcuts etc.: replace action isabelle-find by isabelle-query.
    99 
   100 * Search field for all output panels ("Output", "Query", "Info" etc.)
   101 to highlight text via regular expression.
   102 
   103 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
   104 General") allows to specify additional print modes for the prover
   105 process, without requiring old-fashioned command-line invocation of
   106 "isabelle jedit -m MODE".
   107 
   108 * More support for remote files (e.g. http) using standard Java
   109 networking operations instead of jEdit virtual file-systems.
   110 
   111 * Empty editors buffers that are no longer required (e.g.\ via theory
   112 imports) are automatically removed from the document model.
   113 
   114 * Improved Console/Scala plugin: more uniform scala.Console output,
   115 more robust treatment of threads and interrupts.
   116 
   117 * Improved management of dockable windows: clarified keyboard focus
   118 and window placement wrt. main editor view; optional menu item to
   119 "Detach" a copy where this makes sense.
   120 
   121 * New Simplifier Trace panel provides an interactive view of the
   122 simplification process, enabled by the "simp_trace_new" attribute
   123 within the context.
   124 
   125 
   126 *** Pure ***
   127 
   128 * Low-level type-class commands 'classes', 'classrel', 'arities' have
   129 been discontinued to avoid the danger of non-trivial axiomatization
   130 that is not immediately visible.  INCOMPATIBILITY, use regular
   131 'instance' command with proof.  The required OFCLASS(...) theorem
   132 might be postulated via 'axiomatization' beforehand, or the proof
   133 finished trivially if the underlying class definition is made vacuous
   134 (without any assumptions).  See also Isabelle/ML operations
   135 Axclass.class_axiomatization, Axclass.classrel_axiomatization,
   136 Axclass.arity_axiomatization.
   137 
   138 * Basic constants of Pure use more conventional names and are always
   139 qualified.  Rare INCOMPATIBILITY, but with potentially serious
   140 consequences, notably for tools in Isabelle/ML.  The following
   141 renaming needs to be applied:
   142 
   143   ==             ~>  Pure.eq
   144   ==>            ~>  Pure.imp
   145   all            ~>  Pure.all
   146   TYPE           ~>  Pure.type
   147   dummy_pattern  ~>  Pure.dummy_pattern
   148 
   149 Systematic porting works by using the following theory setup on a
   150 *previous* Isabelle version to introduce the new name accesses for the
   151 old constants:
   152 
   153 setup {*
   154   fn thy => thy
   155     |> Sign.root_path
   156     |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
   157     |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
   158     |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
   159     |> Sign.restore_naming thy
   160 *}
   161 
   162 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
   163 Later the application is moved to the current Isabelle version, and
   164 the auxiliary aliases are deleted.
   165 
   166 * Attributes "where" and "of" allow an optional context of local
   167 variables ('for' declaration): these variables become schematic in the
   168 instantiated theorem.
   169 
   170 * Obsolete attribute "standard" has been discontinued (legacy since
   171 Isabelle2012).  Potential INCOMPATIBILITY, use explicit 'for' context
   172 where instantiations with schematic variables are intended (for
   173 declaration commands like 'lemmas' or attributes like "of").  The
   174 following temporary definition may help to port old applications:
   175 
   176   attribute_setup standard =
   177     "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
   178 
   179 * More thorough check of proof context for goal statements and
   180 attributed fact expressions (concerning background theory, declared
   181 hyps).  Potential INCOMPATIBILITY, tools need to observe standard
   182 context discipline.  See also Assumption.add_assumes and the more
   183 primitive Thm.assume_hyps.
   184 
   185 * Inner syntax token language allows regular quoted strings "..."
   186 (only makes sense in practice, if outer syntax is delimited
   187 differently, e.g. via cartouches).
   188 
   189 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,
   190 but the latter is retained some time as Proof General legacy.
   191 
   192 * Code generator preprocessor: explicit control of simp tracing on a
   193 per-constant basis.  See attribute "code_preproc".
   194 
   195 
   196 *** HOL ***
   197 
   198 * Code generator: enforce case of identifiers only for strict target
   199 language requirements.  INCOMPATIBILITY.
   200 
   201 * Code generator: explicit proof contexts in many ML interfaces.
   202 INCOMPATIBILITY.
   203 
   204 * Code generator: minimize exported identifiers by default.  Minor
   205 INCOMPATIBILITY.
   206 
   207 * Code generation for SML and OCaml: dropped arcane "no_signatures"
   208 option.  Minor INCOMPATIBILITY.
   209 
   210 * "declare [[code abort: ...]]" replaces "code_abort ...".
   211 INCOMPATIBILITY.
   212 
   213 * "declare [[code drop: ...]]" drops all code equations associated
   214 with the given constants.
   215 
   216 * Code generations are provided for make, fields, extend and truncate
   217 operations on records.
   218 
   219 * Command and antiquotation "value" are now hardcoded against nbe and
   220 ML.  Minor INCOMPATIBILITY.
   221 
   222 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.
   223 
   224 * The symbol "\<newline>" may be used within char or string literals
   225 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
   226 
   227 * Qualified String.implode and String.explode.  INCOMPATIBILITY.
   228 
   229 * Simplifier: Enhanced solver of preconditions of rewrite rules can
   230 now deal with conjunctions.  For help with converting proofs, the old
   231 behaviour of the simplifier can be restored like this: declare/using
   232 [[simp_legacy_precond]].  This configuration option will disappear
   233 again in the future.  INCOMPATIBILITY.
   234 
   235 * Simproc "finite_Collect" is no longer enabled by default, due to
   236 spurious crashes and other surprises.  Potential INCOMPATIBILITY.
   237 
   238 * Moved new (co)datatype package and its dependencies from session
   239   "HOL-BNF" to "HOL".  The commands 'bnf', 'wrap_free_constructors',
   240   'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now
   241   part of theory "Main".
   242 
   243   Theory renamings:
   244     FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
   245     Library/Wfrec.thy ~> Wfrec.thy
   246     Library/Zorn.thy ~> Zorn.thy
   247     Cardinals/Order_Relation.thy ~> Order_Relation.thy
   248     Library/Order_Union.thy ~> Cardinals/Order_Union.thy
   249     Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
   250     Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
   251     Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
   252     Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
   253     Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
   254     BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
   255     BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
   256     BNF/BNF_Comp.thy ~> BNF_Comp.thy
   257     BNF/BNF_Def.thy ~> BNF_Def.thy
   258     BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
   259     BNF/BNF_GFP.thy ~> BNF_GFP.thy
   260     BNF/BNF_LFP.thy ~> BNF_LFP.thy
   261     BNF/BNF_Util.thy ~> BNF_Util.thy
   262     BNF/Coinduction.thy ~> Coinduction.thy
   263     BNF/More_BNFs.thy ~> Library/More_BNFs.thy
   264     BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
   265     BNF/Examples/* ~> BNF_Examples/*
   266 
   267   New theories:
   268     Wellorder_Extension.thy (split from Zorn.thy)
   269     Library/Cardinal_Notations.thy
   270     Library/BNF_Axomatization.thy
   271     BNF_Examples/Misc_Primcorec.thy
   272     BNF_Examples/Stream_Processor.thy
   273 
   274   Discontinued theories:
   275     BNF/BNF.thy
   276     BNF/Equiv_Relations_More.thy
   277 
   278 INCOMPATIBILITY.
   279 
   280 * New (co)datatype package:
   281   - Command 'primcorec' is fully implemented.
   282   - Command 'datatype_new' generates size functions ("size_xxx" and
   283     "size") as required by 'fun'.
   284   - BNFs are integrated with the Lifting tool and new-style
   285     (co)datatypes with Transfer.
   286   - Renamed commands:
   287       datatype_new_compat ~> datatype_compat
   288       primrec_new ~> primrec
   289       wrap_free_constructors ~> free_constructors
   290     INCOMPATIBILITY.
   291   - The generated constants "xxx_case" and "xxx_rec" have been renamed
   292     "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
   293     INCOMPATIBILITY.
   294   - The constant "xxx_(un)fold" and related theorems are no longer
   295     generated.  Use "xxx_(co)rec" or define "xxx_(un)fold" manually
   296     using "prim(co)rec".
   297     INCOMPATIBILITY.
   298   - No discriminators are generated for nullary constructors by
   299     default, eliminating the need for the odd "=:" syntax.
   300     INCOMPATIBILITY.
   301   - No discriminators or selectors are generated by default by
   302     "datatype_new", unless custom names are specified or the new
   303     "discs_sels" option is passed.
   304     INCOMPATIBILITY.
   305 
   306 * Old datatype package:
   307   - The generated theorems "xxx.cases" and "xxx.recs" have been
   308     renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->
   309     "sum.case").  INCOMPATIBILITY.
   310   - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have
   311     been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,
   312     "prod_case" ~> "case_prod").  INCOMPATIBILITY.
   313 
   314 * The types "'a list" and "'a option", their set and map functions,
   315   their relators, and their selectors are now produced using the new
   316   BNF-based datatype package.
   317 
   318   Renamed constants:
   319     Option.set ~> set_option
   320     Option.map ~> map_option
   321     option_rel ~> rel_option
   322 
   323   Renamed theorems:
   324     set_def ~> set_rec[abs_def]
   325     map_def ~> map_rec[abs_def]
   326     Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
   327     option.recs ~> option.rec
   328     list_all2_def ~> list_all2_iff
   329     set.simps ~> set_simps (or the slightly different "list.set")
   330     map.simps ~> list.map
   331     hd.simps ~> list.sel(1)
   332     tl.simps ~> list.sel(2-3)
   333     the.simps ~> option.sel
   334 
   335 INCOMPATIBILITY.
   336 
   337 * The following map functions and relators have been renamed:
   338     sum_map ~> map_sum
   339     map_pair ~> map_prod
   340     prod_rel ~> rel_prod
   341     sum_rel ~> rel_sum
   342     fun_rel ~> rel_fun
   343     set_rel ~> rel_set
   344     filter_rel ~> rel_filter
   345     fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")
   346     cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")
   347     vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")
   348 
   349 INCOMPATIBILITY.
   350 
   351 * New internal SAT solver "cdclite" that produces models and proof
   352 traces.  This solver replaces the internal SAT solvers "enumerate" and
   353 "dpll".  Applications that explicitly used one of these two SAT
   354 solvers should use "cdclite" instead. In addition, "cdclite" is now
   355 the default SAT solver for the "sat" and "satx" proof methods and
   356 corresponding tactics; the old default can be restored using "declare
   357 [[sat_solver = zchaff_with_proofs]]".  Minor INCOMPATIBILITY.
   358 
   359 * SMT module: A new version of the SMT module, temporarily called
   360 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,
   361 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also
   362 supported as oracles. Yices is no longer supported, because no version
   363 of the solver can handle both SMT-LIB 2 and quantifiers.
   364 
   365 * Activation of Z3 now works via "z3_non_commercial" system option
   366 (without requiring restart), instead of former settings variable
   367 "Z3_NON_COMMERCIAL".  The option can be edited in Isabelle/jEdit menu
   368 Plugin Options / Isabelle / General.
   369 
   370 * Sledgehammer:
   371   - Z3 can now produce Isar proofs.
   372   - MaSh overhaul:
   373     . New SML-based learning algorithms eliminate the dependency on
   374       Python and increase performance and reliability.
   375     . MaSh and MeSh are now used by default together with the
   376       traditional MePo (Meng-Paulson) relevance filter. To disable
   377       MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin
   378       Options / Isabelle / General to "none".
   379   - New option:
   380       smt_proofs
   381   - Renamed options:
   382       isar_compress ~> compress
   383       isar_try0 ~> try0
   384 
   385 INCOMPATIBILITY.
   386 
   387 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
   388 
   389 * Nitpick:
   390   - Fixed soundness bug whereby mutually recursive datatypes could
   391     take infinite values.
   392   - Fixed soundness bug with low-level number functions such as
   393     "Abs_Integ" and "Rep_Integ".
   394   - Removed "std" option.
   395   - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
   396     "hide_types".
   397 
   398 * Metis: Removed legacy proof method 'metisFT'. Use 'metis
   399 (full_types)' instead. INCOMPATIBILITY.
   400 
   401 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
   402 
   403 * Adjustion of INF and SUP operations:
   404   - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
   405   - Consolidated theorem names containing INFI and SUPR: have INF and
   406     SUP instead uniformly.
   407   - More aggressive normalization of expressions involving INF and Inf
   408     or SUP and Sup.
   409   - INF_image and SUP_image do not unfold composition.
   410   - Dropped facts INF_comp, SUP_comp.
   411   - Default congruence rules strong_INF_cong and strong_SUP_cong, with
   412     simplifier implication in premises.  Generalize and replace former
   413     INT_cong, SUP_cong
   414 
   415 INCOMPATIBILITY.
   416 
   417 * SUP and INF generalized to conditionally_complete_lattice.
   418 
   419 * Swapped orientation of facts image_comp and vimage_comp:
   420 
   421   image_compose ~> image_comp [symmetric]
   422   image_comp ~> image_comp [symmetric]
   423   vimage_compose ~> vimage_comp [symmetric]
   424   vimage_comp ~> vimage_comp [symmetric]
   425 
   426 INCOMPATIBILITY.
   427 
   428 * Theory reorganization: split of Big_Operators.thy into
   429 Groups_Big.thy and Lattices_Big.thy.
   430 
   431 * Consolidated some facts about big group operators:
   432 
   433     setsum_0' ~> setsum.neutral
   434     setsum_0 ~> setsum.neutral_const
   435     setsum_addf ~> setsum.distrib
   436     setsum_cartesian_product ~> setsum.cartesian_product
   437     setsum_cases ~> setsum.If_cases
   438     setsum_commute ~> setsum.commute
   439     setsum_cong ~> setsum.cong
   440     setsum_delta ~> setsum.delta
   441     setsum_delta' ~> setsum.delta'
   442     setsum_diff1' ~> setsum.remove
   443     setsum_empty ~> setsum.empty
   444     setsum_infinite ~> setsum.infinite
   445     setsum_insert ~> setsum.insert
   446     setsum_inter_restrict'' ~> setsum.inter_filter
   447     setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left
   448     setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right
   449     setsum_mono_zero_left ~> setsum.mono_neutral_left
   450     setsum_mono_zero_right ~> setsum.mono_neutral_right
   451     setsum_reindex ~> setsum.reindex
   452     setsum_reindex_cong ~> setsum.reindex_cong
   453     setsum_reindex_nonzero ~> setsum.reindex_nontrivial
   454     setsum_restrict_set ~> setsum.inter_restrict
   455     setsum_Plus ~> setsum.Plus
   456     setsum_setsum_restrict ~> setsum.commute_restrict
   457     setsum_Sigma ~> setsum.Sigma
   458     setsum_subset_diff ~> setsum.subset_diff
   459     setsum_Un_disjoint ~> setsum.union_disjoint
   460     setsum_UN_disjoint ~> setsum.UNION_disjoint
   461     setsum_Un_Int ~> setsum.union_inter
   462     setsum_Union_disjoint ~> setsum.Union_disjoint
   463     setsum_UNION_zero ~> setsum.Union_comp
   464     setsum_Un_zero ~> setsum.union_inter_neutral
   465     strong_setprod_cong ~> setprod.strong_cong
   466     strong_setsum_cong ~> setsum.strong_cong
   467     setprod_1' ~> setprod.neutral
   468     setprod_1 ~> setprod.neutral_const
   469     setprod_cartesian_product ~> setprod.cartesian_product
   470     setprod_cong ~> setprod.cong
   471     setprod_delta ~> setprod.delta
   472     setprod_delta' ~> setprod.delta'
   473     setprod_empty ~> setprod.empty
   474     setprod_infinite ~> setprod.infinite
   475     setprod_insert ~> setprod.insert
   476     setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left
   477     setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right
   478     setprod_mono_one_left ~> setprod.mono_neutral_left
   479     setprod_mono_one_right ~> setprod.mono_neutral_right
   480     setprod_reindex ~> setprod.reindex
   481     setprod_reindex_cong ~> setprod.reindex_cong
   482     setprod_reindex_nonzero ~> setprod.reindex_nontrivial
   483     setprod_Sigma ~> setprod.Sigma
   484     setprod_subset_diff ~> setprod.subset_diff
   485     setprod_timesf ~> setprod.distrib
   486     setprod_Un2 ~> setprod.union_diff2
   487     setprod_Un_disjoint ~> setprod.union_disjoint
   488     setprod_UN_disjoint ~> setprod.UNION_disjoint
   489     setprod_Un_Int ~> setprod.union_inter
   490     setprod_Union_disjoint ~> setprod.Union_disjoint
   491     setprod_Un_one ~> setprod.union_inter_neutral
   492 
   493   Dropped setsum_cong2 (simple variant of setsum.cong).
   494   Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)
   495   Dropped setsum_reindex_id, setprod_reindex_id
   496     (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).
   497 
   498 INCOMPATIBILITY.
   499 
   500 * Abolished slightly odd global lattice interpretation for min/max.
   501 
   502   Fact consolidations:
   503     min_max.inf_assoc ~> min.assoc
   504     min_max.inf_commute ~> min.commute
   505     min_max.inf_left_commute ~> min.left_commute
   506     min_max.inf_idem ~> min.idem
   507     min_max.inf_left_idem ~> min.left_idem
   508     min_max.inf_right_idem ~> min.right_idem
   509     min_max.sup_assoc ~> max.assoc
   510     min_max.sup_commute ~> max.commute
   511     min_max.sup_left_commute ~> max.left_commute
   512     min_max.sup_idem ~> max.idem
   513     min_max.sup_left_idem ~> max.left_idem
   514     min_max.sup_inf_distrib1 ~> max_min_distrib2
   515     min_max.sup_inf_distrib2 ~> max_min_distrib1
   516     min_max.inf_sup_distrib1 ~> min_max_distrib2
   517     min_max.inf_sup_distrib2 ~> min_max_distrib1
   518     min_max.distrib ~> min_max_distribs
   519     min_max.inf_absorb1 ~> min.absorb1
   520     min_max.inf_absorb2 ~> min.absorb2
   521     min_max.sup_absorb1 ~> max.absorb1
   522     min_max.sup_absorb2 ~> max.absorb2
   523     min_max.le_iff_inf ~> min.absorb_iff1
   524     min_max.le_iff_sup ~> max.absorb_iff2
   525     min_max.inf_le1 ~> min.cobounded1
   526     min_max.inf_le2 ~> min.cobounded2
   527     le_maxI1, min_max.sup_ge1 ~> max.cobounded1
   528     le_maxI2, min_max.sup_ge2 ~> max.cobounded2
   529     min_max.le_infI1 ~> min.coboundedI1
   530     min_max.le_infI2 ~> min.coboundedI2
   531     min_max.le_supI1 ~> max.coboundedI1
   532     min_max.le_supI2 ~> max.coboundedI2
   533     min_max.less_infI1 ~> min.strict_coboundedI1
   534     min_max.less_infI2 ~> min.strict_coboundedI2
   535     min_max.less_supI1 ~> max.strict_coboundedI1
   536     min_max.less_supI2 ~> max.strict_coboundedI2
   537     min_max.inf_mono ~> min.mono
   538     min_max.sup_mono ~> max.mono
   539     min_max.le_infI, min_max.inf_greatest ~> min.boundedI
   540     min_max.le_supI, min_max.sup_least ~> max.boundedI
   541     min_max.le_inf_iff ~> min.bounded_iff
   542     min_max.le_sup_iff ~> max.bounded_iff
   543 
   544 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
   545 min.left_commute, min.left_idem, max.commute, max.assoc,
   546 max.left_commute, max.left_idem directly.
   547 
   548 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,
   549 min.cobounded2, max.cobounded1m max.cobounded2 directly.
   550 
   551 For min_ac or max_ac, prefer more general collection ac_simps.
   552 
   553 INCOMPATBILITY.
   554 
   555 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>
   556 Inf_fin_le_Sup_fin.  INCOMPATIBILITY.
   557 
   558 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
   559 INCOMPATIBILITY.
   560 
   561 * Fact generalization and consolidation:
   562     neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
   563 
   564 INCOMPATIBILITY.
   565 
   566 * Purely algebraic definition of even.  Fact generalization and
   567   consolidation:
   568     nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
   569     even_zero_(nat|int) ~> even_zero
   570 
   571 INCOMPATIBILITY.
   572 
   573 * Abolished neg_numeral.
   574   - Canonical representation for minus one is "- 1".
   575   - Canonical representation for other negative numbers is "- (numeral _)".
   576   - When devising rule sets for number calculation, consider the
   577     following canonical cases: 0, 1, numeral _, - 1, - numeral _.
   578   - HOLogic.dest_number also recognizes numerals in non-canonical forms
   579     like "numeral One", "- numeral One", "- 0" and even "- ... - _".
   580   - Syntax for negative numerals is mere input syntax.
   581 
   582 INCOMPATIBILITY.
   583 
   584 * Reduced name variants for rules on associativity and commutativity:
   585 
   586     add_assoc ~> add.assoc
   587     add_commute ~> add.commute
   588     add_left_commute ~> add.left_commute
   589     mult_assoc ~> mult.assoc
   590     mult_commute ~> mult.commute
   591     mult_left_commute ~> mult.left_commute
   592     nat_add_assoc ~> add.assoc
   593     nat_add_commute ~> add.commute
   594     nat_add_left_commute ~> add.left_commute
   595     nat_mult_assoc ~> mult.assoc
   596     nat_mult_commute ~> mult.commute
   597     eq_assoc ~> iff_assoc
   598     eq_left_commute ~> iff_left_commute
   599 
   600 INCOMPATIBILITY.
   601 
   602 * Fact collections add_ac and mult_ac are considered old-fashioned.
   603 Prefer ac_simps instead, or specify rules
   604 (add|mult).(assoc|commute|left_commute) individually.
   605 
   606 * Elimination of fact duplicates:
   607     equals_zero_I ~> minus_unique
   608     diff_eq_0_iff_eq ~> right_minus_eq
   609     nat_infinite ~> infinite_UNIV_nat
   610     int_infinite ~> infinite_UNIV_int
   611 
   612 INCOMPATIBILITY.
   613 
   614 * Fact name consolidation:
   615     diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
   616     minus_le_self_iff ~> neg_less_eq_nonneg
   617     le_minus_self_iff ~> less_eq_neg_nonpos
   618     neg_less_nonneg ~> neg_less_pos
   619     less_minus_self_iff ~> less_neg_neg [simp]
   620 
   621 INCOMPATIBILITY.
   622 
   623 * More simplification rules on unary and binary minus:
   624 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
   625 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
   626 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
   627 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
   628 minus_add_cancel, uminus_add_conv_diff.  These correspondingly have
   629 been taken away from fact collections algebra_simps and field_simps.
   630 INCOMPATIBILITY.
   631 
   632 To restore proofs, the following patterns are helpful:
   633 
   634 a) Arbitrary failing proof not involving "diff_def":
   635 Consider simplification with algebra_simps or field_simps.
   636 
   637 b) Lifting rules from addition to subtraction:
   638 Try with "using <rule for addition> of [... "- _" ...]" by simp".
   639 
   640 c) Simplification with "diff_def": just drop "diff_def".
   641 Consider simplification with algebra_simps or field_simps;
   642 or the brute way with
   643 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
   644 
   645 * Introduce bdd_above and bdd_below in theory
   646 Conditionally_Complete_Lattices, use them instead of explicitly
   647 stating boundedness of sets.
   648 
   649 * ccpo.admissible quantifies only over non-empty chains to allow more
   650 syntax-directed proof rules; the case of the empty chain shows up as
   651 additional case in fixpoint induction proofs.  INCOMPATIBILITY.
   652 
   653 * Removed and renamed theorems in Series:
   654   summable_le         ~>  suminf_le
   655   suminf_le           ~>  suminf_le_const
   656   series_pos_le       ~>  setsum_le_suminf
   657   series_pos_less     ~>  setsum_less_suminf
   658   suminf_ge_zero      ~>  suminf_nonneg
   659   suminf_gt_zero      ~>  suminf_pos
   660   suminf_gt_zero_iff  ~>  suminf_pos_iff
   661   summable_sumr_LIMSEQ_suminf  ~>  summable_LIMSEQ
   662   suminf_0_le         ~>  suminf_nonneg [rotate]
   663   pos_summable        ~>  summableI_nonneg_bounded
   664   ratio_test          ~>  summable_ratio_test
   665 
   666   removed series_zero, replaced by sums_finite
   667 
   668   removed auxiliary lemmas:
   669 
   670     sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
   671     half, le_Suc_ex_iff, lemma_realpow_diff_sumr,
   672     real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,
   673     sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,
   674     summable_convergent_sumr_iff, sumr_diff_mult_const
   675 
   676 INCOMPATIBILITY.
   677 
   678 * Replace (F)DERIV syntax by has_derivative:
   679   - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
   680 
   681   - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
   682 
   683   - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
   684 
   685   - removed constant isDiff
   686 
   687   - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as
   688     input syntax.
   689 
   690   - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.
   691 
   692   - Renamed FDERIV_... lemmas to has_derivative_...
   693 
   694   - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
   695 
   696   - removed DERIV_intros, has_derivative_eq_intros
   697 
   698   - introduced derivative_intros and deriative_eq_intros which
   699     includes now rules for DERIV, has_derivative and
   700     has_vector_derivative.
   701 
   702   - Other renamings:
   703     differentiable_def        ~>  real_differentiable_def
   704     differentiableE           ~>  real_differentiableE
   705     fderiv_def                ~>  has_derivative_at
   706     field_fderiv_def          ~>  field_has_derivative_at
   707     isDiff_der                ~>  differentiable_def
   708     deriv_fderiv              ~>  has_field_derivative_def
   709     deriv_def                 ~>  DERIV_def
   710 
   711 INCOMPATIBILITY.
   712 
   713 * Include more theorems in continuous_intros. Remove the
   714 continuous_on_intros, isCont_intros collections, these facts are now
   715 in continuous_intros.
   716 
   717 * Theorems about complex numbers are now stated only using Re and Im,
   718 the Complex constructor is not used anymore. It is possible to use
   719 primcorec to defined the behaviour of a complex-valued function.
   720 
   721 Removed theorems about the Complex constructor from the simpset, they
   722 are available as the lemma collection legacy_Complex_simps. This
   723 especially removes
   724 
   725     i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
   726 
   727 Instead the reverse direction is supported with
   728     Complex_eq: "Complex a b = a + \<i> * b"
   729 
   730 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
   731 
   732   Renamings:
   733     Re/Im                  ~>  complex.sel
   734     complex_Re/Im_zero     ~>  zero_complex.sel
   735     complex_Re/Im_add      ~>  plus_complex.sel
   736     complex_Re/Im_minus    ~>  uminus_complex.sel
   737     complex_Re/Im_diff     ~>  minus_complex.sel
   738     complex_Re/Im_one      ~>  one_complex.sel
   739     complex_Re/Im_mult     ~>  times_complex.sel
   740     complex_Re/Im_inverse  ~>  inverse_complex.sel
   741     complex_Re/Im_scaleR   ~>  scaleR_complex.sel
   742     complex_Re/Im_i        ~>  ii.sel
   743     complex_Re/Im_cnj      ~>  cnj.sel
   744     Re/Im_cis              ~>  cis.sel
   745 
   746     complex_divide_def   ~>  divide_complex_def
   747     complex_norm_def     ~>  norm_complex_def
   748     cmod_def             ~>  norm_complex_de
   749 
   750   Removed theorems:
   751     complex_zero_def
   752     complex_add_def
   753     complex_minus_def
   754     complex_diff_def
   755     complex_one_def
   756     complex_mult_def
   757     complex_inverse_def
   758     complex_scaleR_def
   759 
   760 INCOMPATIBILITY.
   761 
   762 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
   763 Conditionally_Complete_Lattices.  INCOMPATIBILITY.
   764 
   765 * HOL-Library: new theory src/HOL/Library/Tree.thy.
   766 
   767 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it
   768 is subsumed by session Kleene_Algebra in AFP.
   769 
   770 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
   771 
   772 * HOL-Word: bit representations prefer type bool over type bit.
   773 INCOMPATIBILITY.
   774 
   775 * HOL-Word:
   776   - Abandoned fact collection "word_arith_alts", which is a duplicate
   777     of "word_arith_wis".
   778   - Dropped first (duplicated) element in fact collections
   779     "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
   780     "uint_word_arith_bintrs".
   781 
   782 * HOL-Number_Theory:
   783   - consolidated the proofs of the binomial theorem
   784   - the function fib is again of type nat => nat and not overloaded
   785   - no more references to Old_Number_Theory in the HOL libraries
   786     (except the AFP)
   787 
   788 INCOMPATIBILITY.
   789 
   790 * HOL-Multivariate_Analysis:
   791   - Type class ordered_real_vector for ordered vector spaces.
   792   - New theory Complex_Basic_Analysis defining complex derivatives,
   793     holomorphic functions, etc., ported from HOL Light's canal.ml.
   794   - Changed order of ordered_euclidean_space to be compatible with
   795     pointwise ordering on products. Therefore instance of
   796     conditionally_complete_lattice and ordered_real_vector.
   797     INCOMPATIBILITY: use box instead of greaterThanLessThan or
   798     explicit set-comprehensions with eucl_less for other (half-)open
   799     intervals.
   800   - removed dependencies on type class ordered_euclidean_space with
   801     introduction of "cbox" on euclidean_space
   802     - renamed theorems:
   803         interval ~> box
   804         mem_interval ~> mem_box
   805         interval_eq_empty ~> box_eq_empty
   806         interval_ne_empty ~> box_ne_empty
   807         interval_sing(1) ~> cbox_sing
   808         interval_sing(2) ~> box_sing
   809         subset_interval_imp ~> subset_box_imp
   810         subset_interval ~> subset_box
   811         open_interval ~> open_box
   812         closed_interval ~> closed_cbox
   813         interior_closed_interval ~> interior_cbox
   814         bounded_closed_interval ~> bounded_cbox
   815         compact_interval ~> compact_cbox
   816         bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric
   817         bounded_subset_closed_interval ~> bounded_subset_cbox
   818         mem_interval_componentwiseI ~> mem_box_componentwiseI
   819         convex_box ~> convex_prod
   820         rel_interior_real_interval ~> rel_interior_real_box
   821         convex_interval ~> convex_box
   822         convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox
   823         frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox
   824         content_closed_interval' ~> content_cbox'
   825         elementary_subset_interval ~> elementary_subset_box
   826         diameter_closed_interval ~> diameter_cbox
   827         frontier_closed_interval ~> frontier_cbox
   828         frontier_open_interval ~> frontier_box
   829         bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric
   830         closure_open_interval ~> closure_box
   831         open_closed_interval_convex ~> open_cbox_convex
   832         open_interval_midpoint ~> box_midpoint
   833         content_image_affinity_interval ~> content_image_affinity_cbox
   834         is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval
   835         bounded_interval ~> bounded_closed_interval + bounded_boxes
   836 
   837     - respective theorems for intervals over the reals:
   838         content_closed_interval + content_cbox
   839         has_integral + has_integral_real
   840         fine_division_exists + fine_division_exists_real
   841         has_integral_null + has_integral_null_real
   842         tagged_division_union_interval + tagged_division_union_interval_real
   843         has_integral_const + has_integral_const_real
   844         integral_const + integral_const_real
   845         has_integral_bound + has_integral_bound_real
   846         integrable_continuous + integrable_continuous_real
   847         integrable_subinterval + integrable_subinterval_real
   848         has_integral_reflect_lemma + has_integral_reflect_lemma_real
   849         integrable_reflect + integrable_reflect_real
   850         integral_reflect + integral_reflect_real
   851         image_affinity_interval + image_affinity_cbox
   852         image_smult_interval + image_smult_cbox
   853         integrable_const + integrable_const_ivl
   854         integrable_on_subinterval + integrable_on_subcbox
   855 
   856   - renamed theorems:
   857     derivative_linear         ~>  has_derivative_bounded_linear
   858     derivative_is_linear      ~>  has_derivative_linear
   859     bounded_linear_imp_linear ~>  bounded_linear.linear
   860 
   861 * HOL-Probability:
   862   - Renamed positive_integral to nn_integral:
   863 
   864     . Renamed all lemmas "*positive_integral*" to *nn_integral*"
   865       positive_integral_positive ~> nn_integral_nonneg
   866 
   867     . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
   868 
   869   - replaced the Lebesgue integral on real numbers by the more general
   870     Bochner integral for functions into a real-normed vector space.
   871 
   872     integral_zero               ~>  integral_zero / integrable_zero
   873     integral_minus              ~>  integral_minus / integrable_minus
   874     integral_add                ~>  integral_add / integrable_add
   875     integral_diff               ~>  integral_diff / integrable_diff
   876     integral_setsum             ~>  integral_setsum / integrable_setsum
   877     integral_multc              ~>  integral_mult_left / integrable_mult_left
   878     integral_cmult              ~>  integral_mult_right / integrable_mult_right
   879     integral_triangle_inequality~>  integral_norm_bound
   880     integrable_nonneg           ~>  integrableI_nonneg
   881     integral_positive           ~>  integral_nonneg_AE
   882     integrable_abs_iff          ~>  integrable_abs_cancel
   883     positive_integral_lim_INF   ~>  nn_integral_liminf
   884     lebesgue_real_affine        ~>  lborel_real_affine
   885     borel_integral_has_integral ~>  has_integral_lebesgue_integral
   886     integral_indicator          ~>
   887          integral_real_indicator / integrable_real_indicator
   888     positive_integral_fst       ~>  nn_integral_fst'
   889     positive_integral_fst_measurable ~> nn_integral_fst
   890     positive_integral_snd_measurable ~> nn_integral_snd
   891 
   892     integrable_fst_measurable   ~>
   893          integral_fst / integrable_fst / AE_integrable_fst
   894 
   895     integrable_snd_measurable   ~>
   896          integral_snd / integrable_snd / AE_integrable_snd
   897 
   898     integral_monotone_convergence  ~>
   899          integral_monotone_convergence / integrable_monotone_convergence
   900 
   901     integral_monotone_convergence_at_top  ~>
   902          integral_monotone_convergence_at_top /
   903          integrable_monotone_convergence_at_top
   904 
   905     has_integral_iff_positive_integral_lebesgue  ~>
   906          has_integral_iff_has_bochner_integral_lebesgue_nonneg
   907 
   908     lebesgue_integral_has_integral  ~>
   909          has_integral_integrable_lebesgue_nonneg
   910 
   911     positive_integral_lebesgue_has_integral  ~>
   912          integral_has_integral_lebesgue_nonneg /
   913          integrable_has_integral_lebesgue_nonneg
   914 
   915     lebesgue_integral_real_affine  ~>
   916          nn_integral_real_affine
   917 
   918     has_integral_iff_positive_integral_lborel  ~>
   919          integral_has_integral_nonneg / integrable_has_integral_nonneg
   920 
   921     The following theorems where removed:
   922 
   923     lebesgue_integral_nonneg
   924     lebesgue_integral_uminus
   925     lebesgue_integral_cmult
   926     lebesgue_integral_multc
   927     lebesgue_integral_cmult_nonneg
   928     integral_cmul_indicator
   929     integral_real
   930 
   931   - Formalized properties about exponentially, Erlang, and normal
   932     distributed random variables.
   933 
   934 * HOL-Decision_Procs: Separate command 'approximate' for approximative
   935 computation in src/HOL/Decision_Procs/Approximation.  Minor
   936 INCOMPATIBILITY.
   937 
   938 
   939 *** Scala ***
   940 
   941 * The signature and semantics of Document.Snapshot.cumulate_markup /
   942 select_markup have been clarified.  Markup is now traversed in the
   943 order of reports given by the prover: later markup is usually more
   944 specific and may override results accumulated so far.  The elements
   945 guard is mandatory and checked precisely.  Subtle INCOMPATIBILITY.
   946 
   947 * Substantial reworking of internal PIDE protocol communication
   948 channels.  INCOMPATIBILITY.
   949 
   950 
   951 *** ML ***
   952 
   953 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
   954 compared (according to Thm.thm_ord), but assumed to be covered by the
   955 current background theory.  Thus equivalent data produced in different
   956 branches of the theory graph usually coincides (e.g. relevant for
   957 theory merge).  Note that the softer Thm.eq_thm_prop is often more
   958 appropriate than Thm.eq_thm.
   959 
   960 * Proper context for basic Simplifier operations: rewrite_rule,
   961 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
   962 pass runtime Proof.context (and ensure that the simplified entity
   963 actually belongs to it).
   964 
   965 * Proper context discipline for read_instantiate and instantiate_tac:
   966 variables that are meant to become schematic need to be given as
   967 fixed, and are generalized by the explicit context of local variables.
   968 This corresponds to Isar attributes "where" and "of" with 'for'
   969 declaration.  INCOMPATIBILITY, also due to potential change of indices
   970 of schematic variables.
   971 
   972 * Moved ML_Compiler.exn_trace and other operations on exceptions to
   973 structure Runtime.  Minor INCOMPATIBILITY.
   974 
   975 * Discontinued old Toplevel.debug in favour of system option
   976 "ML_exception_trace", which may be also declared within the context
   977 via "declare [[ML_exception_trace = true]]".  Minor INCOMPATIBILITY.
   978 
   979 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
   980 INCOMPATIBILITY.
   981 
   982 * Configuration option "ML_print_depth" controls the pretty-printing
   983 depth of the ML compiler within the context.  The old print_depth in
   984 ML is still available as default_print_depth, but rarely used.  Minor
   985 INCOMPATIBILITY.
   986 
   987 * Toplevel function "use" refers to raw ML bootstrap environment,
   988 without Isar context nor antiquotations.  Potential INCOMPATIBILITY.
   989 Note that 'ML_file' is the canonical command to load ML files into the
   990 formal context.
   991 
   992 * Simplified programming interface to define ML antiquotations, see
   993 structure ML_Antiquotation.  Minor INCOMPATIBILITY.
   994 
   995 * ML antiquotation @{here} refers to its source position, which is
   996 occasionally useful for experimentation and diagnostic purposes.
   997 
   998 * ML antiquotation @{path} produces a Path.T value, similarly to
   999 Path.explode, but with compile-time check against the file-system and
  1000 some PIDE markup.  Note that unlike theory source, ML does not have a
  1001 well-defined master directory, so an absolute symbolic path
  1002 specification is usually required, e.g. "~~/src/HOL".
  1003 
  1004 * ML antiquotation @{print} inlines a function to print an arbitrary
  1005 ML value, which is occasionally useful for diagnostic or demonstration
  1006 purposes.
  1007 
  1008 
  1009 *** System ***
  1010 
  1011 * Proof General with its traditional helper scripts is now an optional
  1012 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle
  1013 component repository http://isabelle.in.tum.de/components/.  Note that
  1014 the "system" manual provides general explanations about add-on
  1015 components, especially those that are not bundled with the release.
  1016 
  1017 * The raw Isabelle process executable has been renamed from
  1018 "isabelle-process" to "isabelle_process", which conforms to common
  1019 shell naming conventions, and allows to define a shell function within
  1020 the Isabelle environment to avoid dynamic path lookup.  Rare
  1021 incompatibility for old tools that do not use the ISABELLE_PROCESS
  1022 settings variable.
  1023 
  1024 * Former "isabelle tty" has been superseded by "isabelle console",
  1025 with implicit build like "isabelle jedit", and without the mostly
  1026 obsolete Isar TTY loop.
  1027 
  1028 * Simplified "isabelle display" tool.  Settings variables DVI_VIEWER
  1029 and PDF_VIEWER now refer to the actual programs, not shell
  1030 command-lines.  Discontinued option -c: invocation may be asynchronous
  1031 via desktop environment, without any special precautions.  Potential
  1032 INCOMPATIBILITY with ambitious private settings.
  1033 
  1034 * Removed obsolete "isabelle unsymbolize".  Note that the usual format
  1035 for email communication is the Unicode rendering of Isabelle symbols,
  1036 as produced by Isabelle/jEdit, for example.
  1037 
  1038 * Removed obsolete tool "wwwfind". Similar functionality may be
  1039 integrated into Isabelle/jEdit eventually.
  1040 
  1041 * Improved 'display_drafts' concerning desktop integration and
  1042 repeated invocation in PIDE front-end: re-use single file
  1043 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
  1044 
  1045 * Session ROOT specifications require explicit 'document_files' for
  1046 robust dependencies on LaTeX sources.  Only these explicitly given
  1047 files are copied to the document output directory, before document
  1048 processing is started.
  1049 
  1050 * Windows: support for regular TeX installation (e.g. MiKTeX) instead
  1051 of TeX Live from Cygwin.
  1052 
  1053 
  1054 
  1055 New in Isabelle2013-2 (December 2013)
  1056 -------------------------------------
  1057 
  1058 *** Prover IDE -- Isabelle/Scala/jEdit ***
  1059 
  1060 * More robust editing of running commands with internal forks,
  1061 e.g. non-terminating 'by' steps.
  1062 
  1063 * More relaxed Sledgehammer panel: avoid repeated application of query
  1064 after edits surrounding the command location.
  1065 
  1066 * More status information about commands that are interrupted
  1067 accidentally (via physical event or Poly/ML runtime system signal,
  1068 e.g. out-of-memory).
  1069 
  1070 
  1071 *** System ***
  1072 
  1073 * More robust termination of external processes managed by
  1074 Isabelle/ML: support cancellation of tasks within the range of
  1075 milliseconds, as required for PIDE document editing with automatically
  1076 tried tools (e.g. Sledgehammer).
  1077 
  1078 * Reactivated Isabelle/Scala kill command for external processes on
  1079 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
  1080 workaround for some Debian/Ubuntu Linux versions from 2013.
  1081 
  1082 
  1083 
  1084 New in Isabelle2013-1 (November 2013)
  1085 -------------------------------------
  1086 
  1087 *** General ***
  1088 
  1089 * Discontinued obsolete 'uses' within theory header.  Note that
  1090 commands like 'ML_file' work without separate declaration of file
  1091 dependencies.  Minor INCOMPATIBILITY.
  1092 
  1093 * Discontinued redundant 'use' command, which was superseded by
  1094 'ML_file' in Isabelle2013.  Minor INCOMPATIBILITY.
  1095 
  1096 * Simplified subscripts within identifiers, using plain \<^sub>
  1097 instead of the second copy \<^isub> and \<^isup>.  Superscripts are
  1098 only for literal tokens within notation; explicit mixfix annotations
  1099 for consts or fixed variables may be used as fall-back for unusual
  1100 names.  Obsolete \<twosuperior> has been expanded to \<^sup>2 in
  1101 Isabelle/HOL.  INCOMPATIBILITY, use "isabelle update_sub_sup" to
  1102 standardize symbols as a starting point for further manual cleanup.
  1103 The ML reference variable "legacy_isub_isup" may be set as temporary
  1104 workaround, to make the prover accept a subset of the old identifier
  1105 syntax.
  1106 
  1107 * Document antiquotations: term style "isub" has been renamed to
  1108 "sub".  Minor INCOMPATIBILITY.
  1109 
  1110 * Uniform management of "quick_and_dirty" as system option (see also
  1111 "isabelle options"), configuration option within the context (see also
  1112 Config.get in Isabelle/ML), and attribute in Isabelle/Isar.  Minor
  1113 INCOMPATIBILITY, need to use more official Isabelle means to access
  1114 quick_and_dirty, instead of historical poking into mutable reference.
  1115 
  1116 * Renamed command 'print_configs' to 'print_options'.  Minor
  1117 INCOMPATIBILITY.
  1118 
  1119 * Proper diagnostic command 'print_state'.  Old 'pr' (with its
  1120 implicit change of some global references) is retained for now as
  1121 control command, e.g. for ProofGeneral 3.7.x.
  1122 
  1123 * Discontinued 'print_drafts' command with its old-fashioned PS output
  1124 and Unix command-line print spooling.  Minor INCOMPATIBILITY: use
  1125 'display_drafts' instead and print via the regular document viewer.
  1126 
  1127 * Updated and extended "isar-ref" and "implementation" manual,
  1128 eliminated old "ref" manual.
  1129 
  1130 
  1131 *** Prover IDE -- Isabelle/Scala/jEdit ***
  1132 
  1133 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
  1134 Documentation panel.
  1135 
  1136 * Dockable window "Documentation" provides access to Isabelle
  1137 documentation.
  1138 
  1139 * Dockable window "Find" provides query operations for formal entities
  1140 (GUI front-end to 'find_theorems' command).
  1141 
  1142 * Dockable window "Sledgehammer" manages asynchronous / parallel
  1143 sledgehammer runs over existing document sources, independently of
  1144 normal editing and checking process.
  1145 
  1146 * Dockable window "Timing" provides an overview of relevant command
  1147 timing information, depending on option jedit_timing_threshold.  The
  1148 same timing information is shown in the extended tooltip of the
  1149 command keyword, when hovering the mouse over it while the CONTROL or
  1150 COMMAND modifier is pressed.
  1151 
  1152 * Improved dockable window "Theories": Continuous checking of proof
  1153 document (visible and required parts) may be controlled explicitly,
  1154 using check box or shortcut "C+e ENTER".  Individual theory nodes may
  1155 be marked explicitly as required and checked in full, using check box
  1156 or shortcut "C+e SPACE".
  1157 
  1158 * Improved completion mechanism, which is now managed by the
  1159 Isabelle/jEdit plugin instead of SideKick.  Refined table of Isabelle
  1160 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
  1161 
  1162 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
  1163 isabelle.complete for explicit completion in Isabelle sources.
  1164 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
  1165 to resolve conflict.
  1166 
  1167 * Improved support of various "minor modes" for Isabelle NEWS,
  1168 options, session ROOT etc., with completion and SideKick tree view.
  1169 
  1170 * Strictly monotonic document update, without premature cancellation of
  1171 running transactions that are still needed: avoid reset/restart of
  1172 such command executions while editing.
  1173 
  1174 * Support for asynchronous print functions, as overlay to existing
  1175 document content.
  1176 
  1177 * Support for automatic tools in HOL, which try to prove or disprove
  1178 toplevel theorem statements.
  1179 
  1180 * Action isabelle.reset-font-size resets main text area font size
  1181 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
  1182 also "Plugin Options / Isabelle / General").  It can be bound to some
  1183 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
  1184 
  1185 * File specifications in jEdit (e.g. file browser) may refer to
  1186 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms.  Discontinued
  1187 obsolete $ISABELLE_HOME_WINDOWS variable.
  1188 
  1189 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
  1190 / Global Options / Appearance".
  1191 
  1192 * Improved support of native Mac OS X functionality via "MacOSX"
  1193 plugin, which is now enabled by default.
  1194 
  1195 
  1196 *** Pure ***
  1197 
  1198 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
  1199 In particular, 'interpretation' allows for non-persistent
  1200 interpretation within "context ... begin ... end" blocks offering a
  1201 light-weight alternative to 'sublocale'.  See "isar-ref" manual for
  1202 details.
  1203 
  1204 * Improved locales diagnostic command 'print_dependencies'.
  1205 
  1206 * Discontinued obsolete 'axioms' command, which has been marked as
  1207 legacy since Isabelle2009-2.  INCOMPATIBILITY, use 'axiomatization'
  1208 instead, while observing its uniform scope for polymorphism.
  1209 
  1210 * Discontinued empty name bindings in 'axiomatization'.
  1211 INCOMPATIBILITY.
  1212 
  1213 * System option "proofs" has been discontinued.  Instead the global
  1214 state of Proofterm.proofs is persistently compiled into logic images
  1215 as required, notably HOL-Proofs.  Users no longer need to change
  1216 Proofterm.proofs dynamically.  Minor INCOMPATIBILITY.
  1217 
  1218 * Syntax translation functions (print_translation etc.) always depend
  1219 on Proof.context.  Discontinued former "(advanced)" option -- this is
  1220 now the default.  Minor INCOMPATIBILITY.
  1221 
  1222 * Former global reference trace_unify_fail is now available as
  1223 configuration option "unify_trace_failure" (global context only).
  1224 
  1225 * SELECT_GOAL now retains the syntactic context of the overall goal
  1226 state (schematic variables etc.).  Potential INCOMPATIBILITY in rare
  1227 situations.
  1228 
  1229 
  1230 *** HOL ***
  1231 
  1232 * Stronger precedence of syntax for big intersection and union on
  1233 sets, in accordance with corresponding lattice operations.
  1234 INCOMPATIBILITY.
  1235 
  1236 * Notation "{p:A. P}" now allows tuple patterns as well.
  1237 
  1238 * Nested case expressions are now translated in a separate check phase
  1239 rather than during parsing. The data for case combinators is separated
  1240 from the datatype package. The declaration attribute
  1241 "case_translation" can be used to register new case combinators:
  1242 
  1243   declare [[case_translation case_combinator constructor1 ... constructorN]]
  1244 
  1245 * Code generator:
  1246   - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
  1247     'code_instance'.
  1248   - 'code_identifier' declares name hints for arbitrary identifiers in
  1249     generated code, subsuming 'code_modulename'.
  1250 
  1251 See the isar-ref manual for syntax diagrams, and the HOL theories for
  1252 examples.
  1253 
  1254 * Attibute 'code': 'code' now declares concrete and abstract code
  1255 equations uniformly.  Use explicit 'code equation' and 'code abstract'
  1256 to distinguish both when desired.
  1257 
  1258 * Discontinued theories Code_Integer and Efficient_Nat by a more
  1259 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
  1260 Code_Target_Nat and Code_Target_Numeral.  See the tutorial on code
  1261 generation for details.  INCOMPATIBILITY.
  1262 
  1263 * Numeric types are mapped by default to target language numerals:
  1264 natural (replaces former code_numeral) and integer (replaces former
  1265 code_int).  Conversions are available as integer_of_natural /
  1266 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
  1267 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
  1268 ML).  INCOMPATIBILITY.
  1269 
  1270 * Function package: For mutually recursive functions f and g, separate
  1271 cases rules f.cases and g.cases are generated instead of unusable
  1272 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
  1273 in the case that the unusable rule was used nevertheless.
  1274 
  1275 * Function package: For each function f, new rules f.elims are
  1276 generated, which eliminate equalities of the form "f x = t".
  1277 
  1278 * New command 'fun_cases' derives ad-hoc elimination rules for
  1279 function equations as simplified instances of f.elims, analogous to
  1280 inductive_cases.  See ~~/src/HOL/ex/Fundefs.thy for some examples.
  1281 
  1282 * Lifting:
  1283   - parametrized correspondence relations are now supported:
  1284     + parametricity theorems for the raw term can be specified in
  1285       the command lift_definition, which allow us to generate stronger
  1286       transfer rules
  1287     + setup_lifting generates stronger transfer rules if parametric
  1288       correspondence relation can be generated
  1289     + various new properties of the relator must be specified to support
  1290       parametricity
  1291     + parametricity theorem for the Quotient relation can be specified
  1292   - setup_lifting generates domain rules for the Transfer package
  1293   - stronger reflexivity prover of respectfulness theorems for type
  1294     copies
  1295   - ===> and --> are now local. The symbols can be introduced
  1296     by interpreting the locale lifting_syntax (typically in an
  1297     anonymous context)
  1298   - Lifting/Transfer relevant parts of Library/Quotient_* are now in
  1299     Main. Potential INCOMPATIBILITY
  1300   - new commands for restoring and deleting Lifting/Transfer context:
  1301     lifting_forget, lifting_update
  1302   - the command print_quotmaps was renamed to print_quot_maps.
  1303     INCOMPATIBILITY
  1304 
  1305 * Transfer:
  1306   - better support for domains in Transfer: replace Domainp T
  1307     by the actual invariant in a transferred goal
  1308   - transfer rules can have as assumptions other transfer rules
  1309   - Experimental support for transferring from the raw level to the
  1310     abstract level: Transfer.transferred attribute
  1311   - Attribute version of the transfer method: untransferred attribute
  1312 
  1313 * Reification and reflection:
  1314   - Reification is now directly available in HOL-Main in structure
  1315     "Reification".
  1316   - Reflection now handles multiple lists with variables also.
  1317   - The whole reflection stack has been decomposed into conversions.
  1318 INCOMPATIBILITY.
  1319 
  1320 * Revised devices for recursive definitions over finite sets:
  1321   - Only one fundamental fold combinator on finite set remains:
  1322     Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
  1323     This is now identity on infinite sets.
  1324   - Locales ("mini packages") for fundamental definitions with
  1325     Finite_Set.fold: folding, folding_idem.
  1326   - Locales comm_monoid_set, semilattice_order_set and
  1327     semilattice_neutr_order_set for big operators on sets.
  1328     See theory Big_Operators for canonical examples.
  1329     Note that foundational constants comm_monoid_set.F and
  1330     semilattice_set.F correspond to former combinators fold_image
  1331     and fold1 respectively.  These are now gone.  You may use
  1332     those foundational constants as substitutes, but it is
  1333     preferable to interpret the above locales accordingly.
  1334   - Dropped class ab_semigroup_idem_mult (special case of lattice,
  1335     no longer needed in connection with Finite_Set.fold etc.)
  1336   - Fact renames:
  1337       card.union_inter ~> card_Un_Int [symmetric]
  1338       card.union_disjoint ~> card_Un_disjoint
  1339 INCOMPATIBILITY.
  1340 
  1341 * Locale hierarchy for abstract orderings and (semi)lattices.
  1342 
  1343 * Complete_Partial_Order.admissible is defined outside the type class
  1344 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
  1345 class predicate assumption or sort constraint when possible.
  1346 INCOMPATIBILITY.
  1347 
  1348 * Introduce type class "conditionally_complete_lattice": Like a
  1349 complete lattice but does not assume the existence of the top and
  1350 bottom elements.  Allows to generalize some lemmas about reals and
  1351 extended reals.  Removed SupInf and replaced it by the instantiation
  1352 of conditionally_complete_lattice for real. Renamed lemmas about
  1353 conditionally-complete lattice from Sup_... to cSup_... and from
  1354 Inf_...  to cInf_... to avoid hidding of similar complete lattice
  1355 lemmas.
  1356 
  1357 * Introduce type class linear_continuum as combination of
  1358 conditionally-complete lattices and inner dense linorders which have
  1359 more than one element.  INCOMPATIBILITY.
  1360 
  1361 * Introduced type classes order_top and order_bot. The old classes top
  1362 and bot only contain the syntax without assumptions.  INCOMPATIBILITY:
  1363 Rename bot -> order_bot, top -> order_top
  1364 
  1365 * Introduce type classes "no_top" and "no_bot" for orderings without
  1366 top and bottom elements.
  1367 
  1368 * Split dense_linorder into inner_dense_order and no_top, no_bot.
  1369 
  1370 * Complex_Main: Unify and move various concepts from
  1371 HOL-Multivariate_Analysis to HOL-Complex_Main.
  1372 
  1373  - Introduce type class (lin)order_topology and
  1374    linear_continuum_topology.  Allows to generalize theorems about
  1375    limits and order.  Instances are reals and extended reals.
  1376 
  1377  - continuous and continuos_on from Multivariate_Analysis:
  1378    "continuous" is the continuity of a function at a filter.  "isCont"
  1379    is now an abbrevitation: "isCont x f == continuous (at _) f".
  1380 
  1381    Generalized continuity lemmas from isCont to continuous on an
  1382    arbitrary filter.
  1383 
  1384  - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
  1385    compactness of closed intervals on reals. Continuous functions
  1386    attain infimum and supremum on compact sets. The inverse of a
  1387    continuous function is continuous, when the function is continuous
  1388    on a compact set.
  1389 
  1390  - connected from Multivariate_Analysis. Use it to prove the
  1391    intermediate value theorem. Show connectedness of intervals on
  1392    linear_continuum_topology).
  1393 
  1394  - first_countable_topology from Multivariate_Analysis. Is used to
  1395    show equivalence of properties on the neighbourhood filter of x and
  1396    on all sequences converging to x.
  1397 
  1398  - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
  1399    theorems from Library/FDERIV.thy to Deriv.thy and base the
  1400    definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
  1401    which are restricted to sets, i.e. to represent derivatives from
  1402    left or right.
  1403 
  1404  - Removed the within-filter. It is replaced by the principal filter:
  1405 
  1406      F within X = inf F (principal X)
  1407 
  1408  - Introduce "at x within U" as a single constant, "at x" is now an
  1409    abbreviation for "at x within UNIV"
  1410 
  1411  - Introduce named theorem collections tendsto_intros,
  1412    continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
  1413    in tendsto_intros (or FDERIV_intros) are also available as
  1414    tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
  1415    is replaced by a congruence rule. This allows to apply them as
  1416    intro rules and then proving equivalence by the simplifier.
  1417 
  1418  - Restructured theories in HOL-Complex_Main:
  1419 
  1420    + Moved RealDef and RComplete into Real
  1421 
  1422    + Introduced Topological_Spaces and moved theorems about
  1423      topological spaces, filters, limits and continuity to it
  1424 
  1425    + Renamed RealVector to Real_Vector_Spaces
  1426 
  1427    + Split Lim, SEQ, Series into Topological_Spaces,
  1428      Real_Vector_Spaces, and Limits
  1429 
  1430    + Moved Ln and Log to Transcendental
  1431 
  1432    + Moved theorems about continuity from Deriv to Topological_Spaces
  1433 
  1434  - Remove various auxiliary lemmas.
  1435 
  1436 INCOMPATIBILITY.
  1437 
  1438 * Nitpick:
  1439   - Added option "spy".
  1440   - Reduce incidence of "too high arity" errors.
  1441 
  1442 * Sledgehammer:
  1443   - Renamed option:
  1444       isar_shrink ~> isar_compress
  1445     INCOMPATIBILITY.
  1446   - Added options "isar_try0", "spy".
  1447   - Better support for "isar_proofs".
  1448   - MaSh has been fined-tuned and now runs as a local server.
  1449 
  1450 * Improved support for ad hoc overloading of constants (see also
  1451 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
  1452 
  1453 * Library/Polynomial.thy:
  1454   - Use lifting for primitive definitions.
  1455   - Explicit conversions from and to lists of coefficients, used for
  1456     generated code.
  1457   - Replaced recursion operator poly_rec by fold_coeffs.
  1458   - Prefer pre-existing gcd operation for gcd.
  1459   - Fact renames:
  1460     poly_eq_iff ~> poly_eq_poly_eq_iff
  1461     poly_ext ~> poly_eqI
  1462     expand_poly_eq ~> poly_eq_iff
  1463 IMCOMPATIBILITY.
  1464 
  1465 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
  1466 case_of_simps to convert function definitions between a list of
  1467 equations with patterns on the lhs and a single equation with case
  1468 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
  1469 
  1470 * New Library/FSet.thy: type of finite sets defined as a subtype of
  1471 sets defined by Lifting/Transfer.
  1472 
  1473 * Discontinued theory src/HOL/Library/Eval_Witness.  INCOMPATIBILITY.
  1474 
  1475 * Consolidation of library theories on product orders:
  1476 
  1477     Product_Lattice ~> Product_Order -- pointwise order on products
  1478     Product_ord ~> Product_Lexorder -- lexicographic order on products
  1479 
  1480 INCOMPATIBILITY.
  1481 
  1482 * Imperative-HOL: The MREC combinator is considered legacy and no
  1483 longer included by default. INCOMPATIBILITY, use partial_function
  1484 instead, or import theory Legacy_Mrec as a fallback.
  1485 
  1486 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
  1487 ~~/src/HOL/Algebra/poly.  Existing theories should be based on
  1488 ~~/src/HOL/Library/Polynomial instead.  The latter provides
  1489 integration with HOL's type classes for rings.  INCOMPATIBILITY.
  1490 
  1491 * HOL-BNF:
  1492   - Various improvements to BNF-based (co)datatype package, including
  1493     new commands "primrec_new", "primcorec", and
  1494     "datatype_new_compat", as well as documentation. See
  1495     "datatypes.pdf" for details.
  1496   - New "coinduction" method to avoid some boilerplate (compared to
  1497     coinduct).
  1498   - Renamed keywords:
  1499     data ~> datatype_new
  1500     codata ~> codatatype
  1501     bnf_def ~> bnf
  1502   - Renamed many generated theorems, including
  1503     discs ~> disc
  1504     map_comp' ~> map_comp
  1505     map_id' ~> map_id
  1506     sels ~> sel
  1507     set_map' ~> set_map
  1508     sets ~> set
  1509 IMCOMPATIBILITY.
  1510 
  1511 
  1512 *** ML ***
  1513 
  1514 * Spec_Check is a Quickcheck tool for Isabelle/ML.  The ML function
  1515 "check_property" allows to check specifications of the form "ALL x y
  1516 z. prop x y z".  See also ~~/src/Tools/Spec_Check/ with its
  1517 Examples.thy in particular.
  1518 
  1519 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
  1520 tracing output in the command transaction context instead of physical
  1521 stdout.  See also Toplevel.debug, Toplevel.debugging and
  1522 ML_Compiler.exn_trace.
  1523 
  1524 * ML type "theory" is now immutable, without any special treatment of
  1525 drafts or linear updates (which could lead to "stale theory" errors in
  1526 the past).  Discontinued obsolete operations like Theory.copy,
  1527 Theory.checkpoint, and the auxiliary type theory_ref.  Minor
  1528 INCOMPATIBILITY.
  1529 
  1530 * More uniform naming of goal functions for skipped proofs:
  1531 
  1532     Skip_Proof.prove  ~>  Goal.prove_sorry
  1533     Skip_Proof.prove_global  ~>  Goal.prove_sorry_global
  1534 
  1535 Minor INCOMPATIBILITY.
  1536 
  1537 * Simplifier tactics and tools use proper Proof.context instead of
  1538 historic type simpset.  Old-style declarations like addsimps,
  1539 addsimprocs etc. operate directly on Proof.context.  Raw type simpset
  1540 retains its use as snapshot of the main Simplifier context, using
  1541 simpset_of and put_simpset on Proof.context.  INCOMPATIBILITY -- port
  1542 old tools by making them depend on (ctxt : Proof.context) instead of
  1543 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
  1544 
  1545 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
  1546 operate on Proof.context instead of claset, for uniformity with addIs,
  1547 addEs, addDs etc. Note that claset_of and put_claset allow to manage
  1548 clasets separately from the context.
  1549 
  1550 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
  1551 INCOMPATIBILITY, use @{context} instead.
  1552 
  1553 * Antiquotation @{theory_context A} is similar to @{theory A}, but
  1554 presents the result as initial Proof.context.
  1555 
  1556 
  1557 *** System ***
  1558 
  1559 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
  1560 "isabelle build" in Isabelle2013.  INCOMPATIBILITY.
  1561 
  1562 * Discontinued obsolete isabelle-process options -f and -u (former
  1563 administrative aliases of option -e).  Minor INCOMPATIBILITY.
  1564 
  1565 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
  1566 settings variable.
  1567 
  1568 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
  1569 document formats: dvi.gz, ps, ps.gz -- the default document format is
  1570 always pdf.
  1571 
  1572 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
  1573 specify global resources of the JVM process run by isabelle build.
  1574 
  1575 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
  1576 to run Isabelle/Scala source files as standalone programs.
  1577 
  1578 * Improved "isabelle keywords" tool (for old-style ProofGeneral
  1579 keyword tables): use Isabelle/Scala operations, which inspect outer
  1580 syntax without requiring to build sessions first.
  1581 
  1582 * Sessions may be organized via 'chapter' specifications in the ROOT
  1583 file, which determines a two-level hierarchy of browser info.  The old
  1584 tree-like organization via implicit sub-session relation (with its
  1585 tendency towards erratic fluctuation of URLs) has been discontinued.
  1586 The default chapter is called "Unsorted".  Potential INCOMPATIBILITY
  1587 for HTML presentation of theories.
  1588 
  1589 
  1590 
  1591 New in Isabelle2013 (February 2013)
  1592 -----------------------------------
  1593 
  1594 *** General ***
  1595 
  1596 * Theorem status about oracles and unfinished/failed future proofs is
  1597 no longer printed by default, since it is incompatible with
  1598 incremental / parallel checking of the persistent document model.  ML
  1599 function Thm.peek_status may be used to inspect a snapshot of the
  1600 ongoing evaluation process.  Note that in batch mode --- notably
  1601 isabelle build --- the system ensures that future proofs of all
  1602 accessible theorems in the theory context are finished (as before).
  1603 
  1604 * Configuration option show_markup controls direct inlining of markup
  1605 into the printed representation of formal entities --- notably type
  1606 and sort constraints.  This enables Prover IDE users to retrieve that
  1607 information via tooltips in the output window, for example.
  1608 
  1609 * Command 'ML_file' evaluates ML text from a file directly within the
  1610 theory, without any predeclaration via 'uses' in the theory header.
  1611 
  1612 * Old command 'use' command and corresponding keyword 'uses' in the
  1613 theory header are legacy features and will be discontinued soon.
  1614 Tools that load their additional source files may imitate the
  1615 'ML_file' implementation, such that the system can take care of
  1616 dependencies properly.
  1617 
  1618 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
  1619 is called fastforce / fast_force_tac already since Isabelle2011-1.
  1620 
  1621 * Updated and extended "isar-ref" and "implementation" manual, reduced
  1622 remaining material in old "ref" manual.
  1623 
  1624 * Improved support for auxiliary contexts that indicate block structure
  1625 for specifications.  Nesting of "context fixes ... context assumes ..."
  1626 and "class ... context ...".
  1627 
  1628 * Attribute "consumes" allows a negative value as well, which is
  1629 interpreted relatively to the total number of premises of the rule in
  1630 the target context.  This form of declaration is stable when exported
  1631 from a nested 'context' with additional assumptions.  It is the
  1632 preferred form for definitional packages, notably cases/rules produced
  1633 in HOL/inductive and HOL/function.
  1634 
  1635 * More informative error messages for Isar proof commands involving
  1636 lazy enumerations (method applications etc.).
  1637 
  1638 * Refined 'help' command to retrieve outer syntax commands according
  1639 to name patterns (with clickable results).
  1640 
  1641 
  1642 *** Prover IDE -- Isabelle/Scala/jEdit ***
  1643 
  1644 * Parallel terminal proofs ('by') are enabled by default, likewise
  1645 proofs that are built into packages like 'datatype', 'function'.  This
  1646 allows to "run ahead" checking the theory specifications on the
  1647 surface, while the prover is still crunching on internal
  1648 justifications.  Unfinished / cancelled proofs are restarted as
  1649 required to complete full proof checking eventually.
  1650 
  1651 * Improved output panel with tooltips, hyperlinks etc. based on the
  1652 same Rich_Text_Area as regular Isabelle/jEdit buffers.  Activation of
  1653 tooltips leads to some window that supports the same recursively,
  1654 which can lead to stacks of tooltips as the semantic document content
  1655 is explored.  ESCAPE closes the whole stack, individual windows may be
  1656 closed separately, or detached to become independent jEdit dockables.
  1657 
  1658 * Improved support for commands that produce graph output: the text
  1659 message contains a clickable area to open a new instance of the graph
  1660 browser on demand.
  1661 
  1662 * More robust incremental parsing of outer syntax (partial comments,
  1663 malformed symbols).  Changing the balance of open/close quotes and
  1664 comment delimiters works more conveniently with unfinished situations
  1665 that frequently occur in user interaction.
  1666 
  1667 * More efficient painting and improved reactivity when editing large
  1668 files.  More scalable management of formal document content.
  1669 
  1670 * Smarter handling of tracing messages: prover process pauses after
  1671 certain number of messages per command transaction, with some user
  1672 dialog to stop or continue.  This avoids swamping the front-end with
  1673 potentially infinite message streams.
  1674 
  1675 * More plugin options and preferences, based on Isabelle/Scala.  The
  1676 jEdit plugin option panel provides access to some Isabelle/Scala
  1677 options, including tuning parameters for editor reactivity and color
  1678 schemes.
  1679 
  1680 * Dockable window "Symbols" provides some editing support for Isabelle
  1681 symbols.
  1682 
  1683 * Dockable window "Monitor" shows ML runtime statistics.  Note that
  1684 continuous display of the chart slows down the system.
  1685 
  1686 * Improved editing support for control styles: subscript, superscript,
  1687 bold, reset of style -- operating on single symbols or text
  1688 selections.  Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
  1689 
  1690 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
  1691 adjust the main text area font size, and its derivatives for output,
  1692 tooltips etc.  Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
  1693 need to be adapted to local keyboard layouts.
  1694 
  1695 * More reactive completion popup by default: use \t (TAB) instead of
  1696 \n (NEWLINE) to minimize intrusion into regular flow of editing.  See
  1697 also "Plugin Options / SideKick / General / Code Completion Options".
  1698 
  1699 * Implicit check and build dialog of the specified logic session
  1700 image.  For example, HOL, HOLCF, HOL-Nominal can be produced on
  1701 demand, without bundling big platform-dependent heap images in the
  1702 Isabelle distribution.
  1703 
  1704 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
  1705 from Oracle provide better multi-platform experience.  This version is
  1706 now bundled exclusively with Isabelle.
  1707 
  1708 
  1709 *** Pure ***
  1710 
  1711 * Code generation for Haskell: restrict unqualified imports from
  1712 Haskell Prelude to a small set of fundamental operations.
  1713 
  1714 * Command 'export_code': relative file names are interpreted
  1715 relatively to master directory of current theory rather than the
  1716 rather arbitrary current working directory.  INCOMPATIBILITY.
  1717 
  1718 * Discontinued obsolete attribute "COMP".  Potential INCOMPATIBILITY,
  1719 use regular rule composition via "OF" / "THEN", or explicit proof
  1720 structure instead.  Note that Isabelle/ML provides a variety of
  1721 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
  1722 with some care where this is really required.
  1723 
  1724 * Command 'typ' supports an additional variant with explicit sort
  1725 constraint, to infer and check the most general type conforming to a
  1726 given sort.  Example (in HOL):
  1727 
  1728   typ "_ * _ * bool * unit" :: finite
  1729 
  1730 * Command 'locale_deps' visualizes all locales and their relations as
  1731 a Hasse diagram.
  1732 
  1733 
  1734 *** HOL ***
  1735 
  1736 * Sledgehammer:
  1737 
  1738   - Added MaSh relevance filter based on machine-learning; see the
  1739     Sledgehammer manual for details.
  1740   - Polished Isar proofs generated with "isar_proofs" option.
  1741   - Rationalized type encodings ("type_enc" option).
  1742   - Renamed "kill_provers" subcommand to "kill_all".
  1743   - Renamed options:
  1744       isar_proof ~> isar_proofs
  1745       isar_shrink_factor ~> isar_shrink
  1746       max_relevant ~> max_facts
  1747       relevance_thresholds ~> fact_thresholds
  1748 
  1749 * Quickcheck: added an optimisation for equality premises.  It is
  1750 switched on by default, and can be switched off by setting the
  1751 configuration quickcheck_optimise_equality to false.
  1752 
  1753 * Quotient: only one quotient can be defined by quotient_type
  1754 INCOMPATIBILITY.
  1755 
  1756 * Lifting:
  1757   - generation of an abstraction function equation in lift_definition
  1758   - quot_del attribute
  1759   - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
  1760 
  1761 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
  1762 expressions.
  1763 
  1764 * Preprocessing of the code generator rewrites set comprehensions into
  1765 pointfree expressions.
  1766 
  1767 * The SMT solver Z3 has now by default a restricted set of directly
  1768 supported features. For the full set of features (div/mod, nonlinear
  1769 arithmetic, datatypes/records) with potential proof reconstruction
  1770 failures, enable the configuration option "z3_with_extensions".  Minor
  1771 INCOMPATIBILITY.
  1772 
  1773 * Simplified 'typedef' specifications: historical options for implicit
  1774 set definition and alternative name have been discontinued.  The
  1775 former behavior of "typedef (open) t = A" is now the default, but
  1776 written just "typedef t = A".  INCOMPATIBILITY, need to adapt theories
  1777 accordingly.
  1778 
  1779 * Removed constant "chars"; prefer "Enum.enum" on type "char"
  1780 directly.  INCOMPATIBILITY.
  1781 
  1782 * Moved operation product, sublists and n_lists from theory Enum to
  1783 List.  INCOMPATIBILITY.
  1784 
  1785 * Theorem UN_o generalized to SUP_comp.  INCOMPATIBILITY.
  1786 
  1787 * Class "comm_monoid_diff" formalises properties of bounded
  1788 subtraction, with natural numbers and multisets as typical instances.
  1789 
  1790 * Added combinator "Option.these" with type "'a option set => 'a set".
  1791 
  1792 * Theory "Transitive_Closure": renamed lemmas
  1793 
  1794   reflcl_tranclp -> reflclp_tranclp
  1795   rtranclp_reflcl -> rtranclp_reflclp
  1796 
  1797 INCOMPATIBILITY.
  1798 
  1799 * Theory "Rings": renamed lemmas (in class semiring)
  1800 
  1801   left_distrib ~> distrib_right
  1802   right_distrib ~> distrib_left
  1803 
  1804 INCOMPATIBILITY.
  1805 
  1806 * Generalized the definition of limits:
  1807 
  1808   - Introduced the predicate filterlim (LIM x F. f x :> G) which
  1809     expresses that when the input values x converge to F then the
  1810     output f x converges to G.
  1811 
  1812   - Added filters for convergence to positive (at_top) and negative
  1813     infinity (at_bot).
  1814 
  1815   - Moved infinity in the norm (at_infinity) from
  1816     Multivariate_Analysis to Complex_Main.
  1817 
  1818   - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
  1819     at_top".
  1820 
  1821 INCOMPATIBILITY.
  1822 
  1823 * Theory "Library/Option_ord" provides instantiation of option type to
  1824 lattice type classes.
  1825 
  1826 * Theory "Library/Multiset": renamed
  1827 
  1828     constant fold_mset ~> Multiset.fold
  1829     fact fold_mset_commute ~> fold_mset_comm
  1830 
  1831 INCOMPATIBILITY.
  1832 
  1833 * Renamed theory Library/List_Prefix to Library/Sublist, with related
  1834 changes as follows.
  1835 
  1836   - Renamed constants (and related lemmas)
  1837 
  1838       prefix ~> prefixeq
  1839       strict_prefix ~> prefix
  1840 
  1841   - Replaced constant "postfix" by "suffixeq" with swapped argument
  1842     order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
  1843     old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
  1844     Renamed lemmas accordingly.
  1845 
  1846   - Added constant "list_hembeq" for homeomorphic embedding on
  1847     lists. Added abbreviation "sublisteq" for special case
  1848     "list_hembeq (op =)".
  1849 
  1850   - Theory Library/Sublist no longer provides "order" and "bot" type
  1851     class instances for the prefix order (merely corresponding locale
  1852     interpretations). The type class instances are now in theory
  1853     Library/Prefix_Order.
  1854 
  1855   - The sublist relation of theory Library/Sublist_Order is now based
  1856     on "Sublist.sublisteq".  Renamed lemmas accordingly:
  1857 
  1858       le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
  1859       le_list_append_mono ~> Sublist.list_hembeq_append_mono
  1860       le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
  1861       le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
  1862       le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
  1863       le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
  1864       le_list_drop_Cons ~> Sublist.sublisteq_Cons'
  1865       le_list_drop_many ~> Sublist.sublisteq_drop_many
  1866       le_list_filter_left ~> Sublist.sublisteq_filter_left
  1867       le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
  1868       le_list_rev_take_iff ~> Sublist.sublisteq_append
  1869       le_list_same_length ~> Sublist.sublisteq_same_length
  1870       le_list_take_many_iff ~> Sublist.sublisteq_append'
  1871       less_eq_list.drop ~> less_eq_list_drop
  1872       less_eq_list.induct ~> less_eq_list_induct
  1873       not_le_list_length ~> Sublist.not_sublisteq_length
  1874 
  1875 INCOMPATIBILITY.
  1876 
  1877 * New theory Library/Countable_Set.
  1878 
  1879 * Theory Library/Debug and Library/Parallel provide debugging and
  1880 parallel execution for code generated towards Isabelle/ML.
  1881 
  1882 * Theory Library/FuncSet: Extended support for Pi and extensional and
  1883 introduce the extensional dependent function space "PiE". Replaced
  1884 extensional_funcset by an abbreviation, and renamed lemmas from
  1885 extensional_funcset to PiE as follows:
  1886 
  1887   extensional_empty  ~>  PiE_empty
  1888   extensional_funcset_empty_domain  ~>  PiE_empty_domain
  1889   extensional_funcset_empty_range  ~>  PiE_empty_range
  1890   extensional_funcset_arb  ~>  PiE_arb
  1891   extensional_funcset_mem  ~>  PiE_mem
  1892   extensional_funcset_extend_domainI  ~>  PiE_fun_upd
  1893   extensional_funcset_restrict_domain  ~>  fun_upd_in_PiE
  1894   extensional_funcset_extend_domain_eq  ~>  PiE_insert_eq
  1895   card_extensional_funcset  ~>  card_PiE
  1896   finite_extensional_funcset  ~>  finite_PiE
  1897 
  1898 INCOMPATIBILITY.
  1899 
  1900 * Theory Library/FinFun: theory of almost everywhere constant
  1901 functions (supersedes the AFP entry "Code Generation for Functions as
  1902 Data").
  1903 
  1904 * Theory Library/Phantom: generic phantom type to make a type
  1905 parameter appear in a constant's type.  This alternative to adding
  1906 TYPE('a) as another parameter avoids unnecessary closures in generated
  1907 code.
  1908 
  1909 * Theory Library/RBT_Impl: efficient construction of red-black trees
  1910 from sorted associative lists. Merging two trees with rbt_union may
  1911 return a structurally different tree than before.  Potential
  1912 INCOMPATIBILITY.
  1913 
  1914 * Theory Library/IArray: immutable arrays with code generation.
  1915 
  1916 * Theory Library/Finite_Lattice: theory of finite lattices.
  1917 
  1918 * HOL/Multivariate_Analysis: replaced
  1919 
  1920   "basis :: 'a::euclidean_space => nat => real"
  1921   "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
  1922 
  1923 on euclidean spaces by using the inner product "_ \<bullet> _" with
  1924 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
  1925 "SUM i : Basis. f i * r i".
  1926 
  1927   With this change the following constants are also changed or removed:
  1928 
  1929     DIM('a) :: nat  ~>  card (Basis :: 'a set)   (is an abbreviation)
  1930     a $$ i  ~>  inner a i  (where i : Basis)
  1931     cart_base i  removed
  1932     \<pi>, \<pi>'  removed
  1933 
  1934   Theorems about these constants where removed.
  1935 
  1936   Renamed lemmas:
  1937 
  1938     component_le_norm  ~>  Basis_le_norm
  1939     euclidean_eq  ~>  euclidean_eq_iff
  1940     differential_zero_maxmin_component  ~>  differential_zero_maxmin_cart
  1941     euclidean_simps  ~>  inner_simps
  1942     independent_basis  ~>  independent_Basis
  1943     span_basis  ~>  span_Basis
  1944     in_span_basis  ~>  in_span_Basis
  1945     norm_bound_component_le  ~>  norm_boound_Basis_le
  1946     norm_bound_component_lt  ~>  norm_boound_Basis_lt
  1947     component_le_infnorm  ~>  Basis_le_infnorm
  1948 
  1949 INCOMPATIBILITY.
  1950 
  1951 * HOL/Probability:
  1952 
  1953   - Added simproc "measurable" to automatically prove measurability.
  1954 
  1955   - Added induction rules for sigma sets with disjoint union
  1956     (sigma_sets_induct_disjoint) and for Borel-measurable functions
  1957     (borel_measurable_induct).
  1958 
  1959   - Added the Daniell-Kolmogorov theorem (the existence the limit of a
  1960     projective family).
  1961 
  1962 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
  1963 AFP entry "Ordinals_and_Cardinals").
  1964 
  1965 * HOL/BNF: New (co)datatype package based on bounded natural functors
  1966 with support for mixed, nested recursion and interesting non-free
  1967 datatypes.
  1968 
  1969 * HOL/Finite_Set and Relation: added new set and relation operations
  1970 expressed by Finite_Set.fold.
  1971 
  1972 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
  1973 trees for the code generator.
  1974 
  1975 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
  1976 Lifting/Transfer.
  1977 possible INCOMPATIBILITY.
  1978 
  1979 * HOL/Set: renamed Set.project -> Set.filter
  1980 INCOMPATIBILITY.
  1981 
  1982 
  1983 *** Document preparation ***
  1984 
  1985 * Dropped legacy antiquotations "term_style" and "thm_style", since
  1986 styles may be given as arguments to "term" and "thm" already.
  1987 Discontinued legacy styles "prem1" .. "prem19".
  1988 
  1989 * Default LaTeX rendering for \<euro> is now based on eurosym package,
  1990 instead of slightly exotic babel/greek.
  1991 
  1992 * Document variant NAME may use different LaTeX entry point
  1993 document/root_NAME.tex if that file exists, instead of the common
  1994 document/root.tex.
  1995 
  1996 * Simplified custom document/build script, instead of old-style
  1997 document/IsaMakefile.  Minor INCOMPATIBILITY.
  1998 
  1999 
  2000 *** ML ***
  2001 
  2002 * The default limit for maximum number of worker threads is now 8,
  2003 instead of 4, in correspondence to capabilities of contemporary
  2004 hardware and Poly/ML runtime system.
  2005 
  2006 * Type Seq.results and related operations support embedded error
  2007 messages within lazy enumerations, and thus allow to provide
  2008 informative errors in the absence of any usable results.
  2009 
  2010 * Renamed Position.str_of to Position.here to emphasize that this is a
  2011 formal device to inline positions into message text, but not
  2012 necessarily printing visible text.
  2013 
  2014 
  2015 *** System ***
  2016 
  2017 * Advanced support for Isabelle sessions and build management, see
  2018 "system" manual for the chapter of that name, especially the "isabelle
  2019 build" tool and its examples.  The "isabelle mkroot" tool prepares
  2020 session root directories for use with "isabelle build", similar to
  2021 former "isabelle mkdir" for "isabelle usedir".  Note that this affects
  2022 document preparation as well.  INCOMPATIBILITY, isabelle usedir /
  2023 mkdir / make are rendered obsolete.
  2024 
  2025 * Discontinued obsolete Isabelle/build script, it is superseded by the
  2026 regular isabelle build tool.  For example:
  2027 
  2028   isabelle build -s -b HOL
  2029 
  2030 * Discontinued obsolete "isabelle makeall".
  2031 
  2032 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
  2033 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
  2034 provides some traditional targets that invoke "isabelle build".  Note
  2035 that this is inefficient!  Applications of Isabelle/HOL involving
  2036 "isabelle make" should be upgraded to use "isabelle build" directly.
  2037 
  2038 * The "isabelle options" tool prints Isabelle system options, as
  2039 required for "isabelle build", for example.
  2040 
  2041 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
  2042 Minor INCOMPATIBILITY in command-line options.
  2043 
  2044 * The "isabelle install" tool has now a simpler command-line.  Minor
  2045 INCOMPATIBILITY.
  2046 
  2047 * The "isabelle components" tool helps to resolve add-on components
  2048 that are not bundled, or referenced from a bare-bones repository
  2049 version of Isabelle.
  2050 
  2051 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
  2052 platform family: "linux", "macos", "windows".
  2053 
  2054 * The ML system is configured as regular component, and no longer
  2055 picked up from some surrounding directory.  Potential INCOMPATIBILITY
  2056 for home-made settings.
  2057 
  2058 * Improved ML runtime statistics (heap, threads, future tasks etc.).
  2059 
  2060 * Discontinued support for Poly/ML 5.2.1, which was the last version
  2061 without exception positions and advanced ML compiler/toplevel
  2062 configuration.
  2063 
  2064 * Discontinued special treatment of Proof General -- no longer guess
  2065 PROOFGENERAL_HOME based on accidental file-system layout.  Minor
  2066 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
  2067 settings manually, or use a Proof General version that has been
  2068 bundled as Isabelle component.
  2069 
  2070 
  2071 
  2072 New in Isabelle2012 (May 2012)
  2073 ------------------------------
  2074 
  2075 *** General ***
  2076 
  2077 * Prover IDE (PIDE) improvements:
  2078 
  2079   - more robust Sledgehammer integration (as before the sledgehammer
  2080     command-line needs to be typed into the source buffer)
  2081   - markup for bound variables
  2082   - markup for types of term variables (displayed as tooltips)
  2083   - support for user-defined Isar commands within the running session
  2084   - improved support for Unicode outside original 16bit range
  2085     e.g. glyph for \<A> (thanks to jEdit 4.5.1)
  2086 
  2087 * Forward declaration of outer syntax keywords within the theory
  2088 header -- minor INCOMPATIBILITY for user-defined commands.  Allow new
  2089 commands to be used in the same theory where defined.
  2090 
  2091 * Auxiliary contexts indicate block structure for specifications with
  2092 additional parameters and assumptions.  Such unnamed contexts may be
  2093 nested within other targets, like 'theory', 'locale', 'class',
  2094 'instantiation' etc.  Results from the local context are generalized
  2095 accordingly and applied to the enclosing target context.  Example:
  2096 
  2097   context
  2098     fixes x y z :: 'a
  2099     assumes xy: "x = y" and yz: "y = z"
  2100   begin
  2101 
  2102   lemma my_trans: "x = z" using xy yz by simp
  2103 
  2104   end
  2105 
  2106   thm my_trans
  2107 
  2108 The most basic application is to factor-out context elements of
  2109 several fixes/assumes/shows theorem statements, e.g. see
  2110 ~~/src/HOL/Isar_Examples/Group_Context.thy
  2111 
  2112 Any other local theory specification element works within the "context
  2113 ... begin ... end" block as well.
  2114 
  2115 * Bundled declarations associate attributed fact expressions with a
  2116 given name in the context.  These may be later included in other
  2117 contexts.  This allows to manage context extensions casually, without
  2118 the logical dependencies of locales and locale interpretation.  See
  2119 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
  2120 
  2121 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
  2122 declaration, and results are standardized before being stored.  Thus
  2123 old-style "standard" after instantiation or composition of facts
  2124 becomes obsolete.  Minor INCOMPATIBILITY, due to potential change of
  2125 indices of schematic variables.
  2126 
  2127 * Rule attributes in local theory declarations (e.g. locale or class)
  2128 are now statically evaluated: the resulting theorem is stored instead
  2129 of the original expression.  INCOMPATIBILITY in rare situations, where
  2130 the historic accident of dynamic re-evaluation in interpretations
  2131 etc. was exploited.
  2132 
  2133 * New tutorial "Programming and Proving in Isabelle/HOL"
  2134 ("prog-prove").  It completely supersedes "A Tutorial Introduction to
  2135 Structured Isar Proofs" ("isar-overview"), which has been removed.  It
  2136 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
  2137 Logic" as the recommended beginners tutorial, but does not cover all
  2138 of the material of that old tutorial.
  2139 
  2140 * Updated and extended reference manuals: "isar-ref",
  2141 "implementation", "system"; reduced remaining material in old "ref"
  2142 manual.
  2143 
  2144 
  2145 *** Pure ***
  2146 
  2147 * Command 'definition' no longer exports the foundational "raw_def"
  2148 into the user context.  Minor INCOMPATIBILITY, may use the regular
  2149 "def" result with attribute "abs_def" to imitate the old version.
  2150 
  2151 * Attribute "abs_def" turns an equation of the form "f x y == t" into
  2152 "f == %x y. t", which ensures that "simp" or "unfold" steps always
  2153 expand it.  This also works for object-logic equality.  (Formerly
  2154 undocumented feature.)
  2155 
  2156 * Sort constraints are now propagated in simultaneous statements, just
  2157 like type constraints.  INCOMPATIBILITY in rare situations, where
  2158 distinct sorts used to be assigned accidentally.  For example:
  2159 
  2160   lemma "P (x::'a::foo)" and "Q (y::'a::bar)"  -- "now illegal"
  2161 
  2162   lemma "P (x::'a)" and "Q (y::'a::bar)"
  2163     -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
  2164 
  2165 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
  2166 tolerant against multiple unifiers, as long as the final result is
  2167 unique.  (As before, rules are composed in canonical right-to-left
  2168 order to accommodate newly introduced premises.)
  2169 
  2170 * Renamed some inner syntax categories:
  2171 
  2172     num ~> num_token
  2173     xnum ~> xnum_token
  2174     xstr ~> str_token
  2175 
  2176 Minor INCOMPATIBILITY.  Note that in practice "num_const" or
  2177 "num_position" etc. are mainly used instead (which also include
  2178 position information via constraints).
  2179 
  2180 * Simplified configuration options for syntax ambiguity: see
  2181 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
  2182 manual.  Minor INCOMPATIBILITY.
  2183 
  2184 * Discontinued configuration option "syntax_positions": atomic terms
  2185 in parse trees are always annotated by position constraints.
  2186 
  2187 * Old code generator for SML and its commands 'code_module',
  2188 'code_library', 'consts_code', 'types_code' have been discontinued.
  2189 Use commands of the generic code generator instead.  INCOMPATIBILITY.
  2190 
  2191 * Redundant attribute "code_inline" has been discontinued. Use
  2192 "code_unfold" instead.  INCOMPATIBILITY.
  2193 
  2194 * Dropped attribute "code_unfold_post" in favor of the its dual
  2195 "code_abbrev", which yields a common pattern in definitions like
  2196 
  2197   definition [code_abbrev]: "f = t"
  2198 
  2199 INCOMPATIBILITY.
  2200 
  2201 * Obsolete 'types' command has been discontinued.  Use 'type_synonym'
  2202 instead.  INCOMPATIBILITY.
  2203 
  2204 * Discontinued old "prems" fact, which used to refer to the accidental
  2205 collection of foundational premises in the context (already marked as
  2206 legacy since Isabelle2011).
  2207 
  2208 
  2209 *** HOL ***
  2210 
  2211 * Type 'a set is now a proper type constructor (just as before
  2212 Isabelle2008).  Definitions mem_def and Collect_def have disappeared.
  2213 Non-trivial INCOMPATIBILITY.  For developments keeping predicates and
  2214 sets separate, it is often sufficient to rephrase some set S that has
  2215 been accidentally used as predicates by "%x. x : S", and some
  2216 predicate P that has been accidentally used as set by "{x. P x}".
  2217 Corresponding proofs in a first step should be pruned from any
  2218 tinkering with former theorems mem_def and Collect_def as far as
  2219 possible.
  2220 
  2221 For developments which deliberately mix predicates and sets, a
  2222 planning step is necessary to determine what should become a predicate
  2223 and what a set.  It can be helpful to carry out that step in
  2224 Isabelle2011-1 before jumping right into the current release.
  2225 
  2226 * Code generation by default implements sets as container type rather
  2227 than predicates.  INCOMPATIBILITY.
  2228 
  2229 * New type synonym 'a rel = ('a * 'a) set
  2230 
  2231 * The representation of numerals has changed.  Datatype "num"
  2232 represents strictly positive binary numerals, along with functions
  2233 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
  2234 positive and negated numeric literals, respectively.  See also
  2235 definitions in ~~/src/HOL/Num.thy.  Potential INCOMPATIBILITY, some
  2236 user theories may require adaptations as follows:
  2237 
  2238   - Theorems with number_ring or number_semiring constraints: These
  2239     classes are gone; use comm_ring_1 or comm_semiring_1 instead.
  2240 
  2241   - Theories defining numeric types: Remove number, number_semiring,
  2242     and number_ring instances. Defer all theorems about numerals until
  2243     after classes one and semigroup_add have been instantiated.
  2244 
  2245   - Numeral-only simp rules: Replace each rule having a "number_of v"
  2246     pattern with two copies, one for numeral and one for neg_numeral.
  2247 
  2248   - Theorems about subclasses of semiring_1 or ring_1: These classes
  2249     automatically support numerals now, so more simp rules and
  2250     simprocs may now apply within the proof.
  2251 
  2252   - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
  2253     Redefine using other integer operations.
  2254 
  2255 * Transfer: New package intended to generalize the existing
  2256 "descending" method and related theorem attributes from the Quotient
  2257 package.  (Not all functionality is implemented yet, but future
  2258 development will focus on Transfer as an eventual replacement for the
  2259 corresponding parts of the Quotient package.)
  2260 
  2261   - transfer_rule attribute: Maintains a collection of transfer rules,
  2262     which relate constants at two different types. Transfer rules may
  2263     relate different type instances of the same polymorphic constant,
  2264     or they may relate an operation on a raw type to a corresponding
  2265     operation on an abstract type (quotient or subtype). For example:
  2266 
  2267     ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
  2268     (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
  2269 
  2270   - transfer method: Replaces a subgoal on abstract types with an
  2271     equivalent subgoal on the corresponding raw types. Constants are
  2272     replaced with corresponding ones according to the transfer rules.
  2273     Goals are generalized over all free variables by default; this is
  2274     necessary for variables whose types change, but can be overridden
  2275     for specific variables with e.g. "transfer fixing: x y z".  The
  2276     variant transfer' method allows replacing a subgoal with one that
  2277     is logically stronger (rather than equivalent).
  2278 
  2279   - relator_eq attribute: Collects identity laws for relators of
  2280     various type constructors, e.g. "list_all2 (op =) = (op =)".  The
  2281     transfer method uses these lemmas to infer transfer rules for
  2282     non-polymorphic constants on the fly.
  2283 
  2284   - transfer_prover method: Assists with proving a transfer rule for a
  2285     new constant, provided the constant is defined in terms of other
  2286     constants that already have transfer rules. It should be applied
  2287     after unfolding the constant definitions.
  2288 
  2289   - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
  2290     from type nat to type int.
  2291 
  2292 * Lifting: New package intended to generalize the quotient_definition
  2293 facility of the Quotient package; designed to work with Transfer.
  2294 
  2295   - lift_definition command: Defines operations on an abstract type in
  2296     terms of a corresponding operation on a representation
  2297     type.  Example syntax:
  2298 
  2299     lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
  2300       is List.insert
  2301 
  2302     Users must discharge a respectfulness proof obligation when each
  2303     constant is defined. (For a type copy, i.e. a typedef with UNIV,
  2304     the proof is discharged automatically.) The obligation is
  2305     presented in a user-friendly, readable form; a respectfulness
  2306     theorem in the standard format and a transfer rule are generated
  2307     by the package.
  2308 
  2309   - Integration with code_abstype: For typedefs (e.g. subtypes
  2310     corresponding to a datatype invariant, such as dlist),
  2311     lift_definition generates a code certificate theorem and sets up
  2312     code generation for each constant.
  2313 
  2314   - setup_lifting command: Sets up the Lifting package to work with a
  2315     user-defined type. The user must provide either a quotient theorem
  2316     or a type_definition theorem.  The package configures transfer
  2317     rules for equality and quantifiers on the type, and sets up the
  2318     lift_definition command to work with the type.
  2319 
  2320   - Usage examples: See Quotient_Examples/Lift_DList.thy,
  2321     Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
  2322     Word/Word.thy and Library/Float.thy.
  2323 
  2324 * Quotient package:
  2325 
  2326   - The 'quotient_type' command now supports a 'morphisms' option with
  2327     rep and abs functions, similar to typedef.
  2328 
  2329   - 'quotient_type' sets up new types to work with the Lifting and
  2330     Transfer packages, as with 'setup_lifting'.
  2331 
  2332   - The 'quotient_definition' command now requires the user to prove a
  2333     respectfulness property at the point where the constant is
  2334     defined, similar to lift_definition; INCOMPATIBILITY.
  2335 
  2336   - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
  2337     accordingly, INCOMPATIBILITY.
  2338 
  2339 * New diagnostic command 'find_unused_assms' to find potentially
  2340 superfluous assumptions in theorems using Quickcheck.
  2341 
  2342 * Quickcheck:
  2343 
  2344   - Quickcheck returns variable assignments as counterexamples, which
  2345     allows to reveal the underspecification of functions under test.
  2346     For example, refuting "hd xs = x", it presents the variable
  2347     assignment xs = [] and x = a1 as a counterexample, assuming that
  2348     any property is false whenever "hd []" occurs in it.
  2349 
  2350     These counterexample are marked as potentially spurious, as
  2351     Quickcheck also returns "xs = []" as a counterexample to the
  2352     obvious theorem "hd xs = hd xs".
  2353 
  2354     After finding a potentially spurious counterexample, Quickcheck
  2355     continues searching for genuine ones.
  2356 
  2357     By default, Quickcheck shows potentially spurious and genuine
  2358     counterexamples. The option "genuine_only" sets quickcheck to only
  2359     show genuine counterexamples.
  2360 
  2361   - The command 'quickcheck_generator' creates random and exhaustive
  2362     value generators for a given type and operations.
  2363 
  2364     It generates values by using the operations as if they were
  2365     constructors of that type.
  2366 
  2367   - Support for multisets.
  2368 
  2369   - Added "use_subtype" options.
  2370 
  2371   - Added "quickcheck_locale" configuration to specify how to process
  2372     conjectures in a locale context.
  2373 
  2374 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
  2375 and affecting 'rat' and 'real'.
  2376 
  2377 * Sledgehammer:
  2378   - Integrated more tightly with SPASS, as described in the ITP 2012
  2379     paper "More SPASS with Isabelle".
  2380   - Made it try "smt" as a fallback if "metis" fails or times out.
  2381   - Added support for the following provers: Alt-Ergo (via Why3 and
  2382     TFF1), iProver, iProver-Eq.
  2383   - Sped up the minimizer.
  2384   - Added "lam_trans", "uncurry_aliases", and "minimize" options.
  2385   - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
  2386   - Renamed "sound" option to "strict".
  2387 
  2388 * Metis: Added possibility to specify lambda translations scheme as a
  2389 parenthesized argument (e.g., "by (metis (lifting) ...)").
  2390 
  2391 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
  2392 
  2393 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
  2394 
  2395 * New "case_product" attribute to generate a case rule doing multiple
  2396 case distinctions at the same time.  E.g.
  2397 
  2398   list.exhaust [case_product nat.exhaust]
  2399 
  2400 produces a rule which can be used to perform case distinction on both
  2401 a list and a nat.
  2402 
  2403 * New "eventually_elim" method as a generalized variant of the
  2404 eventually_elim* rules.  Supports structured proofs.
  2405 
  2406 * Typedef with implicit set definition is considered legacy.  Use
  2407 "typedef (open)" form instead, which will eventually become the
  2408 default.
  2409 
  2410 * Record: code generation can be switched off manually with
  2411 
  2412   declare [[record_coden = false]]  -- "default true"
  2413 
  2414 * Datatype: type parameters allow explicit sort constraints.
  2415 
  2416 * Concrete syntax for case expressions includes constraints for source
  2417 positions, and thus produces Prover IDE markup for its bindings.
  2418 INCOMPATIBILITY for old-style syntax translations that augment the
  2419 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
  2420 one_case.
  2421 
  2422 * Clarified attribute "mono_set": pure declaration without modifying
  2423 the result of the fact expression.
  2424 
  2425 * More default pred/set conversions on a couple of relation operations
  2426 and predicates.  Added powers of predicate relations.  Consolidation
  2427 of some relation theorems:
  2428 
  2429   converse_def ~> converse_unfold
  2430   rel_comp_def ~> relcomp_unfold
  2431   symp_def ~> (modified, use symp_def and sym_def instead)
  2432   transp_def ~> transp_trans
  2433   Domain_def ~> Domain_unfold
  2434   Range_def ~> Domain_converse [symmetric]
  2435 
  2436 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
  2437 
  2438 See theory "Relation" for examples for making use of pred/set
  2439 conversions by means of attributes "to_set" and "to_pred".
  2440 
  2441 INCOMPATIBILITY.
  2442 
  2443 * Renamed facts about the power operation on relations, i.e., relpow
  2444 to match the constant's name:
  2445 
  2446   rel_pow_1 ~> relpow_1
  2447   rel_pow_0_I ~> relpow_0_I
  2448   rel_pow_Suc_I ~> relpow_Suc_I
  2449   rel_pow_Suc_I2 ~> relpow_Suc_I2
  2450   rel_pow_0_E ~> relpow_0_E
  2451   rel_pow_Suc_E ~> relpow_Suc_E
  2452   rel_pow_E ~> relpow_E
  2453   rel_pow_Suc_D2 ~> relpow_Suc_D2
  2454   rel_pow_Suc_E2 ~> relpow_Suc_E2
  2455   rel_pow_Suc_D2' ~> relpow_Suc_D2'
  2456   rel_pow_E2 ~> relpow_E2
  2457   rel_pow_add ~> relpow_add
  2458   rel_pow_commute ~> relpow
  2459   rel_pow_empty ~> relpow_empty:
  2460   rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
  2461   rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
  2462   rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
  2463   rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
  2464   rel_pow_fun_conv ~> relpow_fun_conv
  2465   rel_pow_finite_bounded1 ~> relpow_finite_bounded1
  2466   rel_pow_finite_bounded ~> relpow_finite_bounded
  2467   rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
  2468   trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
  2469   single_valued_rel_pow ~> single_valued_relpow
  2470 
  2471 INCOMPATIBILITY.
  2472 
  2473 * Theory Relation: Consolidated constant name for relation composition
  2474 and corresponding theorem names:
  2475 
  2476   - Renamed constant rel_comp to relcomp.
  2477 
  2478   - Dropped abbreviation pred_comp. Use relcompp instead.
  2479 
  2480   - Renamed theorems:
  2481 
  2482     rel_compI ~> relcompI
  2483     rel_compEpair ~> relcompEpair
  2484     rel_compE ~> relcompE
  2485     pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
  2486     rel_comp_empty1 ~> relcomp_empty1
  2487     rel_comp_mono ~> relcomp_mono
  2488     rel_comp_subset_Sigma ~> relcomp_subset_Sigma
  2489     rel_comp_distrib ~> relcomp_distrib
  2490     rel_comp_distrib2 ~> relcomp_distrib2
  2491     rel_comp_UNION_distrib ~> relcomp_UNION_distrib
  2492     rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
  2493     single_valued_rel_comp ~> single_valued_relcomp
  2494     rel_comp_def ~> relcomp_unfold
  2495     converse_rel_comp ~> converse_relcomp
  2496     pred_compI ~> relcomppI
  2497     pred_compE ~> relcomppE
  2498     pred_comp_bot1 ~> relcompp_bot1
  2499     pred_comp_bot2 ~> relcompp_bot2
  2500     transp_pred_comp_less_eq ~> transp_relcompp_less_eq
  2501     pred_comp_mono ~> relcompp_mono
  2502     pred_comp_distrib ~> relcompp_distrib
  2503     pred_comp_distrib2 ~> relcompp_distrib2
  2504     converse_pred_comp ~> converse_relcompp
  2505 
  2506     finite_rel_comp ~> finite_relcomp
  2507 
  2508     set_rel_comp ~> set_relcomp
  2509 
  2510 INCOMPATIBILITY.
  2511 
  2512 * Theory Divides: Discontinued redundant theorems about div and mod.
  2513 INCOMPATIBILITY, use the corresponding generic theorems instead.
  2514 
  2515   DIVISION_BY_ZERO ~> div_by_0, mod_by_0
  2516   zdiv_self ~> div_self
  2517   zmod_self ~> mod_self
  2518   zdiv_zero ~> div_0
  2519   zmod_zero ~> mod_0
  2520   zdiv_zmod_equality ~> div_mod_equality2
  2521   zdiv_zmod_equality2 ~> div_mod_equality
  2522   zmod_zdiv_trivial ~> mod_div_trivial
  2523   zdiv_zminus_zminus ~> div_minus_minus
  2524   zmod_zminus_zminus ~> mod_minus_minus
  2525   zdiv_zminus2 ~> div_minus_right
  2526   zmod_zminus2 ~> mod_minus_right
  2527   zdiv_minus1_right ~> div_minus1_right
  2528   zmod_minus1_right ~> mod_minus1_right
  2529   zdvd_mult_div_cancel ~> dvd_mult_div_cancel
  2530   zmod_zmult1_eq ~> mod_mult_right_eq
  2531   zpower_zmod ~> power_mod
  2532   zdvd_zmod ~> dvd_mod
  2533   zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
  2534   mod_mult_distrib ~> mult_mod_left
  2535   mod_mult_distrib2 ~> mult_mod_right
  2536 
  2537 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
  2538 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
  2539 
  2540 * Finite_Set.fold now qualified.  INCOMPATIBILITY.
  2541 
  2542 * Consolidated theorem names concerning fold combinators:
  2543 
  2544   inf_INFI_fold_inf ~> inf_INF_fold_inf
  2545   sup_SUPR_fold_sup ~> sup_SUP_fold_sup
  2546   INFI_fold_inf ~> INF_fold_inf
  2547   SUPR_fold_sup ~> SUP_fold_sup
  2548   union_set ~> union_set_fold
  2549   minus_set ~> minus_set_fold
  2550   INFI_set_fold ~> INF_set_fold
  2551   SUPR_set_fold ~> SUP_set_fold
  2552   INF_code ~> INF_set_foldr
  2553   SUP_code ~> SUP_set_foldr
  2554   foldr.simps ~> foldr.simps (in point-free formulation)
  2555   foldr_fold_rev ~> foldr_conv_fold
  2556   foldl_fold ~> foldl_conv_fold
  2557   foldr_foldr ~> foldr_conv_foldl
  2558   foldl_foldr ~> foldl_conv_foldr
  2559   fold_set_remdups ~> fold_set_fold_remdups
  2560   fold_set ~> fold_set_fold
  2561   fold1_set ~> fold1_set_fold
  2562 
  2563 INCOMPATIBILITY.
  2564 
  2565 * Dropped rarely useful theorems concerning fold combinators:
  2566 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
  2567 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
  2568 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
  2569 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
  2570 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
  2571 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
  2572 INCOMPATIBILITY.  For the common phrases "%xs. List.foldr plus xs 0"
  2573 and "List.foldl plus 0", prefer "List.listsum".  Otherwise it can be
  2574 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
  2575 unfolding "foldr_conv_fold" and "foldl_conv_fold".
  2576 
  2577 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
  2578 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
  2579 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
  2580 INF_set_foldr, SUP_set_foldr.  INCOMPATIBILITY.  Prefer corresponding
  2581 lemmas over fold rather than foldr, or make use of lemmas
  2582 fold_conv_foldr and fold_rev.
  2583 
  2584 * Congruence rules Option.map_cong and Option.bind_cong for recursion
  2585 through option types.
  2586 
  2587 * "Transitive_Closure.ntrancl": bounded transitive closure on
  2588 relations.
  2589 
  2590 * Constant "Set.not_member" now qualified.  INCOMPATIBILITY.
  2591 
  2592 * Theory Int: Discontinued many legacy theorems specific to type int.
  2593 INCOMPATIBILITY, use the corresponding generic theorems instead.
  2594 
  2595   zminus_zminus ~> minus_minus
  2596   zminus_0 ~> minus_zero
  2597   zminus_zadd_distrib ~> minus_add_distrib
  2598   zadd_commute ~> add_commute
  2599   zadd_assoc ~> add_assoc
  2600   zadd_left_commute ~> add_left_commute
  2601   zadd_ac ~> add_ac
  2602   zmult_ac ~> mult_ac
  2603   zadd_0 ~> add_0_left
  2604   zadd_0_right ~> add_0_right
  2605   zadd_zminus_inverse2 ~> left_minus
  2606   zmult_zminus ~> mult_minus_left
  2607   zmult_commute ~> mult_commute
  2608   zmult_assoc ~> mult_assoc
  2609   zadd_zmult_distrib ~> left_distrib
  2610   zadd_zmult_distrib2 ~> right_distrib
  2611   zdiff_zmult_distrib ~> left_diff_distrib
  2612   zdiff_zmult_distrib2 ~> right_diff_distrib
  2613   zmult_1 ~> mult_1_left
  2614   zmult_1_right ~> mult_1_right
  2615   zle_refl ~> order_refl
  2616   zle_trans ~> order_trans
  2617   zle_antisym ~> order_antisym
  2618   zle_linear ~> linorder_linear
  2619   zless_linear ~> linorder_less_linear
  2620   zadd_left_mono ~> add_left_mono
  2621   zadd_strict_right_mono ~> add_strict_right_mono
  2622   zadd_zless_mono ~> add_less_le_mono
  2623   int_0_less_1 ~> zero_less_one
  2624   int_0_neq_1 ~> zero_neq_one
  2625   zless_le ~> less_le
  2626   zpower_zadd_distrib ~> power_add
  2627   zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
  2628   zero_le_zpower_abs ~> zero_le_power_abs
  2629 
  2630 * Theory Deriv: Renamed
  2631 
  2632   DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
  2633 
  2634 * Theory Library/Multiset: Improved code generation of multisets.
  2635 
  2636 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
  2637 are expressed via type classes again. The special syntax
  2638 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
  2639 setsum_set, which is now subsumed by Big_Operators.setsum.
  2640 INCOMPATIBILITY.
  2641 
  2642 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
  2643 use theory HOL/Library/Nat_Bijection instead.
  2644 
  2645 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
  2646 trees is now inside a type class context.  Names of affected
  2647 operations and lemmas have been prefixed by rbt_.  INCOMPATIBILITY for
  2648 theories working directly with raw red-black trees, adapt the names as
  2649 follows:
  2650 
  2651   Operations:
  2652   bulkload -> rbt_bulkload
  2653   del_from_left -> rbt_del_from_left
  2654   del_from_right -> rbt_del_from_right
  2655   del -> rbt_del
  2656   delete -> rbt_delete
  2657   ins -> rbt_ins
  2658   insert -> rbt_insert
  2659   insertw -> rbt_insert_with
  2660   insert_with_key -> rbt_insert_with_key
  2661   map_entry -> rbt_map_entry
  2662   lookup -> rbt_lookup
  2663   sorted -> rbt_sorted
  2664   tree_greater -> rbt_greater
  2665   tree_less -> rbt_less
  2666   tree_less_symbol -> rbt_less_symbol
  2667   union -> rbt_union
  2668   union_with -> rbt_union_with
  2669   union_with_key -> rbt_union_with_key
  2670 
  2671   Lemmas:
  2672   balance_left_sorted -> balance_left_rbt_sorted
  2673   balance_left_tree_greater -> balance_left_rbt_greater
  2674   balance_left_tree_less -> balance_left_rbt_less
  2675   balance_right_sorted -> balance_right_rbt_sorted
  2676   balance_right_tree_greater -> balance_right_rbt_greater
  2677   balance_right_tree_less -> balance_right_rbt_less
  2678   balance_sorted -> balance_rbt_sorted
  2679   balance_tree_greater -> balance_rbt_greater
  2680   balance_tree_less -> balance_rbt_less
  2681   bulkload_is_rbt -> rbt_bulkload_is_rbt
  2682   combine_sorted -> combine_rbt_sorted
  2683   combine_tree_greater -> combine_rbt_greater
  2684   combine_tree_less -> combine_rbt_less
  2685   delete_in_tree -> rbt_delete_in_tree
  2686   delete_is_rbt -> rbt_delete_is_rbt
  2687   del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
  2688   del_from_left_tree_less -> rbt_del_from_left_rbt_less
  2689   del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
  2690   del_from_right_tree_less -> rbt_del_from_right_rbt_less
  2691   del_in_tree -> rbt_del_in_tree
  2692   del_inv1_inv2 -> rbt_del_inv1_inv2
  2693   del_sorted -> rbt_del_rbt_sorted
  2694   del_tree_greater -> rbt_del_rbt_greater
  2695   del_tree_less -> rbt_del_rbt_less
  2696   dom_lookup_Branch -> dom_rbt_lookup_Branch
  2697   entries_lookup -> entries_rbt_lookup
  2698   finite_dom_lookup -> finite_dom_rbt_lookup
  2699   insert_sorted -> rbt_insert_rbt_sorted
  2700   insertw_is_rbt -> rbt_insertw_is_rbt
  2701   insertwk_is_rbt -> rbt_insertwk_is_rbt
  2702   insertwk_sorted -> rbt_insertwk_rbt_sorted
  2703   insertw_sorted -> rbt_insertw_rbt_sorted
  2704   ins_sorted -> ins_rbt_sorted
  2705   ins_tree_greater -> ins_rbt_greater
  2706   ins_tree_less -> ins_rbt_less
  2707   is_rbt_sorted -> is_rbt_rbt_sorted
  2708   lookup_balance -> rbt_lookup_balance
  2709   lookup_bulkload -> rbt_lookup_rbt_bulkload
  2710   lookup_delete -> rbt_lookup_rbt_delete
  2711   lookup_Empty -> rbt_lookup_Empty
  2712   lookup_from_in_tree -> rbt_lookup_from_in_tree
  2713   lookup_in_tree -> rbt_lookup_in_tree
  2714   lookup_ins -> rbt_lookup_ins
  2715   lookup_insert -> rbt_lookup_rbt_insert
  2716   lookup_insertw -> rbt_lookup_rbt_insertw
  2717   lookup_insertwk -> rbt_lookup_rbt_insertwk
  2718   lookup_keys -> rbt_lookup_keys
  2719   lookup_map -> rbt_lookup_map
  2720   lookup_map_entry -> rbt_lookup_rbt_map_entry
  2721   lookup_tree_greater -> rbt_lookup_rbt_greater
  2722   lookup_tree_less -> rbt_lookup_rbt_less
  2723   lookup_union -> rbt_lookup_rbt_union
  2724   map_entry_color_of -> rbt_map_entry_color_of
  2725   map_entry_inv1 -> rbt_map_entry_inv1
  2726   map_entry_inv2 -> rbt_map_entry_inv2
  2727   map_entry_is_rbt -> rbt_map_entry_is_rbt
  2728   map_entry_sorted -> rbt_map_entry_rbt_sorted
  2729   map_entry_tree_greater -> rbt_map_entry_rbt_greater
  2730   map_entry_tree_less -> rbt_map_entry_rbt_less
  2731   map_tree_greater -> map_rbt_greater
  2732   map_tree_less -> map_rbt_less
  2733   map_sorted -> map_rbt_sorted
  2734   paint_sorted -> paint_rbt_sorted
  2735   paint_lookup -> paint_rbt_lookup
  2736   paint_tree_greater -> paint_rbt_greater
  2737   paint_tree_less -> paint_rbt_less
  2738   sorted_entries -> rbt_sorted_entries
  2739   tree_greater_eq_trans -> rbt_greater_eq_trans
  2740   tree_greater_nit -> rbt_greater_nit
  2741   tree_greater_prop -> rbt_greater_prop
  2742   tree_greater_simps -> rbt_greater_simps
  2743   tree_greater_trans -> rbt_greater_trans
  2744   tree_less_eq_trans -> rbt_less_eq_trans
  2745   tree_less_nit -> rbt_less_nit
  2746   tree_less_prop -> rbt_less_prop
  2747   tree_less_simps -> rbt_less_simps
  2748   tree_less_trans -> rbt_less_trans
  2749   tree_ord_props -> rbt_ord_props
  2750   union_Branch -> rbt_union_Branch
  2751   union_is_rbt -> rbt_union_is_rbt
  2752   unionw_is_rbt -> rbt_unionw_is_rbt
  2753   unionwk_is_rbt -> rbt_unionwk_is_rbt
  2754   unionwk_sorted -> rbt_unionwk_rbt_sorted
  2755 
  2756 * Theory HOL/Library/Float: Floating point numbers are now defined as
  2757 a subset of the real numbers.  All operations are defined using the
  2758 lifing-framework and proofs use the transfer method.  INCOMPATIBILITY.
  2759 
  2760   Changed Operations:
  2761   float_abs -> abs
  2762   float_nprt -> nprt
  2763   float_pprt -> pprt
  2764   pow2 -> use powr
  2765   round_down -> float_round_down
  2766   round_up -> float_round_up
  2767   scale -> exponent
  2768 
  2769   Removed Operations:
  2770   ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
  2771 
  2772   Renamed Lemmas:
  2773   abs_float_def -> Float.compute_float_abs
  2774   bitlen_ge0 -> bitlen_nonneg
  2775   bitlen.simps -> Float.compute_bitlen
  2776   float_components -> Float_mantissa_exponent
  2777   float_divl.simps -> Float.compute_float_divl
  2778   float_divr.simps -> Float.compute_float_divr
  2779   float_eq_odd -> mult_powr_eq_mult_powr_iff
  2780   float_power -> real_of_float_power
  2781   lapprox_posrat_def -> Float.compute_lapprox_posrat
  2782   lapprox_rat.simps -> Float.compute_lapprox_rat
  2783   le_float_def' -> Float.compute_float_le
  2784   le_float_def -> less_eq_float.rep_eq
  2785   less_float_def' -> Float.compute_float_less
  2786   less_float_def -> less_float.rep_eq
  2787   normfloat_def -> Float.compute_normfloat
  2788   normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
  2789   normfloat -> normfloat_def
  2790   normfloat_unique -> use normfloat_def
  2791   number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
  2792   one_float_def -> Float.compute_float_one
  2793   plus_float_def -> Float.compute_float_plus
  2794   rapprox_posrat_def -> Float.compute_rapprox_posrat
  2795   rapprox_rat.simps -> Float.compute_rapprox_rat
  2796   real_of_float_0 -> zero_float.rep_eq
  2797   real_of_float_1 -> one_float.rep_eq
  2798   real_of_float_abs -> abs_float.rep_eq
  2799   real_of_float_add -> plus_float.rep_eq
  2800   real_of_float_minus -> uminus_float.rep_eq
  2801   real_of_float_mult -> times_float.rep_eq
  2802   real_of_float_simp -> Float.rep_eq
  2803   real_of_float_sub -> minus_float.rep_eq
  2804   round_down.simps -> Float.compute_float_round_down
  2805   round_up.simps -> Float.compute_float_round_up
  2806   times_float_def -> Float.compute_float_times
  2807   uminus_float_def -> Float.compute_float_uminus
  2808   zero_float_def -> Float.compute_float_zero
  2809 
  2810   Lemmas not necessary anymore, use the transfer method:
  2811   bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
  2812   float_divr, float_le_simp, float_less1_mantissa_bound,
  2813   float_less_simp, float_less_zero, float_le_zero,
  2814   float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
  2815   floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
  2816   lapprox_rat_bottom, normalized_float, rapprox_posrat,
  2817   rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
  2818   real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
  2819   round_up, zero_le_float, zero_less_float
  2820 
  2821 * New theory HOL/Library/DAList provides an abstract type for
  2822 association lists with distinct keys.
  2823 
  2824 * Session HOL/IMP: Added new theory of abstract interpretation of
  2825 annotated commands.
  2826 
  2827 * Session HOL-Import: Re-implementation from scratch is faster,
  2828 simpler, and more scalable.  Requires a proof bundle, which is
  2829 available as an external component.  Discontinued old (and mostly
  2830 dead) Importer for HOL4 and HOL Light.  INCOMPATIBILITY.
  2831 
  2832 * Session HOL-Word: Discontinued many redundant theorems specific to
  2833 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
  2834 instead.
  2835 
  2836   word_sub_alt ~> word_sub_wi
  2837   word_add_alt ~> word_add_def
  2838   word_mult_alt ~> word_mult_def
  2839   word_minus_alt ~> word_minus_def
  2840   word_0_alt ~> word_0_wi
  2841   word_1_alt ~> word_1_wi
  2842   word_add_0 ~> add_0_left
  2843   word_add_0_right ~> add_0_right
  2844   word_mult_1 ~> mult_1_left
  2845   word_mult_1_right ~> mult_1_right
  2846   word_add_commute ~> add_commute
  2847   word_add_assoc ~> add_assoc
  2848   word_add_left_commute ~> add_left_commute
  2849   word_mult_commute ~> mult_commute
  2850   word_mult_assoc ~> mult_assoc
  2851   word_mult_left_commute ~> mult_left_commute
  2852   word_left_distrib ~> left_distrib
  2853   word_right_distrib ~> right_distrib
  2854   word_left_minus ~> left_minus
  2855   word_diff_0_right ~> diff_0_right
  2856   word_diff_self ~> diff_self
  2857   word_sub_def ~> diff_minus
  2858   word_diff_minus ~> diff_minus
  2859   word_add_ac ~> add_ac
  2860   word_mult_ac ~> mult_ac
  2861   word_plus_ac0 ~> add_0_left add_0_right add_ac
  2862   word_times_ac1 ~> mult_1_left mult_1_right mult_ac
  2863   word_order_trans ~> order_trans
  2864   word_order_refl ~> order_refl
  2865   word_order_antisym ~> order_antisym
  2866   word_order_linear ~> linorder_linear
  2867   lenw1_zero_neq_one ~> zero_neq_one
  2868   word_number_of_eq ~> number_of_eq
  2869   word_of_int_add_hom ~> wi_hom_add
  2870   word_of_int_sub_hom ~> wi_hom_sub
  2871   word_of_int_mult_hom ~> wi_hom_mult
  2872   word_of_int_minus_hom ~> wi_hom_neg
  2873   word_of_int_succ_hom ~> wi_hom_succ
  2874   word_of_int_pred_hom ~> wi_hom_pred
  2875   word_of_int_0_hom ~> word_0_wi
  2876   word_of_int_1_hom ~> word_1_wi
  2877 
  2878 * Session HOL-Word: New proof method "word_bitwise" for splitting
  2879 machine word equalities and inequalities into logical circuits,
  2880 defined in HOL/Word/WordBitwise.thy.  Supports addition, subtraction,
  2881 multiplication, shifting by constants, bitwise operators and numeric
  2882 constants.  Requires fixed-length word types, not 'a word.  Solves
  2883 many standard word identities outright and converts more into first
  2884 order problems amenable to blast or similar.  See also examples in
  2885 HOL/Word/Examples/WordExamples.thy.
  2886 
  2887 * Session HOL-Probability: Introduced the type "'a measure" to
  2888 represent measures, this replaces the records 'a algebra and 'a
  2889 measure_space.  The locales based on subset_class now have two
  2890 locale-parameters the space \<Omega> and the set of measurable sets M.
  2891 The product of probability spaces uses now the same constant as the
  2892 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
  2893 measure".  Most constants are defined now outside of locales and gain
  2894 an additional parameter, like null_sets, almost_eventually or \<mu>'.
  2895 Measure space constructions for distributions and densities now got
  2896 their own constants distr and density.  Instead of using locales to
  2897 describe measure spaces with a finite space, the measure count_space
  2898 and point_measure is introduced.  INCOMPATIBILITY.
  2899 
  2900   Renamed constants:
  2901   measure -> emeasure
  2902   finite_measure.\<mu>' -> measure
  2903   product_algebra_generator -> prod_algebra
  2904   product_prob_space.emb -> prod_emb
  2905   product_prob_space.infprod_algebra -> PiM
  2906 
  2907   Removed locales:
  2908   completeable_measure_space
  2909   finite_measure_space
  2910   finite_prob_space
  2911   finite_product_finite_prob_space
  2912   finite_product_sigma_algebra
  2913   finite_sigma_algebra
  2914   measure_space
  2915   pair_finite_prob_space
  2916   pair_finite_sigma_algebra
  2917   pair_finite_space
  2918   pair_sigma_algebra
  2919   product_sigma_algebra
  2920 
  2921   Removed constants:
  2922   conditional_space
  2923   distribution -> use distr measure, or distributed predicate
  2924   image_space
  2925   joint_distribution -> use distr measure, or distributed predicate
  2926   pair_measure_generator
  2927   product_prob_space.infprod_algebra -> use PiM
  2928   subvimage
  2929 
  2930   Replacement theorems:
  2931   finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
  2932   finite_measure.empty_measure -> measure_empty
  2933   finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
  2934   finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
  2935   finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
  2936   finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
  2937   finite_measure.finite_measure -> finite_measure.emeasure_finite
  2938   finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
  2939   finite_measure.positive_measure' -> measure_nonneg
  2940   finite_measure.real_measure -> finite_measure.emeasure_real
  2941   finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
  2942   finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
  2943   finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
  2944   information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
  2945   information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
  2946   information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
  2947   information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
  2948   information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
  2949   information_space.entropy_commute -> information_space.entropy_commute_simple
  2950   information_space.entropy_eq -> information_space.entropy_simple_distributed
  2951   information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
  2952   information_space.entropy_positive -> information_space.entropy_nonneg_simple
  2953   information_space.entropy_uniform_max -> information_space.entropy_uniform
  2954   information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
  2955   information_space.KL_eq_0 -> information_space.KL_same_eq_0
  2956   information_space.KL_ge_0 -> information_space.KL_nonneg
  2957   information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
  2958   information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
  2959   Int_stable_cuboids -> Int_stable_atLeastAtMost
  2960   Int_stable_product_algebra_generator -> positive_integral
  2961   measure_preserving -> equality "distr M N f = N" "f : measurable M N"
  2962   measure_space.additive -> emeasure_additive
  2963   measure_space.AE_iff_null_set -> AE_iff_null
  2964   measure_space.almost_everywhere_def -> eventually_ae_filter
  2965   measure_space.almost_everywhere_vimage -> AE_distrD
  2966   measure_space.continuity_from_above -> INF_emeasure_decseq
  2967   measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
  2968   measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
  2969   measure_space.continuity_from_below -> SUP_emeasure_incseq
  2970   measure_space_density -> emeasure_density
  2971   measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
  2972   measure_space.integrable_vimage -> integrable_distr
  2973   measure_space.integral_translated_density -> integral_density
  2974   measure_space.integral_vimage -> integral_distr
  2975   measure_space.measure_additive -> plus_emeasure
  2976   measure_space.measure_compl -> emeasure_compl
  2977   measure_space.measure_countable_increasing -> emeasure_countable_increasing
  2978   measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
  2979   measure_space.measure_decseq -> decseq_emeasure
  2980   measure_space.measure_Diff -> emeasure_Diff
  2981   measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
  2982   measure_space.measure_eq_0 -> emeasure_eq_0
  2983   measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
  2984   measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
  2985   measure_space.measure_incseq -> incseq_emeasure
  2986   measure_space.measure_insert -> emeasure_insert
  2987   measure_space.measure_mono -> emeasure_mono
  2988   measure_space.measure_not_negative -> emeasure_not_MInf
  2989   measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
  2990   measure_space.measure_setsum -> setsum_emeasure
  2991   measure_space.measure_setsum_split -> setsum_emeasure_cover
  2992   measure_space.measure_space_vimage -> emeasure_distr
  2993   measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
  2994   measure_space.measure_subadditive -> subadditive
  2995   measure_space.measure_top -> emeasure_space
  2996   measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
  2997   measure_space.measure_Un_null_set -> emeasure_Un_null_set
  2998   measure_space.positive_integral_translated_density -> positive_integral_density
  2999   measure_space.positive_integral_vimage -> positive_integral_distr
  3000   measure_space.real_continuity_from_above -> Lim_measure_decseq
  3001   measure_space.real_continuity_from_below -> Lim_measure_incseq
  3002   measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
  3003   measure_space.real_measure_Diff -> measure_Diff
  3004   measure_space.real_measure_finite_Union -> measure_finite_Union
  3005   measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
  3006   measure_space.real_measure_subadditive -> measure_subadditive
  3007   measure_space.real_measure_Union -> measure_Union
  3008   measure_space.real_measure_UNION -> measure_UNION
  3009   measure_space.simple_function_vimage -> simple_function_comp
  3010   measure_space.simple_integral_vimage -> simple_integral_distr
  3011   measure_space.simple_integral_vimage -> simple_integral_distr
  3012   measure_unique_Int_stable -> measure_eqI_generator_eq
  3013   measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
  3014   pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
  3015   pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
  3016   pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
  3017   pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
  3018   pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
  3019   pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
  3020   pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
  3021   pair_sigma_algebra.sets_swap -> sets_pair_swap
  3022   pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
  3023   pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
  3024   pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
  3025   pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
  3026   pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
  3027   pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
  3028   prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
  3029   prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
  3030   prob_space.measure_space_1 -> prob_space.emeasure_space_1
  3031   prob_space.prob_space_vimage -> prob_space_distr
  3032   prob_space.random_variable_restrict -> measurable_restrict
  3033   prob_space_unique_Int_stable -> measure_eqI_prob_space
  3034   product_algebraE -> prod_algebraE_all
  3035   product_algebra_generator_der -> prod_algebra_eq_finite
  3036   product_algebra_generator_into_space -> prod_algebra_sets_into_space
  3037   product_algebraI -> sets_PiM_I_finite
  3038   product_measure_exists -> product_sigma_finite.sigma_finite
  3039   product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
  3040   product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
  3041   product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
  3042   product_prob_space.measurable_component -> measurable_component_singleton
  3043   product_prob_space.measurable_emb -> measurable_prod_emb
  3044   product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
  3045   product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
  3046   product_prob_space.measure_emb -> emeasure_prod_emb
  3047   product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
  3048   product_sigma_algebra.product_algebra_into_space -> space_closed
  3049   product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
  3050   product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
  3051   product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
  3052   sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
  3053   sets_product_algebra -> sets_PiM
  3054   sigma_algebra.measurable_sigma -> measurable_measure_of
  3055   sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
  3056   sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
  3057   sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
  3058   space_product_algebra -> space_PiM
  3059 
  3060 * Session HOL-TPTP: support to parse and import TPTP problems (all
  3061 languages) into Isabelle/HOL.
  3062 
  3063 
  3064 *** FOL ***
  3065 
  3066 * New "case_product" attribute (see HOL).
  3067 
  3068 
  3069 *** ZF ***
  3070 
  3071 * Greater support for structured proofs involving induction or case
  3072 analysis.
  3073 
  3074 * Much greater use of mathematical symbols.
  3075 
  3076 * Removal of many ML theorem bindings.  INCOMPATIBILITY.
  3077 
  3078 
  3079 *** ML ***
  3080 
  3081 * Antiquotation @{keyword "name"} produces a parser for outer syntax
  3082 from a minor keyword introduced via theory header declaration.
  3083 
  3084 * Antiquotation @{command_spec "name"} produces the
  3085 Outer_Syntax.command_spec from a major keyword introduced via theory
  3086 header declaration; it can be passed to Outer_Syntax.command etc.
  3087 
  3088 * Local_Theory.define no longer hard-wires default theorem name
  3089 "foo_def", but retains the binding as given.  If that is Binding.empty
  3090 / Attrib.empty_binding, the result is not registered as user-level
  3091 fact.  The Local_Theory.define_internal variant allows to specify a
  3092 non-empty name (used for the foundation in the background theory),
  3093 while omitting the fact binding in the user-context.  Potential
  3094 INCOMPATIBILITY for derived definitional packages: need to specify
  3095 naming policy for primitive definitions more explicitly.
  3096 
  3097 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
  3098 conformance with similar operations in structure Term and Logic.
  3099 
  3100 * Antiquotation @{attributes [...]} embeds attribute source
  3101 representation into the ML text, which is particularly useful with
  3102 declarations like Local_Theory.note.
  3103 
  3104 * Structure Proof_Context follows standard naming scheme.  Old
  3105 ProofContext has been discontinued.  INCOMPATIBILITY.
  3106 
  3107 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
  3108 change of semantics: update is applied to auxiliary local theory
  3109 context as well.
  3110 
  3111 * Modernized some old-style infix operations:
  3112 
  3113   addeqcongs    ~> Simplifier.add_eqcong
  3114   deleqcongs    ~> Simplifier.del_eqcong
  3115   addcongs      ~> Simplifier.add_cong
  3116   delcongs      ~> Simplifier.del_cong
  3117   setmksimps    ~> Simplifier.set_mksimps
  3118   setmkcong     ~> Simplifier.set_mkcong
  3119   setmksym      ~> Simplifier.set_mksym
  3120   setmkeqTrue   ~> Simplifier.set_mkeqTrue
  3121   settermless   ~> Simplifier.set_termless
  3122   setsubgoaler  ~> Simplifier.set_subgoaler
  3123   addsplits     ~> Splitter.add_split
  3124   delsplits     ~> Splitter.del_split
  3125 
  3126 
  3127 *** System ***
  3128 
  3129 * USER_HOME settings variable points to cross-platform user home
  3130 directory, which coincides with HOME on POSIX systems only.  Likewise,
  3131 the Isabelle path specification "~" now expands to $USER_HOME, instead
  3132 of former $HOME.  A different default for USER_HOME may be set
  3133 explicitly in shell environment, before Isabelle settings are
  3134 evaluated.  Minor INCOMPATIBILITY: need to adapt Isabelle path where
  3135 the generic user home was intended.
  3136 
  3137 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
  3138 notation, which is useful for the jEdit file browser, for example.
  3139 
  3140 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
  3141 (not just JRE).
  3142 
  3143 
  3144 
  3145 New in Isabelle2011-1 (October 2011)
  3146 ------------------------------------
  3147 
  3148 *** General ***
  3149 
  3150 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
  3151 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
  3152 
  3153   - Management of multiple theory files directly from the editor
  3154     buffer store -- bypassing the file-system (no requirement to save
  3155     files for checking).
  3156 
  3157   - Markup of formal entities within the text buffer, with semantic
  3158     highlighting, tooltips and hyperlinks to jump to defining source
  3159     positions.
  3160 
  3161   - Improved text rendering, with sub/superscripts in the source
  3162     buffer (including support for copy/paste wrt. output panel, HTML
  3163     theory output and other non-Isabelle text boxes).
  3164 
  3165   - Refined scheduling of proof checking and printing of results,
  3166     based on interactive editor view.  (Note: jEdit folding and
  3167     narrowing allows to restrict buffer perspectives explicitly.)
  3168 
  3169   - Reduced CPU performance requirements, usable on machines with few
  3170     cores.
  3171 
  3172   - Reduced memory requirements due to pruning of unused document
  3173     versions (garbage collection).
  3174 
  3175 See also ~~/src/Tools/jEdit/README.html for further information,
  3176 including some remaining limitations.
  3177 
  3178 * Theory loader: source files are exclusively located via the master
  3179 directory of each theory node (where the .thy file itself resides).
  3180 The global load path (such as src/HOL/Library) has been discontinued.
  3181 Note that the path element ~~ may be used to reference theories in the
  3182 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
  3183 INCOMPATIBILITY.
  3184 
  3185 * Theory loader: source files are identified by content via SHA1
  3186 digests.  Discontinued former path/modtime identification and optional
  3187 ISABELLE_FILE_IDENT plugin scripts.
  3188 
  3189 * Parallelization of nested Isar proofs is subject to
  3190 Goal.parallel_proofs_threshold (default 100).  See also isabelle
  3191 usedir option -Q.
  3192 
  3193 * Name space: former unsynchronized references are now proper
  3194 configuration options, with more conventional names:
  3195 
  3196   long_names   ~> names_long
  3197   short_names  ~> names_short
  3198   unique_names ~> names_unique
  3199 
  3200 Minor INCOMPATIBILITY, need to declare options in context like this:
  3201 
  3202   declare [[names_unique = false]]
  3203 
  3204 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`.  Note
  3205 that the result needs to be unique, which means fact specifications
  3206 may have to be refined after enriching a proof context.
  3207 
  3208 * Attribute "case_names" has been refined: the assumptions in each case
  3209 can be named now by following the case name with [name1 name2 ...].
  3210 
  3211 * Isabelle/Isar reference manual has been updated and extended:
  3212   - "Synopsis" provides a catalog of main Isar language concepts.
  3213   - Formal references in syntax diagrams, via @{rail} antiquotation.
  3214   - Updated material from classic "ref" manual, notably about
  3215     "Classical Reasoner".
  3216 
  3217 
  3218 *** HOL ***
  3219 
  3220 * Class bot and top require underlying partial order rather than
  3221 preorder: uniqueness of bot and top is guaranteed.  INCOMPATIBILITY.
  3222 
  3223 * Class complete_lattice: generalized a couple of lemmas from sets;
  3224 generalized theorems INF_cong and SUP_cong.  New type classes for
  3225 complete boolean algebras and complete linear orders.  Lemmas
  3226 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
  3227 class complete_linorder.
  3228 
  3229 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
  3230 Sup_fun_def, Inf_apply, Sup_apply.
  3231 
  3232 Removed redundant lemmas (the right hand side gives hints how to
  3233 replace them for (metis ...), or (simp only: ...) proofs):
  3234 
  3235   Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
  3236   Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
  3237   Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
  3238   Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
  3239   Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
  3240   Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
  3241   Inter_def ~> INF_def, image_def
  3242   Union_def ~> SUP_def, image_def
  3243   INT_eq ~> INF_def, and image_def
  3244   UN_eq ~> SUP_def, and image_def
  3245   INF_subset ~> INF_superset_mono [OF _ order_refl]
  3246 
  3247 More consistent and comprehensive names:
  3248 
  3249   INTER_eq_Inter_image ~> INF_def
  3250   UNION_eq_Union_image ~> SUP_def
  3251   INFI_def ~> INF_def
  3252   SUPR_def ~> SUP_def
  3253   INF_leI ~> INF_lower
  3254   INF_leI2 ~> INF_lower2
  3255   le_INFI ~> INF_greatest
  3256   le_SUPI ~> SUP_upper
  3257   le_SUPI2 ~> SUP_upper2
  3258   SUP_leI ~> SUP_least
  3259   INFI_bool_eq ~> INF_bool_eq
  3260   SUPR_bool_eq ~> SUP_bool_eq
  3261   INFI_apply ~> INF_apply
  3262   SUPR_apply ~> SUP_apply
  3263   INTER_def ~> INTER_eq
  3264   UNION_def ~> UNION_eq
  3265 
  3266 INCOMPATIBILITY.
  3267 
  3268 * Renamed theory Complete_Lattice to Complete_Lattices.
  3269 INCOMPATIBILITY.
  3270 
  3271 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
  3272 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
  3273 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
  3274 Sup_insert are now declared as [simp].  INCOMPATIBILITY.
  3275 
  3276 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
  3277 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
  3278 sup_inf_absob, sup_left_idem are now declared as [simp].  Minor
  3279 INCOMPATIBILITY.
  3280 
  3281 * Added syntactic classes "inf" and "sup" for the respective
  3282 constants.  INCOMPATIBILITY: Changes in the argument order of the
  3283 (mostly internal) locale predicates for some derived classes.
  3284 
  3285 * Theorem collections ball_simps and bex_simps do not contain theorems
  3286 referring to UNION any longer; these have been moved to collection
  3287 UN_ball_bex_simps.  INCOMPATIBILITY.
  3288 
  3289 * Theory Archimedean_Field: floor now is defined as parameter of a
  3290 separate type class floor_ceiling.
  3291 
  3292 * Theory Finite_Set: more coherent development of fold_set locales:
  3293 
  3294     locale fun_left_comm ~> locale comp_fun_commute
  3295     locale fun_left_comm_idem ~> locale comp_fun_idem
  3296 
  3297 Both use point-free characterization; interpretation proofs may need
  3298 adjustment.  INCOMPATIBILITY.
  3299 
  3300 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
  3301 accordance with standard mathematical terminology. INCOMPATIBILITY.
  3302 
  3303 * Theory Complex_Main: The locale interpretations for the
  3304 bounded_linear and bounded_bilinear locales have been removed, in
  3305 order to reduce the number of duplicate lemmas. Users must use the
  3306 original names for distributivity theorems, potential INCOMPATIBILITY.
  3307 
  3308   divide.add ~> add_divide_distrib
  3309   divide.diff ~> diff_divide_distrib
  3310   divide.setsum ~> setsum_divide_distrib
  3311   mult.add_right ~> right_distrib
  3312   mult.diff_right ~> right_diff_distrib
  3313   mult_right.setsum ~> setsum_right_distrib
  3314   mult_left.diff ~> left_diff_distrib
  3315 
  3316 * Theory Complex_Main: Several redundant theorems have been removed or
  3317 replaced by more general versions. INCOMPATIBILITY.
  3318 
  3319   real_diff_def ~> minus_real_def
  3320   real_divide_def ~> divide_real_def
  3321   real_less_def ~> less_le
  3322   real_abs_def ~> abs_real_def
  3323   real_sgn_def ~> sgn_real_def
  3324   real_mult_commute ~> mult_commute
  3325   real_mult_assoc ~> mult_assoc
  3326   real_mult_1 ~> mult_1_left
  3327   real_add_mult_distrib ~> left_distrib
  3328   real_zero_not_eq_one ~> zero_neq_one
  3329   real_mult_inverse_left ~> left_inverse
  3330   INVERSE_ZERO ~> inverse_zero
  3331   real_le_refl ~> order_refl
  3332   real_le_antisym ~> order_antisym
  3333   real_le_trans ~> order_trans
  3334   real_le_linear ~> linear
  3335   real_le_eq_diff ~> le_iff_diff_le_0
  3336   real_add_left_mono ~> add_left_mono
  3337   real_mult_order ~> mult_pos_pos
  3338   real_mult_less_mono2 ~> mult_strict_left_mono
  3339   real_of_int_real_of_nat ~> real_of_int_of_nat_eq
  3340   real_0_le_divide_iff ~> zero_le_divide_iff
  3341   realpow_two_disj ~> power2_eq_iff
  3342   real_squared_diff_one_factored ~> square_diff_one_factored
  3343   realpow_two_diff ~> square_diff_square_factored
  3344   reals_complete2 ~> complete_real
  3345   real_sum_squared_expand ~> power2_sum
  3346   exp_ln_eq ~> ln_unique
  3347   expi_add ~> exp_add
  3348   expi_zero ~> exp_zero
  3349   lemma_DERIV_subst ~> DERIV_cong
  3350   LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
  3351   LIMSEQ_const ~> tendsto_const
  3352   LIMSEQ_norm ~> tendsto_norm
  3353   LIMSEQ_add ~> tendsto_add
  3354   LIMSEQ_minus ~> tendsto_minus
  3355   LIMSEQ_minus_cancel ~> tendsto_minus_cancel
  3356   LIMSEQ_diff ~> tendsto_diff
  3357   bounded_linear.LIMSEQ ~> bounded_linear.tendsto
  3358   bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
  3359   LIMSEQ_mult ~> tendsto_mult
  3360   LIMSEQ_inverse ~> tendsto_inverse
  3361   LIMSEQ_divide ~> tendsto_divide
  3362   LIMSEQ_pow ~> tendsto_power
  3363   LIMSEQ_setsum ~> tendsto_setsum
  3364   LIMSEQ_setprod ~> tendsto_setprod
  3365   LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
  3366   LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
  3367   LIMSEQ_imp_rabs ~> tendsto_rabs
  3368   LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
  3369   LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
  3370   LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
  3371   LIMSEQ_Complex ~> tendsto_Complex
  3372   LIM_ident ~> tendsto_ident_at
  3373   LIM_const ~> tendsto_const
  3374   LIM_add ~> tendsto_add
  3375   LIM_add_zero ~> tendsto_add_zero
  3376   LIM_minus ~> tendsto_minus
  3377   LIM_diff ~> tendsto_diff
  3378   LIM_norm ~> tendsto_norm
  3379   LIM_norm_zero ~> tendsto_norm_zero
  3380   LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
  3381   LIM_norm_zero_iff ~> tendsto_norm_zero_iff
  3382   LIM_rabs ~> tendsto_rabs
  3383   LIM_rabs_zero ~> tendsto_rabs_zero
  3384   LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
  3385   LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
  3386   LIM_compose ~> tendsto_compose
  3387   LIM_mult ~> tendsto_mult
  3388   LIM_scaleR ~> tendsto_scaleR
  3389   LIM_of_real ~> tendsto_of_real
  3390   LIM_power ~> tendsto_power
  3391   LIM_inverse ~> tendsto_inverse
  3392   LIM_sgn ~> tendsto_sgn
  3393   isCont_LIM_compose ~> isCont_tendsto_compose
  3394   bounded_linear.LIM ~> bounded_linear.tendsto
  3395   bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
  3396   bounded_bilinear.LIM ~> bounded_bilinear.tendsto
  3397   bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
  3398   bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
  3399   bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
  3400   LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
  3401 
  3402 * Theory Complex_Main: The definition of infinite series was
  3403 generalized.  Now it is defined on the type class {topological_space,
  3404 comm_monoid_add}.  Hence it is useable also for extended real numbers.
  3405 
  3406 * Theory Complex_Main: The complex exponential function "expi" is now
  3407 a type-constrained abbreviation for "exp :: complex => complex"; thus
  3408 several polymorphic lemmas about "exp" are now applicable to "expi".
  3409 
  3410 * Code generation:
  3411 
  3412   - Theory Library/Code_Char_ord provides native ordering of
  3413     characters in the target language.
  3414 
  3415   - Commands code_module and code_library are legacy, use export_code
  3416     instead.
  3417 
  3418   - Method "evaluation" is legacy, use method "eval" instead.
  3419 
  3420   - Legacy evaluator "SML" is deactivated by default.  May be
  3421     reactivated by the following theory command:
  3422 
  3423       setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
  3424 
  3425 * Declare ext [intro] by default.  Rare INCOMPATIBILITY.
  3426 
  3427 * New proof method "induction" that gives induction hypotheses the
  3428 name "IH", thus distinguishing them from further hypotheses that come
  3429 from rule induction.  The latter are still called "hyps".  Method
  3430 "induction" is a thin wrapper around "induct" and follows the same
  3431 syntax.
  3432 
  3433 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
  3434 still available as a legacy feature for some time.
  3435 
  3436 * Nitpick:
  3437   - Added "need" and "total_consts" options.
  3438   - Reintroduced "show_skolems" option by popular demand.
  3439   - Renamed attribute: nitpick_def ~> nitpick_unfold.
  3440     INCOMPATIBILITY.
  3441 
  3442 * Sledgehammer:
  3443   - Use quasi-sound (and efficient) translations by default.
  3444   - Added support for the following provers: E-ToFoF, LEO-II,
  3445     Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
  3446   - Automatically preplay and minimize proofs before showing them if
  3447     this can be done within reasonable time.
  3448   - sledgehammer available_provers ~> sledgehammer supported_provers.
  3449     INCOMPATIBILITY.
  3450   - Added "preplay_timeout", "slicing", "type_enc", "sound",
  3451     "max_mono_iters", and "max_new_mono_instances" options.
  3452   - Removed "explicit_apply" and "full_types" options as well as "Full
  3453     Types" Proof General menu item. INCOMPATIBILITY.
  3454 
  3455 * Metis:
  3456   - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
  3457   - Obsoleted "metisFT" -- use "metis (full_types)" instead.
  3458     INCOMPATIBILITY.
  3459 
  3460 * Command 'try':
  3461   - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
  3462     "elim:" options. INCOMPATIBILITY.
  3463   - Introduced 'try' that not only runs 'try_methods' but also
  3464     'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
  3465 
  3466 * Quickcheck:
  3467   - Added "eval" option to evaluate terms for the found counterexample
  3468     (currently only supported by the default (exhaustive) tester).
  3469   - Added post-processing of terms to obtain readable counterexamples
  3470     (currently only supported by the default (exhaustive) tester).
  3471   - New counterexample generator quickcheck[narrowing] enables
  3472     narrowing-based testing.  Requires the Glasgow Haskell compiler
  3473     with its installation location defined in the Isabelle settings
  3474     environment as ISABELLE_GHC.
  3475   - Removed quickcheck tester "SML" based on the SML code generator
  3476     (formly in HOL/Library).
  3477 
  3478 * Function package: discontinued option "tailrec".  INCOMPATIBILITY,
  3479 use 'partial_function' instead.
  3480 
  3481 * Theory Library/Extended_Reals replaces now the positive extended
  3482 reals found in probability theory. This file is extended by
  3483 Multivariate_Analysis/Extended_Real_Limits.
  3484 
  3485 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
  3486 from where it must be imported explicitly if it is really required.
  3487 INCOMPATIBILITY.
  3488 
  3489 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
  3490 been moved here.  INCOMPATIBILITY.
  3491 
  3492 * Theory Library/Saturated provides type of numbers with saturated
  3493 arithmetic.
  3494 
  3495 * Theory Library/Product_Lattice defines a pointwise ordering for the
  3496 product type 'a * 'b, and provides instance proofs for various order
  3497 and lattice type classes.
  3498 
  3499 * Theory Library/Countable now provides the "countable_datatype" proof
  3500 method for proving "countable" class instances for datatypes.
  3501 
  3502 * Theory Library/Cset_Monad allows do notation for computable sets
  3503 (cset) via the generic monad ad-hoc overloading facility.
  3504 
  3505 * Library: Theories of common data structures are split into theories
  3506 for implementation, an invariant-ensuring type, and connection to an
  3507 abstract type. INCOMPATIBILITY.
  3508 
  3509   - RBT is split into RBT and RBT_Mapping.
  3510   - AssocList is split and renamed into AList and AList_Mapping.
  3511   - DList is split into DList_Impl, DList, and DList_Cset.
  3512   - Cset is split into Cset and List_Cset.
  3513 
  3514 * Theory Library/Nat_Infinity has been renamed to
  3515 Library/Extended_Nat, with name changes of the following types and
  3516 constants:
  3517 
  3518   type inat   ~> type enat
  3519   Fin         ~> enat
  3520   Infty       ~> infinity (overloaded)
  3521   iSuc        ~> eSuc
  3522   the_Fin     ~> the_enat
  3523 
  3524 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
  3525 been renamed accordingly. INCOMPATIBILITY.
  3526 
  3527 * Session Multivariate_Analysis: The euclidean_space type class now
  3528 fixes a constant "Basis :: 'a set" consisting of the standard
  3529 orthonormal basis for the type. Users now have the option of
  3530 quantifying over this set instead of using the "basis" function, e.g.
  3531 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
  3532 
  3533 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
  3534 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
  3535 "Cart_nth" and "Cart_lambda" have been respectively renamed to
  3536 "vec_nth" and "vec_lambda"; theorems mentioning those names have
  3537 changed to match. Definition theorems for overloaded constants now use
  3538 the standard "foo_vec_def" naming scheme. A few other theorems have
  3539 been renamed as follows (INCOMPATIBILITY):
  3540 
  3541   Cart_eq          ~> vec_eq_iff
  3542   dist_nth_le_cart ~> dist_vec_nth_le
  3543   tendsto_vector   ~> vec_tendstoI
  3544   Cauchy_vector    ~> vec_CauchyI
  3545 
  3546 * Session Multivariate_Analysis: Several duplicate theorems have been
  3547 removed, and other theorems have been renamed or replaced with more
  3548 general versions. INCOMPATIBILITY.
  3549 
  3550   finite_choice ~> finite_set_choice
  3551   eventually_conjI ~> eventually_conj
  3552   eventually_and ~> eventually_conj_iff
  3553   eventually_false ~> eventually_False
  3554   setsum_norm ~> norm_setsum
  3555   Lim_sequentially ~> LIMSEQ_def
  3556   Lim_ident_at ~> LIM_ident
  3557   Lim_const ~> tendsto_const
  3558   Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
  3559   Lim_neg ~> tendsto_minus
  3560   Lim_add ~> tendsto_add
  3561   Lim_sub ~> tendsto_diff
  3562   Lim_mul ~> tendsto_scaleR
  3563   Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
  3564   Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
  3565   Lim_linear ~> bounded_linear.tendsto
  3566   Lim_component ~> tendsto_euclidean_component
  3567   Lim_component_cart ~> tendsto_vec_nth
  3568   Lim_inner ~> tendsto_inner [OF tendsto_const]
  3569   dot_lsum ~> inner_setsum_left
  3570   dot_rsum ~> inner_setsum_right
  3571   continuous_cmul ~> continuous_scaleR [OF continuous_const]
  3572   continuous_neg ~> continuous_minus
  3573   continuous_sub ~> continuous_diff
  3574   continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
  3575   continuous_mul ~> continuous_scaleR
  3576   continuous_inv ~> continuous_inverse
  3577   continuous_at_within_inv ~> continuous_at_within_inverse
  3578   continuous_at_inv ~> continuous_at_inverse
  3579   continuous_at_norm ~> continuous_norm [OF continuous_at_id]
  3580   continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
  3581   continuous_at_component ~> continuous_component [OF continuous_at_id]
  3582   continuous_on_neg ~> continuous_on_minus
  3583   continuous_on_sub ~> continuous_on_diff
  3584   continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
  3585   continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
  3586   continuous_on_mul ~> continuous_on_scaleR
  3587   continuous_on_mul_real ~> continuous_on_mult
  3588   continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
  3589   continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
  3590   continuous_on_inverse ~> continuous_on_inv
  3591   uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
  3592   uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
  3593   subset_interior ~> interior_mono
  3594   subset_closure ~> closure_mono
  3595   closure_univ ~> closure_UNIV
  3596   real_arch_lt ~> reals_Archimedean2
  3597   real_arch ~> reals_Archimedean3
  3598   real_abs_norm ~> abs_norm_cancel
  3599   real_abs_sub_norm ~> norm_triangle_ineq3
  3600   norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
  3601 
  3602 * Session HOL-Probability:
  3603   - Caratheodory's extension lemma is now proved for ring_of_sets.
  3604   - Infinite products of probability measures are now available.
  3605   - Sigma closure is independent, if the generator is independent
  3606   - Use extended reals instead of positive extended
  3607     reals. INCOMPATIBILITY.
  3608 
  3609 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
  3610 
  3611   expand_fun_below ~> fun_below_iff
  3612   below_fun_ext ~> fun_belowI
  3613   expand_cfun_eq ~> cfun_eq_iff
  3614   ext_cfun ~> cfun_eqI
  3615   expand_cfun_below ~> cfun_below_iff
  3616   below_cfun_ext ~> cfun_belowI
  3617   monofun_fun_fun ~> fun_belowD
  3618   monofun_fun_arg ~> monofunE
  3619   monofun_lub_fun ~> adm_monofun [THEN admD]
  3620   cont_lub_fun ~> adm_cont [THEN admD]
  3621   cont2cont_Rep_CFun ~> cont2cont_APP
  3622   cont_Rep_CFun_app ~> cont_APP_app
  3623   cont_Rep_CFun_app_app ~> cont_APP_app_app
  3624   cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
  3625   cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
  3626   contlub_cfun ~> lub_APP [symmetric]
  3627   contlub_LAM ~> lub_LAM [symmetric]
  3628   thelubI ~> lub_eqI
  3629   UU_I ~> bottomI
  3630   lift_distinct1 ~> lift.distinct(1)
  3631   lift_distinct2 ~> lift.distinct(2)
  3632   Def_not_UU ~> lift.distinct(2)
  3633   Def_inject ~> lift.inject
  3634   below_UU_iff ~> below_bottom_iff
  3635   eq_UU_iff ~> eq_bottom_iff
  3636 
  3637 
  3638 *** Document preparation ***
  3639 
  3640 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
  3641 isar-ref manual, both for description and actual application of the
  3642 same.
  3643 
  3644 * Antiquotation @{value} evaluates the given term and presents its
  3645 result.
  3646 
  3647 * Antiquotations: term style "isub" provides ad-hoc conversion of
  3648 variables x1, y23 into subscripted form x\<^isub>1,
  3649 y\<^isub>2\<^isub>3.
  3650 
  3651 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
  3652 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
  3653 
  3654 * Localized \isabellestyle switch can be used within blocks or groups
  3655 like this:
  3656 
  3657   \isabellestyle{it}  %preferred default
  3658   {\isabellestylett @{text "typewriter stuff"}}
  3659 
  3660 * Discontinued special treatment of hard tabulators.  Implicit
  3661 tab-width is now defined as 1.  Potential INCOMPATIBILITY for visual
  3662 layouts.
  3663 
  3664 
  3665 *** ML ***
  3666 
  3667 * The inner syntax of sort/type/term/prop supports inlined YXML
  3668 representations within quoted string tokens.  By encoding logical
  3669 entities via Term_XML (in ML or Scala) concrete syntax can be
  3670 bypassed, which is particularly useful for producing bits of text
  3671 under external program control.
  3672 
  3673 * Antiquotations for ML and document preparation are managed as theory
  3674 data, which requires explicit setup.
  3675 
  3676 * Isabelle_Process.is_active allows tools to check if the official
  3677 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
  3678 (better known as Proof General).
  3679 
  3680 * Structure Proof_Context follows standard naming scheme.  Old
  3681 ProofContext is still available for some time as legacy alias.
  3682 
  3683 * Structure Timing provides various operations for timing; supersedes
  3684 former start_timing/end_timing etc.
  3685 
  3686 * Path.print is the official way to show file-system paths to users
  3687 (including quotes etc.).
  3688 
  3689 * Inner syntax: identifiers in parse trees of generic categories
  3690 "logic", "aprop", "idt" etc. carry position information (disguised as
  3691 type constraints).  Occasional INCOMPATIBILITY with non-compliant
  3692 translations that choke on unexpected type constraints.  Positions can
  3693 be stripped in ML translations via Syntax.strip_positions /
  3694 Syntax.strip_positions_ast, or via the syntax constant
  3695 "_strip_positions" within parse trees.  As last resort, positions can
  3696 be disabled via the configuration option Syntax.positions, which is
  3697 called "syntax_positions" in Isar attribute syntax.
  3698 
  3699 * Discontinued special status of various ML structures that contribute
  3700 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
  3701 pervasive content, no inclusion in structure Syntax.  INCOMPATIBILITY,
  3702 refer directly to Ast.Constant, Lexicon.is_identifier,
  3703 Syntax_Trans.mk_binder_tr etc.
  3704 
  3705 * Typed print translation: discontinued show_sorts argument, which is
  3706 already available via context of "advanced" translation.
  3707 
  3708 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
  3709 goal states; body tactic needs to address all subgoals uniformly.
  3710 
  3711 * Slightly more special eq_list/eq_set, with shortcut involving
  3712 pointer equality (assumes that eq relation is reflexive).
  3713 
  3714 * Classical tactics use proper Proof.context instead of historic types
  3715 claset/clasimpset.  Old-style declarations like addIs, addEs, addDs
  3716 operate directly on Proof.context.  Raw type claset retains its use as
  3717 snapshot of the classical context, which can be recovered via
  3718 (put_claset HOL_cs) etc.  Type clasimpset has been discontinued.
  3719 INCOMPATIBILITY, classical tactics and derived proof methods require
  3720 proper Proof.context.
  3721 
  3722 
  3723 *** System ***
  3724 
  3725 * Discontinued support for Poly/ML 5.2, which was the last version
  3726 without proper multithreading and TimeLimit implementation.
  3727 
  3728 * Discontinued old lib/scripts/polyml-platform, which has been
  3729 obsolete since Isabelle2009-2.
  3730 
  3731 * Various optional external tools are referenced more robustly and
  3732 uniformly by explicit Isabelle settings as follows:
  3733 
  3734   ISABELLE_CSDP   (formerly CSDP_EXE)
  3735   ISABELLE_GHC    (formerly EXEC_GHC or GHC_PATH)
  3736   ISABELLE_OCAML  (formerly EXEC_OCAML)
  3737   ISABELLE_SWIPL  (formerly EXEC_SWIPL)
  3738   ISABELLE_YAP    (formerly EXEC_YAP)
  3739 
  3740 Note that automated detection from the file-system or search path has
  3741 been discontinued.  INCOMPATIBILITY.
  3742 
  3743 * Scala layer provides JVM method invocation service for static
  3744 methods of type (String)String, see Invoke_Scala.method in ML.  For
  3745 example:
  3746 
  3747   Invoke_Scala.method "java.lang.System.getProperty" "java.home"
  3748 
  3749 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
  3750 this allows to pass structured values between ML and Scala.
  3751 
  3752 * The IsabelleText fonts includes some further glyphs to support the
  3753 Prover IDE.  Potential INCOMPATIBILITY: users who happen to have
  3754 installed a local copy (which is normally *not* required) need to
  3755 delete or update it from ~~/lib/fonts/.
  3756 
  3757 
  3758 
  3759 New in Isabelle2011 (January 2011)
  3760 ----------------------------------
  3761 
  3762 *** General ***
  3763 
  3764 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
  3765 src/Tools/jEdit).  This also serves as IDE for Isabelle/ML, with
  3766 useful tooltips and hyperlinks produced from its static analysis.  The
  3767 bundled component provides an executable Isabelle tool that can be run
  3768 like this:
  3769 
  3770   Isabelle2011/bin/isabelle jedit
  3771 
  3772 * Significantly improved Isabelle/Isar implementation manual.
  3773 
  3774 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
  3775 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
  3776 while the default heap location within that directory lacks that extra
  3777 suffix.  This isolates multiple Isabelle installations from each
  3778 other, avoiding problems with old settings in new versions.
  3779 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
  3780 
  3781 * Source files are always encoded as UTF-8, instead of old-fashioned
  3782 ISO-Latin-1.  INCOMPATIBILITY.  Isabelle LaTeX documents might require
  3783 the following package declarations:
  3784 
  3785   \usepackage[utf8]{inputenc}
  3786   \usepackage{textcomp}
  3787 
  3788 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
  3789 a Unicode character is treated as a single symbol, not a sequence of
  3790 non-ASCII bytes as before.  Since Isabelle/ML string literals may
  3791 contain symbols without further backslash escapes, Unicode can now be
  3792 used here as well.  Recall that Symbol.explode in ML provides a
  3793 consistent view on symbols, while raw explode (or String.explode)
  3794 merely give a byte-oriented representation.
  3795 
  3796 * Theory loader: source files are primarily located via the master
  3797 directory of each theory node (where the .thy file itself resides).
  3798 The global load path is still partially available as legacy feature.
  3799 Minor INCOMPATIBILITY due to subtle change in file lookup: use
  3800 explicit paths, relatively to the theory.
  3801 
  3802 * Special treatment of ML file names has been discontinued.
  3803 Historically, optional extensions .ML or .sml were added on demand --
  3804 at the cost of clarity of file dependencies.  Recall that Isabelle/ML
  3805 files exclusively use the .ML extension.  Minor INCOMPATIBILTY.
  3806 
  3807 * Various options that affect pretty printing etc. are now properly
  3808 handled within the context via configuration options, instead of
  3809 unsynchronized references or print modes.  There are both ML Config.T
  3810 entities and Isar declaration attributes to access these.
  3811 
  3812   ML (Config.T)                 Isar (attribute)
  3813 
  3814   eta_contract                  eta_contract
  3815   show_brackets                 show_brackets
  3816   show_sorts                    show_sorts
  3817   show_types                    show_types
  3818   show_question_marks           show_question_marks
  3819   show_consts                   show_consts
  3820   show_abbrevs                  show_abbrevs
  3821 
  3822   Syntax.ast_trace              syntax_ast_trace
  3823   Syntax.ast_stat               syntax_ast_stat
  3824   Syntax.ambiguity_level        syntax_ambiguity_level
  3825 
  3826   Goal_Display.goals_limit      goals_limit
  3827   Goal_Display.show_main_goal   show_main_goal
  3828 
  3829   Method.rule_trace             rule_trace
  3830 
  3831   Thy_Output.display            thy_output_display
  3832   Thy_Output.quotes             thy_output_quotes
  3833   Thy_Output.indent             thy_output_indent
  3834   Thy_Output.source             thy_output_source
  3835   Thy_Output.break              thy_output_break
  3836 
  3837 Note that corresponding "..._default" references in ML may only be
  3838 changed globally at the ROOT session setup, but *not* within a theory.
  3839 The option "show_abbrevs" supersedes the former print mode
  3840 "no_abbrevs" with inverted meaning.
  3841 
  3842 * More systematic naming of some configuration options.
  3843 INCOMPATIBILITY.
  3844 
  3845   trace_simp  ~>  simp_trace
  3846   debug_simp  ~>  simp_debug
  3847 
  3848 * Support for real valued configuration options, using simplistic
  3849 floating-point notation that coincides with the inner syntax for
  3850 float_token.
  3851 
  3852 * Support for real valued preferences (with approximative PGIP type):
  3853 front-ends need to accept "pgint" values in float notation.
  3854 INCOMPATIBILITY.
  3855 
  3856 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
  3857 DejaVu Sans.
  3858 
  3859 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
  3860 
  3861 
  3862 *** Pure ***
  3863 
  3864 * Command 'type_synonym' (with single argument) replaces somewhat
  3865 outdated 'types', which is still available as legacy feature for some
  3866 time.
  3867 
  3868 * Command 'nonterminal' (with 'and' separated list of arguments)
  3869 replaces somewhat outdated 'nonterminals'.  INCOMPATIBILITY.
  3870 
  3871 * Command 'notepad' replaces former 'example_proof' for
  3872 experimentation in Isar without any result.  INCOMPATIBILITY.
  3873 
  3874 * Locale interpretation commands 'interpret' and 'sublocale' accept
  3875 lists of equations to map definitions in a locale to appropriate
  3876 entities in the context of the interpretation.  The 'interpretation'
  3877 command already provided this functionality.
  3878 
  3879 * Diagnostic command 'print_dependencies' prints the locale instances
  3880 that would be activated if the specified expression was interpreted in
  3881 the current context.  Variant "print_dependencies!" assumes a context
  3882 without interpretations.
  3883 
  3884 * Diagnostic command 'print_interps' prints interpretations in proofs
  3885 in addition to interpretations in theories.
  3886 
  3887 * Discontinued obsolete 'global' and 'local' commands to manipulate
  3888 the theory name space.  Rare INCOMPATIBILITY.  The ML functions
  3889 Sign.root_path and Sign.local_path may be applied directly where this
  3890 feature is still required for historical reasons.
  3891 
  3892 * Discontinued obsolete 'constdefs' command.  INCOMPATIBILITY, use
  3893 'definition' instead.
  3894 
  3895 * The "prems" fact, which refers to the accidental collection of
  3896 foundational premises in the context, is now explicitly marked as
  3897 legacy feature and will be discontinued soon.  Consider using "assms"
  3898 of the head statement or reference facts by explicit names.
  3899 
  3900 * Document antiquotations @{class} and @{type} print classes and type
  3901 constructors.
  3902 
  3903 * Document antiquotation @{file} checks file/directory entries within
  3904 the local file system.
  3905 
  3906 
  3907 *** HOL ***
  3908 
  3909 * Coercive subtyping: functions can be declared as coercions and type
  3910 inference will add them as necessary upon input of a term.  Theory
  3911 Complex_Main declares real :: nat => real and real :: int => real as
  3912 coercions. A coercion function f is declared like this:
  3913 
  3914   declare [[coercion f]]
  3915 
  3916 To lift coercions through type constructors (e.g. from nat => real to
  3917 nat list => real list), map functions can be declared, e.g.
  3918 
  3919   declare [[coercion_map map]]
  3920 
  3921 Currently coercion inference is activated only in theories including
  3922 real numbers, i.e. descendants of Complex_Main.  This is controlled by
  3923 the configuration option "coercion_enabled", e.g. it can be enabled in
  3924 other theories like this:
  3925 
  3926   declare [[coercion_enabled]]
  3927 
  3928 * Command 'partial_function' provides basic support for recursive
  3929 function definitions over complete partial orders.  Concrete instances
  3930 are provided for i) the option type, ii) tail recursion on arbitrary
  3931 types, and iii) the heap monad of Imperative_HOL.  See
  3932 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
  3933 for examples.
  3934 
  3935 * Function package: f.psimps rules are no longer implicitly declared
  3936 as [simp].  INCOMPATIBILITY.
  3937 
  3938 * Datatype package: theorems generated for executable equality (class
  3939 "eq") carry proper names and are treated as default code equations.
  3940 
  3941 * Inductive package: now offers command 'inductive_simps' to
  3942 automatically derive instantiated and simplified equations for
  3943 inductive predicates, similar to 'inductive_cases'.
  3944 
  3945 * Command 'enriched_type' allows to register properties of the
  3946 functorial structure of types.
  3947 
  3948 * Improved infrastructure for term evaluation using code generator
  3949 techniques, in particular static evaluation conversions.
  3950 
  3951 * Code generator: Scala (2.8 or higher) has been added to the target
  3952 languages.
  3953 
  3954 * Code generator: globbing constant expressions "*" and "Theory.*"
  3955 have been replaced by the more idiomatic "_" and "Theory._".
  3956 INCOMPATIBILITY.
  3957 
  3958 * Code generator: export_code without explicit file declaration prints
  3959 to standard output.  INCOMPATIBILITY.
  3960 
  3961 * Code generator: do not print function definitions for case
  3962 combinators any longer.
  3963 
  3964 * Code generator: simplification with rules determined with
  3965 src/Tools/Code/code_simp.ML and method "code_simp".
  3966 
  3967 * Code generator for records: more idiomatic representation of record
  3968 types.  Warning: records are not covered by ancient SML code
  3969 generation any longer.  INCOMPATIBILITY.  In cases of need, a suitable
  3970 rep_datatype declaration helps to succeed then:
  3971 
  3972   record 'a foo = ...
  3973   ...
  3974   rep_datatype foo_ext ...
  3975 
  3976 * Records: logical foundation type for records does not carry a
  3977 '_type' suffix any longer (obsolete due to authentic syntax).
  3978 INCOMPATIBILITY.
  3979 
  3980 * Quickcheck now by default uses exhaustive testing instead of random
  3981 testing.  Random testing can be invoked by "quickcheck [random]",
  3982 exhaustive testing by "quickcheck [exhaustive]".
  3983 
  3984 * Quickcheck instantiates polymorphic types with small finite
  3985 datatypes by default. This enables a simple execution mechanism to
  3986 handle quantifiers and function equality over the finite datatypes.
  3987 
  3988 * Quickcheck random generator has been renamed from "code" to
  3989 "random".  INCOMPATIBILITY.
  3990 
  3991 * Quickcheck now has a configurable time limit which is set to 30
  3992 seconds by default. This can be changed by adding [timeout = n] to the
  3993 quickcheck command. The time limit for Auto Quickcheck is still set
  3994 independently.
  3995 
  3996 * Quickcheck in locales considers interpretations of that locale for
  3997 counter example search.
  3998 
  3999 * Sledgehammer:
  4000   - Added "smt" and "remote_smt" provers based on the "smt" proof
  4001     method. See the Sledgehammer manual for details ("isabelle doc
  4002     sledgehammer").
  4003   - Renamed commands:
  4004     sledgehammer atp_info ~> sledgehammer running_provers
  4005     sledgehammer atp_kill ~> sledgehammer kill_provers
  4006     sledgehammer available_atps ~> sledgehammer available_provers
  4007     INCOMPATIBILITY.
  4008   - Renamed options:
  4009     sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
  4010     sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
  4011     sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
  4012     (and "ms" and "min" are no longer supported)
  4013     INCOMPATIBILITY.
  4014 
  4015 * Nitpick:
  4016   - Renamed options:
  4017     nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
  4018     nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
  4019     INCOMPATIBILITY.
  4020   - Added support for partial quotient types.
  4021   - Added local versions of the "Nitpick.register_xxx" functions.
  4022   - Added "whack" option.
  4023   - Allow registration of quotient types as codatatypes.
  4024   - Improved "merge_type_vars" option to merge more types.
  4025   - Removed unsound "fast_descrs" option.
  4026   - Added custom symmetry breaking for datatypes, making it possible to reach
  4027     higher cardinalities.
  4028   - Prevent the expansion of too large definitions.
  4029 
  4030 * Proof methods "metis" and "meson" now have configuration options
  4031 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
  4032 to diagnose these tools. E.g.
  4033 
  4034     using [[metis_trace = true]]
  4035 
  4036 * Auto Solve: Renamed "Auto Solve Direct".  The tool is now available
  4037 manually as command 'solve_direct'.
  4038 
  4039 * The default SMT solver Z3 must be enabled explicitly (due to
  4040 licensing issues) by setting the environment variable
  4041 Z3_NON_COMMERCIAL in etc/settings of the component, for example.  For
  4042 commercial applications, the SMT solver CVC3 is provided as fall-back;
  4043 changing the SMT solver is done via the configuration option
  4044 "smt_solver".
  4045 
  4046 * Remote SMT solvers need to be referred to by the "remote_" prefix,
  4047 i.e. "remote_cvc3" and "remote_z3".
  4048 
  4049 * Added basic SMT support for datatypes, records, and typedefs using
  4050 the oracle mode (no proofs).  Direct support of pairs has been dropped
  4051 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
  4052 support for a similar behavior).  Minor INCOMPATIBILITY.
  4053 
  4054 * Changed SMT configuration options:
  4055   - Renamed:
  4056     z3_proofs ~> smt_oracle (with inverted meaning)
  4057     z3_trace_assms ~> smt_trace_used_facts
  4058     INCOMPATIBILITY.
  4059   - Added:
  4060     smt_verbose
  4061     smt_random_seed
  4062     smt_datatypes
  4063     smt_infer_triggers
  4064     smt_monomorph_limit
  4065     cvc3_options
  4066     remote_cvc3_options
  4067     remote_z3_options
  4068     yices_options
  4069 
  4070 * Boogie output files (.b2i files) need to be declared in the theory
  4071 header.
  4072 
  4073 * Simplification procedure "list_to_set_comprehension" rewrites list
  4074 comprehensions applied to List.set to set comprehensions.  Occasional
  4075 INCOMPATIBILITY, may be deactivated like this:
  4076 
  4077   declare [[simproc del: list_to_set_comprehension]]
  4078 
  4079 * Removed old version of primrec package.  INCOMPATIBILITY.
  4080 
  4081 * Removed simplifier congruence rule of "prod_case", as has for long
  4082 been the case with "split".  INCOMPATIBILITY.
  4083 
  4084 * String.literal is a type, but not a datatype.  INCOMPATIBILITY.
  4085 
  4086 * Removed [split_format ... and ... and ...] version of
  4087 [split_format].  Potential INCOMPATIBILITY.
  4088 
  4089 * Predicate "sorted" now defined inductively, with nice induction
  4090 rules.  INCOMPATIBILITY: former sorted.simps now named sorted_simps.
  4091 
  4092 * Constant "contents" renamed to "the_elem", to free the generic name
  4093 contents for other uses.  INCOMPATIBILITY.
  4094 
  4095 * Renamed class eq and constant eq (for code generation) to class
  4096 equal and constant equal, plus renaming of related facts and various
  4097 tuning.  INCOMPATIBILITY.
  4098 
  4099 * Dropped type classes mult_mono and mult_mono1.  INCOMPATIBILITY.
  4100 
  4101 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
  4102 INCOMPATIBILITY.
  4103 
  4104 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
  4105 avoid confusion with finite sets.  INCOMPATIBILITY.
  4106 
  4107 * Abandoned locales equiv, congruent and congruent2 for equivalence
  4108 relations.  INCOMPATIBILITY: use equivI rather than equiv_intro (same
  4109 for congruent(2)).
  4110 
  4111 * Some previously unqualified names have been qualified:
  4112 
  4113   types
  4114     bool ~> HOL.bool
  4115     nat ~> Nat.nat
  4116 
  4117   constants
  4118     Trueprop ~> HOL.Trueprop
  4119     True ~> HOL.True
  4120     False ~> HOL.False
  4121     op & ~> HOL.conj
  4122     op | ~> HOL.disj
  4123     op --> ~> HOL.implies
  4124     op = ~> HOL.eq
  4125     Not ~> HOL.Not
  4126     The ~> HOL.The
  4127     All ~> HOL.All
  4128     Ex ~> HOL.Ex
  4129     Ex1 ~> HOL.Ex1
  4130     Let ~> HOL.Let
  4131     If ~> HOL.If
  4132     Ball ~> Set.Ball
  4133     Bex ~> Set.Bex
  4134     Suc ~> Nat.Suc
  4135     Pair ~> Product_Type.Pair
  4136     fst ~> Product_Type.fst
  4137     snd ~> Product_Type.snd
  4138     curry ~> Product_Type.curry
  4139     op : ~> Set.member
  4140     Collect ~> Set.Collect
  4141 
  4142 INCOMPATIBILITY.
  4143 
  4144 * More canonical naming convention for some fundamental definitions:
  4145 
  4146     bot_bool_eq ~> bot_bool_def
  4147     top_bool_eq ~> top_bool_def
  4148     inf_bool_eq ~> inf_bool_def
  4149     sup_bool_eq ~> sup_bool_def
  4150     bot_fun_eq  ~> bot_fun_def
  4151     top_fun_eq  ~> top_fun_def
  4152     inf_fun_eq  ~> inf_fun_def
  4153     sup_fun_eq  ~> sup_fun_def
  4154 
  4155 INCOMPATIBILITY.
  4156 
  4157 * More stylized fact names:
  4158 
  4159   expand_fun_eq ~> fun_eq_iff
  4160   expand_set_eq ~> set_eq_iff
  4161   set_ext       ~> set_eqI
  4162   nat_number    ~> eval_nat_numeral
  4163 
  4164 INCOMPATIBILITY.
  4165 
  4166 * Refactoring of code-generation specific operations in theory List:
  4167 
  4168   constants
  4169     null ~> List.null
  4170 
  4171   facts
  4172     mem_iff ~> member_def
  4173     null_empty ~> null_def
  4174 
  4175 INCOMPATIBILITY.  Note that these were not supposed to be used
  4176 regularly unless for striking reasons; their main purpose was code
  4177 generation.
  4178 
  4179 Various operations from the Haskell prelude are used for generating
  4180 Haskell code.
  4181 
  4182 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV".  Term
  4183 "surj f" is now an abbreviation of "range f = UNIV".  The theorems
  4184 bij_def and surj_def are unchanged.  INCOMPATIBILITY.
  4185 
  4186 * Abolished some non-alphabetic type names: "prod" and "sum" replace
  4187 "*" and "+" respectively.  INCOMPATIBILITY.
  4188 
  4189 * Name "Plus" of disjoint sum operator "<+>" is now hidden.  Write
  4190 "Sum_Type.Plus" instead.
  4191 
  4192 * Constant "split" has been merged with constant "prod_case"; names of
  4193 ML functions, facts etc. involving split have been retained so far,
  4194 though.  INCOMPATIBILITY.
  4195 
  4196 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
  4197 instead.  INCOMPATIBILITY.
  4198 
  4199 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
  4200 INCOMPATIBILITY.
  4201 
  4202 * Former theory Library/Enum is now part of the HOL-Main image.
  4203 INCOMPATIBILITY: all constants of the Enum theory now have to be
  4204 referred to by its qualified name.
  4205 
  4206   enum    ~>  Enum.enum
  4207   nlists  ~>  Enum.nlists
  4208   product ~>  Enum.product
  4209 
  4210 * Theory Library/Monad_Syntax provides do-syntax for monad types.
  4211 Syntax in Library/State_Monad has been changed to avoid ambiguities.
  4212 INCOMPATIBILITY.
  4213 
  4214 * Theory Library/SetsAndFunctions has been split into
  4215 Library/Function_Algebras and Library/Set_Algebras; canonical names
  4216 for instance definitions for functions; various improvements.
  4217 INCOMPATIBILITY.
  4218 
  4219 * Theory Library/Multiset provides stable quicksort implementation of
  4220 sort_key.
  4221 
  4222 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
  4223 INCOMPATIBILITY.
  4224 
  4225 * Session Multivariate_Analysis: introduced a type class for euclidean
  4226 space.  Most theorems are now stated in terms of euclidean spaces
  4227 instead of finite cartesian products.
  4228 
  4229   types
  4230     real ^ 'n ~>  'a::real_vector
  4231               ~>  'a::euclidean_space
  4232               ~>  'a::ordered_euclidean_space
  4233         (depends on your needs)
  4234 
  4235   constants
  4236      _ $ _        ~> _ $$ _
  4237      \<chi> x. _  ~> \<chi>\<chi> x. _
  4238      CARD('n)     ~> DIM('a)
  4239 
  4240 Also note that the indices are now natural numbers and not from some
  4241 finite type. Finite cartesian products of euclidean spaces, products
  4242 of euclidean spaces the real and complex numbers are instantiated to
  4243 be euclidean_spaces.  INCOMPATIBILITY.
  4244 
  4245 * Session Probability: introduced pextreal as positive extended real
  4246 numbers.  Use pextreal as value for measures.  Introduce the
  4247 Radon-Nikodym derivative, product spaces and Fubini's theorem for
  4248 arbitrary sigma finite measures.  Introduces Lebesgue measure based on
  4249 the integral in Multivariate Analysis.  INCOMPATIBILITY.
  4250 
  4251 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
  4252 INCOMPATIBILITY.
  4253 
  4254 * Session SPARK (with image HOL-SPARK) provides commands to load and
  4255 prove verification conditions generated by the SPARK Ada program
  4256 verifier.  See also src/HOL/SPARK and src/HOL/SPARK/Examples.
  4257 
  4258 
  4259 *** HOL-Algebra ***
  4260 
  4261 * Theorems for additive ring operations (locale abelian_monoid and
  4262 descendants) are generated by interpretation from their multiplicative
  4263 counterparts.  Names (in particular theorem names) have the mandatory
  4264 qualifier 'add'.  Previous theorem names are redeclared for
  4265 compatibility.
  4266 
  4267 * Structure "int_ring" is now an abbreviation (previously a
  4268 definition).  This fits more natural with advanced interpretations.
  4269 
  4270 
  4271 *** HOLCF ***
  4272 
  4273 * The domain package now runs in definitional mode by default: The
  4274 former command 'new_domain' is now called 'domain'.  To use the domain
  4275 package in its original axiomatic mode, use 'domain (unsafe)'.
  4276 INCOMPATIBILITY.
  4277 
  4278 * The new class "domain" is now the default sort.  Class "predomain"
  4279 is an unpointed version of "domain". Theories can be updated by
  4280 replacing sort annotations as shown below.  INCOMPATIBILITY.
  4281 
  4282   'a::type ~> 'a::countable
  4283   'a::cpo  ~> 'a::predomain
  4284   'a::pcpo ~> 'a::domain
  4285 
  4286 * The old type class "rep" has been superseded by class "domain".
  4287 Accordingly, users of the definitional package must remove any
  4288 "default_sort rep" declarations.  INCOMPATIBILITY.
  4289 
  4290 * The domain package (definitional mode) now supports unpointed
  4291 predomain argument types, as long as they are marked 'lazy'. (Strict
  4292 arguments must be in class "domain".) For example, the following
  4293 domain definition now works:
  4294 
  4295   domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
  4296 
  4297 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
  4298 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
  4299 'a option, and 'a list.  Additionally, it configures fixrec and the
  4300 domain package to work with these types.  For example:
  4301 
  4302   fixrec isInl :: "('a + 'b) u -> tr"
  4303     where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
  4304 
  4305   domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
  4306 
  4307 * The "(permissive)" option of fixrec has been replaced with a
  4308 per-equation "(unchecked)" option. See
  4309 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
  4310 
  4311 * The "bifinite" class no longer fixes a constant "approx"; the class
  4312 now just asserts that such a function exists.  INCOMPATIBILITY.
  4313 
  4314 * Former type "alg_defl" has been renamed to "defl".  HOLCF no longer
  4315 defines an embedding of type 'a defl into udom by default; instances
  4316 of "bifinite" and "domain" classes are available in
  4317 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
  4318 
  4319 * The syntax "REP('a)" has been replaced with "DEFL('a)".
  4320 
  4321 * The predicate "directed" has been removed.  INCOMPATIBILITY.
  4322 
  4323 * The type class "finite_po" has been removed.  INCOMPATIBILITY.
  4324 
  4325 * The function "cprod_map" has been renamed to "prod_map".
  4326 INCOMPATIBILITY.
  4327 
  4328 * The monadic bind operator on each powerdomain has new binder syntax
  4329 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
  4330 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
  4331 
  4332 * The infix syntax for binary union on each powerdomain has changed
  4333 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
  4334 syntax.  INCOMPATIBILITY.
  4335 
  4336 * The constant "UU" has been renamed to "bottom".  The syntax "UU" is
  4337 still supported as an input translation.
  4338 
  4339 * Renamed some theorems (the original names are also still available).
  4340 
  4341   expand_fun_below   ~> fun_below_iff
  4342   below_fun_ext      ~> fun_belowI
  4343   expand_cfun_eq     ~> cfun_eq_iff
  4344   ext_cfun           ~> cfun_eqI
  4345   expand_cfun_below  ~> cfun_below_iff
  4346   below_cfun_ext     ~> cfun_belowI
  4347   cont2cont_Rep_CFun ~> cont2cont_APP
  4348 
  4349 * The Abs and Rep functions for various types have changed names.
  4350 Related theorem names have also changed to match. INCOMPATIBILITY.
  4351 
  4352   Rep_CFun  ~> Rep_cfun
  4353   Abs_CFun  ~> Abs_cfun
  4354   Rep_Sprod ~> Rep_sprod
  4355   Abs_Sprod ~> Abs_sprod
  4356   Rep_Ssum  ~> Rep_ssum
  4357   Abs_Ssum  ~> Abs_ssum
  4358 
  4359 * Lemmas with names of the form *_defined_iff or *_strict_iff have
  4360 been renamed to *_bottom_iff.  INCOMPATIBILITY.
  4361 
  4362 * Various changes to bisimulation/coinduction with domain package:
  4363 
  4364   - Definitions of "bisim" constants no longer mention definedness.
  4365   - With mutual recursion, "bisim" predicate is now curried.
  4366   - With mutual recursion, each type gets a separate coind theorem.
  4367   - Variable names in bisim_def and coinduct rules have changed.
  4368 
  4369 INCOMPATIBILITY.
  4370 
  4371 * Case combinators generated by the domain package for type "foo" are
  4372 now named "foo_case" instead of "foo_when".  INCOMPATIBILITY.
  4373 
  4374 * Several theorems have been renamed to more accurately reflect the
  4375 names of constants and types involved.  INCOMPATIBILITY.
  4376 
  4377   thelub_const    ~> lub_const
  4378   lub_const       ~> is_lub_const
  4379   thelubI         ~> lub_eqI
  4380   is_lub_lub      ~> is_lubD2
  4381   lubI            ~> is_lub_lub
  4382   unique_lub      ~> is_lub_unique
  4383   is_ub_lub       ~> is_lub_rangeD1
  4384   lub_bin_chain   ~> is_lub_bin_chain
  4385   lub_fun         ~> is_lub_fun
  4386   thelub_fun      ~> lub_fun
  4387   thelub_cfun     ~> lub_cfun
  4388   thelub_Pair     ~> lub_Pair
  4389   lub_cprod       ~> is_lub_prod
  4390   thelub_cprod    ~> lub_prod
  4391   minimal_cprod   ~> minimal_prod
  4392   inst_cprod_pcpo ~> inst_prod_pcpo
  4393   UU_I            ~> bottomI
  4394   compact_UU      ~> compact_bottom
  4395   deflation_UU    ~> deflation_bottom
  4396   finite_deflation_UU ~> finite_deflation_bottom
  4397 
  4398 * Many legacy theorem names have been discontinued.  INCOMPATIBILITY.
  4399 
  4400   sq_ord_less_eq_trans ~> below_eq_trans
  4401   sq_ord_eq_less_trans ~> eq_below_trans
  4402   refl_less            ~> below_refl
  4403   trans_less           ~> below_trans
  4404   antisym_less         ~> below_antisym
  4405   antisym_less_inverse ~> po_eq_conv [THEN iffD1]
  4406   box_less             ~> box_below
  4407   rev_trans_less       ~> rev_below_trans
  4408   not_less2not_eq      ~> not_below2not_eq
  4409   less_UU_iff          ~> below_UU_iff
  4410   flat_less_iff        ~> flat_below_iff
  4411   adm_less             ~> adm_below
  4412   adm_not_less         ~> adm_not_below
  4413   adm_compact_not_less ~> adm_compact_not_below
  4414   less_fun_def         ~> below_fun_def
  4415   expand_fun_less      ~> fun_below_iff
  4416   less_fun_ext         ~> fun_belowI
  4417   less_discr_def       ~> below_discr_def
  4418   discr_less_eq        ~> discr_below_eq
  4419   less_unit_def        ~> below_unit_def
  4420   less_cprod_def       ~> below_prod_def
  4421   prod_lessI           ~> prod_belowI
  4422   Pair_less_iff        ~> Pair_below_iff
  4423   fst_less_iff         ~> fst_below_iff
  4424   snd_less_iff         ~> snd_below_iff
  4425   expand_cfun_less     ~> cfun_below_iff
  4426   less_cfun_ext        ~> cfun_belowI
  4427   injection_less       ~> injection_below
  4428   less_up_def          ~> below_up_def
  4429   not_Iup_less         ~> not_Iup_below
  4430   Iup_less             ~> Iup_below
  4431   up_less              ~> up_below
  4432   Def_inject_less_eq   ~> Def_below_Def
  4433   Def_less_is_eq       ~> Def_below_iff
  4434   spair_less_iff       ~> spair_below_iff
  4435   less_sprod           ~> below_sprod
  4436   spair_less           ~> spair_below
  4437   sfst_less_iff        ~> sfst_below_iff
  4438   ssnd_less_iff        ~> ssnd_below_iff
  4439   fix_least_less       ~> fix_least_below
  4440   dist_less_one        ~> dist_below_one
  4441   less_ONE             ~> below_ONE
  4442   ONE_less_iff         ~> ONE_below_iff
  4443   less_sinlD           ~> below_sinlD
  4444   less_sinrD           ~> below_sinrD
  4445 
  4446 
  4447 *** FOL and ZF ***
  4448 
  4449 * All constant names are now qualified internally and use proper
  4450 identifiers, e.g. "IFOL.eq" instead of "op =".  INCOMPATIBILITY.
  4451 
  4452 
  4453 *** ML ***
  4454 
  4455 * Antiquotation @{assert} inlines a function bool -> unit that raises
  4456 Fail if the argument is false.  Due to inlining the source position of
  4457 failed assertions is included in the error output.
  4458 
  4459 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
  4460 text is in practice always evaluated with a stable theory checkpoint.
  4461 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
  4462 
  4463 * Antiquotation @{theory A} refers to theory A from the ancestry of
  4464 the current context, not any accidental theory loader state as before.
  4465 Potential INCOMPATIBILITY, subtle change in semantics.
  4466 
  4467 * Syntax.pretty_priority (default 0) configures the required priority
  4468 of pretty-printed output and thus affects insertion of parentheses.
  4469 
  4470 * Syntax.default_root (default "any") configures the inner syntax
  4471 category (nonterminal symbol) for parsing of terms.
  4472 
  4473 * Former exception Library.UnequalLengths now coincides with
  4474 ListPair.UnequalLengths.
  4475 
  4476 * Renamed structure MetaSimplifier to Raw_Simplifier.  Note that the
  4477 main functionality is provided by structure Simplifier.
  4478 
  4479 * Renamed raw "explode" function to "raw_explode" to emphasize its
  4480 meaning.  Note that internally to Isabelle, Symbol.explode is used in
  4481 almost all situations.
  4482 
  4483 * Discontinued obsolete function sys_error and exception SYS_ERROR.
  4484 See implementation manual for further details on exceptions in
  4485 Isabelle/ML.
  4486 
  4487 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
  4488 meaning.
  4489 
  4490 * Renamed structure PureThy to Pure_Thy and moved most of its
  4491 operations to structure Global_Theory, to emphasize that this is
  4492 rarely-used global-only stuff.
  4493 
  4494 * Discontinued Output.debug.  Minor INCOMPATIBILITY, use plain writeln
  4495 instead (or tracing for high-volume output).
  4496 
  4497 * Configuration option show_question_marks only affects regular pretty
  4498 printing of types and terms, not raw Term.string_of_vname.
  4499 
  4500 * ML_Context.thm and ML_Context.thms are no longer pervasive.  Rare
  4501 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
  4502 @{thms} for most purposes.
  4503 
  4504 * ML structure Unsynchronized is never opened, not even in Isar
  4505 interaction mode as before.  Old Unsynchronized.set etc. have been
  4506 discontinued -- use plain := instead.  This should be *rare* anyway,
  4507 since modern tools always work via official context data, notably
  4508 configuration options.
  4509 
  4510 * Parallel and asynchronous execution requires special care concerning
  4511 interrupts.  Structure Exn provides some convenience functions that
  4512 avoid working directly with raw Interrupt.  User code must not absorb
  4513 interrupts -- intermediate handling (for cleanup etc.) needs to be
  4514 followed by re-raising of the original exception.  Another common
  4515 source of mistakes are "handle _" patterns, which make the meaning of
  4516 the program subject to physical effects of the environment.
  4517 
  4518 
  4519 
  4520 New in Isabelle2009-2 (June 2010)
  4521 ---------------------------------
  4522 
  4523 *** General ***
  4524 
  4525 * Authentic syntax for *all* logical entities (type classes, type
  4526 constructors, term constants): provides simple and robust
  4527 correspondence between formal entities and concrete syntax.  Within
  4528 the parse tree / AST representations, "constants" are decorated by
  4529 their category (class, type, const) and spelled out explicitly with
  4530 their full internal name.
  4531 
  4532 Substantial INCOMPATIBILITY concerning low-level syntax declarations
  4533 and translations (translation rules and translation functions in ML).
  4534 Some hints on upgrading:
  4535 
  4536   - Many existing uses of 'syntax' and 'translations' can be replaced
  4537     by more modern 'type_notation', 'notation' and 'abbreviation',
  4538     which are independent of this issue.
  4539 
  4540   - 'translations' require markup within the AST; the term syntax
  4541     provides the following special forms:
  4542 
  4543       CONST c   -- produces syntax version of constant c from context
  4544       XCONST c  -- literally c, checked as constant from context
  4545       c         -- literally c, if declared by 'syntax'
  4546 
  4547     Plain identifiers are treated as AST variables -- occasionally the
  4548     system indicates accidental variables via the error "rhs contains
  4549     extra variables".
  4550 
  4551     Type classes and type constructors are marked according to their
  4552     concrete syntax.  Some old translations rules need to be written
  4553     for the "type" category, using type constructor application
  4554     instead of pseudo-term application of the default category
  4555     "logic".
  4556 
  4557   - 'parse_translation' etc. in ML may use the following
  4558     antiquotations:
  4559 
  4560       @{class_syntax c}   -- type class c within parse tree / AST
  4561       @{term_syntax c}    -- type constructor c within parse tree / AST
  4562       @{const_syntax c}   -- ML version of "CONST c" above
  4563       @{syntax_const c}   -- literally c (checked wrt. 'syntax' declarations)
  4564 
  4565   - Literal types within 'typed_print_translations', i.e. those *not*
  4566     represented as pseudo-terms are represented verbatim.  Use @{class
  4567     c} or @{type_name c} here instead of the above syntax
  4568     antiquotations.
  4569 
  4570 Note that old non-authentic syntax was based on unqualified base
  4571 names, so all of the above "constant" names would coincide.  Recall
  4572 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
  4573 diagnose syntax problems.
  4574 
  4575 * Type constructors admit general mixfix syntax, not just infix.
  4576 
  4577 * Concrete syntax may be attached to local entities without a proof
  4578 body, too.  This works via regular mixfix annotations for 'fix',
  4579 'def', 'obtain' etc. or via the explicit 'write' command, which is
  4580 similar to the 'notation' command in theory specifications.
  4581 
  4582 * Discontinued unnamed infix syntax (legacy feature for many years) --
  4583 need to specify constant name and syntax separately.  Internal ML
  4584 datatype constructors have been renamed from InfixName to Infix etc.
  4585 Minor INCOMPATIBILITY.
  4586 
  4587 * Schematic theorem statements need to be explicitly markup as such,
  4588 via commands 'schematic_lemma', 'schematic_theorem',
  4589 'schematic_corollary'.  Thus the relevance of the proof is made
  4590 syntactically clear, which impacts performance in a parallel or
  4591 asynchronous interactive environment.  Minor INCOMPATIBILITY.
  4592 
  4593 * Use of cumulative prems via "!" in some proof methods has been
  4594 discontinued (old legacy feature).
  4595 
  4596 * References 'trace_simp' and 'debug_simp' have been replaced by
  4597 configuration options stored in the context. Enabling tracing (the
  4598 case of debugging is similar) in proofs works via
  4599 
  4600   using [[trace_simp = true]]
  4601 
  4602 Tracing is then active for all invocations of the simplifier in
  4603 subsequent goal refinement steps. Tracing may also still be enabled or
  4604 disabled via the ProofGeneral settings menu.
  4605 
  4606 * Separate commands 'hide_class', 'hide_type', 'hide_const',
  4607 'hide_fact' replace the former 'hide' KIND command.  Minor
  4608 INCOMPATIBILITY.
  4609 
  4610 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
  4611 more efficient than combinations with -q1 or -q2.
  4612 
  4613 
  4614 *** Pure ***
  4615 
  4616 * Proofterms record type-class reasoning explicitly, using the
  4617 "unconstrain" operation internally.  This eliminates all sort
  4618 constraints from a theorem and proof, introducing explicit
  4619 OFCLASS-premises.  On the proof term level, this operation is
  4620 automatically applied at theorem boundaries, such that closed proofs
  4621 are always free of sort constraints.  INCOMPATIBILITY for tools that
  4622 inspect proof terms.
  4623 
  4624 * Local theory specifications may depend on extra type variables that
  4625 are not present in the result type -- arguments TYPE('a) :: 'a itself
  4626 are added internally.  For example:
  4627 
  4628   definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
  4629 
  4630 * Predicates of locales introduced by classes carry a mandatory
  4631 "class" prefix.  INCOMPATIBILITY.
  4632 
  4633 * Vacuous class specifications observe default sort.  INCOMPATIBILITY.
  4634 
  4635 * Old 'axclass' command has been discontinued.  INCOMPATIBILITY, use
  4636 'class' instead.
  4637 
  4638 * Command 'code_reflect' allows to incorporate generated ML code into
  4639 runtime environment; replaces immature code_datatype antiquotation.
  4640 INCOMPATIBILITY.
  4641 
  4642 * Code generator: simple concept for abstract datatypes obeying
  4643 invariants.
  4644 
  4645 * Code generator: details of internal data cache have no impact on the
  4646 user space functionality any longer.
  4647 
  4648 * Methods "unfold_locales" and "intro_locales" ignore non-locale
  4649 subgoals.  This is more appropriate for interpretations with 'where'.
  4650 INCOMPATIBILITY.
  4651 
  4652 * Command 'example_proof' opens an empty proof body.  This allows to
  4653 experiment with Isar, without producing any persistent result.
  4654 
  4655 * Commands 'type_notation' and 'no_type_notation' declare type syntax
  4656 within a local theory context, with explicit checking of the
  4657 constructors involved (in contrast to the raw 'syntax' versions).
  4658 
  4659 * Commands 'types' and 'typedecl' now work within a local theory
  4660 context -- without introducing dependencies on parameters or
  4661 assumptions, which is not possible in Isabelle/Pure.
  4662 
  4663 * Command 'defaultsort' has been renamed to 'default_sort', it works
  4664 within a local theory context.  Minor INCOMPATIBILITY.
  4665 
  4666 
  4667 *** HOL ***
  4668 
  4669 * Command 'typedef' now works within a local theory context -- without
  4670 introducing dependencies on parameters or assumptions, which is not
  4671 possible in Isabelle/Pure/HOL.  Note that the logical environment may
  4672 contain multiple interpretations of local typedefs (with different
  4673 non-emptiness proofs), even in a global theory context.
  4674 
  4675 * New package for quotient types.  Commands 'quotient_type' and
  4676 'quotient_definition' may be used for defining types and constants by
  4677 quotient constructions.  An example is the type of integers created by
  4678 quotienting pairs of natural numbers:
  4679 
  4680   fun
  4681     intrel :: "(nat * nat) => (nat * nat) => bool"
  4682   where
  4683     "intrel (x, y) (u, v) = (x + v = u + y)"
  4684 
  4685   quotient_type int = "nat * nat" / intrel
  4686     by (auto simp add: equivp_def expand_fun_eq)
  4687 
  4688   quotient_definition
  4689     "0::int" is "(0::nat, 0::nat)"
  4690 
  4691 The method "lifting" can be used to lift of theorems from the
  4692 underlying "raw" type to the quotient type.  The example
  4693 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
  4694 construction and provides a reasoning infrastructure for finite sets.
  4695 
  4696 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
  4697 clash with new theory Quotient in Main HOL.
  4698 
  4699 * Moved the SMT binding into the main HOL session, eliminating
  4700 separate HOL-SMT session.
  4701 
  4702 * List membership infix mem operation is only an input abbreviation.
  4703 INCOMPATIBILITY.
  4704 
  4705 * Theory Library/Word.thy has been removed.  Use library Word/Word.thy
  4706 for future developements; former Library/Word.thy is still present in
  4707 the AFP entry RSAPPS.
  4708 
  4709 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
  4710 longer shadowed.  INCOMPATIBILITY.
  4711 
  4712 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
  4713 INCOMPATIBILITY.
  4714 
  4715 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
  4716 INCOMPATIBILITY.
  4717 
  4718 * Dropped normalizing_semiring etc; use the facts in semiring classes
  4719 instead.  INCOMPATIBILITY.
  4720 
  4721 * Dropped several real-specific versions of lemmas about floor and
  4722 ceiling; use the generic lemmas from theory "Archimedean_Field"
  4723 instead.  INCOMPATIBILITY.
  4724 
  4725   floor_number_of_eq         ~> floor_number_of
  4726   le_floor_eq_number_of      ~> number_of_le_floor
  4727   le_floor_eq_zero           ~> zero_le_floor
  4728   le_floor_eq_one            ~> one_le_floor
  4729   floor_less_eq_number_of    ~> floor_less_number_of
  4730   floor_less_eq_zero         ~> floor_less_zero
  4731   floor_less_eq_one          ~> floor_less_one
  4732   less_floor_eq_number_of    ~> number_of_less_floor
  4733   less_floor_eq_zero         ~> zero_less_floor
  4734   less_floor_eq_one          ~> one_less_floor
  4735   floor_le_eq_number_of      ~> floor_le_number_of
  4736   floor_le_eq_zero           ~> floor_le_zero
  4737   floor_le_eq_one            ~> floor_le_one
  4738   floor_subtract_number_of   ~> floor_diff_number_of
  4739   floor_subtract_one         ~> floor_diff_one
  4740   ceiling_number_of_eq       ~> ceiling_number_of
  4741   ceiling_le_eq_number_of    ~> ceiling_le_number_of
  4742   ceiling_le_zero_eq         ~> ceiling_le_zero
  4743   ceiling_le_eq_one          ~> ceiling_le_one
  4744   less_ceiling_eq_number_of  ~> number_of_less_ceiling
  4745   less_ceiling_eq_zero       ~> zero_less_ceiling
  4746   less_ceiling_eq_one        ~> one_less_ceiling
  4747   ceiling_less_eq_number_of  ~> ceiling_less_number_of
  4748   ceiling_less_eq_zero       ~> ceiling_less_zero
  4749   ceiling_less_eq_one        ~> ceiling_less_one
  4750   le_ceiling_eq_number_of    ~> number_of_le_ceiling
  4751   le_ceiling_eq_zero         ~> zero_le_ceiling
  4752   le_ceiling_eq_one          ~> one_le_ceiling
  4753   ceiling_subtract_number_of ~> ceiling_diff_number_of
  4754   ceiling_subtract_one       ~> ceiling_diff_one
  4755 
  4756 * Theory "Finite_Set": various folding_XXX locales facilitate the
  4757 application of the various fold combinators on finite sets.
  4758 
  4759 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
  4760 provides abstract red-black tree type which is backed by "RBT_Impl" as
  4761 implementation.  INCOMPATIBILTY.
  4762 
  4763 * Theory Library/Coinductive_List has been removed -- superseded by
  4764 AFP/thys/Coinductive.
  4765 
  4766 * Theory PReal, including the type "preal" and related operations, has
  4767 been removed.  INCOMPATIBILITY.
  4768 
  4769 * Real: new development using Cauchy Sequences.
  4770 
  4771 * Split off theory "Big_Operators" containing setsum, setprod,
  4772 Inf_fin, Sup_fin, Min, Max from theory Finite_Set.  INCOMPATIBILITY.
  4773 
  4774 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
  4775 "Int" etc.  INCOMPATIBILITY.
  4776 
  4777 * Constant Rat.normalize needs to be qualified.  INCOMPATIBILITY.
  4778 
  4779 * New set of rules "ac_simps" provides combined assoc / commute
  4780 rewrites for all interpretations of the appropriate generic locales.
  4781 
  4782 * Renamed theory "OrderedGroup" to "Groups" and split theory
  4783 "Ring_and_Field" into theories "Rings" and "Fields"; for more
  4784 appropriate and more consistent names suitable for name prefixes
  4785 within the HOL theories.  INCOMPATIBILITY.
  4786 
  4787 * Some generic constants have been put to appropriate theories:
  4788   - less_eq, less: Orderings
  4789   - zero, one, plus, minus, uminus, times, abs, sgn: Groups
  4790   - inverse, divide: Rings
  4791 INCOMPATIBILITY.
  4792 
  4793 * More consistent naming of type classes involving orderings (and
  4794 lattices):
  4795 
  4796     lower_semilattice                   ~> semilattice_inf
  4797     upper_semilattice                   ~> semilattice_sup
  4798 
  4799     dense_linear_order                  ~> dense_linorder
  4800 
  4801     pordered_ab_group_add               ~> ordered_ab_group_add
  4802     pordered_ab_group_add_abs           ~> ordered_ab_group_add_abs
  4803     pordered_ab_semigroup_add           ~> ordered_ab_semigroup_add
  4804     pordered_ab_semigroup_add_imp_le    ~> ordered_ab_semigroup_add_imp_le
  4805     pordered_cancel_ab_semigroup_add    ~> ordered_cancel_ab_semigroup_add
  4806     pordered_cancel_comm_semiring       ~> ordered_cancel_comm_semiring
  4807     pordered_cancel_semiring            ~> ordered_cancel_semiring
  4808     pordered_comm_monoid_add            ~> ordered_comm_monoid_add
  4809     pordered_comm_ring                  ~> ordered_comm_ring
  4810     pordered_comm_semiring              ~> ordered_comm_semiring
  4811     pordered_ring                       ~> ordered_ring
  4812     pordered_ring_abs                   ~> ordered_ring_abs
  4813     pordered_semiring                   ~> ordered_semiring
  4814 
  4815     ordered_ab_group_add                ~> linordered_ab_group_add
  4816     ordered_ab_semigroup_add            ~> linordered_ab_semigroup_add
  4817     ordered_cancel_ab_semigroup_add     ~> linordered_cancel_ab_semigroup_add
  4818     ordered_comm_semiring_strict        ~> linordered_comm_semiring_strict
  4819     ordered_field                       ~> linordered_field
  4820     ordered_field_no_lb                 ~> linordered_field_no_lb
  4821     ordered_field_no_ub                 ~> linordered_field_no_ub
  4822     ordered_field_dense_linear_order    ~> dense_linordered_field
  4823     ordered_idom                        ~> linordered_idom
  4824     ordered_ring                        ~> linordered_ring
  4825     ordered_ring_le_cancel_factor       ~> linordered_ring_le_cancel_factor
  4826     ordered_ring_less_cancel_factor     ~> linordered_ring_less_cancel_factor
  4827     ordered_ring_strict                 ~> linordered_ring_strict
  4828     ordered_semidom                     ~> linordered_semidom
  4829     ordered_semiring                    ~> linordered_semiring
  4830     ordered_semiring_1                  ~> linordered_semiring_1
  4831     ordered_semiring_1_strict           ~> linordered_semiring_1_strict
  4832     ordered_semiring_strict             ~> linordered_semiring_strict
  4833 
  4834   The following slightly odd type classes have been moved to a
  4835   separate theory Library/Lattice_Algebras:
  4836 
  4837     lordered_ab_group_add               ~> lattice_ab_group_add
  4838     lordered_ab_group_add_abs           ~> lattice_ab_group_add_abs
  4839     lordered_ab_group_add_meet          ~> semilattice_inf_ab_group_add
  4840     lordered_ab_group_add_join          ~> semilattice_sup_ab_group_add
  4841     lordered_ring                       ~> lattice_ring
  4842 
  4843 INCOMPATIBILITY.
  4844 
  4845 * Refined field classes:
  4846   - classes division_ring_inverse_zero, field_inverse_zero,
  4847     linordered_field_inverse_zero include rule inverse 0 = 0 --
  4848     subsumes former division_by_zero class;
  4849   - numerous lemmas have been ported from field to division_ring.
  4850 INCOMPATIBILITY.
  4851 
  4852 * Refined algebra theorem collections:
  4853   - dropped theorem group group_simps, use algebra_simps instead;
  4854   - dropped theorem group ring_simps, use field_simps instead;
  4855   - proper theorem collection field_simps subsumes former theorem
  4856     groups field_eq_simps and field_simps;
  4857   - dropped lemma eq_minus_self_iff which is a duplicate for
  4858     equal_neg_zero.
  4859 INCOMPATIBILITY.
  4860 
  4861 * Theory Finite_Set and List: some lemmas have been generalized from
  4862 sets to lattices:
  4863 
  4864   fun_left_comm_idem_inter      ~> fun_left_comm_idem_inf
  4865   fun_left_comm_idem_union      ~> fun_left_comm_idem_sup
  4866   inter_Inter_fold_inter        ~> inf_Inf_fold_inf
  4867   union_Union_fold_union        ~> sup_Sup_fold_sup
  4868   Inter_fold_inter              ~> Inf_fold_inf
  4869   Union_fold_union              ~> Sup_fold_sup
  4870   inter_INTER_fold_inter        ~> inf_INFI_fold_inf
  4871   union_UNION_fold_union        ~> sup_SUPR_fold_sup
  4872   INTER_fold_inter              ~> INFI_fold_inf
  4873   UNION_fold_union              ~> SUPR_fold_sup
  4874 
  4875 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
  4876 replaced by the more convenient lemmas Inf_empty and Sup_empty.
  4877 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
  4878 by Inf_insert and Sup_insert.  Lemmas Inf_UNIV and Sup_UNIV replace
  4879 former Inf_Univ and Sup_Univ.  Lemmas inf_top_right and sup_bot_right
  4880 subsume inf_top and sup_bot respectively.  INCOMPATIBILITY.
  4881 
  4882 * Reorganized theory Multiset: swapped notation of pointwise and
  4883 multiset order:
  4884 
  4885   - pointwise ordering is instance of class order with standard syntax
  4886     <= and <;
  4887   - multiset ordering has syntax <=# and <#; partial order properties
  4888     are provided by means of interpretation with prefix
  4889     multiset_order;
  4890   - less duplication, less historical organization of sections,
  4891     conversion from associations lists to multisets, rudimentary code
  4892     generation;
  4893   - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
  4894     if needed.
  4895 
  4896 Renamed:
  4897 
  4898   multiset_eq_conv_count_eq  ~>  multiset_ext_iff
  4899   multi_count_ext  ~>  multiset_ext
  4900   diff_union_inverse2  ~>  diff_union_cancelR
  4901 
  4902 INCOMPATIBILITY.
  4903 
  4904 * Theory Permutation: replaced local "remove" by List.remove1.
  4905 
  4906 * Code generation: ML and OCaml code is decorated with signatures.
  4907 
  4908 * Theory List: added transpose.
  4909 
  4910 * Library/Nat_Bijection.thy is a collection of bijective functions
  4911 between nat and other types, which supersedes the older libraries
  4912 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy.  INCOMPATIBILITY.
  4913 
  4914   Constants:
  4915   Nat_Int_Bij.nat2_to_nat         ~> prod_encode
  4916   Nat_Int_Bij.nat_to_nat2         ~> prod_decode
  4917   Nat_Int_Bij.int_to_nat_bij      ~> int_encode
  4918   Nat_Int_Bij.nat_to_int_bij      ~> int_decode
  4919   Countable.pair_encode           ~> prod_encode
  4920   NatIso.prod2nat                 ~> prod_encode
  4921   NatIso.nat2prod                 ~> prod_decode
  4922   NatIso.sum2nat                  ~> sum_encode
  4923   NatIso.nat2sum                  ~> sum_decode
  4924   NatIso.list2nat                 ~> list_encode
  4925   NatIso.nat2list                 ~> list_decode
  4926   NatIso.set2nat                  ~> set_encode
  4927   NatIso.nat2set                  ~> set_decode
  4928 
  4929   Lemmas:
  4930   Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_decode
  4931   Nat_Int_Bij.nat2_to_nat_inj     ~> inj_prod_encode
  4932   Nat_Int_Bij.nat2_to_nat_surj    ~> surj_prod_encode
  4933   Nat_Int_Bij.nat_to_nat2_inj     ~> inj_prod_decode
  4934   Nat_Int_Bij.nat_to_nat2_surj    ~> surj_prod_decode
  4935   Nat_Int_Bij.i2n_n2i_id          ~> int_encode_inverse
  4936   Nat_Int_Bij.n2i_i2n_id          ~> int_decode_inverse
  4937   Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
  4938   Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
  4939   Nat_Int_Bij.inj_nat_to_int_bij  ~> inj_int_encode
  4940   Nat_Int_Bij.inj_int_to_nat_bij  ~> inj_int_decode
  4941   Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_encode
  4942   Nat_Int_Bij.bij_int_to_nat_bij  ~> bij_int_decode
  4943 
  4944 * Sledgehammer:
  4945   - Renamed ATP commands:
  4946     atp_info     ~> sledgehammer running_atps
  4947     atp_kill     ~> sledgehammer kill_atps
  4948     atp_messages ~> sledgehammer messages
  4949     atp_minimize ~> sledgehammer minimize
  4950     print_atps   ~> sledgehammer available_atps
  4951     INCOMPATIBILITY.
  4952   - Added user's manual ("isabelle doc sledgehammer").
  4953   - Added option syntax and "sledgehammer_params" to customize
  4954     Sledgehammer's behavior.  See the manual for details.
  4955   - Modified the Isar proof reconstruction code so that it produces
  4956     direct proofs rather than proofs by contradiction.  (This feature
  4957     is still experimental.)
  4958   - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
  4959     full-typed mode.
  4960   - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
  4961 
  4962 * Nitpick:
  4963   - Added and implemented "binary_ints" and "bits" options.
  4964   - Added "std" option and implemented support for nonstandard models.
  4965   - Added and implemented "finitize" option to improve the precision
  4966     of infinite datatypes based on a monotonicity analysis.
  4967   - Added support for quotient types.
  4968   - Added support for "specification" and "ax_specification"
  4969     constructs.
  4970   - Added support for local definitions (for "function" and
  4971     "termination" proofs).
  4972   - Added support for term postprocessors.
  4973   - Optimized "Multiset.multiset" and "FinFun.finfun".
  4974   - Improved efficiency of "destroy_constrs" optimization.
  4975   - Fixed soundness bugs related to "destroy_constrs" optimization and
  4976     record getters.
  4977   - Fixed soundness bug related to higher-order constructors.
  4978   - Fixed soundness bug when "full_descrs" is enabled.
  4979   - Improved precision of set constructs.
  4980   - Added "atoms" option.
  4981   - Added cache to speed up repeated Kodkod invocations on the same
  4982     problems.
  4983   - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
  4984     "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
  4985     "SAT4J_Light".  INCOMPATIBILITY.
  4986   - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
  4987     "sharing_depth", and "show_skolems" options.  INCOMPATIBILITY.
  4988   - Removed "nitpick_intro" attribute.  INCOMPATIBILITY.
  4989 
  4990 * Method "induct" now takes instantiations of the form t, where t is not
  4991   a variable, as a shorthand for "x == t", where x is a fresh variable.
  4992   If this is not intended, t has to be enclosed in parentheses.
  4993   By default, the equalities generated by definitional instantiations
  4994   are pre-simplified, which may cause parameters of inductive cases
  4995   to disappear, or may even delete some of the inductive cases.
  4996   Use "induct (no_simp)" instead of "induct" to restore the old
  4997   behaviour. The (no_simp) option is also understood by the "cases"
  4998   and "nominal_induct" methods, which now perform pre-simplification, too.
  4999   INCOMPATIBILITY.
  5000 
  5001 
  5002 *** HOLCF ***
  5003 
  5004 * Variable names in lemmas generated by the domain package have
  5005 changed; the naming scheme is now consistent with the HOL datatype
  5006 package.  Some proof scripts may be affected, INCOMPATIBILITY.
  5007 
  5008 * The domain package no longer defines the function "foo_copy" for
  5009 recursive domain "foo".  The reach lemma is now stated directly in
  5010 terms of "foo_take".  Lemmas and proofs that mention "foo_copy" must
  5011 be reformulated in terms of "foo_take", INCOMPATIBILITY.
  5012 
  5013 * Most definedness lemmas generated by the domain package (previously
  5014 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
  5015 like "foo$x = UU <-> x = UU", which works better as a simp rule.
  5016 Proofs that used definedness lemmas as intro rules may break,
  5017 potential INCOMPATIBILITY.
  5018 
  5019 * Induction and casedist rules generated by the domain package now
  5020 declare proper case_names (one called "bottom", and one named for each
  5021 constructor).  INCOMPATIBILITY.
  5022 
  5023 * For mutually-recursive domains, separate "reach" and "take_lemma"
  5024 rules are generated for each domain, INCOMPATIBILITY.
  5025 
  5026   foo_bar.reach       ~> foo.reach  bar.reach
  5027   foo_bar.take_lemmas ~> foo.take_lemma  bar.take_lemma
  5028 
  5029 * Some lemmas generated by the domain package have been renamed for
  5030 consistency with the datatype package, INCOMPATIBILITY.
  5031 
  5032   foo.ind        ~> foo.induct
  5033   foo.finite_ind ~> foo.finite_induct
  5034   foo.coind      ~> foo.coinduct
  5035   foo.casedist   ~> foo.exhaust
  5036   foo.exhaust    ~> foo.nchotomy
  5037 
  5038 * For consistency with other definition packages, the fixrec package
  5039 now generates qualified theorem names, INCOMPATIBILITY.
  5040 
  5041   foo_simps  ~> foo.simps
  5042   foo_unfold ~> foo.unfold
  5043   foo_induct ~> foo.induct
  5044 
  5045 * The "fixrec_simp" attribute has been removed.  The "fixrec_simp"
  5046 method and internal fixrec proofs now use the default simpset instead.
  5047 INCOMPATIBILITY.
  5048 
  5049 * The "contlub" predicate has been removed.  Proof scripts should use
  5050 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
  5051 
  5052 * The "admw" predicate has been removed, INCOMPATIBILITY.
  5053 
  5054 * The constants cpair, cfst, and csnd have been removed in favor of
  5055 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
  5056 
  5057 
  5058 *** ML ***
  5059 
  5060 * Antiquotations for basic formal entities:
  5061 
  5062     @{class NAME}         -- type class
  5063     @{class_syntax NAME}  -- syntax representation of the above
  5064 
  5065     @{type_name NAME}     -- logical type
  5066     @{type_abbrev NAME}   -- type abbreviation
  5067     @{nonterminal NAME}   -- type of concrete syntactic category
  5068     @{type_syntax NAME}   -- syntax representation of any of the above
  5069 
  5070     @{const_name NAME}    -- logical constant (INCOMPATIBILITY)
  5071     @{const_abbrev NAME}  -- abbreviated constant
  5072     @{const_syntax NAME}  -- syntax representation of any of the above
  5073 
  5074 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
  5075 syntax constant (cf. 'syntax' command).
  5076 
  5077 * Antiquotation @{make_string} inlines a function to print arbitrary
  5078 values similar to the ML toplevel.  The result is compiler dependent
  5079 and may fall back on "?" in certain situations.
  5080 
  5081 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
  5082 antiquotations @{Isar.state} and @{Isar.goal}.  This replaces impure
  5083 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
  5084 not work with the asynchronous Isar document model.
  5085 
  5086 * Configuration options now admit dynamic default values, depending on
  5087 the context or even global references.
  5088 
  5089 * SHA1.digest digests strings according to SHA-1 (see RFC 3174).  It
  5090 uses an efficient external library if available (for Poly/ML).
  5091 
  5092 * Renamed some important ML structures, while keeping the old names
  5093 for some time as aliases within the structure Legacy:
  5094 
  5095   OuterKeyword  ~>  Keyword
  5096   OuterLex      ~>  Token
  5097   OuterParse    ~>  Parse
  5098   OuterSyntax   ~>  Outer_Syntax
  5099   PrintMode     ~>  Print_Mode
  5100   SpecParse     ~>  Parse_Spec
  5101   ThyInfo       ~>  Thy_Info
  5102   ThyLoad       ~>  Thy_Load
  5103   ThyOutput     ~>  Thy_Output
  5104   TypeInfer     ~>  Type_Infer
  5105 
  5106 Note that "open Legacy" simplifies porting of sources, but forgetting
  5107 to remove it again will complicate porting again in the future.
  5108 
  5109 * Most operations that refer to a global context are named
  5110 accordingly, e.g. Simplifier.global_context or
  5111 ProofContext.init_global.  There are some situations where a global
  5112 context actually works, but under normal circumstances one needs to
  5113 pass the proper local context through the code!
  5114 
  5115 * Discontinued old TheoryDataFun with its copy/init operation -- data
  5116 needs to be pure.  Functor Theory_Data_PP retains the traditional
  5117 Pretty.pp argument to merge, which is absent in the standard
  5118 Theory_Data version.
  5119 
  5120 * Sorts.certify_sort and derived "cert" operations for types and terms
  5121 no longer minimize sorts.  Thus certification at the boundary of the
  5122 inference kernel becomes invariant under addition of class relations,
  5123 which is an important monotonicity principle.  Sorts are now minimized
  5124 in the syntax layer only, at the boundary between the end-user and the
  5125 system.  Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
  5126 explicitly in rare situations.
  5127 
  5128 * Renamed old-style Drule.standard to Drule.export_without_context, to
  5129 emphasize that this is in no way a standard operation.
  5130 INCOMPATIBILITY.
  5131 
  5132 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
  5133 usual for resolution.  Rare INCOMPATIBILITY.
  5134 
  5135 * Renamed varify/unvarify operations to varify_global/unvarify_global
  5136 to emphasize that these only work in a global situation (which is
  5137 quite rare).
  5138 
  5139 * Curried take and drop in library.ML; negative length is interpreted
  5140 as infinity (as in chop).  Subtle INCOMPATIBILITY.
  5141 
  5142 * Proof terms: type substitutions on proof constants now use canonical
  5143 order of type variables.  INCOMPATIBILITY for tools working with proof
  5144 terms.
  5145 
  5146 * Raw axioms/defs may no longer carry sort constraints, and raw defs
  5147 may no longer carry premises.  User-level specifications are
  5148 transformed accordingly by Thm.add_axiom/add_def.
  5149 
  5150 
  5151 *** System ***
  5152 
  5153 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
  5154 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions.  Note that
  5155 proof terms are enabled unconditionally in the new HOL-Proofs image.
  5156 
  5157 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
  5158 feature since Isabelle2009).  Use ISABELLE_PROCESS and ISABELLE_TOOL,
  5159 respectively.
  5160 
  5161 * Old lib/scripts/polyml-platform is superseded by the
  5162 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
  5163 variant, even on a 64 bit machine.  The following example setting
  5164 prefers 64 bit if available:
  5165 
  5166   ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
  5167 
  5168 * The preliminary Isabelle/jEdit application demonstrates the emerging
  5169 Isabelle/Scala layer for advanced prover interaction and integration.
  5170 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
  5171 component.
  5172 
  5173 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
  5174 and Bluesky TeX fonts.  It provides the usual Isabelle symbols,
  5175 similar to the default assignment of the document preparation system
  5176 (cf. isabellesym.sty).  The Isabelle/Scala class Isabelle_System
  5177 provides some operations for direct access to the font without asking
  5178 the user for manual installation.
  5179 
  5180 
  5181 
  5182 New in Isabelle2009-1 (December 2009)
  5183 -------------------------------------
  5184 
  5185 *** General ***
  5186 
  5187 * Discontinued old form of "escaped symbols" such as \\<forall>.  Only
  5188 one backslash should be used, even in ML sources.
  5189 
  5190 
  5191 *** Pure ***
  5192 
  5193 * Locale interpretation propagates mixins along the locale hierarchy.
  5194 The currently only available mixins are the equations used to map
  5195 local definitions to terms of the target domain of an interpretation.
  5196 
  5197 * Reactivated diagnostic command 'print_interps'.  Use "print_interps
  5198 loc" to print all interpretations of locale "loc" in the theory.
  5199 Interpretations in proofs are not shown.
  5200 
  5201 * Thoroughly revised locales tutorial.  New section on conditional
  5202 interpretation.
  5203 
  5204 * On instantiation of classes, remaining undefined class parameters
  5205 are formally declared.  INCOMPATIBILITY.
  5206 
  5207 
  5208 *** Document preparation ***
  5209 
  5210 * New generalized style concept for printing terms: @{foo (style) ...}
  5211 instead of @{foo_style style ...}  (old form is still retained for
  5212 backward compatibility).  Styles can be also applied for
  5213 antiquotations prop, term_type and typeof.
  5214 
  5215 
  5216 *** HOL ***
  5217 
  5218 * New proof method "smt" for a combination of first-order logic with
  5219 equality, linear and nonlinear (natural/integer/real) arithmetic, and
  5220 fixed-size bitvectors; there is also basic support for higher-order
  5221 features (esp. lambda abstractions).  It is an incomplete decision
  5222 procedure based on external SMT solvers using the oracle mechanism;
  5223 for the SMT solver Z3, this method is proof-producing.  Certificates
  5224 are provided to avoid calling the external solvers solely for
  5225 re-checking proofs.  Due to a remote SMT service there is no need for
  5226 installing SMT solvers locally.  See src/HOL/SMT.
  5227 
  5228 * New commands to load and prove verification conditions generated by
  5229 the Boogie program verifier or derived systems (e.g. the Verifying C
  5230 Compiler (VCC) or Spec#).  See src/HOL/Boogie.
  5231 
  5232 * New counterexample generator tool 'nitpick' based on the Kodkod
  5233 relational model finder.  See src/HOL/Tools/Nitpick and
  5234 src/HOL/Nitpick_Examples.
  5235 
  5236 * New commands 'code_pred' and 'values' to invoke the predicate
  5237 compiler and to enumerate values of inductive predicates.
  5238 
  5239 * A tabled implementation of the reflexive transitive closure.
  5240 
  5241 * New implementation of quickcheck uses generic code generator;
  5242 default generators are provided for all suitable HOL types, records
  5243 and datatypes.  Old quickcheck can be re-activated importing theory
  5244 Library/SML_Quickcheck.
  5245 
  5246 * New testing tool Mirabelle for automated proof tools.  Applies
  5247 several tools and tactics like sledgehammer, metis, or quickcheck, to
  5248 every proof step in a theory.  To be used in batch mode via the
  5249 "mirabelle" utility.
  5250 
  5251 * New proof method "sos" (sum of squares) for nonlinear real
  5252 arithmetic (originally due to John Harison). It requires theory
  5253 Library/Sum_Of_Squares.  It is not a complete decision procedure but
  5254 works well in practice on quantifier-free real arithmetic with +, -,
  5255 *, ^, =, <= and <, i.e. boolean combinations of equalities and
  5256 inequalities between polynomials.  It makes use of external
  5257 semidefinite programming solvers.  Method "sos" generates a
  5258 certificate that can be pasted into the proof thus avoiding the need
  5259 to call an external tool every time the proof is checked.  See
  5260 src/HOL/Library/Sum_Of_Squares.
  5261 
  5262 * New method "linarith" invokes existing linear arithmetic decision
  5263 procedure only.
  5264 
  5265 * New command 'atp_minimal' reduces result produced by Sledgehammer.
  5266 
  5267 * New Sledgehammer option "Full Types" in Proof General settings menu.
  5268 Causes full type information to be output to the ATPs.  This slows
  5269 ATPs down considerably but eliminates a source of unsound "proofs"
  5270 that fail later.
  5271 
  5272 * New method "metisFT": A version of metis that uses full type
  5273 information in order to avoid failures of proof reconstruction.
  5274 
  5275 * New evaluator "approximate" approximates an real valued term using
  5276 the same method as the approximation method.
  5277 
  5278 * Method "approximate" now supports arithmetic expressions as
  5279 boundaries of intervals and implements interval splitting and Taylor
  5280 series expansion.
  5281 
  5282 * ML antiquotation @{code_datatype} inserts definition of a datatype
  5283 generated by the code generator; e.g. see src/HOL/Predicate.thy.
  5284 
  5285 * New theory SupInf of the supremum and infimum operators for sets of
  5286 reals.
  5287 
  5288 * New theory Probability, which contains a development of measure
  5289 theory, eventually leading to Lebesgue integration and probability.
  5290 
  5291 * Extended Multivariate Analysis to include derivation and Brouwer's
  5292 fixpoint theorem.
  5293 
  5294 * Reorganization of number theory, INCOMPATIBILITY:
  5295   - new number theory development for nat and int, in theories Divides
  5296     and GCD as well as in new session Number_Theory
  5297   - some constants and facts now suffixed with _nat and _int
  5298     accordingly
  5299   - former session NumberTheory now named Old_Number_Theory, including
  5300     theories Legacy_GCD and Primes (prefer Number_Theory if possible)
  5301   - moved theory Pocklington from src/HOL/Library to
  5302     src/HOL/Old_Number_Theory
  5303 
  5304 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
  5305 lcm of finite and infinite sets. It is shown that they form a complete
  5306 lattice.
  5307 
  5308 * Class semiring_div requires superclass no_zero_divisors and proof of
  5309 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
  5310 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
  5311 generalized to class semiring_div, subsuming former theorems
  5312 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
  5313 zdiv_zmult_zmult2.  div_mult_mult1 is now [simp] by default.
  5314 INCOMPATIBILITY.
  5315 
  5316 * Refinements to lattice classes and sets:
  5317   - less default intro/elim rules in locale variant, more default
  5318     intro/elim rules in class variant: more uniformity
  5319   - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
  5320     le_inf_iff
  5321   - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
  5322     sup_aci)
  5323   - renamed ACI to inf_sup_aci
  5324   - new class "boolean_algebra"
  5325   - class "complete_lattice" moved to separate theory
  5326     "Complete_Lattice"; corresponding constants (and abbreviations)
  5327     renamed and with authentic syntax:
  5328     Set.Inf ~>    Complete_Lattice.Inf
  5329     Set.Sup ~>    Complete_Lattice.Sup
  5330     Set.INFI ~>   Complete_Lattice.INFI
  5331     Set.SUPR ~>   Complete_Lattice.SUPR
  5332     Set.Inter ~>  Complete_Lattice.Inter
  5333     Set.Union ~>  Complete_Lattice.Union
  5334     Set.INTER ~>  Complete_Lattice.INTER
  5335     Set.UNION ~>  Complete_Lattice.UNION
  5336   - authentic syntax for
  5337     Set.Pow
  5338     Set.image
  5339   - mere abbreviations:
  5340     Set.empty               (for bot)
  5341     Set.UNIV                (for top)
  5342     Set.inter               (for inf, formerly Set.Int)
  5343     Set.union               (for sup, formerly Set.Un)
  5344     Complete_Lattice.Inter  (for Inf)
  5345     Complete_Lattice.Union  (for Sup)
  5346     Complete_Lattice.INTER  (for INFI)
  5347     Complete_Lattice.UNION  (for SUPR)
  5348   - object-logic definitions as far as appropriate
  5349 
  5350 INCOMPATIBILITY.  Care is required when theorems Int_subset_iff or
  5351 Un_subset_iff are explicitly deleted as default simp rules; then also
  5352 their lattice counterparts le_inf_iff and le_sup_iff have to be
  5353 deleted to achieve the desired effect.
  5354 
  5355 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
  5356 rules by default any longer; the same applies to min_max.inf_absorb1
  5357 etc.  INCOMPATIBILITY.
  5358 
  5359 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
  5360 pred_set_conv by default.  INCOMPATIBILITY.
  5361 
  5362 * Power operations on relations and functions are now one dedicated
  5363 constant "compow" with infix syntax "^^".  Power operation on
  5364 multiplicative monoids retains syntax "^" and is now defined generic
  5365 in class power.  INCOMPATIBILITY.
  5366 
  5367 * Relation composition "R O S" now has a more standard argument order:
  5368 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}".  INCOMPATIBILITY,
  5369 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
  5370 break, since the O_assoc rule was not rewritten like this.  Fix using
  5371 O_assoc[symmetric].  The same applies to the curried version "R OO S".
  5372 
  5373 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
  5374 abbreviation for "inv_into UNIV".  Lemmas are renamed accordingly.
  5375 INCOMPATIBILITY.
  5376 
  5377 * Most rules produced by inductive and datatype package have mandatory
  5378 prefixes.  INCOMPATIBILITY.
  5379 
  5380 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
  5381 the attribute of the same name.  Each of the theorems in the list
  5382 DERIV_intros assumes composition with an additional function and
  5383 matches a variable to the derivative, which has to be solved by the
  5384 Simplifier.  Hence (auto intro!: DERIV_intros) computes the derivative
  5385 of most elementary terms.  Former Maclauren.DERIV_tac and
  5386 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
  5387 INCOMPATIBILITY.
  5388 
  5389 * Code generator attributes follow the usual underscore convention:
  5390     code_unfold     replaces    code unfold
  5391     code_post       replaces    code post
  5392     etc.
  5393   INCOMPATIBILITY.
  5394 
  5395 * Renamed methods:
  5396     sizechange -> size_change
  5397     induct_scheme -> induction_schema
  5398   INCOMPATIBILITY.
  5399 
  5400 * Discontinued abbreviation "arbitrary" of constant "undefined".
  5401 INCOMPATIBILITY, use "undefined" directly.
  5402 
  5403 * Renamed theorems:
  5404     Suc_eq_add_numeral_1 -> Suc_eq_plus1
  5405     Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
  5406     Suc_plus1 -> Suc_eq_plus1
  5407     *anti_sym -> *antisym*
  5408     vector_less_eq_def -> vector_le_def
  5409   INCOMPATIBILITY.
  5410 
  5411 * Added theorem List.map_map as [simp].  Removed List.map_compose.
  5412 INCOMPATIBILITY.
  5413 
  5414 * Removed predicate "M hassize n" (<--> card M = n & finite M).
  5415 INCOMPATIBILITY.
  5416 
  5417 
  5418 *** HOLCF ***
  5419 
  5420 * Theory Representable defines a class "rep" of domains that are
  5421 representable (via an ep-pair) in the universal domain type "udom".
  5422 Instances are provided for all type constructors defined in HOLCF.
  5423 
  5424 * The 'new_domain' command is a purely definitional version of the
  5425 domain package, for representable domains.  Syntax is identical to the
  5426 old domain package.  The 'new_domain' package also supports indirect
  5427 recursion using previously-defined type constructors.  See
  5428 src/HOLCF/ex/New_Domain.thy for examples.
  5429 
  5430 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
  5431 on the left-hand side of an equation, and then performs
  5432 simplification.  Rewriting is done using rules declared with the
  5433 "fixrec_simp" attribute.  The "fixrec_simp" method is intended as a
  5434 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
  5435 
  5436 * The pattern-match compiler in 'fixrec' can now handle constructors
  5437 with HOL function types.  Pattern-match combinators for the Pair
  5438 constructor are pre-configured.
  5439 
  5440 * The 'fixrec' package now produces better fixed-point induction rules
  5441 for mutually-recursive definitions:  Induction rules have conclusions
  5442 of the form "P foo bar" instead of "P <foo, bar>".
  5443 
  5444 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
  5445 been renamed to "below".  The name "below" now replaces "less" in many
  5446 theorem names.  (Legacy theorem names using "less" are still supported
  5447 as well.)
  5448 
  5449 * The 'fixrec' package now supports "bottom patterns".  Bottom
  5450 patterns can be used to generate strictness rules, or to make
  5451 functions more strict (much like the bang-patterns supported by the
  5452 Glasgow Haskell Compiler).  See src/HOLCF/ex/Fixrec_ex.thy for
  5453 examples.
  5454 
  5455 
  5456 *** ML ***
  5457 
  5458 * Support for Poly/ML 5.3.0, with improved reporting of compiler
  5459 errors and run-time exceptions, including detailed source positions.
  5460 
  5461 * Structure Name_Space (formerly NameSpace) now manages uniquely
  5462 identified entries, with some additional information such as source
  5463 position, logical grouping etc.
  5464 
  5465 * Theory and context data is now introduced by the simplified and
  5466 modernized functors Theory_Data, Proof_Data, Generic_Data.  Data needs
  5467 to be pure, but the old TheoryDataFun for mutable data (with explicit
  5468 copy operation) is still available for some time.
  5469 
  5470 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
  5471 provides a high-level programming interface to synchronized state
  5472 variables with atomic update.  This works via pure function
  5473 application within a critical section -- its runtime should be as
  5474 short as possible; beware of deadlocks if critical code is nested,
  5475 either directly or indirectly via other synchronized variables!
  5476 
  5477 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
  5478 wraps raw ML references, explicitly indicating their non-thread-safe
  5479 behaviour.  The Isar toplevel keeps this structure open, to
  5480 accommodate Proof General as well as quick and dirty interactive
  5481 experiments with references.
  5482 
  5483 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
  5484 parallel tactical reasoning.
  5485 
  5486 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
  5487 are similar to SUBPROOF, but are slightly more flexible: only the
  5488 specified parts of the subgoal are imported into the context, and the
  5489 body tactic may introduce new subgoals and schematic variables.
  5490 
  5491 * Old tactical METAHYPS, which does not observe the proof context, has
  5492 been renamed to Old_Goals.METAHYPS and awaits deletion.  Use SUBPROOF
  5493 or Subgoal.FOCUS etc.
  5494 
  5495 * Renamed functor TableFun to Table, and GraphFun to Graph.  (Since
  5496 functors have their own ML name space there is no point to mark them
  5497 separately.)  Minor INCOMPATIBILITY.
  5498 
  5499 * Renamed NamedThmsFun to Named_Thms.  INCOMPATIBILITY.
  5500 
  5501 * Renamed several structures FooBar to Foo_Bar.  Occasional,
  5502 INCOMPATIBILITY.
  5503 
  5504 * Operations of structure Skip_Proof no longer require quick_and_dirty
  5505 mode, which avoids critical setmp.
  5506 
  5507 * Eliminated old Attrib.add_attributes, Method.add_methods and related
  5508 combinators for "args".  INCOMPATIBILITY, need to use simplified
  5509 Attrib/Method.setup introduced in Isabelle2009.
  5510 
  5511 * Proper context for simpset_of, claset_of, clasimpset_of.  May fall
  5512 back on global_simpset_of, global_claset_of, global_clasimpset_of as
  5513 last resort.  INCOMPATIBILITY.
  5514 
  5515 * Display.pretty_thm now requires a proper context (cf. former
  5516 ProofContext.pretty_thm).  May fall back on Display.pretty_thm_global
  5517 or even Display.pretty_thm_without_context as last resort.
  5518 INCOMPATIBILITY.
  5519 
  5520 * Discontinued Display.pretty_ctyp/cterm etc.  INCOMPATIBILITY, use
  5521 Syntax.pretty_typ/term directly, preferably with proper context
  5522 instead of global theory.
  5523 
  5524 
  5525 *** System ***
  5526 
  5527 * Further fine tuning of parallel proof checking, scales up to 8 cores
  5528 (max. speedup factor 5.0).  See also Goal.parallel_proofs in ML and
  5529 usedir option -q.
  5530 
  5531 * Support for additional "Isabelle components" via etc/components, see
  5532 also the system manual.
  5533 
  5534 * The isabelle makeall tool now operates on all components with
  5535 IsaMakefile, not just hardwired "logics".
  5536 
  5537 * Removed "compress" option from isabelle-process and isabelle usedir;
  5538 this is always enabled.
  5539 
  5540 * Discontinued support for Poly/ML 4.x versions.
  5541 
  5542 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
  5543 on a given logic image.  This requires the lighttpd webserver and is
  5544 currently supported on Linux only.
  5545 
  5546 
  5547 
  5548 New in Isabelle2009 (April 2009)
  5549 --------------------------------
  5550 
  5551 *** General ***
  5552 
  5553 * Simplified main Isabelle executables, with less surprises on
  5554 case-insensitive file-systems (such as Mac OS).
  5555 
  5556   - The main Isabelle tool wrapper is now called "isabelle" instead of
  5557     "isatool."
  5558 
  5559   - The former "isabelle" alias for "isabelle-process" has been
  5560     removed (should rarely occur to regular users).
  5561 
  5562   - The former "isabelle-interface" and its alias "Isabelle" have been
  5563     removed (interfaces are now regular Isabelle tools).
  5564 
  5565 Within scripts and make files, the Isabelle environment variables
  5566 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
  5567 respectively.  (The latter are still available as legacy feature.)
  5568 
  5569 The old isabelle-interface wrapper could react in confusing ways if
  5570 the interface was uninstalled or changed otherwise.  Individual
  5571 interface tool configuration is now more explicit, see also the
  5572 Isabelle system manual.  In particular, Proof General is now available
  5573 via "isabelle emacs".
  5574 
  5575 INCOMPATIBILITY, need to adapt derivative scripts.  Users may need to
  5576 purge installed copies of Isabelle executables and re-run "isabelle
  5577 install -p ...", or use symlinks.
  5578 
  5579 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
  5580 old ~/isabelle, which was slightly non-standard and apt to cause
  5581 surprises on case-insensitive file-systems (such as Mac OS).
  5582 
  5583 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
  5584 ~/isabelle/heaps, ~/isabelle/browser_info to the new place.  Special
  5585 care is required when using older releases of Isabelle.  Note that
  5586 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
  5587 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
  5588 
  5589 * Proofs of fully specified statements are run in parallel on
  5590 multi-core systems.  A speedup factor of 2.5 to 3.2 can be expected on
  5591 a regular 4-core machine, if the initial heap space is made reasonably
  5592 large (cf. Poly/ML option -H).  (Requires Poly/ML 5.2.1 or later.)
  5593 
  5594 * The main reference manuals ("isar-ref", "implementation", and
  5595 "system") have been updated and extended.  Formally checked references
  5596 as hyperlinks are now available uniformly.
  5597 
  5598 
  5599 *** Pure ***
  5600 
  5601 * Complete re-implementation of locales.  INCOMPATIBILITY in several
  5602 respects.  The most important changes are listed below.  See the
  5603 Tutorial on Locales ("locales" manual) for details.
  5604 
  5605 - In locale expressions, instantiation replaces renaming.  Parameters
  5606 must be declared in a for clause.  To aid compatibility with previous
  5607 parameter inheritance, in locale declarations, parameters that are not
  5608 'touched' (instantiation position "_" or omitted) are implicitly added
  5609 with their syntax at the beginning of the for clause.
  5610 
  5611 - Syntax from abbreviations and definitions in locales is available in
  5612 locale expressions and context elements.  The latter is particularly
  5613 useful in locale declarations.
  5614 
  5615 - More flexible mechanisms to qualify names generated by locale
  5616 expressions.  Qualifiers (prefixes) may be specified in locale
  5617 expressions, and can be marked as mandatory (syntax: "name!:") or
  5618 optional (syntax "name?:").  The default depends for plain "name:"
  5619 depends on the situation where a locale expression is used: in
  5620 commands 'locale' and 'sublocale' prefixes are optional, in
  5621 'interpretation' and 'interpret' prefixes are mandatory.  The old
  5622 implicit qualifiers derived from the parameter names of a locale are
  5623 no longer generated.
  5624 
  5625 - Command "sublocale l < e" replaces "interpretation l < e".  The
  5626 instantiation clause in "interpretation" and "interpret" (square
  5627 brackets) is no longer available.  Use locale expressions.
  5628 
  5629 - When converting proof scripts, mandatory qualifiers in
  5630 'interpretation' and 'interpret' should be retained by default, even
  5631 if this is an INCOMPATIBILITY compared to former behavior.  In the
  5632 worst case, use the "name?:" form for non-mandatory ones.  Qualifiers
  5633 in locale expressions range over a single locale instance only.
  5634 
  5635 - Dropped locale element "includes".  This is a major INCOMPATIBILITY.
  5636 In existing theorem specifications replace the includes element by the
  5637 respective context elements of the included locale, omitting those
  5638 that are already present in the theorem specification.  Multiple
  5639 assume elements of a locale should be replaced by a single one
  5640 involving the locale predicate.  In the proof body, declarations (most
  5641 notably theorems) may be regained by interpreting the respective
  5642 locales in the proof context as required (command "interpret").
  5643 
  5644 If using "includes" in replacement of a target solely because the
  5645 parameter types in the theorem are not as general as in the target,
  5646 consider declaring a new locale with additional type constraints on
  5647 the parameters (context element "constrains").
  5648 
  5649 - Discontinued "locale (open)".  INCOMPATIBILITY.
  5650 
  5651 - Locale interpretation commands no longer attempt to simplify goal.
  5652 INCOMPATIBILITY: in rare situations the generated goal differs.  Use
  5653 methods intro_locales and unfold_locales to clarify.
  5654 
  5655 - Locale interpretation commands no longer accept interpretation
  5656 attributes.  INCOMPATIBILITY.
  5657 
  5658 * Class declaration: so-called "base sort" must not be given in import
  5659 list any longer, but is inferred from the specification.  Particularly
  5660 in HOL, write
  5661 
  5662     class foo = ...
  5663 
  5664 instead of
  5665 
  5666     class foo = type + ...
  5667 
  5668 * Class target: global versions of theorems stemming do not carry a
  5669 parameter prefix any longer.  INCOMPATIBILITY.
  5670 
  5671 * Class 'instance' command no longer accepts attached definitions.
  5672 INCOMPATIBILITY, use proper 'instantiation' target instead.
  5673 
  5674 * Recovered hiding of consts, which was accidentally broken in
  5675 Isabelle2007.  Potential INCOMPATIBILITY, ``hide const c'' really
  5676 makes c inaccessible; consider using ``hide (open) const c'' instead.
  5677 
  5678 * Slightly more coherent Pure syntax, with updated documentation in
  5679 isar-ref manual.  Removed locales meta_term_syntax and
  5680 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
  5681 INCOMPATIBILITY in rare situations.  Note that &&& should not be used
  5682 directly in regular applications.
  5683 
  5684 * There is a new syntactic category "float_const" for signed decimal
  5685 fractions (e.g. 123.45 or -123.45).
  5686 
  5687 * Removed exotic 'token_translation' command.  INCOMPATIBILITY, use ML
  5688 interface with 'setup' command instead.
  5689 
  5690 * Command 'local_setup' is similar to 'setup', but operates on a local
  5691 theory context.
  5692 
  5693 * The 'axiomatization' command now only works within a global theory
  5694 context.  INCOMPATIBILITY.
  5695 
  5696 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
  5697 hypotheses.  Sorts required in the course of reasoning need to be
  5698 covered by the constraints in the initial statement, completed by the
  5699 type instance information of the background theory.  Non-trivial sort
  5700 hypotheses, which rarely occur in practice, may be specified via
  5701 vacuous propositions of the form SORT_CONSTRAINT('a::c).  For example:
  5702 
  5703   lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
  5704 
  5705 The result contains an implicit sort hypotheses as before --
  5706 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
  5707 normalization.
  5708 
  5709 * Generalized Isar history, with support for linear undo, direct state
  5710 addressing etc.
  5711 
  5712 * Changed defaults for unify configuration options:
  5713 
  5714   unify_trace_bound = 50 (formerly 25)
  5715   unify_search_bound = 60 (formerly 30)
  5716 
  5717 * Different bookkeeping for code equations (INCOMPATIBILITY):
  5718 
  5719   a) On theory merge, the last set of code equations for a particular
  5720      constant is taken (in accordance with the policy applied by other
  5721      parts of the code generator framework).
  5722 
  5723   b) Code equations stemming from explicit declarations (e.g. code
  5724      attribute) gain priority over default code equations stemming
  5725      from definition, primrec, fun etc.
  5726 
  5727 * Keyword 'code_exception' now named 'code_abort'.  INCOMPATIBILITY.
  5728 
  5729 * Unified theorem tables for both code generators.  Thus [code
  5730 func] has disappeared and only [code] remains.  INCOMPATIBILITY.
  5731 
  5732 * Command 'find_consts' searches for constants based on type and name
  5733 patterns, e.g.
  5734 
  5735     find_consts "_ => bool"
  5736 
  5737 By default, matching is against subtypes, but it may be restricted to
  5738 the whole type.  Searching by name is possible.  Multiple queries are
  5739 conjunctive and queries may be negated by prefixing them with a
  5740 hyphen:
  5741 
  5742     find_consts strict: "_ => bool" name: "Int" -"int => int"
  5743 
  5744 * New 'find_theorems' criterion "solves" matches theorems that
  5745 directly solve the current goal (modulo higher-order unification).
  5746 
  5747 * Auto solve feature for main theorem statements: whenever a new goal
  5748 is stated, "find_theorems solves" is called; any theorems that could
  5749 solve the lemma directly are listed as part of the goal state.
  5750 Cf. associated options in Proof General Isabelle settings menu,
  5751 enabled by default, with reasonable timeout for pathological cases of
  5752 higher-order unification.
  5753 
  5754 
  5755 *** Document preparation ***
  5756 
  5757 * Antiquotation @{lemma} now imitates a regular terminal proof,
  5758 demanding keyword 'by' and supporting the full method expression
  5759 syntax just like the Isar command 'by'.
  5760 
  5761 
  5762 *** HOL ***
  5763 
  5764 * Integrated main parts of former image HOL-Complex with HOL.  Entry
  5765 points Main and Complex_Main remain as before.
  5766 
  5767 * Logic image HOL-Plain provides a minimal HOL with the most important
  5768 tools available (inductive, datatype, primrec, ...).  This facilitates
  5769 experimentation and tool development.  Note that user applications
  5770 (and library theories) should never refer to anything below theory
  5771 Main, as before.
  5772 
  5773 * Logic image HOL-Main stops at theory Main, and thus facilitates
  5774 experimentation due to shorter build times.
  5775 
  5776 * Logic image HOL-NSA contains theories of nonstandard analysis which
  5777 were previously part of former HOL-Complex.  Entry point Hyperreal
  5778 remains valid, but theories formerly using Complex_Main should now use
  5779 new entry point Hypercomplex.
  5780 
  5781 * Generic ATP manager for Sledgehammer, based on ML threads instead of
  5782 Posix processes.  Avoids potentially expensive forking of the ML
  5783 process.  New thread-based implementation also works on non-Unix
  5784 platforms (Cygwin).  Provers are no longer hardwired, but defined
  5785 within the theory via plain ML wrapper functions.  Basic Sledgehammer
  5786 commands are covered in the isar-ref manual.
  5787 
  5788 * Wrapper scripts for remote SystemOnTPTP service allows to use
  5789 sledgehammer without local ATP installation (Vampire etc.). Other
  5790 provers may be included via suitable ML wrappers, see also
  5791 src/HOL/ATP_Linkup.thy.
  5792 
  5793 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
  5794 menu.
  5795 
  5796 * The metis method no longer fails because the theorem is too trivial
  5797 (contains the empty clause).
  5798 
  5799 * The metis method now fails in the usual manner, rather than raising
  5800 an exception, if it determines that it cannot prove the theorem.
  5801 
  5802 * Method "coherent" implements a prover for coherent logic (see also
  5803 src/Tools/coherent.ML).
  5804 
  5805 * Constants "undefined" and "default" replace "arbitrary".  Usually
  5806 "undefined" is the right choice to replace "arbitrary", though
  5807 logically there is no difference.  INCOMPATIBILITY.
  5808 
  5809 * Command "value" now integrates different evaluation mechanisms.  The
  5810 result of the first successful evaluation mechanism is printed.  In
  5811 square brackets a particular named evaluation mechanisms may be
  5812 specified (currently, [SML], [code] or [nbe]).  See further
  5813 src/HOL/ex/Eval_Examples.thy.
  5814 
  5815 * Normalization by evaluation now allows non-leftlinear equations.
  5816 Declare with attribute [code nbe].
  5817 
  5818 * Methods "case_tac" and "induct_tac" now refer to the very same rules
  5819 as the structured Isar versions "cases" and "induct", cf. the
  5820 corresponding "cases" and "induct" attributes.  Mutual induction rules
  5821 are now presented as a list of individual projections
  5822 (e.g. foo_bar.inducts for types foo and bar); the old format with
  5823 explicit HOL conjunction is no longer supported.  INCOMPATIBILITY, in
  5824 rare situations a different rule is selected --- notably nested tuple
  5825 elimination instead of former prod.exhaust: use explicit (case_tac t
  5826 rule: prod.exhaust) here.
  5827 
  5828 * Attributes "cases", "induct", "coinduct" support "del" option.
  5829 
  5830 * Removed fact "case_split_thm", which duplicates "case_split".
  5831 
  5832 * The option datatype has been moved to a new theory Option.  Renamed
  5833 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
  5834 
  5835 * New predicate "strict_mono" classifies strict functions on partial
  5836 orders.  With strict functions on linear orders, reasoning about
  5837 (in)equalities is facilitated by theorems "strict_mono_eq",
  5838 "strict_mono_less_eq" and "strict_mono_less".
  5839 
  5840 * Some set operations are now proper qualified constants with
  5841 authentic syntax.  INCOMPATIBILITY:
  5842 
  5843     op Int ~>   Set.Int
  5844     op Un ~>    Set.Un
  5845     INTER ~>    Set.INTER
  5846     UNION ~>    Set.UNION
  5847     Inter ~>    Set.Inter
  5848     Union ~>    Set.Union
  5849     {} ~>       Set.empty
  5850     UNIV ~>     Set.UNIV
  5851 
  5852 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
  5853 theory Set.
  5854 
  5855 * Auxiliary class "itself" has disappeared -- classes without any
  5856 parameter are treated as expected by the 'class' command.
  5857 
  5858 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
  5859 
  5860 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
  5861 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
  5862 
  5863 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
  5864 method "approximation".  It proves formulas on real values by using
  5865 interval arithmetic.  In the formulas are also the transcendental
  5866 functions sin, cos, tan, atan, ln, exp and the constant pi are
  5867 allowed. For examples see
  5868 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
  5869 
  5870 * Theory "Reflection" now resides in HOL/Library.
  5871 
  5872 * Entry point to Word library now simply named "Word".
  5873 INCOMPATIBILITY.
  5874 
  5875 * Made source layout more coherent with logical distribution
  5876 structure:
  5877 
  5878     src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
  5879     src/HOL/Library/Code_Message.thy ~> src/HOL/
  5880     src/HOL/Library/GCD.thy ~> src/HOL/
  5881     src/HOL/Library/Order_Relation.thy ~> src/HOL/
  5882     src/HOL/Library/Parity.thy ~> src/HOL/
  5883     src/HOL/Library/Univ_Poly.thy ~> src/HOL/
  5884     src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
  5885     src/HOL/Real/Lubs.thy ~> src/HOL/
  5886     src/HOL/Real/PReal.thy ~> src/HOL/
  5887     src/HOL/Real/Rational.thy ~> src/HOL/
  5888     src/HOL/Real/RComplete.thy ~> src/HOL/
  5889     src/HOL/Real/RealDef.thy ~> src/HOL/
  5890     src/HOL/Real/RealPow.thy ~> src/HOL/
  5891     src/HOL/Real/Real.thy ~> src/HOL/
  5892     src/HOL/Complex/Complex_Main.thy ~> src/HOL/
  5893     src/HOL/Complex/Complex.thy ~> src/HOL/
  5894     src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
  5895     src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
  5896     src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
  5897     src/HOL/Hyperreal/Fact.thy ~> src/HOL/
  5898     src/HOL/Hyperreal/Integration.thy ~> src/HOL/
  5899     src/HOL/Hyperreal/Lim.thy ~> src/HOL/
  5900     src/HOL/Hyperreal/Ln.thy ~> src/HOL/
  5901     src/HOL/Hyperreal/Log.thy ~> src/HOL/
  5902     src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
  5903     src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
  5904     src/HOL/Hyperreal/Series.thy ~> src/HOL/
  5905     src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
  5906     src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
  5907     src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
  5908     src/HOL/Real/Float ~> src/HOL/Library/
  5909     src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
  5910     src/HOL/Real/RealVector.thy ~> src/HOL/
  5911 
  5912     src/HOL/arith_data.ML ~> src/HOL/Tools
  5913     src/HOL/hologic.ML ~> src/HOL/Tools
  5914     src/HOL/simpdata.ML ~> src/HOL/Tools
  5915     src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
  5916     src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
  5917     src/HOL/nat_simprocs.ML ~> src/HOL/Tools
  5918     src/HOL/Real/float_arith.ML ~> src/HOL/Tools
  5919     src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
  5920     src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
  5921     src/HOL/Real/real_arith.ML ~> src/HOL/Tools
  5922 
  5923     src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
  5924     src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
  5925     src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
  5926     src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
  5927     src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
  5928     src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
  5929 
  5930 * If methods "eval" and "evaluation" encounter a structured proof
  5931 state with !!/==>, only the conclusion is evaluated to True (if
  5932 possible), avoiding strange error messages.
  5933 
  5934 * Method "sizechange" automates termination proofs using (a
  5935 modification of) the size-change principle.  Requires SAT solver.  See
  5936 src/HOL/ex/Termination.thy for examples.
  5937 
  5938 * Simplifier: simproc for let expressions now unfolds if bound
  5939 variable occurs at most once in let expression body.  INCOMPATIBILITY.
  5940 
  5941 * Method "arith": Linear arithmetic now ignores all inequalities when
  5942 fast_arith_neq_limit is exceeded, instead of giving up entirely.
  5943 
  5944 * New attribute "arith" for facts that should always be used
  5945 automatically by arithmetic. It is intended to be used locally in
  5946 proofs, e.g.
  5947 
  5948   assumes [arith]: "x > 0"
  5949 
  5950 Global usage is discouraged because of possible performance impact.
  5951 
  5952 * New classes "top" and "bot" with corresponding operations "top" and
  5953 "bot" in theory Orderings; instantiation of class "complete_lattice"
  5954 requires instantiation of classes "top" and "bot".  INCOMPATIBILITY.
  5955 
  5956 * Changed definition lemma "less_fun_def" in order to provide an
  5957 instance for preorders on functions; use lemma "less_le" instead.
  5958 INCOMPATIBILITY.
  5959 
  5960 * Theory Orderings: class "wellorder" moved here, with explicit
  5961 induction rule "less_induct" as assumption.  For instantiation of
  5962 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
  5963 INCOMPATIBILITY.
  5964 
  5965 * Theory Orderings: added class "preorder" as superclass of "order".
  5966 INCOMPATIBILITY: Instantiation proofs for order, linorder
  5967 etc. slightly changed.  Some theorems named order_class.* now named
  5968 preorder_class.*.
  5969 
  5970 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
  5971 "diag" to "Id_on".
  5972 
  5973 * Theory Finite_Set: added a new fold combinator of type
  5974 
  5975   ('a => 'b => 'b) => 'b => 'a set => 'b
  5976 
  5977 Occasionally this is more convenient than the old fold combinator
  5978 which is now defined in terms of the new one and renamed to
  5979 fold_image.
  5980 
  5981 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
  5982 and "ring_simps" have been replaced by "algebra_simps" (which can be
  5983 extended with further lemmas!).  At the moment both still exist but
  5984 the former will disappear at some point.
  5985 
  5986 * Theory Power: Lemma power_Suc is now declared as a simp rule in
  5987 class recpower.  Type-specific simp rules for various recpower types
  5988 have been removed.  INCOMPATIBILITY, rename old lemmas as follows:
  5989 
  5990 rat_power_0    -> power_0
  5991 rat_power_Suc  -> power_Suc
  5992 realpow_0      -> power_0
  5993 realpow_Suc    -> power_Suc
  5994 complexpow_0   -> power_0
  5995 complexpow_Suc -> power_Suc
  5996 power_poly_0   -> power_0
  5997 power_poly_Suc -> power_Suc
  5998 
  5999 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
  6000 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
  6001 dvd has been generalized to class comm_semiring_1.  Likewise a bunch
  6002 of lemmas from Divides has been generalized from nat to class
  6003 semiring_div.  INCOMPATIBILITY.  This involves the following theorem
  6004 renames resulting from duplicate elimination:
  6005 
  6006     dvd_def_mod ~>          dvd_eq_mod_eq_0
  6007     zero_dvd_iff ~>         dvd_0_left_iff
  6008     dvd_0 ~>                dvd_0_right
  6009     DIVISION_BY_ZERO_DIV ~> div_by_0
  6010     DIVISION_BY_ZERO_MOD ~> mod_by_0
  6011     mult_div ~>             div_mult_self2_is_id
  6012     mult_mod ~>             mod_mult_self2_is_0
  6013 
  6014 * Theory IntDiv: removed many lemmas that are instances of class-based
  6015 generalizations (from Divides and Ring_and_Field).  INCOMPATIBILITY,
  6016 rename old lemmas as follows:
  6017 
  6018 dvd_diff               -> nat_dvd_diff
  6019 dvd_zminus_iff         -> dvd_minus_iff
  6020 mod_add1_eq            -> mod_add_eq
  6021 mod_mult1_eq           -> mod_mult_right_eq
  6022 mod_mult1_eq'          -> mod_mult_left_eq
  6023 mod_mult_distrib_mod   -> mod_mult_eq
  6024 nat_mod_add_left_eq    -> mod_add_left_eq
  6025 nat_mod_add_right_eq   -> mod_add_right_eq
  6026 nat_mod_div_trivial    -> mod_div_trivial
  6027 nat_mod_mod_trivial    -> mod_mod_trivial
  6028 zdiv_zadd_self1        -> div_add_self1
  6029 zdiv_zadd_self2        -> div_add_self2
  6030 zdiv_zmult_self1       -> div_mult_self2_is_id
  6031 zdiv_zmult_self2       -> div_mult_self1_is_id
  6032 zdvd_triv_left         -> dvd_triv_left
  6033 zdvd_triv_right        -> dvd_triv_right
  6034 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
  6035 zmod_eq0_zdvd_iff      -> dvd_eq_mod_eq_0[symmetric]
  6036 zmod_zadd_left_eq      -> mod_add_left_eq
  6037 zmod_zadd_right_eq     -> mod_add_right_eq
  6038 zmod_zadd_self1        -> mod_add_self1
  6039 zmod_zadd_self2        -> mod_add_self2
  6040 zmod_zadd1_eq          -> mod_add_eq
  6041 zmod_zdiff1_eq         -> mod_diff_eq
  6042 zmod_zdvd_zmod         -> mod_mod_cancel
  6043 zmod_zmod_cancel       -> mod_mod_cancel
  6044 zmod_zmult_self1       -> mod_mult_self2_is_0
  6045 zmod_zmult_self2       -> mod_mult_self1_is_0
  6046 zmod_1                 -> mod_by_1
  6047 zdiv_1                 -> div_by_1
  6048 zdvd_abs1              -> abs_dvd_iff
  6049 zdvd_abs2              -> dvd_abs_iff
  6050 zdvd_refl              -> dvd_refl
  6051 zdvd_trans             -> dvd_trans
  6052 zdvd_zadd              -> dvd_add
  6053 zdvd_zdiff             -> dvd_diff
  6054 zdvd_zminus_iff        -> dvd_minus_iff
  6055 zdvd_zminus2_iff       -> minus_dvd_iff
  6056 zdvd_zmultD            -> dvd_mult_right
  6057 zdvd_zmultD2           -> dvd_mult_left
  6058 zdvd_zmult_mono        -> mult_dvd_mono
  6059 zdvd_0_right           -> dvd_0_right
  6060 zdvd_0_left            -> dvd_0_left_iff
  6061 zdvd_1_left            -> one_dvd
  6062 zminus_dvd_iff         -> minus_dvd_iff
  6063 
  6064 * Theory Rational: 'Fract k 0' now equals '0'.  INCOMPATIBILITY.
  6065 
  6066 * The real numbers offer decimal input syntax: 12.34 is translated
  6067 into 1234/10^2. This translation is not reversed upon output.
  6068 
  6069 * Theory Library/Polynomial defines an abstract type 'a poly of
  6070 univariate polynomials with coefficients of type 'a.  In addition to
  6071 the standard ring operations, it also supports div and mod.  Code
  6072 generation is also supported, using list-style constructors.
  6073 
  6074 * Theory Library/Inner_Product defines a class of real_inner for real
  6075 inner product spaces, with an overloaded operation inner :: 'a => 'a
  6076 => real.  Class real_inner is a subclass of real_normed_vector from
  6077 theory RealVector.
  6078 
  6079 * Theory Library/Product_Vector provides instances for the product
  6080 type 'a * 'b of several classes from RealVector and Inner_Product.
  6081 Definitions of addition, subtraction, scalar multiplication, norms,
  6082 and inner products are included.
  6083 
  6084 * Theory Library/Bit defines the field "bit" of integers modulo 2.  In
  6085 addition to the field operations, numerals and case syntax are also
  6086 supported.
  6087 
  6088 * Theory Library/Diagonalize provides constructive version of Cantor's
  6089 first diagonalization argument.
  6090 
  6091 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
  6092 zlcm (for int); carried together from various gcd/lcm developements in
  6093 the HOL Distribution.  Constants zgcd and zlcm replace former igcd and
  6094 ilcm; corresponding theorems renamed accordingly.  INCOMPATIBILITY,
  6095 may recover tupled syntax as follows:
  6096 
  6097     hide (open) const gcd
  6098     abbreviation gcd where
  6099       "gcd == (%(a, b). GCD.gcd a b)"
  6100     notation (output)
  6101       GCD.gcd ("gcd '(_, _')")
  6102 
  6103 The same works for lcm, zgcd, zlcm.
  6104 
  6105 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
  6106 instantiations for algebraic structures.  Removed some duplicate
  6107 theorems.  Changes in simp rules.  INCOMPATIBILITY.
  6108 
  6109 * ML antiquotation @{code} takes a constant as argument and generates
  6110 corresponding code in background and inserts name of the corresponding
  6111 resulting ML value/function/datatype constructor binding in place.
  6112 All occurrences of @{code} with a single ML block are generated
  6113 simultaneously.  Provides a generic and safe interface for
  6114 instrumentalizing code generation.  See
  6115 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
  6116 In future you ought to refrain from ad-hoc compiling generated SML
  6117 code on the ML toplevel.  Note that (for technical reasons) @{code}
  6118 cannot refer to constants for which user-defined serializations are
  6119 set.  Refer to the corresponding ML counterpart directly in that
  6120 cases.
  6121 
  6122 * Command 'rep_datatype': instead of theorem names the command now
  6123 takes a list of terms denoting the constructors of the type to be
  6124 represented as datatype.  The characteristic theorems have to be
  6125 proven.  INCOMPATIBILITY.  Also observe that the following theorems
  6126 have disappeared in favour of existing ones:
  6127 
  6128     unit_induct                 ~> unit.induct
  6129     prod_induct                 ~> prod.induct
  6130     sum_induct                  ~> sum.induct
  6131     Suc_Suc_eq                  ~> nat.inject
  6132     Suc_not_Zero Zero_not_Suc   ~> nat.distinct
  6133 
  6134 
  6135 *** HOL-Algebra ***
  6136 
  6137 * New locales for orders and lattices where the equivalence relation
  6138 is not restricted to equality.  INCOMPATIBILITY: all order and lattice
  6139 locales use a record structure with field eq for the equivalence.
  6140 
  6141 * New theory of factorial domains.
  6142 
  6143 * Units_l_inv and Units_r_inv are now simp rules by default.
  6144 INCOMPATIBILITY.  Simplifier proof that require deletion of l_inv
  6145 and/or r_inv will now also require deletion of these lemmas.
  6146 
  6147 * Renamed the following theorems, INCOMPATIBILITY:
  6148 
  6149 UpperD ~> Upper_memD
  6150 LowerD ~> Lower_memD
  6151 least_carrier ~> least_closed
  6152 greatest_carrier ~> greatest_closed
  6153 greatest_Lower_above ~> greatest_Lower_below
  6154 one_zero ~> carrier_one_zero
  6155 one_not_zero ~> carrier_one_not_zero  (collision with assumption)
  6156 
  6157 
  6158 *** HOL-Nominal ***
  6159 
  6160 * Nominal datatypes can now contain type-variables.
  6161 
  6162 * Commands 'nominal_inductive' and 'equivariance' work with local
  6163 theory targets.
  6164 
  6165 * Nominal primrec can now works with local theory targets and its
  6166 specification syntax now conforms to the general format as seen in
  6167 'inductive' etc.
  6168 
  6169 * Method "perm_simp" honours the standard simplifier attributes
  6170 (no_asm), (no_asm_use) etc.
  6171 
  6172 * The new predicate #* is defined like freshness, except that on the
  6173 left hand side can be a set or list of atoms.
  6174 
  6175 * Experimental command 'nominal_inductive2' derives strong induction
  6176 principles for inductive definitions.  In contrast to
  6177 'nominal_inductive', which can only deal with a fixed number of
  6178 binders, it can deal with arbitrary expressions standing for sets of
  6179 atoms to be avoided.  The only inductive definition we have at the
  6180 moment that needs this generalisation is the typing rule for Lets in
  6181 the algorithm W:
  6182 
  6183  Gamma |- t1 : T1   (x,close Gamma T1)::Gamma |- t2 : T2   x#Gamma
  6184  -----------------------------------------------------------------
  6185          Gamma |- Let x be t1 in t2 : T2
  6186 
  6187 In this rule one wants to avoid all the binders that are introduced by
  6188 "close Gamma T1".  We are looking for other examples where this
  6189 feature might be useful.  Please let us know.
  6190 
  6191 
  6192 *** HOLCF ***
  6193 
  6194 * Reimplemented the simplification procedure for proving continuity
  6195 subgoals.  The new simproc is extensible; users can declare additional
  6196 continuity introduction rules with the attribute [cont2cont].
  6197 
  6198 * The continuity simproc now uses a different introduction rule for
  6199 solving continuity subgoals on terms with lambda abstractions.  In
  6200 some rare cases the new simproc may fail to solve subgoals that the
  6201 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
  6202 Potential INCOMPATIBILITY.
  6203 
  6204 * Command 'fixrec': specification syntax now conforms to the general
  6205 format as seen in 'inductive' etc.  See src/HOLCF/ex/Fixrec_ex.thy for
  6206 examples.  INCOMPATIBILITY.
  6207 
  6208 
  6209 *** ZF ***
  6210 
  6211 * Proof of Zorn's Lemma for partial orders.
  6212 
  6213 
  6214 *** ML ***
  6215 
  6216 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
  6217 Poly/ML 5.2.1 or later.  Important note: the TimeLimit facility
  6218 depends on multithreading, so timouts will not work before Poly/ML
  6219 5.2.1!
  6220 
  6221 * High-level support for concurrent ML programming, see
  6222 src/Pure/Cuncurrent.  The data-oriented model of "future values" is
  6223 particularly convenient to organize independent functional
  6224 computations.  The concept of "synchronized variables" provides a
  6225 higher-order interface for components with shared state, avoiding the
  6226 delicate details of mutexes and condition variables.  (Requires
  6227 Poly/ML 5.2.1 or later.)
  6228 
  6229 * ML bindings produced via Isar commands are stored within the Isar
  6230 context (theory or proof).  Consequently, commands like 'use' and 'ML'
  6231 become thread-safe and work with undo as expected (concerning
  6232 top-level bindings, not side-effects on global references).
  6233 INCOMPATIBILITY, need to provide proper Isar context when invoking the
  6234 compiler at runtime; really global bindings need to be given outside a
  6235 theory.  (Requires Poly/ML 5.2 or later.)
  6236 
  6237 * Command 'ML_prf' is analogous to 'ML' but works within a proof
  6238 context.  Top-level ML bindings are stored within the proof context in
  6239 a purely sequential fashion, disregarding the nested proof structure.
  6240 ML bindings introduced by 'ML_prf' are discarded at the end of the
  6241 proof.  (Requires Poly/ML 5.2 or later.)
  6242 
  6243 * Simplified ML attribute and method setup, cf. functions Attrib.setup
  6244 and Method.setup, as well as Isar commands 'attribute_setup' and
  6245 'method_setup'.  INCOMPATIBILITY for 'method_setup', need to simplify
  6246 existing code accordingly, or use plain 'setup' together with old
  6247 Method.add_method.
  6248 
  6249 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
  6250 to 'a -> thm, while results are always tagged with an authentic oracle
  6251 name.  The Isar command 'oracle' is now polymorphic, no argument type
  6252 is specified.  INCOMPATIBILITY, need to simplify existing oracle code
  6253 accordingly.  Note that extra performance may be gained by producing
  6254 the cterm carefully, avoiding slow Thm.cterm_of.
  6255 
  6256 * Simplified interface for defining document antiquotations via
  6257 ThyOutput.antiquotation, ThyOutput.output, and optionally
  6258 ThyOutput.maybe_pretty_source.  INCOMPATIBILITY, need to simplify user
  6259 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
  6260 examples.
  6261 
  6262 * More systematic treatment of long names, abstract name bindings, and
  6263 name space operations.  Basic operations on qualified names have been
  6264 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
  6265 Long_Name.append.  Old type bstring has been mostly replaced by
  6266 abstract type binding (see structure Binding), which supports precise