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