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