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