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