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