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