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