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