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