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