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