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