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