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