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