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