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