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