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