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