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