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