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