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