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