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