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