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