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