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