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