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