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