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