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