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