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