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