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