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