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