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