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