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