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