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