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