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