NEWS
author haftmann
Mon Jun 08 08:38:49 2009 +0200 (2009-06-08)
changeset 31481 60ae1588f232
parent 31317 1f5740424c69
child 31547 398c0f48a99e
child 31624 4b792a97a1fb
permissions -rw-r--r--
method linarith
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@30904
     4
New in this Isabelle version
wenzelm@30904
     5
----------------------------
wenzelm@30904
     6
haftmann@30951
     7
*** Pure ***
haftmann@30951
     8
haftmann@30951
     9
* On instantiation of classes, remaining undefined class parameters are
haftmann@30951
    10
formally declared.  INCOMPATIBILITY.
haftmann@30951
    11
haftmann@30951
    12
haftmann@30930
    13
*** HOL ***
haftmann@30930
    14
haftmann@30955
    15
* Class semiring_div requires superclass no_zero_divisors and proof of div_mult_mult1;
haftmann@30930
    16
theorems div_mult_mult1, div_mult_mult2, div_mult_mult1_if, div_mult_mult1 and
haftmann@30930
    17
div_mult_mult2 have been generalized to class semiring_div, subsuming former
haftmann@30930
    18
theorems zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and zdiv_zmult_zmult2.
haftmann@30930
    19
div_mult_mult1 is now [simp] by default.  INCOMPATIBILITY.
haftmann@30930
    20
haftmann@30971
    21
* Power operations on relations and functions are now one dedicate constant compow with
haftmann@30971
    22
infix syntax "^^".  Power operations on multiplicative monoids retains syntax "^"
haftmann@31001
    23
and is now defined generic in class power.  INCOMPATIBILITY.
haftmann@30964
    24
haftmann@30964
    25
* ML antiquotation @{code_datatype} inserts definition of a datatype generated
haftmann@30964
    26
by the code generator; see Predicate.thy for an example.
wenzelm@30904
    27
haftmann@31481
    28
* New method "linarith" invokes existing linear arithmetic decision procedure only.
haftmann@31481
    29
haftmann@30949
    30
wenzelm@31304
    31
*** ML ***
wenzelm@31304
    32
wenzelm@31306
    33
* Eliminated old Attrib.add_attributes, Method.add_methods and related
wenzelm@31306
    34
cominators for "args".  INCOMPATIBILITY, need to use simplified
wenzelm@31306
    35
Attrib/Method.setup introduced in Isabelle2009.
wenzelm@31304
    36
wenzelm@31304
    37
wenzelm@31308
    38
*** System ***
wenzelm@31308
    39
wenzelm@31308
    40
* Discontinued support for Poly/ML 4.x versions.
wenzelm@31308
    41
wenzelm@31317
    42
* Removed "compress" option from isabelle-process and isabelle usedir;
wenzelm@31317
    43
this is always enabled.
wenzelm@31317
    44
wenzelm@31308
    45
wenzelm@31304
    46
wenzelm@30845
    47
New in Isabelle2009 (April 2009)
wenzelm@30845
    48
--------------------------------
haftmann@27104
    49
wenzelm@27599
    50
*** General ***
wenzelm@27599
    51
wenzelm@28504
    52
* Simplified main Isabelle executables, with less surprises on
wenzelm@28504
    53
case-insensitive file-systems (such as Mac OS).
wenzelm@28504
    54
wenzelm@28504
    55
  - The main Isabelle tool wrapper is now called "isabelle" instead of
wenzelm@28504
    56
    "isatool."
wenzelm@28504
    57
wenzelm@28504
    58
  - The former "isabelle" alias for "isabelle-process" has been
wenzelm@28504
    59
    removed (should rarely occur to regular users).
wenzelm@28504
    60
wenzelm@28915
    61
  - The former "isabelle-interface" and its alias "Isabelle" have been
wenzelm@28915
    62
    removed (interfaces are now regular Isabelle tools).
wenzelm@28504
    63
wenzelm@28504
    64
Within scripts and make files, the Isabelle environment variables
wenzelm@28504
    65
ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
wenzelm@28504
    66
respectively.  (The latter are still available as legacy feature.)
wenzelm@28504
    67
wenzelm@28915
    68
The old isabelle-interface wrapper could react in confusing ways if
wenzelm@28915
    69
the interface was uninstalled or changed otherwise.  Individual
wenzelm@28915
    70
interface tool configuration is now more explicit, see also the
wenzelm@28915
    71
Isabelle system manual.  In particular, Proof General is now available
wenzelm@28915
    72
via "isabelle emacs".
wenzelm@28504
    73
wenzelm@28504
    74
INCOMPATIBILITY, need to adapt derivative scripts.  Users may need to
wenzelm@28504
    75
purge installed copies of Isabelle executables and re-run "isabelle
wenzelm@28504
    76
install -p ...", or use symlinks.
wenzelm@28504
    77
wenzelm@28914
    78
* The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
wenzelm@30845
    79
old ~/isabelle, which was slightly non-standard and apt to cause
wenzelm@30845
    80
surprises on case-insensitive file-systems (such as Mac OS).
wenzelm@28914
    81
wenzelm@28914
    82
INCOMPATIBILITY, need to move existing ~/isabelle/etc,
wenzelm@28914
    83
~/isabelle/heaps, ~/isabelle/browser_info to the new place.  Special
wenzelm@28914
    84
care is required when using older releases of Isabelle.  Note that
wenzelm@28914
    85
ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
wenzelm@30845
    86
Isabelle distribution, in order to use the new ~/.isabelle uniformly.
wenzelm@28914
    87
wenzelm@29161
    88
* Proofs of fully specified statements are run in parallel on
wenzelm@30845
    89
multi-core systems.  A speedup factor of 2.5 to 3.2 can be expected on
wenzelm@30845
    90
a regular 4-core machine, if the initial heap space is made reasonably
wenzelm@30845
    91
large (cf. Poly/ML option -H).  (Requires Poly/ML 5.2.1 or later.)
wenzelm@30845
    92
wenzelm@30845
    93
* The main reference manuals ("isar-ref", "implementation", and
wenzelm@30845
    94
"system") have been updated and extended.  Formally checked references
wenzelm@30845
    95
as hyperlinks are now available uniformly.
wenzelm@30845
    96
wenzelm@30163
    97
wenzelm@27599
    98
*** Pure ***
wenzelm@27599
    99
wenzelm@30845
   100
* Complete re-implementation of locales.  INCOMPATIBILITY in several
wenzelm@30845
   101
respects.  The most important changes are listed below.  See the
wenzelm@30845
   102
Tutorial on Locales ("locales" manual) for details.
ballarin@29253
   103
ballarin@29253
   104
- In locale expressions, instantiation replaces renaming.  Parameters
ballarin@29253
   105
must be declared in a for clause.  To aid compatibility with previous
ballarin@29253
   106
parameter inheritance, in locale declarations, parameters that are not
ballarin@29253
   107
'touched' (instantiation position "_" or omitted) are implicitly added
ballarin@29253
   108
with their syntax at the beginning of the for clause.
ballarin@29253
   109
ballarin@29253
   110
- Syntax from abbreviations and definitions in locales is available in
ballarin@29253
   111
locale expressions and context elements.  The latter is particularly
ballarin@29253
   112
useful in locale declarations.
ballarin@29253
   113
ballarin@29253
   114
- More flexible mechanisms to qualify names generated by locale
ballarin@29253
   115
expressions.  Qualifiers (prefixes) may be specified in locale
wenzelm@30728
   116
expressions, and can be marked as mandatory (syntax: "name!:") or
wenzelm@30728
   117
optional (syntax "name?:").  The default depends for plain "name:"
wenzelm@30728
   118
depends on the situation where a locale expression is used: in
wenzelm@30728
   119
commands 'locale' and 'sublocale' prefixes are optional, in
wenzelm@30845
   120
'interpretation' and 'interpret' prefixes are mandatory.  The old
wenzelm@30728
   121
implicit qualifiers derived from the parameter names of a locale are
wenzelm@30728
   122
no longer generated.
wenzelm@30106
   123
wenzelm@30845
   124
- Command "sublocale l < e" replaces "interpretation l < e".  The
wenzelm@30106
   125
instantiation clause in "interpretation" and "interpret" (square
wenzelm@30106
   126
brackets) is no longer available.  Use locale expressions.
ballarin@29253
   127
wenzelm@30845
   128
- When converting proof scripts, mandatory qualifiers in
wenzelm@30728
   129
'interpretation' and 'interpret' should be retained by default, even
wenzelm@30845
   130
if this is an INCOMPATIBILITY compared to former behavior.  In the
wenzelm@30845
   131
worst case, use the "name?:" form for non-mandatory ones.  Qualifiers
wenzelm@30845
   132
in locale expressions range over a single locale instance only.
wenzelm@30845
   133
wenzelm@30845
   134
- Dropped locale element "includes".  This is a major INCOMPATIBILITY.
wenzelm@30845
   135
In existing theorem specifications replace the includes element by the
wenzelm@30845
   136
respective context elements of the included locale, omitting those
wenzelm@30845
   137
that are already present in the theorem specification.  Multiple
wenzelm@30845
   138
assume elements of a locale should be replaced by a single one
wenzelm@30845
   139
involving the locale predicate.  In the proof body, declarations (most
wenzelm@30845
   140
notably theorems) may be regained by interpreting the respective
wenzelm@30845
   141
locales in the proof context as required (command "interpret").
wenzelm@30845
   142
wenzelm@30845
   143
If using "includes" in replacement of a target solely because the
wenzelm@30845
   144
parameter types in the theorem are not as general as in the target,
wenzelm@30845
   145
consider declaring a new locale with additional type constraints on
wenzelm@30845
   146
the parameters (context element "constrains").
wenzelm@30845
   147
wenzelm@30845
   148
- Discontinued "locale (open)".  INCOMPATIBILITY.
wenzelm@30845
   149
wenzelm@30845
   150
- Locale interpretation commands no longer attempt to simplify goal.
wenzelm@30845
   151
INCOMPATIBILITY: in rare situations the generated goal differs.  Use
wenzelm@30845
   152
methods intro_locales and unfold_locales to clarify.
wenzelm@30845
   153
wenzelm@30845
   154
- Locale interpretation commands no longer accept interpretation
wenzelm@30845
   155
attributes.  INCOMPATIBILITY.
wenzelm@30845
   156
wenzelm@30845
   157
* Class declaration: so-called "base sort" must not be given in import
wenzelm@30845
   158
list any longer, but is inferred from the specification.  Particularly
wenzelm@30845
   159
in HOL, write
wenzelm@30845
   160
wenzelm@30845
   161
    class foo = ...
wenzelm@30845
   162
wenzelm@30845
   163
instead of
wenzelm@30845
   164
wenzelm@30845
   165
    class foo = type + ...
wenzelm@30845
   166
wenzelm@30845
   167
* Class target: global versions of theorems stemming do not carry a
wenzelm@30845
   168
parameter prefix any longer.  INCOMPATIBILITY.
wenzelm@30845
   169
wenzelm@30845
   170
* Class 'instance' command no longer accepts attached definitions.
wenzelm@30845
   171
INCOMPATIBILITY, use proper 'instantiation' target instead.
wenzelm@30845
   172
wenzelm@30845
   173
* Recovered hiding of consts, which was accidentally broken in
wenzelm@30845
   174
Isabelle2007.  Potential INCOMPATIBILITY, ``hide const c'' really
wenzelm@30845
   175
makes c inaccessible; consider using ``hide (open) const c'' instead.
wenzelm@30845
   176
wenzelm@30845
   177
* Slightly more coherent Pure syntax, with updated documentation in
wenzelm@30845
   178
isar-ref manual.  Removed locales meta_term_syntax and
wenzelm@30845
   179
meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
wenzelm@30845
   180
INCOMPATIBILITY in rare situations.  Note that &&& should not be used
wenzelm@30845
   181
directly in regular applications.
wenzelm@30845
   182
wenzelm@30845
   183
* There is a new syntactic category "float_const" for signed decimal
wenzelm@30845
   184
fractions (e.g. 123.45 or -123.45).
wenzelm@30845
   185
wenzelm@30845
   186
* Removed exotic 'token_translation' command.  INCOMPATIBILITY, use ML
wenzelm@30845
   187
interface with 'setup' command instead.
wenzelm@30845
   188
wenzelm@30845
   189
* Command 'local_setup' is similar to 'setup', but operates on a local
wenzelm@30845
   190
theory context.
haftmann@27104
   191
wenzelm@28114
   192
* The 'axiomatization' command now only works within a global theory
wenzelm@28114
   193
context.  INCOMPATIBILITY.
wenzelm@28114
   194
wenzelm@30845
   195
* Goal-directed proof now enforces strict proof irrelevance wrt. sort
wenzelm@30845
   196
hypotheses.  Sorts required in the course of reasoning need to be
wenzelm@30845
   197
covered by the constraints in the initial statement, completed by the
wenzelm@30845
   198
type instance information of the background theory.  Non-trivial sort
wenzelm@30845
   199
hypotheses, which rarely occur in practice, may be specified via
wenzelm@30845
   200
vacuous propositions of the form SORT_CONSTRAINT('a::c).  For example:
wenzelm@30845
   201
wenzelm@30845
   202
  lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
wenzelm@30845
   203
wenzelm@30845
   204
The result contains an implicit sort hypotheses as before --
wenzelm@30845
   205
SORT_CONSTRAINT premises are eliminated as part of the canonical rule
wenzelm@30845
   206
normalization.
wenzelm@30845
   207
wenzelm@30845
   208
* Generalized Isar history, with support for linear undo, direct state
wenzelm@30845
   209
addressing etc.
wenzelm@30845
   210
wenzelm@30845
   211
* Changed defaults for unify configuration options:
wenzelm@30845
   212
wenzelm@30845
   213
  unify_trace_bound = 50 (formerly 25)
wenzelm@30845
   214
  unify_search_bound = 60 (formerly 30)
wenzelm@30845
   215
wenzelm@30845
   216
* Different bookkeeping for code equations (INCOMPATIBILITY):
wenzelm@30845
   217
wenzelm@30845
   218
  a) On theory merge, the last set of code equations for a particular
wenzelm@30845
   219
     constant is taken (in accordance with the policy applied by other
wenzelm@30845
   220
     parts of the code generator framework).
wenzelm@30845
   221
wenzelm@30845
   222
  b) Code equations stemming from explicit declarations (e.g. code
wenzelm@30845
   223
     attribute) gain priority over default code equations stemming
wenzelm@30845
   224
     from definition, primrec, fun etc.
wenzelm@30845
   225
wenzelm@30845
   226
* Keyword 'code_exception' now named 'code_abort'.  INCOMPATIBILITY.
wenzelm@30845
   227
haftmann@30965
   228
* Unified theorem tables for both code generators.  Thus [code
wenzelm@30845
   229
func] has disappeared and only [code] remains.  INCOMPATIBILITY.
wenzelm@30577
   230
wenzelm@30577
   231
* Command 'find_consts' searches for constants based on type and name
wenzelm@30577
   232
patterns, e.g.
kleing@29883
   233
kleing@29883
   234
    find_consts "_ => bool"
kleing@29883
   235
wenzelm@30106
   236
By default, matching is against subtypes, but it may be restricted to
wenzelm@30728
   237
the whole type.  Searching by name is possible.  Multiple queries are
wenzelm@30106
   238
conjunctive and queries may be negated by prefixing them with a
wenzelm@30106
   239
hyphen:
kleing@29883
   240
kleing@29883
   241
    find_consts strict: "_ => bool" name: "Int" -"int => int"
kleing@29861
   242
wenzelm@30845
   243
* New 'find_theorems' criterion "solves" matches theorems that
wenzelm@30845
   244
directly solve the current goal (modulo higher-order unification).
wenzelm@30845
   245
wenzelm@30845
   246
* Auto solve feature for main theorem statements: whenever a new goal
wenzelm@30845
   247
is stated, "find_theorems solves" is called; any theorems that could
wenzelm@30845
   248
solve the lemma directly are listed as part of the goal state.
wenzelm@30845
   249
Cf. associated options in Proof General Isabelle settings menu,
wenzelm@30845
   250
enabled by default, with reasonable timeout for pathological cases of
wenzelm@30845
   251
higher-order unification.
webertj@30415
   252
haftmann@27104
   253
wenzelm@27381
   254
*** Document preparation ***
wenzelm@27381
   255
wenzelm@27381
   256
* Antiquotation @{lemma} now imitates a regular terminal proof,
wenzelm@27392
   257
demanding keyword 'by' and supporting the full method expression
wenzelm@27519
   258
syntax just like the Isar command 'by'.
wenzelm@27381
   259
wenzelm@27381
   260
haftmann@27104
   261
*** HOL ***
haftmann@27104
   262
wenzelm@30845
   263
* Integrated main parts of former image HOL-Complex with HOL.  Entry
wenzelm@30845
   264
points Main and Complex_Main remain as before.
wenzelm@30845
   265
wenzelm@30845
   266
* Logic image HOL-Plain provides a minimal HOL with the most important
wenzelm@30845
   267
tools available (inductive, datatype, primrec, ...).  This facilitates
wenzelm@30845
   268
experimentation and tool development.  Note that user applications
wenzelm@30845
   269
(and library theories) should never refer to anything below theory
wenzelm@30845
   270
Main, as before.
wenzelm@30845
   271
wenzelm@30845
   272
* Logic image HOL-Main stops at theory Main, and thus facilitates
wenzelm@30845
   273
experimentation due to shorter build times.
wenzelm@30845
   274
wenzelm@30845
   275
* Logic image HOL-NSA contains theories of nonstandard analysis which
wenzelm@30845
   276
were previously part of former HOL-Complex.  Entry point Hyperreal
wenzelm@30845
   277
remains valid, but theories formerly using Complex_Main should now use
wenzelm@30845
   278
new entry point Hypercomplex.
wenzelm@30845
   279
wenzelm@30845
   280
* Generic ATP manager for Sledgehammer, based on ML threads instead of
wenzelm@30845
   281
Posix processes.  Avoids potentially expensive forking of the ML
wenzelm@30845
   282
process.  New thread-based implementation also works on non-Unix
wenzelm@30845
   283
platforms (Cygwin).  Provers are no longer hardwired, but defined
wenzelm@30845
   284
within the theory via plain ML wrapper functions.  Basic Sledgehammer
wenzelm@30845
   285
commands are covered in the isar-ref manual.
wenzelm@30845
   286
wenzelm@30845
   287
* Wrapper scripts for remote SystemOnTPTP service allows to use
wenzelm@30845
   288
sledgehammer without local ATP installation (Vampire etc.). Other
wenzelm@30845
   289
provers may be included via suitable ML wrappers, see also
wenzelm@30845
   290
src/HOL/ATP_Linkup.thy.
wenzelm@30845
   291
wenzelm@30845
   292
* ATP selection (E/Vampire/Spass) is now via Proof General's settings
wenzelm@30845
   293
menu.
wenzelm@30845
   294
wenzelm@30845
   295
* The metis method no longer fails because the theorem is too trivial
wenzelm@30845
   296
(contains the empty clause).
wenzelm@30845
   297
wenzelm@30845
   298
* The metis method now fails in the usual manner, rather than raising
wenzelm@30845
   299
an exception, if it determines that it cannot prove the theorem.
wenzelm@30845
   300
wenzelm@30845
   301
* Method "coherent" implements a prover for coherent logic (see also
wenzelm@30845
   302
src/Tools/coherent.ML).
wenzelm@30845
   303
wenzelm@30845
   304
* Constants "undefined" and "default" replace "arbitrary".  Usually
wenzelm@30845
   305
"undefined" is the right choice to replace "arbitrary", though
wenzelm@30845
   306
logically there is no difference.  INCOMPATIBILITY.
wenzelm@30845
   307
wenzelm@30845
   308
* Command "value" now integrates different evaluation mechanisms.  The
wenzelm@30845
   309
result of the first successful evaluation mechanism is printed.  In
wenzelm@30845
   310
square brackets a particular named evaluation mechanisms may be
wenzelm@30845
   311
specified (currently, [SML], [code] or [nbe]).  See further
wenzelm@30845
   312
src/HOL/ex/Eval_Examples.thy.
wenzelm@30845
   313
wenzelm@30845
   314
* Normalization by evaluation now allows non-leftlinear equations.
wenzelm@30845
   315
Declare with attribute [code nbe].
wenzelm@30845
   316
wenzelm@30845
   317
* Methods "case_tac" and "induct_tac" now refer to the very same rules
wenzelm@30845
   318
as the structured Isar versions "cases" and "induct", cf. the
wenzelm@30845
   319
corresponding "cases" and "induct" attributes.  Mutual induction rules
wenzelm@30845
   320
are now presented as a list of individual projections
wenzelm@30845
   321
(e.g. foo_bar.inducts for types foo and bar); the old format with
wenzelm@30845
   322
explicit HOL conjunction is no longer supported.  INCOMPATIBILITY, in
wenzelm@30845
   323
rare situations a different rule is selected --- notably nested tuple
wenzelm@30845
   324
elimination instead of former prod.exhaust: use explicit (case_tac t
wenzelm@30845
   325
rule: prod.exhaust) here.
wenzelm@30845
   326
wenzelm@30845
   327
* Attributes "cases", "induct", "coinduct" support "del" option.
wenzelm@30845
   328
wenzelm@30845
   329
* Removed fact "case_split_thm", which duplicates "case_split".
wenzelm@30845
   330
wenzelm@30845
   331
* The option datatype has been moved to a new theory Option.  Renamed
wenzelm@30845
   332
option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
wenzelm@30845
   333
wenzelm@30845
   334
* New predicate "strict_mono" classifies strict functions on partial
wenzelm@30845
   335
orders.  With strict functions on linear orders, reasoning about
wenzelm@30845
   336
(in)equalities is facilitated by theorems "strict_mono_eq",
wenzelm@30845
   337
"strict_mono_less_eq" and "strict_mono_less".
wenzelm@30845
   338
wenzelm@30845
   339
* Some set operations are now proper qualified constants with
wenzelm@30845
   340
authentic syntax.  INCOMPATIBILITY:
haftmann@30304
   341
haftmann@30304
   342
    op Int ~>   Set.Int
haftmann@30304
   343
    op Un ~>    Set.Un
haftmann@30304
   344
    INTER ~>    Set.INTER
haftmann@30304
   345
    UNION ~>    Set.UNION
haftmann@30304
   346
    Inter ~>    Set.Inter
haftmann@30304
   347
    Union ~>    Set.Union
haftmann@30304
   348
    {} ~>       Set.empty
haftmann@30304
   349
    UNIV ~>     Set.UNIV
haftmann@30304
   350
wenzelm@30845
   351
* Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
wenzelm@30845
   352
theory Set.
wenzelm@30845
   353
wenzelm@30845
   354
* Auxiliary class "itself" has disappeared -- classes without any
wenzelm@30845
   355
parameter are treated as expected by the 'class' command.
haftmann@29797
   356
haftmann@29823
   357
* Leibnitz's Series for Pi and the arcus tangens and logarithm series.
haftmann@29823
   358
wenzelm@30845
   359
* Common decision procedures (Cooper, MIR, Ferrack, Approximation,
wenzelm@30845
   360
Dense_Linear_Order) are now in directory HOL/Decision_Procs.
wenzelm@30845
   361
wenzelm@30845
   362
* Theory src/HOL/Decision_Procs/Approximation provides the new proof
wenzelm@30845
   363
method "approximation".  It proves formulas on real values by using
wenzelm@30845
   364
interval arithmetic.  In the formulas are also the transcendental
wenzelm@30845
   365
functions sin, cos, tan, atan, ln, exp and the constant pi are
wenzelm@30845
   366
allowed. For examples see
wenzelm@30845
   367
src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
haftmann@29823
   368
haftmann@29823
   369
* Theory "Reflection" now resides in HOL/Library.
haftmann@29650
   370
wenzelm@30845
   371
* Entry point to Word library now simply named "Word".
wenzelm@30845
   372
INCOMPATIBILITY.
haftmann@29628
   373
haftmann@29197
   374
* Made source layout more coherent with logical distribution
haftmann@29197
   375
structure:
haftmann@28952
   376
haftmann@28952
   377
    src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
haftmann@28952
   378
    src/HOL/Library/Code_Message.thy ~> src/HOL/
haftmann@28952
   379
    src/HOL/Library/GCD.thy ~> src/HOL/
haftmann@28952
   380
    src/HOL/Library/Order_Relation.thy ~> src/HOL/
haftmann@28952
   381
    src/HOL/Library/Parity.thy ~> src/HOL/
haftmann@28952
   382
    src/HOL/Library/Univ_Poly.thy ~> src/HOL/
huffman@30176
   383
    src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
haftmann@28952
   384
    src/HOL/Real/Lubs.thy ~> src/HOL/
haftmann@28952
   385
    src/HOL/Real/PReal.thy ~> src/HOL/
haftmann@28952
   386
    src/HOL/Real/Rational.thy ~> src/HOL/
haftmann@28952
   387
    src/HOL/Real/RComplete.thy ~> src/HOL/
haftmann@28952
   388
    src/HOL/Real/RealDef.thy ~> src/HOL/
haftmann@28952
   389
    src/HOL/Real/RealPow.thy ~> src/HOL/
haftmann@28952
   390
    src/HOL/Real/Real.thy ~> src/HOL/
haftmann@28952
   391
    src/HOL/Complex/Complex_Main.thy ~> src/HOL/
haftmann@28952
   392
    src/HOL/Complex/Complex.thy ~> src/HOL/
huffman@30176
   393
    src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
huffman@30176
   394
    src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
haftmann@28952
   395
    src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
haftmann@28952
   396
    src/HOL/Hyperreal/Fact.thy ~> src/HOL/
haftmann@28952
   397
    src/HOL/Hyperreal/Integration.thy ~> src/HOL/
haftmann@28952
   398
    src/HOL/Hyperreal/Lim.thy ~> src/HOL/
haftmann@28952
   399
    src/HOL/Hyperreal/Ln.thy ~> src/HOL/
haftmann@28952
   400
    src/HOL/Hyperreal/Log.thy ~> src/HOL/
haftmann@28952
   401
    src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
haftmann@28952
   402
    src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
haftmann@28952
   403
    src/HOL/Hyperreal/Series.thy ~> src/HOL/
haftmann@29197
   404
    src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
haftmann@28952
   405
    src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
haftmann@28952
   406
    src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
haftmann@28952
   407
    src/HOL/Real/Float ~> src/HOL/Library/
haftmann@29197
   408
    src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
haftmann@29197
   409
    src/HOL/Real/RealVector.thy ~> src/HOL/
haftmann@28952
   410
haftmann@28952
   411
    src/HOL/arith_data.ML ~> src/HOL/Tools
haftmann@28952
   412
    src/HOL/hologic.ML ~> src/HOL/Tools
haftmann@28952
   413
    src/HOL/simpdata.ML ~> src/HOL/Tools
haftmann@28952
   414
    src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
haftmann@28952
   415
    src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
haftmann@28952
   416
    src/HOL/nat_simprocs.ML ~> src/HOL/Tools
haftmann@28952
   417
    src/HOL/Real/float_arith.ML ~> src/HOL/Tools
haftmann@28952
   418
    src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
haftmann@28952
   419
    src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
haftmann@28952
   420
    src/HOL/Real/real_arith.ML ~> src/HOL/Tools
haftmann@28952
   421
haftmann@29398
   422
    src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   423
    src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   424
    src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   425
    src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   426
    src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   427
    src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   428
wenzelm@30845
   429
* If methods "eval" and "evaluation" encounter a structured proof
wenzelm@30845
   430
state with !!/==>, only the conclusion is evaluated to True (if
wenzelm@30845
   431
possible), avoiding strange error messages.
wenzelm@30845
   432
wenzelm@30845
   433
* Method "sizechange" automates termination proofs using (a
wenzelm@30845
   434
modification of) the size-change principle.  Requires SAT solver.  See
wenzelm@30845
   435
src/HOL/ex/Termination.thy for examples.
wenzelm@30845
   436
wenzelm@30845
   437
* Simplifier: simproc for let expressions now unfolds if bound
wenzelm@30845
   438
variable occurs at most once in let expression body.  INCOMPATIBILITY.
wenzelm@30845
   439
wenzelm@30845
   440
* Method "arith": Linear arithmetic now ignores all inequalities when
wenzelm@30845
   441
fast_arith_neq_limit is exceeded, instead of giving up entirely.
wenzelm@30845
   442
wenzelm@30845
   443
* New attribute "arith" for facts that should always be used
wenzelm@30845
   444
automatically by arithmetic. It is intended to be used locally in
wenzelm@30845
   445
proofs, e.g.
wenzelm@30845
   446
wenzelm@30845
   447
  assumes [arith]: "x > 0"
wenzelm@30845
   448
nipkow@30706
   449
Global usage is discouraged because of possible performance impact.
nipkow@30706
   450
wenzelm@30845
   451
* New classes "top" and "bot" with corresponding operations "top" and
wenzelm@30845
   452
"bot" in theory Orderings; instantiation of class "complete_lattice"
wenzelm@30845
   453
requires instantiation of classes "top" and "bot".  INCOMPATIBILITY.
wenzelm@30845
   454
wenzelm@30845
   455
* Changed definition lemma "less_fun_def" in order to provide an
wenzelm@30845
   456
instance for preorders on functions; use lemma "less_le" instead.
wenzelm@30845
   457
INCOMPATIBILITY.
wenzelm@30845
   458
wenzelm@30845
   459
* Theory Orderings: class "wellorder" moved here, with explicit
wenzelm@30845
   460
induction rule "less_induct" as assumption.  For instantiation of
wenzelm@30845
   461
"wellorder" by means of predicate "wf", use rule wf_wellorderI.
wenzelm@30845
   462
INCOMPATIBILITY.
wenzelm@30845
   463
wenzelm@30845
   464
* Theory Orderings: added class "preorder" as superclass of "order".
wenzelm@27793
   465
INCOMPATIBILITY: Instantiation proofs for order, linorder
wenzelm@27793
   466
etc. slightly changed.  Some theorems named order_class.* now named
wenzelm@27793
   467
preorder_class.*.
wenzelm@27793
   468
wenzelm@30845
   469
* Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
wenzelm@30845
   470
"diag" to "Id_on".
wenzelm@30845
   471
wenzelm@30845
   472
* Theory Finite_Set: added a new fold combinator of type
wenzelm@30845
   473
nipkow@28855
   474
  ('a => 'b => 'b) => 'b => 'a set => 'b
wenzelm@30845
   475
wenzelm@30845
   476
Occasionally this is more convenient than the old fold combinator
wenzelm@30845
   477
which is now defined in terms of the new one and renamed to
wenzelm@30845
   478
fold_image.
wenzelm@30845
   479
wenzelm@30845
   480
* Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
wenzelm@30845
   481
and "ring_simps" have been replaced by "algebra_simps" (which can be
wenzelm@30845
   482
extended with further lemmas!).  At the moment both still exist but
wenzelm@30845
   483
the former will disappear at some point.
wenzelm@30845
   484
wenzelm@30845
   485
* Theory Power: Lemma power_Suc is now declared as a simp rule in
wenzelm@30845
   486
class recpower.  Type-specific simp rules for various recpower types
wenzelm@30845
   487
have been removed.  INCOMPATIBILITY, rename old lemmas as follows:
huffman@30273
   488
huffman@30273
   489
rat_power_0    -> power_0
huffman@30273
   490
rat_power_Suc  -> power_Suc
huffman@30273
   491
realpow_0      -> power_0
huffman@30273
   492
realpow_Suc    -> power_Suc
huffman@30273
   493
complexpow_0   -> power_0
huffman@30273
   494
complexpow_Suc -> power_Suc
huffman@30273
   495
power_poly_0   -> power_0
huffman@30273
   496
power_poly_Suc -> power_Suc
huffman@30273
   497
wenzelm@30845
   498
* Theories Ring_and_Field and Divides: Definition of "op dvd" has been
wenzelm@27793
   499
moved to separate class dvd in Ring_and_Field; a couple of lemmas on
wenzelm@27793
   500
dvd has been generalized to class comm_semiring_1.  Likewise a bunch
wenzelm@27793
   501
of lemmas from Divides has been generalized from nat to class
wenzelm@27793
   502
semiring_div.  INCOMPATIBILITY.  This involves the following theorem
wenzelm@27793
   503
renames resulting from duplicate elimination:
haftmann@27651
   504
haftmann@27651
   505
    dvd_def_mod ~>          dvd_eq_mod_eq_0
haftmann@27651
   506
    zero_dvd_iff ~>         dvd_0_left_iff
haftmann@28559
   507
    dvd_0 ~>                dvd_0_right
haftmann@27651
   508
    DIVISION_BY_ZERO_DIV ~> div_by_0
haftmann@27651
   509
    DIVISION_BY_ZERO_MOD ~> mod_by_0
haftmann@27651
   510
    mult_div ~>             div_mult_self2_is_id
haftmann@27651
   511
    mult_mod ~>             mod_mult_self2_is_0
haftmann@27651
   512
wenzelm@30845
   513
* Theory IntDiv: removed many lemmas that are instances of class-based
wenzelm@30845
   514
generalizations (from Divides and Ring_and_Field).  INCOMPATIBILITY,
wenzelm@30845
   515
rename old lemmas as follows:
nipkow@30044
   516
nipkow@30044
   517
dvd_diff               -> nat_dvd_diff
nipkow@30044
   518
dvd_zminus_iff         -> dvd_minus_iff
nipkow@30224
   519
mod_add1_eq            -> mod_add_eq
nipkow@30224
   520
mod_mult1_eq           -> mod_mult_right_eq
nipkow@30224
   521
mod_mult1_eq'          -> mod_mult_left_eq
nipkow@30224
   522
mod_mult_distrib_mod   -> mod_mult_eq
nipkow@30044
   523
nat_mod_add_left_eq    -> mod_add_left_eq
nipkow@30044
   524
nat_mod_add_right_eq   -> mod_add_right_eq
nipkow@30044
   525
nat_mod_div_trivial    -> mod_div_trivial
nipkow@30044
   526
nat_mod_mod_trivial    -> mod_mod_trivial
nipkow@30044
   527
zdiv_zadd_self1        -> div_add_self1
nipkow@30044
   528
zdiv_zadd_self2        -> div_add_self2
nipkow@30181
   529
zdiv_zmult_self1       -> div_mult_self2_is_id
nipkow@30044
   530
zdiv_zmult_self2       -> div_mult_self1_is_id
nipkow@30044
   531
zdvd_triv_left         -> dvd_triv_left
nipkow@30044
   532
zdvd_triv_right        -> dvd_triv_right
nipkow@30044
   533
zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
nipkow@30085
   534
zmod_eq0_zdvd_iff      -> dvd_eq_mod_eq_0[symmetric]
nipkow@30044
   535
zmod_zadd_left_eq      -> mod_add_left_eq
nipkow@30044
   536
zmod_zadd_right_eq     -> mod_add_right_eq
nipkow@30044
   537
zmod_zadd_self1        -> mod_add_self1
nipkow@30044
   538
zmod_zadd_self2        -> mod_add_self2
nipkow@30224
   539
zmod_zadd1_eq          -> mod_add_eq
nipkow@30044
   540
zmod_zdiff1_eq         -> mod_diff_eq
nipkow@30044
   541
zmod_zdvd_zmod         -> mod_mod_cancel
nipkow@30044
   542
zmod_zmod_cancel       -> mod_mod_cancel
nipkow@30044
   543
zmod_zmult_self1       -> mod_mult_self2_is_0
nipkow@30044
   544
zmod_zmult_self2       -> mod_mult_self1_is_0
nipkow@30044
   545
zmod_1                 -> mod_by_1
nipkow@30044
   546
zdiv_1                 -> div_by_1
nipkow@30044
   547
zdvd_abs1              -> abs_dvd_iff
nipkow@30044
   548
zdvd_abs2              -> dvd_abs_iff
nipkow@30044
   549
zdvd_refl              -> dvd_refl
nipkow@30044
   550
zdvd_trans             -> dvd_trans
nipkow@30044
   551
zdvd_zadd              -> dvd_add
nipkow@30044
   552
zdvd_zdiff             -> dvd_diff
nipkow@30044
   553
zdvd_zminus_iff        -> dvd_minus_iff
nipkow@30044
   554
zdvd_zminus2_iff       -> minus_dvd_iff
nipkow@30044
   555
zdvd_zmultD            -> dvd_mult_right
nipkow@30044
   556
zdvd_zmultD2           -> dvd_mult_left
nipkow@30044
   557
zdvd_zmult_mono        -> mult_dvd_mono
nipkow@30044
   558
zdvd_0_right           -> dvd_0_right
nipkow@30044
   559
zdvd_0_left            -> dvd_0_left_iff
nipkow@30044
   560
zdvd_1_left            -> one_dvd
nipkow@30044
   561
zminus_dvd_iff         -> minus_dvd_iff
nipkow@30044
   562
wenzelm@30845
   563
* Theory Rational: 'Fract k 0' now equals '0'.  INCOMPATIBILITY.
wenzelm@30845
   564
wenzelm@30845
   565
* The real numbers offer decimal input syntax: 12.34 is translated
wenzelm@30845
   566
into 1234/10^2. This translation is not reversed upon output.
wenzelm@30845
   567
wenzelm@30845
   568
* Theory Library/Polynomial defines an abstract type 'a poly of
wenzelm@30845
   569
univariate polynomials with coefficients of type 'a.  In addition to
wenzelm@30845
   570
the standard ring operations, it also supports div and mod.  Code
wenzelm@30845
   571
generation is also supported, using list-style constructors.
wenzelm@30845
   572
wenzelm@30845
   573
* Theory Library/Inner_Product defines a class of real_inner for real
wenzelm@30845
   574
inner product spaces, with an overloaded operation inner :: 'a => 'a
wenzelm@30845
   575
=> real.  Class real_inner is a subclass of real_normed_vector from
wenzelm@30845
   576
theory RealVector.
wenzelm@30845
   577
wenzelm@30845
   578
* Theory Library/Product_Vector provides instances for the product
wenzelm@30845
   579
type 'a * 'b of several classes from RealVector and Inner_Product.
wenzelm@30845
   580
Definitions of addition, subtraction, scalar multiplication, norms,
wenzelm@30845
   581
and inner products are included.
wenzelm@30845
   582
wenzelm@30845
   583
* Theory Library/Bit defines the field "bit" of integers modulo 2.  In
wenzelm@30845
   584
addition to the field operations, numerals and case syntax are also
wenzelm@30845
   585
supported.
wenzelm@30845
   586
wenzelm@30845
   587
* Theory Library/Diagonalize provides constructive version of Cantor's
wenzelm@30845
   588
first diagonalization argument.
wenzelm@30845
   589
wenzelm@30845
   590
* Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
wenzelm@27599
   591
zlcm (for int); carried together from various gcd/lcm developements in
wenzelm@30845
   592
the HOL Distribution.  Constants zgcd and zlcm replace former igcd and
wenzelm@30845
   593
ilcm; corresponding theorems renamed accordingly.  INCOMPATIBILITY,
wenzelm@30845
   594
may recover tupled syntax as follows:
haftmann@27556
   595
haftmann@27556
   596
    hide (open) const gcd
haftmann@27556
   597
    abbreviation gcd where
haftmann@27556
   598
      "gcd == (%(a, b). GCD.gcd a b)"
haftmann@27556
   599
    notation (output)
haftmann@27556
   600
      GCD.gcd ("gcd '(_, _')")
haftmann@27556
   601
wenzelm@30845
   602
The same works for lcm, zgcd, zlcm.
wenzelm@30845
   603
wenzelm@30845
   604
* Theory Library/Nat_Infinity: added addition, numeral syntax and more
wenzelm@30845
   605
instantiations for algebraic structures.  Removed some duplicate
wenzelm@30845
   606
theorems.  Changes in simp rules.  INCOMPATIBILITY.
wenzelm@30845
   607
wenzelm@30845
   608
* ML antiquotation @{code} takes a constant as argument and generates
haftmann@27651
   609
corresponding code in background and inserts name of the corresponding
haftmann@27651
   610
resulting ML value/function/datatype constructor binding in place.
haftmann@27651
   611
All occurrences of @{code} with a single ML block are generated
haftmann@27651
   612
simultaneously.  Provides a generic and safe interface for
wenzelm@30845
   613
instrumentalizing code generation.  See
wenzelm@30845
   614
src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
wenzelm@30845
   615
In future you ought to refrain from ad-hoc compiling generated SML
wenzelm@30845
   616
code on the ML toplevel.  Note that (for technical reasons) @{code}
wenzelm@30845
   617
cannot refer to constants for which user-defined serializations are
wenzelm@30845
   618
set.  Refer to the corresponding ML counterpart directly in that
wenzelm@30845
   619
cases.
wenzelm@27122
   620
wenzelm@27122
   621
* Command 'rep_datatype': instead of theorem names the command now
wenzelm@27122
   622
takes a list of terms denoting the constructors of the type to be
wenzelm@27122
   623
represented as datatype.  The characteristic theorems have to be
wenzelm@27122
   624
proven.  INCOMPATIBILITY.  Also observe that the following theorems
wenzelm@27122
   625
have disappeared in favour of existing ones:
wenzelm@27122
   626
haftmann@27104
   627
    unit_induct                 ~> unit.induct
haftmann@27104
   628
    prod_induct                 ~> prod.induct
haftmann@27104
   629
    sum_induct                  ~> sum.induct
haftmann@27104
   630
    Suc_Suc_eq                  ~> nat.inject
haftmann@27104
   631
    Suc_not_Zero Zero_not_Suc   ~> nat.distinct
haftmann@27104
   632
haftmann@27104
   633
ballarin@27696
   634
*** HOL-Algebra ***
ballarin@27696
   635
ballarin@27713
   636
* New locales for orders and lattices where the equivalence relation
wenzelm@30106
   637
is not restricted to equality.  INCOMPATIBILITY: all order and lattice
wenzelm@30106
   638
locales use a record structure with field eq for the equivalence.
ballarin@27713
   639
ballarin@27713
   640
* New theory of factorial domains.
ballarin@27713
   641
wenzelm@30845
   642
* Units_l_inv and Units_r_inv are now simp rules by default.
ballarin@27696
   643
INCOMPATIBILITY.  Simplifier proof that require deletion of l_inv
ballarin@27696
   644
and/or r_inv will now also require deletion of these lemmas.
ballarin@27696
   645
wenzelm@30845
   646
* Renamed the following theorems, INCOMPATIBILITY:
wenzelm@30845
   647
ballarin@27696
   648
UpperD ~> Upper_memD
ballarin@27696
   649
LowerD ~> Lower_memD
ballarin@27696
   650
least_carrier ~> least_closed
ballarin@27696
   651
greatest_carrier ~> greatest_closed
ballarin@27696
   652
greatest_Lower_above ~> greatest_Lower_below
ballarin@27717
   653
one_zero ~> carrier_one_zero
ballarin@27717
   654
one_not_zero ~> carrier_one_not_zero  (collision with assumption)
ballarin@27696
   655
wenzelm@27793
   656
wenzelm@30849
   657
*** HOL-Nominal ***
wenzelm@30849
   658
wenzelm@30855
   659
* Nominal datatypes can now contain type-variables.
wenzelm@30855
   660
wenzelm@30855
   661
* Commands 'nominal_inductive' and 'equivariance' work with local
wenzelm@30855
   662
theory targets.
wenzelm@30855
   663
wenzelm@30855
   664
* Nominal primrec can now works with local theory targets and its
wenzelm@30855
   665
specification syntax now conforms to the general format as seen in
wenzelm@30855
   666
'inductive' etc.
wenzelm@30855
   667
wenzelm@30855
   668
* Method "perm_simp" honours the standard simplifier attributes
wenzelm@30855
   669
(no_asm), (no_asm_use) etc.
wenzelm@30855
   670
wenzelm@30855
   671
* The new predicate #* is defined like freshness, except that on the
wenzelm@30855
   672
left hand side can be a set or list of atoms.
wenzelm@30855
   673
wenzelm@30855
   674
* Experimental command 'nominal_inductive2' derives strong induction
wenzelm@30855
   675
principles for inductive definitions.  In contrast to
wenzelm@30855
   676
'nominal_inductive', which can only deal with a fixed number of
wenzelm@30855
   677
binders, it can deal with arbitrary expressions standing for sets of
wenzelm@30855
   678
atoms to be avoided.  The only inductive definition we have at the
wenzelm@30855
   679
moment that needs this generalisation is the typing rule for Lets in
wenzelm@30855
   680
the algorithm W:
wenzelm@30855
   681
wenzelm@30855
   682
 Gamma |- t1 : T1   (x,close Gamma T1)::Gamma |- t2 : T2   x#Gamma
wenzelm@30855
   683
 -----------------------------------------------------------------
wenzelm@30855
   684
         Gamma |- Let x be t1 in t2 : T2
wenzelm@30855
   685
wenzelm@30855
   686
In this rule one wants to avoid all the binders that are introduced by
wenzelm@30855
   687
"close Gamma T1".  We are looking for other examples where this
wenzelm@30855
   688
feature might be useful.  Please let us know.
wenzelm@30849
   689
wenzelm@30849
   690
huffman@30176
   691
*** HOLCF ***
huffman@30176
   692
huffman@30176
   693
* Reimplemented the simplification procedure for proving continuity
huffman@30176
   694
subgoals.  The new simproc is extensible; users can declare additional
huffman@30176
   695
continuity introduction rules with the attribute [cont2cont].
huffman@30176
   696
huffman@30176
   697
* The continuity simproc now uses a different introduction rule for
huffman@30176
   698
solving continuity subgoals on terms with lambda abstractions.  In
huffman@30176
   699
some rare cases the new simproc may fail to solve subgoals that the
huffman@30176
   700
old one could solve, and "simp add: cont2cont_LAM" may be necessary.
huffman@30176
   701
Potential INCOMPATIBILITY.
huffman@30176
   702
wenzelm@30847
   703
* Command 'fixrec': specification syntax now conforms to the general
wenzelm@30855
   704
format as seen in 'inductive' etc.  See src/HOLCF/ex/Fixrec_ex.thy for
wenzelm@30855
   705
examples.  INCOMPATIBILITY.
wenzelm@30845
   706
wenzelm@30845
   707
wenzelm@30845
   708
*** ZF ***
wenzelm@30845
   709
wenzelm@30845
   710
* Proof of Zorn's Lemma for partial orders.
huffman@30176
   711
huffman@30176
   712
wenzelm@27246
   713
*** ML ***
wenzelm@28088
   714
wenzelm@30845
   715
* Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
wenzelm@30845
   716
Poly/ML 5.2.1 or later.  Important note: the TimeLimit facility
wenzelm@30845
   717
depends on multithreading, so timouts will not work before Poly/ML
wenzelm@30845
   718
5.2.1!
wenzelm@30845
   719
wenzelm@29161
   720
* High-level support for concurrent ML programming, see
wenzelm@29161
   721
src/Pure/Cuncurrent.  The data-oriented model of "future values" is
wenzelm@29161
   722
particularly convenient to organize independent functional
wenzelm@29161
   723
computations.  The concept of "synchronized variables" provides a
wenzelm@29161
   724
higher-order interface for components with shared state, avoiding the
wenzelm@30845
   725
delicate details of mutexes and condition variables.  (Requires
wenzelm@30845
   726
Poly/ML 5.2.1 or later.)
wenzelm@30845
   727
wenzelm@30845
   728
* ML bindings produced via Isar commands are stored within the Isar
wenzelm@30845
   729
context (theory or proof).  Consequently, commands like 'use' and 'ML'
wenzelm@30845
   730
become thread-safe and work with undo as expected (concerning
wenzelm@30845
   731
top-level bindings, not side-effects on global references).
wenzelm@30845
   732
INCOMPATIBILITY, need to provide proper Isar context when invoking the
wenzelm@30845
   733
compiler at runtime; really global bindings need to be given outside a
wenzelm@30845
   734
theory.  (Requires Poly/ML 5.2 or later.)
wenzelm@30845
   735
wenzelm@30845
   736
* Command 'ML_prf' is analogous to 'ML' but works within a proof
wenzelm@30845
   737
context.  Top-level ML bindings are stored within the proof context in
wenzelm@30845
   738
a purely sequential fashion, disregarding the nested proof structure.
wenzelm@30845
   739
ML bindings introduced by 'ML_prf' are discarded at the end of the
wenzelm@30845
   740
proof.  (Requires Poly/ML 5.2 or later.)
wenzelm@29161
   741
wenzelm@30530
   742
* Simplified ML attribute and method setup, cf. functions Attrib.setup
wenzelm@30845
   743
and Method.setup, as well as Isar commands 'attribute_setup' and
wenzelm@30547
   744
'method_setup'.  INCOMPATIBILITY for 'method_setup', need to simplify
wenzelm@30547
   745
existing code accordingly, or use plain 'setup' together with old
wenzelm@30547
   746
Method.add_method.
wenzelm@30530
   747
wenzelm@28294
   748
* Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
wenzelm@28294
   749
to 'a -> thm, while results are always tagged with an authentic oracle
wenzelm@28294
   750
name.  The Isar command 'oracle' is now polymorphic, no argument type
wenzelm@28294
   751
is specified.  INCOMPATIBILITY, need to simplify existing oracle code
wenzelm@28294
   752
accordingly.  Note that extra performance may be gained by producing
wenzelm@28294
   753
the cterm carefully, avoiding slow Thm.cterm_of.
wenzelm@28294
   754
wenzelm@30845
   755
* Simplified interface for defining document antiquotations via
wenzelm@30845
   756
ThyOutput.antiquotation, ThyOutput.output, and optionally
wenzelm@30845
   757
ThyOutput.maybe_pretty_source.  INCOMPATIBILITY, need to simplify user
wenzelm@30845
   758
antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
wenzelm@30845
   759
examples.
wenzelm@28099
   760
wenzelm@30395
   761
* More systematic treatment of long names, abstract name bindings, and
wenzelm@30395
   762
name space operations.  Basic operations on qualified names have been
wenzelm@30399
   763
move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
wenzelm@30395
   764
Long_Name.append.  Old type bstring has been mostly replaced by
wenzelm@30395
   765
abstract type binding (see structure Binding), which supports precise
wenzelm@30845
   766
qualification by packages and local theory targets, as well as proper
wenzelm@30845
   767
tracking of source positions.  INCOMPATIBILITY, need to wrap old
wenzelm@30845
   768
bstring values into Binding.name, or better pass through abstract
wenzelm@30399
   769
bindings everywhere.  See further src/Pure/General/long_name.ML,
wenzelm@30395
   770
src/Pure/General/binding.ML and src/Pure/General/name_space.ML
wenzelm@30395
   771
wenzelm@28089
   772
* Result facts (from PureThy.note_thms, ProofContext.note_thms,
wenzelm@28089
   773
LocalTheory.note etc.) now refer to the *full* internal name, not the
wenzelm@28089
   774
bstring as before.  INCOMPATIBILITY, not detected by ML type-checking!
wenzelm@28089
   775
wenzelm@27287
   776
* Disposed old type and term read functions (Sign.read_def_typ,
wenzelm@27287
   777
Sign.read_typ, Sign.read_def_terms, Sign.read_term,
wenzelm@27287
   778
Thm.read_def_cterms, Thm.read_cterm etc.).  INCOMPATIBILITY, should
wenzelm@27287
   779
use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
wenzelm@27269
   780
Syntax.read_term_global etc.; see also OldGoals.read_term as last
wenzelm@27269
   781
resort for legacy applications.
wenzelm@27269
   782
wenzelm@30609
   783
* Disposed old declarations, tactics, tactic combinators that refer to
wenzelm@30609
   784
the simpset or claset of an implicit theory (such as Addsimps,
wenzelm@30609
   785
Simp_tac, SIMPSET).  INCOMPATIBILITY, should use @{simpset} etc. in
wenzelm@30609
   786
embedded ML text, or local_simpset_of with a proper context passed as
wenzelm@30609
   787
explicit runtime argument.
wenzelm@30609
   788
wenzelm@30845
   789
* Rules and tactics that read instantiations (read_instantiate,
wenzelm@30845
   790
res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
wenzelm@30845
   791
context, which is required for parsing and type-checking.  Moreover,
wenzelm@30845
   792
the variables are specified as plain indexnames, not string encodings
wenzelm@30845
   793
thereof.  INCOMPATIBILITY.
wenzelm@30845
   794
wenzelm@30845
   795
* Generic Toplevel.add_hook interface allows to analyze the result of
wenzelm@30845
   796
transactions.  E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
wenzelm@30845
   797
for theorem dependency output of transactions resulting in a new
wenzelm@30845
   798
theory state.
wenzelm@30845
   799
wenzelm@30845
   800
* ML antiquotations: block-structured compilation context indicated by
wenzelm@27391
   801
\<lbrace> ... \<rbrace>; additional antiquotation forms:
wenzelm@27391
   802
wenzelm@30845
   803
  @{binding name}                         - basic name binding
wenzelm@27519
   804
  @{let ?pat = term}                      - term abbreviation (HO matching)
wenzelm@27519
   805
  @{note name = fact}                     - fact abbreviation
wenzelm@27519
   806
  @{thm fact}                             - singleton fact (with attributes)
wenzelm@27519
   807
  @{thms fact}                            - general fact (with attributes)
wenzelm@27519
   808
  @{lemma prop by method}                 - singleton goal
wenzelm@27519
   809
  @{lemma prop by meth1 meth2}            - singleton goal
wenzelm@27519
   810
  @{lemma prop1 ... propN by method}      - general goal
wenzelm@27519
   811
  @{lemma prop1 ... propN by meth1 meth2} - general goal
wenzelm@27519
   812
  @{lemma (open) ...}                     - open derivation
wenzelm@27380
   813
wenzelm@27246
   814
wenzelm@27979
   815
*** System ***
wenzelm@27979
   816
wenzelm@28248
   817
* The Isabelle "emacs" tool provides a specific interface to invoke
wenzelm@28248
   818
Proof General / Emacs, with more explicit failure if that is not
wenzelm@28248
   819
installed (the old isabelle-interface script silently falls back on
wenzelm@28248
   820
isabelle-process).  The PROOFGENERAL_HOME setting determines the
wenzelm@28248
   821
installation location of the Proof General distribution.
wenzelm@28248
   822
wenzelm@27979
   823
* Isabelle/lib/classes/Pure.jar provides basic support to integrate
wenzelm@27979
   824
the Isabelle process into a JVM/Scala application.  See
wenzelm@27979
   825
Isabelle/lib/jedit/plugin for a minimal example.  (The obsolete Java
wenzelm@27979
   826
process wrapper has been discontinued.)
wenzelm@27979
   827
wenzelm@30845
   828
* Added homegrown Isabelle font with unicode layout, see lib/fonts.
wenzelm@30845
   829
wenzelm@30845
   830
* Various status messages (with exact source position information) are
wenzelm@27979
   831
emitted, if proper markup print mode is enabled.  This allows
wenzelm@27979
   832
user-interface components to provide detailed feedback on internal
wenzelm@27979
   833
prover operations.
wenzelm@27979
   834
wenzelm@27979
   835
wenzelm@27143
   836
wenzelm@27008
   837
New in Isabelle2008 (June 2008)
wenzelm@27008
   838
-------------------------------
wenzelm@25464
   839
wenzelm@25522
   840
*** General ***
wenzelm@25522
   841
wenzelm@27061
   842
* The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
wenzelm@27061
   843
and updated, with formally checked references as hyperlinks.
wenzelm@27061
   844
wenzelm@25994
   845
* Theory loader: use_thy (and similar operations) no longer set the
wenzelm@25994
   846
implicit ML context, which was occasionally hard to predict and in
wenzelm@25994
   847
conflict with concurrency.  INCOMPATIBILITY, use ML within Isar which
wenzelm@25994
   848
provides a proper context already.
wenzelm@25994
   849
wenzelm@26323
   850
* Theory loader: old-style ML proof scripts being *attached* to a thy
wenzelm@26323
   851
file are no longer supported.  INCOMPATIBILITY, regular 'uses' and
wenzelm@26323
   852
'use' within a theory file will do the job.
wenzelm@26323
   853
wenzelm@26650
   854
* Name space merge now observes canonical order, i.e. the second space
wenzelm@26650
   855
is inserted into the first one, while existing entries in the first
wenzelm@26659
   856
space take precedence.  INCOMPATIBILITY in rare situations, may try to
wenzelm@26650
   857
swap theory imports.
wenzelm@26650
   858
wenzelm@27067
   859
* Syntax: symbol \<chi> is now considered a letter.  Potential
wenzelm@27067
   860
INCOMPATIBILITY in identifier syntax etc.
wenzelm@27067
   861
wenzelm@27067
   862
* Outer syntax: string tokens no longer admit escaped white space,
wenzelm@27067
   863
which was an accidental (undocumented) feature.  INCOMPATIBILITY, use
wenzelm@27067
   864
white space without escapes.
wenzelm@27067
   865
wenzelm@27067
   866
* Outer syntax: string tokens may contain arbitrary character codes
wenzelm@27067
   867
specified via 3 decimal digits (as in SML).  E.g. "foo\095bar" for
wenzelm@27067
   868
"foo_bar".
wenzelm@27067
   869
wenzelm@25522
   870
haftmann@25502
   871
*** Pure ***
haftmann@25502
   872
wenzelm@26718
   873
* Context-dependent token translations.  Default setup reverts locally
wenzelm@26718
   874
fixed variables, and adds hilite markup for undeclared frees.
wenzelm@26718
   875
berghofe@26681
   876
* Unused theorems can be found using the new command 'unused_thms'.
berghofe@26681
   877
There are three ways of invoking it:
berghofe@26681
   878
berghofe@26681
   879
(1) unused_thms
berghofe@26681
   880
     Only finds unused theorems in the current theory.
berghofe@26681
   881
berghofe@26681
   882
(2) unused_thms thy_1 ... thy_n -
berghofe@26681
   883
     Finds unused theorems in the current theory and all of its ancestors,
berghofe@26681
   884
     excluding the theories thy_1 ... thy_n and all of their ancestors.
berghofe@26681
   885
berghofe@26681
   886
(3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
berghofe@26681
   887
     Finds unused theorems in the theories thy'_1 ... thy'_m and all of
berghofe@26681
   888
     their ancestors, excluding the theories thy_1 ... thy_n and all of
berghofe@26681
   889
     their ancestors.
berghofe@26681
   890
wenzelm@26718
   891
In order to increase the readability of the list produced by
wenzelm@26718
   892
unused_thms, theorems that have been created by a particular instance
wenzelm@26874
   893
of a theory command such as 'inductive' or 'function' are considered
wenzelm@26874
   894
to belong to the same "group", meaning that if at least one theorem in
wenzelm@26718
   895
this group is used, the other theorems in the same group are no longer
wenzelm@26718
   896
reported as unused.  Moreover, if all theorems in the group are
wenzelm@26718
   897
unused, only one theorem in the group is displayed.
wenzelm@26718
   898
wenzelm@26718
   899
Note that proof objects have to be switched on in order for
wenzelm@26718
   900
unused_thms to work properly (i.e. !proofs must be >= 1, which is
wenzelm@26874
   901
usually the case when using Proof General with the default settings).
berghofe@26681
   902
wenzelm@26650
   903
* Authentic naming of facts disallows ad-hoc overwriting of previous
wenzelm@26650
   904
theorems within the same name space.  INCOMPATIBILITY, need to remove
wenzelm@26650
   905
duplicate fact bindings, or even accidental fact duplications.  Note
wenzelm@26650
   906
that tools may maintain dynamically scoped facts systematically, using
wenzelm@26650
   907
PureThy.add_thms_dynamic.
wenzelm@26650
   908
wenzelm@26660
   909
* Command 'hide' now allows to hide from "fact" name space as well.
wenzelm@26660
   910
wenzelm@26496
   911
* Eliminated destructive theorem database, simpset, claset, and
wenzelm@26496
   912
clasimpset.  Potential INCOMPATIBILITY, really need to observe linear
wenzelm@26496
   913
update of theories within ML code.
wenzelm@26479
   914
wenzelm@26955
   915
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm@26955
   916
INCOMPATIBILITY, object-logics depending on former Pure require
wenzelm@26955
   917
additional setup PureThy.old_appl_syntax_setup; object-logics
wenzelm@26955
   918
depending on former CPure need to refer to Pure.
wenzelm@26650
   919
wenzelm@26495
   920
* Commands 'use' and 'ML' are now purely functional, operating on
wenzelm@26479
   921
theory/local_theory.  Removed former 'ML_setup' (on theory), use 'ML'
wenzelm@26479
   922
instead.  Added 'ML_val' as mere diagnostic replacement for 'ML'.
wenzelm@26479
   923
INCOMPATIBILITY.
wenzelm@26479
   924
wenzelm@26874
   925
* Command 'setup': discontinued implicit version with ML reference.
wenzelm@26434
   926
wenzelm@25970
   927
* Instantiation target allows for simultaneous specification of class
wenzelm@25970
   928
instance operations together with an instantiation proof.
wenzelm@25970
   929
Type-checking phase allows to refer to class operations uniformly.
wenzelm@27067
   930
See src/HOL/Complex/Complex.thy for an Isar example and
wenzelm@27067
   931
src/HOL/Library/Eval.thy for an ML example.
haftmann@25502
   932
wenzelm@26201
   933
* Indexing of literal facts: be more serious about including only
wenzelm@26201
   934
facts from the visible specification/proof context, but not the
wenzelm@26201
   935
background context (locale etc.).  Affects `prop` notation and method
wenzelm@26201
   936
"fact".  INCOMPATIBILITY: need to name facts explicitly in rare
wenzelm@26201
   937
situations.
wenzelm@26201
   938
wenzelm@26925
   939
* Method "cases", "induct", "coinduct": removed obsolete/undocumented
wenzelm@26925
   940
"(open)" option, which used to expose internal bound variables to the
wenzelm@26925
   941
proof text.
wenzelm@26925
   942
wenzelm@26925
   943
* Isar statements: removed obsolete case "rule_context".
wenzelm@26925
   944
INCOMPATIBILITY, better use explicit fixes/assumes.
wenzelm@26925
   945
wenzelm@26874
   946
* Locale proofs: default proof step now includes 'unfold_locales';
wenzelm@26874
   947
hence 'proof' without argument may be used to unfold locale
wenzelm@26874
   948
predicates.
ballarin@26765
   949
ballarin@26765
   950
haftmann@26762
   951
*** Document preparation ***
haftmann@26762
   952
wenzelm@26914
   953
* Simplified pdfsetup.sty: color/hyperref is used unconditionally for
wenzelm@26914
   954
both pdf and dvi (hyperlinks usually work in xdvi as well); removed
wenzelm@26914
   955
obsolete thumbpdf setup (contemporary PDF viewers do this on the
wenzelm@26914
   956
spot); renamed link color from "darkblue" to "linkcolor" (default
wenzelm@26920
   957
value unchanged, can be redefined via \definecolor); no longer sets
wenzelm@26920
   958
"a4paper" option (unnecessary or even intrusive).
wenzelm@26914
   959
wenzelm@27008
   960
* Antiquotation @{lemma A method} proves proposition A by the given
wenzelm@27008
   961
method (either a method name or a method name plus (optional) method
wenzelm@27008
   962
arguments in parentheses) and prints A just like @{prop A}.
haftmann@26762
   963
haftmann@26762
   964
wenzelm@25464
   965
*** HOL ***
wenzelm@25464
   966
wenzelm@27067
   967
* New primrec package.  Specification syntax conforms in style to
wenzelm@27067
   968
definition/function/....  No separate induction rule is provided.  The
wenzelm@27067
   969
"primrec" command distinguishes old-style and new-style specifications
wenzelm@27067
   970
by syntax.  The former primrec package is now named OldPrimrecPackage.
wenzelm@27067
   971
When adjusting theories, beware: constants stemming from new-style
wenzelm@27067
   972
primrec specifications have authentic syntax.
wenzelm@27067
   973
wenzelm@27067
   974
* Metis prover is now an order of magnitude faster, and also works
wenzelm@27067
   975
with multithreading.
wenzelm@27067
   976
wenzelm@27067
   977
* Metis: the maximum number of clauses that can be produced from a
wenzelm@27067
   978
theorem is now given by the attribute max_clauses.  Theorems that
wenzelm@27067
   979
exceed this number are ignored, with a warning printed.
wenzelm@27067
   980
wenzelm@27067
   981
* Sledgehammer no longer produces structured proofs by default. To
wenzelm@27067
   982
enable, declare [[sledgehammer_full = true]].  Attributes
wenzelm@27067
   983
reconstruction_modulus, reconstruction_sorts renamed
wenzelm@27067
   984
sledgehammer_modulus, sledgehammer_sorts.  INCOMPATIBILITY.
wenzelm@27067
   985
haftmann@27104
   986
* Method "induct_scheme" derives user-specified induction rules
wenzelm@27067
   987
from well-founded induction and completeness of patterns. This factors
wenzelm@27067
   988
out some operations that are done internally by the function package
wenzelm@27067
   989
and makes them available separately.  See
wenzelm@27067
   990
src/HOL/ex/Induction_Scheme.thy for examples.
wenzelm@27067
   991
wenzelm@27067
   992
* More flexible generation of measure functions for termination
wenzelm@27067
   993
proofs: Measure functions can be declared by proving a rule of the
wenzelm@27067
   994
form "is_measure f" and giving it the [measure_function] attribute.
wenzelm@27067
   995
The "is_measure" predicate is logically meaningless (always true), and
wenzelm@27067
   996
just guides the heuristic.  To find suitable measure functions, the
wenzelm@27067
   997
termination prover sets up the goal "is_measure ?f" of the appropriate
wenzelm@27067
   998
type and generates all solutions by prolog-style backwards proof using
wenzelm@27067
   999
the declared rules.
wenzelm@27067
  1000
wenzelm@27067
  1001
This setup also deals with rules like 
wenzelm@27067
  1002
wenzelm@27067
  1003
  "is_measure f ==> is_measure (list_size f)"
wenzelm@27067
  1004
wenzelm@27067
  1005
which accommodates nested datatypes that recurse through lists.
wenzelm@27067
  1006
Similar rules are predeclared for products and option types.
wenzelm@27067
  1007
berghofe@26964
  1008
* Turned the type of sets "'a set" into an abbreviation for "'a => bool"
berghofe@26964
  1009
berghofe@26964
  1010
  INCOMPATIBILITIES:
berghofe@26964
  1011
wenzelm@27008
  1012
  - Definitions of overloaded constants on sets have to be replaced by
wenzelm@27008
  1013
    definitions on => and bool.
berghofe@26964
  1014
berghofe@26964
  1015
  - Some definitions of overloaded operators on sets can now be proved
wenzelm@27008
  1016
    using the definitions of the operators on => and bool.  Therefore,
wenzelm@27008
  1017
    the following theorems have been renamed:
berghofe@26964
  1018
berghofe@26964
  1019
      subset_def   -> subset_eq
berghofe@26964
  1020
      psubset_def  -> psubset_eq
berghofe@26964
  1021
      set_diff_def -> set_diff_eq
berghofe@26964
  1022
      Compl_def    -> Compl_eq
berghofe@26964
  1023
      Sup_set_def  -> Sup_set_eq
berghofe@26964
  1024
      Inf_set_def  -> Inf_set_eq
berghofe@26964
  1025
      sup_set_def  -> sup_set_eq
berghofe@26964
  1026
      inf_set_def  -> inf_set_eq
berghofe@26964
  1027
berghofe@26964
  1028
  - Due to the incompleteness of the HO unification algorithm, some
berghofe@26964
  1029
    rules such as subst may require manual instantiation, if some of
berghofe@26964
  1030
    the unknowns in the rule is a set.
berghofe@26964
  1031
berghofe@26964
  1032
  - Higher order unification and forward proofs:
berghofe@26964
  1033
    The proof pattern
berghofe@26964
  1034
berghofe@26964
  1035
      have "P (S::'a set)" <...>
berghofe@26964
  1036
      then have "EX S. P S" ..
berghofe@26964
  1037
wenzelm@27008
  1038
    no longer works (due to the incompleteness of the HO unification
wenzelm@27008
  1039
    algorithm) and must be replaced by the pattern
berghofe@26964
  1040
berghofe@26964
  1041
      have "EX S. P S"
berghofe@26964
  1042
      proof
berghofe@26964
  1043
        show "P S" <...>
berghofe@26964
  1044
      qed
berghofe@26964
  1045
berghofe@26964
  1046
  - Calculational reasoning with subst (or similar rules):
berghofe@26964
  1047
    The proof pattern
berghofe@26964
  1048
berghofe@26964
  1049
      have "P (S::'a set)" <...>
berghofe@26964
  1050
      also have "S = T" <...>
berghofe@26964
  1051
      finally have "P T" .
berghofe@26964
  1052
wenzelm@27008
  1053
    no longer works (for similar reasons as the previous example) and
wenzelm@27008
  1054
    must be replaced by something like
berghofe@26964
  1055
berghofe@26964
  1056
      have "P (S::'a set)" <...>
berghofe@26964
  1057
      moreover have "S = T" <...>
berghofe@26964
  1058
      ultimately have "P T" by simp
berghofe@26964
  1059
berghofe@26964
  1060
  - Tactics or packages written in ML code:
berghofe@26964
  1061
    Code performing pattern matching on types via
berghofe@26964
  1062
berghofe@26964
  1063
      Type ("set", [T]) => ...
berghofe@26964
  1064
wenzelm@27008
  1065
    must be rewritten. Moreover, functions like strip_type or
wenzelm@27008
  1066
    binder_types no longer return the right value when applied to a
wenzelm@27008
  1067
    type of the form
berghofe@26964
  1068
berghofe@26964
  1069
      T1 => ... => Tn => U => bool
berghofe@26964
  1070
berghofe@26964
  1071
    rather than
berghofe@26964
  1072
berghofe@26964
  1073
      T1 => ... => Tn => U set
berghofe@26964
  1074
wenzelm@26874
  1075
* Merged theories Wellfounded_Recursion, Accessible_Part and
wenzelm@27067
  1076
Wellfounded_Relations to theory Wellfounded.
krauss@26748
  1077
haftmann@26513
  1078
* Explicit class "eq" for executable equality.  INCOMPATIBILITY.
haftmann@26513
  1079
wenzelm@26874
  1080
* Class finite no longer treats UNIV as class parameter.  Use class
wenzelm@26874
  1081
enum from theory Library/Enum instead to achieve a similar effect.
haftmann@26445
  1082
INCOMPATIBILITY.
haftmann@26445
  1083
wenzelm@26874
  1084
* Theory List: rule list_induct2 now has explicitly named cases "Nil"
wenzelm@26874
  1085
and "Cons".  INCOMPATIBILITY.
wenzelm@26874
  1086
wenzelm@26422
  1087
* HOL (and FOL): renamed variables in rules imp_elim and swap.
wenzelm@26422
  1088
Potential INCOMPATIBILITY.
wenzelm@26422
  1089
wenzelm@26874
  1090
* Theory Product_Type: duplicated lemmas split_Pair_apply and
wenzelm@26874
  1091
injective_fst_snd removed, use split_eta and prod_eqI instead.
wenzelm@26874
  1092
Renamed upd_fst to apfst and upd_snd to apsnd.  INCOMPATIBILITY.
haftmann@26355
  1093
wenzelm@26335
  1094
* Theory Nat: removed redundant lemmas that merely duplicate lemmas of
wenzelm@26335
  1095
the same name in theory Orderings:
wenzelm@26335
  1096
wenzelm@26335
  1097
  less_trans
wenzelm@26335
  1098
  less_linear
wenzelm@26335
  1099
  le_imp_less_or_eq
wenzelm@26335
  1100
  le_less_trans
wenzelm@26335
  1101
  less_le_trans
wenzelm@26335
  1102
  less_not_sym
wenzelm@26335
  1103
  less_asym
wenzelm@26335
  1104
wenzelm@26335
  1105
Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
wenzelm@26335
  1106
less_irrefl_nat.  Potential INCOMPATIBILITY due to more general types
wenzelm@26335
  1107
and different variable names.
wenzelm@26315
  1108
haftmann@26231
  1109
* Library/Option_ord.thy: Canonical order on option type.
haftmann@26231
  1110
wenzelm@27008
  1111
* Library/RBT.thy: Red-black trees, an efficient implementation of
wenzelm@27008
  1112
finite maps.
krauss@26197
  1113
haftmann@26231
  1114
* Library/Countable.thy: Type class for countable types.
haftmann@26231
  1115
wenzelm@26180
  1116
* Theory Int: The representation of numerals has changed.  The infix
wenzelm@26180
  1117
operator BIT and the bit datatype with constructors B0 and B1 have
wenzelm@26180
  1118
disappeared.  INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
wenzelm@26180
  1119
place of "x BIT bit.B0" and "y BIT bit.B1", respectively.  Theorems
wenzelm@26180
  1120
involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
wenzelm@26180
  1121
accordingly.
wenzelm@26180
  1122
wenzelm@26180
  1123
* Theory Nat: definition of <= and < on natural numbers no longer
wenzelm@26180
  1124
depend on well-founded relations.  INCOMPATIBILITY.  Definitions
wenzelm@26180
  1125
le_def and less_def have disappeared.  Consider lemmas not_less
wenzelm@26180
  1126
[symmetric, where ?'a = nat] and less_eq [symmetric] instead.
wenzelm@26180
  1127
wenzelm@26180
  1128
* Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
wenzelm@26180
  1129
(whose purpose mainly is for various fold_set functionals) have been
wenzelm@26874
  1130
abandoned in favor of the existing algebraic classes
wenzelm@26180
  1131
ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
wenzelm@26180
  1132
lower_semilattice (resp. upper_semilattice) and linorder.
haftmann@26139
  1133
INCOMPATIBILITY.
haftmann@26041
  1134
wenzelm@26180
  1135
* Theory Transitive_Closure: induct and cases rules now declare proper
wenzelm@26180
  1136
case_names ("base" and "step").  INCOMPATIBILITY.
wenzelm@26180
  1137
wenzelm@26180
  1138
* Theorem Inductive.lfp_ordinal_induct generalized to complete
wenzelm@26180
  1139
lattices.  The form set-specific version is available as
wenzelm@26180
  1140
Inductive.lfp_ordinal_induct_set.
haftmann@26013
  1141
wenzelm@26874
  1142
* Renamed theorems "power.simps" to "power_int.simps".
wenzelm@27067
  1143
INCOMPATIBILITY.
haftmann@25961
  1144
wenzelm@26180
  1145
* Class semiring_div provides basic abstract properties of semirings
haftmann@25942
  1146
with division and modulo operations.  Subsumes former class dvd_mod.
haftmann@25942
  1147
wenzelm@26180
  1148
* Merged theories IntDef, Numeral and IntArith into unified theory
wenzelm@26180
  1149
Int.  INCOMPATIBILITY.
wenzelm@26180
  1150
wenzelm@26180
  1151
* Theory Library/Code_Index: type "index" now represents natural
wenzelm@26180
  1152
numbers rather than integers.  INCOMPATIBILITY.
wenzelm@26180
  1153
wenzelm@26180
  1154
* New class "uminus" with operation "uminus" (split of from class
wenzelm@26180
  1155
"minus" which now only has operation "minus", binary).
haftmann@25919
  1156
INCOMPATIBILITY.
haftmann@25919
  1157
wenzelm@25522
  1158
* Constants "card", "internal_split", "option_map" now with authentic
haftmann@25919
  1159
syntax.  INCOMPATIBILITY.
wenzelm@25522
  1160
wenzelm@25522
  1161
* Definitions subset_def, psubset_def, set_diff_def, Compl_def,
wenzelm@25522
  1162
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
wenzelm@25522
  1163
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
wenzelm@25522
  1164
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
wenzelm@25522
  1165
Sup_set_def, le_def, less_def, option_map_def now with object
haftmann@25919
  1166
equality.  INCOMPATIBILITY.
wenzelm@25464
  1167
schirmer@25705
  1168
* Records. Removed K_record, and replaced it by pure lambda term
wenzelm@25726
  1169
%x. c. The simplifier setup is now more robust against eta expansion.
schirmer@25705
  1170
INCOMPATIBILITY: in cases explicitly referring to K_record.
wenzelm@25464
  1171
wenzelm@27067
  1172
* Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
wenzelm@27067
  1173
wenzelm@27067
  1174
* Library/ListVector: new theory of arithmetic vector operations.
wenzelm@27067
  1175
wenzelm@27067
  1176
* Library/Order_Relation: new theory of various orderings as sets of
wenzelm@27067
  1177
pairs.  Defines preorders, partial orders, linear orders and
wenzelm@27067
  1178
well-orders on sets and on types.
krauss@26877
  1179
wenzelm@25726
  1180
krauss@26197
  1181
*** ZF ***
krauss@26197
  1182
wenzelm@26874
  1183
* Renamed some theories to allow to loading both ZF and HOL in the
wenzelm@26874
  1184
same session:
wenzelm@26874
  1185
wenzelm@26874
  1186
  Datatype  -> Datatype_ZF
wenzelm@26874
  1187
  Inductive -> Inductive_ZF
wenzelm@26874
  1188
  Int       -> Int_ZF
wenzelm@26874
  1189
  IntDiv    -> IntDiv_ZF
wenzelm@26874
  1190
  Nat       -> Nat_ZF
wenzelm@26874
  1191
  List      -> List_ZF
wenzelm@26874
  1192
  Main      -> Main_ZF
wenzelm@26874
  1193
wenzelm@26874
  1194
INCOMPATIBILITY: ZF theories that import individual theories below
wenzelm@26874
  1195
Main might need to be adapted.  Regular theory Main is still
wenzelm@26874
  1196
available, as trivial extension of Main_ZF.
krauss@26197
  1197
krauss@26197
  1198
wenzelm@25737
  1199
*** ML ***
wenzelm@25737
  1200
wenzelm@27067
  1201
* ML within Isar: antiquotation @{const name} or @{const
wenzelm@27067
  1202
name(typargs)} produces statically-checked Const term.
wenzelm@27067
  1203
wenzelm@26401
  1204
* Functor NamedThmsFun: data is available to the user as dynamic fact
wenzelm@26724
  1205
(of the same name).  Removed obsolete print command.
wenzelm@26401
  1206
wenzelm@27067
  1207
* Removed obsolete "use_legacy_bindings" function.
wenzelm@26188
  1208
wenzelm@25737
  1209
* The ``print mode'' is now a thread-local value derived from a global
wenzelm@25737
  1210
template (the former print_mode reference), thus access becomes
wenzelm@25737
  1211
non-critical.  The global print_mode reference is for session
wenzelm@25737
  1212
management only; user-code should use print_mode_value,
wenzelm@25737
  1213
print_mode_active, PrintMode.setmp etc.  INCOMPATIBILITY.
wenzelm@25737
  1214
wenzelm@26874
  1215
* Functions system/system_out provide a robust way to invoke external
wenzelm@29161
  1216
shell commands, with propagation of interrupts (requires Poly/ML
wenzelm@29161
  1217
5.2.1).  Do not use OS.Process.system etc. from the basis library!
wenzelm@26222
  1218
wenzelm@25737
  1219
wenzelm@25626
  1220
*** System ***
wenzelm@25626
  1221
wenzelm@25971
  1222
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
wenzelm@25971
  1223
in accordance with Proof General 3.7, which prefers GNU emacs.
wenzelm@25970
  1224
wenzelm@25626
  1225
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm@25626
  1226
optional line editor may be specified via ISABELLE_LINE_EDITOR
wenzelm@25626
  1227
setting, the default settings attempt to locate "ledit" and "rlwrap".
wenzelm@25626
  1228
wenzelm@25651
  1229
* isatool browser now works with Cygwin as well, using general
wenzelm@25651
  1230
"javapath" function defined in Isabelle process environment.
wenzelm@25651
  1231
wenzelm@27067
  1232
* YXML notation provides a simple and efficient alternative to
wenzelm@27067
  1233
standard XML transfer syntax.  See src/Pure/General/yxml.ML and
wenzelm@27067
  1234
isatool yxml as described in the Isabelle system manual.
wenzelm@25651
  1235
wenzelm@25652
  1236
* JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
wenzelm@25651
  1237
provides general wrapper for managing an Isabelle process in a robust
wenzelm@25651
  1238
fashion, with ``cooked'' output from stdin/stderr.
wenzelm@25651
  1239
wenzelm@25855
  1240
* Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
wenzelm@25855
  1241
based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
wenzelm@25855
  1242
wenzelm@27067
  1243
* Removed obsolete THIS_IS_ISABELLE_BUILD feature.  NB: the documented
wenzelm@27067
  1244
way of changing the user's settings is via
wenzelm@27067
  1245
ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
wenzelm@27067
  1246
script.
wenzelm@27067
  1247
wenzelm@27067
  1248
* Multithreading.max_threads := 0 refers to the number of actual CPU
wenzelm@27067
  1249
cores of the underlying machine, which is a good starting point for
wenzelm@27067
  1250
optimal performance tuning.  The corresponding usedir option -M allows
wenzelm@27067
  1251
"max" as an alias for "0".  WARNING: does not work on certain versions
wenzelm@27067
  1252
of Mac OS (with Poly/ML 5.1).
wenzelm@27067
  1253
wenzelm@27067
  1254
* isabelle-process: non-ML sessions are run with "nice", to reduce the
wenzelm@27067
  1255
adverse effect of Isabelle flooding interactive front-ends (notably
wenzelm@27067
  1256
ProofGeneral / XEmacs).
wenzelm@27067
  1257
wenzelm@25626
  1258
wenzelm@25464
  1259
wenzelm@25429
  1260
New in Isabelle2007 (November 2007)
wenzelm@25429
  1261
-----------------------------------
wenzelm@17754
  1262
wenzelm@17754
  1263
*** General ***
wenzelm@17754
  1264
wenzelm@22826
  1265
* More uniform information about legacy features, notably a
wenzelm@22826
  1266
warning/error of "Legacy feature: ...", depending on the state of the
wenzelm@23367
  1267
tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
wenzelm@23367
  1268
legacy features will disappear eventually.
wenzelm@22826
  1269
wenzelm@17918
  1270
* Theory syntax: the header format ``theory A = B + C:'' has been
wenzelm@17918
  1271
discontinued in favour of ``theory A imports B C begin''.  Use isatool
wenzelm@17918
  1272
fixheaders to convert existing theory files.  INCOMPATIBILITY.
wenzelm@17918
  1273
wenzelm@17918
  1274
* Theory syntax: the old non-Isar theory file format has been
wenzelm@17918
  1275
discontinued altogether.  Note that ML proof scripts may still be used
wenzelm@17918
  1276
with Isar theories; migration is usually quite simple with the ML
wenzelm@17918
  1277
function use_legacy_bindings.  INCOMPATIBILITY.
wenzelm@17918
  1278
wenzelm@22871
  1279
* Theory syntax: some popular names (e.g. 'class', 'declaration',
wenzelm@22871
  1280
'fun', 'help', 'if') are now keywords.  INCOMPATIBILITY, use double
wenzelm@22871
  1281
quotes.
wenzelm@19814
  1282
wenzelm@23888
  1283
* Theory loader: be more serious about observing the static theory
wenzelm@23888
  1284
header specifications (including optional directories), but not the
wenzelm@24172
  1285
accidental file locations of previously successful loads.  The strict
wenzelm@24172
  1286
update policy of former update_thy is now already performed by
wenzelm@24172
  1287
use_thy, so the former has been removed; use_thys updates several
wenzelm@24172
  1288
theories simultaneously, just as 'imports' within a theory header
wenzelm@24172
  1289
specification, but without merging the results.  Potential
wenzelm@24172
  1290
INCOMPATIBILITY: may need to refine theory headers and commands
wenzelm@24172
  1291
ROOT.ML which depend on load order.
wenzelm@23888
  1292
wenzelm@23888
  1293
* Theory loader: optional support for content-based file
wenzelm@23888
  1294
identification, instead of the traditional scheme of full physical
wenzelm@23889
  1295
path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
wenzelm@23888
  1296
(cf. the system manual).  The new scheme allows to work with
wenzelm@23888
  1297
non-finished theories in persistent session images, such that source
wenzelm@23888
  1298
files may be moved later on without requiring reloads.
wenzelm@23888
  1299
wenzelm@24187
  1300
* Theory loader: old-style ML proof scripts being *attached* to a thy
wenzelm@24187
  1301
file (with the same base name as the theory) are considered a legacy
wenzelm@24800
  1302
feature, which will disappear eventually. Even now, the theory loader
wenzelm@24800
  1303
no longer maintains dependencies on such files.
wenzelm@24800
  1304
wenzelm@24800
  1305
* Syntax: the scope for resolving ambiguities via type-inference is
wenzelm@24800
  1306
now limited to individual terms, instead of whole simultaneous
wenzelm@24234
  1307
specifications as before. This greatly reduces the complexity of the
wenzelm@24234
  1308
syntax module and improves flexibility by separating parsing and
wenzelm@24234
  1309
type-checking. INCOMPATIBILITY: additional type-constraints (explicit
wenzelm@24234
  1310
'fixes' etc.) are required in rare situations.
wenzelm@24234
  1311
wenzelm@25034
  1312
* Syntax: constants introduced by new-style packages ('definition',
wenzelm@25034
  1313
'abbreviation' etc.) are passed through the syntax module in
wenzelm@25034
  1314
``authentic mode''. This means that associated mixfix annotations
wenzelm@25034
  1315
really stick to such constants, independently of potential name space
wenzelm@25034
  1316
ambiguities introduced later on. INCOMPATIBILITY: constants in parse
wenzelm@25034
  1317
trees are represented slightly differently, may need to adapt syntax
wenzelm@25034
  1318
translations accordingly. Use CONST marker in 'translations' and
wenzelm@25034
  1319
@{const_syntax} antiquotation in 'parse_translation' etc.
wenzelm@25034
  1320
wenzelm@17981
  1321
* Legacy goal package: reduced interface to the bare minimum required
wenzelm@17981
  1322
to keep existing proof scripts running.  Most other user-level
wenzelm@17981
  1323
functions are now part of the OldGoals structure, which is *not* open
wenzelm@17981
  1324
by default (consider isatool expandshort before open OldGoals).
wenzelm@17981
  1325
Removed top_sg, prin, printyp, pprint_term/typ altogether, because
wenzelm@17981
  1326
these tend to cause confusion about the actual goal (!) context being
wenzelm@17981
  1327
used here, which is not necessarily the same as the_context().
wenzelm@17918
  1328
wenzelm@23379
  1329
* Command 'find_theorems': supports "*" wild-card in "name:"
wenzelm@23379
  1330
criterion; "with_dups" option.  Certain ProofGeneral versions might
wenzelm@23379
  1331
support a specific search form (see ProofGeneral/CHANGES).
webertj@22965
  1332
wenzelm@20370
  1333
* The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
wenzelm@20370
  1334
by default, which means that "prems" (and also "fixed variables") are
wenzelm@20370
  1335
suppressed from proof state output.  Note that the ProofGeneral
wenzelm@20370
  1336
settings mechanism allows to change and save options persistently, but
wenzelm@20370
  1337
older versions of Isabelle will fail to start up if a negative prems
wenzelm@20370
  1338
limit is imposed.
wenzelm@20370
  1339
wenzelm@21308
  1340
* Local theory targets may be specified by non-nested blocks of
wenzelm@21308
  1341
``context/locale/class ... begin'' followed by ``end''.  The body may
wenzelm@21308
  1342
contain definitions, theorems etc., including any derived mechanism
wenzelm@21308
  1343
that has been implemented on top of these primitives.  This concept
wenzelm@21308
  1344
generalizes the existing ``theorem (in ...)'' towards more versatility
wenzelm@21308
  1345
and scalability.
wenzelm@21308
  1346
wenzelm@21960
  1347
* Proof General interface: proper undo of final 'end' command;
wenzelm@21960
  1348
discontinued Isabelle/classic mode (ML proof scripts).
wenzelm@21960
  1349
wenzelm@17754
  1350
wenzelm@17865
  1351
*** Document preparation ***
wenzelm@17865
  1352
wenzelm@21717
  1353
* Added antiquotation @{theory name} which prints the given name,
wenzelm@21717
  1354
after checking that it refers to a valid ancestor theory in the
wenzelm@21717
  1355
current context.
haftmann@21339
  1356
wenzelm@17869
  1357
* Added antiquotations @{ML_type text} and @{ML_struct text} which
wenzelm@17869
  1358
check the given source text as ML type/structure, printing verbatim.
wenzelm@17865
  1359
wenzelm@21717
  1360
* Added antiquotation @{abbrev "c args"} which prints the abbreviation
wenzelm@21717
  1361
"c args == rhs" given in the current context.  (Any number of
wenzelm@21735
  1362
arguments may be given on the LHS.)
wenzelm@21717
  1363
wenzelm@21717
  1364
wenzelm@17779
  1365
*** Pure ***
wenzelm@17779
  1366
wenzelm@24800
  1367
* The 'class' package offers a combination of axclass and locale to
wenzelm@25129
  1368
achieve Haskell-like type classes in Isabelle.  Definitions and
wenzelm@25129
  1369
theorems within a class context produce both relative results (with
wenzelm@25129
  1370
implicit parameters according to the locale context), and polymorphic
wenzelm@25129
  1371
constants with qualified polymorphism (according to the class
wenzelm@25129
  1372
context).  Within the body context of a 'class' target, a separate
wenzelm@25129
  1373
syntax layer ("user space type system") takes care of converting
wenzelm@25129
  1374
between global polymorphic consts and internal locale representation.
wenzelm@25177
  1375
See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
haftmann@25184
  1376
"isatool doc classes" provides a tutorial.
wenzelm@20807
  1377
haftmann@25199
  1378
* Generic code generator framework allows to generate executable
wenzelm@24800
  1379
code for ML and Haskell (including Isabelle classes).  A short usage
wenzelm@24800
  1380
sketch:
haftmann@20188
  1381
haftmann@20188
  1382
    internal compilation:
haftmann@25199
  1383
        export_code <list of constants (term syntax)> in SML
haftmann@20453
  1384
    writing SML code to a file:
haftmann@25199
  1385
        export_code <list of constants (term syntax)> in SML <filename>
haftmann@22735
  1386
    writing OCaml code to a file:
haftmann@25199
  1387
        export_code <list of constants (term syntax)> in OCaml <filename>
haftmann@20188
  1388
    writing Haskell code to a bunch of files:
haftmann@25199
  1389
        export_code <list of constants (term syntax)> in Haskell <filename>
haftmann@25199
  1390
haftmann@25199
  1391
    evaluating closed propositions to True/False using code generation:
haftmann@25184
  1392
        method ``eval''
haftmann@25184
  1393
haftmann@25184
  1394
Reasonable default setup of framework in HOL.
haftmann@20453
  1395
haftmann@20453
  1396
Theorem attributs for selecting and transforming function equations theorems:
haftmann@20453
  1397
haftmann@22845
  1398
    [code fun]:        select a theorem as function equation for a specific constant
haftmann@22845
  1399
    [code fun del]:    deselect a theorem as function equation for a specific constant
haftmann@22845
  1400
    [code inline]:     select an equation theorem for unfolding (inlining) in place
haftmann@22845
  1401
    [code inline del]: deselect an equation theorem for unfolding (inlining) in place
haftmann@20453
  1402
haftmann@22735
  1403
User-defined serializations (target in {SML, OCaml, Haskell}):
haftmann@20453
  1404
haftmann@20453
  1405
    code_const <and-list of constants (term syntax)>
haftmann@20453
  1406
      {(target) <and-list of const target syntax>}+
haftmann@20453
  1407
haftmann@20453
  1408
    code_type <and-list of type constructors>
haftmann@20453
  1409
      {(target) <and-list of type target syntax>}+
haftmann@20453
  1410
haftmann@20453
  1411
    code_instance <and-list of instances>
haftmann@20453
  1412
      {(target)}+
haftmann@20453
  1413
        where instance ::= <type constructor> :: <class>
haftmann@20453
  1414
haftmann@20453
  1415
    code_class <and_list of classes>
haftmann@20453
  1416
      {(target) <and-list of class target syntax>}+
haftmann@20453
  1417
        where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
haftmann@20453
  1418
haftmann@25199
  1419
code_instance and code_class only are effective to target Haskell.
haftmann@22735
  1420
wenzelm@25177
  1421
For example usage see src/HOL/ex/Codegenerator.thy and
wenzelm@25177
  1422
src/HOL/ex/Codegenerator_Pretty.thy.  A separate tutorial on code
wenzelm@24800
  1423
generation from Isabelle/HOL theories is available via "isatool doc
wenzelm@24800
  1424
codegen".
haftmann@20188
  1425
wenzelm@25129
  1426
* Code generator: consts in 'consts_code' Isar commands are now
wenzelm@25129
  1427
referred to by usual term syntax (including optional type
wenzelm@25129
  1428
annotations).
wenzelm@25129
  1429
wenzelm@19254
  1430
* Command 'no_translations' removes translation rules from theory
wenzelm@19254
  1431
syntax.
wenzelm@19254
  1432
wenzelm@19625
  1433
* Overloaded definitions are now actually checked for acyclic
wenzelm@19714
  1434
dependencies.  The overloading scheme is slightly more general than
wenzelm@19714
  1435
that of Haskell98, although Isabelle does not demand an exact
wenzelm@19714
  1436
correspondence to type class and instance declarations.
wenzelm@19714
  1437
INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
wenzelm@19714
  1438
exotic versions of overloading -- at the discretion of the user!
wenzelm@19711
  1439
wenzelm@19711
  1440
Polymorphic constants are represented via type arguments, i.e. the
wenzelm@19711
  1441
instantiation that matches an instance against the most general
wenzelm@19711
  1442
declaration given in the signature.  For example, with the declaration
wenzelm@19711
  1443
c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
wenzelm@19711
  1444
as c(nat).  Overloading is essentially simultaneous structural
wenzelm@19711
  1445
recursion over such type arguments.  Incomplete specification patterns
wenzelm@19714
  1446
impose global constraints on all occurrences, e.g. c('a * 'a) on the
wenzelm@19715
  1447
LHS means that more general c('a * 'b) will be disallowed on any RHS.
wenzelm@19714
  1448
Command 'print_theory' outputs the normalized system of recursive
wenzelm@19714
  1449
equations, see section "definitions".
wenzelm@19625
  1450
wenzelm@24086
  1451
* Configuration options are maintained within the theory or proof
wenzelm@24086
  1452
context (with name and type bool/int/string), providing a very simple
wenzelm@24086
  1453
interface to a poor-man's version of general context data.  Tools may
wenzelm@24110
  1454
declare options in ML (e.g. using Attrib.config_int) and then refer to
wenzelm@24110
  1455
these values using Config.get etc.  Users may change options via an
wenzelm@24110
  1456
associated attribute of the same name.  This form of context
wenzelm@24110
  1457
declaration works particularly well with commands 'declare' or
wenzelm@24110
  1458
'using', for example ``declare [[foo = 42]]''.  Thus it has become
wenzelm@24110
  1459
very easy to avoid global references, which would not observe Isar
wenzelm@24110
  1460
toplevel undo/redo and fail to work with multithreading.
wenzelm@24086
  1461
wenzelm@24172
  1462
Various global ML references of Pure and HOL have been turned into
wenzelm@24172
  1463
configuration options:
wenzelm@24172
  1464
wenzelm@24172
  1465
  Unify.search_bound		unify_search_bound
wenzelm@24172
  1466
  Unify.trace_bound		unify_trace_bound
wenzelm@24172
  1467
  Unify.trace_simp		unify_trace_simp
wenzelm@24172
  1468
  Unify.trace_types		unify_trace_types
wenzelm@24172
  1469
  Simplifier.simp_depth_limit	simp_depth_limit
wenzelm@24172
  1470
  Blast.depth_limit		blast_depth_limit
wenzelm@24172
  1471
  DatatypeProp.dtK		datatype_distinctness_limit
wenzelm@24172
  1472
  fast_arith_neq_limit  	fast_arith_neq_limit
wenzelm@24172
  1473
  fast_arith_split_limit	fast_arith_split_limit
wenzelm@24172
  1474
wenzelm@24086
  1475
* Named collections of theorems may be easily installed as context
wenzelm@24800
  1476
data using the functor NamedThmsFun (see also
wenzelm@24086
  1477
src/Pure/Tools/named_thms.ML).  The user may add or delete facts via
wenzelm@24110
  1478
attributes; there is also a toplevel print command.  This facility is
wenzelm@24110
  1479
just a common case of general context data, which is the preferred way
wenzelm@24110
  1480
for anything more complex than just a list of facts in canonical
wenzelm@24110
  1481
order.
wenzelm@24086
  1482
wenzelm@24032
  1483
* Isar: command 'declaration' augments a local theory by generic
wenzelm@24032
  1484
declaration functions written in ML.  This enables arbitrary content
wenzelm@24032
  1485
being added to the context, depending on a morphism that tells the
wenzelm@24032
  1486
difference of the original declaration context wrt. the application
wenzelm@24032
  1487
context encountered later on.
wenzelm@24032
  1488
wenzelm@24032
  1489
* Isar: proper interfaces for simplification procedures.  Command
wenzelm@24032
  1490
'simproc_setup' declares named simprocs (with match patterns, and body
wenzelm@24032
  1491
text in ML).  Attribute "simproc" adds/deletes simprocs in the current
wenzelm@24032
  1492
context.  ML antiquotation @{simproc name} retrieves named simprocs.
wenzelm@24032
  1493
wenzelm@24032
  1494
* Isar: an extra pair of brackets around attribute declarations
wenzelm@24032
  1495
abbreviates a theorem reference involving an internal dummy fact,
wenzelm@24032
  1496
which will be ignored later --- only the effect of the attribute on
wenzelm@24032
  1497
the background context will persist.  This form of in-place
wenzelm@24032
  1498
declarations is particularly useful with commands like 'declare' and
wenzelm@24032
  1499
'using', for example ``have A using [[simproc a]] by simp''.
wenzelm@24032
  1500
wenzelm@23369
  1501
* Isar: method "assumption" (and implicit closing of subproofs) now
wenzelm@23369
  1502
takes simple non-atomic goal assumptions into account: after applying
wenzelm@23369
  1503
an assumption as a rule the resulting subgoals are solved by atomic
wenzelm@23369
  1504
assumption steps.  This is particularly useful to finish 'obtain'
wenzelm@23369
  1505
goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
wenzelm@23369
  1506
without referring to the original premise "!!x. P x ==> thesis" in the
wenzelm@23369
  1507
Isar proof context.  POTENTIAL INCOMPATIBILITY: method "assumption" is
wenzelm@23369
  1508
more permissive.
wenzelm@23369
  1509
wenzelm@23369
  1510
* Isar: implicit use of prems from the Isar proof context is
wenzelm@23369
  1511
considered a legacy feature.  Common applications like ``have A .''
wenzelm@23369
  1512
may be replaced by ``have A by fact'' or ``note `A`''.  In general,
wenzelm@23369
  1513
referencing facts explicitly here improves readability and
wenzelm@23369
  1514
maintainability of proof texts.
wenzelm@23369
  1515
wenzelm@17865
  1516
* Isar: improper proof element 'guess' is like 'obtain', but derives
wenzelm@17865
  1517
the obtained context from the course of reasoning!  For example:
wenzelm@17865
  1518
wenzelm@17865
  1519
  assume "EX x y. A x & B y"   -- "any previous fact"
wenzelm@17865
  1520
  then guess x and y by clarify
wenzelm@17865
  1521
wenzelm@17865
  1522
This technique is potentially adventurous, depending on the facts and
wenzelm@17865
  1523
proof tools being involved here.
wenzelm@17865
  1524
wenzelm@18020
  1525
* Isar: known facts from the proof context may be specified as literal
wenzelm@18020
  1526
propositions, using ASCII back-quote syntax.  This works wherever
wenzelm@18020
  1527
named facts used to be allowed so far, in proof commands, proof
wenzelm@18020
  1528
methods, attributes etc.  Literal facts are retrieved from the context
wenzelm@18020
  1529
according to unification of type and term parameters.  For example,
wenzelm@18020
  1530
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
wenzelm@18020
  1531
theorems in the current context, then these are valid literal facts:
wenzelm@18020
  1532
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
wenzelm@18020
  1533
wenzelm@18020
  1534
There is also a proof method "fact" which does the same composition
wenzelm@18044
  1535
for explicit goal states, e.g. the following proof texts coincide with
wenzelm@18044
  1536
certain special cases of literal facts:
wenzelm@18020
  1537
wenzelm@18020
  1538
  have "A" by fact                 ==  note `A`
wenzelm@18020
  1539
  have "A ==> B" by fact           ==  note `A ==> B`
wenzelm@18020
  1540
  have "!!x. P x ==> Q x" by fact  ==  note `!!x. P x ==> Q x`
wenzelm@18020
  1541
  have "P a ==> Q a" by fact       ==  note `P a ==> Q a`
wenzelm@18020
  1542
wenzelm@20118
  1543
* Isar: ":" (colon) is no longer a symbolic identifier character in
wenzelm@20118
  1544
outer syntax.  Thus symbolic identifiers may be used without
wenzelm@20118
  1545
additional white space in declarations like this: ``assume *: A''.
wenzelm@20118
  1546
wenzelm@20013
  1547
* Isar: 'print_facts' prints all local facts of the current context,
wenzelm@20013
  1548
both named and unnamed ones.
wenzelm@20013
  1549
wenzelm@18308
  1550
* Isar: 'def' now admits simultaneous definitions, e.g.:
wenzelm@18308
  1551
wenzelm@18308
  1552
  def x == "t" and y == "u"
wenzelm@18308
  1553
wenzelm@18540
  1554
* Isar: added command 'unfolding', which is structurally similar to
wenzelm@18540
  1555
'using', but affects both the goal state and facts by unfolding given
wenzelm@18815
  1556
rewrite rules.  Thus many occurrences of the 'unfold' method or
wenzelm@18540
  1557
'unfolded' attribute may be replaced by first-class proof text.
wenzelm@18540
  1558
wenzelm@18815
  1559
* Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
wenzelm@18815
  1560
and command 'unfolding' now all support object-level equalities
wenzelm@18815
  1561
(potentially conditional).  The underlying notion of rewrite rule is
wenzelm@18815
  1562
analogous to the 'rule_format' attribute, but *not* that of the
wenzelm@18815
  1563
Simplifier (which is usually more generous).
wenzelm@18815
  1564
kleing@24238
  1565
* Isar: the new attribute [rotated n] (default n = 1) rotates the
kleing@24238
  1566
premises of a theorem by n. Useful in conjunction with drule.
kleing@24238
  1567
wenzelm@19220
  1568
* Isar: the goal restriction operator [N] (default N = 1) evaluates a
wenzelm@19220
  1569
method expression within a sandbox consisting of the first N
wenzelm@19240
  1570
sub-goals, which need to exist.  For example, ``simp_all [3]''
wenzelm@19240
  1571
simplifies the first three sub-goals, while (rule foo, simp_all)[]
wenzelm@19240
  1572
simplifies all new goals that emerge from applying rule foo to the
wenzelm@19240
  1573
originally first one.
wenzelm@19220
  1574
wenzelm@19814
  1575
* Isar: schematic goals are no longer restricted to higher-order
wenzelm@19814
  1576
patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
wenzelm@19814
  1577
expected.
wenzelm@19814
  1578
wenzelm@18901
  1579
* Isar: the conclusion of a long theorem statement is now either
wenzelm@18901
  1580
'shows' (a simultaneous conjunction, as before), or 'obtains'
wenzelm@18901
  1581
(essentially a disjunction of cases with local parameters and
wenzelm@18901
  1582
assumptions).  The latter allows to express general elimination rules
wenzelm@18910
  1583
adequately; in this notation common elimination rules look like this:
wenzelm@18901
  1584
wenzelm@18901
  1585
  lemma exE:    -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
wenzelm@18901
  1586
    assumes "EX x. P x"
wenzelm@18901
  1587
    obtains x where "P x"
wenzelm@18901
  1588
wenzelm@18901
  1589
  lemma conjE:  -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
wenzelm@18901
  1590
    assumes "A & B"
wenzelm@18901
  1591
    obtains A and B
wenzelm@18901
  1592
wenzelm@18901
  1593
  lemma disjE:  -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
wenzelm@18901
  1594
    assumes "A | B"
wenzelm@18901
  1595
    obtains
wenzelm@18901
  1596
      A
wenzelm@18901
  1597
    | B
wenzelm@18901
  1598
wenzelm@18910
  1599
The subsequent classical rules even refer to the formal "thesis"
wenzelm@18901
  1600
explicitly:
wenzelm@18901
  1601
wenzelm@18901
  1602
  lemma classical:     -- "(~ thesis ==> thesis) ==> thesis"
wenzelm@18901
  1603
    obtains "~ thesis"
wenzelm@18901
  1604
wenzelm@18910
  1605
  lemma Peirce's_Law:  -- "((thesis ==> something) ==> thesis) ==> thesis"
wenzelm@18910
  1606
    obtains "thesis ==> something"
wenzelm@18901
  1607
wenzelm@18901
  1608
The actual proof of an 'obtains' statement is analogous to that of the
wenzelm@18910
  1609
Isar proof element 'obtain', only that there may be several cases.
wenzelm@18910
  1610
Optional case names may be specified in parentheses; these will be
wenzelm@18910
  1611
available both in the present proof and as annotations in the
wenzelm@18910
  1612
resulting rule, for later use with the 'cases' method (cf. attribute
wenzelm@18910
  1613
case_names).
wenzelm@18901
  1614
wenzelm@21447
  1615
* Isar: the assumptions of a long theorem statement are available as
wenzelm@21447
  1616
"assms" fact in the proof context.  This is more appropriate than the
wenzelm@21447
  1617
(historical) "prems", which refers to all assumptions of the current
wenzelm@21447
  1618
context, including those from the target locale, proof body etc.
wenzelm@21447
  1619
wenzelm@19263
  1620
* Isar: 'print_statement' prints theorems from the current theory or
wenzelm@19263
  1621
proof context in long statement form, according to the syntax of a
wenzelm@19263
  1622
top-level lemma.
wenzelm@19263
  1623
wenzelm@18901
  1624
* Isar: 'obtain' takes an optional case name for the local context
wenzelm@18901
  1625
introduction rule (default "that").
wenzelm@18901
  1626
wenzelm@19587
  1627
* Isar: removed obsolete 'concl is' patterns.  INCOMPATIBILITY, use
wenzelm@19587
  1628
explicit (is "_ ==> ?foo") in the rare cases where this still happens
wenzelm@19587
  1629
to occur.
wenzelm@19587
  1630
wenzelm@19682
  1631
* Pure: syntax "CONST name" produces a fully internalized constant
wenzelm@19682
  1632
according to the current context.  This is particularly useful for
wenzelm@19682
  1633
syntax translations that should refer to internal constant
wenzelm@19682
  1634
representations independently of name spaces.
wenzelm@19682
  1635
wenzelm@21537
  1636
* Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
wenzelm@21537
  1637
instead of "FOO ". This allows multiple binder declarations to coexist
wenzelm@21537
  1638
in the same context.  INCOMPATIBILITY.
wenzelm@21537
  1639
wenzelm@21209
  1640
* Isar/locales: 'notation' provides a robust interface to the 'syntax'
wenzelm@21209
  1641
primitive that also works in a locale context (both for constants and
wenzelm@24950
  1642
fixed variables). Type declaration and internal syntactic representation
wenzelm@24950
  1643
of given constants retrieved from the context. Likewise, the
wenzelm@24950
  1644
'no_notation' command allows to remove given syntax annotations from the
wenzelm@24950
  1645
current context.
wenzelm@19682
  1646
wenzelm@19665
  1647
* Isar/locales: new derived specification elements 'axiomatization',
wenzelm@19665
  1648
'definition', 'abbreviation', which support type-inference, admit
wenzelm@19083
  1649
object-level specifications (equality, equivalence).  See also the
wenzelm@19083
  1650
isar-ref manual.  Examples:
wenzelm@19081
  1651
wenzelm@19665
  1652
  axiomatization
wenzelm@21595
  1653
    eq  (infix "===" 50) where
wenzelm@21595
  1654
    eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
wenzelm@21595
  1655
wenzelm@21595
  1656
  definition "f x y = x + y + 1"
wenzelm@21595
  1657
  definition g where "g x = f x x"
wenzelm@19081
  1658
wenzelm@19363
  1659
  abbreviation
wenzelm@21595
  1660
    neq  (infix "=!=" 50) where
wenzelm@19363
  1661
    "x =!= y == ~ (x === y)"
wenzelm@19081
  1662
wenzelm@19083
  1663
These specifications may be also used in a locale context.  Then the
wenzelm@19083
  1664
constants being introduced depend on certain fixed parameters, and the
wenzelm@19083
  1665
constant name is qualified by the locale base name.  An internal
wenzelm@19083
  1666
abbreviation takes care for convenient input and output, making the
wenzelm@19088
  1667
parameters implicit and using the original short name.  See also
wenzelm@25177
  1668
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
wenzelm@19083
  1669
entities from a monomorphic theory.
wenzelm@19083
  1670
wenzelm@19083
  1671
Presently, abbreviations are only available 'in' a target locale, but
wenzelm@19363
  1672
not inherited by general import expressions.  Also note that
wenzelm@19363
  1673
'abbreviation' may be used as a type-safe replacement for 'syntax' +
wenzelm@24735
  1674
'translations' in common applications.  The "no_abbrevs" print mode
wenzelm@24735
  1675
prevents folding of abbreviations in term output.
wenzelm@19084
  1676
wenzelm@19682
  1677
Concrete syntax is attached to specified constants in internal form,
wenzelm@19682
  1678
independently of name spaces.  The parse tree representation is
wenzelm@21209
  1679
slightly different -- use 'notation' instead of raw 'syntax', and
wenzelm@19682
  1680
'translations' with explicit "CONST" markup to accommodate this.
wenzelm@19665
  1681
wenzelm@24800
  1682
* Pure/Isar: unified syntax for new-style specification mechanisms
wenzelm@24800
  1683
(e.g.  'definition', 'abbreviation', or 'inductive' in HOL) admits
wenzelm@24800
  1684
full type inference and dummy patterns ("_").  For example:
wenzelm@24735
  1685
wenzelm@24735
  1686
  definition "K x _ = x"
wenzelm@24735
  1687
wenzelm@24738
  1688
  inductive conj for A B
wenzelm@24738
  1689
  where "A ==> B ==> conj A B"
wenzelm@24738
  1690
wenzelm@21735
  1691
* Pure: command 'print_abbrevs' prints all constant abbreviations of
wenzelm@21735
  1692
the current context.  Print mode "no_abbrevs" prevents inversion of
wenzelm@21735
  1693
abbreviations on output.
wenzelm@21735
  1694
wenzelm@24800
  1695
* Isar/locales: improved parameter handling: use of locales "var" and
wenzelm@24800
  1696
"struct" no longer necessary; - parameter renamings are no longer
wenzelm@24800
  1697
required to be injective.  For example, this allows to define
wenzelm@24800
  1698
endomorphisms as locale endom = homom mult mult h.
ballarin@19783
  1699
ballarin@19931
  1700
* Isar/locales: changed the way locales with predicates are defined.
ballarin@19931
  1701
Instead of accumulating the specification, the imported expression is
wenzelm@22126
  1702
now an interpretation.  INCOMPATIBILITY: different normal form of
wenzelm@22126
  1703
locale expressions.  In particular, in interpretations of locales with
wenzelm@22126
  1704
predicates, goals repesenting already interpreted fragments are not
wenzelm@22126
  1705
removed automatically.  Use methods `intro_locales' and
wenzelm@22126
  1706
`unfold_locales'; see below.
wenzelm@22126
  1707
wenzelm@22126
  1708
* Isar/locales: new methods `intro_locales' and `unfold_locales'
wenzelm@22126
  1709
provide backward reasoning on locales predicates.  The methods are
wenzelm@22126
  1710
aware of interpretations and discharge corresponding goals.
wenzelm@22126
  1711
`intro_locales' is less aggressive then `unfold_locales' and does not
wenzelm@22126
  1712
unfold predicates to assumptions.
ballarin@19931
  1713
ballarin@19931
  1714
* Isar/locales: the order in which locale fragments are accumulated
wenzelm@22126
  1715
has changed.  This enables to override declarations from fragments due
wenzelm@22126
  1716
to interpretations -- for example, unwanted simp rules.
ballarin@19931
  1717
ballarin@23920
  1718
* Isar/locales: interpretation in theories and proof contexts has been
ballarin@23920
  1719
extended.  One may now specify (and prove) equations, which are
ballarin@23920
  1720
unfolded in interpreted theorems.  This is useful for replacing
ballarin@23920
  1721
defined concepts (constants depending on locale parameters) by
ballarin@23920
  1722
concepts already existing in the target context.  Example:
ballarin@23920
  1723
ballarin@23920
  1724
  interpretation partial_order ["op <= :: [int, int] => bool"]
ballarin@23920
  1725
    where "partial_order.less (op <=) (x::int) y = (x < y)"
ballarin@23920
  1726
wenzelm@24800
  1727
Typically, the constant `partial_order.less' is created by a
wenzelm@24800
  1728
definition specification element in the context of locale
wenzelm@24800
  1729
partial_order.
wenzelm@24800
  1730
wenzelm@24859
  1731
* Method "induct": improved internal context management to support
wenzelm@24800
  1732
local fixes and defines on-the-fly. Thus explicit meta-level
wenzelm@24800
  1733
connectives !!  and ==> are rarely required anymore in inductive goals
wenzelm@24800
  1734
(using object-logic connectives for this purpose has been long
wenzelm@24800
  1735
obsolete anyway). Common proof patterns are explained in
wenzelm@25177
  1736
src/HOL/Induct/Common_Patterns.thy, see also
wenzelm@25177
  1737
src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
wenzelm@25177
  1738
examples.
wenzelm@24606
  1739
wenzelm@24859
  1740
* Method "induct": improved handling of simultaneous goals. Instead of
wenzelm@24606
  1741
introducing object-level conjunction, the statement is now split into
wenzelm@24606
  1742
several conclusions, while the corresponding symbolic cases are nested
wenzelm@24606
  1743
accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
wenzelm@25177
  1744
see src/HOL/Induct/Common_Patterns.thy, for example.
wenzelm@24606
  1745
wenzelm@24859
  1746
* Method "induct": mutual induction rules are now specified as a list
wenzelm@24800
  1747
of rule sharing the same induction cases. HOL packages usually provide
wenzelm@24606
  1748
foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
wenzelm@24859
  1749
predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
wenzelm@24859
  1750
mutual induction rules differently, i.e. like this:
wenzelm@18506
  1751
wenzelm@18506
  1752
  (induct rule: foo_bar.inducts)
wenzelm@18506
  1753
  (induct set: foo bar)
wenzelm@24859
  1754
  (induct pred: foo bar)
wenzelm@18506
  1755
  (induct type: foo bar)
wenzelm@18506
  1756
wenzelm@18506
  1757
The ML function ProjectRule.projections turns old-style rules into the
wenzelm@18506
  1758
new format.
wenzelm@18506
  1759
wenzelm@24859
  1760
* Method "coinduct": dual of induction, see
wenzelm@18399
  1761
src/HOL/Library/Coinductive_List.thy for various examples.
wenzelm@18399
  1762
wenzelm@24859
  1763
* Method "cases", "induct", "coinduct": the ``(open)'' option is
wenzelm@24859
  1764
considered a legacy feature.
wenzelm@24859
  1765
wenzelm@20919
  1766
* Attribute "symmetric" produces result with standardized schematic
wenzelm@20919
  1767
variables (index 0).  Potential INCOMPATIBILITY.
wenzelm@20919
  1768
wenzelm@22126
  1769
* Simplifier: by default the simplifier trace only shows top level
wenzelm@22126
  1770
rewrites now. That is, trace_simp_depth_limit is set to 1 by
wenzelm@22126
  1771
default. Thus there is less danger of being flooded by the trace. The
wenzelm@22126
  1772
trace indicates where parts have been suppressed.
nipkow@18674
  1773
  
wenzelm@18536
  1774
* Provers/classical: removed obsolete classical version of elim_format
wenzelm@18536
  1775
attribute; classical elim/dest rules are now treated uniformly when
wenzelm@18536
  1776
manipulating the claset.
wenzelm@18536
  1777
wenzelm@18694
  1778
* Provers/classical: stricter checks to ensure that supplied intro,
wenzelm@18694
  1779
dest and elim rules are well-formed; dest and elim rules must have at
wenzelm@18694
  1780
least one premise.
wenzelm@18694
  1781
wenzelm@18694
  1782
* Provers/classical: attributes dest/elim/intro take an optional
wenzelm@18695
  1783
weight argument for the rule (just as the Pure versions).  Weights are
wenzelm@18696
  1784
ignored by automated tools, but determine the search order of single
wenzelm@18694
  1785
rule steps.
paulson@18557
  1786
wenzelm@18536
  1787
* Syntax: input syntax now supports dummy variable binding "%_. b",
wenzelm@18536
  1788
where the body does not mention the bound variable.  Note that dummy
wenzelm@18536
  1789
patterns implicitly depend on their context of bounds, which makes
wenzelm@18536
  1790
"{_. _}" match any set comprehension as expected.  Potential
wenzelm@18536
  1791
INCOMPATIBILITY -- parse translations need to cope with syntactic
wenzelm@18536
  1792
constant "_idtdummy" in the binding position.
wenzelm@18536
  1793
wenzelm@18536
  1794
* Syntax: removed obsolete syntactic constant "_K" and its associated
wenzelm@18536
  1795
parse translation.  INCOMPATIBILITY -- use dummy abstraction instead,
wenzelm@18536
  1796
for example "A -> B" => "Pi A (%_. B)".
wenzelm@17779
  1797
wenzelm@20582
  1798
* Pure: 'class_deps' command visualizes the subclass relation, using
wenzelm@20582
  1799
the graph browser tool.
wenzelm@20582
  1800
wenzelm@24800
  1801
* Pure: 'print_theory' now suppresses certain internal declarations by
wenzelm@24800
  1802
default; use '!' option for full details.
wenzelm@20620
  1803
wenzelm@17865
  1804
nipkow@17806
  1805
*** HOL ***
nipkow@17806
  1806
wenzelm@25129
  1807
* Method "metis" proves goals by applying the Metis general-purpose
wenzelm@25129
  1808
resolution prover (see also http://gilith.com/software/metis/).
wenzelm@25129
  1809
Examples are in the directory MetisExamples.  WARNING: the
wenzelm@25129
  1810
Isabelle/HOL-Metis integration does not yet work properly with
wenzelm@25129
  1811
multi-threading.
wenzelm@25129
  1812
  
wenzelm@25129
  1813
* Command 'sledgehammer' invokes external automatic theorem provers as
wenzelm@25129
  1814
background processes.  It generates calls to the "metis" method if
wenzelm@25129
  1815
successful. These can be pasted into the proof.  Users do not have to
wenzelm@25129
  1816
wait for the automatic provers to return.  WARNING: does not really
wenzelm@25129
  1817
work with multi-threading.
wenzelm@25129
  1818
wenzelm@24804
  1819
* New "auto_quickcheck" feature tests outermost goal statements for
wenzelm@24804
  1820
potential counter-examples.  Controlled by ML references
wenzelm@24804
  1821
auto_quickcheck (default true) and auto_quickcheck_time_limit (default
wenzelm@25129
  1822
5000 milliseconds).  Fails silently if statements is outside of
wenzelm@25129
  1823
executable fragment, or any other codgenerator problem occurs.
wenzelm@24804
  1824
haftmann@25184
  1825
* New constant "undefined" with axiom "undefined x = undefined".
haftmann@25184
  1826
haftmann@25184
  1827
* Added class "HOL.eq", allowing for code generation with polymorphic
haftmann@25184
  1828
equality.
haftmann@25184
  1829
haftmann@25184
  1830
* Some renaming of class constants due to canonical name prefixing in
haftmann@25184
  1831
the new 'class' package:
haftmann@25184
  1832
haftmann@25184
  1833
    HOL.abs ~> HOL.abs_class.abs
haftmann@25184
  1834
    HOL.divide ~> HOL.divide_class.divide
haftmann@25184
  1835
    0 ~> HOL.zero_class.zero
haftmann@25184
  1836
    1 ~> HOL.one_class.one
haftmann@25184
  1837
    op + ~> HOL.plus_class.plus
haftmann@25184
  1838
    op - ~> HOL.minus_class.minus
haftmann@25184
  1839
    uminus ~> HOL.minus_class.uminus
haftmann@25184
  1840
    op * ~> HOL.times_class.times
haftmann@25184
  1841
    op < ~> HOL.ord_class.less
haftmann@25184
  1842
    op <= > HOL.ord_class.less_eq
haftmann@25184
  1843
    Nat.power ~> Power.power_class.power
haftmann@25184
  1844
    Nat.size ~> Nat.size_class.size
haftmann@25184
  1845
    Numeral.number_of ~> Numeral.number_class.number_of
haftmann@25184
  1846
    FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
haftmann@25184
  1847
    FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
haftmann@25184
  1848
    Orderings.min ~> Orderings.ord_class.min
haftmann@25184
  1849
    Orderings.max ~> Orderings.ord_class.max
haftmann@25184
  1850
    Divides.op div ~> Divides.div_class.div
haftmann@25184
  1851
    Divides.op mod ~> Divides.div_class.mod
haftmann@25184
  1852
    Divides.op dvd ~> Divides.div_class.dvd
haftmann@25184
  1853
haftmann@25184
  1854
INCOMPATIBILITY.  Adaptions may be required in the following cases:
haftmann@25184
  1855
haftmann@25184
  1856
a) User-defined constants using any of the names "plus", "minus",
haftmann@25184
  1857
"times", "less" or "less_eq". The standard syntax translations for
haftmann@25184
  1858
"+", "-" and "*" may go wrong.  INCOMPATIBILITY: use more specific
haftmann@25184
  1859
names.
haftmann@25184
  1860
haftmann@25184
  1861
b) Variables named "plus", "minus", "times", "less", "less_eq"
haftmann@25184
  1862
INCOMPATIBILITY: use more specific names.
haftmann@25184
  1863
haftmann@25184
  1864
c) Permutative equations (e.g. "a + b = b + a")
haftmann@25184
  1865
Since the change of names also changes the order of terms, permutative
haftmann@25184
  1866
rewrite rules may get applied in a different order. Experience shows
haftmann@25184
  1867
that this is rarely the case (only two adaptions in the whole Isabelle
haftmann@25184
  1868
distribution).  INCOMPATIBILITY: rewrite proofs
haftmann@25184
  1869
haftmann@25184
  1870
d) ML code directly refering to constant names
haftmann@25184
  1871
This in general only affects hand-written proof tactics, simprocs and
haftmann@25184
  1872
so on.  INCOMPATIBILITY: grep your sourcecode and replace names.
haftmann@25184
  1873
Consider using @{const_name} antiquotation.
haftmann@25184
  1874
haftmann@25184
  1875
* New class "default" with associated constant "default".
haftmann@25184
  1876
haftmann@25184
  1877
* Function "sgn" is now overloaded and available on int, real, complex
haftmann@25184
  1878
(and other numeric types), using class "sgn".  Two possible defs of
haftmann@25184
  1879
sgn are given as equational assumptions in the classes sgn_if and
haftmann@25184
  1880
sgn_div_norm; ordered_idom now also inherits from sgn_if.
haftmann@25184
  1881
INCOMPATIBILITY.
haftmann@25184
  1882
haftmann@25184
  1883
* Locale "partial_order" now unified with class "order" (cf. theory
haftmann@25184
  1884
Orderings), added parameter "less".  INCOMPATIBILITY.
haftmann@25184
  1885
haftmann@25184
  1886
* Renamings in classes "order" and "linorder": facts "refl", "trans" and
haftmann@25184
  1887
"cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
haftmann@25184
  1888
clashes with HOL "refl" and "trans".  INCOMPATIBILITY.
haftmann@25184
  1889
haftmann@25184
  1890
* Classes "order" and "linorder": potential INCOMPATIBILITY due to
haftmann@25184
  1891
changed order of proof goals in instance proofs.
haftmann@25184
  1892
haftmann@25184
  1893
* The transitivity reasoner for partial and linear orders is set up
haftmann@25184
  1894
for classes "order" and "linorder".  Instances of the reasoner are available
haftmann@25184
  1895
in all contexts importing or interpreting the corresponding locales.
haftmann@25184
  1896
Method "order" invokes the reasoner separately; the reasoner
haftmann@25184
  1897
is also integrated with the Simplifier as a solver.  Diagnostic
haftmann@25184
  1898
command 'print_orders' shows the available instances of the reasoner
haftmann@25184
  1899
in the current context.
haftmann@25184
  1900
haftmann@25184
  1901
* Localized monotonicity predicate in theory "Orderings"; integrated
haftmann@25184
  1902
lemmas max_of_mono and min_of_mono with this predicate.
haftmann@25184
  1903
INCOMPATIBILITY.
haftmann@25184
  1904
haftmann@25184
  1905
* Formulation of theorem "dense" changed slightly due to integration
haftmann@25184
  1906
with new class dense_linear_order.
haftmann@25184
  1907
haftmann@25184
  1908
* Uniform lattice theory development in HOL.
haftmann@25184
  1909
haftmann@25184
  1910
    constants "meet" and "join" now named "inf" and "sup"
haftmann@25184
  1911
    constant "Meet" now named "Inf"
haftmann@25184
  1912
haftmann@25184
  1913
    classes "meet_semilorder" and "join_semilorder" now named
haftmann@25184
  1914
      "lower_semilattice" and "upper_semilattice"
haftmann@25184
  1915
    class "lorder" now named "lattice"
haftmann@25184
  1916
    class "comp_lat" now named "complete_lattice"
haftmann@25184
  1917
haftmann@25184
  1918
    Instantiation of lattice classes allows explicit definitions
haftmann@25184
  1919
    for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
haftmann@25184
  1920
haftmann@25184
  1921
  INCOMPATIBILITY.  Theorem renames:
haftmann@25184
  1922
haftmann@25184
  1923
    meet_left_le            ~> inf_le1
haftmann@25184
  1924
    meet_right_le           ~> inf_le2
haftmann@25184
  1925
    join_left_le            ~> sup_ge1
haftmann@25184
  1926
    join_right_le           ~> sup_ge2
haftmann@25184
  1927
    meet_join_le            ~> inf_sup_ord
haftmann@25184
  1928
    le_meetI                ~> le_infI
haftmann@25184
  1929
    join_leI                ~> le_supI
haftmann@25184
  1930
    le_meet                 ~> le_inf_iff
haftmann@25184
  1931
    le_join                 ~> ge_sup_conv
haftmann@25184
  1932
    meet_idempotent         ~> inf_idem
haftmann@25184
  1933
    join_idempotent         ~> sup_idem
haftmann@25184
  1934
    meet_comm               ~> inf_commute
haftmann@25184
  1935
    join_comm               ~> sup_commute
haftmann@25184
  1936
    meet_leI1               ~> le_infI1
haftmann@25184
  1937
    meet_leI2               ~> le_infI2
haftmann@25184
  1938
    le_joinI1               ~> le_supI1
haftmann@25184
  1939
    le_joinI2               ~> le_supI2
haftmann@25184
  1940
    meet_assoc              ~> inf_assoc
haftmann@25184
  1941
    join_assoc              ~> sup_assoc
haftmann@25184
  1942
    meet_left_comm          ~> inf_left_commute
haftmann@25184
  1943
    meet_left_idempotent    ~> inf_left_idem
haftmann@25184
  1944
    join_left_comm          ~> sup_left_commute
haftmann@25184
  1945
    join_left_idempotent    ~> sup_left_idem
haftmann@25184
  1946
    meet_aci                ~> inf_aci
haftmann@25184
  1947
    join_aci                ~> sup_aci
haftmann@25184
  1948
    le_def_meet             ~> le_iff_inf
haftmann@25184
  1949
    le_def_join             ~> le_iff_sup
haftmann@25184
  1950
    join_absorp2            ~> sup_absorb2
haftmann@25184
  1951
    join_absorp1            ~> sup_absorb1
haftmann@25184
  1952
    meet_absorp1            ~> inf_absorb1
haftmann@25184
  1953
    meet_absorp2            ~> inf_absorb2
haftmann@25184
  1954
    meet_join_absorp        ~> inf_sup_absorb
haftmann@25184
  1955
    join_meet_absorp        ~> sup_inf_absorb
haftmann@25184
  1956
    distrib_join_le         ~> distrib_sup_le
haftmann@25184
  1957
    distrib_meet_le         ~> distrib_inf_le
haftmann@25184
  1958
haftmann@25184
  1959
    add_meet_distrib_left   ~> add_inf_distrib_left
haftmann@25184
  1960
    add_join_distrib_left   ~> add_sup_distrib_left
haftmann@25184
  1961
    is_join_neg_meet        ~> is_join_neg_inf
haftmann@25184
  1962
    is_meet_neg_join        ~> is_meet_neg_sup
haftmann@25184
  1963
    add_meet_distrib_right  ~> add_inf_distrib_right
haftmann@25184
  1964
    add_join_distrib_right  ~> add_sup_distrib_right
haftmann@25184
  1965
    add_meet_join_distribs  ~> add_sup_inf_distribs
haftmann@25184
  1966
    join_eq_neg_meet        ~> sup_eq_neg_inf
haftmann@25184
  1967
    meet_eq_neg_join        ~> inf_eq_neg_sup
haftmann@25184
  1968
    add_eq_meet_join        ~> add_eq_inf_sup
haftmann@25184
  1969
    meet_0_imp_0            ~> inf_0_imp_0
haftmann@25184
  1970
    join_0_imp_0            ~> sup_0_imp_0
haftmann@25184
  1971
    meet_0_eq_0             ~> inf_0_eq_0
haftmann@25184
  1972
    join_0_eq_0             ~> sup_0_eq_0
haftmann@25184
  1973
    neg_meet_eq_join        ~> neg_inf_eq_sup
haftmann@25184
  1974
    neg_join_eq_meet        ~> neg_sup_eq_inf
haftmann@25184
  1975
    join_eq_if              ~> sup_eq_if
haftmann@25184
  1976
haftmann@25184
  1977
    mono_meet               ~> mono_inf
haftmann@25184
  1978
    mono_join               ~> mono_sup
haftmann@25184
  1979
    meet_bool_eq            ~> inf_bool_eq
haftmann@25184
  1980
    join_bool_eq            ~> sup_bool_eq
haftmann@25184
  1981
    meet_fun_eq             ~> inf_fun_eq
haftmann@25184
  1982
    join_fun_eq             ~> sup_fun_eq
haftmann@25184
  1983
    meet_set_eq             ~> inf_set_eq
haftmann@25184
  1984
    join_set_eq             ~> sup_set_eq
haftmann@25184
  1985
    meet1_iff               ~> inf1_iff
haftmann@25184
  1986
    meet2_iff               ~> inf2_iff
haftmann@25184
  1987
    meet1I                  ~> inf1I
haftmann@25184
  1988
    meet2I                  ~> inf2I
haftmann@25184
  1989
    meet1D1                 ~> inf1D1
haftmann@25184
  1990
    meet2D1                 ~> inf2D1
haftmann@25184
  1991
    meet1D2                 ~> inf1D2
haftmann@25184
  1992
    meet2D2                 ~> inf2D2
haftmann@25184
  1993
    meet1E                  ~> inf1E
haftmann@25184
  1994
    meet2E                  ~> inf2E
haftmann@25184
  1995
    join1_iff               ~> sup1_iff
haftmann@25184
  1996
    join2_iff               ~> sup2_iff
haftmann@25184
  1997
    join1I1                 ~> sup1I1
haftmann@25184
  1998
    join2I1                 ~> sup2I1
haftmann@25184
  1999
    join1I1                 ~> sup1I1
haftmann@25184
  2000
    join2I2                 ~> sup1I2
haftmann@25184
  2001
    join1CI                 ~> sup1CI
haftmann@25184
  2002
    join2CI                 ~> sup2CI
haftmann@25184
  2003
    join1E                  ~> sup1E
haftmann@25184
  2004
    join2E                  ~> sup2E
haftmann@25184
  2005
haftmann@25184
  2006
    is_meet_Meet            ~> is_meet_Inf
haftmann@25184
  2007
    Meet_bool_def           ~> Inf_bool_def
haftmann@25184
  2008
    Meet_fun_def            ~> Inf_fun_def
haftmann@25184
  2009
    Meet_greatest           ~> Inf_greatest
haftmann@25184
  2010
    Meet_lower              ~> Inf_lower
haftmann@25184
  2011
    Meet_set_def            ~> Inf_set_def
haftmann@25184
  2012
haftmann@25184
  2013
    Sup_def                 ~> Sup_Inf
haftmann@25184
  2014
    Sup_bool_eq             ~> Sup_bool_def
haftmann@25184
  2015
    Sup_fun_eq              ~> Sup_fun_def
haftmann@25184
  2016
    Sup_set_eq              ~> Sup_set_def
haftmann@25184
  2017
haftmann@25184
  2018
    listsp_meetI            ~> listsp_infI
haftmann@25184
  2019
    listsp_meet_eq          ~> listsp_inf_eq
haftmann@25184
  2020
haftmann@25184
  2021
    meet_min                ~> inf_min
haftmann@25184
  2022
    join_max                ~> sup_max
haftmann@25184
  2023
haftmann@25184
  2024
* Added syntactic class "size"; overloaded constant "size" now has
haftmann@25184
  2025
type "'a::size ==> bool"
haftmann@25184
  2026
wenzelm@24800
  2027
* Internal reorganisation of `size' of datatypes: size theorems
wenzelm@24800
  2028
"foo.size" are no longer subsumed by "foo.simps" (but are still
wenzelm@24800
  2029
simplification rules by default!); theorems "prod.size" now named
haftmann@25184
  2030
"*.size".
haftmann@25184
  2031
haftmann@25184
  2032
* Class "div" now inherits from class "times" rather than "type".
haftmann@25184
  2033
INCOMPATIBILITY.
wenzelm@24800
  2034
wenzelm@24800
  2035
* HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
wenzelm@24800
  2036
Linorder etc.  have disappeared; operations defined in terms of
wenzelm@24800
  2037
fold_set now are named Inf_fin, Sup_fin.  INCOMPATIBILITY.
wenzelm@24800
  2038
wenzelm@25129
  2039
* HOL/Nat: neq0_conv no longer declared as iff.  INCOMPATIBILITY.
wenzelm@25129
  2040
wenzelm@24800
  2041
* HOL-Word: New extensive library and type for generic, fixed size
wenzelm@24800
  2042
machine words, with arithemtic, bit-wise, shifting and rotating
wenzelm@24800
  2043
operations, reflection into int, nat, and bool lists, automation for
wenzelm@24800
  2044
linear arithmetic (by automatic reflection into nat or int), including
wenzelm@24800
  2045
lemmas on overflow and monotonicity.  Instantiated to all appropriate
wenzelm@24800
  2046
arithmetic type classes, supporting automatic simplification of
wenzelm@24800
  2047
numerals on all operations.
kleing@24333
  2048
kleing@24333
  2049
* Library/Boolean_Algebra: locales for abstract boolean algebras.
kleing@24333
  2050
kleing@24333
  2051
* Library/Numeral_Type: numbers as types, e.g. TYPE(32).
kleing@24333
  2052
haftmann@23850
  2053
* Code generator library theories:
haftmann@24993
  2054
  - Code_Integer represents HOL integers by big integer literals in target
haftmann@23850
  2055
    languages.
haftmann@24993
  2056
  - Code_Char represents HOL characters by character literals in target
haftmann@23850
  2057
    languages.
haftmann@24993
  2058
  - Code_Char_chr like Code_Char, but also offers treatment of character
haftmann@24993
  2059
    codes; includes Code_Integer.
wenzelm@24800
  2060
  - Executable_Set allows to generate code for finite sets using lists.
wenzelm@24800
  2061
  - Executable_Rat implements rational numbers as triples (sign, enumerator,
haftmann@23850
  2062
    denominator).
wenzelm@24800
  2063
  - Executable_Real implements a subset of real numbers, namly those
haftmann@23850
  2064
    representable by rational numbers.
wenzelm@24800
  2065
  - Efficient_Nat implements natural numbers by integers, which in general will
haftmann@23850
  2066
    result in higher efficency; pattern matching with 0/Suc is eliminated;
haftmann@24993
  2067
    includes Code_Integer.
haftmann@24993
  2068
  - Code_Index provides an additional datatype index which is mapped to
haftmann@24993
  2069
    target-language built-in integers.
haftmann@26355
  2070
  - Code_Message provides an additional datatype message_string which is isomorphic to
haftmann@24993
  2071
    strings; messages are mapped to target-language strings.
haftmann@23850
  2072
berghofe@23783
  2073
* New package for inductive predicates
berghofe@23783
  2074
berghofe@23783
  2075
  An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
berghofe@23783
  2076
berghofe@23783
  2077
    inductive
berghofe@23783
  2078
      p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
berghofe@23783
  2079
      for z_1 :: U_1 and ... and z_n :: U_m
berghofe@23783
  2080
    where
berghofe@23783
  2081
      rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
berghofe@23783
  2082
    | ...
berghofe@23783
  2083
wenzelm@24800
  2084
  with full support for type-inference, rather than
berghofe@23783
  2085
berghofe@23783
  2086
    consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
berghofe@23783
  2087
berghofe@23783
  2088
    abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
berghofe@23783
  2089
    where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
berghofe@23783
  2090
berghofe@23783
  2091
    inductive "s z_1 ... z_m"
berghofe@23783
  2092
    intros
berghofe@23783
  2093
      rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
berghofe@23783
  2094
      ...
berghofe@23783
  2095
berghofe@23783
  2096
  For backward compatibility, there is a wrapper allowing inductive
berghofe@23783
  2097
  sets to be defined with the new package via
berghofe@23783
  2098
berghofe@23783
  2099
    inductive_set
berghofe@23783
  2100
      s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
berghofe@23783
  2101
      for z_1 :: U_1 and ... and z_n :: U_m
berghofe@23783
  2102
    where
berghofe@23783
  2103
      rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
berghofe@23783
  2104
    | ...
berghofe@23783
  2105
berghofe@23783
  2106
  or
berghofe@23783
  2107
berghofe@23783
  2108
    inductive_set
berghofe@23783
  2109
      s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
berghofe@23783
  2110
      and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
berghofe@23783
  2111
      for z_1 :: U_1 and ... and z_n :: U_m
berghofe@23783
  2112
    where
berghofe@23783
  2113
      "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
berghofe@23783
  2114
    | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
berghofe@23783
  2115
    | ...
berghofe@23783
  2116
berghofe@23783
  2117
  if the additional syntax "p ..." is required.
berghofe@23783
  2118
wenzelm@25177
  2119
  Numerous examples can be found in the subdirectories src/HOL/Auth,
wenzelm@25177
  2120
  src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
berghofe@23783
  2121
berghofe@23783
  2122
  INCOMPATIBILITIES:
berghofe@23783
  2123
berghofe@23783
  2124
  - Since declaration and definition of inductive sets or predicates
wenzelm@24800
  2125
    is no longer separated, abbreviations involving the newly
wenzelm@24800
  2126
    introduced sets or predicates must be specified together with the
wenzelm@24800
  2127
    introduction rules after the 'where' keyword (see above), rather
wenzelm@24800
  2128
    than before the actual inductive definition.
wenzelm@24800
  2129
wenzelm@24800
  2130
  - The variables in induction and elimination rules are now
wenzelm@24800
  2131
    quantified in the order of their occurrence in the introduction
wenzelm@24800
  2132
    rules, rather than in alphabetical order. Since this may break
wenzelm@24800
  2133
    some proofs, these proofs either have to be repaired, e.g. by
wenzelm@24800
  2134
    reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
wenzelm@24800
  2135
    statements of the form
berghofe@23783
  2136
berghofe@23783
  2137
      case (rule_i a_i_1 ... a_i_{k_i})
berghofe@23783
  2138
berghofe@23783
  2139
    or the old order of quantification has to be restored by explicitly adding
berghofe@23783
  2140
    meta-level quantifiers in the introduction rules, i.e.
berghofe@23783
  2141
berghofe@23783
  2142
      | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
berghofe@23783
  2143
berghofe@23783
  2144
  - The format of the elimination rules is now
berghofe@23783
  2145
berghofe@23783
  2146
      p z_1 ... z_m x_1 ... x_n ==>
berghofe@23783
  2147
        (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
berghofe@23783
  2148
        ==> ... ==> P
berghofe@23783
  2149
berghofe@23783
  2150
    for predicates and
berghofe@23783
  2151
berghofe@23783
  2152
      (x_1, ..., x_n) : s z_1 ... z_m ==>
berghofe@23783
  2153
        (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
berghofe@23783
  2154
        ==> ... ==> P
berghofe@23783
  2155
berghofe@23783
  2156
    for sets rather than
berghofe@23783
  2157
berghofe@23783
  2158
      x : s z_1 ... z_m ==>
berghofe@23783
  2159
        (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
berghofe@23783
  2160
        ==> ... ==> P
berghofe@23783
  2161
wenzelm@24800
  2162
    This may require terms in goals to be expanded to n-tuples
wenzelm@24800
  2163
    (e.g. using case_tac or simplification with the split_paired_all
wenzelm@24800
  2164
    rule) before the above elimination rule is applicable.
wenzelm@24800
  2165
wenzelm@24800
  2166
  - The elimination or case analysis rules for (mutually) inductive
wenzelm@24800
  2167
    sets or predicates are now called "p_1.cases" ... "p_k.cases". The
wenzelm@24800
  2168
    list of rules "p_1_..._p_k.elims" is no longer available.
berghofe@23783
  2169
krauss@25198
  2170
* New package "function"/"fun" for general recursive functions,
krauss@25198
  2171
supporting mutual and nested recursion, definitions in local contexts,
krauss@25198
  2172
more general pattern matching and partiality. See HOL/ex/Fundefs.thy
krauss@25198
  2173
for small examples, and the separate tutorial on the function
krauss@25198
  2174
package. The old recdef "package" is still available as before, but
krauss@25198
  2175
users are encouraged to use the new package.
krauss@25198
  2176
krauss@25198
  2177
* Method "lexicographic_order" automatically synthesizes termination
krauss@25198
  2178
relations as lexicographic combinations of size measures. 
krauss@25198
  2179
wenzelm@24800
  2180
* Case-expressions allow arbitrary constructor-patterns (including
wenzelm@24800
  2181
"_") and take their order into account, like in functional
wenzelm@24800
  2182
programming.  Internally, this is translated into nested
wenzelm@24800
  2183
case-expressions; missing cases are added and mapped to the predefined
wenzelm@24800
  2184
constant "undefined". In complicated cases printing may no longer show
wenzelm@24800
  2185
the original input but the internal form. Lambda-abstractions allow
wenzelm@24800
  2186
the same form of pattern matching: "% pat1 => e1 | ..." is an
wenzelm@24800
  2187
abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
wenzelm@24800
  2188
variable.
nipkow@23564
  2189
huffman@23468
  2190
* IntDef: The constant "int :: nat => int" has been removed; now "int"
wenzelm@24800
  2191
is an abbreviation for "of_nat :: nat => int". The simplification
wenzelm@24800
  2192
rules for "of_nat" have been changed to work like "int" did
wenzelm@24800
  2193
previously.  Potential INCOMPATIBILITY:
huffman@23468
  2194
  - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
huffman@23468
  2195
  - of_nat_diff and of_nat_mult are no longer default simp rules
huffman@23377
  2196
chaieb@23295
  2197
* Method "algebra" solves polynomial equations over (semi)rings using
wenzelm@24800
  2198
Groebner bases. The (semi)ring structure is defined by locales and the
wenzelm@24800
  2199
tool setup depends on that generic context. Installing the method for
wenzelm@24800
  2200
a specific type involves instantiating the locale and possibly adding
wenzelm@24800
  2201
declarations for computation on the coefficients.  The method is
wenzelm@24800
  2202
already instantiated for natural numbers and for the axiomatic class
wenzelm@24800
  2203
of idoms with numerals.  See also the paper by Chaieb and Wenzel at
wenzelm@24800
  2204
CALCULEMUS 2007 for the general principles underlying this
wenzelm@24800
  2205
architecture of context-aware proof-tools.
wenzelm@24800
  2206
wenzelm@25033
  2207
* Method "ferrack" implements quantifier elimination over
wenzelm@25033
  2208
special-purpose dense linear orders using locales (analogous to
wenzelm@25033
  2209
"algebra"). The method is already installed for class
wenzelm@25033
  2210
{ordered_field,recpower,number_ring} which subsumes real, hyperreal,
wenzelm@25033
  2211
rat, etc.
wenzelm@25033
  2212
wenzelm@24800
  2213
* Former constant "List.op @" now named "List.append".  Use ML
wenzelm@24800
  2214
antiquotations @{const_name List.append} or @{term " ... @ ... "} to
wenzelm@24800
  2215
circumvent possible incompatibilities when working on ML level.
wenzelm@24800
  2216
haftmann@24996
  2217
* primrec: missing cases mapped to "undefined" instead of "arbitrary".
haftmann@22845
  2218
wenzelm@24800
  2219
* New function listsum :: 'a list => 'a for arbitrary monoids.
wenzelm@24800
  2220
Special syntax: "SUM x <- xs. f x" (and latex variants)
wenzelm@24800
  2221
wenzelm@24800
  2222
* New syntax for Haskell-like list comprehension (input only), eg.
wenzelm@25177
  2223
[(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
wenzelm@24800
  2224
wenzelm@24800
  2225
* The special syntax for function "filter" has changed from [x :
wenzelm@24800
  2226
xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
wenzelm@24800
  2227
comprehension syntax, and for uniformity.  INCOMPATIBILITY.
wenzelm@24800
  2228
wenzelm@24800
  2229
* [a..b] is now defined for arbitrary linear orders.  It used to be
wenzelm@24800
  2230
defined on nat only, as an abbreviation for [a..<Suc b]
wenzelm@24800
  2231
INCOMPATIBILITY.
wenzelm@24800
  2232
wenzelm@24800
  2233
* Renamed lemma "set_take_whileD"  to "set_takeWhileD".
wenzelm@24800
  2234
wenzelm@25177
  2235
* New functions "sorted" and "sort" in src/HOL/List.thy.
wenzelm@24800
  2236
wenzelm@24800
  2237
* New lemma collection field_simps (an extension of ring_simps) for
wenzelm@24800
  2238
manipulating (in)equations involving division. Multiplies with all
wenzelm@24800
  2239
denominators that can be proved to be non-zero (in equations) or
wenzelm@24800
  2240
positive/negative (in inequations).
nipkow@23480
  2241
nipkow@23480
  2242
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
wenzelm@24800
  2243
have been improved and renamed to ring_simps, group_simps and
wenzelm@24800
  2244
ring_distribs.  Removed lemmas field_xyz in theory Ring_and_Field
wenzelm@24800
  2245
because they were subsumed by lemmas xyz.  INCOMPATIBILITY.
wenzelm@24800
  2246
wenzelm@25177
  2247
* Theory Library/Commutative_Ring: switched from recdef to function
wenzelm@24800
  2248
package; constants add, mul, pow now curried.  Infix syntax for
wenzelm@24800
  2249
algebraic operations.
haftmann@22735
  2250
wenzelm@24800
  2251
* Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
haftmann@22218
  2252
INCOMPATIBILITY.
haftmann@22218
  2253
wenzelm@24800
  2254
* Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
haftmann@22218
  2255
INCOMPATIBILITY.
haftmann@22218
  2256
wenzelm@22126
  2257
* HOL/records: generalised field-update to take a function on the
wenzelm@22126
  2258
field rather than the new value: r(|A := x|) is translated to A_update
wenzelm@22126
  2259
(K x) r The K-combinator that is internally used is called K_record.
schirmer@21226
  2260
INCOMPATIBILITY: Usage of the plain update functions has to be
schirmer@21226
  2261
adapted.
schirmer@21226
  2262
 
wenzelm@24800
  2263
* Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
wenzelm@24800
  2264
* x = 0, which are required for a semiring.  Richer structures do not
wenzelm@24800
  2265
inherit from semiring_0 anymore, because this property is a theorem
wenzelm@24800
  2266
there, not an axiom.  INCOMPATIBILITY: In instances of semiring_0,
wenzelm@24800
  2267
there is more to prove, but this is mostly trivial.
wenzelm@24800
  2268
wenzelm@24800
  2269
* Class "recpower" is generalized to arbitrary monoids, not just
wenzelm@24800
  2270
commutative semirings.  INCOMPATIBILITY: may need to incorporate
haftmann@25163
  2271
commutativity or semiring properties additionally.
haftmann@21215
  2272
haftmann@21099
  2273
* Constant "List.list_all2" in List.thy now uses authentic syntax.
wenzelm@24800
  2274
INCOMPATIBILITY: translations containing list_all2 may go wrong,
wenzelm@24800
  2275
better use 'abbreviation'.
wenzelm@24800
  2276
wenzelm@24800
  2277
* Renamed constant "List.op mem" to "List.member".  INCOMPATIBILITY.
wenzelm@24800
  2278
wenzelm@22126
  2279
* Numeral syntax: type 'bin' which was a mere type copy of 'int' has
wenzelm@24800
  2280
been abandoned in favour of plain 'int'.  INCOMPATIBILITY --
wenzelm@22126
  2281
significant changes for setting up numeral syntax for types:
wenzelm@24800
  2282
  - New constants Numeral.pred and Numeral.succ instead
haftmann@20485
  2283
      of former Numeral.bin_pred and Numeral.bin_succ.
haftmann@20485
  2284
  - Use integer operations instead of bin_add, bin_mult and so on.
haftmann@20485
  2285
  - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
haftmann@20485
  2286
  - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
haftmann@20485
  2287
wenzelm@25177
  2288
See src/HOL/Integ/IntArith.thy for an example setup.
wenzelm@25177
  2289
wenzelm@25177
  2290
* Command 'normal_form' computes the normal form of a term that may
wenzelm@25177
  2291
contain free variables.  For example ``normal_form "rev [a, b, c]"''
wenzelm@25177
  2292
produces ``[b, c, a]'' (without proof).  This command is suitable for
wenzelm@25177
  2293
heavy-duty computations because the functions are compiled to ML
wenzelm@25177
  2294
first.  Correspondingly, a method "normalization" is provided.  See
wenzelm@25177
  2295
further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
nipkow@19895
  2296
wenzelm@17996
  2297
* Alternative iff syntax "A <-> B" for equality on bool (with priority
wenzelm@17996
  2298
25 like -->); output depends on the "iff" print_mode, the default is
wenzelm@17996
  2299
"A = B" (with priority 50).
wenzelm@17996
  2300
wenzelm@21265
  2301
* Relations less (<) and less_eq (<=) are also available on type bool.
wenzelm@21265
  2302
Modified syntax to disallow nesting without explicit parentheses,
wenzelm@24800
  2303
e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z".  Potential
wenzelm@24800
  2304
INCOMPATIBILITY.
wenzelm@21265
  2305
nipkow@18674
  2306
* "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
nipkow@18674
  2307
krauss@20716
  2308
* Relation composition operator "op O" now has precedence 75 and binds
krauss@20716
  2309
stronger than union and intersection. INCOMPATIBILITY.
krauss@20716
  2310
wenzelm@22126
  2311
* The old set interval syntax "{m..n(}" (and relatives) has been
wenzelm@22126
  2312
removed.  Use "{m..<n}" (and relatives) instead.
nipkow@19377
  2313
wenzelm@17865
  2314
* In the context of the assumption "~(s = t)" the Simplifier rewrites
wenzelm@24800
  2315
"t = s" to False (by simproc "neq").  INCOMPATIBILITY, consider using
wenzelm@24800
  2316
``declare [[simproc del: neq]]''.
wenzelm@24800
  2317
wenzelm@24800
  2318
* Simplifier: "m dvd n" where m and n are numbers is evaluated to
wenzelm@24800
  2319
True/False.
wenzelm@24800
  2320
wenzelm@24800
  2321
* Theorem Cons_eq_map_conv no longer declared as "simp".
nipkow@19211
  2322
ballarin@19279
  2323
* Theorem setsum_mult renamed to setsum_right_distrib.
ballarin@19279
  2324
nipkow@19211
  2325
* Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
wenzelm@22126
  2326
``rule'' method.
wenzelm@22126
  2327
wenzelm@24800
  2328
* Reimplemented methods "sat" and "satx", with several improvements:
wenzelm@24800
  2329
goals no longer need to be stated as "<prems> ==> False", equivalences
wenzelm@24800
  2330
(i.e. "=" on type bool) are handled, variable names of the form
wenzelm@24800
  2331
"lit_<n>" are no longer reserved, significant speedup.
wenzelm@24800
  2332
wenzelm@24800
  2333
* Methods "sat" and "satx" can now replay MiniSat proof traces.
wenzelm@22126
  2334
zChaff is still supported as well.
wenzelm@22126
  2335
wenzelm@22126
  2336
* 'inductive' and 'datatype': provide projections of mutual rules,
wenzelm@22126
  2337
bundled as foo_bar.inducts;
wenzelm@22126
  2338
wenzelm@22126
  2339
* Library: moved theories Parity, GCD, Binomial, Infinite_Set to
wenzelm@22126
  2340
Library.
wenzelm@21256
  2341
wenzelm@21256
  2342
* Library: moved theory Accessible_Part to main HOL.
wenzelm@19572
  2343
wenzelm@18446
  2344
* Library: added theory Coinductive_List of potentially infinite lists
wenzelm@18446
  2345
as greatest fixed-point.
wenzelm@18399
  2346
wenzelm@19254
  2347
* Library: added theory AssocList which implements (finite) maps as
schirmer@19252
  2348
association lists.
webertj@17809
  2349
wenzelm@24800
  2350
* Method "evaluation" solves goals (i.e. a boolean expression)
wenzelm@24800
  2351
efficiently by compiling it to ML.  The goal is "proved" (via an
wenzelm@24800
  2352
oracle) if it evaluates to True.
wenzelm@20807
  2353
wenzelm@20807
  2354
* Linear arithmetic now splits certain operators (e.g. min, max, abs)
wenzelm@24800
  2355
also when invoked by the simplifier.  This results in the Simplifier
wenzelm@24800
  2356
being more powerful on arithmetic goals.  INCOMPATIBILITY.
wenzelm@24800
  2357
Configuration option fast_arith_split_limit=0 recovers the old
wenzelm@24800
  2358
behavior.
webertj@20217
  2359
wenzelm@22126
  2360
* Support for hex (0x20) and binary (0b1001) numerals.
wenzelm@19254
  2361
wenzelm@20807
  2362
* New method: reify eqs (t), where eqs are equations for an
wenzelm@20807
  2363
interpretation I :: 'a list => 'b => 'c and t::'c is an optional
wenzelm@20807
  2364
parameter, computes a term s::'b and a list xs::'a list and proves the
wenzelm@20807
  2365
theorem I xs s = t. This is also known as reification or quoting. The
wenzelm@20807
  2366
resulting theorem is applied to the subgoal to substitute t with I xs
wenzelm@20807
  2367
s.  If t is omitted, the subgoal itself is reified.
wenzelm@20807
  2368
wenzelm@20807
  2369
* New method: reflection corr_thm eqs (t). The parameters eqs and (t)
wenzelm@20807
  2370
are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
wenzelm@20807
  2371
where f is supposed to be a computable function (in the sense of code
wenzelm@20807
  2372
generattion). The method uses reify to compute s and xs as above then
wenzelm@20807
  2373
applies corr_thm and uses normalization by evaluation to "prove" f s =
wenzelm@20807
  2374
r and finally gets the theorem t = r, which is again applied to the
wenzelm@25177
  2375
subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
wenzelm@25177
  2376
wenzelm@25177
  2377
* Reflection: Automatic reification now handels binding, an example is
wenzelm@25177
  2378
available in src/HOL/ex/ReflectionEx.thy
wenzelm@20807
  2379
wenzelm@25397
  2380
* HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
schirmer@25409
  2381
command 'statespace' that is similar to 'record', but introduces an
wenzelm@25397
  2382
abstract specification based on the locale infrastructure instead of
wenzelm@25397
  2383
HOL types.  This leads to extra flexibility in composing state spaces,
wenzelm@25397
  2384
in particular multiple inheritance and renaming of components.
wenzelm@25397
  2385
wenzelm@25397
  2386
wenzelm@19653
  2387
*** HOL-Complex ***
wenzelm@19653
  2388
huffman@22971
  2389
* Hyperreal: Functions root and sqrt are now defined on negative real
huffman@22971
  2390
inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
huffman@22971
  2391
Nonnegativity side conditions have been removed from many lemmas, so
huffman@22971
  2392
that more subgoals may now be solved by simplification; potential
huffman@22971
  2393
INCOMPATIBILITY.
huffman@22971
  2394
wenzelm@24800
  2395
* Real: new type classes formalize real normed vector spaces and
huffman@21791
  2396
algebras, using new overloaded constants scaleR :: real => 'a => 'a
huffman@21791
  2397
and norm :: 'a => real.
huffman@21791
  2398
wenzelm@24800
  2399
* Real: constant of_real :: real => 'a::real_algebra_1 injects from
wenzelm@24800
  2400
reals into other types. The overloaded constant Reals :: 'a set is now
wenzelm@24800
  2401
defined as range of_real; potential INCOMPATIBILITY.
wenzelm@24800
  2402
wenzelm@24800
  2403
* Real: proper support for ML code generation, including 'quickcheck'.
nipkow@23013
  2404
Reals are implemented as arbitrary precision rationals.
nipkow@23013
  2405
wenzelm@22126
  2406
* Hyperreal: Several constants that previously worked only for the
wenzelm@22126
  2407
reals have been generalized, so they now work over arbitrary vector
wenzelm@22126
  2408
spaces. Type annotations may need to be added in some cases; potential
wenzelm@22126
  2409
INCOMPATIBILITY.
huffman@21791
  2410
huffman@22972
  2411
  Infinitesimal  :: ('a::real_normed_vector) star set
huffman@22972
  2412
  HFinite        :: ('a::real_normed_vector) star set
huffman@22972
  2413
  HInfinite      :: ('a::real_normed_vector) star set
huffman@21791
  2414
  approx         :: ('a::real_normed_vector) star => 'a star => bool
huffman@21791
  2415
  monad          :: ('a::real_normed_vector) star => 'a star set
huffman@21791
  2416
  galaxy         :: ('a::real_normed_vector) star => 'a star set
huffman@22972
  2417
  (NS)LIMSEQ     :: [nat => 'a::real_normed_vector, 'a] => bool
huffman@21791
  2418
  (NS)convergent :: (nat => 'a::real_normed_vector) => bool
huffman@21791
  2419
  (NS)Bseq       :: (nat => 'a::real_normed_vector) => bool
huffman@21791
  2420
  (NS)Cauchy     :: (nat => 'a::real_normed_vector) => bool
huffman@21791
  2421
  (NS)LIM        :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
huffman@21791
  2422
  is(NS)Cont     :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
huffman@21791
  2423
  deriv          :: ['a::real_normed_field => 'a, 'a, 'a] => bool
huffman@22972
  2424
  sgn            :: 'a::real_normed_vector => 'a
huffman@23116
  2425
  exp            :: 'a::{recpower,real_normed_field,banach} => 'a
huffman@21791
  2426
huffman@21791
  2427
* Complex: Some complex-specific constants are now abbreviations for
wenzelm@22126
  2428
overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
wenzelm@22126
  2429
hnorm.  Other constants have been entirely removed in favor of the
wenzelm@22126
  2430
polymorphic versions (INCOMPATIBILITY):
huffman@21791
  2431
huffman@21791
  2432
  approx        <-- capprox
huffman@21791
  2433
  HFinite       <-- CFinite
huffman@21791
  2434
  HInfinite     <-- CInfinite
huffman@21791
  2435
  Infinitesimal <-- CInfinitesimal
huffman@21791
  2436
  monad         <-- cmonad
huffman@21791
  2437
  galaxy        <-- cgalaxy
huffman@21791
  2438
  (NS)LIM       <-- (NS)CLIM, (NS)CRLIM
huffman@21791
  2439
  is(NS)Cont    <-- is(NS)Contc, is(NS)contCR
huffman@21791
  2440
  (ns)deriv     <-- (ns)cderiv
huffman@21791
  2441
wenzelm@19653
  2442
wenzelm@24801
  2443
*** HOL-Algebra ***
wenzelm@24801
  2444
wenzelm@24801
  2445
* Formalisation of ideals and the quotient construction over rings.
wenzelm@24801
  2446
wenzelm@24801
  2447
* Order and lattice theory no longer based on records.
wenzelm@24801
  2448
INCOMPATIBILITY.
wenzelm@24801
  2449
wenzelm@24801
  2450
* Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
wenzelm@24801
  2451
greatest_closed.  INCOMPATIBILITY.
wenzelm@24801
  2452
wenzelm@24801
  2453
* Method algebra is now set up via an attribute.  For examples see
wenzelm@24801
  2454
Ring.thy.  INCOMPATIBILITY: the method is now weaker on combinations
wenzelm@24801
  2455
of algebraic structures.
wenzelm@24801
  2456
wenzelm@24801
  2457
* Renamed theory CRing to Ring.
wenzelm@24801
  2458
wenzelm@24801
  2459
wenzelm@24801
  2460
*** HOL-Nominal ***
wenzelm@24801
  2461
wenzelm@25148
  2462
* Substantial, yet incomplete support for nominal datatypes (binding
wenzelm@25177
  2463
structures) based on HOL-Nominal logic.  See src/HOL/Nominal and
wenzelm@25177
  2464
src/HOL/Nominal/Examples.  Prospective users should consult
wenzelm@25148
  2465
http://isabelle.in.tum.de/nominal/
wenzelm@25148
  2466
wenzelm@24801
  2467
wenzelm@17878
  2468
*** ML ***
wenzelm@17878
  2469
wenzelm@24643
  2470
* ML basics: just one true type int, which coincides with IntInf.int
wenzelm@24643
  2471
(even on SML/NJ).
wenzelm@24643
  2472
wenzelm@22138
  2473
* ML within Isar: antiquotations allow to embed statically-checked
wenzelm@22138
  2474
formal entities in the source, referring to the context available at
wenzelm@22138
  2475
compile-time.  For example:
wenzelm@22138
  2476
wenzelm@25142
  2477
ML {* @{sort "{zero,one}"} *}
wenzelm@22138
  2478
ML {* @{typ "'a => 'b"} *}
wenzelm@22138
  2479
ML {* @{term "%x. x"} *}
wenzelm@22138
  2480
ML {* @{prop "x == y"} *}
wenzelm@22138
  2481
ML {* @{ctyp "'a => 'b"} *}
wenzelm@22138
  2482
ML {* @{cterm "%x. x"} *}
wenzelm@22138
  2483
ML {* @{cprop "x == y"} *}
wenzelm@22138
  2484
ML {* @{thm asm_rl} *}
wenzelm@22138
  2485
ML {* @{thms asm_rl} *}
wenzelm@24692
  2486
ML {* @{type_name c} *}
wenzelm@25142
  2487
ML {* @{type_syntax c} *}
wenzelm@22376
  2488
ML {* @{const_name c} *}
wenzelm@22376
  2489
ML {* @{const_syntax c} *}
wenzelm@22138
  2490
ML {* @{context} *}
wenzelm@22138
  2491
ML {* @{theory} *}
wenzelm@22138
  2492
ML {* @{theory Pure} *}
wenzelm@24692
  2493
ML {* @{theory_ref} *}
wenzelm@24692
  2494
ML {* @{theory_ref Pure} *}
wenzelm@22138
  2495
ML {* @{simpset} *}
wenzelm@22138
  2496
ML {* @{claset} *}
wenzelm@22138
  2497
ML {* @{clasimpset} *}
wenzelm@22138
  2498
wenzelm@22151
  2499
The same works for sources being ``used'' within an Isar context.
wenzelm@22151
  2500
wenzelm@22152
  2501
* ML in Isar: improved error reporting; extra verbosity with
wenzelm@24706
  2502
ML_Context.trace enabled.
wenzelm@22152
  2503
wenzelm@19032
  2504
* Pure/General/table.ML: the join operations now works via exceptions
wenzelm@24706
  2505
DUP/SAME instead of type option. This is simpler in simple cases, and
wenzelm@19081
  2506
admits slightly more efficient complex applications.
wenzelm@18446
  2507
wenzelm@24800
  2508
* Pure: 'advanced' translation functions (parse_translation etc.) now
wenzelm@24800
  2509
use Context.generic instead of just theory.
wenzelm@24800
  2510
wenzelm@18642
  2511
* Pure: datatype Context.generic joins theory/Proof.context and
wenzelm@18644
  2512
provides some facilities for code that works in either kind of
wenzelm@18642
  2513
context, notably GenericDataFun for uniform theory and proof data.
wenzelm@18642
  2514
wenzelm@18737
  2515
* Pure: simplified internal attribute type, which is now always
wenzelm@24706
  2516
Context.generic * thm -> Context.generic * thm. Global (theory) vs.
wenzelm@24706
  2517
local (Proof.context) attributes have been discontinued, while
wenzelm@24706
  2518
minimizing code duplication. Thm.rule_attribute and
wenzelm@24706
  2519
Thm.declaration_attribute build canonical attributes; see also structure
wenzelm@24706
  2520
Context for further operations on Context.generic, notably
wenzelm@24706
  2521
GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
wenzelm@19006
  2522
declarations and definitions.
wenzelm@19006
  2523
wenzelm@24800
  2524
* Context data interfaces (Theory/Proof/GenericDataFun): removed
wenzelm@24800
  2525
name/print, uninitialized data defaults to ad-hoc copy of empty value,
wenzelm@24800
  2526
init only required for impure data. INCOMPATIBILITY: empty really need
wenzelm@24800
  2527
to be empty (no dependencies on theory content!)
wenzelm@24800
  2528
wenzelm@19508
  2529
* Pure/kernel: consts certification ignores sort constraints given in
wenzelm@24800
  2530
signature declarations. (This information is not relevant to the
wenzelm@24800
  2531
logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
wenzelm@24800
  2532
potential INCOMPATIBILITY.
wenzelm@19508
  2533
wenzelm@19508
  2534
* Pure: axiomatic type classes are now purely definitional, with
wenzelm@19508
  2535
explicit proofs of class axioms and super class relations performed
wenzelm@24706
  2536
internally. See Pure/axclass.ML for the main internal interfaces --
wenzelm@19508
  2537
notably AxClass.define_class supercedes AxClass.add_axclass, and
wenzelm@24706
  2538
AxClass.axiomatize_class/classrel/arity supersede
wenzelm@19508
  2539
Sign.add_classes/classrel/arities.
wenzelm@19508
  2540
wenzelm@19006
  2541
* Pure/Isar: Args/Attrib parsers operate on Context.generic --
wenzelm@19006
  2542
global/local versions on theory vs. Proof.context have been
wenzelm@19006
  2543
discontinued; Attrib.syntax and Method.syntax have been adapted
wenzelm@19006
  2544
accordingly.  INCOMPATIBILITY, need to adapt parser expressions for
wenzelm@19006
  2545
attributes, methods, etc.
wenzelm@18642
  2546
wenzelm@18446
  2547
* Pure: several functions of signature "... -> theory -> theory * ..."
wenzelm@18446
  2548
have been reoriented to "... -> theory -> ... * theory" in order to
wenzelm@18446
  2549
allow natural usage in combination with the ||>, ||>>, |-> and
wenzelm@18446
  2550
fold_map combinators.
haftmann@18051
  2551
wenzelm@21647
  2552
* Pure: official theorem names (closed derivations) and additional
wenzelm@21647
  2553
comments (tags) are now strictly separate.  Name hints -- which are
wenzelm@21647
  2554
maintained as tags -- may be attached any time without affecting the
wenzelm@21647
  2555
derivation.
wenzelm@21647
  2556
wenzelm@18020
  2557
* Pure: primitive rule lift_rule now takes goal cterm instead of an
wenzelm@18145
  2558
actual goal state (thm).  Use Thm.lift_rule (Thm.cprem_of st i) to
wenzelm@18020
  2559
achieve the old behaviour.
wenzelm@18020
  2560
wenzelm@18020
  2561
* Pure: the "Goal" constant is now called "prop", supporting a
wenzelm@18020
  2562
slightly more general idea of ``protecting'' meta-level rule
wenzelm@18020
  2563
statements.
wenzelm@18020
  2564
wenzelm@20040
  2565
* Pure: Logic.(un)varify only works in a global context, which is now
wenzelm@20040
  2566
enforced instead of silently assumed.  INCOMPATIBILITY, may use
wenzelm@20040
  2567
Logic.legacy_(un)varify as temporary workaround.
wenzelm@20040
  2568
wenzelm@20090
  2569
* Pure: structure Name provides scalable operations for generating
wenzelm@20090
  2570
internal variable names, notably Name.variants etc.  This replaces
wenzelm@20090
  2571
some popular functions from term.ML:
wenzelm@20090
  2572
wenzelm@20090
  2573
  Term.variant		->  Name.variant
wenzelm@24800
  2574
  Term.variantlist	->  Name.variant_list
wenzelm@20090
  2575
  Term.invent_names	->  Name.invent_list
wenzelm@20090
  2576
wenzelm@20090
  2577
Note that low-level renaming rarely occurs in new code -- operations
wenzelm@20090
  2578
from structure Variable are used instead (see below).
wenzelm@20090
  2579
wenzelm@20040
  2580
* Pure: structure Variable provides fundamental operations for proper
wenzelm@20040
  2581
treatment of fixed/schematic variables in a context.  For example,
wenzelm@20040
  2582
Variable.import introduces fixes for schematics of given facts and
wenzelm@20040
  2583
Variable.export reverses the effect (up to renaming) -- this replaces
wenzelm@20040
  2584
various freeze_thaw operations.
wenzelm@20040
  2585
wenzelm@18567
  2586
* Pure: structure Goal provides simple interfaces for
wenzelm@17981
  2587
init/conclude/finish and tactical prove operations (replacing former
wenzelm@20040
  2588
Tactic.prove).  Goal.prove is the canonical way to prove results
wenzelm@20040
  2589
within a given context; Goal.prove_global is a degraded version for
wenzelm@20040
  2590
theory level goals, including a global Drule.standard.  Note that
wenzelm@20040
  2591
OldGoals.prove_goalw_cterm has long been obsolete, since it is
wenzelm@20040
  2592
ill-behaved in a local proof context (e.g. with local fixes/assumes or
wenzelm@20040
  2593
in a locale context).
wenzelm@17981
  2594
wenzelm@24706
  2595
* Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
wenzelm@24706
  2596
and type checking (Syntax.check_term etc.), with common combinations
wenzelm@24706
  2597
(Syntax.read_term etc.). These supersede former Sign.read_term etc.
wenzelm@24706
  2598
which are considered legacy and await removal.
wenzelm@24706
  2599
wenzelm@24920
  2600
* Pure/Syntax: generic interfaces for type unchecking
wenzelm@24920
  2601
(Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
wenzelm@24920
  2602
with common combinations (Syntax.pretty_term, Syntax.string_of_term
wenzelm@24920
  2603
etc.).  Former Sign.pretty_term, Sign.string_of_term etc. are still
wenzelm@24924
  2604
available for convenience, but refer to the very same operations using
wenzelm@24924
  2605
a mere theory instead of a full context.
wenzelm@24920
  2606
wenzelm@18815
  2607
* Isar: simplified treatment of user-level errors, using exception
wenzelm@18687
  2608
ERROR of string uniformly.  Function error now merely raises ERROR,
wenzelm@18686
  2609
without any side effect on output channels.  The Isar toplevel takes
wenzelm@18686
  2610
care of proper display of ERROR exceptions.  ML code may use plain
wenzelm@18686
  2611
handle/can/try; cat_error may be used to concatenate errors like this:
wenzelm@18686
  2612
wenzelm@18686
  2613
  ... handle ERROR msg => cat_error msg "..."
wenzelm@18686
  2614
wenzelm@18686
  2615
Toplevel ML code (run directly or through the Isar toplevel) may be
wenzelm@18687
  2616
embedded into the Isar toplevel with exception display/debug like
wenzelm@18687
  2617
this:
wenzelm@18686
  2618
wenzelm@18686
  2619
  Isar.toplevel (fn () => ...)
wenzelm@18686
  2620
wenzelm@18686
  2621
INCOMPATIBILITY, removed special transform_error facilities, removed
wenzelm@18686
  2622
obsolete variants of user-level exceptions (ERROR_MESSAGE,
wenzelm@18686
  2623
Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
wenzelm@18686
  2624
-- use plain ERROR instead.
wenzelm@18686
  2625
wenzelm@18815
  2626
* Isar: theory setup now has type (theory -> theory), instead of a
wenzelm@18722
  2627
list.  INCOMPATIBILITY, may use #> to compose setup functions.
wenzelm@18722
  2628
wenzelm@24706
  2629
* Isar: ML toplevel pretty printer for type Proof.context, subject to
wenzelm@24706
  2630
ProofContext.debug/verbose flags.