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