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