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