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