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