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