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