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