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