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