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