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