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