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