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