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