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