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