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