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