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