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