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