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