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