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