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