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