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