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