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