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