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