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