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