NEWS
author blanchet
Thu Aug 30 18:40:53 2018 +0200 (15 months ago)
changeset 68848 8825efd1c2cf
parent 68824 7414ce0256e1
child 68879 feb1b1b3c51f
permissions -rw-r--r--
updated URL to remote TPTP, following heads-up from Geoff Sutcliffe
wenzelm@57491
     1
Isabelle NEWS -- history of user-relevant changes
wenzelm@57491
     2
=================================================
wenzelm@2553
     3
wenzelm@62114
     4
(Note: Isabelle/jEdit shows a tree-view of the NEWS file in Sidekick.)
wenzelm@60006
     5
wenzelm@64603
     6
wenzelm@68683
     7
New in this Isabelle version
wenzelm@68683
     8
----------------------------
wenzelm@68683
     9
wenzelm@68770
    10
*** System ***
wenzelm@68770
    11
wenzelm@68770
    12
* Isabelle server command "use_theories" supports "nodes_status_delay"
wenzelm@68770
    13
for continuous output of node status information. The time interval is
wenzelm@68770
    14
specified in seconds; a negative value means it is disabled (default).
wenzelm@68683
    15
wenzelm@68683
    16
haftmann@68796
    17
*** HOL ***
haftmann@68796
    18
haftmann@68796
    19
* Simplified syntax setup for big operators under image. In rare
haftmann@68796
    20
situations, type conversions are not inserted implicitly any longer
haftmann@68796
    21
and need to be given explicitly. Auxiliary abbreviations INFIMUM,
haftmann@68796
    22
SUPREMUM, UNION, INTER should now rarely occur in output and are just
haftmann@68796
    23
retained as migration auxiliary. INCOMPATIBILITY.
haftmann@68796
    24
blanchet@68848
    25
* Sledgehammer: The URL for SystemOnTPTP, which is used by remote
blanchet@68848
    26
provers, has been updated.
blanchet@68848
    27
haftmann@68796
    28
wenzelm@68803
    29
*** ML ***
wenzelm@68803
    30
wenzelm@68803
    31
* Original PolyML.pointerEq is retained as a convenience for tools that
wenzelm@68803
    32
don't use Isabelle/ML (where this is called "pointer_eq").
wenzelm@68803
    33
wenzelm@68824
    34
* ML evaluation (notably via commands 'ML' and 'ML_file') is subject to
wenzelm@68824
    35
option ML_environment to select a named environment, such as "Isabelle"
wenzelm@68824
    36
for Isabelle/ML, or "SML" for official Standard ML. It is also possible
wenzelm@68824
    37
to move toplevel bindings between environments, using a notation with
wenzelm@68824
    38
">" as separator. For example:
wenzelm@68824
    39
wenzelm@68824
    40
  declare [[ML_environment = "Isabelle>SML"]]
wenzelm@68824
    41
  ML \<open>val println = writeln\<close>
wenzelm@68824
    42
wenzelm@68824
    43
  declare [[ML_environment = "SML"]]
wenzelm@68824
    44
  ML \<open>println "test"\<close>
wenzelm@68824
    45
wenzelm@68824
    46
  declare [[ML_environment = "Isabelle"]]
wenzelm@68824
    47
  ML \<open>println\<close>  \<comment> \<open>not present\<close>
wenzelm@68824
    48
wenzelm@68824
    49
The Isabelle/ML function ML_Env.setup defines new ML environments. This
wenzelm@68824
    50
is useful to incorporate big SML projects in an isolated name space, and
wenzelm@68824
    51
potentially with variations on ML syntax (existing ML_Env.SML_operations
wenzelm@68824
    52
observes the official standard).
wenzelm@68803
    53
wenzelm@68803
    54
wenzelm@68391
    55
New in Isabelle2018 (August 2018)
wenzelm@68391
    56
---------------------------------
wenzelm@66651
    57
wenzelm@66712
    58
*** General ***
wenzelm@66712
    59
wenzelm@68393
    60
* Session-qualified theory names are mandatory: it is no longer possible
wenzelm@68393
    61
to refer to unqualified theories from the parent session.
wenzelm@68393
    62
INCOMPATIBILITY for old developments that have not been updated to
wenzelm@68393
    63
Isabelle2017 yet (using the "isabelle imports" tool).
wenzelm@68393
    64
wenzelm@68393
    65
* Only the most fundamental theory names are global, usually the entry
wenzelm@68393
    66
points to major logic sessions: Pure, Main, Complex_Main, HOLCF, IFOL,
wenzelm@68393
    67
FOL, ZF, ZFC etc. INCOMPATIBILITY, need to use qualified names for
wenzelm@68393
    68
formerly global "HOL-Probability.Probability" and "HOL-SPARK.SPARK".
wenzelm@68393
    69
wenzelm@68558
    70
* Global facts need to be closed: no free variables and no hypotheses.
wenzelm@68558
    71
Rare INCOMPATIBILITY.
wenzelm@68540
    72
wenzelm@68661
    73
* Facts stemming from locale interpretation are subject to lazy
wenzelm@68661
    74
evaluation for improved performance. Rare INCOMPATIBILITY: errors
wenzelm@68661
    75
stemming from interpretation morphisms might be deferred and thus
wenzelm@68661
    76
difficult to locate; enable system option "strict_facts" temporarily to
wenzelm@68661
    77
avoid this.
wenzelm@68661
    78
wenzelm@67446
    79
* Marginal comments need to be written exclusively in the new-style form
wenzelm@67446
    80
"\<comment> \<open>text\<close>", old ASCII variants like "-- {* ... *}" are no longer
wenzelm@67446
    81
supported. INCOMPATIBILITY, use the command-line tool "isabelle
wenzelm@67446
    82
update_comments" to update existing theory files.
wenzelm@67446
    83
wenzelm@67507
    84
* Old-style inner comments (* ... *) within the term language are legacy
wenzelm@67507
    85
and will be discontinued soon: use formal comments "\<comment> \<open>...\<close>" or "\<^cancel>\<open>...\<close>"
wenzelm@67507
    86
instead.
wenzelm@67507
    87
nipkow@67402
    88
* The "op <infix-op>" syntax for infix operators has been replaced by
nipkow@67400
    89
"(<infix-op>)". If <infix-op> begins or ends with a "*", there needs to
nipkow@67400
    90
be a space between the "*" and the corresponding parenthesis.
wenzelm@68543
    91
INCOMPATIBILITY, use the command-line tool "isabelle update_op" to
wenzelm@68543
    92
convert theory and ML files to the new syntax. Because it is based on
wenzelm@68543
    93
regular expression matching, the result may need a bit of manual
wenzelm@68543
    94
postprocessing. Invoking "isabelle update_op" converts all files in the
wenzelm@68543
    95
current directory (recursively). In case you want to exclude conversion
wenzelm@68543
    96
of ML files (because the tool frequently also converts ML's "op"
wenzelm@68543
    97
syntax), use option "-m".
nipkow@67398
    98
wenzelm@67013
    99
* Theory header 'abbrevs' specifications need to be separated by 'and'.
wenzelm@67013
   100
INCOMPATIBILITY.
wenzelm@67013
   101
wenzelm@66757
   102
* Command 'external_file' declares the formal dependency on the given
wenzelm@66757
   103
file name, such that the Isabelle build process knows about it, but
wenzelm@66757
   104
without specific Prover IDE management.
wenzelm@66757
   105
wenzelm@66759
   106
* Session ROOT entries no longer allow specification of 'files'. Rare
wenzelm@66759
   107
INCOMPATIBILITY, use command 'external_file' within a proper theory
wenzelm@66759
   108
context.
wenzelm@66759
   109
wenzelm@66764
   110
* Session root directories may be specified multiple times: each
wenzelm@66764
   111
accessible ROOT file is processed only once. This facilitates
wenzelm@66764
   112
specification of $ISABELLE_HOME_USER/ROOTS or command-line options like
wenzelm@66764
   113
-d or -D for "isabelle build" and "isabelle jedit". Example:
wenzelm@66764
   114
wenzelm@66764
   115
  isabelle build -D '~~/src/ZF'
wenzelm@66764
   116
wenzelm@67263
   117
* The command 'display_drafts' has been discontinued. INCOMPATIBILITY,
wenzelm@67263
   118
use action "isabelle.draft" (or "print") in Isabelle/jEdit instead.
wenzelm@67263
   119
wenzelm@68393
   120
* In HTML output, the Isabelle symbol "\<hyphen>" is rendered as explicit
wenzelm@68393
   121
Unicode hyphen U+2010, to avoid unclear meaning of the old "soft hyphen"
wenzelm@68393
   122
U+00AD. Rare INCOMPATIBILITY, e.g. copy-paste of historic Isabelle HTML
wenzelm@68393
   123
output.
wenzelm@67305
   124
wenzelm@66712
   125
wenzelm@67261
   126
*** Isabelle/jEdit Prover IDE ***
wenzelm@66768
   127
wenzelm@68393
   128
* The command-line tool "isabelle jedit" provides more flexible options
wenzelm@68393
   129
for session management:
wenzelm@68393
   130
wenzelm@68472
   131
  - option -R builds an auxiliary logic image with all theories from
wenzelm@68472
   132
    other sessions that are not already present in its parent
wenzelm@68393
   133
wenzelm@68393
   134
  - option -S is like -R, with a focus on the selected session and its
wenzelm@68393
   135
    descendants (this reduces startup time for big projects like AFP)
wenzelm@68393
   136
wenzelm@68472
   137
  - option -A specifies an alternative ancestor session for options -R
wenzelm@68472
   138
    and -S
wenzelm@68472
   139
wenzelm@68541
   140
  - option -i includes additional sessions into the name-space of
wenzelm@68541
   141
    theories
wenzelm@68541
   142
wenzelm@68393
   143
  Examples:
wenzelm@68393
   144
    isabelle jedit -R HOL-Number_Theory
wenzelm@68393
   145
    isabelle jedit -R HOL-Number_Theory -A HOL
wenzelm@68393
   146
    isabelle jedit -d '$AFP' -S Formal_SSA -A HOL
wenzelm@68393
   147
    isabelle jedit -d '$AFP' -S Formal_SSA -A HOL-Analysis
wenzelm@68541
   148
    isabelle jedit -d '$AFP' -S Formal_SSA -A HOL-Analysis -i CryptHOL
wenzelm@68393
   149
wenzelm@68393
   150
* PIDE markup for session ROOT files: allows to complete session names,
wenzelm@68393
   151
follow links to theories and document files etc.
wenzelm@68393
   152
wenzelm@68393
   153
* Completion supports theory header imports, using theory base name.
wenzelm@68393
   154
E.g. "Prob" may be completed to "HOL-Probability.Probability".
wenzelm@68393
   155
wenzelm@68393
   156
* Named control symbols (without special Unicode rendering) are shown as
wenzelm@68393
   157
bold-italic keyword. This is particularly useful for the short form of
wenzelm@68393
   158
antiquotations with control symbol: \<^name>\<open>argument\<close>. The action
wenzelm@68393
   159
"isabelle.antiquoted_cartouche" turns an antiquotation with 0 or 1
wenzelm@68393
   160
arguments into this format.
wenzelm@68393
   161
wenzelm@68393
   162
* Completion provides templates for named symbols with arguments,
wenzelm@68393
   163
e.g. "\<comment> \<open>ARGUMENT\<close>" or "\<^emph>\<open>ARGUMENT\<close>".
wenzelm@68393
   164
wenzelm@68368
   165
* Slightly more parallel checking, notably for high priority print
wenzelm@68368
   166
functions (e.g. State output).
wenzelm@68368
   167
wenzelm@68080
   168
* The view title is set dynamically, according to the Isabelle
wenzelm@68080
   169
distribution and the logic session name. The user can override this via
wenzelm@68080
   170
set-view-title (stored persistently in $JEDIT_SETTINGS/perspective.xml).
wenzelm@68080
   171
wenzelm@67395
   172
* System options "spell_checker_include" and "spell_checker_exclude"
wenzelm@67395
   173
supersede former "spell_checker_elements" to determine regions of text
wenzelm@67395
   174
that are subject to spell-checking. Minor INCOMPATIBILITY.
wenzelm@67395
   175
wenzelm@67248
   176
* Action "isabelle.preview" is able to present more file formats,
wenzelm@67266
   177
notably bibtex database files and ML files.
wenzelm@67246
   178
wenzelm@67262
   179
* Action "isabelle.draft" is similar to "isabelle.preview", but shows a
wenzelm@68067
   180
plain-text document draft. Both are available via the menu "Plugins /
wenzelm@68067
   181
Isabelle".
wenzelm@67262
   182
wenzelm@67304
   183
* When loading text files, the Isabelle symbols encoding UTF-8-Isabelle
wenzelm@67304
   184
is only used if there is no conflict with existing Unicode sequences in
wenzelm@67304
   185
the file. Otherwise, the fallback encoding is plain UTF-8 and Isabelle
wenzelm@67304
   186
symbols remain in literal \<symbol> form. This avoids accidental loss of
wenzelm@67304
   187
Unicode content when saving the file.
wenzelm@67304
   188
wenzelm@68545
   189
* Bibtex database files (.bib) are semantically checked.
wenzelm@68545
   190
wenzelm@67993
   191
* Update to jedit-5.5.0, the latest release.
wenzelm@67993
   192
wenzelm@67246
   193
wenzelm@67261
   194
*** Isabelle/VSCode Prover IDE ***
wenzelm@67261
   195
wenzelm@67261
   196
* HTML preview of theories and other file-formats similar to
wenzelm@67261
   197
Isabelle/jEdit.
wenzelm@67261
   198
wenzelm@68690
   199
* Command-line tool "isabelle vscode_server" accepts the same options
wenzelm@68690
   200
-A, -R, -S, -i for session selection as "isabelle jedit". This is
wenzelm@68690
   201
relevant for isabelle.args configuration settings in VSCode. The former
wenzelm@68690
   202
option -A (explore all known session files) has been discontinued: it is
wenzelm@68690
   203
enabled by default, unless option -S is used to focus on a particular
wenzelm@68690
   204
spot in the session structure. INCOMPATIBILITY.
wenzelm@68690
   205
wenzelm@66768
   206
wenzelm@67140
   207
*** Document preparation ***
wenzelm@67140
   208
wenzelm@67448
   209
* Formal comments work uniformly in outer syntax, inner syntax (term
wenzelm@67448
   210
language), Isabelle/ML and some other embedded languages of Isabelle.
wenzelm@67448
   211
See also "Document comments" in the isar-ref manual. The following forms
wenzelm@67448
   212
are supported:
wenzelm@67448
   213
wenzelm@67448
   214
  - marginal text comment: \<comment> \<open>\<dots>\<close>
wenzelm@67448
   215
  - canceled source: \<^cancel>\<open>\<dots>\<close>
wenzelm@67448
   216
  - raw LaTeX: \<^latex>\<open>\<dots>\<close>
wenzelm@67413
   217
wenzelm@67381
   218
* Outside of the inner theory body, the default presentation context is
wenzelm@67381
   219
theory Pure. Thus elementary antiquotations may be used in markup
wenzelm@67381
   220
commands (e.g. 'chapter', 'section', 'text') and formal comments.
wenzelm@67381
   221
wenzelm@68513
   222
* System option "document_tags" specifies alternative command tags. This
wenzelm@68513
   223
is occasionally useful to control the global visibility of commands via
wenzelm@68513
   224
session options (e.g. in ROOT).
wenzelm@67140
   225
wenzelm@67140
   226
* Document markup commands ('section', 'text' etc.) are implicitly
wenzelm@67140
   227
tagged as "document" and visible by default. This avoids the application
wenzelm@67140
   228
of option "document_tags" to these commands.
wenzelm@67140
   229
wenzelm@67145
   230
* Isabelle names are mangled into LaTeX macro names to allow the full
wenzelm@67145
   231
identifier syntax with underscore, prime, digits. This is relevant for
wenzelm@67145
   232
antiquotations in control symbol notation, e.g. \<^const_name> becomes
wenzelm@67145
   233
\isactrlconstUNDERSCOREname.
wenzelm@67145
   234
wenzelm@68393
   235
* Document preparation with skip_proofs option now preserves the content
wenzelm@68393
   236
more accurately: only terminal proof steps ('by' etc.) are skipped.
wenzelm@67297
   237
wenzelm@68484
   238
* Document antiquotation @{theory name} requires the long
wenzelm@68484
   239
session-qualified theory name: this is what users reading the text
wenzelm@68484
   240
normally need to import.
wenzelm@68484
   241
wenzelm@67219
   242
* Document antiquotation @{session name} checks and prints the given
wenzelm@67219
   243
session name verbatim.
wenzelm@67219
   244
wenzelm@68393
   245
* Document antiquotation @{cite} now checks the given Bibtex entries
wenzelm@68393
   246
against the Bibtex database files -- only in batch-mode session builds.
wenzelm@67157
   247
wenzelm@67176
   248
* Command-line tool "isabelle document" has been re-implemented in
wenzelm@67194
   249
Isabelle/Scala, with simplified arguments and explicit errors from the
wenzelm@67203
   250
latex and bibtex process. Minor INCOMPATIBILITY.
wenzelm@67173
   251
wenzelm@68393
   252
* Session ROOT entry: empty 'document_files' means there is no document
wenzelm@68393
   253
for this session. There is no need to specify options [document = false]
wenzelm@68393
   254
anymore.
wenzelm@68393
   255
wenzelm@67140
   256
wenzelm@67702
   257
*** Isar ***
wenzelm@67702
   258
wenzelm@67702
   259
* Command 'interpret' no longer exposes resulting theorems as literal
wenzelm@67702
   260
facts, notably for the \<open>prop\<close> notation or the "fact" proof method. This
wenzelm@67702
   261
improves modularity of proofs and scalability of locale interpretation.
wenzelm@67702
   262
Rare INCOMPATIBILITY, need to refer to explicitly named facts instead
wenzelm@67702
   263
(e.g. use 'find_theorems' or 'try' to figure this out).
wenzelm@67702
   264
wenzelm@68393
   265
* The old 'def' command has been discontinued (legacy since
wenzelm@68393
   266
Isbelle2016-1). INCOMPATIBILITY, use 'define' instead -- usually with
wenzelm@68393
   267
object-logic equality or equivalence.
wenzelm@68393
   268
wenzelm@68543
   269
wenzelm@68543
   270
*** Pure ***
wenzelm@68543
   271
wenzelm@68543
   272
* The inner syntax category "sort" now includes notation "_" for the
wenzelm@68543
   273
dummy sort: it is effectively ignored in type-inference.
wenzelm@68543
   274
ballarin@67740
   275
* Rewrites clauses (keyword 'rewrites') were moved into the locale
wenzelm@68393
   276
expression syntax, where they are part of locale instances. In
wenzelm@68393
   277
interpretation commands rewrites clauses now need to occur before 'for'
ballarin@68469
   278
and 'defines'. Rare INCOMPATIBILITY; definitions immediately subject to
ballarin@68469
   279
rewriting may need to be pulled up into the surrounding theory.
wenzelm@68393
   280
wenzelm@68393
   281
* For 'rewrites' clauses, if activating a locale instance fails, fall
wenzelm@68393
   282
back to reading the clause first. This helps avoid qualification of
ballarin@67764
   283
locale instances where the qualifier's sole purpose is avoiding
ballarin@67764
   284
duplicate constant declarations.
ballarin@67741
   285
wenzelm@68543
   286
* Proof method "simp" now supports a new modifier "flip:" followed by a
wenzelm@68543
   287
list of theorems. Each of these theorems is removed from the simpset
wenzelm@68543
   288
(without warning if it is not there) and the symmetric version of the
wenzelm@68543
   289
theorem (i.e. lhs and rhs exchanged) is added to the simpset. For "auto"
wenzelm@68543
   290
and friends the modifier is "simp flip:".
wenzelm@67718
   291
wenzelm@67718
   292
blanchet@66661
   293
*** HOL ***
blanchet@66661
   294
wenzelm@68568
   295
* Sledgehammer: bundled version of "vampire" (for non-commercial users)
wenzelm@68568
   296
helps to avoid fragility of "remote_vampire" service.
wenzelm@68568
   297
haftmann@68028
   298
* Clarified relationship of characters, strings and code generation:
haftmann@68028
   299
wenzelm@68393
   300
  - Type "char" is now a proper datatype of 8-bit values.
wenzelm@68393
   301
wenzelm@68393
   302
  - Conversions "nat_of_char" and "char_of_nat" are gone; use more
wenzelm@68393
   303
    general conversions "of_char" and "char_of" with suitable type
wenzelm@68393
   304
    constraints instead.
wenzelm@68393
   305
wenzelm@68393
   306
  - The zero character is just written "CHR 0x00", not "0" any longer.
wenzelm@68393
   307
wenzelm@68393
   308
  - Type "String.literal" (for code generation) is now isomorphic to
wenzelm@68393
   309
    lists of 7-bit (ASCII) values; concrete values can be written as
wenzelm@68393
   310
    "STR ''...''" for sequences of printable characters and "STR 0x..."
wenzelm@68393
   311
    for one single ASCII code point given as hexadecimal numeral.
wenzelm@68393
   312
wenzelm@68393
   313
  - Type "String.literal" supports concatenation "... + ..." for all
wenzelm@68393
   314
    standard target languages.
wenzelm@68393
   315
wenzelm@68393
   316
  - Theory HOL-Library.Code_Char is gone; study the explanations
wenzelm@68393
   317
    concerning "String.literal" in the tutorial on code generation to
wenzelm@68393
   318
    get an idea how target-language string literals can be converted to
wenzelm@68393
   319
    HOL string values and vice versa.
wenzelm@68393
   320
wenzelm@68393
   321
  - Session Imperative-HOL: operation "raise" directly takes a value of
wenzelm@68393
   322
    type "String.literal" as argument, not type "string".
wenzelm@68393
   323
wenzelm@68393
   324
INCOMPATIBILITY.
wenzelm@68393
   325
wenzelm@68393
   326
* Code generation: Code generation takes an explicit option
wenzelm@68393
   327
"case_insensitive" to accomodate case-insensitive file systems.
wenzelm@68393
   328
wenzelm@68393
   329
* Abstract bit operations as part of Main: push_bit, take_bit, drop_bit.
wenzelm@68393
   330
wenzelm@68393
   331
* New, more general, axiomatization of complete_distrib_lattice. The
wenzelm@68393
   332
former axioms:
wenzelm@68393
   333
wenzelm@68393
   334
  "sup x (Inf X) = Inf (sup x ` X)" and "inf x (Sup X) = Sup (inf x ` X)"
wenzelm@68393
   335
wenzelm@68393
   336
are replaced by:
wenzelm@68393
   337
wenzelm@68393
   338
  "Inf (Sup ` A) <= Sup (Inf ` {f ` A | f . (! Y \<in> A . f Y \<in> Y)})"
wenzelm@68393
   339
wenzelm@68393
   340
The instantiations of sets and functions as complete_distrib_lattice are
wenzelm@68393
   341
moved to Hilbert_Choice.thy because their proofs need the Hilbert choice
wenzelm@68393
   342
operator. The dual of this property is also proved in theory
wenzelm@68393
   343
HOL.Hilbert_Choice.
eberlm@67831
   344
lp15@67999
   345
* New syntax for the minimum/maximum of a function over a finite set:
wenzelm@68393
   346
MIN x\<in>A. B and even MIN x. B (only useful for finite types), also MAX.
lp15@67999
   347
haftmann@67525
   348
* Clarifed theorem names:
haftmann@67525
   349
haftmann@67525
   350
  Min.antimono ~> Min.subset_imp
haftmann@67525
   351
  Max.antimono ~> Max.subset_imp
haftmann@67525
   352
haftmann@67525
   353
Minor INCOMPATIBILITY.
haftmann@67525
   354
blanchet@66661
   355
* SMT module:
wenzelm@68393
   356
blanchet@66661
   357
  - The 'smt_oracle' option is now necessary when using the 'smt' method
blanchet@66662
   358
    with a solver other than Z3. INCOMPATIBILITY.
wenzelm@68393
   359
wenzelm@66844
   360
  - The encoding to first-order logic is now more complete in the
wenzelm@66844
   361
    presence of higher-order quantifiers. An 'smt_explicit_application'
wenzelm@66844
   362
    option has been added to control this. INCOMPATIBILITY.
wenzelm@66844
   363
haftmann@66804
   364
* Facts sum.commute(_restrict) and prod.commute(_restrict) renamed to
wenzelm@66844
   365
sum.swap(_restrict) and prod.swap(_restrict), to avoid name clashes on
wenzelm@66844
   366
interpretation of abstract locales. INCOMPATIBILITY.
haftmann@66804
   367
wenzelm@68393
   368
* Predicate coprime is now a real definition, not a mere abbreviation.
wenzelm@68393
   369
INCOMPATIBILITY.
wenzelm@68393
   370
haftmann@66803
   371
* Predicate pairwise_coprime abolished, use "pairwise coprime" instead.
haftmann@66803
   372
INCOMPATIBILITY.
haftmann@66803
   373
lp15@68373
   374
* The relator rel_filter on filters has been strengthened to its
wenzelm@68393
   375
canonical categorical definition with better properties.
wenzelm@68393
   376
INCOMPATIBILITY.
Andreas@67616
   377
immler@68072
   378
* Generalized linear algebra involving linear, span, dependent, dim
immler@68072
   379
from type class real_vector to locales module and vector_space.
immler@68072
   380
Renamed:
wenzelm@68393
   381
wenzelm@68393
   382
  span_inc ~> span_superset
wenzelm@68393
   383
  span_superset ~> span_base
wenzelm@68393
   384
  span_eq ~> span_eq_iff
wenzelm@68393
   385
wenzelm@68393
   386
INCOMPATIBILITY.
wenzelm@66844
   387
haftmann@66937
   388
* Class linordered_semiring_1 covers zero_less_one also, ruling out
haftmann@66937
   389
pathologic instances. Minor INCOMPATIBILITY.
haftmann@66937
   390
wenzelm@68393
   391
* Theory HOL.List: functions "sorted_wrt" and "sorted" now compare every
wenzelm@68393
   392
element in a list to all following elements, not just the next one.
wenzelm@68393
   393
wenzelm@68393
   394
* Theory HOL.List syntax:
wenzelm@68393
   395
wenzelm@68393
   396
  - filter-syntax "[x <- xs. P]" is no longer output syntax, but only
wenzelm@68393
   397
    input syntax
wenzelm@68393
   398
wenzelm@68393
   399
  - list comprehension syntax now supports tuple patterns in "pat <- xs"
nipkow@68249
   400
nipkow@68450
   401
* Theory Map: "empty" must now be qualified as "Map.empty".
nipkow@68450
   402
haftmann@67051
   403
* Removed nat-int transfer machinery. Rare INCOMPATIBILITY.
haftmann@67051
   404
haftmann@68100
   405
* Fact mod_mult_self4 (on nat) renamed to Suc_mod_mult_self3, to avoid
haftmann@68100
   406
clash with fact mod_mult_self4 (on more generic semirings).
haftmann@68100
   407
INCOMPATIBILITY.
haftmann@68100
   408
haftmann@68100
   409
* Eliminated some theorem aliasses:
haftmann@68100
   410
  even_times_iff ~> even_mult_iff
haftmann@68100
   411
  mod_2_not_eq_zero_eq_one_nat ~> not_mod_2_eq_0_eq_1
haftmann@68100
   412
  even_of_nat ~> even_int_iff
haftmann@68100
   413
haftmann@68100
   414
INCOMPATIBILITY.
haftmann@68100
   415
haftmann@68157
   416
* Eliminated some theorem duplicate variations:
wenzelm@68393
   417
wenzelm@68393
   418
  - dvd_eq_mod_eq_0_numeral can be replaced by dvd_eq_mod_eq_0
wenzelm@68393
   419
  - mod_Suc_eq_Suc_mod can be replaced by mod_Suc
wenzelm@68393
   420
  - mod_Suc_eq_Suc_mod [symmetrict] can be replaced by mod_simps
wenzelm@68393
   421
  - mod_eq_0_iff can be replaced by mod_eq_0_iff_dvd and dvd_def
wenzelm@68393
   422
  - the witness of mod_eqD can be given directly as "_ div _"
haftmann@68157
   423
haftmann@68157
   424
INCOMPATIBILITY.
haftmann@68157
   425
haftmann@68260
   426
* Classical setup: Assumption "m mod d = 0" (for m d :: nat) is no
wenzelm@68393
   427
longer aggresively destroyed to "\<exists>q. m = d * q". INCOMPATIBILITY, adding
wenzelm@68393
   428
"elim!: dvd" to classical proof methods in most situations restores
wenzelm@68393
   429
broken proofs.
wenzelm@68393
   430
wenzelm@68393
   431
* Theory HOL-Library.Conditional_Parametricity provides command
wenzelm@68393
   432
'parametric_constant' for proving parametricity of non-recursive
wenzelm@68393
   433
definitions. For constants that are not fully parametric the command
wenzelm@68393
   434
will infer conditions on relations (e.g., bi_unique, bi_total, or type
wenzelm@68393
   435
class conditions such as "respects 0") sufficient for parametricity. See
wenzelm@68393
   436
theory HOL-ex.Conditional_Parametricity_Examples for some examples.
wenzelm@68393
   437
wenzelm@68393
   438
* Theory HOL-Library.Code_Lazy provides a new preprocessor for the code
wenzelm@68393
   439
generator to generate code for algebraic types with lazy evaluation
Andreas@68639
   440
semantics even in call-by-value target languages. See the theories
wenzelm@68647
   441
HOL-ex.Code_Lazy_Demo and HOL-Codegenerator_Test.Code_Lazy_Test for some
wenzelm@68647
   442
examples.
wenzelm@68393
   443
wenzelm@68393
   444
* Theory HOL-Library.Landau_Symbols has been moved here from AFP.
wenzelm@68393
   445
wenzelm@68393
   446
* Theory HOL-Library.Old_Datatype no longer provides the legacy command
wenzelm@68393
   447
'old_datatype'. INCOMPATIBILITY.
wenzelm@68393
   448
wenzelm@68393
   449
* Theory HOL-Computational_Algebra.Polynomial_Factorial does not provide
wenzelm@68393
   450
instances of rat, real, complex as factorial rings etc. Import
wenzelm@68393
   451
HOL-Computational_Algebra.Field_as_Ring explicitly in case of need.
wenzelm@68393
   452
INCOMPATIBILITY.
wenzelm@68393
   453
wenzelm@68393
   454
* Session HOL-Algebra: renamed (^) to [^] to avoid conflict with new
wenzelm@68393
   455
infix/prefix notation.
wenzelm@68393
   456
wenzelm@68543
   457
* Session HOL-Algebra: revamped with much new material. The set of
wenzelm@68543
   458
isomorphisms between two groups is now denoted iso rather than iso_set.
wenzelm@68543
   459
INCOMPATIBILITY.
wenzelm@68543
   460
wenzelm@68543
   461
* Session HOL-Analysis: the Arg function now respects the same interval
wenzelm@68543
   462
as Ln, namely (-pi,pi]; the old Arg function has been renamed Arg2pi.
lp15@68499
   463
INCOMPATIBILITY.
lp15@68499
   464
wenzelm@68548
   465
* Session HOL-Analysis: the functions zorder, zer_poly, porder and
wenzelm@68548
   466
pol_poly have been redefined. All related lemmas have been reworked.
wl302@68531
   467
INCOMPATIBILITY.
wl302@68531
   468
wenzelm@68393
   469
* Session HOL-Analysis: infinite products, Moebius functions, the
wenzelm@68393
   470
Riemann mapping theorem, the Vitali covering theorem,
wenzelm@68393
   471
change-of-variables results for integration and measures.
haftmann@68260
   472
wenzelm@68647
   473
* Session HOL-Real_Asymp: proof method "real_asymp" proves asymptotics
wenzelm@68647
   474
or real-valued functions (limits, "Big-O", etc.) automatically.
wenzelm@68681
   475
See also ~~/src/HOL/Real_Asymp/Manual for some documentation.
wenzelm@68647
   476
wenzelm@68545
   477
* Session HOL-Types_To_Sets: more tool support (unoverload_type combines
wenzelm@68545
   478
internalize_sorts and unoverload) and larger experimental application
wenzelm@68545
   479
(type based linear algebra transferred to linear algebra on subspaces).
immler@68522
   480
wenzelm@66651
   481
wenzelm@68116
   482
*** ML ***
wenzelm@68116
   483
wenzelm@68116
   484
* Operation Export.export emits theory exports (arbitrary blobs), which
wenzelm@68116
   485
are stored persistently in the session build database.
wenzelm@68116
   486
wenzelm@68276
   487
* Command 'ML_export' exports ML toplevel bindings to the global
wenzelm@68276
   488
bootstrap environment of the ML process. This allows ML evaluation
wenzelm@68276
   489
without a formal theory context, e.g. in command-line tools like
wenzelm@68276
   490
"isabelle process".
wenzelm@68276
   491
wenzelm@68116
   492
wenzelm@66729
   493
*** System ***
wenzelm@66729
   494
wenzelm@67088
   495
* Mac OS X 10.10 Yosemite is now the baseline version; Mavericks is no
wenzelm@67088
   496
longer supported.
wenzelm@67088
   497
wenzelm@68393
   498
* Linux and Windows/Cygwin is for x86_64 only, old 32bit platform
wenzelm@68393
   499
support has been discontinued.
wenzelm@68393
   500
wenzelm@66906
   501
* Java runtime is for x86_64 only. Corresponding Isabelle settings have
wenzelm@66906
   502
been renamed to ISABELLE_TOOL_JAVA_OPTIONS and JEDIT_JAVA_OPTIONS,
wenzelm@66906
   503
instead of former 32/64 variants. INCOMPATIBILITY.
wenzelm@66906
   504
wenzelm@68003
   505
* Old settings ISABELLE_PLATFORM and ISABELLE_WINDOWS_PLATFORM should be
wenzelm@68003
   506
phased out due to unclear preference of 32bit vs. 64bit architecture.
wenzelm@68003
   507
Explicit GNU bash expressions are now preferred, for example (with
wenzelm@68003
   508
quotes):
wenzelm@68003
   509
wenzelm@68003
   510
  #Posix executables (Unix or Cygwin), with preference for 64bit
wenzelm@68003
   511
  "${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}"
wenzelm@68003
   512
wenzelm@68003
   513
  #native Windows or Unix executables, with preference for 64bit
wenzelm@68003
   514
  "${ISABELLE_WINDOWS_PLATFORM64:-${ISABELLE_WINDOWS_PLATFORM32:-${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}}}"
wenzelm@68003
   515
wenzelm@68003
   516
  #native Windows (32bit) or Unix executables (preference for 64bit)
wenzelm@68003
   517
  "${ISABELLE_WINDOWS_PLATFORM32:-${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}}"
wenzelm@68003
   518
wenzelm@66745
   519
* Command-line tool "isabelle build" supports new options:
wenzelm@66745
   520
  - option -B NAME: include session NAME and all descendants
wenzelm@66745
   521
  - option -S: only observe changes of sources, not heap images
wenzelm@66841
   522
  - option -f: forces a fresh build
wenzelm@66737
   523
wenzelm@68734
   524
* Command-line tool "isabelle build" options -c -x -B refer to
wenzelm@68734
   525
descendants wrt. the session parent or import graph. Subtle
wenzelm@68734
   526
INCOMPATIBILITY: options -c -x used to refer to the session parent graph
wenzelm@68734
   527
only.
wenzelm@68734
   528
wenzelm@66843
   529
* Command-line tool "isabelle build" takes "condition" options with the
wenzelm@66843
   530
corresponding environment values into account, when determining the
wenzelm@66843
   531
up-to-date status of a session.
wenzelm@66843
   532
wenzelm@68393
   533
* The command-line tool "dump" dumps information from the cumulative
wenzelm@68393
   534
PIDE session database: many sessions may be loaded into a given logic
wenzelm@68393
   535
image, results from all loaded theories are written to the output
wenzelm@68393
   536
directory.
wenzelm@68393
   537
wenzelm@66851
   538
* Command-line tool "isabelle imports -I" also reports actual session
wenzelm@66851
   539
imports. This helps to minimize the session dependency graph.
wenzelm@66851
   540
wenzelm@68393
   541
* The command-line tool "export" and 'export_files' in session ROOT
wenzelm@68393
   542
entries retrieve theory exports from the session build database.
wenzelm@68393
   543
wenzelm@68393
   544
* The command-line tools "isabelle server" and "isabelle client" provide
wenzelm@68393
   545
access to the Isabelle Server: it supports responsive session management
wenzelm@68393
   546
and concurrent use of theories, based on Isabelle/PIDE infrastructure.
wenzelm@68393
   547
See also the "system" manual.
wenzelm@68393
   548
wenzelm@68393
   549
* The command-line tool "isabelle update_comments" normalizes formal
wenzelm@68393
   550
comments in outer syntax as follows: \<comment> \<open>text\<close> (whith a single space to
wenzelm@68393
   551
approximate the appearance in document output). This is more specific
wenzelm@68393
   552
than former "isabelle update_cartouches -c": the latter tool option has
wenzelm@68393
   553
been discontinued.
wenzelm@68393
   554
wenzelm@68393
   555
* The command-line tool "isabelle mkroot" now always produces a document
wenzelm@68393
   556
outline: its options have been adapted accordingly. INCOMPATIBILITY.
wenzelm@68393
   557
wenzelm@68393
   558
* The command-line tool "isabelle mkroot -I" initializes a Mercurial
wenzelm@68393
   559
repository for the generated session files.
wenzelm@68393
   560
wenzelm@68523
   561
* Settings ISABELLE_HEAPS + ISABELLE_BROWSER_INFO (or
wenzelm@68523
   562
ISABELLE_HEAPS_SYSTEM + ISABELLE_BROWSER_INFO_SYSTEM in "system build
wenzelm@68523
   563
mode") determine the directory locations of the main build artefacts --
wenzelm@68523
   564
instead of hard-wired directories in ISABELLE_HOME_USER (or
wenzelm@68523
   565
ISABELLE_HOME).
wenzelm@68523
   566
wenzelm@68393
   567
* Settings ISABELLE_PATH and ISABELLE_OUTPUT have been discontinued:
wenzelm@68393
   568
heap images and session databases are always stored in
wenzelm@68523
   569
$ISABELLE_HEAPS/$ML_IDENTIFIER (command-line default) or
wenzelm@68523
   570
$ISABELLE_HEAPS_SYSTEM/$ML_IDENTIFIER (main Isabelle application or
wenzelm@68393
   571
"isabelle jedit -s" or "isabelle build -s").
wenzelm@67099
   572
wenzelm@67199
   573
* ISABELLE_LATEX and ISABELLE_PDFLATEX now include platform-specific
wenzelm@67199
   574
options for improved error reporting. Potential INCOMPATIBILITY with
wenzelm@67199
   575
unusual LaTeX installations, may have to adapt these settings.
wenzelm@67199
   576
wenzelm@68393
   577
* Update to Poly/ML 5.7.1 with slightly improved performance and PIDE
wenzelm@68393
   578
markup for identifier bindings. It now uses The GNU Multiple Precision
wenzelm@67591
   579
Arithmetic Library (libgmp) on all platforms, notably Mac OS X with
wenzelm@67591
   580
32/64 bit.
wenzelm@67591
   581
wenzelm@67099
   582
wenzelm@66729
   583
wenzelm@66472
   584
New in Isabelle2017 (October 2017)
wenzelm@66472
   585
----------------------------------
wenzelm@64439
   586
wenzelm@64986
   587
*** General ***
wenzelm@64986
   588
wenzelm@66238
   589
* Experimental support for Visual Studio Code (VSCode) as alternative
wenzelm@66238
   590
Isabelle/PIDE front-end, see also
wenzelm@66599
   591
https://marketplace.visualstudio.com/items?itemName=makarius.Isabelle2017
wenzelm@66238
   592
wenzelm@66238
   593
VSCode is a new type of application that continues the concepts of
wenzelm@66238
   594
"programmer's editor" and "integrated development environment" towards
wenzelm@66238
   595
fully semantic editing and debugging -- in a relatively light-weight
wenzelm@66238
   596
manner. Thus it fits nicely on top of the Isabelle/PIDE infrastructure.
wenzelm@66238
   597
Technically, VSCode is based on the Electron application framework
wenzelm@66238
   598
(Node.js + Chromium browser + V8), which is implemented in JavaScript
wenzelm@66238
   599
and TypeScript, while Isabelle/VSCode mainly consists of Isabelle/Scala
wenzelm@66238
   600
modules around a Language Server implementation.
wenzelm@66238
   601
wenzelm@65504
   602
* Theory names are qualified by the session name that they belong to.
wenzelm@66454
   603
This affects imports, but not the theory name space prefix (which is
wenzelm@66454
   604
just the theory base name as before).
wenzelm@66454
   605
wenzelm@66454
   606
In order to import theories from other sessions, the ROOT file format
wenzelm@66454
   607
provides a new 'sessions' keyword. In contrast, a theory that is
wenzelm@66454
   608
imported in the old-fashioned manner via an explicit file-system path
wenzelm@66472
   609
belongs to the current session, and might cause theory name conflicts
wenzelm@66454
   610
later on. Theories that are imported from other sessions are excluded
wenzelm@66454
   611
from the current session document. The command-line tool "isabelle
wenzelm@66454
   612
imports" helps to update theory imports.
wenzelm@66454
   613
wenzelm@65451
   614
* The main theory entry points for some non-HOL sessions have changed,
wenzelm@65451
   615
to avoid confusion with the global name "Main" of the session HOL. This
wenzelm@65451
   616
leads to the follow renamings:
wenzelm@65451
   617
wenzelm@65451
   618
  CTT/Main.thy    ~>  CTT/CTT.thy
wenzelm@65451
   619
  ZF/Main.thy     ~>  ZF/ZF.thy
wenzelm@65451
   620
  ZF/Main_ZF.thy  ~>  ZF/ZF.thy
wenzelm@65451
   621
  ZF/Main_ZFC.thy ~>  ZF/ZFC.thy
wenzelm@65451
   622
  ZF/ZF.thy       ~>  ZF/ZF_Base.thy
wenzelm@65451
   623
wenzelm@65451
   624
INCOMPATIBILITY.
wenzelm@65451
   625
wenzelm@66472
   626
* Commands 'alias' and 'type_alias' introduce aliases for constants and
wenzelm@66472
   627
type constructors, respectively. This allows adhoc changes to name-space
wenzelm@66472
   628
accesses within global or local theory contexts, e.g. within a 'bundle'.
wenzelm@66472
   629
wenzelm@64986
   630
* Document antiquotations @{prf} and @{full_prf} output proof terms
wenzelm@64986
   631
(again) in the same way as commands 'prf' and 'full_prf'.
wenzelm@64986
   632
wenzelm@65055
   633
* Computations generated by the code generator can be embedded directly
wenzelm@65055
   634
into ML, alongside with @{code} antiquotations, using the following
wenzelm@65055
   635
antiquotations:
wenzelm@65055
   636
wenzelm@65055
   637
  @{computation ... terms: ... datatypes: ...} :
wenzelm@65055
   638
    ((term -> term) -> 'ml option -> 'a) -> Proof.context -> term -> 'a
wenzelm@65055
   639
  @{computation_conv ... terms: ... datatypes: ...} :
wenzelm@65055
   640
    (Proof.context -> 'ml -> conv) -> Proof.context -> conv
wenzelm@65045
   641
  @{computation_check terms: ... datatypes: ...} : Proof.context -> conv
haftmann@65041
   642
wenzelm@65055
   643
See src/HOL/ex/Computations.thy,
wenzelm@65055
   644
src/HOL/Decision_Procs/Commutative_Ring.thy and
wenzelm@65055
   645
src/HOL/Decision_Procs/Reflective_Field.thy for examples and the
wenzelm@65055
   646
tutorial on code generation.
haftmann@65041
   647
wenzelm@64986
   648
wenzelm@64602
   649
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@64602
   650
wenzelm@66472
   651
* Session-qualified theory imports allow the Prover IDE to process
wenzelm@66472
   652
arbitrary theory hierarchies independently of the underlying logic
wenzelm@66472
   653
session image (e.g. option "isabelle jedit -l"), but the directory
wenzelm@66472
   654
structure needs to be known in advance (e.g. option "isabelle jedit -d"
wenzelm@66472
   655
or a line in the file $ISABELLE_HOME_USER/ROOTS).
wenzelm@64602
   656
wenzelm@64842
   657
* The PIDE document model maintains file content independently of the
wenzelm@64842
   658
status of jEdit editor buffers. Reloading jEdit buffers no longer causes
wenzelm@64842
   659
changes of formal document content. Theory dependencies are always
wenzelm@64842
   660
resolved internally, without the need for corresponding editor buffers.
wenzelm@64842
   661
The system option "jedit_auto_load" has been discontinued: it is
wenzelm@64842
   662
effectively always enabled.
wenzelm@64842
   663
wenzelm@64867
   664
* The Theories dockable provides a "Purge" button, in order to restrict
wenzelm@64867
   665
the document model to theories that are required for open editor
wenzelm@64867
   666
buffers.
wenzelm@64867
   667
wenzelm@66424
   668
* The Theories dockable indicates the overall status of checking of each
wenzelm@66424
   669
entry. When all forked tasks of a theory are finished, the border is
wenzelm@66424
   670
painted with thick lines; remaining errors in this situation are
wenzelm@66424
   671
represented by a different border color.
wenzelm@66424
   672
wenzelm@66472
   673
* Automatic indentation is more careful to avoid redundant spaces in
wenzelm@66472
   674
intermediate situations. Keywords are indented after input (via typed
wenzelm@66472
   675
characters or completion); see also option "jedit_indent_input".
wenzelm@66472
   676
wenzelm@66472
   677
* Action "isabelle.preview" opens an HTML preview of the current theory
wenzelm@66472
   678
document in the default web browser.
wenzelm@66472
   679
wenzelm@66574
   680
* Command-line invocation "isabelle jedit -R -l LOGIC" opens the ROOT
wenzelm@66574
   681
entry of the specified logic session in the editor, while its parent is
wenzelm@66574
   682
used for formal checking.
wenzelm@66472
   683
wenzelm@66462
   684
* The main Isabelle/jEdit plugin may be restarted manually (using the
wenzelm@66462
   685
jEdit Plugin Manager), as long as the "Isabelle Base" plugin remains
wenzelm@66462
   686
enabled at all times.
wenzelm@66462
   687
wenzelm@66472
   688
* Update to current jedit-5.4.0.
wenzelm@65329
   689
wenzelm@64602
   690
haftmann@66149
   691
*** Pure ***
haftmann@66149
   692
haftmann@66149
   693
* Deleting the last code equations for a particular function using
haftmann@66149
   694
[code del] results in function with no equations (runtime abort) rather
wenzelm@66472
   695
than an unimplemented function (generation time abort). Use explicit
haftmann@66665
   696
[[code drop:]] to enforce the latter. Minor INCOMPATIBILITY.
haftmann@66149
   697
haftmann@66310
   698
* Proper concept of code declarations in code.ML:
wenzelm@66472
   699
  - Regular code declarations act only on the global theory level, being
wenzelm@66472
   700
    ignored with warnings if syntactically malformed.
wenzelm@66472
   701
  - Explicitly global code declarations yield errors if syntactically
wenzelm@66472
   702
    malformed.
wenzelm@66472
   703
  - Default code declarations are silently ignored if syntactically
wenzelm@66472
   704
    malformed.
haftmann@66310
   705
Minor INCOMPATIBILITY.
haftmann@66310
   706
wenzelm@66472
   707
* Clarified and standardized internal data bookkeeping of code
wenzelm@66472
   708
declarations: history of serials allows to track potentially
wenzelm@66472
   709
non-monotonous declarations appropriately. Minor INCOMPATIBILITY.
haftmann@66310
   710
haftmann@66149
   711
haftmann@64593
   712
*** HOL ***
haftmann@64593
   713
blanchet@66614
   714
* The Nunchaku model finder is now part of "Main".
blanchet@66614
   715
wenzelm@66472
   716
* SMT module:
wenzelm@66472
   717
  - A new option, 'smt_nat_as_int', has been added to translate 'nat' to
wenzelm@66472
   718
    'int' and benefit from the SMT solver's theory reasoning. It is
wenzelm@66472
   719
    disabled by default.
wenzelm@66472
   720
  - The legacy module "src/HOL/Library/Old_SMT.thy" has been removed.
wenzelm@66472
   721
  - Several small issues have been rectified in the 'smt' command.
wenzelm@66472
   722
wenzelm@66472
   723
* (Co)datatype package: The 'size_gen_o_map' lemma is no longer
wenzelm@66472
   724
generated for datatypes with type class annotations. As a result, the
wenzelm@66472
   725
tactic that derives it no longer fails on nested datatypes. Slight
wenzelm@66472
   726
INCOMPATIBILITY.
eberlm@66450
   727
haftmann@66345
   728
* Command and antiquotation "value" with modified default strategy:
haftmann@66345
   729
terms without free variables are always evaluated using plain evaluation
wenzelm@66472
   730
only, with no fallback on normalization by evaluation. Minor
wenzelm@66472
   731
INCOMPATIBILITY.
eberlm@65956
   732
wenzelm@65552
   733
* Theories "GCD" and "Binomial" are already included in "Main" (instead
wenzelm@65575
   734
of "Complex_Main").
wenzelm@65552
   735
haftmann@65170
   736
* Constant "surj" is a full input/output abbreviation (again).
haftmann@65170
   737
Minor INCOMPATIBILITY.
haftmann@65170
   738
haftmann@64632
   739
* Dropped aliasses RangeP, DomainP for Rangep, Domainp respectively.
haftmann@64632
   740
INCOMPATIBILITY.
haftmann@64632
   741
wenzelm@66472
   742
* Renamed ii to imaginary_unit in order to free up ii as a variable
wenzelm@66472
   743
name. The syntax \<i> remains available. INCOMPATIBILITY.
wenzelm@66472
   744
wenzelm@66472
   745
* Dropped abbreviations transP, antisymP, single_valuedP; use constants
wenzelm@66472
   746
transp, antisymp, single_valuedp instead. INCOMPATIBILITY.
wenzelm@66472
   747
wenzelm@66472
   748
* Constant "subseq" in Topological_Spaces has been removed -- it is
wenzelm@66472
   749
subsumed by "strict_mono". Some basic lemmas specific to "subseq" have
wenzelm@66472
   750
been renamed accordingly, e.g. "subseq_o" -> "strict_mono_o" etc.
wenzelm@66472
   751
wenzelm@66472
   752
* Theory List: "sublist" renamed to "nths" in analogy with "nth", and
wenzelm@66472
   753
"sublisteq" renamed to "subseq". Minor INCOMPATIBILITY.
wenzelm@66472
   754
wenzelm@66472
   755
* Theory List: new generic function "sorted_wrt".
wenzelm@66472
   756
wenzelm@66472
   757
* Named theorems mod_simps covers various congruence rules concerning
wenzelm@66472
   758
mod, replacing former zmod_simps. INCOMPATIBILITY.
haftmann@64787
   759
haftmann@64593
   760
* Swapped orientation of congruence rules mod_add_left_eq,
haftmann@64593
   761
mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq,
haftmann@64593
   762
mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq,
wenzelm@66472
   763
mod_diff_eq. INCOMPATIBILITY.
haftmann@64593
   764
haftmann@64593
   765
* Generalized some facts:
blanchet@64876
   766
    measure_induct_rule
blanchet@64876
   767
    measure_induct
haftmann@64593
   768
    zminus_zmod ~> mod_minus_eq
haftmann@64593
   769
    zdiff_zmod_left ~> mod_diff_left_eq
haftmann@64593
   770
    zdiff_zmod_right ~> mod_diff_right_eq
haftmann@64593
   771
    zmod_eq_dvd_iff ~> mod_eq_dvd_iff
haftmann@64593
   772
INCOMPATIBILITY.
haftmann@64593
   773
wenzelm@66472
   774
* Algebraic type class hierarchy of euclidean (semi)rings in HOL:
wenzelm@66472
   775
euclidean_(semi)ring, euclidean_(semi)ring_cancel,
wenzelm@66472
   776
unique_euclidean_(semi)ring; instantiation requires provision of a
wenzelm@66472
   777
euclidean size.
wenzelm@66472
   778
wenzelm@66472
   779
* Theory "HOL-Number_Theory.Euclidean_Algorithm" has been reworked:
wenzelm@66472
   780
  - Euclidean induction is available as rule eucl_induct.
wenzelm@66472
   781
  - Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm,
wenzelm@66472
   782
    Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow
wenzelm@66472
   783
    easy instantiation of euclidean (semi)rings as GCD (semi)rings.
wenzelm@66472
   784
  - Coefficients obtained by extended euclidean algorithm are
wenzelm@66472
   785
    available as "bezout_coefficients".
wenzelm@66472
   786
INCOMPATIBILITY.
wenzelm@66472
   787
wenzelm@66472
   788
* Theory "Number_Theory.Totient" introduces basic notions about Euler's
wenzelm@66472
   789
totient function previously hidden as solitary example in theory
wenzelm@66472
   790
Residues. Definition changed so that "totient 1 = 1" in agreement with
wenzelm@66472
   791
the literature. Minor INCOMPATIBILITY.
wenzelm@66472
   792
wenzelm@66542
   793
* New styles in theory "HOL-Library.LaTeXsugar":
nipkow@66541
   794
  - "dummy_pats" for printing equations with "_" on the lhs;
nipkow@66541
   795
  - "eta_expand" for printing eta-expanded terms.
nipkow@66541
   796
wenzelm@66472
   797
* Theory "HOL-Library.Permutations": theorem bij_swap_ompose_bij has
wenzelm@66472
   798
been renamed to bij_swap_compose_bij. INCOMPATIBILITY.
wenzelm@66472
   799
lp15@66643
   800
* New theory "HOL-Library.Going_To_Filter" providing the "f going_to F"
eberlm@66488
   801
filter for describing points x such that f(x) is in the filter F.
eberlm@66488
   802
eberlm@66480
   803
* Theory "HOL-Library.Formal_Power_Series": constants X/E/L/F have been
eberlm@66480
   804
renamed to fps_X/fps_exp/fps_ln/fps_hypergeo to avoid polluting the name
wenzelm@66472
   805
space. INCOMPATIBILITY.
wenzelm@66472
   806
wenzelm@66472
   807
* Theory "HOL-Library.FinFun" has been moved to AFP (again).
wenzelm@66472
   808
INCOMPATIBILITY.
wenzelm@66472
   809
wenzelm@66472
   810
* Theory "HOL-Library.FuncSet": some old and rarely used ASCII
wenzelm@66472
   811
replacement syntax has been removed. INCOMPATIBILITY, standard syntax
wenzelm@66472
   812
with symbols should be used instead. The subsequent commands help to
wenzelm@66472
   813
reproduce the old forms, e.g. to simplify porting old theories:
wenzelm@66472
   814
wenzelm@66472
   815
syntax (ASCII)
wenzelm@66472
   816
  "_PiE" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set"  ("(3PIE _:_./ _)" 10)
wenzelm@66472
   817
  "_Pi"  :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set"  ("(3PI _:_./ _)" 10)
wenzelm@66472
   818
  "_lam" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a \<Rightarrow> 'b)"  ("(3%_:_./ _)" [0,0,3] 3)
wenzelm@66472
   819
wenzelm@66472
   820
* Theory "HOL-Library.Multiset": the simprocs on subsets operators of
wenzelm@66472
   821
multisets have been renamed:
wenzelm@66472
   822
wenzelm@66472
   823
  msetless_cancel_numerals ~> msetsubset_cancel
wenzelm@66472
   824
  msetle_cancel_numerals ~> msetsubset_eq_cancel
wenzelm@66472
   825
wenzelm@66472
   826
INCOMPATIBILITY.
wenzelm@66472
   827
lars@66481
   828
* Theory "HOL-Library.Pattern_Aliases" provides input and output syntax
lars@66481
   829
for pattern aliases as known from Haskell, Scala and ML.
blanchet@65515
   830
Andreas@66563
   831
* Theory "HOL-Library.Uprod" formalizes the type of unordered pairs.
Andreas@66563
   832
wenzelm@64898
   833
* Session HOL-Analysis: more material involving arcs, paths, covering
wenzelm@66650
   834
spaces, innessential maps, retracts, infinite products, simplicial
wenzelm@66650
   835
complexes. Baire Category theorem. Major results include the Jordan
wenzelm@66650
   836
Curve Theorem and the Great Picard Theorem.
wenzelm@66472
   837
wenzelm@66472
   838
* Session HOL-Algebra has been extended by additional lattice theory:
wenzelm@66472
   839
the Knaster-Tarski fixed point theorem and Galois Connections.
wenzelm@66472
   840
wenzelm@66472
   841
* Sessions HOL-Computational_Algebra and HOL-Number_Theory: new notions
wenzelm@66472
   842
of squarefreeness, n-th powers, and prime powers.
wenzelm@66472
   843
wenzelm@66472
   844
* Session "HOL-Computional_Algebra" covers many previously scattered
wenzelm@66472
   845
theories, notably Euclidean_Algorithm, Factorial_Ring,
wenzelm@66472
   846
Formal_Power_Series, Fraction_Field, Fundamental_Theorem_Algebra,
wenzelm@66472
   847
Normalized_Fraction, Polynomial_FPS, Polynomial, Primes. Minor
wenzelm@66472
   848
INCOMPATIBILITY.
Mathias@65027
   849
wenzelm@60331
   850
wenzelm@64844
   851
*** System ***
wenzelm@64844
   852
wenzelm@66474
   853
* Isabelle/Scala: the SQL module supports access to relational
wenzelm@66474
   854
databases, either as plain file (SQLite) or full-scale server
wenzelm@66474
   855
(PostgreSQL via local port or remote ssh connection).
wenzelm@66474
   856
wenzelm@66474
   857
* Results of "isabelle build" are recorded as SQLite database (i.e.
wenzelm@66474
   858
"Application File Format" in the sense of
wenzelm@66474
   859
https://www.sqlite.org/appfileformat.html). This allows systematic
wenzelm@66474
   860
access via operations from module Sessions.Store in Isabelle/Scala.
wenzelm@66474
   861
wenzelm@66472
   862
* System option "parallel_proofs" is 1 by default (instead of more
wenzelm@66472
   863
aggressive 2). This requires less heap space and avoids burning parallel
wenzelm@66472
   864
CPU cycles, while full subproof parallelization is enabled for repeated
wenzelm@66472
   865
builds (according to parallel_subproofs_threshold).
wenzelm@65072
   866
wenzelm@65448
   867
* System option "record_proofs" allows to change the global
wenzelm@65448
   868
Proofterm.proofs variable for a session. Regular values are are 0, 1, 2;
wenzelm@65448
   869
a negative value means the current state in the ML heap image remains
wenzelm@65448
   870
unchanged.
wenzelm@65448
   871
wenzelm@66472
   872
* Isabelle settings variable ISABELLE_SCALA_BUILD_OPTIONS has been
wenzelm@66472
   873
renamed to ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY.
wenzelm@66472
   874
wenzelm@66472
   875
* Isabelle settings variables ISABELLE_WINDOWS_PLATFORM,
wenzelm@66472
   876
ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the
wenzelm@66472
   877
native Windows platform (independently of the Cygwin installation). This
wenzelm@66472
   878
is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32,
wenzelm@66472
   879
ISABELLE_PLATFORM64.
wenzelm@65557
   880
wenzelm@66786
   881
* Command-line tool "isabelle build_docker" builds a Docker image from
wenzelm@66786
   882
the Isabelle application bundle for Linux. See also
wenzelm@66786
   883
https://hub.docker.com/r/makarius/isabelle
wenzelm@66786
   884
wenzelm@66473
   885
* Command-line tool "isabelle vscode_server" provides a Language Server
wenzelm@66473
   886
Protocol implementation, e.g. for the Visual Studio Code editor. It
wenzelm@66473
   887
serves as example for alternative PIDE front-ends.
wenzelm@66473
   888
wenzelm@66472
   889
* Command-line tool "isabelle imports" helps to maintain theory imports
wenzelm@66671
   890
wrt. session structure. Examples for the main Isabelle distribution:
wenzelm@66472
   891
wenzelm@66472
   892
  isabelle imports -I -a
wenzelm@66472
   893
  isabelle imports -U -a
wenzelm@66472
   894
  isabelle imports -U -i -a
wenzelm@66472
   895
  isabelle imports -M -a -d '~~/src/Benchmarks'
wenzelm@66472
   896
wenzelm@64844
   897
wenzelm@67099
   898
wenzelm@64072
   899
New in Isabelle2016-1 (December 2016)
wenzelm@64072
   900
-------------------------------------
wenzelm@62216
   901
wenzelm@62440
   902
*** General ***
wenzelm@62440
   903
wenzelm@64390
   904
* Splitter in proof methods "simp", "auto" and friends:
wenzelm@64390
   905
  - The syntax "split add" has been discontinued, use plain "split",
wenzelm@64390
   906
    INCOMPATIBILITY.
wenzelm@64390
   907
  - For situations with many conditional or case expressions, there is
wenzelm@64390
   908
    an alternative splitting strategy that can be much faster. It is
wenzelm@64390
   909
    selected by writing "split!" instead of "split". It applies safe
wenzelm@64390
   910
    introduction and elimination rules after each split rule. As a
wenzelm@64390
   911
    result the subgoal may be split into several subgoals.
wenzelm@64390
   912
wenzelm@63273
   913
* Command 'bundle' provides a local theory target to define a bundle
wenzelm@63273
   914
from the body of specification commands (such as 'declare',
wenzelm@63273
   915
'declaration', 'notation', 'lemmas', 'lemma'). For example:
wenzelm@63273
   916
wenzelm@63273
   917
bundle foo
wenzelm@63273
   918
begin
wenzelm@63273
   919
  declare a [simp]
wenzelm@63273
   920
  declare b [intro]
wenzelm@63273
   921
end
wenzelm@63272
   922
wenzelm@63282
   923
* Command 'unbundle' is like 'include', but works within a local theory
wenzelm@63282
   924
context. Unlike "context includes ... begin", the effect of 'unbundle'
wenzelm@63282
   925
on the target context persists, until different declarations are given.
wenzelm@63282
   926
wenzelm@63977
   927
* Simplified outer syntax: uniform category "name" includes long
wenzelm@63977
   928
identifiers. Former "xname" / "nameref" / "name reference" has been
wenzelm@63977
   929
discontinued.
wenzelm@63977
   930
wenzelm@63977
   931
* Embedded content (e.g. the inner syntax of types, terms, props) may be
wenzelm@63977
   932
delimited uniformly via cartouches. This works better than old-fashioned
wenzelm@63977
   933
quotes when sub-languages are nested.
wenzelm@63977
   934
wenzelm@63977
   935
* Mixfix annotations support general block properties, with syntax
wenzelm@63977
   936
"(\<open>x=a y=b z \<dots>\<close>". Notable property names are "indent", "consistent",
wenzelm@63977
   937
"unbreakable", "markup". The existing notation "(DIGITS" is equivalent
wenzelm@63977
   938
to "(\<open>indent=DIGITS\<close>". The former notation "(00" for unbreakable blocks
wenzelm@63977
   939
is superseded by "(\<open>unbreabable\<close>" --- rare INCOMPATIBILITY.
nipkow@63650
   940
wenzelm@63383
   941
* Proof method "blast" is more robust wrt. corner cases of Pure
wenzelm@63383
   942
statements without object-logic judgment.
wenzelm@63383
   943
wenzelm@63624
   944
* Commands 'prf' and 'full_prf' are somewhat more informative (again):
wenzelm@63977
   945
proof terms are reconstructed and cleaned from administrative thm nodes.
wenzelm@63977
   946
wenzelm@63977
   947
* Code generator: config option "code_timing" triggers measurements of
wenzelm@63977
   948
different phases of code generation. See src/HOL/ex/Code_Timing.thy for
wenzelm@63977
   949
examples.
wenzelm@63977
   950
wenzelm@63977
   951
* Code generator: implicits in Scala (stemming from type class
wenzelm@63977
   952
instances) are generated into companion object of corresponding type
wenzelm@63977
   953
class, to resolve some situations where ambiguities may occur.
wenzelm@63977
   954
wenzelm@64390
   955
* Solve direct: option "solve_direct_strict_warnings" gives explicit
wenzelm@64390
   956
warnings for lemma statements with trivial proofs.
haftmann@64013
   957
wenzelm@64602
   958
wenzelm@62904
   959
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@62904
   960
wenzelm@64527
   961
* More aggressive flushing of machine-generated input, according to
wenzelm@64527
   962
system option editor_generated_input_delay (in addition to existing
wenzelm@64527
   963
editor_input_delay for regular user edits). This may affect overall PIDE
wenzelm@64527
   964
reactivity and CPU usage.
wenzelm@64527
   965
wenzelm@64390
   966
* Syntactic indentation according to Isabelle outer syntax. Action
wenzelm@64390
   967
"indent-lines" (shortcut C+i) indents the current line according to
wenzelm@64390
   968
command keywords and some command substructure. Action
wenzelm@64390
   969
"isabelle.newline" (shortcut ENTER) indents the old and the new line
wenzelm@64390
   970
according to command keywords only; see also option
wenzelm@64390
   971
"jedit_indent_newline".
wenzelm@64390
   972
wenzelm@64390
   973
* Semantic indentation for unstructured proof scripts ('apply' etc.) via
wenzelm@64390
   974
number of subgoals. This requires information of ongoing document
wenzelm@64390
   975
processing and may thus lag behind, when the user is editing too
wenzelm@64390
   976
quickly; see also option "jedit_script_indent" and
wenzelm@64390
   977
"jedit_script_indent_limit".
wenzelm@64390
   978
wenzelm@64390
   979
* Refined folding mode "isabelle" based on Isar syntax: 'next' and 'qed'
wenzelm@64390
   980
are treated as delimiters for fold structure; 'begin' and 'end'
wenzelm@64390
   981
structure of theory specifications is treated as well.
wenzelm@64390
   982
wenzelm@64390
   983
* Command 'proof' provides information about proof outline with cases,
wenzelm@64390
   984
e.g. for proof methods "cases", "induct", "goal_cases".
wenzelm@64390
   985
wenzelm@64390
   986
* Completion templates for commands involving "begin ... end" blocks,
wenzelm@64390
   987
e.g. 'context', 'notepad'.
wenzelm@64390
   988
wenzelm@64390
   989
* Sidekick parser "isabelle-context" shows nesting of context blocks
wenzelm@64390
   990
according to 'begin' and 'end' structure.
wenzelm@64390
   991
wenzelm@63977
   992
* Highlighting of entity def/ref positions wrt. cursor.
wenzelm@63977
   993
wenzelm@63977
   994
* Action "isabelle.select-entity" (shortcut CS+ENTER) selects all
wenzelm@64514
   995
occurrences of the formal entity at the caret position. This facilitates
wenzelm@63977
   996
systematic renaming.
wenzelm@63977
   997
wenzelm@63977
   998
* PIDE document markup works across multiple Isar commands, e.g. the
wenzelm@63977
   999
results established at the end of a proof are properly identified in the
wenzelm@63977
  1000
theorem statement.
wenzelm@63977
  1001
wenzelm@63977
  1002
* Cartouche abbreviations work both for " and ` to accomodate typical
wenzelm@63977
  1003
situations where old ASCII notation may be updated.
wenzelm@63977
  1004
wenzelm@63875
  1005
* Dockable window "Symbols" also provides access to 'abbrevs' from the
wenzelm@63875
  1006
outer syntax of the current theory buffer. This provides clickable
wenzelm@63875
  1007
syntax templates, including entries with empty abbrevs name (which are
wenzelm@63875
  1008
inaccessible via keyboard completion).
wenzelm@63875
  1009
wenzelm@63022
  1010
* IDE support for the Isabelle/Pure bootstrap process, with the
wenzelm@63022
  1011
following independent stages:
wenzelm@63022
  1012
wenzelm@63022
  1013
  src/Pure/ROOT0.ML
wenzelm@63022
  1014
  src/Pure/ROOT.ML
wenzelm@63022
  1015
  src/Pure/Pure.thy
wenzelm@63022
  1016
  src/Pure/ML_Bootstrap.thy
wenzelm@63022
  1017
wenzelm@63022
  1018
The ML ROOT files act like quasi-theories in the context of theory
wenzelm@63022
  1019
ML_Bootstrap: this allows continuous checking of all loaded ML files.
wenzelm@63022
  1020
The theory files are presented with a modified header to import Pure
wenzelm@63022
  1021
from the running Isabelle instance. Results from changed versions of
wenzelm@63022
  1022
each stage are *not* propagated to the next stage, and isolated from the
wenzelm@63022
  1023
actual Isabelle/Pure that runs the IDE itself. The sequential
wenzelm@63307
  1024
dependencies of the above files are only observed for batch build.
wenzelm@62904
  1025
wenzelm@63977
  1026
* Isabelle/ML and Standard ML files are presented in Sidekick with the
wenzelm@63977
  1027
tree structure of section headings: this special comment format is
wenzelm@63977
  1028
described in "implementation" chapter 0, e.g. (*** section ***).
wenzelm@63461
  1029
wenzelm@63581
  1030
* Additional abbreviations for syntactic completion may be specified
wenzelm@63871
  1031
within the theory header as 'abbrevs'. The theory syntax for 'keywords'
wenzelm@63871
  1032
has been simplified accordingly: optional abbrevs need to go into the
wenzelm@63871
  1033
new 'abbrevs' section.
wenzelm@63871
  1034
wenzelm@63871
  1035
* Global abbreviations via $ISABELLE_HOME/etc/abbrevs and
wenzelm@63871
  1036
$ISABELLE_HOME_USER/etc/abbrevs are no longer supported. Minor
wenzelm@63871
  1037
INCOMPATIBILITY, use 'abbrevs' within theory header instead.
wenzelm@63579
  1038
wenzelm@64390
  1039
* Action "isabelle.keymap-merge" asks the user to resolve pending
wenzelm@64390
  1040
Isabelle keymap changes that are in conflict with the current jEdit
wenzelm@64390
  1041
keymap; non-conflicting changes are always applied implicitly. This
wenzelm@64390
  1042
action is automatically invoked on Isabelle/jEdit startup and thus
wenzelm@64390
  1043
increases chances that users see new keyboard shortcuts when re-using
wenzelm@64390
  1044
old keymaps.
wenzelm@64390
  1045
wenzelm@63675
  1046
* ML and document antiquotations for file-systems paths are more uniform
wenzelm@63675
  1047
and diverse:
wenzelm@63675
  1048
wenzelm@63675
  1049
  @{path NAME}   -- no file-system check
wenzelm@63675
  1050
  @{file NAME}   -- check for plain file
wenzelm@63675
  1051
  @{dir NAME}    -- check for directory
wenzelm@63675
  1052
wenzelm@63675
  1053
Minor INCOMPATIBILITY, former uses of @{file} and @{file_unchecked} may
wenzelm@63675
  1054
have to be changed.
wenzelm@63669
  1055
wenzelm@63669
  1056
wenzelm@63977
  1057
*** Document preparation ***
wenzelm@63977
  1058
wenzelm@63977
  1059
* New symbol \<circle>, e.g. for temporal operator.
wenzelm@63977
  1060
wenzelm@64073
  1061
* New document and ML antiquotation @{locale} for locales, similar to
wenzelm@64073
  1062
existing antiquotation @{class}.
wenzelm@64073
  1063
wenzelm@63977
  1064
* Mixfix annotations support delimiters like \<^control>\<open>cartouche\<close> --
wenzelm@63977
  1065
this allows special forms of document output.
wenzelm@63977
  1066
wenzelm@63977
  1067
* Raw LaTeX output now works via \<^latex>\<open>...\<close> instead of raw control
wenzelm@63977
  1068
symbol \<^raw:...>. INCOMPATIBILITY, notably for LaTeXsugar.thy and its
wenzelm@63977
  1069
derivatives.
wenzelm@63977
  1070
wenzelm@63977
  1071
* \<^raw:...> symbols are no longer supported.
wenzelm@63977
  1072
wenzelm@63977
  1073
* Old 'header' command is no longer supported (legacy since
wenzelm@63977
  1074
Isabelle2015).
wenzelm@63977
  1075
wenzelm@63977
  1076
wenzelm@62312
  1077
*** Isar ***
wenzelm@62312
  1078
wenzelm@63180
  1079
* Many specification elements support structured statements with 'if' /
wenzelm@63180
  1080
'for' eigen-context, e.g. 'axiomatization', 'abbreviation',
wenzelm@63180
  1081
'definition', 'inductive', 'function'.
wenzelm@63180
  1082
wenzelm@63094
  1083
* Toplevel theorem statements support eigen-context notation with 'if' /
wenzelm@63284
  1084
'for' (in postfix), which corresponds to 'assumes' / 'fixes' in the
wenzelm@63094
  1085
traditional long statement form (in prefix). Local premises are called
wenzelm@63094
  1086
"that" or "assms", respectively. Empty premises are *not* bound in the
wenzelm@63094
  1087
context: INCOMPATIBILITY.
wenzelm@63094
  1088
wenzelm@63039
  1089
* Command 'define' introduces a local (non-polymorphic) definition, with
wenzelm@63039
  1090
optional abstraction over local parameters. The syntax resembles
wenzelm@63043
  1091
'definition' and 'obtain'. It fits better into the Isar language than
wenzelm@63043
  1092
old 'def', which is now a legacy feature.
wenzelm@63039
  1093
wenzelm@63059
  1094
* Command 'obtain' supports structured statements with 'if' / 'for'
wenzelm@63059
  1095
context.
wenzelm@63059
  1096
wenzelm@62312
  1097
* Command '\<proof>' is an alias for 'sorry', with different
wenzelm@62312
  1098
typesetting. E.g. to produce proof holes in examples and documentation.
wenzelm@62216
  1099
wenzelm@63977
  1100
* The defining position of a literal fact \<open>prop\<close> is maintained more
wenzelm@63977
  1101
carefully, and made accessible as hyperlink in the Prover IDE.
wenzelm@63977
  1102
wenzelm@63977
  1103
* Commands 'finally' and 'ultimately' used to expose the result as
wenzelm@63977
  1104
literal fact: this accidental behaviour has been discontinued. Rare
wenzelm@63977
  1105
INCOMPATIBILITY, use more explicit means to refer to facts in Isar.
wenzelm@63977
  1106
wenzelm@63977
  1107
* Command 'axiomatization' has become more restrictive to correspond
wenzelm@63977
  1108
better to internal axioms as singleton facts with mandatory name. Minor
wenzelm@63977
  1109
INCOMPATIBILITY.
wenzelm@62939
  1110
wenzelm@63259
  1111
* Proof methods may refer to the main facts via the dynamic fact
wenzelm@63259
  1112
"method_facts". This is particularly useful for Eisbach method
wenzelm@63259
  1113
definitions.
wenzelm@63259
  1114
wenzelm@63527
  1115
* Proof method "use" allows to modify the main facts of a given method
wenzelm@63527
  1116
expression, e.g.
wenzelm@63259
  1117
wenzelm@63259
  1118
  (use facts in simp)
wenzelm@63259
  1119
  (use facts in \<open>simp add: ...\<close>)
wenzelm@63259
  1120
wenzelm@63977
  1121
* The old proof method "default" has been removed (legacy since
wenzelm@63977
  1122
Isabelle2016). INCOMPATIBILITY, use "standard" instead.
wenzelm@63977
  1123
wenzelm@62216
  1124
haftmann@63165
  1125
*** Pure ***
haftmann@63165
  1126
wenzelm@63977
  1127
* Pure provides basic versions of proof methods "simp" and "simp_all"
wenzelm@63977
  1128
that only know about meta-equality (==). Potential INCOMPATIBILITY in
wenzelm@63977
  1129
theory imports that merge Pure with e.g. Main of Isabelle/HOL: the order
wenzelm@63977
  1130
is relevant to avoid confusion of Pure.simp vs. HOL.simp.
wenzelm@63977
  1131
wenzelm@63977
  1132
* The command 'unfolding' and proof method "unfold" include a second
wenzelm@63977
  1133
stage where given equations are passed through the attribute "abs_def"
wenzelm@63977
  1134
before rewriting. This ensures that definitions are fully expanded,
wenzelm@63977
  1135
regardless of the actual parameters that are provided. Rare
wenzelm@63977
  1136
INCOMPATIBILITY in some corner cases: use proof method (simp only:)
wenzelm@63977
  1137
instead, or declare [[unfold_abs_def = false]] in the proof context.
wenzelm@63977
  1138
wenzelm@63977
  1139
* Type-inference improves sorts of newly introduced type variables for
wenzelm@63977
  1140
the object-logic, using its base sort (i.e. HOL.type for Isabelle/HOL).
wenzelm@63977
  1141
Thus terms like "f x" or "\<And>x. P x" without any further syntactic context
wenzelm@63977
  1142
produce x::'a::type in HOL instead of x::'a::{} in Pure. Rare
wenzelm@63977
  1143
INCOMPATIBILITY, need to provide explicit type constraints for Pure
wenzelm@63977
  1144
types where this is really intended.
haftmann@63350
  1145
haftmann@63165
  1146
blanchet@62327
  1147
*** HOL ***
blanchet@62327
  1148
wenzelm@63977
  1149
* New proof method "argo" using the built-in Argo solver based on SMT
wenzelm@63977
  1150
technology. The method can be used to prove goals of quantifier-free
wenzelm@63977
  1151
propositional logic, goals based on a combination of quantifier-free
wenzelm@63977
  1152
propositional logic with equality, and goals based on a combination of
wenzelm@63977
  1153
quantifier-free propositional logic with linear real arithmetic
wenzelm@63977
  1154
including min/max/abs. See HOL/ex/Argo_Examples.thy for examples.
wenzelm@63977
  1155
blanchet@66614
  1156
* The new "nunchaku" command integrates the Nunchaku model finder. The
wenzelm@64390
  1157
tool is experimental. See ~~/src/HOL/Nunchaku/Nunchaku.thy for details.
wenzelm@64390
  1158
wenzelm@63977
  1159
* Metis: The problem encoding has changed very slightly. This might
blanchet@63785
  1160
break existing proofs. INCOMPATIBILITY.
blanchet@63785
  1161
blanchet@63116
  1162
* Sledgehammer:
lp15@63967
  1163
  - The MaSh relevance filter is now faster than before.
blanchet@63116
  1164
  - Produce syntactically correct Vampire 4.0 problem files.
blanchet@63116
  1165
blanchet@62327
  1166
* (Co)datatype package:
blanchet@62693
  1167
  - New commands for defining corecursive functions and reasoning about
blanchet@62693
  1168
    them in "~~/src/HOL/Library/BNF_Corec.thy": 'corec', 'corecursive',
blanchet@62693
  1169
    'friend_of_corec', and 'corecursion_upto'; and 'corec_unique' proof
blanchet@62842
  1170
    method. See 'isabelle doc corec'.
wenzelm@63977
  1171
  - The predicator :: ('a \<Rightarrow> bool) \<Rightarrow> 'a F \<Rightarrow> bool is now a first-class
blanchet@63855
  1172
    citizen in bounded natural functors.
blanchet@62693
  1173
  - 'primrec' now allows nested calls through the predicator in addition
blanchet@62327
  1174
    to the map function.
blanchet@63855
  1175
  - 'bnf' automatically discharges reflexive proof obligations.
blanchet@62693
  1176
  - 'bnf' outputs a slightly modified proof obligation expressing rel in
traytel@62332
  1177
       terms of map and set
blanchet@63855
  1178
       (not giving a specification for rel makes this one reflexive).
blanchet@62693
  1179
  - 'bnf' outputs a new proof obligation expressing pred in terms of set
blanchet@63855
  1180
       (not giving a specification for pred makes this one reflexive).
blanchet@63855
  1181
    INCOMPATIBILITY: manual 'bnf' declarations may need adjustment.
blanchet@62335
  1182
  - Renamed lemmas:
blanchet@62335
  1183
      rel_prod_apply ~> rel_prod_inject
blanchet@62335
  1184
      pred_prod_apply ~> pred_prod_inject
blanchet@62335
  1185
    INCOMPATIBILITY.
blanchet@62536
  1186
  - The "size" plugin has been made compatible again with locales.
blanchet@63855
  1187
  - The theorems about "rel" and "set" may have a slightly different (but
blanchet@63855
  1188
    equivalent) form.
blanchet@63855
  1189
    INCOMPATIBILITY.
blanchet@62327
  1190
wenzelm@63977
  1191
* The 'coinductive' command produces a proper coinduction rule for
wenzelm@63977
  1192
mutual coinductive predicates. This new rule replaces the old rule,
wenzelm@63977
  1193
which exposed details of the internal fixpoint construction and was
wenzelm@63977
  1194
hard to use. INCOMPATIBILITY.
wenzelm@63977
  1195
wenzelm@63977
  1196
* New abbreviations for negated existence (but not bounded existence):
wenzelm@63977
  1197
wenzelm@63977
  1198
  \<nexists>x. P x \<equiv> \<not> (\<exists>x. P x)
wenzelm@63977
  1199
  \<nexists>!x. P x \<equiv> \<not> (\<exists>!x. P x)
wenzelm@63977
  1200
wenzelm@63977
  1201
* The print mode "HOL" for ASCII syntax of binders "!", "?", "?!", "@"
wenzelm@63977
  1202
has been removed for output. It is retained for input only, until it is
wenzelm@63977
  1203
eliminated altogether.
wenzelm@63977
  1204
wenzelm@63977
  1205
* The unique existence quantifier no longer provides 'binder' syntax,
wenzelm@63977
  1206
but uses syntax translations (as for bounded unique existence). Thus
wenzelm@63977
  1207
iterated quantification \<exists>!x y. P x y with its slightly confusing
wenzelm@63977
  1208
sequential meaning \<exists>!x. \<exists>!y. P x y is no longer possible. Instead,
wenzelm@63977
  1209
pattern abstraction admits simultaneous unique existence \<exists>!(x, y). P x y
wenzelm@63977
  1210
(analogous to existing notation \<exists>!(x, y)\<in>A. P x y). Potential
wenzelm@63977
  1211
INCOMPATIBILITY in rare situations.
wenzelm@63977
  1212
wenzelm@63977
  1213
* Conventional syntax "%(). t" for unit abstractions. Slight syntactic
wenzelm@63977
  1214
INCOMPATIBILITY.
wenzelm@63977
  1215
wenzelm@64390
  1216
* Renamed constants and corresponding theorems:
wenzelm@64390
  1217
wenzelm@64390
  1218
    setsum ~> sum
wenzelm@64390
  1219
    setprod ~> prod
wenzelm@64390
  1220
    listsum ~> sum_list
wenzelm@64390
  1221
    listprod ~> prod_list
wenzelm@64390
  1222
wenzelm@64390
  1223
INCOMPATIBILITY.
wenzelm@64390
  1224
wenzelm@64390
  1225
* Sligthly more standardized theorem names:
wenzelm@64390
  1226
    sgn_times ~> sgn_mult
wenzelm@64390
  1227
    sgn_mult' ~> Real_Vector_Spaces.sgn_mult
wenzelm@64390
  1228
    divide_zero_left ~> div_0
wenzelm@64390
  1229
    zero_mod_left ~> mod_0
wenzelm@64390
  1230
    divide_zero ~> div_by_0
wenzelm@64390
  1231
    divide_1 ~> div_by_1
wenzelm@64390
  1232
    nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left
wenzelm@64390
  1233
    div_mult_self1_is_id ~> nonzero_mult_div_cancel_left
wenzelm@64390
  1234
    nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right
wenzelm@64390
  1235
    div_mult_self2_is_id ~> nonzero_mult_div_cancel_right
wenzelm@64390
  1236
    is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left
wenzelm@64390
  1237
    is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right
wenzelm@64390
  1238
    mod_div_equality ~> div_mult_mod_eq
wenzelm@64390
  1239
    mod_div_equality2 ~> mult_div_mod_eq
wenzelm@64390
  1240
    mod_div_equality3 ~> mod_div_mult_eq
wenzelm@64390
  1241
    mod_div_equality4 ~> mod_mult_div_eq
wenzelm@64390
  1242
    minus_div_eq_mod ~> minus_div_mult_eq_mod
wenzelm@64390
  1243
    minus_div_eq_mod2 ~> minus_mult_div_eq_mod
wenzelm@64390
  1244
    minus_mod_eq_div ~> minus_mod_eq_div_mult
wenzelm@64390
  1245
    minus_mod_eq_div2 ~> minus_mod_eq_mult_div
wenzelm@64390
  1246
    div_mod_equality' ~> minus_mod_eq_div_mult [symmetric]
wenzelm@64390
  1247
    mod_div_equality' ~> minus_div_mult_eq_mod [symmetric]
wenzelm@64390
  1248
    zmod_zdiv_equality ~> mult_div_mod_eq [symmetric]
wenzelm@64390
  1249
    zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric]
wenzelm@64390
  1250
    Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
wenzelm@64390
  1251
    mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
wenzelm@64390
  1252
    zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
wenzelm@64390
  1253
    div_1 ~> div_by_Suc_0
wenzelm@64390
  1254
    mod_1 ~> mod_by_Suc_0
wenzelm@64390
  1255
INCOMPATIBILITY.
wenzelm@64390
  1256
wenzelm@64390
  1257
* New type class "idom_abs_sgn" specifies algebraic properties
wenzelm@64390
  1258
of sign and absolute value functions.  Type class "sgn_if" has
wenzelm@64390
  1259
disappeared.  Slight INCOMPATIBILITY.
wenzelm@64390
  1260
wenzelm@64390
  1261
* Dedicated syntax LENGTH('a) for length of types.
wenzelm@64390
  1262
wenzelm@63977
  1263
* Characters (type char) are modelled as finite algebraic type
wenzelm@63977
  1264
corresponding to {0..255}.
wenzelm@63977
  1265
wenzelm@63977
  1266
  - Logical representation:
wenzelm@63977
  1267
    * 0 is instantiated to the ASCII zero character.
wenzelm@63977
  1268
    * All other characters are represented as "Char n"
wenzelm@63977
  1269
      with n being a raw numeral expression less than 256.
wenzelm@63977
  1270
    * Expressions of the form "Char n" with n greater than 255
wenzelm@63977
  1271
      are non-canonical.
wenzelm@63977
  1272
  - Printing and parsing:
wenzelm@63977
  1273
    * Printable characters are printed and parsed as "CHR ''\<dots>''"
wenzelm@63977
  1274
      (as before).
wenzelm@63977
  1275
    * The ASCII zero character is printed and parsed as "0".
wenzelm@63977
  1276
    * All other canonical characters are printed as "CHR 0xXX"
wenzelm@63977
  1277
      with XX being the hexadecimal character code.  "CHR n"
wenzelm@63977
  1278
      is parsable for every numeral expression n.
wenzelm@63977
  1279
    * Non-canonical characters have no special syntax and are
wenzelm@63977
  1280
      printed as their logical representation.
wenzelm@63977
  1281
  - Explicit conversions from and to the natural numbers are
wenzelm@63977
  1282
    provided as char_of_nat, nat_of_char (as before).
wenzelm@63977
  1283
  - The auxiliary nibble type has been discontinued.
wenzelm@63977
  1284
wenzelm@63977
  1285
INCOMPATIBILITY.
wenzelm@63977
  1286
wenzelm@63977
  1287
* Type class "div" with operation "mod" renamed to type class "modulo"
wenzelm@63977
  1288
with operation "modulo", analogously to type class "divide". This
wenzelm@63977
  1289
eliminates the need to qualify any of those names in the presence of
wenzelm@63977
  1290
infix "mod" syntax. INCOMPATIBILITY.
wenzelm@63977
  1291
wenzelm@63979
  1292
* Statements and proofs of Knaster-Tarski fixpoint combinators lfp/gfp
wenzelm@63979
  1293
have been clarified. The fixpoint properties are lfp_fixpoint, its
wenzelm@63979
  1294
symmetric lfp_unfold (as before), and the duals for gfp. Auxiliary items
wenzelm@63979
  1295
for the proof (lfp_lemma2 etc.) are no longer exported, but can be
wenzelm@63979
  1296
easily recovered by composition with eq_refl. Minor INCOMPATIBILITY.
wenzelm@63979
  1297
wenzelm@63977
  1298
* Constant "surj" is a mere input abbreviation, to avoid hiding an
wenzelm@63977
  1299
equation in term output. Minor INCOMPATIBILITY.
wenzelm@63977
  1300
wenzelm@63977
  1301
* Command 'code_reflect' accepts empty constructor lists for datatypes,
wenzelm@63977
  1302
which renders those abstract effectively.
wenzelm@63977
  1303
wenzelm@63977
  1304
* Command 'export_code' checks given constants for abstraction
wenzelm@63977
  1305
violations: a small guarantee that given constants specify a safe
wenzelm@63977
  1306
interface for the generated code.
wenzelm@63977
  1307
wenzelm@63977
  1308
* Code generation for Scala: ambiguous implicts in class diagrams are
wenzelm@63977
  1309
spelt out explicitly.
wenzelm@63977
  1310
wenzelm@63977
  1311
* Static evaluators (Code_Evaluation.static_* in Isabelle/ML) rely on
wenzelm@63977
  1312
explicitly provided auxiliary definitions for required type class
wenzelm@64390
  1313
dictionaries rather than half-working magic. INCOMPATIBILITY, see the
wenzelm@64390
  1314
tutorial on code generation for details.
wenzelm@64390
  1315
wenzelm@64390
  1316
* Theory Set_Interval: substantial new theorems on indexed sums and
wenzelm@64390
  1317
products.
wenzelm@63977
  1318
wenzelm@63977
  1319
* Locale bijection establishes convenient default simp rules such as
wenzelm@63977
  1320
"inv f (f a) = a" for total bijections.
wenzelm@63977
  1321
wenzelm@63977
  1322
* Abstract locales semigroup, abel_semigroup, semilattice,
wenzelm@63977
  1323
semilattice_neutr, ordering, ordering_top, semilattice_order,
wenzelm@63977
  1324
semilattice_neutr_order, comm_monoid_set, semilattice_set,
wenzelm@63977
  1325
semilattice_neutr_set, semilattice_order_set,
wenzelm@63977
  1326
semilattice_order_neutr_set monoid_list, comm_monoid_list,
wenzelm@63977
  1327
comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified
wenzelm@63977
  1328
syntax uniformly that does not clash with corresponding global syntax.
wenzelm@63977
  1329
INCOMPATIBILITY.
wenzelm@63977
  1330
wenzelm@63977
  1331
* Former locale lifting_syntax is now a bundle, which is easier to
wenzelm@63977
  1332
include in a local context or theorem statement, e.g. "context includes
wenzelm@63977
  1333
lifting_syntax begin ... end". Minor INCOMPATIBILITY.
wenzelm@63977
  1334
wenzelm@63807
  1335
* Some old / obsolete theorems have been renamed / removed, potential
wenzelm@63807
  1336
INCOMPATIBILITY.
wenzelm@63807
  1337
wenzelm@63807
  1338
  nat_less_cases  --  removed, use linorder_cases instead
wenzelm@63807
  1339
  inv_image_comp  --  removed, use image_inv_f_f instead
wenzelm@63807
  1340
  image_surj_f_inv_f  ~>  image_f_inv_f
wenzelm@63113
  1341
Mathias@63456
  1342
* Some theorems about groups and orders have been generalised from
Mathias@63456
  1343
  groups to semi-groups that are also monoids:
Mathias@63456
  1344
    le_add_same_cancel1
Mathias@63456
  1345
    le_add_same_cancel2
Mathias@63456
  1346
    less_add_same_cancel1
Mathias@63456
  1347
    less_add_same_cancel2
Mathias@63456
  1348
    add_le_same_cancel1
Mathias@63456
  1349
    add_le_same_cancel2
Mathias@63456
  1350
    add_less_same_cancel1
Mathias@63456
  1351
    add_less_same_cancel2
Mathias@63456
  1352
Mathias@63456
  1353
* Some simplifications theorems about rings have been removed, since
Mathias@63456
  1354
  superseeded by a more general version:
Mathias@63456
  1355
    less_add_cancel_left_greater_zero ~> less_add_same_cancel1
Mathias@63456
  1356
    less_add_cancel_right_greater_zero ~> less_add_same_cancel2
Mathias@63456
  1357
    less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1
Mathias@63456
  1358
    less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2
Mathias@63456
  1359
    less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1
Mathias@63456
  1360
    less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2
Mathias@63456
  1361
    less_add_cancel_left_less_zero ~> add_less_same_cancel1
Mathias@63456
  1362
    less_add_cancel_right_less_zero ~> add_less_same_cancel2
Mathias@63456
  1363
INCOMPATIBILITY.
Mathias@63456
  1364
wenzelm@62407
  1365
* Renamed split_if -> if_split and split_if_asm -> if_split_asm to
wenzelm@62407
  1366
resemble the f.split naming convention, INCOMPATIBILITY.
nipkow@62396
  1367
wenzelm@63977
  1368
* Added class topological_monoid.
wenzelm@63977
  1369
wenzelm@64391
  1370
* The following theorems have been renamed:
wenzelm@64391
  1371
nipkow@64457
  1372
  setsum_left_distrib ~> sum_distrib_right
nipkow@64457
  1373
  setsum_right_distrib ~> sum_distrib_left
wenzelm@64391
  1374
wenzelm@64391
  1375
INCOMPATIBILITY.
wenzelm@64391
  1376
wenzelm@64391
  1377
* Compound constants INFIMUM and SUPREMUM are mere abbreviations now.
wenzelm@64391
  1378
INCOMPATIBILITY.
wenzelm@64391
  1379
wenzelm@64391
  1380
* "Gcd (f ` A)" and "Lcm (f ` A)" are printed with optional
wenzelm@64391
  1381
comprehension-like syntax analogously to "Inf (f ` A)" and "Sup (f `
wenzelm@64391
  1382
A)".
wenzelm@64391
  1383
wenzelm@64391
  1384
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.
wenzelm@64391
  1385
wenzelm@64391
  1386
* The type class ordered_comm_monoid_add is now called
wenzelm@64391
  1387
ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add
wenzelm@64391
  1388
is introduced as the combination of ordered_ab_semigroup_add +
wenzelm@64391
  1389
comm_monoid_add. INCOMPATIBILITY.
wenzelm@64391
  1390
wenzelm@64391
  1391
* Introduced the type classes canonically_ordered_comm_monoid_add and
wenzelm@64391
  1392
dioid.
wenzelm@64391
  1393
wenzelm@64391
  1394
* Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When
wenzelm@64391
  1395
instantiating linordered_semiring_strict and ordered_ab_group_add, an
wenzelm@64391
  1396
explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might
wenzelm@64391
  1397
be required. INCOMPATIBILITY.
nipkow@63117
  1398
haftmann@62348
  1399
* Dropped various legacy fact bindings, whose replacements are often
haftmann@62348
  1400
of a more general type also:
haftmann@62348
  1401
  lcm_left_commute_nat ~> lcm.left_commute
haftmann@62348
  1402
  lcm_left_commute_int ~> lcm.left_commute
haftmann@62348
  1403
  gcd_left_commute_nat ~> gcd.left_commute
haftmann@62348
  1404
  gcd_left_commute_int ~> gcd.left_commute
haftmann@62348
  1405
  gcd_greatest_iff_nat ~> gcd_greatest_iff
haftmann@62348
  1406
  gcd_greatest_iff_int ~> gcd_greatest_iff
haftmann@62348
  1407
  coprime_dvd_mult_nat ~> coprime_dvd_mult
haftmann@62348
  1408
  coprime_dvd_mult_int ~> coprime_dvd_mult
haftmann@62348
  1409
  zpower_numeral_even ~> power_numeral_even
haftmann@62348
  1410
  gcd_mult_cancel_nat ~> gcd_mult_cancel
haftmann@62348
  1411
  gcd_mult_cancel_int ~> gcd_mult_cancel
haftmann@62348
  1412
  div_gcd_coprime_nat ~> div_gcd_coprime
haftmann@62348
  1413
  div_gcd_coprime_int ~> div_gcd_coprime
haftmann@62348
  1414
  zpower_numeral_odd ~> power_numeral_odd
haftmann@62348
  1415
  zero_less_int_conv ~> of_nat_0_less_iff
haftmann@62348
  1416
  gcd_greatest_nat ~> gcd_greatest
haftmann@62348
  1417
  gcd_greatest_int ~> gcd_greatest
haftmann@62348
  1418
  coprime_mult_nat ~> coprime_mult
haftmann@62348
  1419
  coprime_mult_int ~> coprime_mult
haftmann@62348
  1420
  lcm_commute_nat ~> lcm.commute
haftmann@62348
  1421
  lcm_commute_int ~> lcm.commute
haftmann@62348
  1422
  int_less_0_conv ~> of_nat_less_0_iff
haftmann@62348
  1423
  gcd_commute_nat ~> gcd.commute
haftmann@62348
  1424
  gcd_commute_int ~> gcd.commute
haftmann@62348
  1425
  Gcd_insert_nat ~> Gcd_insert
haftmann@62348
  1426
  Gcd_insert_int ~> Gcd_insert
haftmann@62348
  1427
  of_int_int_eq ~> of_int_of_nat_eq
haftmann@62348
  1428
  lcm_least_nat ~> lcm_least
haftmann@62348
  1429
  lcm_least_int ~> lcm_least
haftmann@62348
  1430
  lcm_assoc_nat ~> lcm.assoc
haftmann@62348
  1431
  lcm_assoc_int ~> lcm.assoc
haftmann@62348
  1432
  int_le_0_conv ~> of_nat_le_0_iff
haftmann@62348
  1433
  int_eq_0_conv ~> of_nat_eq_0_iff
haftmann@62348
  1434
  Gcd_empty_nat ~> Gcd_empty
haftmann@62348
  1435
  Gcd_empty_int ~> Gcd_empty
haftmann@62348
  1436
  gcd_assoc_nat ~> gcd.assoc
haftmann@62348
  1437
  gcd_assoc_int ~> gcd.assoc
haftmann@62348
  1438
  zero_zle_int ~> of_nat_0_le_iff
haftmann@62348
  1439
  lcm_dvd2_nat ~> dvd_lcm2
haftmann@62348
  1440
  lcm_dvd2_int ~> dvd_lcm2
haftmann@62348
  1441
  lcm_dvd1_nat ~> dvd_lcm1
haftmann@62348
  1442
  lcm_dvd1_int ~> dvd_lcm1
haftmann@62348
  1443
  gcd_zero_nat ~> gcd_eq_0_iff
haftmann@62348
  1444
  gcd_zero_int ~> gcd_eq_0_iff
haftmann@62348
  1445
  gcd_dvd2_nat ~> gcd_dvd2
haftmann@62348
  1446
  gcd_dvd2_int ~> gcd_dvd2
haftmann@62348
  1447
  gcd_dvd1_nat ~> gcd_dvd1
haftmann@62348
  1448
  gcd_dvd1_int ~> gcd_dvd1
haftmann@62348
  1449
  int_numeral ~> of_nat_numeral
haftmann@62348
  1450
  lcm_ac_nat ~> ac_simps
haftmann@62348
  1451
  lcm_ac_int ~> ac_simps
haftmann@62348
  1452
  gcd_ac_nat ~> ac_simps
haftmann@62348
  1453
  gcd_ac_int ~> ac_simps
haftmann@62348
  1454
  abs_int_eq ~> abs_of_nat
haftmann@62348
  1455
  zless_int ~> of_nat_less_iff
haftmann@62348
  1456
  zdiff_int ~> of_nat_diff
haftmann@62348
  1457
  zadd_int ~> of_nat_add
haftmann@62348
  1458
  int_mult ~> of_nat_mult
haftmann@62348
  1459
  int_Suc ~> of_nat_Suc
haftmann@62348
  1460
  inj_int ~> inj_of_nat
haftmann@62348
  1461
  int_1 ~> of_nat_1
haftmann@62348
  1462
  int_0 ~> of_nat_0
haftmann@62353
  1463
  Lcm_empty_nat ~> Lcm_empty
haftmann@62353
  1464
  Lcm_empty_int ~> Lcm_empty
haftmann@62353
  1465
  Lcm_insert_nat ~> Lcm_insert
haftmann@62353
  1466
  Lcm_insert_int ~> Lcm_insert
haftmann@62353
  1467
  comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd
haftmann@62353
  1468
  comp_fun_idem_gcd_int ~> comp_fun_idem_gcd
haftmann@62353
  1469
  comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm
haftmann@62353
  1470
  comp_fun_idem_lcm_int ~> comp_fun_idem_lcm
haftmann@62353
  1471
  Lcm_eq_0 ~> Lcm_eq_0_I
haftmann@62353
  1472
  Lcm0_iff ~> Lcm_0_iff
haftmann@62353
  1473
  Lcm_dvd_int ~> Lcm_least
haftmann@62353
  1474
  divides_mult_nat ~> divides_mult
haftmann@62353
  1475
  divides_mult_int ~> divides_mult
haftmann@62353
  1476
  lcm_0_nat ~> lcm_0_right
haftmann@62353
  1477
  lcm_0_int ~> lcm_0_right
haftmann@62353
  1478
  lcm_0_left_nat ~> lcm_0_left
haftmann@62353
  1479
  lcm_0_left_int ~> lcm_0_left
haftmann@62353
  1480
  dvd_gcd_D1_nat ~> dvd_gcdD1
haftmann@62353
  1481
  dvd_gcd_D1_int ~> dvd_gcdD1
haftmann@62353
  1482
  dvd_gcd_D2_nat ~> dvd_gcdD2
haftmann@62353
  1483
  dvd_gcd_D2_int ~> dvd_gcdD2
haftmann@62353
  1484
  coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff
haftmann@62353
  1485
  coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff
haftmann@62348
  1486
  realpow_minus_mult ~> power_minus_mult
haftmann@62348
  1487
  realpow_Suc_le_self ~> power_Suc_le_self
haftmann@62353
  1488
  dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest
haftmann@62347
  1489
INCOMPATIBILITY.
haftmann@62347
  1490
lp15@63967
  1491
* Renamed HOL/Quotient_Examples/FSet.thy to
wenzelm@63977
  1492
HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY.
wenzelm@63977
  1493
wenzelm@64390
  1494
* Session HOL-Library: theory FinFun bundles "finfun_syntax" and
wenzelm@64390
  1495
"no_finfun_syntax" allow to control optional syntax in local contexts;
wenzelm@64390
  1496
this supersedes former theory FinFun_Syntax. INCOMPATIBILITY, e.g. use
wenzelm@64390
  1497
"unbundle finfun_syntax" to imitate import of
wenzelm@64390
  1498
"~~/src/HOL/Library/FinFun_Syntax".
wenzelm@64390
  1499
wenzelm@64390
  1500
* Session HOL-Library: theory Multiset_Permutations (executably) defines
wenzelm@64390
  1501
the set of permutations of a given set or multiset, i.e. the set of all
wenzelm@64390
  1502
lists that contain every element of the carrier (multi-)set exactly
wenzelm@64390
  1503
once.
wenzelm@64390
  1504
wenzelm@64390
  1505
* Session HOL-Library: multiset membership is now expressed using
wenzelm@64390
  1506
set_mset rather than count.
wenzelm@64390
  1507
wenzelm@64390
  1508
  - Expressions "count M a > 0" and similar simplify to membership
wenzelm@64390
  1509
    by default.
wenzelm@64390
  1510
wenzelm@64390
  1511
  - Converting between "count M a = 0" and non-membership happens using
wenzelm@64390
  1512
    equations count_eq_zero_iff and not_in_iff.
wenzelm@64390
  1513
wenzelm@64390
  1514
  - Rules count_inI and in_countE obtain facts of the form
wenzelm@64390
  1515
    "count M a = n" from membership.
wenzelm@64390
  1516
wenzelm@64390
  1517
  - Rules count_in_diffI and in_diff_countE obtain facts of the form
wenzelm@64390
  1518
    "count M a = n + count N a" from membership on difference sets.
wenzelm@64390
  1519
wenzelm@64390
  1520
INCOMPATIBILITY.
wenzelm@64390
  1521
wenzelm@64390
  1522
* Session HOL-Library: theory LaTeXsugar uses new-style "dummy_pats" for
wenzelm@64390
  1523
displaying equations in functional programming style --- variables
wenzelm@64390
  1524
present on the left-hand but not on the righ-hand side are replaced by
wenzelm@64390
  1525
underscores.
wenzelm@64390
  1526
wenzelm@64390
  1527
* Session HOL-Library: theory Combinator_PER provides combinator to
wenzelm@64390
  1528
build partial equivalence relations from a predicate and an equivalence
wenzelm@64390
  1529
relation.
wenzelm@64390
  1530
wenzelm@64390
  1531
* Session HOL-Library: theory Perm provides basic facts about almost
wenzelm@64390
  1532
everywhere fix bijections.
wenzelm@64390
  1533
wenzelm@64390
  1534
* Session HOL-Library: theory Normalized_Fraction allows viewing an
wenzelm@64390
  1535
element of a field of fractions as a normalized fraction (i.e. a pair of
wenzelm@64390
  1536
numerator and denominator such that the two are coprime and the
wenzelm@64390
  1537
denominator is normalized wrt. unit factors).
wenzelm@64390
  1538
wenzelm@64390
  1539
* Session HOL-NSA has been renamed to HOL-Nonstandard_Analysis.
wenzelm@64390
  1540
wenzelm@64390
  1541
* Session HOL-Multivariate_Analysis has been renamed to HOL-Analysis.
wenzelm@64390
  1542
wenzelm@64390
  1543
* Session HOL-Analysis: measure theory has been moved here from
wenzelm@64390
  1544
HOL-Probability. When importing HOL-Analysis some theorems need
wenzelm@64390
  1545
additional name spaces prefixes due to name clashes. INCOMPATIBILITY.
wenzelm@64390
  1546
wenzelm@64390
  1547
* Session HOL-Analysis: more complex analysis including Cauchy's
wenzelm@64390
  1548
inequality, Liouville theorem, open mapping theorem, maximum modulus
wenzelm@64390
  1549
principle, Residue theorem, Schwarz Lemma.
wenzelm@64390
  1550
wenzelm@64390
  1551
* Session HOL-Analysis: Theory of polyhedra: faces, extreme points,
wenzelm@64390
  1552
polytopes, and the Krein–Milman Minkowski theorem.
wenzelm@64390
  1553
wenzelm@64390
  1554
* Session HOL-Analysis: Numerous results ported from the HOL Light
wenzelm@64390
  1555
libraries: homeomorphisms, continuous function extensions, invariance of
wenzelm@64390
  1556
domain.
wenzelm@64390
  1557
wenzelm@64390
  1558
* Session HOL-Probability: the type of emeasure and nn_integral was
wenzelm@64390
  1559
changed from ereal to ennreal, INCOMPATIBILITY.
wenzelm@64390
  1560
wenzelm@64390
  1561
  emeasure :: 'a measure \<Rightarrow> 'a set \<Rightarrow> ennreal
wenzelm@64390
  1562
  nn_integral :: 'a measure \<Rightarrow> ('a \<Rightarrow> ennreal) \<Rightarrow> ennreal
wenzelm@64390
  1563
wenzelm@64390
  1564
* Session HOL-Probability: Code generation and QuickCheck for
wenzelm@64390
  1565
Probability Mass Functions.
wenzelm@64390
  1566
wenzelm@64390
  1567
* Session HOL-Probability: theory Random_Permutations contains some
wenzelm@64390
  1568
theory about choosing a permutation of a set uniformly at random and
wenzelm@64390
  1569
folding over a list in random order.
wenzelm@64390
  1570
wenzelm@64390
  1571
* Session HOL-Probability: theory SPMF formalises discrete
wenzelm@64390
  1572
subprobability distributions.
wenzelm@64390
  1573
wenzelm@64390
  1574
* Session HOL-Library: the names of multiset theorems have been
wenzelm@64390
  1575
normalised to distinguish which ordering the theorems are about
wenzelm@64390
  1576
wenzelm@64390
  1577
    mset_less_eqI ~> mset_subset_eqI
wenzelm@64390
  1578
    mset_less_insertD ~> mset_subset_insertD
wenzelm@64390
  1579
    mset_less_eq_count ~> mset_subset_eq_count
wenzelm@64390
  1580
    mset_less_diff_self ~> mset_subset_diff_self
wenzelm@64390
  1581
    mset_le_exists_conv ~> mset_subset_eq_exists_conv
wenzelm@64390
  1582
    mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel
wenzelm@64390
  1583
    mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel
wenzelm@64390
  1584
    mset_le_mono_add ~> mset_subset_eq_mono_add
wenzelm@64390
  1585
    mset_le_add_left ~> mset_subset_eq_add_left
wenzelm@64390
  1586
    mset_le_add_right ~> mset_subset_eq_add_right
wenzelm@64390
  1587
    mset_le_single ~> mset_subset_eq_single
wenzelm@64390
  1588
    mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute
wenzelm@64390
  1589
    diff_le_self ~> diff_subset_eq_self
wenzelm@64390
  1590
    mset_leD ~> mset_subset_eqD
wenzelm@64390
  1591
    mset_lessD ~> mset_subsetD
wenzelm@64390
  1592
    mset_le_insertD ~> mset_subset_eq_insertD
wenzelm@64390
  1593
    mset_less_of_empty ~> mset_subset_of_empty
wenzelm@64390
  1594
    mset_less_size ~> mset_subset_size
wenzelm@64390
  1595
    wf_less_mset_rel ~> wf_subset_mset_rel
wenzelm@64390
  1596
    count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq
wenzelm@64390
  1597
    mset_remdups_le ~> mset_remdups_subset_eq
wenzelm@64390
  1598
    ms_lesseq_impl ~> subset_eq_mset_impl
wenzelm@64390
  1599
wenzelm@64390
  1600
Some functions have been renamed:
wenzelm@64390
  1601
    ms_lesseq_impl -> subset_eq_mset_impl
wenzelm@64390
  1602
wenzelm@64390
  1603
* HOL-Library: multisets are now ordered with the multiset ordering
wenzelm@64390
  1604
    #\<subseteq># ~> \<le>
wenzelm@64390
  1605
    #\<subset># ~> <
wenzelm@64390
  1606
    le_multiset ~> less_eq_multiset
wenzelm@64390
  1607
    less_multiset ~> le_multiset
wenzelm@64390
  1608
INCOMPATIBILITY.
wenzelm@64390
  1609
wenzelm@64390
  1610
* Session HOL-Library: the prefix multiset_order has been discontinued:
wenzelm@64390
  1611
the theorems can be directly accessed. As a consequence, the lemmas
wenzelm@64390
  1612
"order_multiset" and "linorder_multiset" have been discontinued, and the
wenzelm@64390
  1613
interpretations "multiset_linorder" and "multiset_wellorder" have been
wenzelm@64390
  1614
replaced by instantiations. INCOMPATIBILITY.
wenzelm@64390
  1615
wenzelm@64390
  1616
* Session HOL-Library: some theorems about the multiset ordering have
wenzelm@64390
  1617
been renamed:
wenzelm@64390
  1618
wenzelm@64390
  1619
    le_multiset_def ~> less_eq_multiset_def
wenzelm@64390
  1620
    less_multiset_def ~> le_multiset_def
wenzelm@64390
  1621
    less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset
wenzelm@64390
  1622
    mult_less_not_refl ~> mset_le_not_refl
wenzelm@64390
  1623
    mult_less_trans ~> mset_le_trans
wenzelm@64390
  1624
    mult_less_not_sym ~> mset_le_not_sym
wenzelm@64390
  1625
    mult_less_asym ~> mset_le_asym
wenzelm@64390
  1626
    mult_less_irrefl ~> mset_le_irrefl
wenzelm@64390
  1627
    union_less_mono2{,1,2} ~> union_le_mono2{,1,2}
wenzelm@64390
  1628
wenzelm@64390
  1629
    le_multiset\<^sub>H\<^sub>O ~> less_eq_multiset\<^sub>H\<^sub>O
wenzelm@64390
  1630
    le_multiset_total ~> less_eq_multiset_total
wenzelm@64390
  1631
    less_multiset_right_total ~> subset_eq_imp_le_multiset
wenzelm@64390
  1632
    le_multiset_empty_left ~> less_eq_multiset_empty_left
wenzelm@64390
  1633
    le_multiset_empty_right ~> less_eq_multiset_empty_right
wenzelm@64390
  1634
    less_multiset_empty_right ~> le_multiset_empty_left
wenzelm@64390
  1635
    less_multiset_empty_left ~> le_multiset_empty_right
wenzelm@64390
  1636
    union_less_diff_plus ~> union_le_diff_plus
wenzelm@64390
  1637
    ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset
wenzelm@64390
  1638
    less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty
wenzelm@64390
  1639
    le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty
wenzelm@64390
  1640
INCOMPATIBILITY.
wenzelm@64390
  1641
wenzelm@64390
  1642
* Session HOL-Library: the lemma mset_map has now the attribute [simp].
wenzelm@64390
  1643
INCOMPATIBILITY.
wenzelm@64390
  1644
wenzelm@64390
  1645
* Session HOL-Library: some theorems about multisets have been removed.
wenzelm@64390
  1646
INCOMPATIBILITY, use the following replacements:
wenzelm@64390
  1647
wenzelm@64390
  1648
    le_multiset_plus_plus_left_iff ~> add_less_cancel_right
wenzelm@64390
  1649
    less_multiset_plus_plus_left_iff ~> add_less_cancel_right
wenzelm@64390
  1650
    le_multiset_plus_plus_right_iff ~> add_less_cancel_left
wenzelm@64390
  1651
    less_multiset_plus_plus_right_iff ~> add_less_cancel_left
wenzelm@64390
  1652
    add_eq_self_empty_iff ~> add_cancel_left_right
wenzelm@64390
  1653
    mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right
wenzelm@64390
  1654
    mset_less_add_bothsides ~> subset_mset.add_less_cancel_right
wenzelm@64390
  1655
    mset_le_add_bothsides ~> subset_mset.add_less_cancel_right
wenzelm@64390
  1656
    empty_inter ~> subset_mset.inf_bot_left
wenzelm@64390
  1657
    inter_empty ~> subset_mset.inf_bot_right
wenzelm@64390
  1658
    empty_sup ~> subset_mset.sup_bot_left
wenzelm@64390
  1659
    sup_empty ~> subset_mset.sup_bot_right
wenzelm@64390
  1660
    bdd_below_multiset ~> subset_mset.bdd_above_bot
wenzelm@64390
  1661
    subset_eq_empty ~> subset_mset.le_zero_eq
wenzelm@64390
  1662
    le_empty ~> subset_mset.le_zero_eq
wenzelm@64390
  1663
    mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero
wenzelm@64390
  1664
    mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero
wenzelm@64390
  1665
wenzelm@64390
  1666
* Session HOL-Library: some typeclass constraints about multisets have
wenzelm@64390
  1667
been reduced from ordered or linordered to preorder. Multisets have the
wenzelm@64390
  1668
additional typeclasses order_bot, no_top,
wenzelm@64390
  1669
ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add,
wenzelm@64390
  1670
linordered_cancel_ab_semigroup_add, and
wenzelm@64390
  1671
ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY.
wenzelm@64390
  1672
wenzelm@64390
  1673
* Session HOL-Library: there are some new simplification rules about
wenzelm@64390
  1674
multisets, the multiset ordering, and the subset ordering on multisets.
wenzelm@64390
  1675
INCOMPATIBILITY.
wenzelm@64390
  1676
wenzelm@64390
  1677
* Session HOL-Library: the subset ordering on multisets has now the
wenzelm@64390
  1678
interpretations ordered_ab_semigroup_monoid_add_imp_le and
wenzelm@64390
  1679
bounded_lattice_bot. INCOMPATIBILITY.
wenzelm@64390
  1680
wenzelm@64390
  1681
* Session HOL-Library, theory Multiset: single has been removed in favor
wenzelm@64390
  1682
of add_mset that roughly corresponds to Set.insert. Some theorems have
wenzelm@64390
  1683
removed or changed:
wenzelm@64390
  1684
wenzelm@64390
  1685
  single_not_empty ~> add_mset_not_empty or empty_not_add_mset
wenzelm@64390
  1686
  fold_mset_insert ~> fold_mset_add_mset
wenzelm@64390
  1687
  image_mset_insert ~> image_mset_add_mset
wenzelm@64390
  1688
  union_single_eq_diff
wenzelm@64390
  1689
  multi_self_add_other_not_self
wenzelm@64390
  1690
  diff_single_eq_union
wenzelm@64390
  1691
INCOMPATIBILITY.
wenzelm@64390
  1692
wenzelm@64390
  1693
* Session HOL-Library, theory Multiset: some theorems have been changed
wenzelm@64390
  1694
to use add_mset instead of single:
wenzelm@64390
  1695
wenzelm@64390
  1696
  mset_add
wenzelm@64390
  1697
  multi_self_add_other_not_self
wenzelm@64390
  1698
  diff_single_eq_union
wenzelm@64390
  1699
  union_single_eq_diff
wenzelm@64390
  1700
  union_single_eq_member
wenzelm@64390
  1701
  add_eq_conv_diff
wenzelm@64390
  1702
  insert_noteq_member
wenzelm@64390
  1703
  add_eq_conv_ex
wenzelm@64390
  1704
  multi_member_split
wenzelm@64390
  1705
  multiset_add_sub_el_shuffle
wenzelm@64390
  1706
  mset_subset_eq_insertD
wenzelm@64390
  1707
  mset_subset_insertD
wenzelm@64390
  1708
  insert_subset_eq_iff
wenzelm@64390
  1709
  insert_union_subset_iff
wenzelm@64390
  1710
  multi_psub_of_add_self
wenzelm@64390
  1711
  inter_add_left1
wenzelm@64390
  1712
  inter_add_left2
wenzelm@64390
  1713
  inter_add_right1
wenzelm@64390
  1714
  inter_add_right2
wenzelm@64390
  1715
  sup_union_left1
wenzelm@64390
  1716
  sup_union_left2
wenzelm@64390
  1717
  sup_union_right1
wenzelm@64390
  1718
  sup_union_right2
wenzelm@64390
  1719
  size_eq_Suc_imp_eq_union
wenzelm@64390
  1720
  multi_nonempty_split
wenzelm@64390
  1721
  mset_insort
wenzelm@64390
  1722
  mset_update
wenzelm@64390
  1723
  mult1I
wenzelm@64390
  1724
  less_add
wenzelm@64390
  1725
  mset_zip_take_Cons_drop_twice
wenzelm@64390
  1726
  rel_mset_Zero
wenzelm@64390
  1727
  msed_map_invL
wenzelm@64390
  1728
  msed_map_invR
wenzelm@64390
  1729
  msed_rel_invL
wenzelm@64390
  1730
  msed_rel_invR
wenzelm@64390
  1731
  le_multiset_right_total
wenzelm@64390
  1732
  multiset_induct
wenzelm@64390
  1733
  multiset_induct2_size
wenzelm@64390
  1734
  multiset_induct2
wenzelm@64390
  1735
INCOMPATIBILITY.
wenzelm@64390
  1736
wenzelm@64390
  1737
* Session HOL-Library, theory Multiset: the definitions of some
wenzelm@64390
  1738
constants have changed to use add_mset instead of adding a single
wenzelm@64390
  1739
element:
wenzelm@64390
  1740
wenzelm@64390
  1741
  image_mset
wenzelm@64390
  1742
  mset
wenzelm@64390
  1743
  replicate_mset
wenzelm@64390
  1744
  mult1
wenzelm@64390
  1745
  pred_mset
wenzelm@64390
  1746
  rel_mset'
wenzelm@64390
  1747
  mset_insort
wenzelm@64390
  1748
wenzelm@64390
  1749
INCOMPATIBILITY.
wenzelm@64390
  1750
wenzelm@64390
  1751
* Session HOL-Library, theory Multiset: due to the above changes, the
wenzelm@64390
  1752
attributes of some multiset theorems have been changed:
wenzelm@64390
  1753
wenzelm@64390
  1754
  insert_DiffM  [] ~> [simp]
wenzelm@64390
  1755
  insert_DiffM2 [simp] ~> []
wenzelm@64390
  1756
  diff_add_mset_swap [simp]
wenzelm@64390
  1757
  fold_mset_add_mset [simp]
wenzelm@64390
  1758
  diff_diff_add [simp] (for multisets only)
wenzelm@64390
  1759
  diff_cancel [simp] ~> []
wenzelm@64390
  1760
  count_single [simp] ~> []
wenzelm@64390
  1761
  set_mset_single [simp] ~> []
wenzelm@64390
  1762
  size_multiset_single [simp] ~> []
wenzelm@64390
  1763
  size_single [simp] ~> []
wenzelm@64390
  1764
  image_mset_single [simp] ~> []
wenzelm@64390
  1765
  mset_subset_eq_mono_add_right_cancel [simp] ~> []
wenzelm@64390
  1766
  mset_subset_eq_mono_add_left_cancel [simp] ~> []
wenzelm@64390
  1767
  fold_mset_single [simp] ~> []
wenzelm@64390
  1768
  subset_eq_empty [simp] ~> []
wenzelm@64390
  1769
  empty_sup [simp] ~> []
wenzelm@64390
  1770
  sup_empty [simp] ~> []
wenzelm@64390
  1771
  inter_empty [simp] ~> []
wenzelm@64390
  1772
  empty_inter [simp] ~> []
wenzelm@64390
  1773
INCOMPATIBILITY.
wenzelm@64390
  1774
wenzelm@64391
  1775
* Session HOL-Library, theory Multiset: the order of the variables in
wenzelm@64390
  1776
the second cases of multiset_induct, multiset_induct2_size,
wenzelm@64390
  1777
multiset_induct2 has been changed (e.g. Add A a ~> Add a A).
wenzelm@64390
  1778
INCOMPATIBILITY.
wenzelm@64390
  1779
wenzelm@64390
  1780
* Session HOL-Library, theory Multiset: there is now a simplification
wenzelm@64390
  1781
procedure on multisets. It mimics the behavior of the procedure on
wenzelm@64390
  1782
natural numbers. INCOMPATIBILITY.
wenzelm@64390
  1783
wenzelm@64390
  1784
* Session HOL-Library, theory Multiset: renamed sums and products of
wenzelm@64390
  1785
multisets:
wenzelm@64390
  1786
wenzelm@64390
  1787
  msetsum ~> sum_mset
wenzelm@64390
  1788
  msetprod ~> prod_mset
wenzelm@64390
  1789
wenzelm@64390
  1790
* Session HOL-Library, theory Multiset: the notation for intersection
wenzelm@64390
  1791
and union of multisets have been changed:
wenzelm@64390
  1792
wenzelm@64390
  1793
  #\<inter> ~> \<inter>#
wenzelm@64390
  1794
  #\<union> ~> \<union>#
wenzelm@64390
  1795
wenzelm@64390
  1796
INCOMPATIBILITY.
wenzelm@64390
  1797
wenzelm@64390
  1798
* Session HOL-Library, theory Multiset: the lemma
wenzelm@64390
  1799
one_step_implies_mult_aux on multisets has been removed, use
wenzelm@64390
  1800
one_step_implies_mult instead. INCOMPATIBILITY.
wenzelm@64390
  1801
wenzelm@64390
  1802
* Session HOL-Library: theory Complete_Partial_Order2 provides reasoning
wenzelm@64390
  1803
support for monotonicity and continuity in chain-complete partial orders
wenzelm@64390
  1804
and about admissibility conditions for fixpoint inductions.
wenzelm@64390
  1805
haftmann@64523
  1806
* Session HOL-Library: theory Library/Polynomial contains also
haftmann@64523
  1807
derivation of polynomials (formerly in Library/Poly_Deriv) but not
haftmann@64523
  1808
gcd/lcm on polynomials over fields. This has been moved to a separate
haftmann@64523
  1809
theory Library/Polynomial_GCD_euclidean.thy, to pave way for a possible
haftmann@64523
  1810
future different type class instantiation for polynomials over factorial
haftmann@64523
  1811
rings. INCOMPATIBILITY.
wenzelm@64390
  1812
wenzelm@64390
  1813
* Session HOL-Library: theory Sublist provides function "prefixes" with
wenzelm@64390
  1814
the following renaming
wenzelm@64390
  1815
wenzelm@64390
  1816
  prefixeq -> prefix
wenzelm@64390
  1817
  prefix -> strict_prefix
wenzelm@64390
  1818
  suffixeq -> suffix
wenzelm@64390
  1819
  suffix -> strict_suffix
wenzelm@64390
  1820
wenzelm@64390
  1821
Added theory of longest common prefixes.
blanchet@64389
  1822
wenzelm@64391
  1823
* Session HOL-Number_Theory: algebraic foundation for primes:
wenzelm@64391
  1824
Generalisation of predicate "prime" and introduction of predicates
wenzelm@64391
  1825
"prime_elem", "irreducible", a "prime_factorization" function, and the
wenzelm@64391
  1826
"factorial_ring" typeclass with instance proofs for nat, int, poly. Some
wenzelm@64391
  1827
theorems now have different names, most notably "prime_def" is now
wenzelm@64391
  1828
"prime_nat_iff". INCOMPATIBILITY.
wenzelm@64391
  1829
wenzelm@64391
  1830
* Session Old_Number_Theory has been removed, after porting remaining
wenzelm@64391
  1831
theories.
wenzelm@64391
  1832
wenzelm@64551
  1833
* Session HOL-Types_To_Sets provides an experimental extension of
wenzelm@64551
  1834
Higher-Order Logic to allow translation of types to sets.
wenzelm@64551
  1835
wenzelm@63198
  1836
wenzelm@62498
  1837
*** ML ***
wenzelm@62498
  1838
wenzelm@63227
  1839
* Integer.gcd and Integer.lcm use efficient operations from the Poly/ML
wenzelm@63228
  1840
library (notably for big integers). Subtle change of semantics:
wenzelm@63228
  1841
Integer.gcd and Integer.lcm both normalize the sign, results are never
wenzelm@63228
  1842
negative. This coincides with the definitions in HOL/GCD.thy.
wenzelm@63228
  1843
INCOMPATIBILITY.
wenzelm@63227
  1844
wenzelm@63212
  1845
* Structure Rat for rational numbers is now an integral part of
wenzelm@63215
  1846
Isabelle/ML, with special notation @int/nat or @int for numerals (an
wenzelm@63215
  1847
abbreviation for antiquotation @{Pure.rat argument}) and ML pretty
wenzelm@63212
  1848
printing. Standard operations on type Rat.rat are provided via ad-hoc
wenzelm@63215
  1849
overloading of + - * / < <= > >= ~ abs. INCOMPATIBILITY, need to
wenzelm@63212
  1850
use + instead of +/ etc. Moreover, exception Rat.DIVZERO has been
wenzelm@63212
  1851
superseded by General.Div.
wenzelm@63198
  1852
wenzelm@64390
  1853
* ML antiquotation @{path} is superseded by @{file}, which ensures that
wenzelm@64390
  1854
the argument is a plain file. Minor INCOMPATIBILITY.
wenzelm@64390
  1855
wenzelm@64390
  1856
* Antiquotation @{make_string} is available during Pure bootstrap --
wenzelm@64390
  1857
with approximative output quality.
wenzelm@64390
  1858
wenzelm@64390
  1859
* Low-level ML system structures (like PolyML and RunCall) are no longer
wenzelm@64390
  1860
exposed to Isabelle/ML user-space. Potential INCOMPATIBILITY.
wenzelm@64390
  1861
wenzelm@62861
  1862
* The ML function "ML" provides easy access to run-time compilation.
wenzelm@62861
  1863
This is particularly useful for conditional compilation, without
wenzelm@62861
  1864
requiring separate files.
wenzelm@62861
  1865
wenzelm@62498
  1866
* Option ML_exception_debugger controls detailed exception trace via the
wenzelm@62498
  1867
Poly/ML debugger. Relevant ML modules need to be compiled beforehand
wenzelm@62498
  1868
with ML_file_debug, or with ML_file and option ML_debugger enabled. Note
wenzelm@62498
  1869
debugger information requires consirable time and space: main
wenzelm@62498
  1870
Isabelle/HOL with full debugger support may need ML_system_64.
wenzelm@62498
  1871
wenzelm@62514
  1872
* Local_Theory.restore has been renamed to Local_Theory.reset to
wenzelm@62514
  1873
emphasize its disruptive impact on the cumulative context, notably the
wenzelm@62514
  1874
scope of 'private' or 'qualified' names. Note that Local_Theory.reset is
wenzelm@62514
  1875
only appropriate when targets are managed, e.g. starting from a global
wenzelm@62514
  1876
theory and returning to it. Regular definitional packages should use
wenzelm@62514
  1877
balanced blocks of Local_Theory.open_target versus
wenzelm@62514
  1878
Local_Theory.close_target instead. Rare INCOMPATIBILITY.
wenzelm@62514
  1879
wenzelm@62519
  1880
* Structure TimeLimit (originally from the SML/NJ library) has been
wenzelm@62519
  1881
replaced by structure Timeout, with slightly different signature.
wenzelm@62519
  1882
INCOMPATIBILITY.
wenzelm@62519
  1883
wenzelm@62551
  1884
* Discontinued cd and pwd operations, which are not well-defined in a
wenzelm@62551
  1885
multi-threaded environment. Note that files are usually located
wenzelm@62551
  1886
relatively to the master directory of a theory (see also
wenzelm@62551
  1887
File.full_path). Potential INCOMPATIBILITY.
wenzelm@62551
  1888
wenzelm@63352
  1889
* Binding.empty_atts supersedes Thm.empty_binding and
wenzelm@63352
  1890
Attrib.empty_binding. Minor INCOMPATIBILITY.
wenzelm@63352
  1891
wenzelm@62498
  1892
wenzelm@62354
  1893
*** System ***
wenzelm@62354
  1894
wenzelm@64390
  1895
* SML/NJ and old versions of Poly/ML are no longer supported.
wenzelm@64390
  1896
wenzelm@64390
  1897
* Poly/ML heaps now follow the hierarchy of sessions, and thus require
wenzelm@64390
  1898
much less disk space.
wenzelm@63226
  1899
wenzelm@62591
  1900
* The Isabelle ML process is now managed directly by Isabelle/Scala, and
wenzelm@62591
  1901
shell scripts merely provide optional command-line access. In
wenzelm@62591
  1902
particular:
wenzelm@62591
  1903
wenzelm@62591
  1904
  . Scala module ML_Process to connect to the raw ML process,
wenzelm@62591
  1905
    with interaction via stdin/stdout/stderr or in batch mode;
wenzelm@62591
  1906
  . command-line tool "isabelle console" as interactive wrapper;
wenzelm@62591
  1907
  . command-line tool "isabelle process" as batch mode wrapper.
wenzelm@62588
  1908
wenzelm@62588
  1909
* The executable "isabelle_process" has been discontinued. Tools and
wenzelm@62588
  1910
prover front-ends should use ML_Process or Isabelle_Process in
wenzelm@62591
  1911
Isabelle/Scala. INCOMPATIBILITY.
wenzelm@62588
  1912
wenzelm@62588
  1913
* New command-line tool "isabelle process" supports ML evaluation of
wenzelm@62588
  1914
literal expressions (option -e) or files (option -f) in the context of a
wenzelm@62588
  1915
given heap image. Errors lead to premature exit of the ML process with
wenzelm@62588
  1916
return code 1.
wenzelm@62588
  1917
wenzelm@64390
  1918
* The command-line tool "isabelle build" supports option -N for cyclic
wenzelm@64390
  1919
shuffling of NUMA CPU nodes. This may help performance tuning on Linux
wenzelm@64390
  1920
servers with separate CPU/memory modules.
wenzelm@64390
  1921
wenzelm@64390
  1922
* System option "threads" (for the size of the Isabelle/ML thread farm)
wenzelm@64390
  1923
is also passed to the underlying ML runtime system as --gcthreads,
wenzelm@64274
  1924
unless there is already a default provided via ML_OPTIONS settings.
wenzelm@64274
  1925
wenzelm@63827
  1926
* System option "checkpoint" helps to fine-tune the global heap space
wenzelm@63827
  1927
management of isabelle build. This is relevant for big sessions that may
wenzelm@63827
  1928
exhaust the small 32-bit address space of the ML process (which is used
wenzelm@63827
  1929
by default).
wenzelm@63827
  1930
wenzelm@64308
  1931
* System option "profiling" specifies the mode for global ML profiling
wenzelm@64342
  1932
in "isabelle build". Possible values are "time", "allocations". The
wenzelm@64342
  1933
command-line tool "isabelle profiling_report" helps to digest the
wenzelm@64342
  1934
resulting log files.
wenzelm@64308
  1935
wenzelm@63986
  1936
* System option "ML_process_policy" specifies an optional command prefix
wenzelm@63986
  1937
for the underlying ML process, e.g. to control CPU affinity on
wenzelm@63987
  1938
multiprocessor systems. The "isabelle jedit" tool allows to override the
wenzelm@63987
  1939
implicit default via option -p.
wenzelm@63986
  1940
wenzelm@64390
  1941
* Command-line tool "isabelle console" provides option -r to help to
wenzelm@64390
  1942
bootstrapping Isabelle/Pure interactively.
wenzelm@64390
  1943
wenzelm@64390
  1944
* Command-line tool "isabelle yxml" has been discontinued.
wenzelm@64390
  1945
INCOMPATIBILITY, use operations from the modules "XML" and "YXML" in
wenzelm@64390
  1946
Isabelle/ML or Isabelle/Scala.
wenzelm@64390
  1947
wenzelm@64390
  1948
* Many Isabelle tools that require a Java runtime system refer to the
wenzelm@64390
  1949
settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,
wenzelm@64390
  1950
depending on the underlying platform. The settings for "isabelle build"
wenzelm@64390
  1951
ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been
wenzelm@64390
  1952
discontinued. Potential INCOMPATIBILITY.
wenzelm@64390
  1953
wenzelm@64390
  1954
* The Isabelle system environment always ensures that the main
wenzelm@64390
  1955
executables are found within the shell search $PATH: "isabelle" and
wenzelm@64390
  1956
"isabelle_scala_script".
wenzelm@64390
  1957
wenzelm@64390
  1958
* Isabelle tools may consist of .scala files: the Scala compiler is
wenzelm@64390
  1959
invoked on the spot. The source needs to define some object that extends
wenzelm@64390
  1960
Isabelle_Tool.Body.
wenzelm@64390
  1961
wenzelm@64390
  1962
* File.bash_string, File.bash_path etc. represent Isabelle/ML and
wenzelm@64390
  1963
Isabelle/Scala strings authentically within GNU bash. This is useful to
wenzelm@64390
  1964
produce robust shell scripts under program control, without worrying
wenzelm@64390
  1965
about spaces or special characters. Note that user output works via
wenzelm@64390
  1966
Path.print (ML) or Path.toString (Scala). INCOMPATIBILITY, the old (and
wenzelm@64390
  1967
less versatile) operations File.shell_quote, File.shell_path etc. have
wenzelm@64390
  1968
been discontinued.
wenzelm@64390
  1969
wenzelm@63995
  1970
* The isabelle_java executable allows to run a Java process within the
wenzelm@63995
  1971
name space of Java and Scala components that are bundled with Isabelle,
wenzelm@63995
  1972
but without the Isabelle settings environment.
wenzelm@63995
  1973
wenzelm@64390
  1974
* Isabelle/Scala: the SSH module supports ssh and sftp connections, for
wenzelm@64390
  1975
remote command-execution and file-system access. This resembles
wenzelm@64390
  1976
operations from module File and Isabelle_System to some extent. Note
wenzelm@64390
  1977
that Path specifications need to be resolved remotely via
wenzelm@64390
  1978
ssh.remote_path instead of File.standard_path: the implicit process
wenzelm@64390
  1979
environment is different, Isabelle settings are not available remotely.
wenzelm@64390
  1980
wenzelm@64390
  1981
* Isabelle/Scala: the Mercurial module supports repositories via the
wenzelm@64390
  1982
regular hg command-line interface. The repositroy clone and working
wenzelm@64390
  1983
directory may reside on a local or remote file-system (via ssh
wenzelm@64390
  1984
connection).
wenzelm@64265
  1985
wenzelm@62354
  1986
wenzelm@62354
  1987
wenzelm@62031
  1988
New in Isabelle2016 (February 2016)
wenzelm@62016
  1989
-----------------------------------
wenzelm@60138
  1990
wenzelm@61337
  1991
*** General ***
wenzelm@61337
  1992
wenzelm@62168
  1993
* Eisbach is now based on Pure instead of HOL. Objects-logics may import
wenzelm@62168
  1994
either the theory ~~/src/HOL/Eisbach/Eisbach (for HOL etc.) or
wenzelm@62168
  1995
~~/src/HOL/Eisbach/Eisbach_Old_Appl_Syntax (for FOL, ZF etc.). Note that
wenzelm@62168
  1996
the HOL-Eisbach session located in ~~/src/HOL/Eisbach/ contains further
wenzelm@62168
  1997
examples that do require HOL.
wenzelm@62168
  1998
wenzelm@62157
  1999
* Better resource usage on all platforms (Linux, Windows, Mac OS X) for
wenzelm@62157
  2000
both Isabelle/ML and Isabelle/Scala.  Slightly reduced heap space usage.
wenzelm@62157
  2001
wenzelm@62017
  2002
* Former "xsymbols" syntax with Isabelle symbols is used by default,
wenzelm@62017
  2003
without any special print mode. Important ASCII replacement syntax
wenzelm@62017
  2004
remains available under print mode "ASCII", but less important syntax
wenzelm@62017
  2005
has been removed (see below).
wenzelm@62017
  2006
wenzelm@62109
  2007
* Support for more arrow symbols, with rendering in LaTeX and Isabelle
wenzelm@62109
  2008
fonts: \<Lleftarrow> \<Rrightarrow> \<longlongleftarrow> \<longlongrightarrow> \<longlonglongleftarrow> \<longlonglongrightarrow>.
wenzelm@62017
  2009
wenzelm@62108
  2010
* Special notation \<struct> for the first implicit 'structure' in the
wenzelm@62108
  2011
context has been discontinued. Rare INCOMPATIBILITY, use explicit
wenzelm@62108
  2012
structure name instead, notably in indexed notation with block-subscript
wenzelm@62108
  2013
(e.g. \<odot>\<^bsub>A\<^esub>).
wenzelm@62108
  2014
wenzelm@62108
  2015
* The glyph for \<diamond> in the IsabelleText font now corresponds better to its
wenzelm@62108
  2016
counterpart \<box> as quantifier-like symbol. A small diamond is available as
wenzelm@62108
  2017
\<diamondop>; the old symbol \<struct> loses this rendering and any special
wenzelm@62108
  2018
meaning.
wenzelm@62108
  2019
wenzelm@62017
  2020
* Syntax for formal comments "-- text" now also supports the symbolic
wenzelm@62017
  2021
form "\<comment> text". Command-line tool "isabelle update_cartouches -c" helps
wenzelm@62017
  2022
to update old sources.
wenzelm@62017
  2023
wenzelm@61337
  2024
* Toplevel theorem statements have been simplified as follows:
wenzelm@61337
  2025
wenzelm@61337
  2026
  theorems             ~>  lemmas
wenzelm@61337
  2027
  schematic_lemma      ~>  schematic_goal
wenzelm@61337
  2028
  schematic_theorem    ~>  schematic_goal
wenzelm@61337
  2029
  schematic_corollary  ~>  schematic_goal
wenzelm@61337
  2030
wenzelm@61337
  2031
Command-line tool "isabelle update_theorems" updates theory sources
wenzelm@61337
  2032
accordingly.
wenzelm@61337
  2033
wenzelm@61338
  2034
* Toplevel theorem statement 'proposition' is another alias for
wenzelm@61338
  2035
'theorem'.
wenzelm@61338
  2036
wenzelm@62169
  2037
* The old 'defs' command has been removed (legacy since Isabelle2014).
wenzelm@62169
  2038
INCOMPATIBILITY, use regular 'definition' instead. Overloaded and/or
wenzelm@62169
  2039
deferred definitions require a surrounding 'overloading' block.
wenzelm@62169
  2040
wenzelm@61337
  2041
wenzelm@60610
  2042
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@60610
  2043
wenzelm@60986
  2044
* IDE support for the source-level debugger of Poly/ML, to work with
wenzelm@62253
  2045
Isabelle/ML and official Standard ML. Option "ML_debugger" and commands
wenzelm@62253
  2046
'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',
wenzelm@62253
  2047
'SML_file_no_debug' control compilation of sources with or without
wenzelm@62253
  2048
debugging information. The Debugger panel allows to set breakpoints (via
wenzelm@62253
  2049
context menu), step through stopped threads, evaluate local ML
wenzelm@62253
  2050
expressions etc. At least one Debugger view needs to be active to have
wenzelm@62253
  2051
any effect on the running ML program.
wenzelm@60984
  2052
wenzelm@61803
  2053
* The State panel manages explicit proof state output, with dynamic
wenzelm@61803
  2054
auto-update according to cursor movement. Alternatively, the jEdit
wenzelm@61803
  2055
action "isabelle.update-state" (shortcut S+ENTER) triggers manual
wenzelm@61803
  2056
update.
wenzelm@61729
  2057
wenzelm@61729
  2058
* The Output panel no longer shows proof state output by default, to
wenzelm@61729
  2059
avoid GUI overcrowding. INCOMPATIBILITY, use the State panel instead or
wenzelm@61729
  2060
enable option "editor_output_state".
wenzelm@61215
  2061
wenzelm@61803
  2062
* The text overview column (status of errors, warnings etc.) is updated
wenzelm@61803
  2063
asynchronously, leading to much better editor reactivity. Moreover, the
wenzelm@61803
  2064
full document node content is taken into account. The width of the
wenzelm@61803
  2065
column is scaled according to the main text area font, for improved
wenzelm@61803
  2066
visibility.
wenzelm@61803
  2067
wenzelm@61803
  2068
* The main text area no longer changes its color hue in outdated
wenzelm@61803
  2069
situations. The text overview column takes over the role to indicate
wenzelm@61803
  2070
unfinished edits in the PIDE pipeline. This avoids flashing text display
wenzelm@61803
  2071
due to ad-hoc updates by auxiliary GUI components, such as the State
wenzelm@61803
  2072
panel.
wenzelm@61803
  2073
wenzelm@62254
  2074
* Slightly improved scheduling for urgent print tasks (e.g. command
wenzelm@62254
  2075
state output, interactive queries) wrt. long-running background tasks.
wenzelm@62017
  2076
wenzelm@62017
  2077
* Completion of symbols via prefix of \<name> or \<^name> or \name is
wenzelm@62017
  2078
always possible, independently of the language context. It is never
wenzelm@62017
  2079
implicit: a popup will show up unconditionally.
wenzelm@62017
  2080
wenzelm@62017
  2081
* Additional abbreviations for syntactic completion may be specified in
wenzelm@62017
  2082
$ISABELLE_HOME/etc/abbrevs and $ISABELLE_HOME_USER/etc/abbrevs, with
wenzelm@62017
  2083
support for simple templates using ASCII 007 (bell) as placeholder.
wenzelm@62017
  2084
wenzelm@62234
  2085
* Symbols \<oplus>, \<Oplus>, \<otimes>, \<Otimes>, \<odot>, \<Odot>, \<ominus>, \<oslash> no longer provide abbreviations for
wenzelm@62234
  2086
completion like "+o", "*o", ".o" etc. -- due to conflicts with other
wenzelm@62234
  2087
ASCII syntax. INCOMPATIBILITY, use plain backslash-completion or define
wenzelm@62234
  2088
suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.
wenzelm@62234
  2089
wenzelm@61483
  2090
* Action "isabelle-emph" (with keyboard shortcut C+e LEFT) controls
wenzelm@61483
  2091
emphasized text style; the effect is visible in document output, not in
wenzelm@61483
  2092
the editor.
wenzelm@61483
  2093
wenzelm@61483
  2094
* Action "isabelle-reset" now uses keyboard shortcut C+e BACK_SPACE,
wenzelm@61483
  2095
instead of former C+e LEFT.
wenzelm@61483
  2096
wenzelm@61512
  2097
* The command-line tool "isabelle jedit" and the isabelle.Main
wenzelm@62027
  2098
application wrapper treat the default $USER_HOME/Scratch.thy more
wenzelm@61512
  2099
uniformly, and allow the dummy file argument ":" to open an empty buffer
wenzelm@61512
  2100
instead.
wenzelm@61512
  2101
wenzelm@62017
  2102
* New command-line tool "isabelle jedit_client" allows to connect to an
wenzelm@62017
  2103
already running Isabelle/jEdit process. This achieves the effect of
wenzelm@62017
  2104
single-instance applications seen on common GUI desktops.
wenzelm@62017
  2105
wenzelm@61529
  2106
* The default look-and-feel for Linux is the traditional "Metal", which
wenzelm@61529
  2107
works better with GUI scaling for very high-resolution displays (e.g.
wenzelm@61529
  2108
4K). Moreover, it is generally more robust than "Nimbus".
wenzelm@61529
  2109
wenzelm@62163
  2110
* Update to jedit-5.3.0, with improved GUI scaling and support of
wenzelm@62163
  2111
high-resolution displays (e.g. 4K).
wenzelm@62163
  2112
wenzelm@62034
  2113
* The main Isabelle executable is managed as single-instance Desktop
wenzelm@62034
  2114
application uniformly on all platforms: Linux, Windows, Mac OS X.
wenzelm@62034
  2115
wenzelm@60610
  2116
wenzelm@61405
  2117
*** Document preparation ***
wenzelm@61405
  2118
wenzelm@62017
  2119
* Commands 'paragraph' and 'subparagraph' provide additional section
wenzelm@62017
  2120
headings. Thus there are 6 levels of standard headings, as in HTML.
wenzelm@62017
  2121
wenzelm@62017
  2122
* Command 'text_raw' has been clarified: input text is processed as in
wenzelm@62017
  2123
'text' (with antiquotations and control symbols). The key difference is
wenzelm@62017
  2124
the lack of the surrounding isabelle markup environment in output.
wenzelm@62017
  2125
wenzelm@62017
  2126
* Text is structured in paragraphs and nested lists, using notation that
wenzelm@62017
  2127
is similar to Markdown. The control symbols for list items are as
wenzelm@62017
  2128
follows:
wenzelm@62017
  2129
wenzelm@62017
  2130
  \<^item>  itemize
wenzelm@62017
  2131
  \<^enum>  enumerate
wenzelm@62017
  2132
  \<^descr>  description
wenzelm@62017
  2133
wenzelm@61491
  2134
* There is a new short form for antiquotations with a single argument
wenzelm@61491
  2135
that is a cartouche: \<^name>\<open>...\<close> is equivalent to @{name \<open>...\<close>} and
wenzelm@61595
  2136
\<open>...\<close> without control symbol is equivalent to @{cartouche \<open>...\<close>}.
wenzelm@61595
  2137
\<^name> without following cartouche is equivalent to @{name}. The
wenzelm@61501
  2138
standard Isabelle fonts provide glyphs to render important control
wenzelm@61501
  2139
symbols, e.g. "\<^verbatim>", "\<^emph>", "\<^bold>".
wenzelm@61491
  2140
wenzelm@61595
  2141
* Antiquotations @{noindent}, @{smallskip}, @{medskip}, @{bigskip} with
wenzelm@61595
  2142
corresponding control symbols \<^noindent>, \<^smallskip>, \<^medskip>, \<^bigskip> specify spacing formally, using
wenzelm@61595
  2143
standard LaTeX macros of the same names.
wenzelm@61595
  2144
wenzelm@61491
  2145
* Antiquotation @{cartouche} in Isabelle/Pure is the same as @{text}.
wenzelm@61491
  2146
Consequently, \<open>...\<close> without any decoration prints literal quasi-formal
wenzelm@61492
  2147
text. Command-line tool "isabelle update_cartouches -t" helps to update
wenzelm@61492
  2148
old sources, by approximative patching of the content of string and
wenzelm@61492
  2149
cartouche tokens seen in theory sources.
wenzelm@61491
  2150
wenzelm@61491
  2151
* The @{text} antiquotation now ignores the antiquotation option
wenzelm@61491
  2152
"source". The given text content is output unconditionally, without any
wenzelm@61491
  2153
surrounding quotes etc. Subtle INCOMPATIBILITY, put quotes into the
wenzelm@61494
  2154
argument where they are really intended, e.g. @{text \<open>"foo"\<close>}. Initial
wenzelm@61494
  2155
or terminal spaces are ignored.
wenzelm@61491
  2156
wenzelm@62017
  2157
* Antiquotations @{emph} and @{bold} output LaTeX source recursively,
wenzelm@62017
  2158
adding appropriate text style markup. These may be used in the short
wenzelm@62017
  2159
form \<^emph>\<open>...\<close> and \<^bold>\<open>...\<close>.
wenzelm@62017
  2160
wenzelm@62017
  2161
* Document antiquotation @{footnote} outputs LaTeX source recursively,
wenzelm@62017
  2162
marked as \footnote{}. This may be used in the short form \<^footnote>\<open>...\<close>.
wenzelm@62017
  2163
wenzelm@62017
  2164
* Antiquotation @{verbatim [display]} supports option "indent".
wenzelm@62017
  2165
wenzelm@62017
  2166
* Antiquotation @{theory_text} prints uninterpreted theory source text
wenzelm@62231
  2167
(Isar outer syntax with command keywords etc.). This may be used in the
wenzelm@62231
  2168
short form \<^theory_text>\<open>...\<close>. @{theory_text [display]} supports option "indent".
wenzelm@62017
  2169
wenzelm@62017
  2170
* Antiquotation @{doc ENTRY} provides a reference to the given
wenzelm@62017
  2171
documentation, with a hyperlink in the Prover IDE.
wenzelm@62017
  2172
wenzelm@62017
  2173
* Antiquotations @{command}, @{method}, @{attribute} print checked
wenzelm@62017
  2174
entities of the Isar language.
wenzelm@62017
  2175
wenzelm@61471
  2176
* HTML presentation uses the standard IsabelleText font and Unicode
wenzelm@61471
  2177
rendering of Isabelle symbols like Isabelle/Scala/jEdit.  The former
wenzelm@61488
  2178
print mode "HTML" loses its special meaning.
wenzelm@61471
  2179
wenzelm@61405
  2180
wenzelm@60406
  2181
*** Isar ***
wenzelm@60406
  2182
wenzelm@62205
  2183
* Local goals ('have', 'show', 'hence', 'thus') allow structured rule
wenzelm@62205
  2184
statements like fixes/assumes/shows in theorem specifications, but the
wenzelm@62205
  2185
notation is postfix with keywords 'if' (or 'when') and 'for'. For
wenzelm@60555
  2186
example:
wenzelm@60414
  2187
wenzelm@60414
  2188
  have result: "C x y"
wenzelm@60414
  2189
    if "A x" and "B y"
wenzelm@60414
  2190
    for x :: 'a and y :: 'a
wenzelm@60414
  2191
    <proof>
wenzelm@60414
  2192
wenzelm@60449
  2193
The local assumptions are bound to the name "that". The result is
wenzelm@60449
  2194
exported from context of the statement as usual. The above roughly
wenzelm@60414
  2195
corresponds to a raw proof block like this:
wenzelm@60414
  2196
wenzelm@60414
  2197
  {
wenzelm@60414
  2198
    fix x :: 'a and y :: 'a
wenzelm@60449
  2199
    assume that: "A x" "B y"
wenzelm@60414
  2200
    have "C x y" <proof>
wenzelm@60414
  2201
  }
wenzelm@60414
  2202
  note result = this
wenzelm@60406
  2203
wenzelm@60555
  2204
The keyword 'when' may be used instead of 'if', to indicate 'presume'
wenzelm@60555
  2205
instead of 'assume' above.
wenzelm@60555
  2206
wenzelm@61733
  2207
* Assumptions ('assume', 'presume') allow structured rule statements
wenzelm@61733
  2208
using 'if' and 'for', similar to 'have' etc. above. For example:
wenzelm@61658
  2209
wenzelm@61658
  2210
  assume result: "C x y"
wenzelm@61658
  2211
    if "A x" and "B y"
wenzelm@61658
  2212
    for x :: 'a and y :: 'a
wenzelm@61658
  2213
wenzelm@61658
  2214
This assumes "\<And>x y::'a. A x \<Longrightarrow> B y \<Longrightarrow> C x y" and produces a general
wenzelm@61658
  2215
result as usual: "A ?x \<Longrightarrow> B ?y \<Longrightarrow> C ?x ?y".
wenzelm@61658
  2216
wenzelm@61658
  2217
Vacuous quantification in assumptions is omitted, i.e. a for-context
wenzelm@61658
  2218
only effects propositions according to actual use of variables. For
wenzelm@61658
  2219
example:
wenzelm@61658
  2220
wenzelm@61658
  2221
  assume "A x" and "B y" for x and y
wenzelm@61658
  2222
wenzelm@61658
  2223
is equivalent to:
wenzelm@61658
  2224
wenzelm@61658
  2225
  assume "\<And>x. A x" and "\<And>y. B y"
wenzelm@61658
  2226
wenzelm@60595
  2227
* The meaning of 'show' with Pure rule statements has changed: premises
wenzelm@60595
  2228
are treated in the sense of 'assume', instead of 'presume'. This means,
wenzelm@62205
  2229
a goal like "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" can be solved completely as
wenzelm@62205
  2230
follows:
wenzelm@60595
  2231
wenzelm@60595
  2232
  show "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60595
  2233
wenzelm@60595
  2234
or:
wenzelm@60595
  2235
wenzelm@60595
  2236
  show "C x" if "A x" "B x" for x
wenzelm@60595
  2237
wenzelm@60595
  2238
Rare INCOMPATIBILITY, the old behaviour may be recovered as follows:
wenzelm@60595
  2239
wenzelm@60595
  2240
  show "C x" when "A x" "B x" for x
wenzelm@60595
  2241
wenzelm@60459
  2242
* New command 'consider' states rules for generalized elimination and
wenzelm@60459
  2243
case splitting. This is like a toplevel statement "theorem obtains" used
wenzelm@60459
  2244
within a proof body; or like a multi-branch 'obtain' without activation
wenzelm@60459
  2245
of the local context elements yet.
wenzelm@60459
  2246
wenzelm@60455
  2247
* Proof method "cases" allows to specify the rule as first entry of
wenzelm@60455
  2248
chained facts.  This is particularly useful with 'consider':
wenzelm@60455
  2249
wenzelm@60455
  2250
  consider (a) A | (b) B | (c) C <proof>
wenzelm@60455
  2251
  then have something
wenzelm@60455
  2252
  proof cases
wenzelm@60455
  2253
    case a
wenzelm@60455
  2254
    then show ?thesis <proof>
wenzelm@60455
  2255
  next
wenzelm@60455
  2256
    case b
wenzelm@60455
  2257
    then show ?thesis <proof>
wenzelm@60455
  2258
  next
wenzelm@60455
  2259
    case c
wenzelm@60455
  2260
    then show ?thesis <proof>
wenzelm@60455
  2261
  qed
wenzelm@60455
  2262
wenzelm@60565
  2263
* Command 'case' allows fact name and attribute specification like this:
wenzelm@60565
  2264
wenzelm@60565
  2265
  case a: (c xs)
wenzelm@60565
  2266
  case a [attributes]: (c xs)
wenzelm@60565
  2267
wenzelm@60565
  2268
Facts that are introduced by invoking the case context are uniformly
wenzelm@60565
  2269
qualified by "a"; the same name is used for the cumulative fact. The old
wenzelm@60565
  2270
form "case (c xs) [attributes]" is no longer supported. Rare
wenzelm@60565
  2271
INCOMPATIBILITY, need to adapt uses of case facts in exotic situations,
wenzelm@60565
  2272
and always put attributes in front.
wenzelm@60565
  2273
wenzelm@60618
  2274
* The standard proof method of commands 'proof' and '..' is now called
wenzelm@60618
  2275
"standard" to make semantically clear what it is; the old name "default"
wenzelm@60618
  2276
is still available as legacy for some time. Documentation now explains
wenzelm@60618
  2277
'..' more accurately as "by standard" instead of "by rule".
wenzelm@60618
  2278
wenzelm@62017
  2279
* Nesting of Isar goal structure has been clarified: the context after
wenzelm@62017
  2280
the initial backwards refinement is retained for the whole proof, within
wenzelm@62017
  2281
all its context sections (as indicated via 'next'). This is e.g.
wenzelm@62017
  2282
relevant for 'using', 'including', 'supply':
wenzelm@62017
  2283
wenzelm@62017
  2284
  have "A \<and> A" if a: A for A
wenzelm@62017
  2285
    supply [simp] = a
wenzelm@62017
  2286
  proof
wenzelm@62017
  2287
    show A by simp
wenzelm@62017
  2288
  next
wenzelm@62017
  2289
    show A by simp
wenzelm@62017
  2290
  qed
wenzelm@62017
  2291
wenzelm@62017
  2292
* Command 'obtain' binds term abbreviations (via 'is' patterns) in the
wenzelm@62017
  2293
proof body as well, abstracted over relevant parameters.
wenzelm@62017
  2294
wenzelm@62017
  2295
* Improved type-inference for theorem statement 'obtains': separate
wenzelm@62017
  2296
parameter scope for of each clause.
wenzelm@62017
  2297
wenzelm@62017
  2298
* Term abbreviations via 'is' patterns also work for schematic
wenzelm@62017
  2299
statements: result is abstracted over unknowns.
wenzelm@62017
  2300
wenzelm@60631
  2301
* Command 'subgoal' allows to impose some structure on backward
wenzelm@60631
  2302
refinements, to avoid proof scripts degenerating into long of 'apply'
wenzelm@60631
  2303
sequences. Further explanations and examples are given in the isar-ref
wenzelm@60631
  2304
manual.
wenzelm@60631
  2305
wenzelm@62017
  2306
* Command 'supply' supports fact definitions during goal refinement
wenzelm@62017
  2307
('apply' scripts).
wenzelm@62017
  2308
wenzelm@61166
  2309
* Proof method "goal_cases" turns the current subgoals into cases within
wenzelm@61166
  2310
the context; the conclusion is bound to variable ?case in each case. For
wenzelm@61166
  2311
example:
wenzelm@60617
  2312
wenzelm@60617
  2313
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60622
  2314
  and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
wenzelm@61166
  2315
proof goal_cases
wenzelm@60622
  2316
  case (1 x)
wenzelm@60622
  2317
  then show ?case using \<open>A x\<close> \<open>B x\<close> sorry
wenzelm@60622
  2318
next
wenzelm@60622
  2319
  case (2 y z)
wenzelm@60622
  2320
  then show ?case using \<open>U y\<close> \<open>V z\<close> sorry
wenzelm@60622
  2321
qed
wenzelm@60622
  2322
wenzelm@60622
  2323
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60622
  2324
  and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
wenzelm@61166
  2325
proof goal_cases
wenzelm@60617
  2326
  case prems: 1
wenzelm@60617
  2327
  then show ?case using prems sorry
wenzelm@60617
  2328
next
wenzelm@60617
  2329
  case prems: 2
wenzelm@60617
  2330
  then show ?case using prems sorry
wenzelm@60617
  2331
qed
wenzelm@60578
  2332
wenzelm@60581
  2333
* The undocumented feature of implicit cases goal1, goal2, goal3, etc.
wenzelm@60617
  2334
is marked as legacy, and will be removed eventually. The proof method
wenzelm@60617
  2335
"goals" achieves a similar effect within regular Isar; often it can be
wenzelm@60617
  2336
done more adequately by other means (e.g. 'consider').
wenzelm@60581
  2337
wenzelm@62017
  2338
* The vacuous fact "TERM x" may be established "by fact" or as `TERM x`
wenzelm@62017
  2339
as well, not just "by this" or "." as before.
wenzelm@60551
  2340
wenzelm@60554
  2341
* Method "sleep" succeeds after a real-time delay (in seconds). This is
wenzelm@60554
  2342
occasionally useful for demonstration and testing purposes.
wenzelm@60554
  2343
wenzelm@60406
  2344
wenzelm@60331
  2345
*** Pure ***
wenzelm@60331
  2346
wenzelm@61606
  2347
* Qualifiers in locale expressions default to mandatory ('!') regardless
wenzelm@61606
  2348
of the command. Previously, for 'locale' and 'sublocale' the default was
wenzelm@61606
  2349
optional ('?'). The old synatx '!' has been discontinued.
wenzelm@61606
  2350
INCOMPATIBILITY, remove '!' and add '?' as required.
ballarin@61565
  2351
ballarin@61566
  2352
* Keyword 'rewrites' identifies rewrite morphisms in interpretation
wenzelm@62017
  2353
commands. Previously, the keyword was 'where'. INCOMPATIBILITY.
ballarin@61566
  2354
ballarin@61701
  2355
* More gentle suppression of syntax along locale morphisms while
wenzelm@62017
  2356
printing terms. Previously 'abbreviation' and 'notation' declarations
wenzelm@62017
  2357
would be suppressed for morphisms except term identity. Now
ballarin@61701
  2358
'abbreviation' is also kept for morphims that only change the involved
wenzelm@62017
  2359
parameters, and only 'notation' is suppressed. This can be of great help
wenzelm@62017
  2360
when working with complex locale hierarchies, because proof states are
wenzelm@62017
  2361
displayed much more succinctly. It also means that only notation needs
wenzelm@62017
  2362
to be redeclared if desired, as illustrated by this example:
ballarin@61701
  2363
ballarin@61701
  2364
  locale struct = fixes composition :: "'a => 'a => 'a" (infixl "\<cdot>" 65)
ballarin@61701
  2365
  begin
ballarin@61701
  2366
    definition derived (infixl "\<odot>" 65) where ...
ballarin@61701
  2367
  end
ballarin@61701
  2368
ballarin@61701
  2369
  locale morphism =
ballarin@61701
  2370
    left: struct composition + right: struct composition'
ballarin@61701
  2371
    for composition (infix "\<cdot>" 65) and composition' (infix "\<cdot>''" 65)
ballarin@61701
  2372
  begin
ballarin@61701
  2373
    notation right.derived ("\<odot>''")
ballarin@61701
  2374
  end
ballarin@61701
  2375
wenzelm@61895
  2376
* Command 'global_interpretation' issues interpretations into global
wenzelm@61895
  2377
theories, with optional rewrite definitions following keyword 'defines'.
wenzelm@61895
  2378
wenzelm@61895
  2379
* Command 'sublocale' accepts optional rewrite definitions after keyword
haftmann@61675
  2380
'defines'.
haftmann@61675
  2381
wenzelm@61895
  2382
* Command 'permanent_interpretation' has been discontinued. Use
wenzelm@61895
  2383
'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.
haftmann@61670
  2384
wenzelm@61252
  2385
* Command 'print_definitions' prints dependencies of definitional
wenzelm@61252
  2386
specifications. This functionality used to be part of 'print_theory'.
wenzelm@61252
  2387
wenzelm@60331
  2388
* Configuration option rule_insts_schematic has been discontinued
wenzelm@62017
  2389
(intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.
wenzelm@60331
  2390
wenzelm@62205
  2391
* Abbreviations in type classes now carry proper sort constraint. Rare
wenzelm@62205
  2392
INCOMPATIBILITY in situations where the previous misbehaviour has been
wenzelm@62205
  2393
exploited.
haftmann@60347
  2394
haftmann@60347
  2395
* Refinement of user-space type system in type classes: pseudo-local
wenzelm@62205
  2396
operations behave more similar to abbreviations. Potential
haftmann@60347
  2397
INCOMPATIBILITY in exotic situations.
haftmann@60347
  2398
haftmann@60347
  2399
nipkow@60171
  2400
*** HOL ***
nipkow@60171
  2401
wenzelm@62017
  2402
* The 'typedef' command has been upgraded from a partially checked
wenzelm@62017
  2403
"axiomatization", to a full definitional specification that takes the
wenzelm@62017
  2404
global collection of overloaded constant / type definitions into
wenzelm@62017
  2405
account. Type definitions with open dependencies on overloaded
wenzelm@62017
  2406
definitions need to be specified as "typedef (overloaded)". This
wenzelm@62017
  2407
provides extra robustness in theory construction. Rare INCOMPATIBILITY.
wenzelm@62017
  2408
wenzelm@62017
  2409
* Qualification of various formal entities in the libraries is done more
wenzelm@62017
  2410
uniformly via "context begin qualified definition ... end" instead of
wenzelm@62017
  2411
old-style "hide_const (open) ...". Consequently, both the defined
wenzelm@62017
  2412
constant and its defining fact become qualified, e.g. Option.is_none and
wenzelm@62017
  2413
Option.is_none_def. Occasional INCOMPATIBILITY in applications.
wenzelm@62017
  2414
wenzelm@62017
  2415
* Some old and rarely used ASCII replacement syntax has been removed.
wenzelm@62017
  2416
INCOMPATIBILITY, standard syntax with symbols should be used instead.
wenzelm@62017
  2417
The subsequent commands help to reproduce the old forms, e.g. to
wenzelm@62017
  2418
simplify porting old theories:
wenzelm@62017
  2419
wenzelm@62017
  2420
  notation iff  (infixr "<->" 25)
wenzelm@62017
  2421
wenzelm@62017
  2422
  notation Times  (infixr "<*>" 80)
wenzelm@62017
  2423
wenzelm@62017
  2424
  type_notation Map.map  (infixr "~=>" 0)
wenzelm@62017
  2425
  notation Map.map_comp  (infixl "o'_m" 55)
wenzelm@62017
  2426
wenzelm@62017
  2427
  type_notation FinFun.finfun ("(_ =>f /_)" [22, 21] 21)
wenzelm@62017
  2428
wenzelm@62017
  2429
  notation FuncSet.funcset  (infixr "->" 60)
wenzelm@62017
  2430
  notation FuncSet.extensional_funcset  (infixr "->\<^sub>E" 60)
wenzelm@62017
  2431
wenzelm@62017
  2432
  notation Omega_Words_Fun.conc (infixr "conc" 65)
wenzelm@62017
  2433
wenzelm@62017
  2434
  notation Preorder.equiv ("op ~~")
wenzelm@62017
  2435
    and Preorder.equiv ("(_/ ~~ _)" [51, 51] 50)
wenzelm@62017
  2436
wenzelm@62017
  2437
  notation (in topological_space) tendsto (infixr "--->" 55)
wenzelm@62017
  2438
  notation (in topological_space) LIMSEQ ("((_)/ ----> (_))" [60, 60] 60)
wenzelm@62017
  2439
  notation LIM ("((_)/ -- (_)/ --> (_))" [60, 0, 60] 60)
wenzelm@62017
  2440
wenzelm@62017
  2441
  notation NSA.approx (infixl "@=" 50)
wenzelm@62017
  2442
  notation NSLIMSEQ ("((_)/ ----NS> (_))" [60, 60] 60)
wenzelm@62017
  2443
  notation NSLIM ("((_)/ -- (_)/ --NS> (_))" [60, 0, 60] 60)
wenzelm@62017
  2444
wenzelm@62017
  2445
* The alternative notation "\<Colon>" for type and sort constraints has been
wenzelm@62017
  2446
removed: in LaTeX document output it looks the same as "::".
wenzelm@62017
  2447
INCOMPATIBILITY, use plain "::" instead.
wenzelm@62017
  2448
wenzelm@62017
  2449
* Commands 'inductive' and 'inductive_set' work better when names for
wenzelm@62017
  2450
intro rules are omitted: the "cases" and "induct" rules no longer
wenzelm@62017
  2451
declare empty case_names, but no case_names at all. This allows to use
wenzelm@62017
  2452
numbered cases in proofs, without requiring method "goal_cases".
wenzelm@62017
  2453
wenzelm@62017
  2454
* Inductive definitions ('inductive', 'coinductive', etc.) expose
wenzelm@62017
  2455
low-level facts of the internal construction only if the option
wenzelm@62093
  2456
"inductive_internals" is enabled. This refers to the internal predicate
wenzelm@62017
  2457
definition and its monotonicity result. Rare INCOMPATIBILITY.
wenzelm@62017
  2458
wenzelm@62017
  2459
* Recursive function definitions ('fun', 'function', 'partial_function')
wenzelm@62017
  2460
expose low-level facts of the internal construction only if the option
wenzelm@62205
  2461
"function_internals" is enabled. Its internal inductive definition is
wenzelm@62205
  2462
also subject to "inductive_internals". Rare INCOMPATIBILITY.
wenzelm@62093
  2463
wenzelm@62093
  2464
* BNF datatypes ('datatype', 'codatatype', etc.) expose low-level facts
wenzelm@62093
  2465
of the internal construction only if the option "bnf_internals" is
wenzelm@62093
  2466
enabled. This supersedes the former option "bnf_note_all". Rare
wenzelm@62093
  2467
INCOMPATIBILITY.
wenzelm@62017
  2468
wenzelm@62017
  2469
* Combinator to represent case distinction on products is named
wenzelm@62017
  2470
"case_prod", uniformly, discontinuing any input aliasses. Very popular
wenzelm@62017
  2471
theorem aliasses have been retained.
wenzelm@62017
  2472
haftmann@61424
  2473
Consolidated facts:
haftmann@61424
  2474
  PairE ~> prod.exhaust
haftmann@61424
  2475
  Pair_eq ~> prod.inject
haftmann@61424
  2476
  pair_collapse ~> prod.collapse
haftmann@61424
  2477
  Pair_fst_snd_eq ~> prod_eq_iff
haftmann@61424
  2478
  split_twice ~> prod.case_distrib
haftmann@61424
  2479
  split_weak_cong ~> prod.case_cong_weak
haftmann@61424
  2480
  split_split ~> prod.split
haftmann@61424
  2481
  split_split_asm ~> prod.split_asm
haftmann@61424
  2482
  splitI ~> case_prodI
haftmann@61424
  2483
  splitD ~> case_prodD
haftmann@61424
  2484
  splitI2 ~> case_prodI2
haftmann@61424
  2485
  splitI2' ~> case_prodI2'
haftmann@61424
  2486
  splitE ~> case_prodE
haftmann@61424
  2487
  splitE' ~> case_prodE'
haftmann@61424
  2488
  split_pair ~> case_prod_Pair
haftmann@61424
  2489
  split_eta ~> case_prod_eta
haftmann@61424
  2490
  split_comp ~> case_prod_comp
haftmann@61424
  2491
  mem_splitI ~> mem_case_prodI
haftmann@61424
  2492
  mem_splitI2 ~> mem_case_prodI2
haftmann@61424
  2493
  mem_splitE ~> mem_case_prodE
haftmann@61424
  2494
  The_split ~> The_case_prod
haftmann@61424
  2495
  cond_split_eta ~> cond_case_prod_eta
haftmann@61424
  2496
  Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE
haftmann@61424
  2497
  Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI
haftmann@61424
  2498
  in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq
haftmann@61424
  2499
  Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD
haftmann@61424
  2500
  Collect_split_Grp_inD ~> Collect_case_prod_Grp_in
haftmann@61424
  2501
  Domain_Collect_split ~> Domain_Collect_case_prod
haftmann@61424
  2502
  Image_Collect_split ~> Image_Collect_case_prod
haftmann@61424
  2503
  Range_Collect_split ~> Range_Collect_case_prod
haftmann@61424
  2504
  Eps_split ~> Eps_case_prod
haftmann@61424
  2505
  Eps_split_eq ~> Eps_case_prod_eq
haftmann@61424
  2506
  split_rsp ~> case_prod_rsp
haftmann@61424
  2507
  curry_split ~> curry_case_prod
haftmann@61424
  2508
  split_curry ~> case_prod_curry
wenzelm@62017
  2509
haftmann@61424
  2510
Changes in structure HOLogic:
haftmann@61424
  2511
  split_const ~> case_prod_const
haftmann@61424
  2512
  mk_split ~> mk_case_prod
haftmann@61424
  2513
  mk_psplits ~> mk_ptupleabs
haftmann@61424
  2514
  strip_psplits ~> strip_ptupleabs
wenzelm@62017
  2515
wenzelm@62017
  2516
INCOMPATIBILITY.
wenzelm@62017
  2517
wenzelm@62017
  2518
* The coercions to type 'real' have been reorganised. The function
wenzelm@62017
  2519
'real' is no longer overloaded, but has type 'nat => real' and
wenzelm@62017
  2520
abbreviates of_nat for that type. Also 'real_of_int :: int => real'
wenzelm@62017
  2521
abbreviates of_int for that type. Other overloaded instances of 'real'
wenzelm@62017
  2522
have been replaced by 'real_of_ereal' and 'real_of_float'.
wenzelm@62017
  2523
lp15@61694
  2524
Consolidated facts (among others):
lp15@61694
  2525
  real_of_nat_le_iff -> of_nat_le_iff
lp15@61694
  2526
  real_of_nat_numeral of_nat_numeral
lp15@61694
  2527
  real_of_int_zero of_int_0
lp15@61694
  2528
  real_of_nat_zero of_nat_0
lp15@61694
  2529
  real_of_one of_int_1
lp15@61694
  2530
  real_of_int_add of_int_add
lp15@61694
  2531
  real_of_nat_add of_nat_add
lp15@61694
  2532
  real_of_int_diff of_int_diff
lp15@61694
  2533
  real_of_nat_diff of_nat_diff
lp15@61694
  2534
  floor_subtract floor_diff_of_int
lp15@61694
  2535
  real_of_int_inject of_int_eq_iff
lp15@61694
  2536
  real_of_int_gt_zero_cancel_iff of_int_0_less_iff
lp15@61694
  2537
  real_of_int_ge_zero_cancel_iff of_int_0_le_iff
lp15@61694
  2538
  real_of_nat_ge_zero of_nat_0_le_iff
lp15@61694
  2539
  real_of_int_ceiling_ge le_of_int_ceiling
lp15@61694
  2540
  ceiling_less_eq ceiling_less_iff
lp15@61694
  2541
  ceiling_le_eq ceiling_le_iff
lp15@61694
  2542
  less_floor_eq less_floor_iff
lp15@61694
  2543
  floor_less_eq floor_less_iff
lp15@61694
  2544
  floor_divide_eq_div floor_divide_of_int_eq
lp15@61694
  2545
  real_of_int_zero_cancel of_nat_eq_0_iff
lp15@61694
  2546
  ceiling_real_of_int ceiling_of_int
wenzelm@62017
  2547
wenzelm@62017
  2548
INCOMPATIBILITY.
wenzelm@61143
  2549
wenzelm@60841
  2550
* Theory Map: lemma map_of_is_SomeD was a clone of map_of_SomeD and has
wenzelm@60841
  2551
been removed. INCOMPATIBILITY.
wenzelm@60841
  2552
lars@60712
  2553
* Quickcheck setup for finite sets.
lars@60712
  2554
nipkow@60171
  2555
* Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.
wenzelm@60138
  2556
blanchet@60306
  2557
* Sledgehammer:
blanchet@61318
  2558
  - The MaSh relevance filter has been sped up.
blanchet@60306
  2559
  - Proof reconstruction has been improved, to minimize the incidence of
blanchet@60306
  2560
    cases where Sledgehammer gives a proof that does not work.
blanchet@60306
  2561
  - Auto Sledgehammer now minimizes and preplays the results.
blanchet@61030
  2562
  - Handle Vampire 4.0 proof output without raising exception.
blanchet@61043
  2563
  - Eliminated "MASH" environment variable. Use the "MaSh" option in
blanchet@61043
  2564
    Isabelle/jEdit instead. INCOMPATIBILITY.
blanchet@61317
  2565
  - Eliminated obsolete "blocking" option and related subcommands.
blanchet@60306
  2566
blanchet@60310
  2567
* Nitpick:
blanchet@61325
  2568
  - Fixed soundness bug in translation of "finite" predicate.
blanchet@61324
  2569
  - Fixed soundness bug in "destroy_constrs" optimization.
blanchet@62080
  2570
  - Fixed soundness bug in translation of "rat" type.
blanchet@60310
  2571
  - Removed "check_potential" and "check_genuine" options.
blanchet@61317
  2572
  - Eliminated obsolete "blocking" option.
blanchet@60310
  2573
wenzelm@62027
  2574
* (Co)datatype package:
blanchet@61345
  2575
  - New commands "lift_bnf" and "copy_bnf" for lifting (copying) a BNF
blanchet@61345
  2576
    structure on the raw type to an abstract type defined using typedef.
blanchet@61345
  2577
  - Always generate "case_transfer" theorem.
wenzelm@62235
  2578
  - For mutual types, generate slightly stronger "rel_induct",
haftmann@63946
  2579
    "rel_coinduct", and "coinduct" theorems. INCOMPATIBILITY.
blanchet@61551
  2580
  - Allow discriminators and selectors with the same name as the type
blanchet@61551
  2581
    being defined.
blanchet@61551
  2582
  - Avoid various internal name clashes (e.g., 'datatype f = f').
traytel@60920
  2583
wenzelm@62098
  2584
* Transfer: new methods for interactive debugging of 'transfer' and
wenzelm@62098
  2585
'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',
wenzelm@62098
  2586
'transfer_prover_start' and 'transfer_prover_end'.
kuncar@61370
  2587
kleing@62118
  2588
* New diagnostic command print_record for displaying record definitions.
kleing@62118
  2589
haftmann@60868
  2590
* Division on integers is bootstrapped directly from division on
wenzelm@62017
  2591
naturals and uses generic numeral algorithm for computations. Slight
wenzelm@62017
  2592
INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former
wenzelm@62017
  2593
simprocs binary_int_div and binary_int_mod
wenzelm@62017
  2594
wenzelm@62017
  2595
* Tightened specification of class semiring_no_zero_divisors. Minor
haftmann@60516
  2596
INCOMPATIBILITY.
haftmann@60516
  2597
haftmann@60688
  2598
* Class algebraic_semidom introduces common algebraic notions of
wenzelm@62017
  2599
integral (semi)domains, particularly units. Although logically subsumed
wenzelm@62017
  2600
by fields, is is not a super class of these in order not to burden
wenzelm@62017
  2601
fields with notions that are trivial there.
wenzelm@62017
  2602
wenzelm@62017
  2603
* Class normalization_semidom specifies canonical representants for
wenzelm@62017
  2604
equivalence classes of associated elements in an integral (semi)domain.
wenzelm@62017
  2605
This formalizes associated elements as well.
haftmann@60688
  2606
haftmann@60688
  2607
* Abstract specification of gcd/lcm operations in classes semiring_gcd,
wenzelm@62017
  2608
semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute
wenzelm@62017
  2609
and gcd_int.commute are subsumed by gcd.commute, as well as
wenzelm@62017
  2610
gcd_nat.assoc and gcd_int.assoc by gcd.assoc.
wenzelm@62017
  2611
wenzelm@62017
  2612
* Former constants Fields.divide (_ / _) and Divides.div (_ div _) are
wenzelm@62017
  2613
logically unified to Rings.divide in syntactic type class Rings.divide,
wenzelm@62017
  2614
with infix syntax (_ div _). Infix syntax (_ / _) for field division is
wenzelm@62017
  2615
added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,
wenzelm@62017
  2616
instantiations must refer to Rings.divide rather than the former
wenzelm@62017
  2617
separate constants, hence infix syntax (_ / _) is usually not available
wenzelm@62017
  2618
during instantiation.
wenzelm@62017
  2619
wenzelm@62017
  2620
* New cancellation simprocs for boolean algebras to cancel complementary
wenzelm@62017
  2621
terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to
wenzelm@62017
  2622
"top". INCOMPATIBILITY.
Andreas@61629
  2623
hoelzl@62101
  2624
* Class uniform_space introduces uniform spaces btw topological spaces
hoelzl@62101
  2625
and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be
wenzelm@62205
  2626
introduced in the form of an uniformity. Some constants are more general
wenzelm@62205
  2627
now, it may be necessary to add type class constraints.
hoelzl@62101
  2628
hoelzl@62101
  2629
  open_real_def \<leadsto> open_dist
hoelzl@62101
  2630
  open_complex_def \<leadsto> open_dist
hoelzl@62101
  2631
wenzelm@62026
  2632
* Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.
wenzelm@62026
  2633
Mathias@60397
  2634
* Library/Multiset:
Mathias@60397
  2635
  - Renamed multiset inclusion operators:
Mathias@60397
  2636
      < ~> <#
blanchet@62208
  2637
      > ~> >#
Mathias@60397
  2638
      <= ~> <=#
blanchet@62208
  2639
      >= ~> >=#
Mathias@60397
  2640
      \<le> ~> \<le>#
blanchet@62208
  2641
      \<ge> ~> \<ge>#
Mathias@60397
  2642
    INCOMPATIBILITY.
blanchet@62209
  2643
  - Added multiset inclusion operator syntax:
blanchet@62209
  2644
      \<subset>#
blanchet@62209
  2645
      \<subseteq>#
blanchet@62209
  2646
      \<supset>#
blanchet@62209
  2647
      \<supseteq>#
Mathias@60397
  2648
  - "'a multiset" is no longer an instance of the "order",
Mathias@60397
  2649
    "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",
Mathias@60397
  2650
    "semilattice_inf", and "semilattice_sup" type classes. The theorems
Mathias@60397
  2651
    previously provided by these type classes (directly or indirectly)
Mathias@60397
  2652
    are now available through the "subset_mset" interpretation
Mathias@60397
  2653
    (e.g. add_mono ~> subset_mset.add_mono).
Mathias@60397
  2654
    INCOMPATIBILITY.
nipkow@60497
  2655
  - Renamed conversions:
nipkow@60515
  2656
      multiset_of ~> mset
nipkow@60515
  2657
      multiset_of_set ~> mset_set
nipkow@60497
  2658
      set_of ~> set_mset
nipkow@60497
  2659
    INCOMPATIBILITY
Mathias@60398
  2660
  - Renamed lemmas:
Mathias@60398
  2661
      mset_le_def ~> subseteq_mset_def
Mathias@60398
  2662
      mset_less_def ~> subset_mset_def
Mathias@60400
  2663
      less_eq_multiset.rep_eq ~> subseteq_mset_def
Mathias@60400
  2664
    INCOMPATIBILITY
Mathias@60400
  2665
  - Removed lemmas generated by lift_definition:
wenzelm@62235
  2666
    less_eq_multiset.abs_eq, less_eq_multiset.rsp,
wenzelm@62235
  2667
    less_eq_multiset.transfer, less_eq_multiset_def
Mathias@60400
  2668
    INCOMPATIBILITY
wenzelm@60006
  2669
wenzelm@62017
  2670
* Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a.
wenzelm@62017
  2671
wenzelm@62017
  2672
* Library/Bourbaki_Witt_Fixpoint: Added formalisation of the
wenzelm@62017
  2673
Bourbaki-Witt fixpoint theorem for increasing functions in
wenzelm@62017
  2674
chain-complete partial orders.
wenzelm@62017
  2675
wenzelm@62017
  2676
* Library/Old_Recdef: discontinued obsolete 'defer_recdef' command.
wenzelm@62017
  2677
Minor INCOMPATIBILITY, use 'function' instead.
wenzelm@62017
  2678
wenzelm@62064
  2679
* Library/Periodic_Fun: a locale that provides convenient lemmas for
wenzelm@62064
  2680
periodic functions.
eberlm@62060
  2681
wenzelm@62098
  2682
* Library/Formal_Power_Series: proper definition of division (with
wenzelm@62098
  2683
remainder) for formal power series; instances for Euclidean Ring and
wenzelm@62098
  2684
GCD.
eberlm@62086
  2685
wenzelm@62084
  2686
* HOL-Imperative_HOL: obsolete theory Legacy_Mrec has been removed.
wenzelm@62084
  2687
wenzelm@62084
  2688
* HOL-Statespace: command 'statespace' uses mandatory qualifier for
wenzelm@62084
  2689
import of parent, as for general 'locale' expressions. INCOMPATIBILITY,
wenzelm@62084
  2690
remove '!' and add '?' as required.
wenzelm@62084
  2691
wenzelm@62237
  2692
* HOL-Decision_Procs: The "approximation" method works with "powr"
wenzelm@62237
  2693
(exponentiation on real numbers) again.
wenzelm@62237
  2694
wenzelm@62084
  2695
* HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour
wenzelm@62084
  2696
integrals (= complex path integrals), Cauchy's integral theorem, winding
wenzelm@62084
  2697
numbers and Cauchy's integral formula, Liouville theorem, Fundamental
wenzelm@62084
  2698
Theorem of Algebra. Ported from HOL Light.
wenzelm@62084
  2699
wenzelm@62084
  2700
* HOL-Multivariate_Analysis: topological concepts such as connected
wenzelm@62017
  2701
components, homotopic paths and the inside or outside of a set.
wenzelm@61121
  2702
wenzelm@62084
  2703
* HOL-Multivariate_Analysis: radius of convergence of power series and
wenzelm@62064
  2704
various summability tests; Harmonic numbers and the Euler–Mascheroni
wenzelm@62064
  2705
constant; the Generalised Binomial Theorem; the complex and real
wenzelm@62064
  2706
Gamma/log-Gamma/Digamma/ Polygamma functions and their most important
wenzelm@62064
  2707
properties.
eberlm@62060
  2708
wenzelm@62084
  2709
* HOL-Probability: The central limit theorem based on Levy's uniqueness
wenzelm@62084
  2710
and continuity theorems, weak convergence, and characterisitc functions.
wenzelm@62084
  2711
wenzelm@62084
  2712
* HOL-Data_Structures: new and growing session of standard data
wenzelm@62084
  2713
structures.
lammich@61178
  2714
wenzelm@60479
  2715
wenzelm@60793
  2716
*** ML ***
wenzelm@60793
  2717
wenzelm@62017
  2718
* The following combinators for low-level profiling of the ML runtime
wenzelm@62017
  2719
system are available:
wenzelm@62017
  2720
wenzelm@62017
  2721
  profile_time          (*CPU time*)
wenzelm@62017
  2722
  profile_time_thread   (*CPU time on this thread*)
wenzelm@62017
  2723
  profile_allocations   (*overall heap allocations*)
wenzelm@62017
  2724
wenzelm@62017
  2725
* Antiquotation @{undefined} or \<^undefined> inlines (raise Match).
wenzelm@62017
  2726
wenzelm@62075
  2727
* Antiquotation @{method NAME} inlines the (checked) name of the given
wenzelm@62075
  2728
Isar proof method.
wenzelm@62075
  2729
wenzelm@61922
  2730
* Pretty printing of Poly/ML compiler output in Isabelle has been
wenzelm@61922
  2731
improved: proper treatment of break offsets and blocks with consistent
wenzelm@61922
  2732
breaks.
wenzelm@61922
  2733
wenzelm@61268
  2734
* The auxiliary module Pure/display.ML has been eliminated. Its
wenzelm@61268
  2735
elementary thm print operations are now in Pure/more_thm.ML and thus
wenzelm@61268
  2736
called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY.
wenzelm@61268
  2737
wenzelm@61144
  2738
* Simproc programming interfaces have been simplified:
wenzelm@61144
  2739
Simplifier.make_simproc and Simplifier.define_simproc supersede various
wenzelm@61144
  2740
forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that
wenzelm@61144
  2741
term patterns for the left-hand sides are specified with implicitly
<