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