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