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