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