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