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