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