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