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