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