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