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