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