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