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