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