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