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