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