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