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