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