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