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