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