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