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