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