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