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