NEWS
author wenzelm
Sat Jan 28 17:28:48 2006 +0100 (2006-01-28)
changeset 18815 cb778c0ce1b5
parent 18738 b6925d782fae
child 18862 bd83590be0f7
permissions -rw-r--r--
Pure/Isar: (un)folded, (un)fold, unfolding support
object-level rewrite rules;
ML/Isar: installed ML toplevel pretty printer for type Proof.context;
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@17754
     4
New in this Isabelle release
wenzelm@17754
     5
----------------------------
wenzelm@17754
     6
wenzelm@17754
     7
*** General ***
wenzelm@17754
     8
wenzelm@17918
     9
* Theory syntax: the header format ``theory A = B + C:'' has been
wenzelm@17918
    10
discontinued in favour of ``theory A imports B C begin''.  Use isatool
wenzelm@17918
    11
fixheaders to convert existing theory files.  INCOMPATIBILITY.
wenzelm@17918
    12
wenzelm@17918
    13
* Theory syntax: the old non-Isar theory file format has been
wenzelm@17918
    14
discontinued altogether.  Note that ML proof scripts may still be used
wenzelm@17918
    15
with Isar theories; migration is usually quite simple with the ML
wenzelm@17918
    16
function use_legacy_bindings.  INCOMPATIBILITY.
wenzelm@17918
    17
wenzelm@17981
    18
* Legacy goal package: reduced interface to the bare minimum required
wenzelm@17981
    19
to keep existing proof scripts running.  Most other user-level
wenzelm@17981
    20
functions are now part of the OldGoals structure, which is *not* open
wenzelm@17981
    21
by default (consider isatool expandshort before open OldGoals).
wenzelm@17981
    22
Removed top_sg, prin, printyp, pprint_term/typ altogether, because
wenzelm@17981
    23
these tend to cause confusion about the actual goal (!) context being
wenzelm@17981
    24
used here, which is not necessarily the same as the_context().
wenzelm@17918
    25
wenzelm@17754
    26
* Command 'find_theorems': support "*" wildcard in "name:" criterion.
wenzelm@17754
    27
wenzelm@17754
    28
wenzelm@17865
    29
*** Document preparation ***
wenzelm@17865
    30
wenzelm@17869
    31
* Added antiquotations @{ML_type text} and @{ML_struct text} which
wenzelm@17869
    32
check the given source text as ML type/structure, printing verbatim.
wenzelm@17865
    33
wenzelm@17865
    34
wenzelm@17779
    35
*** Pure ***
wenzelm@17779
    36
wenzelm@17865
    37
* Isar: improper proof element 'guess' is like 'obtain', but derives
wenzelm@17865
    38
the obtained context from the course of reasoning!  For example:
wenzelm@17865
    39
wenzelm@17865
    40
  assume "EX x y. A x & B y"   -- "any previous fact"
wenzelm@17865
    41
  then guess x and y by clarify
wenzelm@17865
    42
wenzelm@17865
    43
This technique is potentially adventurous, depending on the facts and
wenzelm@17865
    44
proof tools being involved here.
wenzelm@17865
    45
wenzelm@18020
    46
* Isar: known facts from the proof context may be specified as literal
wenzelm@18020
    47
propositions, using ASCII back-quote syntax.  This works wherever
wenzelm@18020
    48
named facts used to be allowed so far, in proof commands, proof
wenzelm@18020
    49
methods, attributes etc.  Literal facts are retrieved from the context
wenzelm@18020
    50
according to unification of type and term parameters.  For example,
wenzelm@18020
    51
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
wenzelm@18020
    52
theorems in the current context, then these are valid literal facts:
wenzelm@18020
    53
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
wenzelm@18020
    54
wenzelm@18020
    55
There is also a proof method "fact" which does the same composition
wenzelm@18044
    56
for explicit goal states, e.g. the following proof texts coincide with
wenzelm@18044
    57
certain special cases of literal facts:
wenzelm@18020
    58
wenzelm@18020
    59
  have "A" by fact                 ==  note `A`
wenzelm@18020
    60
  have "A ==> B" by fact           ==  note `A ==> B`
wenzelm@18020
    61
  have "!!x. P x ==> Q x" by fact  ==  note `!!x. P x ==> Q x`
wenzelm@18020
    62
  have "P a ==> Q a" by fact       ==  note `P a ==> Q a`
wenzelm@18020
    63
wenzelm@18308
    64
* Isar: 'def' now admits simultaneous definitions, e.g.:
wenzelm@18308
    65
wenzelm@18308
    66
  def x == "t" and y == "u"
wenzelm@18308
    67
wenzelm@18540
    68
* Isar: added command 'unfolding', which is structurally similar to
wenzelm@18540
    69
'using', but affects both the goal state and facts by unfolding given
wenzelm@18815
    70
rewrite rules.  Thus many occurrences of the 'unfold' method or
wenzelm@18540
    71
'unfolded' attribute may be replaced by first-class proof text.
wenzelm@18540
    72
wenzelm@18815
    73
* Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
wenzelm@18815
    74
and command 'unfolding' now all support object-level equalities
wenzelm@18815
    75
(potentially conditional).  The underlying notion of rewrite rule is
wenzelm@18815
    76
analogous to the 'rule_format' attribute, but *not* that of the
wenzelm@18815
    77
Simplifier (which is usually more generous).
wenzelm@18815
    78
wenzelm@18233
    79
* Provers/induct: improved internal context management to support
wenzelm@18233
    80
local fixes and defines on-the-fly.  Thus explicit meta-level
wenzelm@18233
    81
connectives !! and ==> are rarely required anymore in inductive goals
wenzelm@18233
    82
(using object-logic connectives for this purpose has been long
wenzelm@18233
    83
obsolete anyway).  The subsequent proof patterns illustrate advanced
wenzelm@18233
    84
techniques of natural induction; general datatypes and inductive sets
wenzelm@18267
    85
work analogously (see also src/HOL/Lambda for realistic examples).
wenzelm@18267
    86
wenzelm@18267
    87
(1) This is how to ``strengthen'' an inductive goal wrt. certain
wenzelm@18239
    88
parameters:
wenzelm@18233
    89
wenzelm@18233
    90
  lemma
wenzelm@18233
    91
    fixes n :: nat and x :: 'a
wenzelm@18233
    92
    assumes a: "A n x"
wenzelm@18233
    93
    shows "P n x"
wenzelm@18233
    94
    using a                     -- {* make induct insert fact a *}
wenzelm@18233
    95
  proof (induct n fixing: x)    -- {* generalize goal to "!!x. A n x ==> P n x" *}
wenzelm@18248
    96
    case 0
wenzelm@18233
    97
    show ?case sorry
wenzelm@18233
    98
  next
wenzelm@18248
    99
    case (Suc n)
wenzelm@18239
   100
    note `!!x. A n x ==> P n x` -- {* induction hypothesis, according to induction rule *}
wenzelm@18239
   101
    note `A (Suc n) x`          -- {* induction premise, stemming from fact a *}
wenzelm@18233
   102
    show ?case sorry
wenzelm@18233
   103
  qed
wenzelm@18233
   104
wenzelm@18267
   105
(2) This is how to perform induction over ``expressions of a certain
wenzelm@18233
   106
form'', using a locally defined inductive parameter n == "a x"
wenzelm@18239
   107
together with strengthening (the latter is usually required to get
wenzelm@18267
   108
sufficiently flexible induction hypotheses):
wenzelm@18233
   109
wenzelm@18233
   110
  lemma
wenzelm@18233
   111
    fixes a :: "'a => nat"
wenzelm@18233
   112
    assumes a: "A (a x)"
wenzelm@18233
   113
    shows "P (a x)"
wenzelm@18233
   114
    using a
wenzelm@18233
   115
  proof (induct n == "a x" fixing: x)
wenzelm@18233
   116
    ...
wenzelm@18233
   117
wenzelm@18267
   118
See also HOL/Isar_examples/Puzzle.thy for an application of the this
wenzelm@18267
   119
particular technique.
wenzelm@18267
   120
wenzelm@18267
   121
(3) This is how to perform existential reasoning ('obtain') by
wenzelm@18267
   122
induction, while avoiding explicit object-logic encodings:
wenzelm@18267
   123
wenzelm@18267
   124
  fix n :: nat
wenzelm@18267
   125
  obtain x :: 'a where "P n x" and "Q n x"
wenzelm@18267
   126
  proof (induct n fixing: thesis)
wenzelm@18267
   127
    case 0
wenzelm@18267
   128
    obtain x where "P 0 x" and "Q 0 x" sorry
wenzelm@18399
   129
    then show thesis by (rule 0)
wenzelm@18267
   130
  next
wenzelm@18267
   131
    case (Suc n)
wenzelm@18267
   132
    obtain x where "P n x" and "Q n x" by (rule Suc.hyps)
wenzelm@18267
   133
    obtain x where "P (Suc n) x" and "Q (Suc n) x" sorry
wenzelm@18267
   134
    then show thesis by (rule Suc.prems)
wenzelm@18267
   135
  qed
wenzelm@18267
   136
wenzelm@18267
   137
Here the 'fixing: thesis' specification essentially modifies the scope
wenzelm@18267
   138
of the formal thesis parameter, in order to the get the whole
wenzelm@18267
   139
existence statement through the induction as expected.
wenzelm@18233
   140
wenzelm@18506
   141
* Provers/induct: mutual induction rules are now specified as a list
wenzelm@18506
   142
of rule sharing the same induction cases.  HOL packages usually
wenzelm@18506
   143
provide foo_bar.inducts for mutually defined items foo and bar
wenzelm@18506
   144
(e.g. inductive sets or datatypes).  INCOMPATIBILITY, users need to
wenzelm@18506
   145
specify mutual induction rules differently, i.e. like this:
wenzelm@18506
   146
wenzelm@18506
   147
  (induct rule: foo_bar.inducts)
wenzelm@18506
   148
  (induct set: foo bar)
wenzelm@18506
   149
  (induct type: foo bar)
wenzelm@18506
   150
wenzelm@18506
   151
The ML function ProjectRule.projections turns old-style rules into the
wenzelm@18506
   152
new format.
wenzelm@18506
   153
wenzelm@18506
   154
* Provers/induct: improved handling of simultaneous goals.  Instead of
wenzelm@18506
   155
introducing object-level conjunction, the statement is now split into
wenzelm@18506
   156
several conclusions, while the corresponding symbolic cases are
wenzelm@18601
   157
nested accordingly.  INCOMPATIBILITY, proofs need to be structured
wenzelm@18601
   158
explicitly.  For example:
wenzelm@18480
   159
wenzelm@18480
   160
  lemma
wenzelm@18480
   161
    fixes n :: nat
wenzelm@18480
   162
    shows "P n" and "Q n"
wenzelm@18480
   163
  proof (induct n)
wenzelm@18601
   164
    case 0 case 1
wenzelm@18480
   165
    show "P 0" sorry
wenzelm@18480
   166
  next
wenzelm@18601
   167
    case 0 case 2
wenzelm@18480
   168
    show "Q 0" sorry
wenzelm@18480
   169
  next
wenzelm@18601
   170
    case (Suc n) case 1
wenzelm@18480
   171
    note `P n` and `Q n`
wenzelm@18480
   172
    show "P (Suc n)" sorry
wenzelm@18480
   173
  next
wenzelm@18601
   174
    case (Suc n) case 2
wenzelm@18480
   175
    note `P n` and `Q n`
wenzelm@18480
   176
    show "Q (Suc n)" sorry
wenzelm@18480
   177
  qed
wenzelm@18480
   178
wenzelm@18601
   179
The split into subcases may be deferred as follows -- this is
wenzelm@18601
   180
particularly relevant for goal statements with local premises.
wenzelm@18601
   181
wenzelm@18601
   182
  lemma
wenzelm@18601
   183
    fixes n :: nat
wenzelm@18601
   184
    shows "A n ==> P n" and "B n ==> Q n"
wenzelm@18601
   185
  proof (induct n)
wenzelm@18601
   186
    case 0
wenzelm@18601
   187
    {
wenzelm@18601
   188
      case 1
wenzelm@18601
   189
      note `A 0`
wenzelm@18601
   190
      show "P 0" sorry
wenzelm@18601
   191
    next
wenzelm@18601
   192
      case 2
wenzelm@18601
   193
      note `B 0`
wenzelm@18601
   194
      show "Q 0" sorry
wenzelm@18601
   195
    }
wenzelm@18601
   196
  next
wenzelm@18601
   197
    case (Suc n)
wenzelm@18601
   198
    note `A n ==> P n` and `B n ==> Q n`
wenzelm@18601
   199
    {
wenzelm@18601
   200
      case 1
wenzelm@18601
   201
      note `A (Suc n)`
wenzelm@18601
   202
      show "P (Suc n)" sorry
wenzelm@18601
   203
    next
wenzelm@18601
   204
      case 2
wenzelm@18601
   205
      note `B (Suc n)`
wenzelm@18601
   206
      show "Q (Suc n)" sorry
wenzelm@18601
   207
    }
wenzelm@18601
   208
  qed
wenzelm@18601
   209
wenzelm@18506
   210
If simultaneous goals are to be used with mutual rules, the statement
wenzelm@18506
   211
needs to be structured carefully as a two-level conjunction, using
wenzelm@18506
   212
lists of propositions separated by 'and':
wenzelm@18506
   213
wenzelm@18507
   214
  lemma
wenzelm@18507
   215
    shows "a : A ==> P1 a"
wenzelm@18507
   216
          "a : A ==> P2 a"
wenzelm@18507
   217
      and "b : B ==> Q1 b"
wenzelm@18507
   218
          "b : B ==> Q2 b"
wenzelm@18507
   219
          "b : B ==> Q3 b"
wenzelm@18507
   220
  proof (induct set: A B)
wenzelm@18480
   221
wenzelm@18399
   222
* Provers/induct: support coinduction as well.  See
wenzelm@18399
   223
src/HOL/Library/Coinductive_List.thy for various examples.
wenzelm@18399
   224
nipkow@18674
   225
* Simplifier: by default the simplifier trace only shows top level rewrites
nipkow@18674
   226
now. That is, trace_simp_depth_limit is set to 1 by default. Thus there is
nipkow@18674
   227
less danger of being flooded by the trace. The trace indicates where parts
nipkow@18674
   228
have been suppressed.
nipkow@18674
   229
  
wenzelm@18536
   230
* Provers/classical: removed obsolete classical version of elim_format
wenzelm@18536
   231
attribute; classical elim/dest rules are now treated uniformly when
wenzelm@18536
   232
manipulating the claset.
wenzelm@18536
   233
wenzelm@18694
   234
* Provers/classical: stricter checks to ensure that supplied intro,
wenzelm@18694
   235
dest and elim rules are well-formed; dest and elim rules must have at
wenzelm@18694
   236
least one premise.
wenzelm@18694
   237
wenzelm@18694
   238
* Provers/classical: attributes dest/elim/intro take an optional
wenzelm@18695
   239
weight argument for the rule (just as the Pure versions).  Weights are
wenzelm@18696
   240
ignored by automated tools, but determine the search order of single
wenzelm@18694
   241
rule steps.
paulson@18557
   242
wenzelm@18536
   243
* Syntax: input syntax now supports dummy variable binding "%_. b",
wenzelm@18536
   244
where the body does not mention the bound variable.  Note that dummy
wenzelm@18536
   245
patterns implicitly depend on their context of bounds, which makes
wenzelm@18536
   246
"{_. _}" match any set comprehension as expected.  Potential
wenzelm@18536
   247
INCOMPATIBILITY -- parse translations need to cope with syntactic
wenzelm@18536
   248
constant "_idtdummy" in the binding position.
wenzelm@18536
   249
wenzelm@18536
   250
* Syntax: removed obsolete syntactic constant "_K" and its associated
wenzelm@18536
   251
parse translation.  INCOMPATIBILITY -- use dummy abstraction instead,
wenzelm@18536
   252
for example "A -> B" => "Pi A (%_. B)".
wenzelm@17779
   253
wenzelm@17865
   254
nipkow@17806
   255
*** HOL ***
nipkow@17806
   256
wenzelm@18694
   257
* Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
wenzelm@18694
   258
'rule' method.
wenzelm@18694
   259
wenzelm@17996
   260
* Alternative iff syntax "A <-> B" for equality on bool (with priority
wenzelm@17996
   261
25 like -->); output depends on the "iff" print_mode, the default is
wenzelm@17996
   262
"A = B" (with priority 50).
wenzelm@17996
   263
nipkow@18674
   264
* "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
nipkow@18674
   265
wenzelm@17865
   266
* In the context of the assumption "~(s = t)" the Simplifier rewrites
wenzelm@17865
   267
"t = s" to False (by simproc "neq_simproc").  For backward
wenzelm@17865
   268
compatibility this can be disabled by ML "reset use_neq_simproc".
wenzelm@17779
   269
webertj@17809
   270
* Tactics 'sat' and 'satx' reimplemented, several improvements: goals
webertj@17809
   271
no longer need to be stated as "<prems> ==> False", equivalences (i.e.
wenzelm@17865
   272
"=" on type bool) are handled, variable names of the form "lit_<n>"
wenzelm@17865
   273
are no longer reserved, significant speedup.
wenzelm@17865
   274
wenzelm@18480
   275
* inductive and datatype: provide projections of mutual rules, bundled
wenzelm@18480
   276
as foo_bar.inducts;
wenzelm@18480
   277
wenzelm@18446
   278
* Library: added theory Coinductive_List of potentially infinite lists
wenzelm@18446
   279
as greatest fixed-point.
wenzelm@18399
   280
webertj@17809
   281
wenzelm@17878
   282
*** ML ***
wenzelm@17878
   283
haftmann@18450
   284
* Pure/library:
haftmann@18450
   285
haftmann@18450
   286
  val burrow: ('a list -> 'b list) -> 'a list list -> 'b list list
haftmann@18549
   287
  val fold_burrow: ('a list -> 'c -> 'b list * 'd) -> 'a list list -> 'c -> 'b list list * 'd
haftmann@18450
   288
wenzelm@18540
   289
The semantics of "burrow" is: "take a function with *simulatanously*
wenzelm@18540
   290
transforms a list of value, and apply it *simulatanously* to a list of
wenzelm@18540
   291
list of values of the appropriate type". Confer this with "map" which
wenzelm@18540
   292
would *not* apply its argument function simulatanously but in
haftmann@18549
   293
sequence. "fold_burrow" has an additional context.
wenzelm@18540
   294
wenzelm@18540
   295
Both actually avoid the usage of "unflat" since they hide away
wenzelm@18540
   296
"unflat" from the user.
haftmann@18450
   297
wenzelm@18446
   298
* Pure/library: functions map2 and fold2 with curried syntax for
wenzelm@18446
   299
simultanous mapping and folding:
wenzelm@18446
   300
haftmann@18422
   301
    val map2: ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
haftmann@18422
   302
    val fold2: ('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> 'c -> 'c
haftmann@18422
   303
wenzelm@18446
   304
* Pure/library: indexed lists - some functions in the Isabelle library
wenzelm@18446
   305
treating lists over 'a as finite mappings from [0...n] to 'a have been
wenzelm@18446
   306
given more convenient names and signatures reminiscent of similar
wenzelm@18446
   307
functions for alists, tables, etc:
haftmann@18051
   308
haftmann@18051
   309
  val nth: 'a list -> int -> 'a 
haftmann@18051
   310
  val nth_update: int * 'a -> 'a list -> 'a list
haftmann@18051
   311
  val nth_map: int -> ('a -> 'a) -> 'a list -> 'a list
haftmann@18051
   312
  val fold_index: (int * 'a -> 'b -> 'b) -> 'a list -> 'b -> 'b
haftmann@18051
   313
wenzelm@18446
   314
Note that fold_index starts counting at index 0, not 1 like foldln
wenzelm@18446
   315
used to.
wenzelm@18446
   316
wenzelm@18446
   317
* Pure/General: name_mangler.ML provides a functor for generic name
wenzelm@18446
   318
mangling (bijective mapping from any expression values to strings).
wenzelm@18446
   319
wenzelm@18446
   320
* Pure/General: rat.ML implements rational numbers.
wenzelm@18446
   321
wenzelm@18642
   322
* Pure: datatype Context.generic joins theory/Proof.context and
wenzelm@18644
   323
provides some facilities for code that works in either kind of
wenzelm@18642
   324
context, notably GenericDataFun for uniform theory and proof data.
wenzelm@18642
   325
wenzelm@18737
   326
* Pure: simplified internal attribute type, which is now always
wenzelm@18737
   327
Context.generic * thm -> Context.generic * thm.  Global (theory)
wenzelm@18737
   328
vs. local (Proof.context) attributes have been discontinued, while
wenzelm@18738
   329
minimizing code duplication.  Thm.rule_attribute and
wenzelm@18738
   330
Thm.declaration_attribute build canonical attributes; see also
wenzelm@18738
   331
structure Context for further operations on Context.generic.
wenzelm@18737
   332
wenzelm@18737
   333
INCOMPATIBILITY, need to adapt attribute type declarations and
wenzelm@18737
   334
definitions.  Hint: make proper use of GenericDataFun and generic
wenzelm@18737
   335
Args/Attrib syntax instead of working around legacy code.
wenzelm@18642
   336
wenzelm@18446
   337
* Pure: several functions of signature "... -> theory -> theory * ..."
wenzelm@18446
   338
have been reoriented to "... -> theory -> ... * theory" in order to
wenzelm@18446
   339
allow natural usage in combination with the ||>, ||>>, |-> and
wenzelm@18446
   340
fold_map combinators.
haftmann@18051
   341
wenzelm@18020
   342
* Pure: primitive rule lift_rule now takes goal cterm instead of an
wenzelm@18145
   343
actual goal state (thm).  Use Thm.lift_rule (Thm.cprem_of st i) to
wenzelm@18020
   344
achieve the old behaviour.
wenzelm@18020
   345
wenzelm@18020
   346
* Pure: the "Goal" constant is now called "prop", supporting a
wenzelm@18020
   347
slightly more general idea of ``protecting'' meta-level rule
wenzelm@18020
   348
statements.
wenzelm@18020
   349
wenzelm@18567
   350
* Pure: structure Goal provides simple interfaces for
wenzelm@17981
   351
init/conclude/finish and tactical prove operations (replacing former
wenzelm@17981
   352
Tactic.prove).  Note that OldGoals.prove_goalw_cterm has long been
wenzelm@17981
   353
obsolete, it is ill-behaved in a local proof context (e.g. with local
wenzelm@17981
   354
fixes/assumes or in a locale context).
wenzelm@17981
   355
wenzelm@18815
   356
* Isar: simplified treatment of user-level errors, using exception
wenzelm@18687
   357
ERROR of string uniformly.  Function error now merely raises ERROR,
wenzelm@18686
   358
without any side effect on output channels.  The Isar toplevel takes
wenzelm@18686
   359
care of proper display of ERROR exceptions.  ML code may use plain
wenzelm@18686
   360
handle/can/try; cat_error may be used to concatenate errors like this:
wenzelm@18686
   361
wenzelm@18686
   362
  ... handle ERROR msg => cat_error msg "..."
wenzelm@18686
   363
wenzelm@18686
   364
Toplevel ML code (run directly or through the Isar toplevel) may be
wenzelm@18687
   365
embedded into the Isar toplevel with exception display/debug like
wenzelm@18687
   366
this:
wenzelm@18686
   367
wenzelm@18686
   368
  Isar.toplevel (fn () => ...)
wenzelm@18686
   369
wenzelm@18686
   370
INCOMPATIBILITY, removed special transform_error facilities, removed
wenzelm@18686
   371
obsolete variants of user-level exceptions (ERROR_MESSAGE,
wenzelm@18686
   372
Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
wenzelm@18686
   373
-- use plain ERROR instead.
wenzelm@18686
   374
wenzelm@18815
   375
* Isar: theory setup now has type (theory -> theory), instead of a
wenzelm@18722
   376
list.  INCOMPATIBILITY, may use #> to compose setup functions.
wenzelm@18722
   377
wenzelm@18815
   378
* Isar: installed ML toplevel pretty printer for type Proof.context,
wenzelm@18815
   379
subject to ProofContext.debug/verbose flags.
wenzelm@18815
   380
wenzelm@18815
   381
* Isar: Toplevel.theory_to_proof admits transactions that modify the
wenzelm@18815
   382
theory before entering a proof state.  Transactions now always see a
wenzelm@18815
   383
quasi-functional intermediate checkpoint, both in interactive and
wenzelm@18590
   384
batch mode.
wenzelm@18567
   385
wenzelm@17878
   386
* Simplifier: the simpset of a running simplification process now
wenzelm@17878
   387
contains a proof context (cf. Simplifier.the_context), which is the
wenzelm@17878
   388
very context that the initial simpset has been retrieved from (by
wenzelm@17890
   389
simpset_of/local_simpset_of).  Consequently, all plug-in components
wenzelm@17878
   390
(solver, looper etc.) may depend on arbitrary proof data.
wenzelm@17878
   391
wenzelm@17878
   392
* Simplifier.inherit_context inherits the proof context (plus the
wenzelm@17878
   393
local bounds) of the current simplification process; any simproc
wenzelm@17878
   394
etc. that calls the Simplifier recursively should do this!  Removed
wenzelm@17878
   395
former Simplifier.inherit_bounds, which is already included here --
wenzelm@17890
   396
INCOMPATIBILITY.  Tools based on low-level rewriting may even have to
wenzelm@17890
   397
specify an explicit context using Simplifier.context/theory_context.
wenzelm@17878
   398
wenzelm@17878
   399
* Simplifier/Classical Reasoner: more abstract interfaces
wenzelm@17878
   400
change_simpset/claset for modifying the simpset/claset reference of a
wenzelm@17878
   401
theory; raw versions simpset/claset_ref etc. have been discontinued --
wenzelm@17878
   402
INCOMPATIBILITY.
wenzelm@17878
   403
wenzelm@18540
   404
* Provers: more generic wrt. syntax of object-logics, avoid hardwired
wenzelm@18540
   405
"Trueprop" etc.
wenzelm@18540
   406
wenzelm@17878
   407
wenzelm@17754
   408
wenzelm@17720
   409
New in Isabelle2005 (October 2005)
wenzelm@17720
   410
----------------------------------
wenzelm@14655
   411
wenzelm@14655
   412
*** General ***
wenzelm@14655
   413
nipkow@15130
   414
* Theory headers: the new header syntax for Isar theories is
nipkow@15130
   415
nipkow@15130
   416
  theory <name>
wenzelm@16234
   417
  imports <theory1> ... <theoryN>
wenzelm@16234
   418
  uses <file1> ... <fileM>
nipkow@15130
   419
  begin
nipkow@15130
   420
wenzelm@16234
   421
where the 'uses' part is optional.  The previous syntax
wenzelm@16234
   422
wenzelm@16234
   423
  theory <name> = <theory1> + ... + <theoryN>:
wenzelm@16234
   424
wenzelm@16717
   425
will disappear in the next release.  Use isatool fixheaders to convert
wenzelm@16717
   426
existing theory files.  Note that there is no change in ancient
wenzelm@17371
   427
non-Isar theories now, but these will disappear soon.
nipkow@15130
   428
berghofe@15475
   429
* Theory loader: parent theories can now also be referred to via
wenzelm@16234
   430
relative and absolute paths.
wenzelm@16234
   431
wenzelm@17408
   432
* Command 'find_theorems' searches for a list of criteria instead of a
wenzelm@17408
   433
list of constants. Known criteria are: intro, elim, dest, name:string,
wenzelm@17408
   434
simp:term, and any term. Criteria can be preceded by '-' to select
wenzelm@17408
   435
theorems that do not match. Intro, elim, dest select theorems that
wenzelm@17408
   436
match the current goal, name:s selects theorems whose fully qualified
wenzelm@17408
   437
name contain s, and simp:term selects all simplification rules whose
wenzelm@17408
   438
lhs match term.  Any other term is interpreted as pattern and selects
wenzelm@17408
   439
all theorems matching the pattern. Available in ProofGeneral under
wenzelm@17408
   440
'ProofGeneral -> Find Theorems' or C-c C-f.  Example:
wenzelm@16234
   441
wenzelm@17275
   442
  C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
wenzelm@16234
   443
wenzelm@16234
   444
prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
wenzelm@16234
   445
matching the current goal as introduction rule and not having "HOL."
wenzelm@16234
   446
in their name (i.e. not being defined in theory HOL).
wenzelm@16013
   447
wenzelm@17408
   448
* Command 'thms_containing' has been discontinued in favour of
wenzelm@17408
   449
'find_theorems'; INCOMPATIBILITY.
wenzelm@17408
   450
wenzelm@17385
   451
* Communication with Proof General is now 8bit clean, which means that
wenzelm@17385
   452
Unicode text in UTF-8 encoding may be used within theory texts (both
wenzelm@17408
   453
formal and informal parts).  Cf. option -U of the Isabelle Proof
wenzelm@17538
   454
General interface.  Here are some simple examples (cf. src/HOL/ex):
wenzelm@17538
   455
wenzelm@17538
   456
  http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
wenzelm@17538
   457
  http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
wenzelm@17385
   458
wenzelm@17425
   459
* Improved efficiency of the Simplifier and, to a lesser degree, the
wenzelm@17425
   460
Classical Reasoner.  Typical big applications run around 2 times
wenzelm@17425
   461
faster.
wenzelm@17425
   462
wenzelm@15703
   463
wenzelm@15703
   464
*** Document preparation ***
wenzelm@15703
   465
wenzelm@16234
   466
* Commands 'display_drafts' and 'print_drafts' perform simple output
wenzelm@16234
   467
of raw sources.  Only those symbols that do not require additional
wenzelm@16234
   468
LaTeX packages (depending on comments in isabellesym.sty) are
wenzelm@16234
   469
displayed properly, everything else is left verbatim.  isatool display
wenzelm@16234
   470
and isatool print are used as front ends (these are subject to the
wenzelm@16234
   471
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
wenzelm@16234
   472
wenzelm@17047
   473
* Command tags control specific markup of certain regions of text,
wenzelm@17047
   474
notably folding and hiding.  Predefined tags include "theory" (for
wenzelm@17047
   475
theory begin and end), "proof" for proof commands, and "ML" for
wenzelm@17047
   476
commands involving ML code; the additional tags "visible" and
wenzelm@17047
   477
"invisible" are unused by default.  Users may give explicit tag
wenzelm@17047
   478
specifications in the text, e.g. ''by %invisible (auto)''.  The
wenzelm@17047
   479
interpretation of tags is determined by the LaTeX job during document
wenzelm@17047
   480
preparation: see option -V of isatool usedir, or options -n and -t of
wenzelm@17047
   481
isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
wenzelm@17047
   482
\isadroptag.
wenzelm@17047
   483
wenzelm@17047
   484
Several document versions may be produced at the same time via isatool
wenzelm@17047
   485
usedir (the generated index.html will link all of them).  Typical
wenzelm@17047
   486
specifications include ''-V document=theory,proof,ML'' to present
wenzelm@17047
   487
theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
wenzelm@17047
   488
proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
wenzelm@17047
   489
these parts without any formal replacement text.  The Isabelle site
wenzelm@17047
   490
default settings produce ''document'' and ''outline'' versions as
wenzelm@17047
   491
specified above.
wenzelm@16234
   492
haftmann@17402
   493
* Several new antiquotations:
wenzelm@15979
   494
wenzelm@15979
   495
  @{term_type term} prints a term with its type annotated;
wenzelm@15979
   496
wenzelm@15979
   497
  @{typeof term} prints the type of a term;
wenzelm@15979
   498
wenzelm@16234
   499
  @{const const} is the same as @{term const}, but checks that the
wenzelm@16234
   500
  argument is a known logical constant;
wenzelm@15979
   501
wenzelm@15979
   502
  @{term_style style term} and @{thm_style style thm} print a term or
wenzelm@16234
   503
  theorem applying a "style" to it
wenzelm@16234
   504
wenzelm@17117
   505
  @{ML text}
wenzelm@17117
   506
wenzelm@16234
   507
Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
wenzelm@16234
   508
definitions, equations, inequations etc., 'concl' printing only the
schirmer@17393
   509
conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
wenzelm@16234
   510
to print the specified premise.  TermStyle.add_style provides an ML
wenzelm@16234
   511
interface for introducing further styles.  See also the "LaTeX Sugar"
wenzelm@17117
   512
document practical applications.  The ML antiquotation prints
wenzelm@17117
   513
type-checked ML expressions verbatim.
wenzelm@16234
   514
wenzelm@17259
   515
* Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
wenzelm@17259
   516
and 'text' support optional locale specification '(in loc)', which
wenzelm@17269
   517
specifies the default context for interpreting antiquotations.  For
wenzelm@17269
   518
example: 'text (in lattice) {* @{thm inf_assoc}*}'.
wenzelm@17259
   519
wenzelm@17259
   520
* Option 'locale=NAME' of antiquotations specifies an alternative
wenzelm@17259
   521
context interpreting the subsequent argument.  For example: @{thm
wenzelm@17269
   522
[locale=lattice] inf_assoc}.
wenzelm@17259
   523
wenzelm@17097
   524
* Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
wenzelm@17097
   525
a proof context.
wenzelm@17097
   526
wenzelm@17097
   527
* Proper output of antiquotations for theory commands involving a
wenzelm@17097
   528
proof context (such as 'locale' or 'theorem (in loc) ...').
wenzelm@17097
   529
wenzelm@17193
   530
* Delimiters of outer tokens (string etc.) now produce separate LaTeX
wenzelm@17193
   531
macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
wenzelm@17193
   532
wenzelm@17193
   533
* isatool usedir: new option -C (default true) controls whether option
wenzelm@17193
   534
-D should include a copy of the original document directory; -C false
wenzelm@17193
   535
prevents unwanted effects such as copying of administrative CVS data.
wenzelm@17193
   536
wenzelm@16234
   537
wenzelm@16234
   538
*** Pure ***
wenzelm@16234
   539
wenzelm@16234
   540
* Considerably improved version of 'constdefs' command.  Now performs
wenzelm@16234
   541
automatic type-inference of declared constants; additional support for
wenzelm@16234
   542
local structure declarations (cf. locales and HOL records), see also
wenzelm@16234
   543
isar-ref manual.  Potential INCOMPATIBILITY: need to observe strictly
wenzelm@16234
   544
sequential dependencies of definitions within a single 'constdefs'
wenzelm@16234
   545
section; moreover, the declared name needs to be an identifier.  If
wenzelm@16234
   546
all fails, consider to fall back on 'consts' and 'defs' separately.
wenzelm@16234
   547
wenzelm@16234
   548
* Improved indexed syntax and implicit structures.  First of all,
wenzelm@16234
   549
indexed syntax provides a notational device for subscripted
wenzelm@16234
   550
application, using the new syntax \<^bsub>term\<^esub> for arbitrary
wenzelm@16234
   551
expressions.  Secondly, in a local context with structure
wenzelm@16234
   552
declarations, number indexes \<^sub>n or the empty index (default
wenzelm@16234
   553
number 1) refer to a certain fixed variable implicitly; option
wenzelm@16234
   554
show_structs controls printing of implicit structures.  Typical
wenzelm@16234
   555
applications of these concepts involve record types and locales.
wenzelm@16234
   556
wenzelm@16234
   557
* New command 'no_syntax' removes grammar declarations (and
wenzelm@16234
   558
translations) resulting from the given syntax specification, which is
wenzelm@16234
   559
interpreted in the same manner as for the 'syntax' command.
wenzelm@16234
   560
wenzelm@16234
   561
* 'Advanced' translation functions (parse_translation etc.) may depend
wenzelm@16234
   562
on the signature of the theory context being presently used for
wenzelm@16234
   563
parsing/printing, see also isar-ref manual.
wenzelm@16234
   564
wenzelm@16856
   565
* Improved 'oracle' command provides a type-safe interface to turn an
wenzelm@16856
   566
ML expression of type theory -> T -> term into a primitive rule of
wenzelm@16856
   567
type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
wenzelm@16856
   568
is already included here); see also FOL/ex/IffExample.thy;
wenzelm@16856
   569
INCOMPATIBILITY.
wenzelm@16856
   570
wenzelm@17275
   571
* axclass: name space prefix for class "c" is now "c_class" (was "c"
wenzelm@17275
   572
before); "cI" is no longer bound, use "c.intro" instead.
wenzelm@17275
   573
INCOMPATIBILITY.  This change avoids clashes of fact bindings for
wenzelm@17275
   574
axclasses vs. locales.
wenzelm@17275
   575
wenzelm@16234
   576
* Improved internal renaming of symbolic identifiers -- attach primes
wenzelm@16234
   577
instead of base 26 numbers.
wenzelm@16234
   578
wenzelm@16234
   579
* New flag show_question_marks controls printing of leading question
wenzelm@16234
   580
marks in schematic variable names.
wenzelm@16234
   581
wenzelm@16234
   582
* In schematic variable names, *any* symbol following \<^isub> or
wenzelm@16234
   583
\<^isup> is now treated as part of the base name.  For example, the
wenzelm@16234
   584
following works without printing of awkward ".0" indexes:
wenzelm@16234
   585
wenzelm@16234
   586
  lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
wenzelm@16234
   587
    by simp
wenzelm@16234
   588
wenzelm@16234
   589
* Inner syntax includes (*(*nested*) comments*).
wenzelm@16234
   590
wenzelm@17548
   591
* Pretty printer now supports unbreakable blocks, specified in mixfix
wenzelm@16234
   592
annotations as "(00...)".
wenzelm@16234
   593
wenzelm@16234
   594
* Clear separation of logical types and nonterminals, where the latter
wenzelm@16234
   595
may only occur in 'syntax' specifications or type abbreviations.
wenzelm@16234
   596
Before that distinction was only partially implemented via type class
wenzelm@16234
   597
"logic" vs. "{}".  Potential INCOMPATIBILITY in rare cases of improper
wenzelm@16234
   598
use of 'types'/'consts' instead of 'nonterminals'/'syntax'.  Some very
wenzelm@16234
   599
exotic syntax specifications may require further adaption
wenzelm@17691
   600
(e.g. Cube/Cube.thy).
wenzelm@16234
   601
wenzelm@16234
   602
* Removed obsolete type class "logic", use the top sort {} instead.
wenzelm@16234
   603
Note that non-logical types should be declared as 'nonterminals'
wenzelm@16234
   604
rather than 'types'.  INCOMPATIBILITY for new object-logic
wenzelm@16234
   605
specifications.
wenzelm@16234
   606
ballarin@17095
   607
* Attributes 'induct' and 'cases': type or set names may now be
ballarin@17095
   608
locally fixed variables as well.
ballarin@17095
   609
wenzelm@16234
   610
* Simplifier: can now control the depth to which conditional rewriting
wenzelm@16234
   611
is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
wenzelm@16234
   612
Limit.
wenzelm@16234
   613
wenzelm@16234
   614
* Simplifier: simplification procedures may now take the current
wenzelm@16234
   615
simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
wenzelm@16234
   616
interface), which is very useful for calling the Simplifier
wenzelm@16234
   617
recursively.  Minor INCOMPATIBILITY: the 'prems' argument of simprocs
wenzelm@16234
   618
is gone -- use prems_of_ss on the simpset instead.  Moreover, the
wenzelm@16234
   619
low-level mk_simproc no longer applies Logic.varify internally, to
wenzelm@16234
   620
allow for use in a context of fixed variables.
wenzelm@16234
   621
wenzelm@16234
   622
* thin_tac now works even if the assumption being deleted contains !!
wenzelm@16234
   623
or ==>.  More generally, erule now works even if the major premise of
wenzelm@16234
   624
the elimination rule contains !! or ==>.
wenzelm@16234
   625
wenzelm@17597
   626
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
nipkow@17590
   627
wenzelm@16234
   628
* Reorganized bootstrapping of the Pure theories; CPure is now derived
wenzelm@16234
   629
from Pure, which contains all common declarations already.  Both
wenzelm@16234
   630
theories are defined via plain Isabelle/Isar .thy files.
wenzelm@16234
   631
INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
wenzelm@16234
   632
CPure.elim / CPure.dest attributes) now appear in the Pure name space;
wenzelm@16234
   633
use isatool fixcpure to adapt your theory and ML sources.
wenzelm@16234
   634
wenzelm@16234
   635
* New syntax 'name(i-j, i-, i, ...)' for referring to specific
wenzelm@16234
   636
selections of theorems in named facts via index ranges.
wenzelm@16234
   637
wenzelm@17097
   638
* 'print_theorems': in theory mode, really print the difference
wenzelm@17097
   639
wrt. the last state (works for interactive theory development only),
wenzelm@17097
   640
in proof mode print all local facts (cf. 'print_facts');
wenzelm@17097
   641
wenzelm@17397
   642
* 'hide': option '(open)' hides only base names.
wenzelm@17397
   643
wenzelm@17275
   644
* More efficient treatment of intermediate checkpoints in interactive
wenzelm@17275
   645
theory development.
wenzelm@17275
   646
berghofe@17663
   647
* Code generator is now invoked via code_module (incremental code
wenzelm@17664
   648
generation) and code_library (modular code generation, ML structures
wenzelm@17664
   649
for each theory).  INCOMPATIBILITY: new keywords 'file' and 'contains'
wenzelm@17664
   650
must be quoted when used as identifiers.
wenzelm@17664
   651
wenzelm@17664
   652
* New 'value' command for reading, evaluating and printing terms using
wenzelm@17664
   653
the code generator.  INCOMPATIBILITY: command keyword 'value' must be
wenzelm@17664
   654
quoted when used as identifier.
berghofe@17663
   655
wenzelm@16234
   656
wenzelm@16234
   657
*** Locales ***
ballarin@17095
   658
wenzelm@17385
   659
* New commands for the interpretation of locale expressions in
wenzelm@17385
   660
theories (1), locales (2) and proof contexts (3).  These generate
wenzelm@17385
   661
proof obligations from the expression specification.  After the
wenzelm@17385
   662
obligations have been discharged, theorems of the expression are added
wenzelm@17385
   663
to the theory, target locale or proof context.  The synopsis of the
wenzelm@17385
   664
commands is a follows:
wenzelm@17385
   665
ballarin@17095
   666
  (1) interpretation expr inst
ballarin@17095
   667
  (2) interpretation target < expr
ballarin@17095
   668
  (3) interpret expr inst
wenzelm@17385
   669
ballarin@17095
   670
Interpretation in theories and proof contexts require a parameter
ballarin@17095
   671
instantiation of terms from the current context.  This is applied to
wenzelm@17385
   672
specifications and theorems of the interpreted expression.
wenzelm@17385
   673
Interpretation in locales only permits parameter renaming through the
wenzelm@17385
   674
locale expression.  Interpretation is smart in that interpretations
wenzelm@17385
   675
that are active already do not occur in proof obligations, neither are
wenzelm@17385
   676
instantiated theorems stored in duplicate.  Use 'print_interps' to
wenzelm@17385
   677
inspect active interpretations of a particular locale.  For details,
ballarin@17436
   678
see the Isar Reference manual.  Examples can be found in
ballarin@17436
   679
HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
wenzelm@16234
   680
wenzelm@16234
   681
INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
wenzelm@16234
   682
'interpret' instead.
wenzelm@16234
   683
wenzelm@17385
   684
* New context element 'constrains' for adding type constraints to
wenzelm@17385
   685
parameters.
wenzelm@17385
   686
wenzelm@17385
   687
* Context expressions: renaming of parameters with syntax
wenzelm@17385
   688
redeclaration.
ballarin@17095
   689
ballarin@17095
   690
* Locale declaration: 'includes' disallowed.
ballarin@17095
   691
wenzelm@16234
   692
* Proper static binding of attribute syntax -- i.e. types / terms /
wenzelm@16234
   693
facts mentioned as arguments are always those of the locale definition
wenzelm@16234
   694
context, independently of the context of later invocations.  Moreover,
wenzelm@16234
   695
locale operations (renaming and type / term instantiation) are applied
wenzelm@16234
   696
to attribute arguments as expected.
wenzelm@16234
   697
wenzelm@16234
   698
INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
wenzelm@16234
   699
actual attributes; rare situations may require Attrib.attribute to
wenzelm@16234
   700
embed those attributes into Attrib.src that lack concrete syntax.
wenzelm@16234
   701
Attribute implementations need to cooperate properly with the static
wenzelm@16234
   702
binding mechanism.  Basic parsers Args.XXX_typ/term/prop and
wenzelm@16234
   703
Attrib.XXX_thm etc. already do the right thing without further
wenzelm@16234
   704
intervention.  Only unusual applications -- such as "where" or "of"
wenzelm@16234
   705
(cf. src/Pure/Isar/attrib.ML), which process arguments depending both
wenzelm@16234
   706
on the context and the facts involved -- may have to assign parsed
wenzelm@16234
   707
values to argument tokens explicitly.
wenzelm@16234
   708
wenzelm@16234
   709
* Changed parameter management in theorem generation for long goal
wenzelm@16234
   710
statements with 'includes'.  INCOMPATIBILITY: produces a different
wenzelm@16234
   711
theorem statement in rare situations.
wenzelm@16234
   712
ballarin@17228
   713
* Locale inspection command 'print_locale' omits notes elements.  Use
ballarin@17228
   714
'print_locale!' to have them included in the output.
ballarin@17228
   715
wenzelm@16234
   716
wenzelm@16234
   717
*** Provers ***
wenzelm@16234
   718
wenzelm@16234
   719
* Provers/hypsubst.ML: improved version of the subst method, for
wenzelm@16234
   720
single-step rewriting: it now works in bound variable contexts. New is
wenzelm@16234
   721
'subst (asm)', for rewriting an assumption.  INCOMPATIBILITY: may
wenzelm@16234
   722
rewrite a different subterm than the original subst method, which is
wenzelm@16234
   723
still available as 'simplesubst'.
wenzelm@16234
   724
wenzelm@16234
   725
* Provers/quasi.ML: new transitivity reasoners for transitivity only
wenzelm@16234
   726
and quasi orders.
wenzelm@16234
   727
wenzelm@16234
   728
* Provers/trancl.ML: new transitivity reasoner for transitive and
wenzelm@16234
   729
reflexive-transitive closure of relations.
wenzelm@16234
   730
wenzelm@16234
   731
* Provers/blast.ML: new reference depth_limit to make blast's depth
wenzelm@16234
   732
limit (previously hard-coded with a value of 20) user-definable.
wenzelm@16234
   733
wenzelm@16234
   734
* Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
wenzelm@16234
   735
is peformed already.  Object-logics merely need to finish their
wenzelm@16234
   736
initial simpset configuration as before.  INCOMPATIBILITY.
wenzelm@15703
   737
berghofe@15475
   738
schirmer@14700
   739
*** HOL ***
schirmer@14700
   740
wenzelm@16234
   741
* Symbolic syntax of Hilbert Choice Operator is now as follows:
wenzelm@14878
   742
wenzelm@14878
   743
  syntax (epsilon)
wenzelm@14878
   744
    "_Eps" :: "[pttrn, bool] => 'a"    ("(3\<some>_./ _)" [0, 10] 10)
wenzelm@14878
   745
wenzelm@16234
   746
The symbol \<some> is displayed as the alternative epsilon of LaTeX
wenzelm@16234
   747
and x-symbol; use option '-m epsilon' to get it actually printed.
wenzelm@16234
   748
Moreover, the mathematically important symbolic identifier \<epsilon>
wenzelm@16234
   749
becomes available as variable, constant etc.  INCOMPATIBILITY,
wenzelm@16234
   750
wenzelm@16234
   751
* "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
wenzelm@16234
   752
Similarly for all quantifiers: "ALL x > y" etc.  The x-symbol for >=
wenzelm@17371
   753
is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
avigad@17016
   754
support corresponding Isar calculations.
wenzelm@16234
   755
wenzelm@16234
   756
* "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
wenzelm@16234
   757
instead of ":".
wenzelm@16234
   758
wenzelm@16234
   759
* theory SetInterval: changed the syntax for open intervals:
wenzelm@16234
   760
wenzelm@16234
   761
  Old       New
wenzelm@16234
   762
  {..n(}    {..<n}
wenzelm@16234
   763
  {)n..}    {n<..}
wenzelm@16234
   764
  {m..n(}   {m..<n}
wenzelm@16234
   765
  {)m..n}   {m<..n}
wenzelm@16234
   766
  {)m..n(}  {m<..<n}
wenzelm@16234
   767
wenzelm@16234
   768
The old syntax is still supported but will disappear in the next
wenzelm@16234
   769
release.  For conversion use the following Emacs search and replace
wenzelm@16234
   770
patterns (these are not perfect but work quite well):
nipkow@15046
   771
nipkow@15046
   772
  {)\([^\.]*\)\.\.  ->  {\1<\.\.}
nipkow@15046
   773
  \.\.\([^(}]*\)(}  ->  \.\.<\1}
nipkow@15046
   774
wenzelm@17533
   775
* Theory Commutative_Ring (in Library): method comm_ring for proving
wenzelm@17533
   776
equalities in commutative rings; method 'algebra' provides a generic
wenzelm@17533
   777
interface.
wenzelm@17389
   778
wenzelm@17389
   779
* Theory Finite_Set: changed the syntax for 'setsum', summation over
wenzelm@16234
   780
finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
wenzelm@17371
   781
now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
paulson@17189
   782
be a tuple pattern.
wenzelm@16234
   783
wenzelm@16234
   784
Some new syntax forms are available:
wenzelm@16234
   785
wenzelm@16234
   786
  "\<Sum>x | P. e"      for     "setsum (%x. e) {x. P}"
wenzelm@16234
   787
  "\<Sum>x = a..b. e"   for     "setsum (%x. e) {a..b}"
wenzelm@16234
   788
  "\<Sum>x = a..<b. e"  for     "setsum (%x. e) {a..<b}"
wenzelm@16234
   789
  "\<Sum>x < k. e"      for     "setsum (%x. e) {..<k}"
wenzelm@16234
   790
wenzelm@16234
   791
The latter form "\<Sum>x < k. e" used to be based on a separate
wenzelm@16234
   792
function "Summation", which has been discontinued.
wenzelm@16234
   793
wenzelm@16234
   794
* theory Finite_Set: in structured induction proofs, the insert case
wenzelm@16234
   795
is now 'case (insert x F)' instead of the old counterintuitive 'case
wenzelm@16234
   796
(insert F x)'.
wenzelm@16234
   797
wenzelm@16234
   798
* The 'refute' command has been extended to support a much larger
wenzelm@16234
   799
fragment of HOL, including axiomatic type classes, constdefs and
wenzelm@16234
   800
typedefs, inductive datatypes and recursion.
wenzelm@16234
   801
webertj@17700
   802
* New tactics 'sat' and 'satx' to prove propositional tautologies.
webertj@17700
   803
Requires zChaff with proof generation to be installed.  See
webertj@17700
   804
HOL/ex/SAT_Examples.thy for examples.
webertj@17619
   805
wenzelm@16234
   806
* Datatype induction via method 'induct' now preserves the name of the
wenzelm@16234
   807
induction variable. For example, when proving P(xs::'a list) by
wenzelm@16234
   808
induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
wenzelm@16234
   809
than P(list) ==> P(a#list) as previously.  Potential INCOMPATIBILITY
wenzelm@16234
   810
in unstructured proof scripts.
wenzelm@16234
   811
wenzelm@16234
   812
* Reworked implementation of records.  Improved scalability for
wenzelm@16234
   813
records with many fields, avoiding performance problems for type
wenzelm@16234
   814
inference. Records are no longer composed of nested field types, but
wenzelm@16234
   815
of nested extension types. Therefore the record type only grows linear
wenzelm@16234
   816
in the number of extensions and not in the number of fields.  The
wenzelm@16234
   817
top-level (users) view on records is preserved.  Potential
wenzelm@16234
   818
INCOMPATIBILITY only in strange cases, where the theory depends on the
wenzelm@16234
   819
old record representation. The type generated for a record is called
wenzelm@16234
   820
<record_name>_ext_type.
wenzelm@16234
   821
wenzelm@16234
   822
Flag record_quick_and_dirty_sensitive can be enabled to skip the
wenzelm@16234
   823
proofs triggered by a record definition or a simproc (if
wenzelm@16234
   824
quick_and_dirty is enabled).  Definitions of large records can take
wenzelm@16234
   825
quite long.
wenzelm@16234
   826
wenzelm@16234
   827
New simproc record_upd_simproc for simplification of multiple record
wenzelm@16234
   828
updates enabled by default.  Moreover, trivial updates are also
wenzelm@16234
   829
removed: r(|x := x r|) = r.  INCOMPATIBILITY: old proofs break
wenzelm@16234
   830
occasionally, since simplification is more powerful by default.
wenzelm@16234
   831
wenzelm@17275
   832
* typedef: proper support for polymorphic sets, which contain extra
wenzelm@17275
   833
type-variables in the term.
wenzelm@17275
   834
wenzelm@16234
   835
* Simplifier: automatically reasons about transitivity chains
wenzelm@16234
   836
involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
wenzelm@16234
   837
provided by Provers/trancl.ML as additional solvers.  INCOMPATIBILITY:
wenzelm@16234
   838
old proofs break occasionally as simplification may now solve more
wenzelm@16234
   839
goals than previously.
wenzelm@16234
   840
wenzelm@16234
   841
* Simplifier: converts x <= y into x = y if assumption y <= x is
wenzelm@16234
   842
present.  Works for all partial orders (class "order"), in particular
wenzelm@16234
   843
numbers and sets.  For linear orders (e.g. numbers) it treats ~ x < y
wenzelm@16234
   844
just like y <= x.
wenzelm@16234
   845
wenzelm@16234
   846
* Simplifier: new simproc for "let x = a in f x".  If a is a free or
wenzelm@16234
   847
bound variable or a constant then the let is unfolded.  Otherwise
wenzelm@16234
   848
first a is simplified to b, and then f b is simplified to g. If
wenzelm@16234
   849
possible we abstract b from g arriving at "let x = b in h x",
wenzelm@16234
   850
otherwise we unfold the let and arrive at g.  The simproc can be
wenzelm@16234
   851
enabled/disabled by the reference use_let_simproc.  Potential
wenzelm@16234
   852
INCOMPATIBILITY since simplification is more powerful by default.
webertj@15776
   853
paulson@16563
   854
* Classical reasoning: the meson method now accepts theorems as arguments.
paulson@16563
   855
paulson@17595
   856
* Prover support: pre-release of the Isabelle-ATP linkup, which runs background
paulson@17595
   857
jobs to provide advice on the provability of subgoals.
paulson@17595
   858
wenzelm@16891
   859
* Theory OrderedGroup and Ring_and_Field: various additions and
wenzelm@16891
   860
improvements to faciliate calculations involving equalities and
wenzelm@16891
   861
inequalities.
wenzelm@16891
   862
wenzelm@16891
   863
The following theorems have been eliminated or modified
wenzelm@16891
   864
(INCOMPATIBILITY):
avigad@16888
   865
avigad@16888
   866
  abs_eq             now named abs_of_nonneg
wenzelm@17371
   867
  abs_of_ge_0        now named abs_of_nonneg
wenzelm@17371
   868
  abs_minus_eq       now named abs_of_nonpos
avigad@16888
   869
  imp_abs_id         now named abs_of_nonneg
avigad@16888
   870
  imp_abs_neg_id     now named abs_of_nonpos
avigad@16888
   871
  mult_pos           now named mult_pos_pos
avigad@16888
   872
  mult_pos_le        now named mult_nonneg_nonneg
avigad@16888
   873
  mult_pos_neg_le    now named mult_nonneg_nonpos
avigad@16888
   874
  mult_pos_neg2_le   now named mult_nonneg_nonpos2
avigad@16888
   875
  mult_neg           now named mult_neg_neg
avigad@16888
   876
  mult_neg_le        now named mult_nonpos_nonpos
avigad@16888
   877
wenzelm@16891
   878
* Theory Parity: added rules for simplifying exponents.
wenzelm@16891
   879
nipkow@17092
   880
* Theory List:
nipkow@17092
   881
nipkow@17092
   882
The following theorems have been eliminated or modified
nipkow@17092
   883
(INCOMPATIBILITY):
nipkow@17092
   884
nipkow@17092
   885
  list_all_Nil       now named list_all.simps(1)
nipkow@17092
   886
  list_all_Cons      now named list_all.simps(2)
nipkow@17092
   887
  list_all_conv      now named list_all_iff
nipkow@17092
   888
  set_mem_eq         now named mem_iff
nipkow@17092
   889
wenzelm@16929
   890
* Theories SetsAndFunctions and BigO (see HOL/Library) support
wenzelm@16929
   891
asymptotic "big O" calculations.  See the notes in BigO.thy.
wenzelm@16929
   892
avigad@16888
   893
avigad@16888
   894
*** HOL-Complex ***
avigad@16888
   895
wenzelm@16891
   896
* Theory RealDef: better support for embedding natural numbers and
wenzelm@16891
   897
integers in the reals.
wenzelm@16891
   898
wenzelm@16891
   899
The following theorems have been eliminated or modified
wenzelm@16891
   900
(INCOMPATIBILITY):
wenzelm@16891
   901
avigad@17016
   902
  exp_ge_add_one_self  now requires no hypotheses
avigad@17016
   903
  real_of_int_add      reversed direction of equality (use [symmetric])
avigad@17016
   904
  real_of_int_minus    reversed direction of equality (use [symmetric])
avigad@17016
   905
  real_of_int_diff     reversed direction of equality (use [symmetric])
avigad@17016
   906
  real_of_int_mult     reversed direction of equality (use [symmetric])
wenzelm@16891
   907
wenzelm@16891
   908
* Theory RComplete: expanded support for floor and ceiling functions.
avigad@16888
   909
avigad@16962
   910
* Theory Ln is new, with properties of the natural logarithm
avigad@16962
   911
wenzelm@17423
   912
* Hyperreal: There is a new type constructor "star" for making
wenzelm@17423
   913
nonstandard types.  The old type names are now type synonyms:
wenzelm@17423
   914
wenzelm@17423
   915
  hypreal = real star
wenzelm@17423
   916
  hypnat = nat star
wenzelm@17423
   917
  hcomplex = complex star
wenzelm@17423
   918
wenzelm@17423
   919
* Hyperreal: Many groups of similarly-defined constants have been
huffman@17442
   920
replaced by polymorphic versions (INCOMPATIBILITY):
wenzelm@17423
   921
wenzelm@17423
   922
  star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
wenzelm@17423
   923
wenzelm@17423
   924
  starset      <-- starsetNat, starsetC
wenzelm@17423
   925
  *s*          <-- *sNat*, *sc*
wenzelm@17423
   926
  starset_n    <-- starsetNat_n, starsetC_n
wenzelm@17423
   927
  *sn*         <-- *sNatn*, *scn*
wenzelm@17423
   928
  InternalSets <-- InternalNatSets, InternalCSets
wenzelm@17423
   929
huffman@17442
   930
  starfun      <-- starfun{Nat,Nat2,C,RC,CR}
wenzelm@17423
   931
  *f*          <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
huffman@17442
   932
  starfun_n    <-- starfun{Nat,Nat2,C,RC,CR}_n
wenzelm@17423
   933
  *fn*         <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
huffman@17442
   934
  InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
wenzelm@17423
   935
wenzelm@17423
   936
* Hyperreal: Many type-specific theorems have been removed in favor of
huffman@17442
   937
theorems specific to various axiomatic type classes (INCOMPATIBILITY):
huffman@17442
   938
huffman@17442
   939
  add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
huffman@17442
   940
  add_assoc   <-- {hypreal,hypnat,hcomplex}_add_assocs
huffman@17442
   941
  OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
huffman@17442
   942
  OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
wenzelm@17423
   943
  right_minus <-- hypreal_add_minus
huffman@17442
   944
  left_minus <-- {hypreal,hcomplex}_add_minus_left
huffman@17442
   945
  mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
huffman@17442
   946
  mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
huffman@17442
   947
  mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
wenzelm@17423
   948
  mult_1_right <-- hcomplex_mult_one_right
wenzelm@17423
   949
  mult_zero_left <-- hcomplex_mult_zero_left
huffman@17442
   950
  left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
wenzelm@17423
   951
  right_distrib <-- hypnat_add_mult_distrib2
huffman@17442
   952
  zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
wenzelm@17423
   953
  right_inverse <-- hypreal_mult_inverse
wenzelm@17423
   954
  left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
huffman@17442
   955
  order_refl <-- {hypreal,hypnat}_le_refl
huffman@17442
   956
  order_trans <-- {hypreal,hypnat}_le_trans
huffman@17442
   957
  order_antisym <-- {hypreal,hypnat}_le_anti_sym
huffman@17442
   958
  order_less_le <-- {hypreal,hypnat}_less_le
huffman@17442
   959
  linorder_linear <-- {hypreal,hypnat}_le_linear
huffman@17442
   960
  add_left_mono <-- {hypreal,hypnat}_add_left_mono
huffman@17442
   961
  mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
wenzelm@17423
   962
  add_nonneg_nonneg <-- hypreal_le_add_order
wenzelm@17423
   963
wenzelm@17423
   964
* Hyperreal: Separate theorems having to do with type-specific
wenzelm@17423
   965
versions of constants have been merged into theorems that apply to the
huffman@17442
   966
new polymorphic constants (INCOMPATIBILITY):
huffman@17442
   967
huffman@17442
   968
  STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
huffman@17442
   969
  STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
huffman@17442
   970
  STAR_Un <-- {STAR,NatStar,STARC}_Un
huffman@17442
   971
  STAR_Int <-- {STAR,NatStar,STARC}_Int
huffman@17442
   972
  STAR_Compl <-- {STAR,NatStar,STARC}_Compl
huffman@17442
   973
  STAR_subset <-- {STAR,NatStar,STARC}_subset
huffman@17442
   974
  STAR_mem <-- {STAR,NatStar,STARC}_mem
huffman@17442
   975
  STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
huffman@17442
   976
  STAR_diff <-- {STAR,STARC}_diff
huffman@17442
   977
  STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
huffman@17442
   978
    STARC_hcomplex_of_complex}_image_subset
huffman@17442
   979
  starset_n_Un <-- starset{Nat,C}_n_Un
huffman@17442
   980
  starset_n_Int <-- starset{Nat,C}_n_Int
huffman@17442
   981
  starset_n_Compl <-- starset{Nat,C}_n_Compl
huffman@17442
   982
  starset_n_diff <-- starset{Nat,C}_n_diff
huffman@17442
   983
  InternalSets_Un <-- Internal{Nat,C}Sets_Un
huffman@17442
   984
  InternalSets_Int <-- Internal{Nat,C}Sets_Int
huffman@17442
   985
  InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
huffman@17442
   986
  InternalSets_diff <-- Internal{Nat,C}Sets_diff
huffman@17442
   987
  InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
huffman@17442
   988
  InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
huffman@17442
   989
  starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
huffman@17442
   990
  starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
huffman@17442
   991
  starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
huffman@17442
   992
  starfun <-- starfun{Nat,Nat2,C,RC,CR}
huffman@17442
   993
  starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
huffman@17442
   994
  starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
huffman@17442
   995
  starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
huffman@17442
   996
  starfun_diff <-- starfun{C,RC,CR}_diff
huffman@17442
   997
  starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
huffman@17442
   998
  starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
huffman@17442
   999
  starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
huffman@17442
  1000
  starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
huffman@17442
  1001
  starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
huffman@17442
  1002
  starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
wenzelm@17423
  1003
  starfun_Id <-- starfunC_Id
huffman@17442
  1004
  starfun_approx <-- starfun{Nat,CR}_approx
huffman@17442
  1005
  starfun_capprox <-- starfun{C,RC}_capprox
wenzelm@17423
  1006
  starfun_abs <-- starfunNat_rabs
huffman@17442
  1007
  starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
huffman@17442
  1008
  starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
wenzelm@17423
  1009
  starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
huffman@17442
  1010
  starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
huffman@17442
  1011
  starfun_add_capprox <-- starfun{C,RC}_add_capprox
wenzelm@17423
  1012
  starfun_add_approx <-- starfunCR_add_approx
wenzelm@17423
  1013
  starfun_inverse_inverse <-- starfunC_inverse_inverse
huffman@17442
  1014
  starfun_divide <-- starfun{C,CR,RC}_divide
huffman@17442
  1015
  starfun_n <-- starfun{Nat,C}_n
huffman@17442
  1016
  starfun_n_mult <-- starfun{Nat,C}_n_mult
huffman@17442
  1017
  starfun_n_add <-- starfun{Nat,C}_n_add
wenzelm@17423
  1018
  starfun_n_add_minus <-- starfunNat_n_add_minus
huffman@17442
  1019
  starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
huffman@17442
  1020
  starfun_n_minus <-- starfun{Nat,C}_n_minus
huffman@17442
  1021
  starfun_n_eq <-- starfun{Nat,C}_n_eq
huffman@17442
  1022
huffman@17442
  1023
  star_n_add <-- {hypreal,hypnat,hcomplex}_add
huffman@17442
  1024
  star_n_minus <-- {hypreal,hcomplex}_minus
huffman@17442
  1025
  star_n_diff <-- {hypreal,hcomplex}_diff
huffman@17442
  1026
  star_n_mult <-- {hypreal,hcomplex}_mult
huffman@17442
  1027
  star_n_inverse <-- {hypreal,hcomplex}_inverse
huffman@17442
  1028
  star_n_le <-- {hypreal,hypnat}_le
huffman@17442
  1029
  star_n_less <-- {hypreal,hypnat}_less
huffman@17442
  1030
  star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
huffman@17442
  1031
  star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
wenzelm@17423
  1032
  star_n_abs <-- hypreal_hrabs
wenzelm@17423
  1033
  star_n_divide <-- hcomplex_divide
wenzelm@17423
  1034
huffman@17442
  1035
  star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
huffman@17442
  1036
  star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
wenzelm@17423
  1037
  star_of_diff <-- hypreal_of_real_diff
huffman@17442
  1038
  star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
huffman@17442
  1039
  star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
huffman@17442
  1040
  star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
huffman@17442
  1041
  star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
huffman@17442
  1042
  star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
huffman@17442
  1043
  star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
huffman@17442
  1044
  star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
huffman@17442
  1045
  star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
huffman@17442
  1046
  star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
huffman@17442
  1047
  star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
huffman@17442
  1048
  star_of_number_of <-- {hypreal,hcomplex}_number_of
wenzelm@17423
  1049
  star_of_number_less <-- number_of_less_hypreal_of_real_iff
wenzelm@17423
  1050
  star_of_number_le <-- number_of_le_hypreal_of_real_iff
wenzelm@17423
  1051
  star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
wenzelm@17423
  1052
  star_of_less_number <-- hypreal_of_real_less_number_of_iff
wenzelm@17423
  1053
  star_of_le_number <-- hypreal_of_real_le_number_of_iff
wenzelm@17423
  1054
  star_of_power <-- hypreal_of_real_power
wenzelm@17423
  1055
  star_of_eq_0 <-- hcomplex_of_complex_zero_iff
wenzelm@17423
  1056
huffman@17442
  1057
* Hyperreal: new method "transfer" that implements the transfer
huffman@17442
  1058
principle of nonstandard analysis. With a subgoal that mentions
huffman@17442
  1059
nonstandard types like "'a star", the command "apply transfer"
huffman@17442
  1060
replaces it with an equivalent one that mentions only standard types.
huffman@17442
  1061
To be successful, all free variables must have standard types; non-
huffman@17442
  1062
standard variables must have explicit universal quantifiers.
huffman@17442
  1063
wenzelm@17641
  1064
* Hyperreal: A theory of Taylor series.
wenzelm@17641
  1065
wenzelm@14655
  1066
wenzelm@14682
  1067
*** HOLCF ***
wenzelm@14682
  1068
wenzelm@17533
  1069
* Discontinued special version of 'constdefs' (which used to support
wenzelm@17533
  1070
continuous functions) in favor of the general Pure one with full
wenzelm@17533
  1071
type-inference.
wenzelm@17533
  1072
wenzelm@17533
  1073
* New simplification procedure for solving continuity conditions; it
wenzelm@17533
  1074
is much faster on terms with many nested lambda abstractions (cubic
huffman@17442
  1075
instead of exponential time).
huffman@17442
  1076
wenzelm@17533
  1077
* New syntax for domain package: selector names are now optional.
huffman@17442
  1078
Parentheses should be omitted unless argument is lazy, for example:
huffman@17442
  1079
huffman@17442
  1080
  domain 'a stream = cons "'a" (lazy "'a stream")
huffman@17442
  1081
wenzelm@17533
  1082
* New command 'fixrec' for defining recursive functions with pattern
wenzelm@17533
  1083
matching; defining multiple functions with mutual recursion is also
wenzelm@17533
  1084
supported.  Patterns may include the constants cpair, spair, up, sinl,
wenzelm@17533
  1085
sinr, or any data constructor defined by the domain package. The given
wenzelm@17533
  1086
equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
wenzelm@17533
  1087
syntax and examples.
wenzelm@17533
  1088
wenzelm@17533
  1089
* New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
wenzelm@17533
  1090
of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
wenzelm@17533
  1091
but the proof obligation additionally includes an admissibility
wenzelm@17533
  1092
requirement. The packages generate instances of class cpo or pcpo,
wenzelm@17533
  1093
with continuity and strictness theorems for Rep and Abs.
huffman@17442
  1094
huffman@17584
  1095
* HOLCF: Many theorems have been renamed according to a more standard naming
huffman@17584
  1096
scheme (INCOMPATIBILITY):
huffman@17584
  1097
huffman@17584
  1098
  foo_inject:  "foo$x = foo$y ==> x = y"
huffman@17584
  1099
  foo_eq:      "(foo$x = foo$y) = (x = y)"
huffman@17584
  1100
  foo_less:    "(foo$x << foo$y) = (x << y)"
huffman@17584
  1101
  foo_strict:  "foo$UU = UU"
huffman@17584
  1102
  foo_defined: "... ==> foo$x ~= UU"
huffman@17584
  1103
  foo_defined_iff: "(foo$x = UU) = (x = UU)"
huffman@17584
  1104
wenzelm@14682
  1105
paulson@14885
  1106
*** ZF ***
paulson@14885
  1107
wenzelm@16234
  1108
* ZF/ex: theories Group and Ring provide examples in abstract algebra,
wenzelm@16234
  1109
including the First Isomorphism Theorem (on quotienting by the kernel
wenzelm@16234
  1110
of a homomorphism).
wenzelm@15089
  1111
wenzelm@15089
  1112
* ZF/Simplifier: install second copy of type solver that actually
wenzelm@16234
  1113
makes use of TC rules declared to Isar proof contexts (or locales);
wenzelm@16234
  1114
the old version is still required for ML proof scripts.
wenzelm@15703
  1115
wenzelm@15703
  1116
wenzelm@17445
  1117
*** Cube ***
wenzelm@17445
  1118
wenzelm@17445
  1119
* Converted to Isar theory format; use locales instead of axiomatic
wenzelm@17445
  1120
theories.
wenzelm@17445
  1121
wenzelm@17445
  1122
wenzelm@15703
  1123
*** ML ***
wenzelm@15703
  1124
wenzelm@15973
  1125
* Pure/library.ML no longer defines its own option datatype, but uses
wenzelm@16234
  1126
that of the SML basis, which has constructors NONE and SOME instead of
wenzelm@16234
  1127
None and Some, as well as exception Option.Option instead of OPTION.
wenzelm@16234
  1128
The functions the, if_none, is_some, is_none have been adapted
wenzelm@16234
  1129
accordingly, while Option.map replaces apsome.
wenzelm@15973
  1130
wenzelm@16860
  1131
* Pure/library.ML: the exception LIST has been given up in favour of
wenzelm@16860
  1132
the standard exceptions Empty and Subscript, as well as
wenzelm@16860
  1133
Library.UnequalLengths.  Function like Library.hd and Library.tl are
wenzelm@16860
  1134
superceded by the standard hd and tl functions etc.
wenzelm@16860
  1135
wenzelm@16860
  1136
A number of basic list functions are no longer exported to the ML
wenzelm@16860
  1137
toplevel, as they are variants of predefined functions.  The following
wenzelm@16234
  1138
suggests how one can translate existing code:
wenzelm@15973
  1139
wenzelm@15973
  1140
    rev_append xs ys = List.revAppend (xs, ys)
wenzelm@15973
  1141
    nth_elem (i, xs) = List.nth (xs, i)
wenzelm@15973
  1142
    last_elem xs = List.last xs
wenzelm@15973
  1143
    flat xss = List.concat xss
wenzelm@16234
  1144
    seq fs = List.app fs
wenzelm@15973
  1145
    partition P xs = List.partition P xs
wenzelm@15973
  1146
    mapfilter f xs = List.mapPartial f xs
wenzelm@15973
  1147
wenzelm@16860
  1148
* Pure/library.ML: several combinators for linear functional
wenzelm@16860
  1149
transformations, notably reverse application and composition:
wenzelm@16860
  1150
wenzelm@17371
  1151
  x |> f                f #> g
wenzelm@17371
  1152
  (x, y) |-> f          f #-> g
wenzelm@16860
  1153
haftmann@17495
  1154
* Pure/library.ML: introduced/changed precedence of infix operators:
haftmann@17495
  1155
haftmann@17495
  1156
  infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
haftmann@17495
  1157
  infix 2 ?;
haftmann@17495
  1158
  infix 3 o oo ooo oooo;
haftmann@17495
  1159
  infix 4 ~~ upto downto;
haftmann@17495
  1160
haftmann@17495
  1161
Maybe INCOMPATIBILITY when any of those is used in conjunction with other
haftmann@17495
  1162
infix operators.
haftmann@17495
  1163
wenzelm@17408
  1164
* Pure/library.ML: natural list combinators fold, fold_rev, and
haftmann@16869
  1165
fold_map support linear functional transformations and nesting.  For
wenzelm@16860
  1166
example:
wenzelm@16860
  1167
wenzelm@16860
  1168
  fold f [x1, ..., xN] y =
wenzelm@16860
  1169
    y |> f x1 |> ... |> f xN
wenzelm@16860
  1170
wenzelm@16860
  1171
  (fold o fold) f [xs1, ..., xsN] y =
wenzelm@16860
  1172
    y |> fold f xs1 |> ... |> fold f xsN
wenzelm@16860
  1173
wenzelm@16860
  1174
  fold f [x1, ..., xN] =
wenzelm@16860
  1175
    f x1 #> ... #> f xN
wenzelm@16860
  1176
wenzelm@16860
  1177
  (fold o fold) f [xs1, ..., xsN] =
wenzelm@16860
  1178
    fold f xs1 #> ... #> fold f xsN
wenzelm@16860
  1179
wenzelm@17408
  1180
* Pure/library.ML: the following selectors on type 'a option are
wenzelm@17408
  1181
available:
wenzelm@17408
  1182
wenzelm@17408
  1183
  the:               'a option -> 'a  (*partial*)
wenzelm@17408
  1184
  these:             'a option -> 'a  where 'a = 'b list
haftmann@17402
  1185
  the_default: 'a -> 'a option -> 'a
haftmann@17402
  1186
  the_list:          'a option -> 'a list
haftmann@17402
  1187
wenzelm@17408
  1188
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides
wenzelm@17408
  1189
basic operations for association lists, following natural argument
haftmann@17564
  1190
order; moreover the explicit equality predicate passed here avoids
haftmann@17495
  1191
potentially expensive polymorphic runtime equality checks.
haftmann@17495
  1192
The old functions may be expressed as follows:
wenzelm@17408
  1193
wenzelm@17408
  1194
  assoc = uncurry (AList.lookup (op =))
wenzelm@17408
  1195
  assocs = these oo AList.lookup (op =)
wenzelm@17408
  1196
  overwrite = uncurry (AList.update (op =)) o swap
wenzelm@17408
  1197
haftmann@17564
  1198
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides
haftmann@17564
  1199
haftmann@17564
  1200
  val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
haftmann@17564
  1201
  val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
haftmann@17564
  1202
haftmann@17564
  1203
replacing make_keylist and keyfilter (occassionally used)
haftmann@17564
  1204
Naive rewrites:
haftmann@17564
  1205
haftmann@17564
  1206
  make_keylist = AList.make
haftmann@17564
  1207
  keyfilter = AList.find (op =)
haftmann@17564
  1208
haftmann@17564
  1209
* eq_fst and eq_snd now take explicit equality parameter, thus
haftmann@17564
  1210
  avoiding eqtypes. Naive rewrites:
haftmann@17564
  1211
haftmann@17564
  1212
    eq_fst = eq_fst (op =)
haftmann@17564
  1213
    eq_snd = eq_snd (op =)
haftmann@17564
  1214
haftmann@17564
  1215
* Removed deprecated apl and apr (rarely used).
haftmann@17564
  1216
  Naive rewrites:
haftmann@17564
  1217
haftmann@17564
  1218
    apl (n, op) =>>= curry op n
haftmann@17564
  1219
    apr (op, m) =>>= fn n => op (n, m)
haftmann@17564
  1220
wenzelm@17408
  1221
* Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
wenzelm@17408
  1222
provides a reasonably efficient light-weight implementation of sets as
wenzelm@17408
  1223
lists.
wenzelm@17408
  1224
wenzelm@17408
  1225
* Pure/General: generic tables (cf. Pure/General/table.ML) provide a
wenzelm@17408
  1226
few new operations; existing lookup and update are now curried to
wenzelm@17408
  1227
follow natural argument order (for use with fold etc.);
wenzelm@17408
  1228
INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
wenzelm@17408
  1229
wenzelm@17408
  1230
* Pure/General: output via the Isabelle channels of
wenzelm@17408
  1231
writeln/warning/error etc. is now passed through Output.output, with a
wenzelm@17408
  1232
hook for arbitrary transformations depending on the print_mode
wenzelm@17408
  1233
(cf. Output.add_mode -- the first active mode that provides a output
wenzelm@17408
  1234
function wins).  Already formatted output may be embedded into further
wenzelm@17408
  1235
text via Output.raw; the result of Pretty.string_of/str_of and derived
wenzelm@17408
  1236
functions (string_of_term/cterm/thm etc.) is already marked raw to
wenzelm@17408
  1237
accommodate easy composition of diagnostic messages etc.  Programmers
wenzelm@17408
  1238
rarely need to care about Output.output or Output.raw at all, with
wenzelm@17408
  1239
some notable exceptions: Output.output is required when bypassing the
wenzelm@17408
  1240
standard channels (writeln etc.), or in token translations to produce
wenzelm@17408
  1241
properly formatted results; Output.raw is required when capturing
wenzelm@17408
  1242
already output material that will eventually be presented to the user
wenzelm@17408
  1243
a second time.  For the default print mode, both Output.output and
wenzelm@17408
  1244
Output.raw have no effect.
wenzelm@17408
  1245
wenzelm@17408
  1246
* Pure/General: Output.time_accumulator NAME creates an operator ('a
wenzelm@17408
  1247
-> 'b) -> 'a -> 'b to measure runtime and count invocations; the
wenzelm@17408
  1248
cumulative results are displayed at the end of a batch session.
wenzelm@17408
  1249
wenzelm@17408
  1250
* Pure/General: File.sysify_path and File.quote_sysify path have been
wenzelm@17408
  1251
replaced by File.platform_path and File.shell_path (with appropriate
wenzelm@17408
  1252
hooks).  This provides a clean interface for unusual systems where the
wenzelm@17408
  1253
internal and external process view of file names are different.
wenzelm@17408
  1254
wenzelm@16689
  1255
* Pure: more efficient orders for basic syntactic entities: added
wenzelm@16689
  1256
fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
wenzelm@16689
  1257
and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
wenzelm@16689
  1258
NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
wenzelm@16689
  1259
orders now -- potential INCOMPATIBILITY for code that depends on a
wenzelm@16689
  1260
particular order for Symtab.keys, Symtab.dest, etc. (consider using
wenzelm@16689
  1261
Library.sort_strings on result).
wenzelm@16689
  1262
wenzelm@17408
  1263
* Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
wenzelm@17408
  1264
fold_types traverse types/terms from left to right, observing natural
wenzelm@17408
  1265
argument order.  Supercedes previous foldl_XXX versions, add_frees,
wenzelm@17408
  1266
add_vars etc. have been adapted as well: INCOMPATIBILITY.
wenzelm@17408
  1267
wenzelm@16151
  1268
* Pure: name spaces have been refined, with significant changes of the
wenzelm@16234
  1269
internal interfaces -- INCOMPATIBILITY.  Renamed cond_extern(_table)
wenzelm@16234
  1270
to extern(_table).  The plain name entry path is superceded by a
wenzelm@16234
  1271
general 'naming' context, which also includes the 'policy' to produce
wenzelm@16234
  1272
a fully qualified name and external accesses of a fully qualified
wenzelm@16234
  1273
name; NameSpace.extend is superceded by context dependent
wenzelm@16234
  1274
Sign.declare_name.  Several theory and proof context operations modify
wenzelm@16234
  1275
the naming context.  Especially note Theory.restore_naming and
wenzelm@16234
  1276
ProofContext.restore_naming to get back to a sane state; note that
wenzelm@16234
  1277
Theory.add_path is no longer sufficient to recover from
wenzelm@16234
  1278
Theory.absolute_path in particular.
wenzelm@16234
  1279
wenzelm@16234
  1280
* Pure: new flags short_names (default false) and unique_names
wenzelm@16234
  1281
(default true) for controlling output of qualified names.  If
wenzelm@16234
  1282
short_names is set, names are printed unqualified.  If unique_names is
wenzelm@16234
  1283
reset, the name prefix is reduced to the minimum required to achieve
wenzelm@16234
  1284
the original result when interning again, even if there is an overlap
wenzelm@16234
  1285
with earlier declarations.
wenzelm@16151
  1286
wenzelm@16456
  1287
* Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
wenzelm@16456
  1288
now 'extend', and 'merge' gets an additional Pretty.pp argument
wenzelm@16456
  1289
(useful for printing error messages).  INCOMPATIBILITY.
wenzelm@16456
  1290
wenzelm@16456
  1291
* Pure: major reorganization of the theory context.  Type Sign.sg and
wenzelm@16456
  1292
Theory.theory are now identified, referring to the universal
wenzelm@16456
  1293
Context.theory (see Pure/context.ML).  Actual signature and theory
wenzelm@16456
  1294
content is managed as theory data.  The old code and interfaces were
wenzelm@16456
  1295
spread over many files and structures; the new arrangement introduces
wenzelm@16456
  1296
considerable INCOMPATIBILITY to gain more clarity:
wenzelm@16456
  1297
wenzelm@16456
  1298
  Context -- theory management operations (name, identity, inclusion,
wenzelm@16456
  1299
    parents, ancestors, merge, etc.), plus generic theory data;
wenzelm@16456
  1300
wenzelm@16456
  1301
  Sign -- logical signature and syntax operations (declaring consts,
wenzelm@16456
  1302
    types, etc.), plus certify/read for common entities;
wenzelm@16456
  1303
wenzelm@16456
  1304
  Theory -- logical theory operations (stating axioms, definitions,
wenzelm@16456
  1305
    oracles), plus a copy of logical signature operations (consts,
wenzelm@16456
  1306
    types, etc.); also a few basic management operations (Theory.copy,
wenzelm@16456
  1307
    Theory.merge, etc.)
wenzelm@16456
  1308
wenzelm@16456
  1309
The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
wenzelm@16456
  1310
etc.) as well as the sign field in Thm.rep_thm etc. have been retained
wenzelm@16456
  1311
for convenience -- they merely return the theory.
wenzelm@16456
  1312
wenzelm@17193
  1313
* Pure: type Type.tsig is superceded by theory in most interfaces.
wenzelm@17193
  1314
wenzelm@16547
  1315
* Pure: the Isar proof context type is already defined early in Pure
wenzelm@16547
  1316
as Context.proof (note that ProofContext.context and Proof.context are
wenzelm@16547
  1317
aliases, where the latter is the preferred name).  This enables other
wenzelm@16547
  1318
Isabelle components to refer to that type even before Isar is present.
wenzelm@16547
  1319
wenzelm@16373
  1320
* Pure/sign/theory: discontinued named name spaces (i.e. classK,
wenzelm@16373
  1321
typeK, constK, axiomK, oracleK), but provide explicit operations for
wenzelm@16373
  1322
any of these kinds.  For example, Sign.intern typeK is now
wenzelm@16373
  1323
Sign.intern_type, Theory.hide_space Sign.typeK is now
wenzelm@16373
  1324
Theory.hide_types.  Also note that former
wenzelm@16373
  1325
Theory.hide_classes/types/consts are now
wenzelm@16373
  1326
Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
wenzelm@16373
  1327
internalize their arguments!  INCOMPATIBILITY.
wenzelm@16373
  1328
wenzelm@16506
  1329
* Pure: get_thm interface (of PureThy and ProofContext) expects
wenzelm@16506
  1330
datatype thmref (with constructors Name and NameSelection) instead of
wenzelm@16506
  1331
plain string -- INCOMPATIBILITY;
wenzelm@16506
  1332
wenzelm@16151
  1333
* Pure: cases produced by proof methods specify options, where NONE
wenzelm@16234
  1334
means to remove case bindings -- INCOMPATIBILITY in
wenzelm@16234
  1335
(RAW_)METHOD_CASES.
wenzelm@16151
  1336
wenzelm@16373
  1337
* Pure: the following operations retrieve axioms or theorems from a
wenzelm@16373
  1338
theory node or theory hierarchy, respectively:
wenzelm@16373
  1339
wenzelm@16373
  1340
  Theory.axioms_of: theory -> (string * term) list
wenzelm@16373
  1341
  Theory.all_axioms_of: theory -> (string * term) list
wenzelm@16373
  1342
  PureThy.thms_of: theory -> (string * thm) list
wenzelm@16373
  1343
  PureThy.all_thms_of: theory -> (string * thm) list
wenzelm@16373
  1344
wenzelm@16718
  1345
* Pure: print_tac now outputs the goal through the trace channel.
wenzelm@16718
  1346
wenzelm@17408
  1347
* Isar toplevel: improved diagnostics, mostly for Poly/ML only.
wenzelm@17408
  1348
Reference Toplevel.debug (default false) controls detailed printing
wenzelm@17408
  1349
and tracing of low-level exceptions; Toplevel.profiling (default 0)
wenzelm@17408
  1350
controls execution profiling -- set to 1 for time and 2 for space
wenzelm@17408
  1351
(both increase the runtime).
wenzelm@17408
  1352
wenzelm@17408
  1353
* Isar session: The initial use of ROOT.ML is now always timed,
wenzelm@17408
  1354
i.e. the log will show the actual process times, in contrast to the
wenzelm@17408
  1355
elapsed wall-clock time that the outer shell wrapper produces.
wenzelm@17408
  1356
wenzelm@17408
  1357
* Simplifier: improved handling of bound variables (nameless
wenzelm@16997
  1358
representation, avoid allocating new strings).  Simprocs that invoke
wenzelm@16997
  1359
the Simplifier recursively should use Simplifier.inherit_bounds to
wenzelm@17720
  1360
avoid local name clashes.  Failure to do so produces warnings
wenzelm@17720
  1361
"Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
wenzelm@17720
  1362
for further details.
wenzelm@16234
  1363
wenzelm@17166
  1364
* ML functions legacy_bindings and use_legacy_bindings produce ML fact
wenzelm@17166
  1365
bindings for all theorems stored within a given theory; this may help
wenzelm@17166
  1366
in porting non-Isar theories to Isar ones, while keeping ML proof
wenzelm@17166
  1367
scripts for the time being.
wenzelm@17166
  1368
wenzelm@17457
  1369
* ML operator HTML.with_charset specifies the charset begin used for
wenzelm@17457
  1370
generated HTML files.  For example:
wenzelm@17457
  1371
wenzelm@17457
  1372
  HTML.with_charset "utf-8" use_thy "Hebrew";
wenzelm@17538
  1373
  HTML.with_charset "utf-8" use_thy "Chinese";
wenzelm@17457
  1374
wenzelm@16234
  1375
wenzelm@16234
  1376
*** System ***
wenzelm@16234
  1377
wenzelm@16234
  1378
* Allow symlinks to all proper Isabelle executables (Isabelle,
wenzelm@16234
  1379
isabelle, isatool etc.).
wenzelm@16234
  1380
wenzelm@16234
  1381
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for
wenzelm@16234
  1382
isatool doc, isatool mkdir, display_drafts etc.).
wenzelm@16234
  1383
wenzelm@16234
  1384
* isatool usedir: option -f allows specification of the ML file to be
wenzelm@16234
  1385
used by Isabelle; default is ROOT.ML.
wenzelm@16234
  1386
wenzelm@16251
  1387
* New isatool version outputs the version identifier of the Isabelle
wenzelm@16251
  1388
distribution being used.
wenzelm@16251
  1389
wenzelm@16251
  1390
* HOL: new isatool dimacs2hol converts files in DIMACS CNF format
wenzelm@16234
  1391
(containing Boolean satisfiability problems) into Isabelle/HOL
wenzelm@16234
  1392
theories.
wenzelm@15703
  1393
wenzelm@15703
  1394
wenzelm@14655
  1395
wenzelm@14606
  1396
New in Isabelle2004 (April 2004)
wenzelm@14606
  1397
--------------------------------
wenzelm@13280
  1398
skalberg@14171
  1399
*** General ***
skalberg@14171
  1400
ballarin@14398
  1401
* Provers/order.ML:  new efficient reasoner for partial and linear orders.
ballarin@14398
  1402
  Replaces linorder.ML.
ballarin@14398
  1403
wenzelm@14606
  1404
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
wenzelm@14606
  1405
  (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
skalberg@14173
  1406
  (\<a>...\<z>), are now considered normal letters, and can therefore
skalberg@14173
  1407
  be used anywhere where an ASCII letter (a...zA...Z) has until
skalberg@14173
  1408
  now. COMPATIBILITY: This obviously changes the parsing of some
skalberg@14173
  1409
  terms, especially where a symbol has been used as a binder, say
skalberg@14173
  1410
  '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
skalberg@14173
  1411
  as an identifier.  Fix it by inserting a space around former
skalberg@14173
  1412
  symbols.  Call 'isatool fixgreek' to try to fix parsing errors in
skalberg@14173
  1413
  existing theory and ML files.
skalberg@14171
  1414
paulson@14237
  1415
* Pure: Macintosh and Windows line-breaks are now allowed in theory files.
paulson@14237
  1416
wenzelm@14731
  1417
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
wenzelm@14731
  1418
  allowed in identifiers. Similar to Greek letters \<^isub> is now considered
wenzelm@14731
  1419
  a normal (but invisible) letter. For multiple letter subscripts repeat
wenzelm@14731
  1420
  \<^isub> like this: x\<^isub>1\<^isub>2.
kleing@14233
  1421
kleing@14333
  1422
* Pure: There are now sub-/superscripts that can span more than one
kleing@14333
  1423
  character. Text between \<^bsub> and \<^esub> is set in subscript in
wenzelm@14606
  1424
  ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
wenzelm@14606
  1425
  superscript. The new control characters are not identifier parts.
kleing@14333
  1426
schirmer@14561
  1427
* Pure: Control-symbols of the form \<^raw:...> will literally print the
wenzelm@14606
  1428
  content of "..." to the latex file instead of \isacntrl... . The "..."
wenzelm@14606
  1429
  may consist of any printable characters excluding the end bracket >.
schirmer@14361
  1430
paulson@14237
  1431
* Pure: Using new Isar command "finalconsts" (or the ML functions
paulson@14237
  1432
  Theory.add_finals or Theory.add_finals_i) it is now possible to
paulson@14237
  1433
  declare constants "final", which prevents their being given a definition
paulson@14237
  1434
  later.  It is useful for constants whose behaviour is fixed axiomatically
skalberg@14224
  1435
  rather than definitionally, such as the meta-logic connectives.
skalberg@14224
  1436
wenzelm@14606
  1437
* Pure: 'instance' now handles general arities with general sorts
wenzelm@14606
  1438
  (i.e. intersections of classes),
skalberg@14503
  1439
kleing@14547
  1440
* Presentation: generated HTML now uses a CSS style sheet to make layout
wenzelm@14731
  1441
  (somewhat) independent of content. It is copied from lib/html/isabelle.css.
kleing@14547
  1442
  It can be changed to alter the colors/layout of generated pages.
kleing@14547
  1443
wenzelm@14556
  1444
ballarin@14175
  1445
*** Isar ***
ballarin@14175
  1446
ballarin@14508
  1447
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
ballarin@14508
  1448
  cut_tac, subgoal_tac and thin_tac:
ballarin@14175
  1449
  - Now understand static (Isar) contexts.  As a consequence, users of Isar
ballarin@14175
  1450
    locales are no longer forced to write Isar proof scripts.
ballarin@14175
  1451
    For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
ballarin@14175
  1452
    emulations.
ballarin@14175
  1453
  - INCOMPATIBILITY: names of variables to be instantiated may no
ballarin@14211
  1454
    longer be enclosed in quotes.  Instead, precede variable name with `?'.
ballarin@14211
  1455
    This is consistent with the instantiation attribute "where".
ballarin@14211
  1456
ballarin@14257
  1457
* Attributes "where" and "of":
ballarin@14285
  1458
  - Now take type variables of instantiated theorem into account when reading
ballarin@14285
  1459
    the instantiation string.  This fixes a bug that caused instantiated
ballarin@14285
  1460
    theorems to have too special types in some circumstances.
ballarin@14285
  1461
  - "where" permits explicit instantiations of type variables.
ballarin@14257
  1462
wenzelm@14556
  1463
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm@14556
  1464
  current facts ("this"), admitting arbitrary combinations with "then"
wenzelm@14556
  1465
  and derived forms.
kleing@14283
  1466
ballarin@14211
  1467
* Locales:
ballarin@14211
  1468
  - Goal statements involving the context element "includes" no longer
ballarin@14211
  1469
    generate theorems with internal delta predicates (those ending on
ballarin@14211
  1470
    "_axioms") in the premise.
ballarin@14211
  1471
    Resolve particular premise with <locale>.intro to obtain old form.
ballarin@14211
  1472
  - Fixed bug in type inference ("unify_frozen") that prevented mix of target
ballarin@14211
  1473
    specification and "includes" elements in goal statement.
ballarin@14254
  1474
  - Rule sets <locale>.intro and <locale>.axioms no longer declared as
ballarin@14254
  1475
    [intro?] and [elim?] (respectively) by default.
ballarin@14508
  1476
  - Experimental command for instantiation of locales in proof contexts:
ballarin@14551
  1477
        instantiate <label>[<attrs>]: <loc>
ballarin@14508
  1478
    Instantiates locale <loc> and adds all its theorems to the current context
ballarin@14551
  1479
    taking into account their attributes.  Label and attrs are optional
ballarin@14551
  1480
    modifiers, like in theorem declarations.  If present, names of
ballarin@14551
  1481
    instantiated theorems are qualified with <label>, and the attributes
ballarin@14551
  1482
    <attrs> are applied after any attributes these theorems might have already.
ballarin@14551
  1483
      If the locale has assumptions, a chained fact of the form
ballarin@14508
  1484
    "<loc> t1 ... tn" is expected from which instantiations of the parameters
ballarin@14551
  1485
    are derived.  The command does not support old-style locales declared
ballarin@14551
  1486
    with "locale (open)".
ballarin@14551
  1487
      A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
ballarin@14175
  1488
ballarin@14175
  1489
* HOL: Tactic emulation methods induct_tac and case_tac understand static
ballarin@14175
  1490
  (Isar) contexts.
ballarin@14175
  1491
wenzelm@14556
  1492
kleing@14136
  1493
*** HOL ***
kleing@14136
  1494
kleing@14624
  1495
* Proof import: new image HOL4 contains the imported library from
kleing@14624
  1496
  the HOL4 system with about 2500 theorems. It is imported by
kleing@14624
  1497
  replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
kleing@14624
  1498
  can be used like any other Isabelle image.  See
kleing@14624
  1499
  HOL/Import/HOL/README for more information.
kleing@14624
  1500
ballarin@14398
  1501
* Simplifier:
ballarin@14398
  1502
  - Much improved handling of linear and partial orders.
ballarin@14398
  1503
    Reasoners for linear and partial orders are set up for type classes
ballarin@14398
  1504
    "linorder" and "order" respectively, and are added to the default simpset
ballarin@14398
  1505
    as solvers.  This means that the simplifier can build transitivity chains
ballarin@14398
  1506
    to solve goals from the assumptions.
ballarin@14398
  1507
  - INCOMPATIBILITY: old proofs break occasionally.  Typically, applications
ballarin@14398
  1508
    of blast or auto after simplification become unnecessary because the goal
ballarin@14398
  1509
    is solved by simplification already.
ballarin@14398
  1510
wenzelm@14731
  1511
* Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
paulson@14389
  1512
    all proved in axiomatic type classes for semirings, rings and fields.
paulson@14389
  1513
paulson@14389
  1514
* Numerics:
paulson@14389
  1515
  - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
wenzelm@14731
  1516
    now formalized using the Ring_and_Field theory mentioned above.
paulson@14389
  1517
  - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
paulson@14389
  1518
    than before, because now they are set up once in a generic manner.
wenzelm@14731
  1519
  - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
paulson@14480
  1520
    Look for the general versions in Ring_and_Field (and Power if they concern
paulson@14480
  1521
    exponentiation).
paulson@14389
  1522
paulson@14401
  1523
* Type "rat" of the rational numbers is now available in HOL-Complex.
paulson@14389
  1524
schirmer@14255
  1525
* Records:
schirmer@14255
  1526
  - Record types are now by default printed with their type abbreviation
schirmer@14255
  1527
    instead of the list of all field types. This can be configured via
schirmer@14255
  1528
    the reference "print_record_type_abbr".
wenzelm@14731
  1529
  - Simproc "record_upd_simproc" for simplification of multiple updates added
schirmer@14255
  1530
    (not enabled by default).
schirmer@14427
  1531
  - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
schirmer@14427
  1532
    EX x. x = sel r to True (not enabled by default).
schirmer@14255
  1533
  - Tactic "record_split_simp_tac" to split and simplify records added.
wenzelm@14731
  1534
kleing@14136
  1535
* 'specification' command added, allowing for definition by
skalberg@14224
  1536
  specification.  There is also an 'ax_specification' command that
skalberg@14224
  1537
  introduces the new constants axiomatically.
kleing@14136
  1538
nipkow@14375
  1539
* arith(_tac) is now able to generate counterexamples for reals as well.
nipkow@14375
  1540
ballarin@14399
  1541
* HOL-Algebra: new locale "ring" for non-commutative rings.
ballarin@14399
  1542
paulson@14243
  1543
* HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
kleing@14610
  1544
  definitions, thanks to Sava Krsti\'{c} and John Matthews.
kleing@14610
  1545
wenzelm@14731
  1546
* HOL-Matrix: a first theory for matrices in HOL with an application of
kleing@14610
  1547
  matrix theory to linear programming.
kleing@14136
  1548
nipkow@14380
  1549
* Unions and Intersections:
nipkow@15119
  1550
  The latex output syntax of UN and INT has been changed
nipkow@15119
  1551
  from "\Union x \in A. B" to "\Union_{x \in A} B"
nipkow@15119
  1552
  i.e. the index formulae has become a subscript.
nipkow@15119
  1553
  Similarly for "\Union x. B", and for \Inter instead of \Union.
nipkow@14380
  1554
kleing@14418
  1555
* Unions and Intersections over Intervals:
wenzelm@14731
  1556
  There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
wenzelm@14731
  1557
  also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
kleing@14418
  1558
  like in normal math, and corresponding versions for < and for intersection.
kleing@14418
  1559
nipkow@15677
  1560
* HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
nipkow@15677
  1561
  lexicographic dictonary ordering has been added as "lexord".
nipkow@15677
  1562
paulson@14401
  1563
* ML: the legacy theory structures Int and List have been removed. They had
paulson@14401
  1564
  conflicted with ML Basis Library structures having the same names.
nipkow@14380
  1565
webertj@14464
  1566
* 'refute' command added to search for (finite) countermodels.  Only works
webertj@14464
  1567
  for a fragment of HOL.  The installation of an external SAT solver is
webertj@14464
  1568
  highly recommended.  See "HOL/Refute.thy" for details.
webertj@14464
  1569
berghofe@14602
  1570
* 'quickcheck' command: Allows to find counterexamples by evaluating
berghofe@14602
  1571
  formulae under an assignment of free variables to random values.
berghofe@14602
  1572
  In contrast to 'refute', it can deal with inductive datatypes,
berghofe@14602
  1573
  but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
berghofe@14602
  1574
  for examples.
webertj@14464
  1575
wenzelm@14606
  1576
oheimb@14536
  1577
*** HOLCF ***
oheimb@14536
  1578
oheimb@14536
  1579
* Streams now come with concatenation and are part of the HOLCF image
oheimb@14536
  1580
wenzelm@14572
  1581
wenzelm@14572
  1582
kleing@14136
  1583
New in Isabelle2003 (May 2003)
wenzelm@14606
  1584
------------------------------
kleing@14136
  1585
wenzelm@13280
  1586
*** General ***
wenzelm@13280
  1587
berghofe@13618
  1588
* Provers/simplifier:
berghofe@13618
  1589
nipkow@13781
  1590
  - Completely reimplemented method simp (ML: Asm_full_simp_tac):
berghofe@13618
  1591
    Assumptions are now subject to complete mutual simplification,
berghofe@13618
  1592
    not just from left to right. The simplifier now preserves
berghofe@13618
  1593
    the order of assumptions.
berghofe@13618
  1594
berghofe@13618
  1595
    Potential INCOMPATIBILITY:
berghofe@13618
  1596
nipkow@13781
  1597
    -- simp sometimes diverges where the old version did
nipkow@13781
  1598
       not, e.g. invoking simp on the goal
berghofe@13618
  1599
berghofe@13618
  1600
        [| P (f x); y = x; f x = f y |] ==> Q
berghofe@13618
  1601
nipkow@13781
  1602
       now gives rise to the infinite reduction sequence
nipkow@13781
  1603
nipkow@13781
  1604
        P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
nipkow@13781
  1605
nipkow@13781
  1606
       Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
nipkow@13781
  1607
       kind of problem.
nipkow@13781
  1608
nipkow@13781
  1609
    -- Tactics combining classical reasoner and simplification (such as auto)
nipkow@13781
  1610
       are also affected by this change, because many of them rely on
nipkow@13781
  1611
       simp. They may sometimes diverge as well or yield a different numbers
nipkow@13781
  1612
       of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
nipkow@13781
  1613
       in case of problems. Sometimes subsequent calls to the classical
nipkow@13781
  1614
       reasoner will fail because a preceeding call to the simplifier too
nipkow@13781
  1615
       eagerly simplified the goal, e.g. deleted redundant premises.
berghofe@13618
  1616
berghofe@13618
  1617
  - The simplifier trace now shows the names of the applied rewrite rules
berghofe@13618
  1618
nipkow@13829
  1619
  - You can limit the number of recursive invocations of the simplifier
nipkow@13829
  1620
    during conditional rewriting (where the simplifie tries to solve the
nipkow@13829
  1621
    conditions before applying the rewrite rule):
nipkow@13829
  1622
    ML "simp_depth_limit := n"
nipkow@13829
  1623
    where n is an integer. Thus you can force termination where previously
nipkow@13829
  1624
    the simplifier would diverge.
nipkow@13829
  1625
ballarin@13835
  1626
  - Accepts free variables as head terms in congruence rules.  Useful in Isar.
nipkow@13829
  1627
ballarin@13938
  1628
  - No longer aborts on failed congruence proof.  Instead, the
ballarin@13938
  1629
    congruence is ignored.
ballarin@13938
  1630
berghofe@14008
  1631
* Pure: New generic framework for extracting programs from constructive
berghofe@14008
  1632
  proofs. See HOL/Extraction.thy for an example instantiation, as well
berghofe@14008
  1633
  as HOL/Extraction for some case studies.
berghofe@14008
  1634
nipkow@13868
  1635
* Pure: The main goal of the proof state is no longer shown by default, only
nipkow@13868
  1636
the subgoals. This behaviour is controlled by a new flag.
ballarin@13835
  1637
   PG menu: Isabelle/Isar -> Settings -> Show Main Goal
nipkow@13815
  1638
(ML: Proof.show_main_goal).
nipkow@13815
  1639
nipkow@13815
  1640
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all
nipkow@13815
  1641
rules whose conclusion matches subgoal 1:
nipkow@13815
  1642
      PG menu: Isabelle/Isar -> Show me -> matching rules
nipkow@13815
  1643
The rules are ordered by how closely they match the subgoal.
nipkow@13815
  1644
In particular, rules that solve a subgoal outright are displayed first
nipkow@13815
  1645
(or rather last, the way they are printed).
nipkow@13815
  1646
(ML: ProofGeneral.print_intros())
nipkow@13815
  1647
nipkow@13815
  1648
* Pure: New flag trace_unify_fail causes unification to print
nipkow@13781
  1649
diagnostic information (PG: in trace buffer) when it fails. This is
nipkow@13781
  1650
useful for figuring out why single step proofs like rule, erule or
nipkow@13781
  1651
assumption failed.
nipkow@13781
  1652
nipkow@13815
  1653
* Pure: Locale specifications now produce predicate definitions
wenzelm@13410
  1654
according to the body of text (covering assumptions modulo local
wenzelm@13410
  1655
definitions); predicate "loc_axioms" covers newly introduced text,
wenzelm@13410
  1656
while "loc" is cumulative wrt. all included locale expressions; the
wenzelm@13410
  1657
latter view is presented only on export into the global theory
wenzelm@13410
  1658
context; potential INCOMPATIBILITY, use "(open)" option to fall back
wenzelm@13410
  1659
on the old view without predicates;
wenzelm@13410
  1660
wenzelm@13459
  1661
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm@13459
  1662
parameters (as in CASL, for example); just specify something like
wenzelm@13459
  1663
``var x + var y + struct M'' as import;
wenzelm@13459
  1664
wenzelm@13463
  1665
* Pure: improved thms_containing: proper indexing of facts instead of
wenzelm@13463
  1666
raw theorems; check validity of results wrt. current name space;
wenzelm@13463
  1667
include local facts of proof configuration (also covers active
wenzelm@13541
  1668
locales), cover fixed variables in index; may use "_" in term
wenzelm@13541
  1669
specification; an optional limit for the number of printed facts may
wenzelm@13541
  1670
be given (the default is 40);
wenzelm@13541
  1671
wenzelm@13541
  1672
* Pure: disallow duplicate fact bindings within new-style theory files
wenzelm@13541
  1673
(batch-mode only);
wenzelm@13540
  1674
wenzelm@13463
  1675
* Provers: improved induct method: assumptions introduced by case
wenzelm@13463
  1676
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
wenzelm@13463
  1677
the goal statement); "foo" still refers to all facts collectively;
wenzelm@13463
  1678
paulson@13550
  1679
* Provers: the function blast.overloaded has been removed: all constants
paulson@13550
  1680
are regarded as potentially overloaded, which improves robustness in exchange
paulson@13550
  1681
for slight decrease in efficiency;
paulson@13550
  1682
nipkow@13781
  1683
* Provers/linorder: New generic prover for transitivity reasoning over
nipkow@13781
  1684
linear orders.  Note: this prover is not efficient!
nipkow@13781
  1685
wenzelm@13522
  1686
* Isar: preview of problems to finish 'show' now produce an error
wenzelm@13522
  1687
rather than just a warning (in interactive mode);
wenzelm@13522
  1688
wenzelm@13280
  1689
nipkow@13158
  1690
*** HOL ***
nipkow@13158
  1691
nipkow@13899
  1692
* arith(_tac)
nipkow@13899
  1693
nipkow@13899
  1694
 - Produces a counter example if it cannot prove a goal.
nipkow@13899
  1695
   Note that the counter example may be spurious if the goal is not a formula
nipkow@13899
  1696
   of quantifier-free linear arithmetic.
nipkow@13899
  1697
   In ProofGeneral the counter example appears in the trace buffer.
nipkow@13899
  1698
nipkow@13899
  1699
 - Knows about div k and mod k where k is a numeral of type nat or int.
nipkow@13899
  1700
nipkow@13899
  1701
 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
nipkow@13899
  1702
   linear arithmetic fails. This takes account of quantifiers and divisibility.
wenzelm@14731
  1703
   Presburger arithmetic can also be called explicitly via presburger(_tac).
nipkow@13899
  1704
nipkow@13899
  1705
* simp's arithmetic capabilities have been enhanced a bit: it now
nipkow@13899
  1706
takes ~= in premises into account (by performing a case split);
nipkow@13899
  1707
nipkow@13899
  1708
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands
nipkow@13899
  1709
are distributed over a sum of terms;
nipkow@13899
  1710
ballarin@13735
  1711
* New tactic "trans_tac" and method "trans" instantiate
ballarin@13735
  1712
Provers/linorder.ML for axclasses "order" and "linorder" (predicates
wenzelm@14731
  1713
"<=", "<" and "=").
wenzelm@14731
  1714
wenzelm@14731
  1715
* function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
paulson@13587
  1716
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
paulson@13587
  1717
wenzelm@13443
  1718
* 'typedef' command has new option "open" to suppress the set
wenzelm@13443
  1719
definition;
wenzelm@13443
  1720
wenzelm@13522
  1721
* functions Min and Max on finite sets have been introduced (theory
wenzelm@13522
  1722
Finite_Set);
nipkow@13492
  1723
wenzelm@13443
  1724
* attribute [symmetric] now works for relations as well; it turns
wenzelm@13443
  1725
(x,y) : R^-1 into (y,x) : R, and vice versa;
wenzelm@13443
  1726
nipkow@13613
  1727
* induct over a !!-quantified statement (say !!x1..xn):
nipkow@13613
  1728
  each "case" automatically performs "fix x1 .. xn" with exactly those names.
nipkow@13613
  1729
nipkow@13899
  1730
* Map: `empty' is no longer a constant but a syntactic abbreviation for
nipkow@13899
  1731
%x. None. Warning: empty_def now refers to the previously hidden definition
nipkow@13899
  1732
of the empty set.
nipkow@13899
  1733
ballarin@14018
  1734
* Algebra: formalization of classical algebra.  Intended as base for
ballarin@14018
  1735
any algebraic development in Isabelle.  Currently covers group theory
ballarin@14018
  1736
(up to Sylow's theorem) and ring theory (Universal Property of
ballarin@14018
  1737
Univariate Polynomials).  Contributions welcome;
paulson@13960
  1738
paulson@13960
  1739
* GroupTheory: deleted, since its material has been moved to Algebra;
paulson@13960
  1740
wenzelm@14731
  1741
* Complex: new directory of the complex numbers with numeric constants,
wenzelm@14731
  1742
nonstandard complex numbers, and some complex analysis, standard and
paulson@13966
  1743
nonstandard (Jacques Fleuriot);
paulson@13966
  1744
paulson@13966
  1745
* HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
paulson@13966
  1746
wenzelm@14731
  1747
* Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
paulson@13966
  1748
Fleuriot);
paulson@13960
  1749
wenzelm@13549
  1750
* Real/HahnBanach: updated and adapted to locales;
wenzelm@13549
  1751
ballarin@13995
  1752
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
ballarin@13995
  1753
Gray and Kramer);
paulson@13872
  1754
paulson@13872
  1755
* UNITY: added the Meier-Sanders theory of progress sets;
paulson@13872
  1756
kleing@14011
  1757
* MicroJava: bytecode verifier and lightweight bytecode verifier
kleing@14011
  1758
as abstract algorithms, instantiated to the JVM;
kleing@14011
  1759
schirmer@14010
  1760
* Bali: Java source language formalization. Type system, operational
schirmer@14010
  1761
semantics, axiomatic semantics. Supported language features:
schirmer@14010
  1762
classes, interfaces, objects,virtual methods, static methods,
schirmer@14010
  1763
static/instance fields, arrays, access modifiers, definite
schirmer@14010
  1764
assignment, exceptions.
wenzelm@13549
  1765
kleing@14011
  1766
wenzelm@13549
  1767
*** ZF ***
wenzelm@13549
  1768
webertj@15154
  1769
* ZF/Constructible: consistency proof for AC (Gdel's constructible
wenzelm@13549
  1770
universe, etc.);
wenzelm@13549
  1771
paulson@13872
  1772
* Main ZF: virtually all theories converted to new-style format;
nipkow@13518
  1773
wenzelm@13280
  1774
wenzelm@13478
  1775
*** ML ***
wenzelm@13478
  1776
wenzelm@13478
  1777
* Pure: Tactic.prove provides sane interface for internal proofs;
wenzelm@13478
  1778
omits the infamous "standard" operation, so this is more appropriate
wenzelm@13478
  1779
than prove_goalw_cterm in many situations (e.g. in simprocs);
wenzelm@13478
  1780
wenzelm@13478
  1781
* Pure: improved error reporting of simprocs;
wenzelm@13478
  1782
wenzelm@13478
  1783
* Provers: Simplifier.simproc(_i) provides sane interface for setting
wenzelm@13478
  1784
up simprocs;
wenzelm@13478
  1785
wenzelm@13478
  1786
kleing@13953
  1787
*** Document preparation ***
kleing@13953
  1788
kleing@13953
  1789
* uses \par instead of \\ for line breaks in theory text. This may
kleing@13953
  1790
shift some page breaks in large documents. To get the old behaviour
kleing@13953
  1791
use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
kleing@13953
  1792
wenzelm@14731
  1793
* minimized dependencies of isabelle.sty and isabellesym.sty on
kleing@13953
  1794
other packages
kleing@13953
  1795
kleing@13953
  1796
* \<euro> now needs package babel/greek instead of marvosym (which
kleing@13953
  1797
broke \Rightarrow)
kleing@13953
  1798
wenzelm@14731
  1799
* normal size for \<zero>...\<nine> (uses \mathbf instead of
kleing@13954
  1800
textcomp package)
kleing@13953
  1801
wenzelm@13280
  1802
wenzelm@14572
  1803
wenzelm@12984
  1804
New in Isabelle2002 (March 2002)
wenzelm@12984
  1805
--------------------------------
wenzelm@11474
  1806
wenzelm@11572
  1807
*** Document preparation ***
wenzelm@11572
  1808
wenzelm@11842
  1809
* greatly simplified document preparation setup, including more
wenzelm@11842
  1810
graceful interpretation of isatool usedir -i/-d/-D options, and more
wenzelm@11842
  1811
instructive isatool mkdir; users should basically be able to get
wenzelm@12899
  1812
started with "isatool mkdir HOL Test && isatool make"; alternatively,
wenzelm@12899
  1813
users may run a separate document processing stage manually like this:
wenzelm@12899
  1814
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm@11842
  1815
wenzelm@11842
  1816
* theory dependency graph may now be incorporated into documents;
wenzelm@11842
  1817
isatool usedir -g true will produce session_graph.eps/.pdf for use
wenzelm@11842
  1818
with \includegraphics of LaTeX;
wenzelm@11842
  1819
wenzelm@11864
  1820
* proper spacing of consecutive markup elements, especially text
wenzelm@11864
  1821
blocks after section headings;
wenzelm@11864
  1822
wenzelm@11572
  1823
* support bold style (for single symbols only), input syntax is like
wenzelm@11572
  1824
this: "\<^bold>\<alpha>" or "\<^bold>A";
wenzelm@11572
  1825
wenzelm@11814
  1826
* \<bullet> is now output as bold \cdot by default, which looks much
wenzelm@11572
  1827
better in printed text;
wenzelm@11572
  1828
wenzelm@11712
  1829
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm@11712
  1830
note that these symbols are currently unavailable in Proof General /
wenzelm@12769
  1831
X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
wenzelm@12690
  1832
wenzelm@12690
  1833
* isatool latex no longer depends on changed TEXINPUTS, instead
wenzelm@12690
  1834
isatool document copies the Isabelle style files to the target
wenzelm@12690
  1835
location;
wenzelm@11712
  1836
wenzelm@11572
  1837
wenzelm@11633
  1838
*** Isar ***
wenzelm@11633
  1839
wenzelm@12312
  1840
* Pure/Provers: improved proof by cases and induction;
wenzelm@12280
  1841
  - 'case' command admits impromptu naming of parameters (such as
wenzelm@12280
  1842
    "case (Suc n)");
wenzelm@12280
  1843
  - 'induct' method divinates rule instantiation from the inductive
wenzelm@12280
  1844
    claim; no longer requires excessive ?P bindings for proper
wenzelm@12280
  1845
    instantiation of cases;
wenzelm@12280
  1846
  - 'induct' method properly enumerates all possibilities of set/type
wenzelm@12280
  1847
    rules; as a consequence facts may be also passed through *type*
wenzelm@12280
  1848
    rules without further ado;
wenzelm@12280
  1849
  - 'induct' method now derives symbolic cases from the *rulified*
wenzelm@12280
  1850
    rule (before it used to rulify cases stemming from the internal
wenzelm@12280
  1851
    atomized version); this means that the context of a non-atomic
wenzelm@12280
  1852
    statement becomes is included in the hypothesis, avoiding the
wenzelm@12280
  1853
    slightly cumbersome show "PROP ?case" form;
wenzelm@12280
  1854
  - 'induct' may now use elim-style induction rules without chaining
wenzelm@12280
  1855
    facts, using ``missing'' premises from the goal state; this allows
wenzelm@12280
  1856
    rules stemming from inductive sets to be applied in unstructured
wenzelm@12280
  1857
    scripts, while still benefitting from proper handling of non-atomic
wenzelm@12280
  1858
    statements; NB: major inductive premises need to be put first, all
wenzelm@12280
  1859
    the rest of the goal is passed through the induction;
wenzelm@12280
  1860
  - 'induct' proper support for mutual induction involving non-atomic
wenzelm@12280
  1861
    rule statements (uses the new concept of simultaneous goals, see
wenzelm@12280
  1862
    below);
wenzelm@12853
  1863
  - append all possible rule selections, but only use the first
wenzelm@12853
  1864
    success (no backtracking);
wenzelm@11995
  1865
  - removed obsolete "(simplified)" and "(stripped)" options of methods;
wenzelm@12754
  1866
  - undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm@12754
  1867
  - added 'print_induct_rules' (covered by help item in recent Proof
wenzelm@12754
  1868
    General versions);
wenzelm@11995
  1869
  - moved induct/cases attributes to Pure, methods to Provers;
wenzelm@11995
  1870
  - generic method setup instantiated for FOL and HOL;
wenzelm@11986
  1871
wenzelm@12163
  1872
* Pure: support multiple simultaneous goal statements, for example
wenzelm@12163
  1873
"have a: A and b: B" (same for 'theorem' etc.); being a pure
wenzelm@12163
  1874
meta-level mechanism, this acts as if several individual goals had
wenzelm@12163
  1875
been stated separately; in particular common proof methods need to be
wenzelm@12163
  1876
repeated in order to cover all claims; note that a single elimination
wenzelm@12163
  1877
step is *not* sufficient to establish the two conjunctions, so this
wenzelm@12163
  1878
fails:
wenzelm@12163
  1879
wenzelm@12163
  1880
  assume "A & B" then have A and B ..   (*".." fails*)
wenzelm@12163
  1881
wenzelm@12163
  1882
better use "obtain" in situations as above; alternative refer to
wenzelm@12163
  1883
multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
wenzelm@12163
  1884
wenzelm@12078
  1885
* Pure: proper integration with ``locales''; unlike the original
webertj@15154
  1886
version by Florian Kammller, Isar locales package high-level proof
wenzelm@12078
  1887
contexts rather than raw logical ones (e.g. we admit to include
wenzelm@12280
  1888
attributes everywhere); operations on locales include merge and
wenzelm@12964
  1889
rename; support for implicit arguments (``structures''); simultaneous
wenzelm@12964
  1890
type-inference over imports and text; see also HOL/ex/Locales.thy for
wenzelm@12964
  1891
some examples;
wenzelm@12078
  1892
wenzelm@12707
  1893
* Pure: the following commands have been ``localized'', supporting a
wenzelm@12707
  1894
target locale specification "(in name)": 'lemma', 'theorem',
wenzelm@12707
  1895
'corollary', 'lemmas', 'theorems', 'declare'; the results will be
wenzelm@12707
  1896
stored both within the locale and at the theory level (exported and
wenzelm@12707
  1897
qualified by the locale name);
wenzelm@12707
  1898
wenzelm@12964
  1899
* Pure: theory goals may now be specified in ``long'' form, with
wenzelm@12964
  1900
ad-hoc contexts consisting of arbitrary locale elements. for example
wenzelm@12964
  1901
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
wenzelm@12964
  1902
definitions may be given, too); the result is a meta-level rule with
wenzelm@12964
  1903
the context elements being discharged in the obvious way;
wenzelm@12964
  1904
wenzelm@12964
  1905
* Pure: new proof command 'using' allows to augment currently used
wenzelm@12964
  1906
facts after a goal statement ('using' is syntactically analogous to
wenzelm@12964
  1907
'apply', but acts on the goal's facts only); this allows chained facts
wenzelm@12964
  1908
to be separated into parts given before and after a claim, as in
wenzelm@12964
  1909
``from a and b have C using d and e <proof>'';
wenzelm@12078
  1910
wenzelm@11722
  1911
* Pure: renamed "antecedent" case to "rule_context";
wenzelm@11722
  1912
wenzelm@12964
  1913
* Pure: new 'judgment' command records explicit information about the
wenzelm@12964
  1914
object-logic embedding (used by several tools internally); no longer
wenzelm@12964
  1915
use hard-wired "Trueprop";
wenzelm@12964
  1916
wenzelm@11738
  1917
* Pure: added 'corollary' command;
wenzelm@11738
  1918
wenzelm@11722
  1919
* Pure: fixed 'token_translation' command;
wenzelm@11722
  1920
wenzelm@11899
  1921
* Pure: removed obsolete 'exported' attribute;
wenzelm@11899
  1922
wenzelm@11933
  1923
* Pure: dummy pattern "_" in is/let is now automatically lifted over
wenzelm@11933
  1924
bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
wenzelm@11899
  1925
supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
wenzelm@11899
  1926
wenzelm@11952
  1927
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm@11952
  1928
statements (atomic meta-level propositions); setup controlled via
wenzelm@11952
  1929
rewrite rules declarations of 'atomize' attribute; example
wenzelm@11952
  1930
application: 'induct' method with proper rule statements in improper
wenzelm@11952
  1931
proof *scripts*;
wenzelm@11952
  1932
wenzelm@12106
  1933
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
wenzelm@12106
  1934
now consider the syntactic context of assumptions, giving a better
wenzelm@12106
  1935
chance to get type-inference of the arguments right (this is
wenzelm@12106
  1936
especially important for locales);
wenzelm@12106
  1937
wenzelm@12312
  1938
* Pure: "sorry" no longer requires quick_and_dirty in interactive
wenzelm@12312
  1939
mode;
wenzelm@12312
  1940
wenzelm@12405
  1941
* Pure/obtain: the formal conclusion "thesis", being marked as
wenzelm@12405
  1942
``internal'', may no longer be reference directly in the text;
wenzelm@12405
  1943
potential INCOMPATIBILITY, may need to use "?thesis" in rare
wenzelm@12405
  1944
situations;
wenzelm@12405
  1945
wenzelm@12405
  1946
* Pure: generic 'sym' attribute which declares a rule both as pure
wenzelm@12405
  1947
'elim?' and for the 'symmetric' operation;
wenzelm@12405
  1948
wenzelm@12877
  1949
* Pure: marginal comments ``--'' may now occur just anywhere in the
wenzelm@12877
  1950
text; the fixed correlation with particular command syntax has been
wenzelm@12877
  1951
discontinued;
wenzelm@12877
  1952
berghofe@13023
  1953
* Pure: new method 'rules' is particularly well-suited for proof
berghofe@13023
  1954
search in intuitionistic logic; a bit slower than 'blast' or 'fast',
berghofe@13023
  1955
but often produces more compact proof terms with less detours;
berghofe@13023
  1956
wenzelm@12364
  1957
* Pure/Provers/classical: simplified integration with pure rule
wenzelm@12364
  1958
attributes and methods; the classical "intro?/elim?/dest?"
wenzelm@12364
  1959
declarations coincide with the pure ones; the "rule" method no longer
wenzelm@12364
  1960
includes classically swapped intros; "intro" and "elim" methods no
wenzelm@12364
  1961
longer pick rules from the context; also got rid of ML declarations
wenzelm@12364
  1962
AddXIs/AddXEs/AddXDs; all of this has some potential for
wenzelm@12364
  1963
INCOMPATIBILITY;
wenzelm@12364
  1964
wenzelm@12405
  1965
* Provers/classical: attribute 'swapped' produces classical inversions
wenzelm@12405
  1966
of introduction rules;
wenzelm@12405
  1967
wenzelm@12364
  1968
* Provers/simplifier: 'simplified' attribute may refer to explicit
wenzelm@12364
  1969
rules instead of full simplifier context; 'iff' attribute handles
wenzelm@12364
  1970
conditional rules;
wenzelm@11936
  1971
wenzelm@11745
  1972
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm@11745
  1973
wenzelm@11690
  1974
* HOL: 'recdef' now fails on unfinished automated proofs, use
wenzelm@11633
  1975
"(permissive)" option to recover old behavior;
wenzelm@11633
  1976
wenzelm@11933
  1977
* HOL: 'inductive' no longer features separate (collective) attributes
wenzelm@11933
  1978
for 'intros' (was found too confusing);
wenzelm@11933
  1979
wenzelm@12405
  1980
* HOL: properly declared induction rules less_induct and
wenzelm@12405
  1981
wf_induct_rule;
wenzelm@12405
  1982
kleing@11788
  1983
wenzelm@11474
  1984
*** HOL ***
wenzelm@11474
  1985
wenzelm@11702
  1986
* HOL: moved over to sane numeral syntax; the new policy is as
wenzelm@11702
  1987
follows:
wenzelm@11702
  1988
wenzelm@11702
  1989
  - 0 and 1 are polymorphic constants, which are defined on any
wenzelm@11702
  1990
  numeric type (nat, int, real etc.);
wenzelm@11702
  1991
wenzelm@11702
  1992
  - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
wenzelm@11702
  1993
  binary representation internally;
wenzelm@11702
  1994
wenzelm@11702
  1995
  - type nat has special constructor Suc, and generally prefers Suc 0
wenzelm@11702
  1996
  over 1::nat and Suc (Suc 0) over 2::nat;
wenzelm@11702
  1997
wenzelm@12364
  1998
This change may cause significant problems of INCOMPATIBILITY; here
wenzelm@12364
  1999
are some hints on converting existing sources:
wenzelm@11702
  2000
wenzelm@11702
  2001
  - due to the new "num" token, "-0" and "-1" etc. are now atomic
wenzelm@11702
  2002
  entities, so expressions involving "-" (unary or binary minus) need
wenzelm@11702
  2003
  to be spaced properly;
wenzelm@11702
  2004
wenzelm@11702
  2005
  - existing occurrences of "1" may need to be constraint "1::nat" or
wenzelm@11702
  2006
  even replaced by Suc 0; similar for old "2";
wenzelm@11702
  2007
wenzelm@11702
  2008
  - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
wenzelm@11702
  2009
wenzelm@11702
  2010
  - remove all special provisions on numerals in proofs;
wenzelm@11702
  2011
wenzelm@13042
  2012
* HOL: simp rules nat_number expand numerals on nat to Suc/0
wenzelm@12837
  2013
representation (depends on bin_arith_simps in the default context);
wenzelm@12837
  2014
wenzelm@12736
  2015
* HOL: symbolic syntax for x^2 (numeral 2);
wenzelm@12736
  2016
wenzelm@12335
  2017
* HOL: the class of all HOL types is now called "type" rather than
wenzelm@12335
  2018
"term"; INCOMPATIBILITY, need to adapt references to this type class
wenzelm@12335
  2019
in axclass/classes, instance/arities, and (usually rare) occurrences
wenzelm@12335
  2020
in typings (of consts etc.); internally the class is called
wenzelm@12335
  2021
"HOL.type", ML programs should refer to HOLogic.typeS;
wenzelm@12335
  2022
wenzelm@12280
  2023
* HOL/record package improvements:
wenzelm@12280
  2024
  - new derived operations "fields" to build a partial record section,
wenzelm@12280
  2025
    "extend" to promote a fixed record to a record scheme, and
wenzelm@12280
  2026
    "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
wenzelm@12280
  2027
    declared as simp by default;
wenzelm@12587
  2028
  - shared operations ("more", "fields", etc.) now need to be always
wenzelm@12587
  2029
    qualified) --- potential INCOMPATIBILITY;
wenzelm@12280
  2030
  - removed "make_scheme" operations (use "make" with "extend") --
wenzelm@12280
  2031
    INCOMPATIBILITY;
wenzelm@11937
  2032
  - removed "more" class (simply use "term") -- INCOMPATIBILITY;
wenzelm@12253
  2033
  - provides cases/induct rules for use with corresponding Isar
wenzelm@12253
  2034
    methods (for concrete records, record schemes, concrete more
wenzelm@12280
  2035
    parts, and schematic more parts -- in that order);
wenzelm@11930
  2036
  - internal definitions directly based on a light-weight abstract
wenzelm@11930
  2037
    theory of product types over typedef rather than datatype;
wenzelm@11930
  2038
berghofe@13023
  2039
* HOL: generic code generator for generating executable ML code from
berghofe@13023
  2040
specifications; specific support for HOL constructs such as inductive
berghofe@13023
  2041
datatypes and sets, as well as recursive functions; can be invoked
berghofe@13023
  2042
via 'generate_code' theory section;
berghofe@13023
  2043
wenzelm@11933
  2044
* HOL: canonical cases/induct rules for n-tuples (n = 3..7);
wenzelm@11933
  2045
paulson@13824
  2046
* HOL: consolidated and renamed several theories.  In particular:
wenzelm@14731
  2047
        Ord.thy has been absorbed into HOL.thy
wenzelm@14731
  2048
        String.thy has been absorbed into List.thy
wenzelm@14731
  2049
wenzelm@11802
  2050
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm@11802
  2051
(beware of argument permutation!);
wenzelm@11802
  2052
wenzelm@11657
  2053
* HOL: linorder_less_split superseded by linorder_cases;
wenzelm@11657
  2054
wenzelm@12917
  2055
* HOL/List: "nodups" renamed to "distinct";
nipkow@12889
  2056
wenzelm@11633
  2057
* HOL: added "The" definite description operator; move Hilbert's "Eps"
paulson@13824
  2058
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
paulson@13824
  2059
  - Ex_def has changed, now need to use some_eq_ex
wenzelm@11437
  2060
wenzelm@11572
  2061
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
wenzelm@11572
  2062
in this (rare) case use:
wenzelm@11572
  2063
wenzelm@11572
  2064
  delSWrapper "split_all_tac"
wenzelm@11572
  2065
  addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
wenzelm@11572
  2066
wenzelm@11572
  2067
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
wenzelm@11474
  2068
MAY FAIL;
nipkow@11361
  2069
wenzelm@11572
  2070
* HOL: introduced f^n = f o ... o f; warning: due to the limits of
wenzelm@11572
  2071
Isabelle's type classes, ^ on functions and relations has too general
wenzelm@11572
  2072
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
wenzelm@11572
  2073
necessary to attach explicit type constraints;
nipkow@11307
  2074
wenzelm@12917
  2075
* HOL/Relation: the prefix name of the infix "O" has been changed from
wenzelm@12917
  2076
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
wenzelm@12917
  2077
renamed accordingly (eg "compI" -> "rel_compI").
nipkow@12489
  2078
wenzelm@11487
  2079
* HOL: syntax translations now work properly with numerals and records
wenzelm@11487
  2080
expressions;
wenzelm@11474
  2081
wenzelm@12457
  2082
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm@12457
  2083
of "lam" -- INCOMPATIBILITY;
wenzelm@11474
  2084
wenzelm@11933
  2085
* HOL: got rid of some global declarations (potential INCOMPATIBILITY
wenzelm@11933
  2086
for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
wenzelm@11933
  2087
renamed "Product_Type.unit";
wenzelm@11611
  2088
nipkow@12564
  2089
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
nipkow@12564
  2090
wenzelm@12924
  2091
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
wenzelm@12924
  2092
the "cases" method);
wenzelm@12924
  2093
wenzelm@12597
  2094
* HOL/GroupTheory: group theory examples including Sylow's theorem (by
webertj@15154
  2095
Florian Kammller);
wenzelm@12597
  2096
wenzelm@12608
  2097
* HOL/IMP: updated and converted to new-style theory format; several
wenzelm@12608
  2098
parts turned into readable document, with proper Isar proof texts and
wenzelm@12608
  2099
some explanations (by Gerwin Klein);
wenzelm@12597
  2100
wenzelm@12734
  2101
* HOL-Real: added Complex_Numbers (by Gertrud Bauer);
wenzelm@12734
  2102
wenzelm@12690
  2103
* HOL-Hyperreal is now a logic image;
wenzelm@12690
  2104
wenzelm@11611
  2105
wenzelm@12022
  2106
*** HOLCF ***
wenzelm@12022
  2107
wenzelm@12622
  2108
* Isar: consts/constdefs supports mixfix syntax for continuous
wenzelm@12622
  2109
operations;
wenzelm@12622
  2110
wenzelm@12622
  2111
* Isar: domain package adapted to new-style theory format, e.g. see
wenzelm@12622
  2112
HOLCF/ex/Dnat.thy;
wenzelm@12622
  2113
wenzelm@12622
  2114
* theory Lift: proper use of rep_datatype lift instead of ML hacks --
wenzelm@12280
  2115
potential INCOMPATIBILITY; now use plain induct_tac instead of former
wenzelm@12280
  2116
lift.induct_tac, always use UU instead of Undef;
wenzelm@12022
  2117
wenzelm@12597
  2118
* HOLCF/IMP: updated and converted to new-style theory;
wenzelm@12597
  2119
wenzelm@12022
  2120
wenzelm@11474
  2121
*** ZF ***
wenzelm@11474
  2122
wenzelm@12622
  2123
* Isar: proper integration of logic-specific tools and packages,
wenzelm@12622
  2124
including theory commands '(co)inductive', '(co)datatype',
wenzelm@12622
  2125
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
wenzelm@12622
  2126
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
wenzelm@12622
  2127
wenzelm@12622
  2128
* theory Main no longer includes AC; for the Axiom of Choice, base
wenzelm@12622
  2129
your theory on Main_ZFC;
wenzelm@12622
  2130
wenzelm@12622
  2131
* the integer library now covers quotients and remainders, with many
wenzelm@12622
  2132
laws relating division to addition, multiplication, etc.;
paulson@12563
  2133
wenzelm@12280
  2134
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
wenzelm@12280
  2135
typeless version of the formalism;
wenzelm@12280
  2136
wenzelm@13025
  2137
* ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
wenzelm@13025
  2138
format;
wenzelm@12608
  2139
wenzelm@12280
  2140
* ZF/Induct: new directory for examples of inductive definitions,
wenzelm@12608
  2141
including theory Multiset for multiset orderings; converted to
wenzelm@12608
  2142
new-style theory format;
wenzelm@12177
  2143
wenzelm@13025
  2144
* ZF: many new theorems about lists, ordinals, etc.;
paulson@12850
  2145
wenzelm@11474
  2146
wenzelm@11474
  2147
*** General ***
wenzelm@11474
  2148
wenzelm@12280
  2149
* Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
wenzelm@12280
  2150
variable proof controls level of detail: 0 = no proofs (only oracle
wenzelm@12280
  2151
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
wenzelm@12280
  2152
also ref manual for further ML interfaces;
wenzelm@12280
  2153
wenzelm@12280
  2154
* Pure/axclass: removed obsolete ML interface
wenzelm@12280
  2155
goal_subclass/goal_arity;
wenzelm@12280
  2156
wenzelm@12280
  2157
* Pure/syntax: new token syntax "num" for plain numerals (without "#"
wenzelm@12280
  2158
of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
wenzelm@12280
  2159
separate tokens, so expressions involving minus need to be spaced
wenzelm@12280
  2160
properly;
wenzelm@12280
  2161
wenzelm@12312
  2162
* Pure/syntax: support non-oriented infixes, using keyword "infix"
wenzelm@12312
  2163
rather than "infixl" or "infixr";
wenzelm@12312
  2164
wenzelm@12312
  2165
* Pure/syntax: concrete syntax for dummy type variables admits genuine
wenzelm@12312
  2166
sort constraint specifications in type inference; e.g. "x::_::foo"
wenzelm@12312
  2167
ensures that the type of "x" is of sort "foo" (but not necessarily a
wenzelm@12312
  2168
type variable);
wenzelm@12280
  2169
wenzelm@12280
  2170
* Pure/syntax: print modes "type_brackets" and "no_type_brackets"
wenzelm@12280
  2171
control output of nested => (types); the default behavior is
wenzelm@12280
  2172
"type_brackets";
wenzelm@12280
  2173
wenzelm@12280
  2174
* Pure/syntax: builtin parse translation for "_constify" turns valued
wenzelm@11817
  2175
tokens into AST constants;
wenzelm@11474
  2176
wenzelm@12280
  2177
* Pure/syntax: prefer later declarations of translations and print
wenzelm@12280
  2178
translation functions; potential INCOMPATIBILITY: need to reverse
wenzelm@12280
  2179
multiple declarations for same syntax element constant;
wenzelm@12280
  2180
wenzelm@12832
  2181
* Pure/show_hyps reset by default (in accordance to existing Isar
wenzelm@12832
  2182
practice);
wenzelm@12832
  2183
wenzelm@12280
  2184
* Provers/classical: renamed addaltern to addafter, addSaltern to
wenzelm@12280
  2185
addSafter;
wenzelm@12280
  2186
wenzelm@12280
  2187
* Provers/clasimp: ``iff'' declarations now handle conditional rules
wenzelm@12280
  2188
as well;
wenzelm@12253
  2189
wenzelm@12538
  2190
* system: tested support for MacOS X; should be able to get Isabelle +
wenzelm@12538
  2191
Proof General to work in a plain Terminal after installing Poly/ML
wenzelm@12538
  2192
(e.g. from the Isabelle distribution area) and GNU bash alone
wenzelm@12538
  2193
(e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
wenzelm@12538
  2194
support requires further installations, e.g. from
wenzelm@12538
  2195
http://fink.sourceforge.net/);
wenzelm@12538
  2196
wenzelm@12280
  2197
* system: support Poly/ML 4.1.1 (able to manage larger heaps);
wenzelm@11551
  2198
wenzelm@12753
  2199
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm@12753
  2200
of 40 MB), cf. ML_OPTIONS;
wenzelm@12753
  2201
wenzelm@11633
  2202
* system: Proof General keywords specification is now part of the
wenzelm@11633
  2203
Isabelle distribution (see etc/isar-keywords.el);
wenzelm@11633
  2204
wenzelm@12728
  2205
* system: support for persistent Proof General sessions (refrain from
wenzelm@12728
  2206
outdating all loaded theories on startup); user may create writable
wenzelm@12728
  2207
logic images like this: ``isabelle -q HOL Test'';
wenzelm@12597
  2208
wenzelm@11551
  2209
* system: smart selection of Isabelle process versus Isabelle
wenzelm@11572
  2210
interface, accommodates case-insensitive file systems (e.g. HFS+); may
wenzelm@11572
  2211
run both "isabelle" and "Isabelle" even if file names are badly
wenzelm@11572
  2212
damaged (executable inspects the case of the first letter of its own
wenzelm@11572
  2213
name); added separate "isabelle-process" and "isabelle-interface";
wenzelm@11551
  2214
wenzelm@12472
  2215
* system: refrain from any attempt at filtering input streams; no
wenzelm@12472
  2216
longer support ``8bit'' encoding of old isabelle font, instead proper
wenzelm@12472
  2217
iso-latin characters may now be used; the related isatools
wenzelm@12472
  2218
"symbolinput" and "nonascii" have disappeared as well;
wenzelm@12472
  2219
wenzelm@12472
  2220
* system: removed old "xterm" interface (the print modes "xterm" and
wenzelm@12472
  2221
"xterm_color" are still available for direct use in a suitable
wenzelm@12472
  2222
terminal);
wenzelm@12472
  2223
paulson@11314
  2224
oheimb@11169
  2225
wenzelm@11062
  2226
New in Isabelle99-2 (February 2001)
wenzelm@11062
  2227
-----------------------------------
wenzelm@11062
  2228
nipkow@10224
  2229
*** Overview of INCOMPATIBILITIES ***
nipkow@10224
  2230
paulson@11241
  2231
* HOL: please note that theories in the Library and elsewhere often use the
paulson@11241
  2232
new-style (Isar) format; to refer to their theorems in an ML script you must
wenzelm@12622
  2233
bind them to ML identifers by e.g.      val thm_name = thm "thm_name";
paulson@11241
  2234
wenzelm@11043
  2235
* HOL: inductive package no longer splits induction rule aggressively,
wenzelm@11043
  2236
but only as far as specified by the introductions given; the old
oheimb@11130
  2237
format may be recovered via ML function complete_split_rule or attribute
wenzelm@11043
  2238
'split_rule (complete)';
wenzelm@11043
  2239
wenzelm@10998
  2240
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
wenzelm@10998
  2241
gfp_Tarski to gfp_unfold;
nipkow@10224
  2242
paulson@10288
  2243
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
paulson@10288
  2244
wenzelm@10858
  2245
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
wenzelm@10858
  2246
relation); infix "^^" has been renamed "``"; infix "``" has been
wenzelm@10858
  2247
renamed "`"; "univalent" has been renamed "single_valued";
nipkow@10793
  2248
wenzelm@10998
  2249
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
wenzelm@10998
  2250
operation;
wenzelm@10998
  2251
nipkow@10868
  2252
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
nipkow@10856
  2253
wenzelm@10391
  2254
* Isar: 'obtain' no longer declares "that" fact as simp/intro;
wenzelm@10391
  2255
wenzelm@10401
  2256
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm@10401
  2257
consequence, it is no longer monotonic wrt. the local goal context
wenzelm@10401
  2258
(which is now passed through the inductive cases);
wenzelm@10401
  2259
wenzelm@10976
  2260
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm@10976
  2261
\<gg> to \<ggreater>;
wenzelm@10976
  2262
nipkow@10224
  2263
wenzelm@10245
  2264
*** Document preparation ***
wenzelm@10245
  2265
wenzelm@10858
  2266
* \isabellestyle{NAME} selects version of Isabelle output (currently
wenzelm@10858
  2267
available: are "it" for near math-mode best-style output, "sl" for
wenzelm@10858
  2268
slanted text style, and "tt" for plain type-writer; if no
wenzelm@10858
  2269
\isabellestyle command is given, output is according to slanted
wenzelm@10858
  2270
type-writer);
wenzelm@10858
  2271
wenzelm@10322
  2272
* support sub/super scripts (for single symbols only), input syntax is
wenzelm@10322
  2273
like this: "A\<^sup>*" or "A\<^sup>\<star>";
wenzelm@10322
  2274
wenzelm@10858
  2275
* some more standard symbols; see Appendix A of the system manual for
wenzelm@11062
  2276
the complete list of symbols defined in isabellesym.sty;
wenzelm@10858
  2277
wenzelm@10998
  2278
* improved isabelle style files; more abstract symbol implementation
wenzelm@10998
  2279
(should now use \isamath{...} and \isatext{...} in custom symbol
wenzelm@10998
  2280
definitions);
wenzelm@10998
  2281
wenzelm@10634
  2282
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
wenzelm@10634
  2283
state; Note that presentation of goal states does not conform to
wenzelm@10634
  2284
actual human-readable proof documents.  Please do not include goal
wenzelm@10634
  2285
states into document output unless you really know what you are doing!
wenzelm@10322
  2286
wenzelm@11062
  2287
* proper indentation of antiquoted output with proportional LaTeX
wenzelm@11062
  2288
fonts;
wenzelm@10862
  2289
wenzelm@11050
  2290
* no_document ML operator temporarily disables LaTeX document
wenzelm@11050
  2291
generation;
wenzelm@11050
  2292
wenzelm@11062
  2293
* isatool unsymbolize tunes sources for plain ASCII communication;
wenzelm@11062
  2294
wenzelm@10322
  2295
wenzelm@10306
  2296
*** Isar ***
wenzelm@10306
  2297
wenzelm@10547
  2298
* Pure: Isar now suffers initial goal statements to contain unbound
wenzelm@10547
  2299
schematic variables (this does not conform to actual readable proof
wenzelm@10547
  2300
documents, due to unpredictable outcome and non-compositional proof
wenzelm@10547
  2301
checking); users who know what they are doing may use schematic goals
wenzelm@10547
  2302
for Prolog-style synthesis of proven results;
wenzelm@10547
  2303
wenzelm@10391
  2304
* Pure: assumption method (an implicit finishing) now handles actual
wenzelm@10391
  2305
rules as well;
wenzelm@10391
  2306
wenzelm@10391
  2307
* Pure: improved 'obtain' --- moved to Pure, insert "that" into
wenzelm@10391
  2308
initial goal, declare "that" only as Pure intro (only for single
wenzelm@10391
  2309
steps); the "that" rule assumption may now be involved in implicit
wenzelm@10391
  2310
finishing, thus ".." becomes a feasible for trivial obtains;
wenzelm@10391
  2311
wenzelm@10391
  2312
* Pure: default proof step now includes 'intro_classes'; thus trivial
wenzelm@10391
  2313
instance proofs may be performed by "..";
wenzelm@10391
  2314
wenzelm@10391
  2315
* Pure: ?thesis / ?this / "..." now work for pure meta-level
wenzelm@10391
  2316
statements as well;
wenzelm@10306
  2317
wenzelm@11097
  2318
* Pure: more robust selection of calculational rules;
wenzelm@11097
  2319
wenzelm@10858
  2320
* Pure: the builtin notion of 'finished' goal now includes the ==-refl
wenzelm@10858
  2321
rule (as well as the assumption rule);
wenzelm@10858
  2322
wenzelm@10858
  2323
* Pure: 'thm_deps' command visualizes dependencies of theorems and
wenzelm@10858
  2324
lemmas, using the graph browser tool;
wenzelm@10858
  2325
wenzelm@10944
  2326
* Pure: predict failure of "show" in interactive mode;
wenzelm@10944
  2327
wenzelm@11016
  2328
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm@11016
  2329
wenzelm@10401
  2330
* HOL: improved method 'induct' --- now handles non-atomic goals
wenzelm@10401
  2331
(potential INCOMPATIBILITY); tuned error handling;
wenzelm@10401
  2332
wenzelm@10557
  2333
* HOL: cases and induct rules now provide explicit hints about the
wenzelm@10547
  2334
number of facts to be consumed (0 for "type" and 1 for "set" rules);
wenzelm@10547
  2335
any remaining facts are inserted into the goal verbatim;
wenzelm@10547
  2336
wenzelm@10858
  2337
* HOL: local contexts (aka cases) may now contain term bindings as
wenzelm@10858
  2338
well; the 'cases' and 'induct' methods new provide a ?case binding for
wenzelm@10858
  2339
the result to be shown in each case;
wenzelm@10858
  2340
wenzelm@10770
  2341
* HOL: added 'recdef_tc' command;
wenzelm@10770
  2342
wenzelm@11016
  2343
* isatool convert assists in eliminating legacy ML scripts;
wenzelm@11016
  2344
wenzelm@10306
  2345
wenzelm@10245
  2346
*** HOL ***
wenzelm@10245
  2347
wenzelm@10245
  2348
* HOL/Library: a collection of generic theories to be used together
wenzelm@10245
  2349
with main HOL; the theory loader path already includes this directory
wenzelm@10245
  2350
by default; the following existing theories have been moved here:
wenzelm@10245
  2351
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
wenzelm@10337
  2352
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
wenzelm@10245
  2353
wenzelm@10966
  2354
* HOL/Unix: "Some aspects of Unix file-system security", a typical
wenzelm@10966
  2355
modelling and verification task performed in Isabelle/HOL +
wenzelm@10966
  2356
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
wenzelm@10966
  2357
wenzelm@11094
  2358
* HOL/Algebra: special summation operator SUM no longer exists, it has
wenzelm@11094
  2359
been replaced by setsum; infix 'assoc' now has priority 50 (like
wenzelm@11094
  2360
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
wenzelm@11094
  2361
'domain', this makes the theory consistent with mathematical
wenzelm@11094
  2362
literature;
wenzelm@11094
  2363
wenzelm@10514
  2364
* HOL basics: added overloaded operations "inverse" and "divide"
wenzelm@10726
  2365
(infix "/"), syntax for generic "abs" operation, generic summation
wenzelm@11094
  2366
operator \<Sum>;
wenzelm@10452
  2367
wenzelm@10391
  2368
* HOL/typedef: simplified package, provide more useful rules (see also
wenzelm@10391
  2369
HOL/subset.thy);
wenzelm@10391
  2370
wenzelm@10915
  2371
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm@10915
  2372
now expressed as a proper nested rule (old-style tactic scripts may
wenzelm@10915
  2373
require atomize_strip_tac to cope with non-atomic premises);
wenzelm@10915
  2374
wenzelm@10915
  2375
* HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
wenzelm@10915
  2376
to "split_conv" (old name still available for compatibility);
wenzelm@10915
  2377
wenzelm@10915
  2378
* HOL: improved concrete syntax for strings (e.g. allows translation
wenzelm@10915
  2379
rules with string literals);
wenzelm@10915
  2380
paulson@12245
  2381
* HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
paulson@12245
  2382
 and Fleuriot's mechanization of analysis, including the transcendental
paulson@12245
  2383
 functions for the reals;
paulson@10756
  2384
wenzelm@11094
  2385
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
wenzelm@10391
  2386
wenzelm@10858
  2387
paulson@10474
  2388
*** CTT ***
paulson@10474
  2389
wenzelm@10547
  2390
* CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
wenzelm@10547
  2391
"lam" is displayed as TWO lambda-symbols
paulson@10474
  2392
wenzelm@10547
  2393
* CTT: theory Main now available, containing everything (that is, Bool
wenzelm@10547
  2394
and Arith);
wenzelm@10547
  2395
paulson@10474
  2396
wenzelm@10391
  2397
*** General ***
wenzelm@10391
  2398
wenzelm@10547
  2399
* Pure: the Simplifier has been implemented properly as a derived rule
wenzelm@10547
  2400
outside of the actual kernel (at last!); the overall performance
wenzelm@10547
  2401
penalty in practical applications is about 50%, while reliability of
wenzelm@10547
  2402
the Isabelle inference kernel has been greatly improved;
wenzelm@10547
  2403
wenzelm@11112
  2404
* print modes "brackets" and "no_brackets" control output of nested =>
wenzelm@11112
  2405
(types) and ==> (props); the default behaviour is "brackets";
wenzelm@11112
  2406
wenzelm@10391
  2407
* Provers: fast_tac (and friends) now handle actual object-logic rules
wenzelm@10391
  2408
as assumptions as well;
wenzelm@10391
  2409
wenzelm@11124
  2410
* system: support Poly/ML 4.0;
wenzelm@11124
  2411
wenzelm@11124
  2412
* system: isatool install handles KDE version 1 or 2;
wenzelm@11124
  2413
wenzelm@10391
  2414
wenzelm@10245
  2415
wenzelm@10103
  2416
New in Isabelle99-1 (October 2000)
wenzelm@10103
  2417
----------------------------------
wenzelm@8015
  2418
wenzelm@10003
  2419
*** Overview of INCOMPATIBILITIES ***
paulson@8014
  2420
wenzelm@8848
  2421
* HOL: simplification of natural numbers is much changed; to partly
wenzelm@8848
  2422
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
wenzelm@8848
  2423
issue the following ML commands:
wenzelm@8848
  2424
wenzelm@8848
  2425
  Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
wenzelm@8848
  2426
  Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
paulson@8788
  2427
wenzelm@10129
  2428
* HOL: simplification no longer dives into case-expressions; this is
wenzelm@10129
  2429
controlled by "t.weak_case_cong" for each datatype t;
wenzelm@10003
  2430
wenzelm@10003
  2431
* HOL: nat_less_induct renamed to less_induct;
wenzelm@10003
  2432
wenzelm@10003
  2433
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool
wenzelm@10003
  2434
fixsome to patch .thy and .ML sources automatically;
paulson@8967
  2435
wenzelm@10003
  2436
  select_equality  -> some_equality
wenzelm@10003
  2437
  select_eq_Ex     -> some_eq_ex
wenzelm@10003
  2438
  selectI2EX       -> someI2_ex
wenzelm@10003
  2439
  selectI2         -> someI2
wenzelm@10003
  2440
  selectI          -> someI
wenzelm@10003
  2441
  select1_equality -> some1_equality
wenzelm@10003
  2442
  Eps_sym_eq       -> some_sym_eq_trivial
wenzelm@10003
  2443
  Eps_eq           -> some_eq_trivial
wenzelm@10003
  2444
wenzelm@10003
  2445
* HOL: exhaust_tac on datatypes superceded by new generic case_tac;
wenzelm@10003
  2446
wenzelm@10003
  2447
* HOL: removed obsolete theorem binding expand_if (refer to split_if
wenzelm@10003
  2448
instead);
wenzelm@10003
  2449
wenzelm@10003
  2450
* HOL: the recursion equations generated by 'recdef' are now called
wenzelm@10003
  2451
f.simps instead of f.rules;
wenzelm@10003
  2452
wenzelm@10003
  2453
* HOL: qed_spec_mp now also handles bounded ALL as well;
wenzelm@10003
  2454
wenzelm@10003
  2455
* HOL: 0 is now overloaded, so the type constraint ":: nat" may
wenzelm@10003
  2456
sometimes be needed;
wenzelm@10003
  2457
wenzelm@10003
  2458
* HOL: the constant for "f``x" is now "image" rather than "op ``";
paulson@8014
  2459
paulson@10065
  2460
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
paulson@10065
  2461
wenzelm@9330
  2462
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
wenzelm@9330
  2463
product is now "<*>" instead of "Times"; the lexicographic product is
wenzelm@9330
  2464
now "<*lex*>" instead of "**";
nipkow@8705
  2465
wenzelm@10003
  2466
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part
wenzelm@10003
  2467
of main HOL, but was unused); better use HOL's datatype package;
paulson@9971
  2468
wenzelm@10137
  2469
* HOL: removed "symbols" syntax for constant "override" of theory Map;
wenzelm@10137
  2470
the old syntax may be recovered as follows:
wenzelm@10137
  2471
wenzelm@10137
  2472
  syntax (symbols)
wenzelm@10137
  2473
    override  :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
wenzelm@10137
  2474
      (infixl "\\<oplus>" 100)
wenzelm@10137
  2475
wenzelm@8848
  2476
* HOL/Real: "rabs" replaced by overloaded "abs" function;
wenzelm@8848
  2477
wenzelm@8887
  2478
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm@8887
  2479
Lfp, Gfp, WF); this only affects ML packages that refer to const names
wenzelm@8887
  2480
internally;
wenzelm@8887
  2481
wenzelm@10003
  2482
* HOL and ZF: syntax for quotienting wrt an equivalence relation
wenzelm@10003
  2483
changed from A/r to A//r;
wenzelm@9908
  2484
wenzelm@10003
  2485
* ZF: new treatment of arithmetic (nat & int) may break some old
wenzelm@10003
  2486
proofs;
wenzelm@8921
  2487
wenzelm@10003
  2488
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
wenzelm@10003
  2489
rulify -> rule_format, elimify -> elim_format, ...);
paulson@9542
  2490
wenzelm@9941
  2491
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
  2492
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
wenzelm@9937
  2493
should have to change intro!! to intro? only); replaced "delrule" by
wenzelm@9937
  2494
"rule del";
wenzelm@9437
  2495
wenzelm@9612
  2496
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
wenzelm@9612
  2497
wenzelm@9437
  2498
* Provers: strengthened force_tac by using new first_best_tac;
oheimb@9402
  2499
wenzelm@10003
  2500
* LaTeX document preparation: several changes of isabelle.sty (see
wenzelm@10003
  2501
lib/texinputs);
wenzelm@8729
  2502
paulson@8014
  2503
wenzelm@8487
  2504
*** Document preparation ***
wenzelm@8358
  2505
wenzelm@9198
  2506
* formal comments (text blocks etc.) in new-style theories may now
wenzelm@9753
  2507
contain antiquotations of thm/prop/term/typ/text to be presented
wenzelm@9753
  2508
according to latex print mode; concrete syntax is like this:
wenzelm@9753
  2509
@{term[show_types] "f(x) = a + x"};
wenzelm@9198
  2510
wenzelm@8358
  2511
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm@8518
  2512
including proper document sources;
wenzelm@8358
  2513
wenzelm@8358
  2514
* generated LaTeX sources are now deleted after successful run
wenzelm@8358
  2515
(isatool document -c); may retain a copy somewhere else via -D option
wenzelm@8358
  2516
of isatool usedir;
wenzelm@8358
  2517
wenzelm@8566
  2518
* isatool usedir -D now lets isatool latex -o sty update the Isabelle
wenzelm@10003
  2519
style files, achieving self-contained LaTeX sources and simplifying
wenzelm@10003
  2520
LaTeX debugging;
wenzelm@8566
  2521
wenzelm@8518
  2522
* old-style theories now produce (crude) LaTeX output as well;
wenzelm@8358
  2523
wenzelm@9057
  2524
* browser info session directories are now self-contained (may be put
wenzelm@9437
  2525
on WWW server seperately); improved graphs of nested sessions; removed
wenzelm@9437
  2526
graph for 'all sessions';
wenzelm@9057
  2527
wenzelm@10003
  2528
* several improvements in isabelle style files; \isabellestyle{it}
wenzelm@10003
  2529
produces fake math mode output; \isamarkupheader is now \section by