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