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