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