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