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