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