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