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