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