1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Code generator: details of internal data cache have no impact on
10 the user space functionality any longer.
12 * Discontinued unnamed infix syntax (legacy feature for many years) --
13 need to specify constant name and syntax separately. Internal ML
14 datatype constructors have been renamed from InfixName to Infix etc.
15 Minor INCOMPATIBILITY.
20 * New set of rules "ac_simps" provides combined assoc / commute rewrites
21 for all interpretations of the appropriate generic locales.
23 * Renamed theory "OrderedGroup" to "Groups" and split theory "Ring_and_Field"
24 into theories "Rings" and "Fields"; for more appropriate and more
25 consistent names suitable for name prefixes within the HOL theories.
28 * Some generic constants have been put to appropriate theories:
30 less_eq, less: Orderings
32 inverse, divide: Rings
36 * Class division ring also requires proof of fact divide_inverse. However instantiation
37 of parameter divide has also been required previously. INCOMPATIBILITY.
39 * More consistent naming of type classes involving orderings (and lattices):
41 lower_semilattice ~> semilattice_inf
42 upper_semilattice ~> semilattice_sup
44 dense_linear_order ~> dense_linorder
46 pordered_ab_group_add ~> ordered_ab_group_add
47 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
48 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
49 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
50 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
51 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
52 pordered_cancel_semiring ~> ordered_cancel_semiring
53 pordered_comm_monoid_add ~> ordered_comm_monoid_add
54 pordered_comm_ring ~> ordered_comm_ring
55 pordered_comm_semiring ~> ordered_comm_semiring
56 pordered_ring ~> ordered_ring
57 pordered_ring_abs ~> ordered_ring_abs
58 pordered_semiring ~> ordered_semiring
60 ordered_ab_group_add ~> linordered_ab_group_add
61 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
62 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
63 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
64 ordered_field ~> linordered_field
65 ordered_field_no_lb ~> linordered_field_no_lb
66 ordered_field_no_ub ~> linordered_field_no_ub
67 ordered_field_dense_linear_order ~> dense_linordered_field
68 ordered_idom ~> linordered_idom
69 ordered_ring ~> linordered_ring
70 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
71 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
72 ordered_ring_strict ~> linordered_ring_strict
73 ordered_semidom ~> linordered_semidom
74 ordered_semiring ~> linordered_semiring
75 ordered_semiring_1 ~> linordered_semiring_1
76 ordered_semiring_1_strict ~> linordered_semiring_1_strict
77 ordered_semiring_strict ~> linordered_semiring_strict
79 The following slightly odd type classes have been moved to
80 a separate theory Library/Lattice_Algebras.thy:
82 lordered_ab_group_add ~> lattice_ab_group_add
83 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
84 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
85 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
86 lordered_ring ~> lattice_ring
90 * New theory Algebras contains generic algebraic structures and
91 generic algebraic operations. INCOMPATIBILTY: constants zero, one,
92 plus, minus, uminus and times have been moved from HOL.thy to Algebras.thy.
94 * HOLogic.strip_psplit: types are returned in syntactic order, similar
95 to other strip and tuple operations. INCOMPATIBILITY.
97 * Various old-style primrec specifications in the HOL theories have been
98 replaced by new-style primrec, especially in theory List. The corresponding
99 constants now have authentic syntax. INCOMPATIBILITY.
101 * Reorganized theory Multiset: less duplication, less historical
102 organization of sections, conversion from associations lists to
103 multisets, rudimentary code generation. Use insert_DiffM2 [symmetric]
104 instead of elem_imp_eq_diff_union, if needed. INCOMPATIBILITY.
106 * Reorganized theory Sum_Type; Inl and Inr now have authentic syntax.
109 * Code generation: ML and OCaml code is decorated with signatures.
111 * Theory Complete_Lattice: lemmas top_def and bot_def have been
112 replaced by the more convenient lemmas Inf_empty and Sup_empty.
113 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
114 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
115 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
116 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
118 * Theory Finite_Set and List: some lemmas have been generalized from
121 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
122 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
123 inter_Inter_fold_inter ~> inf_Inf_fold_inf
124 union_Union_fold_union ~> sup_Sup_fold_sup
125 Inter_fold_inter ~> Inf_fold_inf
126 Union_fold_union ~> Sup_fold_sup
127 inter_INTER_fold_inter ~> inf_INFI_fold_inf
128 union_UNION_fold_union ~> sup_SUPR_fold_sup
129 INTER_fold_inter ~> INFI_fold_inf
130 UNION_fold_union ~> SUPR_fold_sup
132 * Theory List: added transpose.
134 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
135 clash with new theory Quotient in Main HOL.
140 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
141 syntax constant (cf. 'syntax' command).
143 * Renamed old-style Drule.standard to Drule.export_without_context, to
144 emphasize that this is in no way a standard operation.
147 * Curried take and drop in library.ML; negative length is interpreted
148 as infinity (as in chop). INCOMPATIBILITY.
150 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
151 usual for resolution. Rare INCOMPATIBILITY.
153 * Discontinued old TheoryDataFun with its copy/init operation -- data
154 needs to be pure. Functor Theory_Data_PP retains the traditional
155 Pretty.pp argument to merge, which is absent in the standard
161 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
162 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
163 proof terms are enabled unconditionally in the new HOL-Proofs image.
165 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
166 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
171 New in Isabelle2009-1 (December 2009)
172 -------------------------------------
176 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
177 one backslash should be used, even in ML sources.
182 * Locale interpretation propagates mixins along the locale hierarchy.
183 The currently only available mixins are the equations used to map
184 local definitions to terms of the target domain of an interpretation.
186 * Reactivated diagnostic command 'print_interps'. Use "print_interps
187 loc" to print all interpretations of locale "loc" in the theory.
188 Interpretations in proofs are not shown.
190 * Thoroughly revised locales tutorial. New section on conditional
193 * On instantiation of classes, remaining undefined class parameters
194 are formally declared. INCOMPATIBILITY.
197 *** Document preparation ***
199 * New generalized style concept for printing terms: @{foo (style) ...}
200 instead of @{foo_style style ...} (old form is still retained for
201 backward compatibility). Styles can be also applied for
202 antiquotations prop, term_type and typeof.
207 * New proof method "smt" for a combination of first-order logic with
208 equality, linear and nonlinear (natural/integer/real) arithmetic, and
209 fixed-size bitvectors; there is also basic support for higher-order
210 features (esp. lambda abstractions). It is an incomplete decision
211 procedure based on external SMT solvers using the oracle mechanism;
212 for the SMT solver Z3, this method is proof-producing. Certificates
213 are provided to avoid calling the external solvers solely for
214 re-checking proofs. Due to a remote SMT service there is no need for
215 installing SMT solvers locally. See src/HOL/SMT.
217 * New commands to load and prove verification conditions generated by
218 the Boogie program verifier or derived systems (e.g. the Verifying C
219 Compiler (VCC) or Spec#). See src/HOL/Boogie.
221 * New counterexample generator tool 'nitpick' based on the Kodkod
222 relational model finder. See src/HOL/Tools/Nitpick and
223 src/HOL/Nitpick_Examples.
225 * New commands 'code_pred' and 'values' to invoke the predicate
226 compiler and to enumerate values of inductive predicates.
228 * A tabled implementation of the reflexive transitive closure.
230 * New implementation of quickcheck uses generic code generator;
231 default generators are provided for all suitable HOL types, records
232 and datatypes. Old quickcheck can be re-activated importing theory
233 Library/SML_Quickcheck.
235 * New testing tool Mirabelle for automated proof tools. Applies
236 several tools and tactics like sledgehammer, metis, or quickcheck, to
237 every proof step in a theory. To be used in batch mode via the
240 * New proof method "sos" (sum of squares) for nonlinear real
241 arithmetic (originally due to John Harison). It requires theory
242 Library/Sum_Of_Squares. It is not a complete decision procedure but
243 works well in practice on quantifier-free real arithmetic with +, -,
244 *, ^, =, <= and <, i.e. boolean combinations of equalities and
245 inequalities between polynomials. It makes use of external
246 semidefinite programming solvers. Method "sos" generates a
247 certificate that can be pasted into the proof thus avoiding the need
248 to call an external tool every time the proof is checked. See
249 src/HOL/Library/Sum_Of_Squares.
251 * New method "linarith" invokes existing linear arithmetic decision
254 * New command 'atp_minimal' reduces result produced by Sledgehammer.
256 * New Sledgehammer option "Full Types" in Proof General settings menu.
257 Causes full type information to be output to the ATPs. This slows
258 ATPs down considerably but eliminates a source of unsound "proofs"
261 * New method "metisFT": A version of metis that uses full type
262 information in order to avoid failures of proof reconstruction.
264 * New evaluator "approximate" approximates an real valued term using
265 the same method as the approximation method.
267 * Method "approximate" now supports arithmetic expressions as
268 boundaries of intervals and implements interval splitting and Taylor
271 * ML antiquotation @{code_datatype} inserts definition of a datatype
272 generated by the code generator; e.g. see src/HOL/Predicate.thy.
274 * New theory SupInf of the supremum and infimum operators for sets of
277 * New theory Probability, which contains a development of measure
278 theory, eventually leading to Lebesgue integration and probability.
280 * Extended Multivariate Analysis to include derivation and Brouwer's
283 * Reorganization of number theory, INCOMPATIBILITY:
284 - new number theory development for nat and int, in theories Divides
285 and GCD as well as in new session Number_Theory
286 - some constants and facts now suffixed with _nat and _int
288 - former session NumberTheory now named Old_Number_Theory, including
289 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
290 - moved theory Pocklington from src/HOL/Library to
291 src/HOL/Old_Number_Theory
293 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
294 lcm of finite and infinite sets. It is shown that they form a complete
297 * Class semiring_div requires superclass no_zero_divisors and proof of
298 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
299 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
300 generalized to class semiring_div, subsuming former theorems
301 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
302 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
305 * Refinements to lattice classes and sets:
306 - less default intro/elim rules in locale variant, more default
307 intro/elim rules in class variant: more uniformity
308 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
310 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
312 - renamed ACI to inf_sup_aci
313 - new class "boolean_algebra"
314 - class "complete_lattice" moved to separate theory
315 "Complete_Lattice"; corresponding constants (and abbreviations)
316 renamed and with authentic syntax:
317 Set.Inf ~> Complete_Lattice.Inf
318 Set.Sup ~> Complete_Lattice.Sup
319 Set.INFI ~> Complete_Lattice.INFI
320 Set.SUPR ~> Complete_Lattice.SUPR
321 Set.Inter ~> Complete_Lattice.Inter
322 Set.Union ~> Complete_Lattice.Union
323 Set.INTER ~> Complete_Lattice.INTER
324 Set.UNION ~> Complete_Lattice.UNION
325 - authentic syntax for
328 - mere abbreviations:
331 Set.inter (for inf, formerly Set.Int)
332 Set.union (for sup, formerly Set.Un)
333 Complete_Lattice.Inter (for Inf)
334 Complete_Lattice.Union (for Sup)
335 Complete_Lattice.INTER (for INFI)
336 Complete_Lattice.UNION (for SUPR)
337 - object-logic definitions as far as appropriate
339 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
340 Un_subset_iff are explicitly deleted as default simp rules; then also
341 their lattice counterparts le_inf_iff and le_sup_iff have to be
342 deleted to achieve the desired effect.
344 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
345 rules by default any longer; the same applies to min_max.inf_absorb1
346 etc. INCOMPATIBILITY.
348 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
349 pred_set_conv by default. INCOMPATIBILITY.
351 * Power operations on relations and functions are now one dedicated
352 constant "compow" with infix syntax "^^". Power operation on
353 multiplicative monoids retains syntax "^" and is now defined generic
354 in class power. INCOMPATIBILITY.
356 * Relation composition "R O S" now has a more standard argument order:
357 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
358 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
359 break, since the O_assoc rule was not rewritten like this. Fix using
360 O_assoc[symmetric]. The same applies to the curried version "R OO S".
362 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
363 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
366 * Most rules produced by inductive and datatype package have mandatory
367 prefixes. INCOMPATIBILITY.
369 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
370 the attribute of the same name. Each of the theorems in the list
371 DERIV_intros assumes composition with an additional function and
372 matches a variable to the derivative, which has to be solved by the
373 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
374 of most elementary terms. Former Maclauren.DERIV_tac and
375 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
378 * Code generator attributes follow the usual underscore convention:
379 code_unfold replaces code unfold
380 code_post replaces code post
385 sizechange -> size_change
386 induct_scheme -> induction_schema
389 * Discontinued abbreviation "arbitrary" of constant "undefined".
390 INCOMPATIBILITY, use "undefined" directly.
393 Suc_eq_add_numeral_1 -> Suc_eq_plus1
394 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
395 Suc_plus1 -> Suc_eq_plus1
396 *anti_sym -> *antisym*
397 vector_less_eq_def -> vector_le_def
400 * Added theorem List.map_map as [simp]. Removed List.map_compose.
403 * Removed predicate "M hassize n" (<--> card M = n & finite M).
409 * Theory Representable defines a class "rep" of domains that are
410 representable (via an ep-pair) in the universal domain type "udom".
411 Instances are provided for all type constructors defined in HOLCF.
413 * The 'new_domain' command is a purely definitional version of the
414 domain package, for representable domains. Syntax is identical to the
415 old domain package. The 'new_domain' package also supports indirect
416 recursion using previously-defined type constructors. See
417 src/HOLCF/ex/New_Domain.thy for examples.
419 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
420 on the left-hand side of an equation, and then performs
421 simplification. Rewriting is done using rules declared with the
422 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
423 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
425 * The pattern-match compiler in 'fixrec' can now handle constructors
426 with HOL function types. Pattern-match combinators for the Pair
427 constructor are pre-configured.
429 * The 'fixrec' package now produces better fixed-point induction rules
430 for mutually-recursive definitions: Induction rules have conclusions
431 of the form "P foo bar" instead of "P <foo, bar>".
433 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
434 been renamed to "below". The name "below" now replaces "less" in many
435 theorem names. (Legacy theorem names using "less" are still supported
438 * The 'fixrec' package now supports "bottom patterns". Bottom
439 patterns can be used to generate strictness rules, or to make
440 functions more strict (much like the bang-patterns supported by the
441 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
447 * Support for Poly/ML 5.3.0, with improved reporting of compiler
448 errors and run-time exceptions, including detailed source positions.
450 * Structure Name_Space (formerly NameSpace) now manages uniquely
451 identified entries, with some additional information such as source
452 position, logical grouping etc.
454 * Theory and context data is now introduced by the simplified and
455 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
456 to be pure, but the old TheoryDataFun for mutable data (with explicit
457 copy operation) is still available for some time.
459 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
460 provides a high-level programming interface to synchronized state
461 variables with atomic update. This works via pure function
462 application within a critical section -- its runtime should be as
463 short as possible; beware of deadlocks if critical code is nested,
464 either directly or indirectly via other synchronized variables!
466 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
467 wraps raw ML references, explicitly indicating their non-thread-safe
468 behaviour. The Isar toplevel keeps this structure open, to
469 accommodate Proof General as well as quick and dirty interactive
470 experiments with references.
472 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
473 parallel tactical reasoning.
475 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
476 are similar to SUBPROOF, but are slightly more flexible: only the
477 specified parts of the subgoal are imported into the context, and the
478 body tactic may introduce new subgoals and schematic variables.
480 * Old tactical METAHYPS, which does not observe the proof context, has
481 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
482 or Subgoal.FOCUS etc.
484 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
485 functors have their own ML name space there is no point to mark them
486 separately.) Minor INCOMPATIBILITY.
488 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
490 * Renamed several structures FooBar to Foo_Bar. Occasional,
493 * Operations of structure Skip_Proof no longer require quick_and_dirty
494 mode, which avoids critical setmp.
496 * Eliminated old Attrib.add_attributes, Method.add_methods and related
497 combinators for "args". INCOMPATIBILITY, need to use simplified
498 Attrib/Method.setup introduced in Isabelle2009.
500 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
501 back on global_simpset_of, global_claset_of, global_clasimpset_of as
502 last resort. INCOMPATIBILITY.
504 * Display.pretty_thm now requires a proper context (cf. former
505 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
506 or even Display.pretty_thm_without_context as last resort.
509 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
510 Syntax.pretty_typ/term directly, preferably with proper context
511 instead of global theory.
516 * Further fine tuning of parallel proof checking, scales up to 8 cores
517 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
520 * Support for additional "Isabelle components" via etc/components, see
521 also the system manual.
523 * The isabelle makeall tool now operates on all components with
524 IsaMakefile, not just hardwired "logics".
526 * Removed "compress" option from isabelle-process and isabelle usedir;
527 this is always enabled.
529 * Discontinued support for Poly/ML 4.x versions.
531 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
532 on a given logic image. This requires the lighttpd webserver and is
533 currently supported on Linux only.
537 New in Isabelle2009 (April 2009)
538 --------------------------------
542 * Simplified main Isabelle executables, with less surprises on
543 case-insensitive file-systems (such as Mac OS).
545 - The main Isabelle tool wrapper is now called "isabelle" instead of
548 - The former "isabelle" alias for "isabelle-process" has been
549 removed (should rarely occur to regular users).
551 - The former "isabelle-interface" and its alias "Isabelle" have been
552 removed (interfaces are now regular Isabelle tools).
554 Within scripts and make files, the Isabelle environment variables
555 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
556 respectively. (The latter are still available as legacy feature.)
558 The old isabelle-interface wrapper could react in confusing ways if
559 the interface was uninstalled or changed otherwise. Individual
560 interface tool configuration is now more explicit, see also the
561 Isabelle system manual. In particular, Proof General is now available
562 via "isabelle emacs".
564 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
565 purge installed copies of Isabelle executables and re-run "isabelle
566 install -p ...", or use symlinks.
568 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
569 old ~/isabelle, which was slightly non-standard and apt to cause
570 surprises on case-insensitive file-systems (such as Mac OS).
572 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
573 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
574 care is required when using older releases of Isabelle. Note that
575 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
576 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
578 * Proofs of fully specified statements are run in parallel on
579 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
580 a regular 4-core machine, if the initial heap space is made reasonably
581 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
583 * The main reference manuals ("isar-ref", "implementation", and
584 "system") have been updated and extended. Formally checked references
585 as hyperlinks are now available uniformly.
590 * Complete re-implementation of locales. INCOMPATIBILITY in several
591 respects. The most important changes are listed below. See the
592 Tutorial on Locales ("locales" manual) for details.
594 - In locale expressions, instantiation replaces renaming. Parameters
595 must be declared in a for clause. To aid compatibility with previous
596 parameter inheritance, in locale declarations, parameters that are not
597 'touched' (instantiation position "_" or omitted) are implicitly added
598 with their syntax at the beginning of the for clause.
600 - Syntax from abbreviations and definitions in locales is available in
601 locale expressions and context elements. The latter is particularly
602 useful in locale declarations.
604 - More flexible mechanisms to qualify names generated by locale
605 expressions. Qualifiers (prefixes) may be specified in locale
606 expressions, and can be marked as mandatory (syntax: "name!:") or
607 optional (syntax "name?:"). The default depends for plain "name:"
608 depends on the situation where a locale expression is used: in
609 commands 'locale' and 'sublocale' prefixes are optional, in
610 'interpretation' and 'interpret' prefixes are mandatory. The old
611 implicit qualifiers derived from the parameter names of a locale are
614 - Command "sublocale l < e" replaces "interpretation l < e". The
615 instantiation clause in "interpretation" and "interpret" (square
616 brackets) is no longer available. Use locale expressions.
618 - When converting proof scripts, mandatory qualifiers in
619 'interpretation' and 'interpret' should be retained by default, even
620 if this is an INCOMPATIBILITY compared to former behavior. In the
621 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
622 in locale expressions range over a single locale instance only.
624 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
625 In existing theorem specifications replace the includes element by the
626 respective context elements of the included locale, omitting those
627 that are already present in the theorem specification. Multiple
628 assume elements of a locale should be replaced by a single one
629 involving the locale predicate. In the proof body, declarations (most
630 notably theorems) may be regained by interpreting the respective
631 locales in the proof context as required (command "interpret").
633 If using "includes" in replacement of a target solely because the
634 parameter types in the theorem are not as general as in the target,
635 consider declaring a new locale with additional type constraints on
636 the parameters (context element "constrains").
638 - Discontinued "locale (open)". INCOMPATIBILITY.
640 - Locale interpretation commands no longer attempt to simplify goal.
641 INCOMPATIBILITY: in rare situations the generated goal differs. Use
642 methods intro_locales and unfold_locales to clarify.
644 - Locale interpretation commands no longer accept interpretation
645 attributes. INCOMPATIBILITY.
647 * Class declaration: so-called "base sort" must not be given in import
648 list any longer, but is inferred from the specification. Particularly
655 class foo = type + ...
657 * Class target: global versions of theorems stemming do not carry a
658 parameter prefix any longer. INCOMPATIBILITY.
660 * Class 'instance' command no longer accepts attached definitions.
661 INCOMPATIBILITY, use proper 'instantiation' target instead.
663 * Recovered hiding of consts, which was accidentally broken in
664 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
665 makes c inaccessible; consider using ``hide (open) const c'' instead.
667 * Slightly more coherent Pure syntax, with updated documentation in
668 isar-ref manual. Removed locales meta_term_syntax and
669 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
670 INCOMPATIBILITY in rare situations. Note that &&& should not be used
671 directly in regular applications.
673 * There is a new syntactic category "float_const" for signed decimal
674 fractions (e.g. 123.45 or -123.45).
676 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
677 interface with 'setup' command instead.
679 * Command 'local_setup' is similar to 'setup', but operates on a local
682 * The 'axiomatization' command now only works within a global theory
683 context. INCOMPATIBILITY.
685 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
686 hypotheses. Sorts required in the course of reasoning need to be
687 covered by the constraints in the initial statement, completed by the
688 type instance information of the background theory. Non-trivial sort
689 hypotheses, which rarely occur in practice, may be specified via
690 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
692 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
694 The result contains an implicit sort hypotheses as before --
695 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
698 * Generalized Isar history, with support for linear undo, direct state
701 * Changed defaults for unify configuration options:
703 unify_trace_bound = 50 (formerly 25)
704 unify_search_bound = 60 (formerly 30)
706 * Different bookkeeping for code equations (INCOMPATIBILITY):
708 a) On theory merge, the last set of code equations for a particular
709 constant is taken (in accordance with the policy applied by other
710 parts of the code generator framework).
712 b) Code equations stemming from explicit declarations (e.g. code
713 attribute) gain priority over default code equations stemming
714 from definition, primrec, fun etc.
716 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
718 * Unified theorem tables for both code generators. Thus [code
719 func] has disappeared and only [code] remains. INCOMPATIBILITY.
721 * Command 'find_consts' searches for constants based on type and name
724 find_consts "_ => bool"
726 By default, matching is against subtypes, but it may be restricted to
727 the whole type. Searching by name is possible. Multiple queries are
728 conjunctive and queries may be negated by prefixing them with a
731 find_consts strict: "_ => bool" name: "Int" -"int => int"
733 * New 'find_theorems' criterion "solves" matches theorems that
734 directly solve the current goal (modulo higher-order unification).
736 * Auto solve feature for main theorem statements: whenever a new goal
737 is stated, "find_theorems solves" is called; any theorems that could
738 solve the lemma directly are listed as part of the goal state.
739 Cf. associated options in Proof General Isabelle settings menu,
740 enabled by default, with reasonable timeout for pathological cases of
741 higher-order unification.
744 *** Document preparation ***
746 * Antiquotation @{lemma} now imitates a regular terminal proof,
747 demanding keyword 'by' and supporting the full method expression
748 syntax just like the Isar command 'by'.
753 * Integrated main parts of former image HOL-Complex with HOL. Entry
754 points Main and Complex_Main remain as before.
756 * Logic image HOL-Plain provides a minimal HOL with the most important
757 tools available (inductive, datatype, primrec, ...). This facilitates
758 experimentation and tool development. Note that user applications
759 (and library theories) should never refer to anything below theory
762 * Logic image HOL-Main stops at theory Main, and thus facilitates
763 experimentation due to shorter build times.
765 * Logic image HOL-NSA contains theories of nonstandard analysis which
766 were previously part of former HOL-Complex. Entry point Hyperreal
767 remains valid, but theories formerly using Complex_Main should now use
768 new entry point Hypercomplex.
770 * Generic ATP manager for Sledgehammer, based on ML threads instead of
771 Posix processes. Avoids potentially expensive forking of the ML
772 process. New thread-based implementation also works on non-Unix
773 platforms (Cygwin). Provers are no longer hardwired, but defined
774 within the theory via plain ML wrapper functions. Basic Sledgehammer
775 commands are covered in the isar-ref manual.
777 * Wrapper scripts for remote SystemOnTPTP service allows to use
778 sledgehammer without local ATP installation (Vampire etc.). Other
779 provers may be included via suitable ML wrappers, see also
780 src/HOL/ATP_Linkup.thy.
782 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
785 * The metis method no longer fails because the theorem is too trivial
786 (contains the empty clause).
788 * The metis method now fails in the usual manner, rather than raising
789 an exception, if it determines that it cannot prove the theorem.
791 * Method "coherent" implements a prover for coherent logic (see also
792 src/Tools/coherent.ML).
794 * Constants "undefined" and "default" replace "arbitrary". Usually
795 "undefined" is the right choice to replace "arbitrary", though
796 logically there is no difference. INCOMPATIBILITY.
798 * Command "value" now integrates different evaluation mechanisms. The
799 result of the first successful evaluation mechanism is printed. In
800 square brackets a particular named evaluation mechanisms may be
801 specified (currently, [SML], [code] or [nbe]). See further
802 src/HOL/ex/Eval_Examples.thy.
804 * Normalization by evaluation now allows non-leftlinear equations.
805 Declare with attribute [code nbe].
807 * Methods "case_tac" and "induct_tac" now refer to the very same rules
808 as the structured Isar versions "cases" and "induct", cf. the
809 corresponding "cases" and "induct" attributes. Mutual induction rules
810 are now presented as a list of individual projections
811 (e.g. foo_bar.inducts for types foo and bar); the old format with
812 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
813 rare situations a different rule is selected --- notably nested tuple
814 elimination instead of former prod.exhaust: use explicit (case_tac t
815 rule: prod.exhaust) here.
817 * Attributes "cases", "induct", "coinduct" support "del" option.
819 * Removed fact "case_split_thm", which duplicates "case_split".
821 * The option datatype has been moved to a new theory Option. Renamed
822 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
824 * New predicate "strict_mono" classifies strict functions on partial
825 orders. With strict functions on linear orders, reasoning about
826 (in)equalities is facilitated by theorems "strict_mono_eq",
827 "strict_mono_less_eq" and "strict_mono_less".
829 * Some set operations are now proper qualified constants with
830 authentic syntax. INCOMPATIBILITY:
841 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
844 * Auxiliary class "itself" has disappeared -- classes without any
845 parameter are treated as expected by the 'class' command.
847 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
849 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
850 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
852 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
853 method "approximation". It proves formulas on real values by using
854 interval arithmetic. In the formulas are also the transcendental
855 functions sin, cos, tan, atan, ln, exp and the constant pi are
856 allowed. For examples see
857 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
859 * Theory "Reflection" now resides in HOL/Library.
861 * Entry point to Word library now simply named "Word".
864 * Made source layout more coherent with logical distribution
867 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
868 src/HOL/Library/Code_Message.thy ~> src/HOL/
869 src/HOL/Library/GCD.thy ~> src/HOL/
870 src/HOL/Library/Order_Relation.thy ~> src/HOL/
871 src/HOL/Library/Parity.thy ~> src/HOL/
872 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
873 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
874 src/HOL/Real/Lubs.thy ~> src/HOL/
875 src/HOL/Real/PReal.thy ~> src/HOL/
876 src/HOL/Real/Rational.thy ~> src/HOL/
877 src/HOL/Real/RComplete.thy ~> src/HOL/
878 src/HOL/Real/RealDef.thy ~> src/HOL/
879 src/HOL/Real/RealPow.thy ~> src/HOL/
880 src/HOL/Real/Real.thy ~> src/HOL/
881 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
882 src/HOL/Complex/Complex.thy ~> src/HOL/
883 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
884 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
885 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
886 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
887 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
888 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
889 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
890 src/HOL/Hyperreal/Log.thy ~> src/HOL/
891 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
892 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
893 src/HOL/Hyperreal/Series.thy ~> src/HOL/
894 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
895 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
896 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
897 src/HOL/Real/Float ~> src/HOL/Library/
898 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
899 src/HOL/Real/RealVector.thy ~> src/HOL/
901 src/HOL/arith_data.ML ~> src/HOL/Tools
902 src/HOL/hologic.ML ~> src/HOL/Tools
903 src/HOL/simpdata.ML ~> src/HOL/Tools
904 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
905 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
906 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
907 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
908 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
909 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
910 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
912 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
913 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
914 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
915 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
916 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
917 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
919 * If methods "eval" and "evaluation" encounter a structured proof
920 state with !!/==>, only the conclusion is evaluated to True (if
921 possible), avoiding strange error messages.
923 * Method "sizechange" automates termination proofs using (a
924 modification of) the size-change principle. Requires SAT solver. See
925 src/HOL/ex/Termination.thy for examples.
927 * Simplifier: simproc for let expressions now unfolds if bound
928 variable occurs at most once in let expression body. INCOMPATIBILITY.
930 * Method "arith": Linear arithmetic now ignores all inequalities when
931 fast_arith_neq_limit is exceeded, instead of giving up entirely.
933 * New attribute "arith" for facts that should always be used
934 automatically by arithmetic. It is intended to be used locally in
937 assumes [arith]: "x > 0"
939 Global usage is discouraged because of possible performance impact.
941 * New classes "top" and "bot" with corresponding operations "top" and
942 "bot" in theory Orderings; instantiation of class "complete_lattice"
943 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
945 * Changed definition lemma "less_fun_def" in order to provide an
946 instance for preorders on functions; use lemma "less_le" instead.
949 * Theory Orderings: class "wellorder" moved here, with explicit
950 induction rule "less_induct" as assumption. For instantiation of
951 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
954 * Theory Orderings: added class "preorder" as superclass of "order".
955 INCOMPATIBILITY: Instantiation proofs for order, linorder
956 etc. slightly changed. Some theorems named order_class.* now named
959 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
962 * Theory Finite_Set: added a new fold combinator of type
964 ('a => 'b => 'b) => 'b => 'a set => 'b
966 Occasionally this is more convenient than the old fold combinator
967 which is now defined in terms of the new one and renamed to
970 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
971 and "ring_simps" have been replaced by "algebra_simps" (which can be
972 extended with further lemmas!). At the moment both still exist but
973 the former will disappear at some point.
975 * Theory Power: Lemma power_Suc is now declared as a simp rule in
976 class recpower. Type-specific simp rules for various recpower types
977 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
979 rat_power_0 -> power_0
980 rat_power_Suc -> power_Suc
982 realpow_Suc -> power_Suc
983 complexpow_0 -> power_0
984 complexpow_Suc -> power_Suc
985 power_poly_0 -> power_0
986 power_poly_Suc -> power_Suc
988 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
989 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
990 dvd has been generalized to class comm_semiring_1. Likewise a bunch
991 of lemmas from Divides has been generalized from nat to class
992 semiring_div. INCOMPATIBILITY. This involves the following theorem
993 renames resulting from duplicate elimination:
995 dvd_def_mod ~> dvd_eq_mod_eq_0
996 zero_dvd_iff ~> dvd_0_left_iff
998 DIVISION_BY_ZERO_DIV ~> div_by_0
999 DIVISION_BY_ZERO_MOD ~> mod_by_0
1000 mult_div ~> div_mult_self2_is_id
1001 mult_mod ~> mod_mult_self2_is_0
1003 * Theory IntDiv: removed many lemmas that are instances of class-based
1004 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1005 rename old lemmas as follows:
1007 dvd_diff -> nat_dvd_diff
1008 dvd_zminus_iff -> dvd_minus_iff
1009 mod_add1_eq -> mod_add_eq
1010 mod_mult1_eq -> mod_mult_right_eq
1011 mod_mult1_eq' -> mod_mult_left_eq
1012 mod_mult_distrib_mod -> mod_mult_eq
1013 nat_mod_add_left_eq -> mod_add_left_eq
1014 nat_mod_add_right_eq -> mod_add_right_eq
1015 nat_mod_div_trivial -> mod_div_trivial
1016 nat_mod_mod_trivial -> mod_mod_trivial
1017 zdiv_zadd_self1 -> div_add_self1
1018 zdiv_zadd_self2 -> div_add_self2
1019 zdiv_zmult_self1 -> div_mult_self2_is_id
1020 zdiv_zmult_self2 -> div_mult_self1_is_id
1021 zdvd_triv_left -> dvd_triv_left
1022 zdvd_triv_right -> dvd_triv_right
1023 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1024 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1025 zmod_zadd_left_eq -> mod_add_left_eq
1026 zmod_zadd_right_eq -> mod_add_right_eq
1027 zmod_zadd_self1 -> mod_add_self1
1028 zmod_zadd_self2 -> mod_add_self2
1029 zmod_zadd1_eq -> mod_add_eq
1030 zmod_zdiff1_eq -> mod_diff_eq
1031 zmod_zdvd_zmod -> mod_mod_cancel
1032 zmod_zmod_cancel -> mod_mod_cancel
1033 zmod_zmult_self1 -> mod_mult_self2_is_0
1034 zmod_zmult_self2 -> mod_mult_self1_is_0
1037 zdvd_abs1 -> abs_dvd_iff
1038 zdvd_abs2 -> dvd_abs_iff
1039 zdvd_refl -> dvd_refl
1040 zdvd_trans -> dvd_trans
1041 zdvd_zadd -> dvd_add
1042 zdvd_zdiff -> dvd_diff
1043 zdvd_zminus_iff -> dvd_minus_iff
1044 zdvd_zminus2_iff -> minus_dvd_iff
1045 zdvd_zmultD -> dvd_mult_right
1046 zdvd_zmultD2 -> dvd_mult_left
1047 zdvd_zmult_mono -> mult_dvd_mono
1048 zdvd_0_right -> dvd_0_right
1049 zdvd_0_left -> dvd_0_left_iff
1050 zdvd_1_left -> one_dvd
1051 zminus_dvd_iff -> minus_dvd_iff
1053 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1055 * The real numbers offer decimal input syntax: 12.34 is translated
1056 into 1234/10^2. This translation is not reversed upon output.
1058 * Theory Library/Polynomial defines an abstract type 'a poly of
1059 univariate polynomials with coefficients of type 'a. In addition to
1060 the standard ring operations, it also supports div and mod. Code
1061 generation is also supported, using list-style constructors.
1063 * Theory Library/Inner_Product defines a class of real_inner for real
1064 inner product spaces, with an overloaded operation inner :: 'a => 'a
1065 => real. Class real_inner is a subclass of real_normed_vector from
1068 * Theory Library/Product_Vector provides instances for the product
1069 type 'a * 'b of several classes from RealVector and Inner_Product.
1070 Definitions of addition, subtraction, scalar multiplication, norms,
1071 and inner products are included.
1073 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1074 addition to the field operations, numerals and case syntax are also
1077 * Theory Library/Diagonalize provides constructive version of Cantor's
1078 first diagonalization argument.
1080 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1081 zlcm (for int); carried together from various gcd/lcm developements in
1082 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1083 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1084 may recover tupled syntax as follows:
1086 hide (open) const gcd
1087 abbreviation gcd where
1088 "gcd == (%(a, b). GCD.gcd a b)"
1090 GCD.gcd ("gcd '(_, _')")
1092 The same works for lcm, zgcd, zlcm.
1094 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1095 instantiations for algebraic structures. Removed some duplicate
1096 theorems. Changes in simp rules. INCOMPATIBILITY.
1098 * ML antiquotation @{code} takes a constant as argument and generates
1099 corresponding code in background and inserts name of the corresponding
1100 resulting ML value/function/datatype constructor binding in place.
1101 All occurrences of @{code} with a single ML block are generated
1102 simultaneously. Provides a generic and safe interface for
1103 instrumentalizing code generation. See
1104 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1105 In future you ought to refrain from ad-hoc compiling generated SML
1106 code on the ML toplevel. Note that (for technical reasons) @{code}
1107 cannot refer to constants for which user-defined serializations are
1108 set. Refer to the corresponding ML counterpart directly in that
1111 * Command 'rep_datatype': instead of theorem names the command now
1112 takes a list of terms denoting the constructors of the type to be
1113 represented as datatype. The characteristic theorems have to be
1114 proven. INCOMPATIBILITY. Also observe that the following theorems
1115 have disappeared in favour of existing ones:
1117 unit_induct ~> unit.induct
1118 prod_induct ~> prod.induct
1119 sum_induct ~> sum.induct
1120 Suc_Suc_eq ~> nat.inject
1121 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1126 * New locales for orders and lattices where the equivalence relation
1127 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1128 locales use a record structure with field eq for the equivalence.
1130 * New theory of factorial domains.
1132 * Units_l_inv and Units_r_inv are now simp rules by default.
1133 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1134 and/or r_inv will now also require deletion of these lemmas.
1136 * Renamed the following theorems, INCOMPATIBILITY:
1138 UpperD ~> Upper_memD
1139 LowerD ~> Lower_memD
1140 least_carrier ~> least_closed
1141 greatest_carrier ~> greatest_closed
1142 greatest_Lower_above ~> greatest_Lower_below
1143 one_zero ~> carrier_one_zero
1144 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1149 * Nominal datatypes can now contain type-variables.
1151 * Commands 'nominal_inductive' and 'equivariance' work with local
1154 * Nominal primrec can now works with local theory targets and its
1155 specification syntax now conforms to the general format as seen in
1158 * Method "perm_simp" honours the standard simplifier attributes
1159 (no_asm), (no_asm_use) etc.
1161 * The new predicate #* is defined like freshness, except that on the
1162 left hand side can be a set or list of atoms.
1164 * Experimental command 'nominal_inductive2' derives strong induction
1165 principles for inductive definitions. In contrast to
1166 'nominal_inductive', which can only deal with a fixed number of
1167 binders, it can deal with arbitrary expressions standing for sets of
1168 atoms to be avoided. The only inductive definition we have at the
1169 moment that needs this generalisation is the typing rule for Lets in
1172 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1173 -----------------------------------------------------------------
1174 Gamma |- Let x be t1 in t2 : T2
1176 In this rule one wants to avoid all the binders that are introduced by
1177 "close Gamma T1". We are looking for other examples where this
1178 feature might be useful. Please let us know.
1183 * Reimplemented the simplification procedure for proving continuity
1184 subgoals. The new simproc is extensible; users can declare additional
1185 continuity introduction rules with the attribute [cont2cont].
1187 * The continuity simproc now uses a different introduction rule for
1188 solving continuity subgoals on terms with lambda abstractions. In
1189 some rare cases the new simproc may fail to solve subgoals that the
1190 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1191 Potential INCOMPATIBILITY.
1193 * Command 'fixrec': specification syntax now conforms to the general
1194 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1195 examples. INCOMPATIBILITY.
1200 * Proof of Zorn's Lemma for partial orders.
1205 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1206 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1207 depends on multithreading, so timouts will not work before Poly/ML
1210 * High-level support for concurrent ML programming, see
1211 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1212 particularly convenient to organize independent functional
1213 computations. The concept of "synchronized variables" provides a
1214 higher-order interface for components with shared state, avoiding the
1215 delicate details of mutexes and condition variables. (Requires
1216 Poly/ML 5.2.1 or later.)
1218 * ML bindings produced via Isar commands are stored within the Isar
1219 context (theory or proof). Consequently, commands like 'use' and 'ML'
1220 become thread-safe and work with undo as expected (concerning
1221 top-level bindings, not side-effects on global references).
1222 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1223 compiler at runtime; really global bindings need to be given outside a
1224 theory. (Requires Poly/ML 5.2 or later.)
1226 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1227 context. Top-level ML bindings are stored within the proof context in
1228 a purely sequential fashion, disregarding the nested proof structure.
1229 ML bindings introduced by 'ML_prf' are discarded at the end of the
1230 proof. (Requires Poly/ML 5.2 or later.)
1232 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1233 and Method.setup, as well as Isar commands 'attribute_setup' and
1234 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1235 existing code accordingly, or use plain 'setup' together with old
1238 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1239 to 'a -> thm, while results are always tagged with an authentic oracle
1240 name. The Isar command 'oracle' is now polymorphic, no argument type
1241 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1242 accordingly. Note that extra performance may be gained by producing
1243 the cterm carefully, avoiding slow Thm.cterm_of.
1245 * Simplified interface for defining document antiquotations via
1246 ThyOutput.antiquotation, ThyOutput.output, and optionally
1247 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1248 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1251 * More systematic treatment of long names, abstract name bindings, and
1252 name space operations. Basic operations on qualified names have been
1253 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1254 Long_Name.append. Old type bstring has been mostly replaced by
1255 abstract type binding (see structure Binding), which supports precise
1256 qualification by packages and local theory targets, as well as proper
1257 tracking of source positions. INCOMPATIBILITY, need to wrap old
1258 bstring values into Binding.name, or better pass through abstract
1259 bindings everywhere. See further src/Pure/General/long_name.ML,
1260 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1262 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1263 LocalTheory.note etc.) now refer to the *full* internal name, not the
1264 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1266 * Disposed old type and term read functions (Sign.read_def_typ,
1267 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1268 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1269 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1270 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1271 resort for legacy applications.
1273 * Disposed old declarations, tactics, tactic combinators that refer to
1274 the simpset or claset of an implicit theory (such as Addsimps,
1275 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1276 embedded ML text, or local_simpset_of with a proper context passed as
1277 explicit runtime argument.
1279 * Rules and tactics that read instantiations (read_instantiate,
1280 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1281 context, which is required for parsing and type-checking. Moreover,
1282 the variables are specified as plain indexnames, not string encodings
1283 thereof. INCOMPATIBILITY.
1285 * Generic Toplevel.add_hook interface allows to analyze the result of
1286 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1287 for theorem dependency output of transactions resulting in a new
1290 * ML antiquotations: block-structured compilation context indicated by
1291 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1293 @{binding name} - basic name binding
1294 @{let ?pat = term} - term abbreviation (HO matching)
1295 @{note name = fact} - fact abbreviation
1296 @{thm fact} - singleton fact (with attributes)
1297 @{thms fact} - general fact (with attributes)
1298 @{lemma prop by method} - singleton goal
1299 @{lemma prop by meth1 meth2} - singleton goal
1300 @{lemma prop1 ... propN by method} - general goal
1301 @{lemma prop1 ... propN by meth1 meth2} - general goal
1302 @{lemma (open) ...} - open derivation
1307 * The Isabelle "emacs" tool provides a specific interface to invoke
1308 Proof General / Emacs, with more explicit failure if that is not
1309 installed (the old isabelle-interface script silently falls back on
1310 isabelle-process). The PROOFGENERAL_HOME setting determines the
1311 installation location of the Proof General distribution.
1313 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1314 the Isabelle process into a JVM/Scala application. See
1315 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1316 process wrapper has been discontinued.)
1318 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1320 * Various status messages (with exact source position information) are
1321 emitted, if proper markup print mode is enabled. This allows
1322 user-interface components to provide detailed feedback on internal
1327 New in Isabelle2008 (June 2008)
1328 -------------------------------
1332 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1333 and updated, with formally checked references as hyperlinks.
1335 * Theory loader: use_thy (and similar operations) no longer set the
1336 implicit ML context, which was occasionally hard to predict and in
1337 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1338 provides a proper context already.
1340 * Theory loader: old-style ML proof scripts being *attached* to a thy
1341 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1342 'use' within a theory file will do the job.
1344 * Name space merge now observes canonical order, i.e. the second space
1345 is inserted into the first one, while existing entries in the first
1346 space take precedence. INCOMPATIBILITY in rare situations, may try to
1347 swap theory imports.
1349 * Syntax: symbol \<chi> is now considered a letter. Potential
1350 INCOMPATIBILITY in identifier syntax etc.
1352 * Outer syntax: string tokens no longer admit escaped white space,
1353 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1354 white space without escapes.
1356 * Outer syntax: string tokens may contain arbitrary character codes
1357 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1363 * Context-dependent token translations. Default setup reverts locally
1364 fixed variables, and adds hilite markup for undeclared frees.
1366 * Unused theorems can be found using the new command 'unused_thms'.
1367 There are three ways of invoking it:
1370 Only finds unused theorems in the current theory.
1372 (2) unused_thms thy_1 ... thy_n -
1373 Finds unused theorems in the current theory and all of its ancestors,
1374 excluding the theories thy_1 ... thy_n and all of their ancestors.
1376 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1377 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1378 their ancestors, excluding the theories thy_1 ... thy_n and all of
1381 In order to increase the readability of the list produced by
1382 unused_thms, theorems that have been created by a particular instance
1383 of a theory command such as 'inductive' or 'function' are considered
1384 to belong to the same "group", meaning that if at least one theorem in
1385 this group is used, the other theorems in the same group are no longer
1386 reported as unused. Moreover, if all theorems in the group are
1387 unused, only one theorem in the group is displayed.
1389 Note that proof objects have to be switched on in order for
1390 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1391 usually the case when using Proof General with the default settings).
1393 * Authentic naming of facts disallows ad-hoc overwriting of previous
1394 theorems within the same name space. INCOMPATIBILITY, need to remove
1395 duplicate fact bindings, or even accidental fact duplications. Note
1396 that tools may maintain dynamically scoped facts systematically, using
1397 PureThy.add_thms_dynamic.
1399 * Command 'hide' now allows to hide from "fact" name space as well.
1401 * Eliminated destructive theorem database, simpset, claset, and
1402 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1403 update of theories within ML code.
1405 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1406 INCOMPATIBILITY, object-logics depending on former Pure require
1407 additional setup PureThy.old_appl_syntax_setup; object-logics
1408 depending on former CPure need to refer to Pure.
1410 * Commands 'use' and 'ML' are now purely functional, operating on
1411 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1412 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1415 * Command 'setup': discontinued implicit version with ML reference.
1417 * Instantiation target allows for simultaneous specification of class
1418 instance operations together with an instantiation proof.
1419 Type-checking phase allows to refer to class operations uniformly.
1420 See src/HOL/Complex/Complex.thy for an Isar example and
1421 src/HOL/Library/Eval.thy for an ML example.
1423 * Indexing of literal facts: be more serious about including only
1424 facts from the visible specification/proof context, but not the
1425 background context (locale etc.). Affects `prop` notation and method
1426 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1429 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1430 "(open)" option, which used to expose internal bound variables to the
1433 * Isar statements: removed obsolete case "rule_context".
1434 INCOMPATIBILITY, better use explicit fixes/assumes.
1436 * Locale proofs: default proof step now includes 'unfold_locales';
1437 hence 'proof' without argument may be used to unfold locale
1441 *** Document preparation ***
1443 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1444 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1445 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1446 spot); renamed link color from "darkblue" to "linkcolor" (default
1447 value unchanged, can be redefined via \definecolor); no longer sets
1448 "a4paper" option (unnecessary or even intrusive).
1450 * Antiquotation @{lemma A method} proves proposition A by the given
1451 method (either a method name or a method name plus (optional) method
1452 arguments in parentheses) and prints A just like @{prop A}.
1457 * New primrec package. Specification syntax conforms in style to
1458 definition/function/.... No separate induction rule is provided. The
1459 "primrec" command distinguishes old-style and new-style specifications
1460 by syntax. The former primrec package is now named OldPrimrecPackage.
1461 When adjusting theories, beware: constants stemming from new-style
1462 primrec specifications have authentic syntax.
1464 * Metis prover is now an order of magnitude faster, and also works
1465 with multithreading.
1467 * Metis: the maximum number of clauses that can be produced from a
1468 theorem is now given by the attribute max_clauses. Theorems that
1469 exceed this number are ignored, with a warning printed.
1471 * Sledgehammer no longer produces structured proofs by default. To
1472 enable, declare [[sledgehammer_full = true]]. Attributes
1473 reconstruction_modulus, reconstruction_sorts renamed
1474 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1476 * Method "induct_scheme" derives user-specified induction rules
1477 from well-founded induction and completeness of patterns. This factors
1478 out some operations that are done internally by the function package
1479 and makes them available separately. See
1480 src/HOL/ex/Induction_Scheme.thy for examples.
1482 * More flexible generation of measure functions for termination
1483 proofs: Measure functions can be declared by proving a rule of the
1484 form "is_measure f" and giving it the [measure_function] attribute.
1485 The "is_measure" predicate is logically meaningless (always true), and
1486 just guides the heuristic. To find suitable measure functions, the
1487 termination prover sets up the goal "is_measure ?f" of the appropriate
1488 type and generates all solutions by prolog-style backwards proof using
1491 This setup also deals with rules like
1493 "is_measure f ==> is_measure (list_size f)"
1495 which accommodates nested datatypes that recurse through lists.
1496 Similar rules are predeclared for products and option types.
1498 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1502 - Definitions of overloaded constants on sets have to be replaced by
1503 definitions on => and bool.
1505 - Some definitions of overloaded operators on sets can now be proved
1506 using the definitions of the operators on => and bool. Therefore,
1507 the following theorems have been renamed:
1509 subset_def -> subset_eq
1510 psubset_def -> psubset_eq
1511 set_diff_def -> set_diff_eq
1512 Compl_def -> Compl_eq
1513 Sup_set_def -> Sup_set_eq
1514 Inf_set_def -> Inf_set_eq
1515 sup_set_def -> sup_set_eq
1516 inf_set_def -> inf_set_eq
1518 - Due to the incompleteness of the HO unification algorithm, some
1519 rules such as subst may require manual instantiation, if some of
1520 the unknowns in the rule is a set.
1522 - Higher order unification and forward proofs:
1525 have "P (S::'a set)" <...>
1526 then have "EX S. P S" ..
1528 no longer works (due to the incompleteness of the HO unification
1529 algorithm) and must be replaced by the pattern
1536 - Calculational reasoning with subst (or similar rules):
1539 have "P (S::'a set)" <...>
1540 also have "S = T" <...>
1541 finally have "P T" .
1543 no longer works (for similar reasons as the previous example) and
1544 must be replaced by something like
1546 have "P (S::'a set)" <...>
1547 moreover have "S = T" <...>
1548 ultimately have "P T" by simp
1550 - Tactics or packages written in ML code:
1551 Code performing pattern matching on types via
1553 Type ("set", [T]) => ...
1555 must be rewritten. Moreover, functions like strip_type or
1556 binder_types no longer return the right value when applied to a
1559 T1 => ... => Tn => U => bool
1563 T1 => ... => Tn => U set
1565 * Merged theories Wellfounded_Recursion, Accessible_Part and
1566 Wellfounded_Relations to theory Wellfounded.
1568 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1570 * Class finite no longer treats UNIV as class parameter. Use class
1571 enum from theory Library/Enum instead to achieve a similar effect.
1574 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1575 and "Cons". INCOMPATIBILITY.
1577 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1578 Potential INCOMPATIBILITY.
1580 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1581 injective_fst_snd removed, use split_eta and prod_eqI instead.
1582 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1584 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1585 the same name in theory Orderings:
1595 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
1596 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
1597 and different variable names.
1599 * Library/Option_ord.thy: Canonical order on option type.
1601 * Library/RBT.thy: Red-black trees, an efficient implementation of
1604 * Library/Countable.thy: Type class for countable types.
1606 * Theory Int: The representation of numerals has changed. The infix
1607 operator BIT and the bit datatype with constructors B0 and B1 have
1608 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
1609 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
1610 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
1613 * Theory Nat: definition of <= and < on natural numbers no longer
1614 depend on well-founded relations. INCOMPATIBILITY. Definitions
1615 le_def and less_def have disappeared. Consider lemmas not_less
1616 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
1618 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
1619 (whose purpose mainly is for various fold_set functionals) have been
1620 abandoned in favor of the existing algebraic classes
1621 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
1622 lower_semilattice (resp. upper_semilattice) and linorder.
1625 * Theory Transitive_Closure: induct and cases rules now declare proper
1626 case_names ("base" and "step"). INCOMPATIBILITY.
1628 * Theorem Inductive.lfp_ordinal_induct generalized to complete
1629 lattices. The form set-specific version is available as
1630 Inductive.lfp_ordinal_induct_set.
1632 * Renamed theorems "power.simps" to "power_int.simps".
1635 * Class semiring_div provides basic abstract properties of semirings
1636 with division and modulo operations. Subsumes former class dvd_mod.
1638 * Merged theories IntDef, Numeral and IntArith into unified theory
1639 Int. INCOMPATIBILITY.
1641 * Theory Library/Code_Index: type "index" now represents natural
1642 numbers rather than integers. INCOMPATIBILITY.
1644 * New class "uminus" with operation "uminus" (split of from class
1645 "minus" which now only has operation "minus", binary).
1648 * Constants "card", "internal_split", "option_map" now with authentic
1649 syntax. INCOMPATIBILITY.
1651 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
1652 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
1653 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
1654 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
1655 Sup_set_def, le_def, less_def, option_map_def now with object
1656 equality. INCOMPATIBILITY.
1658 * Records. Removed K_record, and replaced it by pure lambda term
1659 %x. c. The simplifier setup is now more robust against eta expansion.
1660 INCOMPATIBILITY: in cases explicitly referring to K_record.
1662 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
1664 * Library/ListVector: new theory of arithmetic vector operations.
1666 * Library/Order_Relation: new theory of various orderings as sets of
1667 pairs. Defines preorders, partial orders, linear orders and
1668 well-orders on sets and on types.
1673 * Renamed some theories to allow to loading both ZF and HOL in the
1676 Datatype -> Datatype_ZF
1677 Inductive -> Inductive_ZF
1684 INCOMPATIBILITY: ZF theories that import individual theories below
1685 Main might need to be adapted. Regular theory Main is still
1686 available, as trivial extension of Main_ZF.
1691 * ML within Isar: antiquotation @{const name} or @{const
1692 name(typargs)} produces statically-checked Const term.
1694 * Functor NamedThmsFun: data is available to the user as dynamic fact
1695 (of the same name). Removed obsolete print command.
1697 * Removed obsolete "use_legacy_bindings" function.
1699 * The ``print mode'' is now a thread-local value derived from a global
1700 template (the former print_mode reference), thus access becomes
1701 non-critical. The global print_mode reference is for session
1702 management only; user-code should use print_mode_value,
1703 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
1705 * Functions system/system_out provide a robust way to invoke external
1706 shell commands, with propagation of interrupts (requires Poly/ML
1707 5.2.1). Do not use OS.Process.system etc. from the basis library!
1712 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
1713 in accordance with Proof General 3.7, which prefers GNU emacs.
1715 * isatool tty runs Isabelle process with plain tty interaction;
1716 optional line editor may be specified via ISABELLE_LINE_EDITOR
1717 setting, the default settings attempt to locate "ledit" and "rlwrap".
1719 * isatool browser now works with Cygwin as well, using general
1720 "javapath" function defined in Isabelle process environment.
1722 * YXML notation provides a simple and efficient alternative to
1723 standard XML transfer syntax. See src/Pure/General/yxml.ML and
1724 isatool yxml as described in the Isabelle system manual.
1726 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
1727 provides general wrapper for managing an Isabelle process in a robust
1728 fashion, with ``cooked'' output from stdin/stderr.
1730 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
1731 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
1733 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
1734 way of changing the user's settings is via
1735 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
1738 * Multithreading.max_threads := 0 refers to the number of actual CPU
1739 cores of the underlying machine, which is a good starting point for
1740 optimal performance tuning. The corresponding usedir option -M allows
1741 "max" as an alias for "0". WARNING: does not work on certain versions
1742 of Mac OS (with Poly/ML 5.1).
1744 * isabelle-process: non-ML sessions are run with "nice", to reduce the
1745 adverse effect of Isabelle flooding interactive front-ends (notably
1746 ProofGeneral / XEmacs).
1750 New in Isabelle2007 (November 2007)
1751 -----------------------------------
1755 * More uniform information about legacy features, notably a
1756 warning/error of "Legacy feature: ...", depending on the state of the
1757 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
1758 legacy features will disappear eventually.
1760 * Theory syntax: the header format ``theory A = B + C:'' has been
1761 discontinued in favour of ``theory A imports B C begin''. Use isatool
1762 fixheaders to convert existing theory files. INCOMPATIBILITY.
1764 * Theory syntax: the old non-Isar theory file format has been
1765 discontinued altogether. Note that ML proof scripts may still be used
1766 with Isar theories; migration is usually quite simple with the ML
1767 function use_legacy_bindings. INCOMPATIBILITY.
1769 * Theory syntax: some popular names (e.g. 'class', 'declaration',
1770 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
1773 * Theory loader: be more serious about observing the static theory
1774 header specifications (including optional directories), but not the
1775 accidental file locations of previously successful loads. The strict
1776 update policy of former update_thy is now already performed by
1777 use_thy, so the former has been removed; use_thys updates several
1778 theories simultaneously, just as 'imports' within a theory header
1779 specification, but without merging the results. Potential
1780 INCOMPATIBILITY: may need to refine theory headers and commands
1781 ROOT.ML which depend on load order.
1783 * Theory loader: optional support for content-based file
1784 identification, instead of the traditional scheme of full physical
1785 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
1786 (cf. the system manual). The new scheme allows to work with
1787 non-finished theories in persistent session images, such that source
1788 files may be moved later on without requiring reloads.
1790 * Theory loader: old-style ML proof scripts being *attached* to a thy
1791 file (with the same base name as the theory) are considered a legacy
1792 feature, which will disappear eventually. Even now, the theory loader
1793 no longer maintains dependencies on such files.
1795 * Syntax: the scope for resolving ambiguities via type-inference is
1796 now limited to individual terms, instead of whole simultaneous
1797 specifications as before. This greatly reduces the complexity of the
1798 syntax module and improves flexibility by separating parsing and
1799 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
1800 'fixes' etc.) are required in rare situations.
1802 * Syntax: constants introduced by new-style packages ('definition',
1803 'abbreviation' etc.) are passed through the syntax module in
1804 ``authentic mode''. This means that associated mixfix annotations
1805 really stick to such constants, independently of potential name space
1806 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
1807 trees are represented slightly differently, may need to adapt syntax
1808 translations accordingly. Use CONST marker in 'translations' and
1809 @{const_syntax} antiquotation in 'parse_translation' etc.
1811 * Legacy goal package: reduced interface to the bare minimum required
1812 to keep existing proof scripts running. Most other user-level
1813 functions are now part of the OldGoals structure, which is *not* open
1814 by default (consider isatool expandshort before open OldGoals).
1815 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
1816 these tend to cause confusion about the actual goal (!) context being
1817 used here, which is not necessarily the same as the_context().
1819 * Command 'find_theorems': supports "*" wild-card in "name:"
1820 criterion; "with_dups" option. Certain ProofGeneral versions might
1821 support a specific search form (see ProofGeneral/CHANGES).
1823 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
1824 by default, which means that "prems" (and also "fixed variables") are
1825 suppressed from proof state output. Note that the ProofGeneral
1826 settings mechanism allows to change and save options persistently, but
1827 older versions of Isabelle will fail to start up if a negative prems
1830 * Local theory targets may be specified by non-nested blocks of
1831 ``context/locale/class ... begin'' followed by ``end''. The body may
1832 contain definitions, theorems etc., including any derived mechanism
1833 that has been implemented on top of these primitives. This concept
1834 generalizes the existing ``theorem (in ...)'' towards more versatility
1837 * Proof General interface: proper undo of final 'end' command;
1838 discontinued Isabelle/classic mode (ML proof scripts).
1841 *** Document preparation ***
1843 * Added antiquotation @{theory name} which prints the given name,
1844 after checking that it refers to a valid ancestor theory in the
1847 * Added antiquotations @{ML_type text} and @{ML_struct text} which
1848 check the given source text as ML type/structure, printing verbatim.
1850 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
1851 "c args == rhs" given in the current context. (Any number of
1852 arguments may be given on the LHS.)
1857 * The 'class' package offers a combination of axclass and locale to
1858 achieve Haskell-like type classes in Isabelle. Definitions and
1859 theorems within a class context produce both relative results (with
1860 implicit parameters according to the locale context), and polymorphic
1861 constants with qualified polymorphism (according to the class
1862 context). Within the body context of a 'class' target, a separate
1863 syntax layer ("user space type system") takes care of converting
1864 between global polymorphic consts and internal locale representation.
1865 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
1866 "isatool doc classes" provides a tutorial.
1868 * Generic code generator framework allows to generate executable
1869 code for ML and Haskell (including Isabelle classes). A short usage
1872 internal compilation:
1873 export_code <list of constants (term syntax)> in SML
1874 writing SML code to a file:
1875 export_code <list of constants (term syntax)> in SML <filename>
1876 writing OCaml code to a file:
1877 export_code <list of constants (term syntax)> in OCaml <filename>
1878 writing Haskell code to a bunch of files:
1879 export_code <list of constants (term syntax)> in Haskell <filename>
1881 evaluating closed propositions to True/False using code generation:
1884 Reasonable default setup of framework in HOL.
1886 Theorem attributs for selecting and transforming function equations theorems:
1888 [code fun]: select a theorem as function equation for a specific constant
1889 [code fun del]: deselect a theorem as function equation for a specific constant
1890 [code inline]: select an equation theorem for unfolding (inlining) in place
1891 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
1893 User-defined serializations (target in {SML, OCaml, Haskell}):
1895 code_const <and-list of constants (term syntax)>
1896 {(target) <and-list of const target syntax>}+
1898 code_type <and-list of type constructors>
1899 {(target) <and-list of type target syntax>}+
1901 code_instance <and-list of instances>
1903 where instance ::= <type constructor> :: <class>
1905 code_class <and_list of classes>
1906 {(target) <and-list of class target syntax>}+
1907 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
1909 code_instance and code_class only are effective to target Haskell.
1911 For example usage see src/HOL/ex/Codegenerator.thy and
1912 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
1913 generation from Isabelle/HOL theories is available via "isatool doc
1916 * Code generator: consts in 'consts_code' Isar commands are now
1917 referred to by usual term syntax (including optional type
1920 * Command 'no_translations' removes translation rules from theory
1923 * Overloaded definitions are now actually checked for acyclic
1924 dependencies. The overloading scheme is slightly more general than
1925 that of Haskell98, although Isabelle does not demand an exact
1926 correspondence to type class and instance declarations.
1927 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
1928 exotic versions of overloading -- at the discretion of the user!
1930 Polymorphic constants are represented via type arguments, i.e. the
1931 instantiation that matches an instance against the most general
1932 declaration given in the signature. For example, with the declaration
1933 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
1934 as c(nat). Overloading is essentially simultaneous structural
1935 recursion over such type arguments. Incomplete specification patterns
1936 impose global constraints on all occurrences, e.g. c('a * 'a) on the
1937 LHS means that more general c('a * 'b) will be disallowed on any RHS.
1938 Command 'print_theory' outputs the normalized system of recursive
1939 equations, see section "definitions".
1941 * Configuration options are maintained within the theory or proof
1942 context (with name and type bool/int/string), providing a very simple
1943 interface to a poor-man's version of general context data. Tools may
1944 declare options in ML (e.g. using Attrib.config_int) and then refer to
1945 these values using Config.get etc. Users may change options via an
1946 associated attribute of the same name. This form of context
1947 declaration works particularly well with commands 'declare' or
1948 'using', for example ``declare [[foo = 42]]''. Thus it has become
1949 very easy to avoid global references, which would not observe Isar
1950 toplevel undo/redo and fail to work with multithreading.
1952 Various global ML references of Pure and HOL have been turned into
1953 configuration options:
1955 Unify.search_bound unify_search_bound
1956 Unify.trace_bound unify_trace_bound
1957 Unify.trace_simp unify_trace_simp
1958 Unify.trace_types unify_trace_types
1959 Simplifier.simp_depth_limit simp_depth_limit
1960 Blast.depth_limit blast_depth_limit
1961 DatatypeProp.dtK datatype_distinctness_limit
1962 fast_arith_neq_limit fast_arith_neq_limit
1963 fast_arith_split_limit fast_arith_split_limit
1965 * Named collections of theorems may be easily installed as context
1966 data using the functor NamedThmsFun (see also
1967 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
1968 attributes; there is also a toplevel print command. This facility is
1969 just a common case of general context data, which is the preferred way
1970 for anything more complex than just a list of facts in canonical
1973 * Isar: command 'declaration' augments a local theory by generic
1974 declaration functions written in ML. This enables arbitrary content
1975 being added to the context, depending on a morphism that tells the
1976 difference of the original declaration context wrt. the application
1977 context encountered later on.
1979 * Isar: proper interfaces for simplification procedures. Command
1980 'simproc_setup' declares named simprocs (with match patterns, and body
1981 text in ML). Attribute "simproc" adds/deletes simprocs in the current
1982 context. ML antiquotation @{simproc name} retrieves named simprocs.
1984 * Isar: an extra pair of brackets around attribute declarations
1985 abbreviates a theorem reference involving an internal dummy fact,
1986 which will be ignored later --- only the effect of the attribute on
1987 the background context will persist. This form of in-place
1988 declarations is particularly useful with commands like 'declare' and
1989 'using', for example ``have A using [[simproc a]] by simp''.
1991 * Isar: method "assumption" (and implicit closing of subproofs) now
1992 takes simple non-atomic goal assumptions into account: after applying
1993 an assumption as a rule the resulting subgoals are solved by atomic
1994 assumption steps. This is particularly useful to finish 'obtain'
1995 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
1996 without referring to the original premise "!!x. P x ==> thesis" in the
1997 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2000 * Isar: implicit use of prems from the Isar proof context is
2001 considered a legacy feature. Common applications like ``have A .''
2002 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2003 referencing facts explicitly here improves readability and
2004 maintainability of proof texts.
2006 * Isar: improper proof element 'guess' is like 'obtain', but derives
2007 the obtained context from the course of reasoning! For example:
2009 assume "EX x y. A x & B y" -- "any previous fact"
2010 then guess x and y by clarify
2012 This technique is potentially adventurous, depending on the facts and
2013 proof tools being involved here.
2015 * Isar: known facts from the proof context may be specified as literal
2016 propositions, using ASCII back-quote syntax. This works wherever
2017 named facts used to be allowed so far, in proof commands, proof
2018 methods, attributes etc. Literal facts are retrieved from the context
2019 according to unification of type and term parameters. For example,
2020 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2021 theorems in the current context, then these are valid literal facts:
2022 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2024 There is also a proof method "fact" which does the same composition
2025 for explicit goal states, e.g. the following proof texts coincide with
2026 certain special cases of literal facts:
2028 have "A" by fact == note `A`
2029 have "A ==> B" by fact == note `A ==> B`
2030 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2031 have "P a ==> Q a" by fact == note `P a ==> Q a`
2033 * Isar: ":" (colon) is no longer a symbolic identifier character in
2034 outer syntax. Thus symbolic identifiers may be used without
2035 additional white space in declarations like this: ``assume *: A''.
2037 * Isar: 'print_facts' prints all local facts of the current context,
2038 both named and unnamed ones.
2040 * Isar: 'def' now admits simultaneous definitions, e.g.:
2042 def x == "t" and y == "u"
2044 * Isar: added command 'unfolding', which is structurally similar to
2045 'using', but affects both the goal state and facts by unfolding given
2046 rewrite rules. Thus many occurrences of the 'unfold' method or
2047 'unfolded' attribute may be replaced by first-class proof text.
2049 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2050 and command 'unfolding' now all support object-level equalities
2051 (potentially conditional). The underlying notion of rewrite rule is
2052 analogous to the 'rule_format' attribute, but *not* that of the
2053 Simplifier (which is usually more generous).
2055 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2056 premises of a theorem by n. Useful in conjunction with drule.
2058 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2059 method expression within a sandbox consisting of the first N
2060 sub-goals, which need to exist. For example, ``simp_all [3]''
2061 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2062 simplifies all new goals that emerge from applying rule foo to the
2063 originally first one.
2065 * Isar: schematic goals are no longer restricted to higher-order
2066 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2069 * Isar: the conclusion of a long theorem statement is now either
2070 'shows' (a simultaneous conjunction, as before), or 'obtains'
2071 (essentially a disjunction of cases with local parameters and
2072 assumptions). The latter allows to express general elimination rules
2073 adequately; in this notation common elimination rules look like this:
2075 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2077 obtains x where "P x"
2079 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2083 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2089 The subsequent classical rules even refer to the formal "thesis"
2092 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2095 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2096 obtains "thesis ==> something"
2098 The actual proof of an 'obtains' statement is analogous to that of the
2099 Isar proof element 'obtain', only that there may be several cases.
2100 Optional case names may be specified in parentheses; these will be
2101 available both in the present proof and as annotations in the
2102 resulting rule, for later use with the 'cases' method (cf. attribute
2105 * Isar: the assumptions of a long theorem statement are available as
2106 "assms" fact in the proof context. This is more appropriate than the
2107 (historical) "prems", which refers to all assumptions of the current
2108 context, including those from the target locale, proof body etc.
2110 * Isar: 'print_statement' prints theorems from the current theory or
2111 proof context in long statement form, according to the syntax of a
2114 * Isar: 'obtain' takes an optional case name for the local context
2115 introduction rule (default "that").
2117 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2118 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2121 * Pure: syntax "CONST name" produces a fully internalized constant
2122 according to the current context. This is particularly useful for
2123 syntax translations that should refer to internal constant
2124 representations independently of name spaces.
2126 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2127 instead of "FOO ". This allows multiple binder declarations to coexist
2128 in the same context. INCOMPATIBILITY.
2130 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2131 primitive that also works in a locale context (both for constants and
2132 fixed variables). Type declaration and internal syntactic representation
2133 of given constants retrieved from the context. Likewise, the
2134 'no_notation' command allows to remove given syntax annotations from the
2137 * Isar/locales: new derived specification elements 'axiomatization',
2138 'definition', 'abbreviation', which support type-inference, admit
2139 object-level specifications (equality, equivalence). See also the
2140 isar-ref manual. Examples:
2143 eq (infix "===" 50) where
2144 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2146 definition "f x y = x + y + 1"
2147 definition g where "g x = f x x"
2150 neq (infix "=!=" 50) where
2151 "x =!= y == ~ (x === y)"
2153 These specifications may be also used in a locale context. Then the
2154 constants being introduced depend on certain fixed parameters, and the
2155 constant name is qualified by the locale base name. An internal
2156 abbreviation takes care for convenient input and output, making the
2157 parameters implicit and using the original short name. See also
2158 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2159 entities from a monomorphic theory.
2161 Presently, abbreviations are only available 'in' a target locale, but
2162 not inherited by general import expressions. Also note that
2163 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2164 'translations' in common applications. The "no_abbrevs" print mode
2165 prevents folding of abbreviations in term output.
2167 Concrete syntax is attached to specified constants in internal form,
2168 independently of name spaces. The parse tree representation is
2169 slightly different -- use 'notation' instead of raw 'syntax', and
2170 'translations' with explicit "CONST" markup to accommodate this.
2172 * Pure/Isar: unified syntax for new-style specification mechanisms
2173 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2174 full type inference and dummy patterns ("_"). For example:
2176 definition "K x _ = x"
2178 inductive conj for A B
2179 where "A ==> B ==> conj A B"
2181 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2182 the current context. Print mode "no_abbrevs" prevents inversion of
2183 abbreviations on output.
2185 * Isar/locales: improved parameter handling: use of locales "var" and
2186 "struct" no longer necessary; - parameter renamings are no longer
2187 required to be injective. For example, this allows to define
2188 endomorphisms as locale endom = homom mult mult h.
2190 * Isar/locales: changed the way locales with predicates are defined.
2191 Instead of accumulating the specification, the imported expression is
2192 now an interpretation. INCOMPATIBILITY: different normal form of
2193 locale expressions. In particular, in interpretations of locales with
2194 predicates, goals repesenting already interpreted fragments are not
2195 removed automatically. Use methods `intro_locales' and
2196 `unfold_locales'; see below.
2198 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2199 provide backward reasoning on locales predicates. The methods are
2200 aware of interpretations and discharge corresponding goals.
2201 `intro_locales' is less aggressive then `unfold_locales' and does not
2202 unfold predicates to assumptions.
2204 * Isar/locales: the order in which locale fragments are accumulated
2205 has changed. This enables to override declarations from fragments due
2206 to interpretations -- for example, unwanted simp rules.
2208 * Isar/locales: interpretation in theories and proof contexts has been
2209 extended. One may now specify (and prove) equations, which are
2210 unfolded in interpreted theorems. This is useful for replacing
2211 defined concepts (constants depending on locale parameters) by
2212 concepts already existing in the target context. Example:
2214 interpretation partial_order ["op <= :: [int, int] => bool"]
2215 where "partial_order.less (op <=) (x::int) y = (x < y)"
2217 Typically, the constant `partial_order.less' is created by a
2218 definition specification element in the context of locale
2221 * Method "induct": improved internal context management to support
2222 local fixes and defines on-the-fly. Thus explicit meta-level
2223 connectives !! and ==> are rarely required anymore in inductive goals
2224 (using object-logic connectives for this purpose has been long
2225 obsolete anyway). Common proof patterns are explained in
2226 src/HOL/Induct/Common_Patterns.thy, see also
2227 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2230 * Method "induct": improved handling of simultaneous goals. Instead of
2231 introducing object-level conjunction, the statement is now split into
2232 several conclusions, while the corresponding symbolic cases are nested
2233 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2234 see src/HOL/Induct/Common_Patterns.thy, for example.
2236 * Method "induct": mutual induction rules are now specified as a list
2237 of rule sharing the same induction cases. HOL packages usually provide
2238 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2239 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2240 mutual induction rules differently, i.e. like this:
2242 (induct rule: foo_bar.inducts)
2243 (induct set: foo bar)
2244 (induct pred: foo bar)
2245 (induct type: foo bar)
2247 The ML function ProjectRule.projections turns old-style rules into the
2250 * Method "coinduct": dual of induction, see
2251 src/HOL/Library/Coinductive_List.thy for various examples.
2253 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2254 considered a legacy feature.
2256 * Attribute "symmetric" produces result with standardized schematic
2257 variables (index 0). Potential INCOMPATIBILITY.
2259 * Simplifier: by default the simplifier trace only shows top level
2260 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2261 default. Thus there is less danger of being flooded by the trace. The
2262 trace indicates where parts have been suppressed.
2264 * Provers/classical: removed obsolete classical version of elim_format
2265 attribute; classical elim/dest rules are now treated uniformly when
2266 manipulating the claset.
2268 * Provers/classical: stricter checks to ensure that supplied intro,
2269 dest and elim rules are well-formed; dest and elim rules must have at
2272 * Provers/classical: attributes dest/elim/intro take an optional
2273 weight argument for the rule (just as the Pure versions). Weights are
2274 ignored by automated tools, but determine the search order of single
2277 * Syntax: input syntax now supports dummy variable binding "%_. b",
2278 where the body does not mention the bound variable. Note that dummy
2279 patterns implicitly depend on their context of bounds, which makes
2280 "{_. _}" match any set comprehension as expected. Potential
2281 INCOMPATIBILITY -- parse translations need to cope with syntactic
2282 constant "_idtdummy" in the binding position.
2284 * Syntax: removed obsolete syntactic constant "_K" and its associated
2285 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2286 for example "A -> B" => "Pi A (%_. B)".
2288 * Pure: 'class_deps' command visualizes the subclass relation, using
2289 the graph browser tool.
2291 * Pure: 'print_theory' now suppresses certain internal declarations by
2292 default; use '!' option for full details.
2297 * Method "metis" proves goals by applying the Metis general-purpose
2298 resolution prover (see also http://gilith.com/software/metis/).
2299 Examples are in the directory MetisExamples. WARNING: the
2300 Isabelle/HOL-Metis integration does not yet work properly with
2303 * Command 'sledgehammer' invokes external automatic theorem provers as
2304 background processes. It generates calls to the "metis" method if
2305 successful. These can be pasted into the proof. Users do not have to
2306 wait for the automatic provers to return. WARNING: does not really
2307 work with multi-threading.
2309 * New "auto_quickcheck" feature tests outermost goal statements for
2310 potential counter-examples. Controlled by ML references
2311 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2312 5000 milliseconds). Fails silently if statements is outside of
2313 executable fragment, or any other codgenerator problem occurs.
2315 * New constant "undefined" with axiom "undefined x = undefined".
2317 * Added class "HOL.eq", allowing for code generation with polymorphic
2320 * Some renaming of class constants due to canonical name prefixing in
2321 the new 'class' package:
2323 HOL.abs ~> HOL.abs_class.abs
2324 HOL.divide ~> HOL.divide_class.divide
2325 0 ~> HOL.zero_class.zero
2326 1 ~> HOL.one_class.one
2327 op + ~> HOL.plus_class.plus
2328 op - ~> HOL.minus_class.minus
2329 uminus ~> HOL.minus_class.uminus
2330 op * ~> HOL.times_class.times
2331 op < ~> HOL.ord_class.less
2332 op <= > HOL.ord_class.less_eq
2333 Nat.power ~> Power.power_class.power
2334 Nat.size ~> Nat.size_class.size
2335 Numeral.number_of ~> Numeral.number_class.number_of
2336 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2337 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2338 Orderings.min ~> Orderings.ord_class.min
2339 Orderings.max ~> Orderings.ord_class.max
2340 Divides.op div ~> Divides.div_class.div
2341 Divides.op mod ~> Divides.div_class.mod
2342 Divides.op dvd ~> Divides.div_class.dvd
2344 INCOMPATIBILITY. Adaptions may be required in the following cases:
2346 a) User-defined constants using any of the names "plus", "minus",
2347 "times", "less" or "less_eq". The standard syntax translations for
2348 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2351 b) Variables named "plus", "minus", "times", "less", "less_eq"
2352 INCOMPATIBILITY: use more specific names.
2354 c) Permutative equations (e.g. "a + b = b + a")
2355 Since the change of names also changes the order of terms, permutative
2356 rewrite rules may get applied in a different order. Experience shows
2357 that this is rarely the case (only two adaptions in the whole Isabelle
2358 distribution). INCOMPATIBILITY: rewrite proofs
2360 d) ML code directly refering to constant names
2361 This in general only affects hand-written proof tactics, simprocs and
2362 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2363 Consider using @{const_name} antiquotation.
2365 * New class "default" with associated constant "default".
2367 * Function "sgn" is now overloaded and available on int, real, complex
2368 (and other numeric types), using class "sgn". Two possible defs of
2369 sgn are given as equational assumptions in the classes sgn_if and
2370 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2373 * Locale "partial_order" now unified with class "order" (cf. theory
2374 Orderings), added parameter "less". INCOMPATIBILITY.
2376 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2377 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2378 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2380 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2381 changed order of proof goals in instance proofs.
2383 * The transitivity reasoner for partial and linear orders is set up
2384 for classes "order" and "linorder". Instances of the reasoner are available
2385 in all contexts importing or interpreting the corresponding locales.
2386 Method "order" invokes the reasoner separately; the reasoner
2387 is also integrated with the Simplifier as a solver. Diagnostic
2388 command 'print_orders' shows the available instances of the reasoner
2389 in the current context.
2391 * Localized monotonicity predicate in theory "Orderings"; integrated
2392 lemmas max_of_mono and min_of_mono with this predicate.
2395 * Formulation of theorem "dense" changed slightly due to integration
2396 with new class dense_linear_order.
2398 * Uniform lattice theory development in HOL.
2400 constants "meet" and "join" now named "inf" and "sup"
2401 constant "Meet" now named "Inf"
2403 classes "meet_semilorder" and "join_semilorder" now named
2404 "lower_semilattice" and "upper_semilattice"
2405 class "lorder" now named "lattice"
2406 class "comp_lat" now named "complete_lattice"
2408 Instantiation of lattice classes allows explicit definitions
2409 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2411 INCOMPATIBILITY. Theorem renames:
2413 meet_left_le ~> inf_le1
2414 meet_right_le ~> inf_le2
2415 join_left_le ~> sup_ge1
2416 join_right_le ~> sup_ge2
2417 meet_join_le ~> inf_sup_ord
2420 le_meet ~> le_inf_iff
2421 le_join ~> ge_sup_conv
2422 meet_idempotent ~> inf_idem
2423 join_idempotent ~> sup_idem
2424 meet_comm ~> inf_commute
2425 join_comm ~> sup_commute
2426 meet_leI1 ~> le_infI1
2427 meet_leI2 ~> le_infI2
2428 le_joinI1 ~> le_supI1
2429 le_joinI2 ~> le_supI2
2430 meet_assoc ~> inf_assoc
2431 join_assoc ~> sup_assoc
2432 meet_left_comm ~> inf_left_commute
2433 meet_left_idempotent ~> inf_left_idem
2434 join_left_comm ~> sup_left_commute
2435 join_left_idempotent ~> sup_left_idem
2438 le_def_meet ~> le_iff_inf
2439 le_def_join ~> le_iff_sup
2440 join_absorp2 ~> sup_absorb2
2441 join_absorp1 ~> sup_absorb1
2442 meet_absorp1 ~> inf_absorb1
2443 meet_absorp2 ~> inf_absorb2
2444 meet_join_absorp ~> inf_sup_absorb
2445 join_meet_absorp ~> sup_inf_absorb
2446 distrib_join_le ~> distrib_sup_le
2447 distrib_meet_le ~> distrib_inf_le
2449 add_meet_distrib_left ~> add_inf_distrib_left
2450 add_join_distrib_left ~> add_sup_distrib_left
2451 is_join_neg_meet ~> is_join_neg_inf
2452 is_meet_neg_join ~> is_meet_neg_sup
2453 add_meet_distrib_right ~> add_inf_distrib_right
2454 add_join_distrib_right ~> add_sup_distrib_right
2455 add_meet_join_distribs ~> add_sup_inf_distribs
2456 join_eq_neg_meet ~> sup_eq_neg_inf
2457 meet_eq_neg_join ~> inf_eq_neg_sup
2458 add_eq_meet_join ~> add_eq_inf_sup
2459 meet_0_imp_0 ~> inf_0_imp_0
2460 join_0_imp_0 ~> sup_0_imp_0
2461 meet_0_eq_0 ~> inf_0_eq_0
2462 join_0_eq_0 ~> sup_0_eq_0
2463 neg_meet_eq_join ~> neg_inf_eq_sup
2464 neg_join_eq_meet ~> neg_sup_eq_inf
2465 join_eq_if ~> sup_eq_if
2467 mono_meet ~> mono_inf
2468 mono_join ~> mono_sup
2469 meet_bool_eq ~> inf_bool_eq
2470 join_bool_eq ~> sup_bool_eq
2471 meet_fun_eq ~> inf_fun_eq
2472 join_fun_eq ~> sup_fun_eq
2473 meet_set_eq ~> inf_set_eq
2474 join_set_eq ~> sup_set_eq
2475 meet1_iff ~> inf1_iff
2476 meet2_iff ~> inf2_iff
2485 join1_iff ~> sup1_iff
2486 join2_iff ~> sup2_iff
2496 is_meet_Meet ~> is_meet_Inf
2497 Meet_bool_def ~> Inf_bool_def
2498 Meet_fun_def ~> Inf_fun_def
2499 Meet_greatest ~> Inf_greatest
2500 Meet_lower ~> Inf_lower
2501 Meet_set_def ~> Inf_set_def
2504 Sup_bool_eq ~> Sup_bool_def
2505 Sup_fun_eq ~> Sup_fun_def
2506 Sup_set_eq ~> Sup_set_def
2508 listsp_meetI ~> listsp_infI
2509 listsp_meet_eq ~> listsp_inf_eq
2514 * Added syntactic class "size"; overloaded constant "size" now has
2515 type "'a::size ==> bool"
2517 * Internal reorganisation of `size' of datatypes: size theorems
2518 "foo.size" are no longer subsumed by "foo.simps" (but are still
2519 simplification rules by default!); theorems "prod.size" now named
2522 * Class "div" now inherits from class "times" rather than "type".
2525 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2526 Linorder etc. have disappeared; operations defined in terms of
2527 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2529 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2531 * HOL-Word: New extensive library and type for generic, fixed size
2532 machine words, with arithemtic, bit-wise, shifting and rotating
2533 operations, reflection into int, nat, and bool lists, automation for
2534 linear arithmetic (by automatic reflection into nat or int), including
2535 lemmas on overflow and monotonicity. Instantiated to all appropriate
2536 arithmetic type classes, supporting automatic simplification of
2537 numerals on all operations.
2539 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2541 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2543 * Code generator library theories:
2544 - Code_Integer represents HOL integers by big integer literals in target
2546 - Code_Char represents HOL characters by character literals in target
2548 - Code_Char_chr like Code_Char, but also offers treatment of character
2549 codes; includes Code_Integer.
2550 - Executable_Set allows to generate code for finite sets using lists.
2551 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2553 - Executable_Real implements a subset of real numbers, namly those
2554 representable by rational numbers.
2555 - Efficient_Nat implements natural numbers by integers, which in general will
2556 result in higher efficency; pattern matching with 0/Suc is eliminated;
2557 includes Code_Integer.
2558 - Code_Index provides an additional datatype index which is mapped to
2559 target-language built-in integers.
2560 - Code_Message provides an additional datatype message_string which is isomorphic to
2561 strings; messages are mapped to target-language strings.
2563 * New package for inductive predicates
2565 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2568 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2569 for z_1 :: U_1 and ... and z_n :: U_m
2571 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2574 with full support for type-inference, rather than
2576 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2578 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2579 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2581 inductive "s z_1 ... z_m"
2583 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2586 For backward compatibility, there is a wrapper allowing inductive
2587 sets to be defined with the new package via
2590 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2591 for z_1 :: U_1 and ... and z_n :: U_m
2593 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2599 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2600 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2601 for z_1 :: U_1 and ... and z_n :: U_m
2603 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2604 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2607 if the additional syntax "p ..." is required.
2609 Numerous examples can be found in the subdirectories src/HOL/Auth,
2610 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
2614 - Since declaration and definition of inductive sets or predicates
2615 is no longer separated, abbreviations involving the newly
2616 introduced sets or predicates must be specified together with the
2617 introduction rules after the 'where' keyword (see above), rather
2618 than before the actual inductive definition.
2620 - The variables in induction and elimination rules are now
2621 quantified in the order of their occurrence in the introduction
2622 rules, rather than in alphabetical order. Since this may break
2623 some proofs, these proofs either have to be repaired, e.g. by
2624 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
2625 statements of the form
2627 case (rule_i a_i_1 ... a_i_{k_i})
2629 or the old order of quantification has to be restored by explicitly adding
2630 meta-level quantifiers in the introduction rules, i.e.
2632 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
2634 - The format of the elimination rules is now
2636 p z_1 ... z_m x_1 ... x_n ==>
2637 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2642 (x_1, ..., x_n) : s z_1 ... z_m ==>
2643 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2646 for sets rather than
2648 x : s z_1 ... z_m ==>
2649 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
2652 This may require terms in goals to be expanded to n-tuples
2653 (e.g. using case_tac or simplification with the split_paired_all
2654 rule) before the above elimination rule is applicable.
2656 - The elimination or case analysis rules for (mutually) inductive
2657 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
2658 list of rules "p_1_..._p_k.elims" is no longer available.
2660 * New package "function"/"fun" for general recursive functions,
2661 supporting mutual and nested recursion, definitions in local contexts,
2662 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
2663 for small examples, and the separate tutorial on the function
2664 package. The old recdef "package" is still available as before, but
2665 users are encouraged to use the new package.
2667 * Method "lexicographic_order" automatically synthesizes termination
2668 relations as lexicographic combinations of size measures.
2670 * Case-expressions allow arbitrary constructor-patterns (including
2671 "_") and take their order into account, like in functional
2672 programming. Internally, this is translated into nested
2673 case-expressions; missing cases are added and mapped to the predefined
2674 constant "undefined". In complicated cases printing may no longer show
2675 the original input but the internal form. Lambda-abstractions allow
2676 the same form of pattern matching: "% pat1 => e1 | ..." is an
2677 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
2680 * IntDef: The constant "int :: nat => int" has been removed; now "int"
2681 is an abbreviation for "of_nat :: nat => int". The simplification
2682 rules for "of_nat" have been changed to work like "int" did
2683 previously. Potential INCOMPATIBILITY:
2684 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
2685 - of_nat_diff and of_nat_mult are no longer default simp rules
2687 * Method "algebra" solves polynomial equations over (semi)rings using
2688 Groebner bases. The (semi)ring structure is defined by locales and the
2689 tool setup depends on that generic context. Installing the method for
2690 a specific type involves instantiating the locale and possibly adding
2691 declarations for computation on the coefficients. The method is
2692 already instantiated for natural numbers and for the axiomatic class
2693 of idoms with numerals. See also the paper by Chaieb and Wenzel at
2694 CALCULEMUS 2007 for the general principles underlying this
2695 architecture of context-aware proof-tools.
2697 * Method "ferrack" implements quantifier elimination over
2698 special-purpose dense linear orders using locales (analogous to
2699 "algebra"). The method is already installed for class
2700 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
2703 * Former constant "List.op @" now named "List.append". Use ML
2704 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
2705 circumvent possible incompatibilities when working on ML level.
2707 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
2709 * New function listsum :: 'a list => 'a for arbitrary monoids.
2710 Special syntax: "SUM x <- xs. f x" (and latex variants)
2712 * New syntax for Haskell-like list comprehension (input only), eg.
2713 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
2715 * The special syntax for function "filter" has changed from [x :
2716 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
2717 comprehension syntax, and for uniformity. INCOMPATIBILITY.
2719 * [a..b] is now defined for arbitrary linear orders. It used to be
2720 defined on nat only, as an abbreviation for [a..<Suc b]
2723 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
2725 * New functions "sorted" and "sort" in src/HOL/List.thy.
2727 * New lemma collection field_simps (an extension of ring_simps) for
2728 manipulating (in)equations involving division. Multiplies with all
2729 denominators that can be proved to be non-zero (in equations) or
2730 positive/negative (in inequations).
2732 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
2733 have been improved and renamed to ring_simps, group_simps and
2734 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
2735 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
2737 * Theory Library/Commutative_Ring: switched from recdef to function
2738 package; constants add, mul, pow now curried. Infix syntax for
2739 algebraic operations.
2741 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
2744 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
2747 * HOL/records: generalised field-update to take a function on the
2748 field rather than the new value: r(|A := x|) is translated to A_update
2749 (K x) r The K-combinator that is internally used is called K_record.
2750 INCOMPATIBILITY: Usage of the plain update functions has to be
2753 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
2754 * x = 0, which are required for a semiring. Richer structures do not
2755 inherit from semiring_0 anymore, because this property is a theorem
2756 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
2757 there is more to prove, but this is mostly trivial.
2759 * Class "recpower" is generalized to arbitrary monoids, not just
2760 commutative semirings. INCOMPATIBILITY: may need to incorporate
2761 commutativity or semiring properties additionally.
2763 * Constant "List.list_all2" in List.thy now uses authentic syntax.
2764 INCOMPATIBILITY: translations containing list_all2 may go wrong,
2765 better use 'abbreviation'.
2767 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
2769 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
2770 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
2771 significant changes for setting up numeral syntax for types:
2772 - New constants Numeral.pred and Numeral.succ instead
2773 of former Numeral.bin_pred and Numeral.bin_succ.
2774 - Use integer operations instead of bin_add, bin_mult and so on.
2775 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
2776 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
2778 See src/HOL/Integ/IntArith.thy for an example setup.
2780 * Command 'normal_form' computes the normal form of a term that may
2781 contain free variables. For example ``normal_form "rev [a, b, c]"''
2782 produces ``[b, c, a]'' (without proof). This command is suitable for
2783 heavy-duty computations because the functions are compiled to ML
2784 first. Correspondingly, a method "normalization" is provided. See
2785 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
2787 * Alternative iff syntax "A <-> B" for equality on bool (with priority
2788 25 like -->); output depends on the "iff" print_mode, the default is
2789 "A = B" (with priority 50).
2791 * Relations less (<) and less_eq (<=) are also available on type bool.
2792 Modified syntax to disallow nesting without explicit parentheses,
2793 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
2796 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
2798 * Relation composition operator "op O" now has precedence 75 and binds
2799 stronger than union and intersection. INCOMPATIBILITY.
2801 * The old set interval syntax "{m..n(}" (and relatives) has been
2802 removed. Use "{m..<n}" (and relatives) instead.
2804 * In the context of the assumption "~(s = t)" the Simplifier rewrites
2805 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
2806 ``declare [[simproc del: neq]]''.
2808 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
2811 * Theorem Cons_eq_map_conv no longer declared as "simp".
2813 * Theorem setsum_mult renamed to setsum_right_distrib.
2815 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
2818 * Reimplemented methods "sat" and "satx", with several improvements:
2819 goals no longer need to be stated as "<prems> ==> False", equivalences
2820 (i.e. "=" on type bool) are handled, variable names of the form
2821 "lit_<n>" are no longer reserved, significant speedup.
2823 * Methods "sat" and "satx" can now replay MiniSat proof traces.
2824 zChaff is still supported as well.
2826 * 'inductive' and 'datatype': provide projections of mutual rules,
2827 bundled as foo_bar.inducts;
2829 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
2832 * Library: moved theory Accessible_Part to main HOL.
2834 * Library: added theory Coinductive_List of potentially infinite lists
2835 as greatest fixed-point.
2837 * Library: added theory AssocList which implements (finite) maps as
2840 * Method "evaluation" solves goals (i.e. a boolean expression)
2841 efficiently by compiling it to ML. The goal is "proved" (via an
2842 oracle) if it evaluates to True.
2844 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
2845 also when invoked by the simplifier. This results in the Simplifier
2846 being more powerful on arithmetic goals. INCOMPATIBILITY.
2847 Configuration option fast_arith_split_limit=0 recovers the old
2850 * Support for hex (0x20) and binary (0b1001) numerals.
2852 * New method: reify eqs (t), where eqs are equations for an
2853 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
2854 parameter, computes a term s::'b and a list xs::'a list and proves the
2855 theorem I xs s = t. This is also known as reification or quoting. The
2856 resulting theorem is applied to the subgoal to substitute t with I xs
2857 s. If t is omitted, the subgoal itself is reified.
2859 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
2860 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
2861 where f is supposed to be a computable function (in the sense of code
2862 generattion). The method uses reify to compute s and xs as above then
2863 applies corr_thm and uses normalization by evaluation to "prove" f s =
2864 r and finally gets the theorem t = r, which is again applied to the
2865 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
2867 * Reflection: Automatic reification now handels binding, an example is
2868 available in src/HOL/ex/ReflectionEx.thy
2870 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
2871 command 'statespace' that is similar to 'record', but introduces an
2872 abstract specification based on the locale infrastructure instead of
2873 HOL types. This leads to extra flexibility in composing state spaces,
2874 in particular multiple inheritance and renaming of components.
2879 * Hyperreal: Functions root and sqrt are now defined on negative real
2880 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
2881 Nonnegativity side conditions have been removed from many lemmas, so
2882 that more subgoals may now be solved by simplification; potential
2885 * Real: new type classes formalize real normed vector spaces and
2886 algebras, using new overloaded constants scaleR :: real => 'a => 'a
2887 and norm :: 'a => real.
2889 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
2890 reals into other types. The overloaded constant Reals :: 'a set is now
2891 defined as range of_real; potential INCOMPATIBILITY.
2893 * Real: proper support for ML code generation, including 'quickcheck'.
2894 Reals are implemented as arbitrary precision rationals.
2896 * Hyperreal: Several constants that previously worked only for the
2897 reals have been generalized, so they now work over arbitrary vector
2898 spaces. Type annotations may need to be added in some cases; potential
2901 Infinitesimal :: ('a::real_normed_vector) star set
2902 HFinite :: ('a::real_normed_vector) star set
2903 HInfinite :: ('a::real_normed_vector) star set
2904 approx :: ('a::real_normed_vector) star => 'a star => bool
2905 monad :: ('a::real_normed_vector) star => 'a star set
2906 galaxy :: ('a::real_normed_vector) star => 'a star set
2907 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
2908 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
2909 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
2910 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
2911 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
2912 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
2913 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
2914 sgn :: 'a::real_normed_vector => 'a
2915 exp :: 'a::{recpower,real_normed_field,banach} => 'a
2917 * Complex: Some complex-specific constants are now abbreviations for
2918 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
2919 hnorm. Other constants have been entirely removed in favor of the
2920 polymorphic versions (INCOMPATIBILITY):
2924 HInfinite <-- CInfinite
2925 Infinitesimal <-- CInfinitesimal
2928 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
2929 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
2930 (ns)deriv <-- (ns)cderiv
2935 * Formalisation of ideals and the quotient construction over rings.
2937 * Order and lattice theory no longer based on records.
2940 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
2941 greatest_closed. INCOMPATIBILITY.
2943 * Method algebra is now set up via an attribute. For examples see
2944 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
2945 of algebraic structures.
2947 * Renamed theory CRing to Ring.
2952 * Substantial, yet incomplete support for nominal datatypes (binding
2953 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
2954 src/HOL/Nominal/Examples. Prospective users should consult
2955 http://isabelle.in.tum.de/nominal/
2960 * ML basics: just one true type int, which coincides with IntInf.int
2963 * ML within Isar: antiquotations allow to embed statically-checked
2964 formal entities in the source, referring to the context available at
2965 compile-time. For example:
2967 ML {* @{sort "{zero,one}"} *}
2968 ML {* @{typ "'a => 'b"} *}
2969 ML {* @{term "%x. x"} *}
2970 ML {* @{prop "x == y"} *}
2971 ML {* @{ctyp "'a => 'b"} *}
2972 ML {* @{cterm "%x. x"} *}
2973 ML {* @{cprop "x == y"} *}
2974 ML {* @{thm asm_rl} *}
2975 ML {* @{thms asm_rl} *}
2976 ML {* @{type_name c} *}
2977 ML {* @{type_syntax c} *}
2978 ML {* @{const_name c} *}
2979 ML {* @{const_syntax c} *}
2982 ML {* @{theory Pure} *}
2983 ML {* @{theory_ref} *}
2984 ML {* @{theory_ref Pure} *}
2987 ML {* @{clasimpset} *}
2989 The same works for sources being ``used'' within an Isar context.
2991 * ML in Isar: improved error reporting; extra verbosity with
2992 ML_Context.trace enabled.
2994 * Pure/General/table.ML: the join operations now works via exceptions
2995 DUP/SAME instead of type option. This is simpler in simple cases, and
2996 admits slightly more efficient complex applications.
2998 * Pure: 'advanced' translation functions (parse_translation etc.) now
2999 use Context.generic instead of just theory.
3001 * Pure: datatype Context.generic joins theory/Proof.context and
3002 provides some facilities for code that works in either kind of
3003 context, notably GenericDataFun for uniform theory and proof data.
3005 * Pure: simplified internal attribute type, which is now always
3006 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3007 local (Proof.context) attributes have been discontinued, while
3008 minimizing code duplication. Thm.rule_attribute and
3009 Thm.declaration_attribute build canonical attributes; see also structure
3010 Context for further operations on Context.generic, notably
3011 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3012 declarations and definitions.
3014 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3015 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3016 init only required for impure data. INCOMPATIBILITY: empty really need
3017 to be empty (no dependencies on theory content!)
3019 * Pure/kernel: consts certification ignores sort constraints given in
3020 signature declarations. (This information is not relevant to the
3021 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3022 potential INCOMPATIBILITY.
3024 * Pure: axiomatic type classes are now purely definitional, with
3025 explicit proofs of class axioms and super class relations performed
3026 internally. See Pure/axclass.ML for the main internal interfaces --
3027 notably AxClass.define_class supercedes AxClass.add_axclass, and
3028 AxClass.axiomatize_class/classrel/arity supersede
3029 Sign.add_classes/classrel/arities.
3031 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3032 global/local versions on theory vs. Proof.context have been
3033 discontinued; Attrib.syntax and Method.syntax have been adapted
3034 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3035 attributes, methods, etc.
3037 * Pure: several functions of signature "... -> theory -> theory * ..."
3038 have been reoriented to "... -> theory -> ... * theory" in order to
3039 allow natural usage in combination with the ||>, ||>>, |-> and
3040 fold_map combinators.
3042 * Pure: official theorem names (closed derivations) and additional
3043 comments (tags) are now strictly separate. Name hints -- which are
3044 maintained as tags -- may be attached any time without affecting the
3047 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3048 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3049 achieve the old behaviour.
3051 * Pure: the "Goal" constant is now called "prop", supporting a
3052 slightly more general idea of ``protecting'' meta-level rule
3055 * Pure: Logic.(un)varify only works in a global context, which is now
3056 enforced instead of silently assumed. INCOMPATIBILITY, may use
3057 Logic.legacy_(un)varify as temporary workaround.
3059 * Pure: structure Name provides scalable operations for generating
3060 internal variable names, notably Name.variants etc. This replaces
3061 some popular functions from term.ML:
3063 Term.variant -> Name.variant
3064 Term.variantlist -> Name.variant_list
3065 Term.invent_names -> Name.invent_list
3067 Note that low-level renaming rarely occurs in new code -- operations
3068 from structure Variable are used instead (see below).
3070 * Pure: structure Variable provides fundamental operations for proper
3071 treatment of fixed/schematic variables in a context. For example,
3072 Variable.import introduces fixes for schematics of given facts and
3073 Variable.export reverses the effect (up to renaming) -- this replaces
3074 various freeze_thaw operations.
3076 * Pure: structure Goal provides simple interfaces for
3077 init/conclude/finish and tactical prove operations (replacing former
3078 Tactic.prove). Goal.prove is the canonical way to prove results
3079 within a given context; Goal.prove_global is a degraded version for
3080 theory level goals, including a global Drule.standard. Note that
3081 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3082 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3083 in a locale context).
3085 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3086 and type checking (Syntax.check_term etc.), with common combinations
3087 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3088 which are considered legacy and await removal.
3090 * Pure/Syntax: generic interfaces for type unchecking
3091 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3092 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3093 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3094 available for convenience, but refer to the very same operations using
3095 a mere theory instead of a full context.
3097 * Isar: simplified treatment of user-level errors, using exception
3098 ERROR of string uniformly. Function error now merely raises ERROR,
3099 without any side effect on output channels. The Isar toplevel takes
3100 care of proper display of ERROR exceptions. ML code may use plain
3101 handle/can/try; cat_error may be used to concatenate errors like this:
3103 ... handle ERROR msg => cat_error msg "..."
3105 Toplevel ML code (run directly or through the Isar toplevel) may be
3106 embedded into the Isar toplevel with exception display/debug like
3109 Isar.toplevel (fn () => ...)
3111 INCOMPATIBILITY, removed special transform_error facilities, removed
3112 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3113 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3114 -- use plain ERROR instead.
3116 * Isar: theory setup now has type (theory -> theory), instead of a
3117 list. INCOMPATIBILITY, may use #> to compose setup functions.
3119 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3120 ProofContext.debug/verbose flags.
3122 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3123 theory before entering a proof state. Transactions now always see a
3124 quasi-functional intermediate checkpoint, both in interactive and
3127 * Isar: simplified interfaces for outer syntax. Renamed
3128 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3129 OuterSyntax.add_parsers -- this functionality is now included in
3130 OuterSyntax.command etc. INCOMPATIBILITY.
3132 * Simplifier: the simpset of a running simplification process now
3133 contains a proof context (cf. Simplifier.the_context), which is the
3134 very context that the initial simpset has been retrieved from (by
3135 simpset_of/local_simpset_of). Consequently, all plug-in components
3136 (solver, looper etc.) may depend on arbitrary proof data.
3138 * Simplifier.inherit_context inherits the proof context (plus the
3139 local bounds) of the current simplification process; any simproc
3140 etc. that calls the Simplifier recursively should do this! Removed
3141 former Simplifier.inherit_bounds, which is already included here --
3142 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3143 specify an explicit context using Simplifier.context/theory_context.
3145 * Simplifier/Classical Reasoner: more abstract interfaces
3146 change_simpset/claset for modifying the simpset/claset reference of a
3147 theory; raw versions simpset/claset_ref etc. have been discontinued --
3150 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3156 * settings: the default heap location within ISABELLE_HOME_USER now
3157 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3158 Isabelle installations.
3160 * isabelle-process: option -S (secure mode) disables some critical
3161 operations, notably runtime compilation and evaluation of ML source
3164 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3166 * Support for parallel execution, using native multicore support of
3167 Poly/ML 5.1. The theory loader exploits parallelism when processing
3168 independent theories, according to the given theory header
3169 specifications. The maximum number of worker threads is specified via
3170 usedir option -M or the "max-threads" setting in Proof General. A
3171 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3172 to 6 on a 8-core machine. User-code needs to observe certain
3173 guidelines for thread-safe programming, see appendix A in the Isar
3174 Implementation manual.
3178 New in Isabelle2005 (October 2005)
3179 ----------------------------------
3183 * Theory headers: the new header syntax for Isar theories is
3186 imports <theory1> ... <theoryN>
3187 uses <file1> ... <fileM>
3190 where the 'uses' part is optional. The previous syntax
3192 theory <name> = <theory1> + ... + <theoryN>:
3194 will disappear in the next release. Use isatool fixheaders to convert
3195 existing theory files. Note that there is no change in ancient
3196 non-Isar theories now, but these will disappear soon.
3198 * Theory loader: parent theories can now also be referred to via
3199 relative and absolute paths.
3201 * Command 'find_theorems' searches for a list of criteria instead of a
3202 list of constants. Known criteria are: intro, elim, dest, name:string,
3203 simp:term, and any term. Criteria can be preceded by '-' to select
3204 theorems that do not match. Intro, elim, dest select theorems that
3205 match the current goal, name:s selects theorems whose fully qualified
3206 name contain s, and simp:term selects all simplification rules whose
3207 lhs match term. Any other term is interpreted as pattern and selects
3208 all theorems matching the pattern. Available in ProofGeneral under
3209 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3211 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3213 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3214 matching the current goal as introduction rule and not having "HOL."
3215 in their name (i.e. not being defined in theory HOL).
3217 * Command 'thms_containing' has been discontinued in favour of
3218 'find_theorems'; INCOMPATIBILITY.
3220 * Communication with Proof General is now 8bit clean, which means that
3221 Unicode text in UTF-8 encoding may be used within theory texts (both
3222 formal and informal parts). Cf. option -U of the Isabelle Proof
3223 General interface. Here are some simple examples (cf. src/HOL/ex):
3225 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3226 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3228 * Improved efficiency of the Simplifier and, to a lesser degree, the
3229 Classical Reasoner. Typical big applications run around 2 times
3233 *** Document preparation ***
3235 * Commands 'display_drafts' and 'print_drafts' perform simple output
3236 of raw sources. Only those symbols that do not require additional
3237 LaTeX packages (depending on comments in isabellesym.sty) are
3238 displayed properly, everything else is left verbatim. isatool display
3239 and isatool print are used as front ends (these are subject to the
3240 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3242 * Command tags control specific markup of certain regions of text,
3243 notably folding and hiding. Predefined tags include "theory" (for
3244 theory begin and end), "proof" for proof commands, and "ML" for
3245 commands involving ML code; the additional tags "visible" and
3246 "invisible" are unused by default. Users may give explicit tag
3247 specifications in the text, e.g. ''by %invisible (auto)''. The
3248 interpretation of tags is determined by the LaTeX job during document
3249 preparation: see option -V of isatool usedir, or options -n and -t of
3250 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3253 Several document versions may be produced at the same time via isatool
3254 usedir (the generated index.html will link all of them). Typical
3255 specifications include ''-V document=theory,proof,ML'' to present
3256 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3257 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3258 these parts without any formal replacement text. The Isabelle site
3259 default settings produce ''document'' and ''outline'' versions as
3262 * Several new antiquotations:
3264 @{term_type term} prints a term with its type annotated;
3266 @{typeof term} prints the type of a term;
3268 @{const const} is the same as @{term const}, but checks that the
3269 argument is a known logical constant;
3271 @{term_style style term} and @{thm_style style thm} print a term or
3272 theorem applying a "style" to it
3276 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3277 definitions, equations, inequations etc., 'concl' printing only the
3278 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3279 to print the specified premise. TermStyle.add_style provides an ML
3280 interface for introducing further styles. See also the "LaTeX Sugar"
3281 document practical applications. The ML antiquotation prints
3282 type-checked ML expressions verbatim.
3284 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3285 and 'text' support optional locale specification '(in loc)', which
3286 specifies the default context for interpreting antiquotations. For
3287 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3289 * Option 'locale=NAME' of antiquotations specifies an alternative
3290 context interpreting the subsequent argument. For example: @{thm
3291 [locale=lattice] inf_assoc}.
3293 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3296 * Proper output of antiquotations for theory commands involving a
3297 proof context (such as 'locale' or 'theorem (in loc) ...').
3299 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3300 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3302 * isatool usedir: new option -C (default true) controls whether option
3303 -D should include a copy of the original document directory; -C false
3304 prevents unwanted effects such as copying of administrative CVS data.
3309 * Considerably improved version of 'constdefs' command. Now performs
3310 automatic type-inference of declared constants; additional support for
3311 local structure declarations (cf. locales and HOL records), see also
3312 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3313 sequential dependencies of definitions within a single 'constdefs'
3314 section; moreover, the declared name needs to be an identifier. If
3315 all fails, consider to fall back on 'consts' and 'defs' separately.
3317 * Improved indexed syntax and implicit structures. First of all,
3318 indexed syntax provides a notational device for subscripted
3319 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3320 expressions. Secondly, in a local context with structure
3321 declarations, number indexes \<^sub>n or the empty index (default
3322 number 1) refer to a certain fixed variable implicitly; option
3323 show_structs controls printing of implicit structures. Typical
3324 applications of these concepts involve record types and locales.
3326 * New command 'no_syntax' removes grammar declarations (and
3327 translations) resulting from the given syntax specification, which is
3328 interpreted in the same manner as for the 'syntax' command.
3330 * 'Advanced' translation functions (parse_translation etc.) may depend
3331 on the signature of the theory context being presently used for
3332 parsing/printing, see also isar-ref manual.
3334 * Improved 'oracle' command provides a type-safe interface to turn an
3335 ML expression of type theory -> T -> term into a primitive rule of
3336 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3337 is already included here); see also FOL/ex/IffExample.thy;
3340 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3341 before); "cI" is no longer bound, use "c.intro" instead.
3342 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3343 axclasses vs. locales.
3345 * Improved internal renaming of symbolic identifiers -- attach primes
3346 instead of base 26 numbers.
3348 * New flag show_question_marks controls printing of leading question
3349 marks in schematic variable names.
3351 * In schematic variable names, *any* symbol following \<^isub> or
3352 \<^isup> is now treated as part of the base name. For example, the
3353 following works without printing of awkward ".0" indexes:
3355 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3358 * Inner syntax includes (*(*nested*) comments*).
3360 * Pretty printer now supports unbreakable blocks, specified in mixfix
3361 annotations as "(00...)".
3363 * Clear separation of logical types and nonterminals, where the latter
3364 may only occur in 'syntax' specifications or type abbreviations.
3365 Before that distinction was only partially implemented via type class
3366 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3367 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3368 exotic syntax specifications may require further adaption
3369 (e.g. Cube/Cube.thy).
3371 * Removed obsolete type class "logic", use the top sort {} instead.
3372 Note that non-logical types should be declared as 'nonterminals'
3373 rather than 'types'. INCOMPATIBILITY for new object-logic
3376 * Attributes 'induct' and 'cases': type or set names may now be
3377 locally fixed variables as well.
3379 * Simplifier: can now control the depth to which conditional rewriting
3380 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3383 * Simplifier: simplification procedures may now take the current
3384 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3385 interface), which is very useful for calling the Simplifier
3386 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3387 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3388 low-level mk_simproc no longer applies Logic.varify internally, to
3389 allow for use in a context of fixed variables.
3391 * thin_tac now works even if the assumption being deleted contains !!
3392 or ==>. More generally, erule now works even if the major premise of
3393 the elimination rule contains !! or ==>.
3395 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3397 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3398 from Pure, which contains all common declarations already. Both
3399 theories are defined via plain Isabelle/Isar .thy files.
3400 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3401 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3402 use isatool fixcpure to adapt your theory and ML sources.
3404 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3405 selections of theorems in named facts via index ranges.
3407 * 'print_theorems': in theory mode, really print the difference
3408 wrt. the last state (works for interactive theory development only),
3409 in proof mode print all local facts (cf. 'print_facts');
3411 * 'hide': option '(open)' hides only base names.
3413 * More efficient treatment of intermediate checkpoints in interactive
3416 * Code generator is now invoked via code_module (incremental code
3417 generation) and code_library (modular code generation, ML structures
3418 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3419 must be quoted when used as identifiers.
3421 * New 'value' command for reading, evaluating and printing terms using
3422 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3423 quoted when used as identifier.
3428 * New commands for the interpretation of locale expressions in
3429 theories (1), locales (2) and proof contexts (3). These generate
3430 proof obligations from the expression specification. After the
3431 obligations have been discharged, theorems of the expression are added
3432 to the theory, target locale or proof context. The synopsis of the
3433 commands is a follows:
3435 (1) interpretation expr inst
3436 (2) interpretation target < expr
3437 (3) interpret expr inst
3439 Interpretation in theories and proof contexts require a parameter
3440 instantiation of terms from the current context. This is applied to
3441 specifications and theorems of the interpreted expression.
3442 Interpretation in locales only permits parameter renaming through the
3443 locale expression. Interpretation is smart in that interpretations
3444 that are active already do not occur in proof obligations, neither are
3445 instantiated theorems stored in duplicate. Use 'print_interps' to
3446 inspect active interpretations of a particular locale. For details,
3447 see the Isar Reference manual. Examples can be found in
3448 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3450 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3451 'interpret' instead.
3453 * New context element 'constrains' for adding type constraints to
3456 * Context expressions: renaming of parameters with syntax
3459 * Locale declaration: 'includes' disallowed.
3461 * Proper static binding of attribute syntax -- i.e. types / terms /
3462 facts mentioned as arguments are always those of the locale definition
3463 context, independently of the context of later invocations. Moreover,
3464 locale operations (renaming and type / term instantiation) are applied
3465 to attribute arguments as expected.
3467 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3468 actual attributes; rare situations may require Attrib.attribute to
3469 embed those attributes into Attrib.src that lack concrete syntax.
3470 Attribute implementations need to cooperate properly with the static
3471 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3472 Attrib.XXX_thm etc. already do the right thing without further
3473 intervention. Only unusual applications -- such as "where" or "of"
3474 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3475 on the context and the facts involved -- may have to assign parsed
3476 values to argument tokens explicitly.
3478 * Changed parameter management in theorem generation for long goal
3479 statements with 'includes'. INCOMPATIBILITY: produces a different
3480 theorem statement in rare situations.
3482 * Locale inspection command 'print_locale' omits notes elements. Use
3483 'print_locale!' to have them included in the output.
3488 * Provers/hypsubst.ML: improved version of the subst method, for
3489 single-step rewriting: it now works in bound variable contexts. New is
3490 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3491 rewrite a different subterm than the original subst method, which is
3492 still available as 'simplesubst'.
3494 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3497 * Provers/trancl.ML: new transitivity reasoner for transitive and
3498 reflexive-transitive closure of relations.
3500 * Provers/blast.ML: new reference depth_limit to make blast's depth
3501 limit (previously hard-coded with a value of 20) user-definable.
3503 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3504 is peformed already. Object-logics merely need to finish their
3505 initial simpset configuration as before. INCOMPATIBILITY.
3510 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3513 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3515 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3516 and x-symbol; use option '-m epsilon' to get it actually printed.
3517 Moreover, the mathematically important symbolic identifier \<epsilon>
3518 becomes available as variable, constant etc. INCOMPATIBILITY,
3520 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3521 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3522 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3523 support corresponding Isar calculations.
3525 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3528 * theory SetInterval: changed the syntax for open intervals:
3537 The old syntax is still supported but will disappear in the next
3538 release. For conversion use the following Emacs search and replace
3539 patterns (these are not perfect but work quite well):
3541 {)\([^\.]*\)\.\. -> {\1<\.\.}
3542 \.\.\([^(}]*\)(} -> \.\.<\1}
3544 * Theory Commutative_Ring (in Library): method comm_ring for proving
3545 equalities in commutative rings; method 'algebra' provides a generic
3548 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3549 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3550 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3553 Some new syntax forms are available:
3555 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3556 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3557 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3558 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3560 The latter form "\<Sum>x < k. e" used to be based on a separate
3561 function "Summation", which has been discontinued.
3563 * theory Finite_Set: in structured induction proofs, the insert case
3564 is now 'case (insert x F)' instead of the old counterintuitive 'case
3567 * The 'refute' command has been extended to support a much larger
3568 fragment of HOL, including axiomatic type classes, constdefs and
3569 typedefs, inductive datatypes and recursion.
3571 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3572 Requires zChaff with proof generation to be installed. See
3573 HOL/ex/SAT_Examples.thy for examples.
3575 * Datatype induction via method 'induct' now preserves the name of the
3576 induction variable. For example, when proving P(xs::'a list) by
3577 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3578 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3579 in unstructured proof scripts.
3581 * Reworked implementation of records. Improved scalability for
3582 records with many fields, avoiding performance problems for type
3583 inference. Records are no longer composed of nested field types, but
3584 of nested extension types. Therefore the record type only grows linear
3585 in the number of extensions and not in the number of fields. The
3586 top-level (users) view on records is preserved. Potential
3587 INCOMPATIBILITY only in strange cases, where the theory depends on the
3588 old record representation. The type generated for a record is called
3589 <record_name>_ext_type.
3591 Flag record_quick_and_dirty_sensitive can be enabled to skip the
3592 proofs triggered by a record definition or a simproc (if
3593 quick_and_dirty is enabled). Definitions of large records can take
3596 New simproc record_upd_simproc for simplification of multiple record
3597 updates enabled by default. Moreover, trivial updates are also
3598 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
3599 occasionally, since simplification is more powerful by default.
3601 * typedef: proper support for polymorphic sets, which contain extra
3602 type-variables in the term.
3604 * Simplifier: automatically reasons about transitivity chains
3605 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
3606 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
3607 old proofs break occasionally as simplification may now solve more
3608 goals than previously.
3610 * Simplifier: converts x <= y into x = y if assumption y <= x is
3611 present. Works for all partial orders (class "order"), in particular
3612 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
3615 * Simplifier: new simproc for "let x = a in f x". If a is a free or
3616 bound variable or a constant then the let is unfolded. Otherwise
3617 first a is simplified to b, and then f b is simplified to g. If
3618 possible we abstract b from g arriving at "let x = b in h x",
3619 otherwise we unfold the let and arrive at g. The simproc can be
3620 enabled/disabled by the reference use_let_simproc. Potential
3621 INCOMPATIBILITY since simplification is more powerful by default.
3623 * Classical reasoning: the meson method now accepts theorems as arguments.
3625 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
3626 jobs to provide advice on the provability of subgoals.
3628 * Theory OrderedGroup and Ring_and_Field: various additions and
3629 improvements to faciliate calculations involving equalities and
3632 The following theorems have been eliminated or modified
3635 abs_eq now named abs_of_nonneg
3636 abs_of_ge_0 now named abs_of_nonneg
3637 abs_minus_eq now named abs_of_nonpos
3638 imp_abs_id now named abs_of_nonneg
3639 imp_abs_neg_id now named abs_of_nonpos
3640 mult_pos now named mult_pos_pos
3641 mult_pos_le now named mult_nonneg_nonneg
3642 mult_pos_neg_le now named mult_nonneg_nonpos
3643 mult_pos_neg2_le now named mult_nonneg_nonpos2
3644 mult_neg now named mult_neg_neg
3645 mult_neg_le now named mult_nonpos_nonpos
3647 * The following lemmas in Ring_and_Field have been added to the simplifier:
3650 not_square_less_zero
3652 The following lemmas have been deleted from Real/RealPow:
3662 * Theory Parity: added rules for simplifying exponents.
3666 The following theorems have been eliminated or modified
3669 list_all_Nil now named list_all.simps(1)
3670 list_all_Cons now named list_all.simps(2)
3671 list_all_conv now named list_all_iff
3672 set_mem_eq now named mem_iff
3674 * Theories SetsAndFunctions and BigO (see HOL/Library) support
3675 asymptotic "big O" calculations. See the notes in BigO.thy.
3680 * Theory RealDef: better support for embedding natural numbers and
3681 integers in the reals.
3683 The following theorems have been eliminated or modified
3686 exp_ge_add_one_self now requires no hypotheses
3687 real_of_int_add reversed direction of equality (use [symmetric])
3688 real_of_int_minus reversed direction of equality (use [symmetric])
3689 real_of_int_diff reversed direction of equality (use [symmetric])
3690 real_of_int_mult reversed direction of equality (use [symmetric])
3692 * Theory RComplete: expanded support for floor and ceiling functions.
3694 * Theory Ln is new, with properties of the natural logarithm
3696 * Hyperreal: There is a new type constructor "star" for making
3697 nonstandard types. The old type names are now type synonyms:
3701 hcomplex = complex star
3703 * Hyperreal: Many groups of similarly-defined constants have been
3704 replaced by polymorphic versions (INCOMPATIBILITY):
3706 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
3708 starset <-- starsetNat, starsetC
3709 *s* <-- *sNat*, *sc*
3710 starset_n <-- starsetNat_n, starsetC_n
3711 *sn* <-- *sNatn*, *scn*
3712 InternalSets <-- InternalNatSets, InternalCSets
3714 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3715 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
3716 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
3717 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
3718 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
3720 * Hyperreal: Many type-specific theorems have been removed in favor of
3721 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
3723 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
3724 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
3725 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
3726 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
3727 right_minus <-- hypreal_add_minus
3728 left_minus <-- {hypreal,hcomplex}_add_minus_left
3729 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
3730 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
3731 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
3732 mult_1_right <-- hcomplex_mult_one_right
3733 mult_zero_left <-- hcomplex_mult_zero_left
3734 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
3735 right_distrib <-- hypnat_add_mult_distrib2
3736 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
3737 right_inverse <-- hypreal_mult_inverse
3738 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
3739 order_refl <-- {hypreal,hypnat}_le_refl
3740 order_trans <-- {hypreal,hypnat}_le_trans
3741 order_antisym <-- {hypreal,hypnat}_le_anti_sym
3742 order_less_le <-- {hypreal,hypnat}_less_le
3743 linorder_linear <-- {hypreal,hypnat}_le_linear
3744 add_left_mono <-- {hypreal,hypnat}_add_left_mono
3745 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
3746 add_nonneg_nonneg <-- hypreal_le_add_order
3748 * Hyperreal: Separate theorems having to do with type-specific
3749 versions of constants have been merged into theorems that apply to the
3750 new polymorphic constants (INCOMPATIBILITY):
3752 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
3753 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
3754 STAR_Un <-- {STAR,NatStar,STARC}_Un
3755 STAR_Int <-- {STAR,NatStar,STARC}_Int
3756 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
3757 STAR_subset <-- {STAR,NatStar,STARC}_subset
3758 STAR_mem <-- {STAR,NatStar,STARC}_mem
3759 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
3760 STAR_diff <-- {STAR,STARC}_diff
3761 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
3762 STARC_hcomplex_of_complex}_image_subset
3763 starset_n_Un <-- starset{Nat,C}_n_Un
3764 starset_n_Int <-- starset{Nat,C}_n_Int
3765 starset_n_Compl <-- starset{Nat,C}_n_Compl
3766 starset_n_diff <-- starset{Nat,C}_n_diff
3767 InternalSets_Un <-- Internal{Nat,C}Sets_Un
3768 InternalSets_Int <-- Internal{Nat,C}Sets_Int
3769 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
3770 InternalSets_diff <-- Internal{Nat,C}Sets_diff
3771 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
3772 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
3773 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
3774 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
3775 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
3776 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3777 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
3778 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
3779 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
3780 starfun_diff <-- starfun{C,RC,CR}_diff
3781 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
3782 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
3783 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
3784 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
3785 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
3786 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
3787 starfun_Id <-- starfunC_Id
3788 starfun_approx <-- starfun{Nat,CR}_approx
3789 starfun_capprox <-- starfun{C,RC}_capprox
3790 starfun_abs <-- starfunNat_rabs
3791 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
3792 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
3793 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
3794 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
3795 starfun_add_capprox <-- starfun{C,RC}_add_capprox
3796 starfun_add_approx <-- starfunCR_add_approx
3797 starfun_inverse_inverse <-- starfunC_inverse_inverse
3798 starfun_divide <-- starfun{C,CR,RC}_divide
3799 starfun_n <-- starfun{Nat,C}_n
3800 starfun_n_mult <-- starfun{Nat,C}_n_mult
3801 starfun_n_add <-- starfun{Nat,C}_n_add
3802 starfun_n_add_minus <-- starfunNat_n_add_minus
3803 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
3804 starfun_n_minus <-- starfun{Nat,C}_n_minus
3805 starfun_n_eq <-- starfun{Nat,C}_n_eq
3807 star_n_add <-- {hypreal,hypnat,hcomplex}_add
3808 star_n_minus <-- {hypreal,hcomplex}_minus
3809 star_n_diff <-- {hypreal,hcomplex}_diff
3810 star_n_mult <-- {hypreal,hcomplex}_mult
3811 star_n_inverse <-- {hypreal,hcomplex}_inverse
3812 star_n_le <-- {hypreal,hypnat}_le
3813 star_n_less <-- {hypreal,hypnat}_less
3814 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
3815 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
3816 star_n_abs <-- hypreal_hrabs
3817 star_n_divide <-- hcomplex_divide
3819 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
3820 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
3821 star_of_diff <-- hypreal_of_real_diff
3822 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
3823 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
3824 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
3825 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
3826 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
3827 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
3828 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
3829 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
3830 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
3831 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
3832 star_of_number_of <-- {hypreal,hcomplex}_number_of
3833 star_of_number_less <-- number_of_less_hypreal_of_real_iff
3834 star_of_number_le <-- number_of_le_hypreal_of_real_iff
3835 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
3836 star_of_less_number <-- hypreal_of_real_less_number_of_iff
3837 star_of_le_number <-- hypreal_of_real_le_number_of_iff
3838 star_of_power <-- hypreal_of_real_power
3839 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
3841 * Hyperreal: new method "transfer" that implements the transfer
3842 principle of nonstandard analysis. With a subgoal that mentions
3843 nonstandard types like "'a star", the command "apply transfer"
3844 replaces it with an equivalent one that mentions only standard types.
3845 To be successful, all free variables must have standard types; non-
3846 standard variables must have explicit universal quantifiers.
3848 * Hyperreal: A theory of Taylor series.
3853 * Discontinued special version of 'constdefs' (which used to support
3854 continuous functions) in favor of the general Pure one with full
3857 * New simplification procedure for solving continuity conditions; it
3858 is much faster on terms with many nested lambda abstractions (cubic
3859 instead of exponential time).
3861 * New syntax for domain package: selector names are now optional.
3862 Parentheses should be omitted unless argument is lazy, for example:
3864 domain 'a stream = cons "'a" (lazy "'a stream")
3866 * New command 'fixrec' for defining recursive functions with pattern
3867 matching; defining multiple functions with mutual recursion is also
3868 supported. Patterns may include the constants cpair, spair, up, sinl,
3869 sinr, or any data constructor defined by the domain package. The given
3870 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
3871 syntax and examples.
3873 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
3874 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
3875 but the proof obligation additionally includes an admissibility
3876 requirement. The packages generate instances of class cpo or pcpo,
3877 with continuity and strictness theorems for Rep and Abs.
3879 * HOLCF: Many theorems have been renamed according to a more standard naming
3880 scheme (INCOMPATIBILITY):
3882 foo_inject: "foo$x = foo$y ==> x = y"
3883 foo_eq: "(foo$x = foo$y) = (x = y)"
3884 foo_less: "(foo$x << foo$y) = (x << y)"
3885 foo_strict: "foo$UU = UU"
3886 foo_defined: "... ==> foo$x ~= UU"
3887 foo_defined_iff: "(foo$x = UU) = (x = UU)"
3892 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
3893 including the First Isomorphism Theorem (on quotienting by the kernel
3896 * ZF/Simplifier: install second copy of type solver that actually
3897 makes use of TC rules declared to Isar proof contexts (or locales);
3898 the old version is still required for ML proof scripts.
3903 * Converted to Isar theory format; use locales instead of axiomatic
3909 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
3912 * Pure/library.ML no longer defines its own option datatype, but uses
3913 that of the SML basis, which has constructors NONE and SOME instead of
3914 None and Some, as well as exception Option.Option instead of OPTION.
3915 The functions the, if_none, is_some, is_none have been adapted
3916 accordingly, while Option.map replaces apsome.
3918 * Pure/library.ML: the exception LIST has been given up in favour of
3919 the standard exceptions Empty and Subscript, as well as
3920 Library.UnequalLengths. Function like Library.hd and Library.tl are
3921 superceded by the standard hd and tl functions etc.
3923 A number of basic list functions are no longer exported to the ML
3924 toplevel, as they are variants of predefined functions. The following
3925 suggests how one can translate existing code:
3927 rev_append xs ys = List.revAppend (xs, ys)
3928 nth_elem (i, xs) = List.nth (xs, i)
3929 last_elem xs = List.last xs
3930 flat xss = List.concat xss
3931 seq fs = List.app fs
3932 partition P xs = List.partition P xs
3933 mapfilter f xs = List.mapPartial f xs
3935 * Pure/library.ML: several combinators for linear functional
3936 transformations, notably reverse application and composition:
3939 (x, y) |-> f f #-> g
3941 * Pure/library.ML: introduced/changed precedence of infix operators:
3943 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
3945 infix 3 o oo ooo oooo;
3946 infix 4 ~~ upto downto;
3948 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
3951 * Pure/library.ML: natural list combinators fold, fold_rev, and
3952 fold_map support linear functional transformations and nesting. For
3955 fold f [x1, ..., xN] y =
3956 y |> f x1 |> ... |> f xN
3958 (fold o fold) f [xs1, ..., xsN] y =
3959 y |> fold f xs1 |> ... |> fold f xsN
3961 fold f [x1, ..., xN] =
3964 (fold o fold) f [xs1, ..., xsN] =
3965 fold f xs1 #> ... #> fold f xsN
3967 * Pure/library.ML: the following selectors on type 'a option are
3970 the: 'a option -> 'a (*partial*)
3971 these: 'a option -> 'a where 'a = 'b list
3972 the_default: 'a -> 'a option -> 'a
3973 the_list: 'a option -> 'a list
3975 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
3976 basic operations for association lists, following natural argument
3977 order; moreover the explicit equality predicate passed here avoids
3978 potentially expensive polymorphic runtime equality checks.
3979 The old functions may be expressed as follows:
3981 assoc = uncurry (AList.lookup (op =))
3982 assocs = these oo AList.lookup (op =)
3983 overwrite = uncurry (AList.update (op =)) o swap
3985 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
3987 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
3988 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
3990 replacing make_keylist and keyfilter (occassionally used)
3993 make_keylist = AList.make
3994 keyfilter = AList.find (op =)
3996 * eq_fst and eq_snd now take explicit equality parameter, thus
3997 avoiding eqtypes. Naive rewrites:
3999 eq_fst = eq_fst (op =)
4000 eq_snd = eq_snd (op =)
4002 * Removed deprecated apl and apr (rarely used).
4005 apl (n, op) =>>= curry op n
4006 apr (op, m) =>>= fn n => op (n, m)
4008 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4009 provides a reasonably efficient light-weight implementation of sets as
4012 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4013 few new operations; existing lookup and update are now curried to
4014 follow natural argument order (for use with fold etc.);
4015 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4017 * Pure/General: output via the Isabelle channels of
4018 writeln/warning/error etc. is now passed through Output.output, with a
4019 hook for arbitrary transformations depending on the print_mode
4020 (cf. Output.add_mode -- the first active mode that provides a output
4021 function wins). Already formatted output may be embedded into further
4022 text via Output.raw; the result of Pretty.string_of/str_of and derived
4023 functions (string_of_term/cterm/thm etc.) is already marked raw to
4024 accommodate easy composition of diagnostic messages etc. Programmers
4025 rarely need to care about Output.output or Output.raw at all, with
4026 some notable exceptions: Output.output is required when bypassing the
4027 standard channels (writeln etc.), or in token translations to produce
4028 properly formatted results; Output.raw is required when capturing
4029 already output material that will eventually be presented to the user
4030 a second time. For the default print mode, both Output.output and
4031 Output.raw have no effect.
4033 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4034 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4035 cumulative results are displayed at the end of a batch session.
4037 * Pure/General: File.sysify_path and File.quote_sysify path have been
4038 replaced by File.platform_path and File.shell_path (with appropriate
4039 hooks). This provides a clean interface for unusual systems where the
4040 internal and external process view of file names are different.
4042 * Pure: more efficient orders for basic syntactic entities: added
4043 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4044 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4045 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4046 orders now -- potential INCOMPATIBILITY for code that depends on a
4047 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4048 Library.sort_strings on result).
4050 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4051 fold_types traverse types/terms from left to right, observing natural
4052 argument order. Supercedes previous foldl_XXX versions, add_frees,
4053 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4055 * Pure: name spaces have been refined, with significant changes of the
4056 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4057 to extern(_table). The plain name entry path is superceded by a
4058 general 'naming' context, which also includes the 'policy' to produce
4059 a fully qualified name and external accesses of a fully qualified
4060 name; NameSpace.extend is superceded by context dependent
4061 Sign.declare_name. Several theory and proof context operations modify
4062 the naming context. Especially note Theory.restore_naming and
4063 ProofContext.restore_naming to get back to a sane state; note that
4064 Theory.add_path is no longer sufficient to recover from
4065 Theory.absolute_path in particular.
4067 * Pure: new flags short_names (default false) and unique_names
4068 (default true) for controlling output of qualified names. If
4069 short_names is set, names are printed unqualified. If unique_names is
4070 reset, the name prefix is reduced to the minimum required to achieve
4071 the original result when interning again, even if there is an overlap
4072 with earlier declarations.
4074 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4075 now 'extend', and 'merge' gets an additional Pretty.pp argument
4076 (useful for printing error messages). INCOMPATIBILITY.
4078 * Pure: major reorganization of the theory context. Type Sign.sg and
4079 Theory.theory are now identified, referring to the universal
4080 Context.theory (see Pure/context.ML). Actual signature and theory
4081 content is managed as theory data. The old code and interfaces were
4082 spread over many files and structures; the new arrangement introduces
4083 considerable INCOMPATIBILITY to gain more clarity:
4085 Context -- theory management operations (name, identity, inclusion,
4086 parents, ancestors, merge, etc.), plus generic theory data;
4088 Sign -- logical signature and syntax operations (declaring consts,
4089 types, etc.), plus certify/read for common entities;
4091 Theory -- logical theory operations (stating axioms, definitions,
4092 oracles), plus a copy of logical signature operations (consts,
4093 types, etc.); also a few basic management operations (Theory.copy,
4096 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4097 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4098 for convenience -- they merely return the theory.
4100 * Pure: type Type.tsig is superceded by theory in most interfaces.
4102 * Pure: the Isar proof context type is already defined early in Pure
4103 as Context.proof (note that ProofContext.context and Proof.context are
4104 aliases, where the latter is the preferred name). This enables other
4105 Isabelle components to refer to that type even before Isar is present.
4107 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4108 typeK, constK, axiomK, oracleK), but provide explicit operations for
4109 any of these kinds. For example, Sign.intern typeK is now
4110 Sign.intern_type, Theory.hide_space Sign.typeK is now
4111 Theory.hide_types. Also note that former
4112 Theory.hide_classes/types/consts are now
4113 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4114 internalize their arguments! INCOMPATIBILITY.
4116 * Pure: get_thm interface (of PureThy and ProofContext) expects
4117 datatype thmref (with constructors Name and NameSelection) instead of
4118 plain string -- INCOMPATIBILITY;
4120 * Pure: cases produced by proof methods specify options, where NONE
4121 means to remove case bindings -- INCOMPATIBILITY in
4124 * Pure: the following operations retrieve axioms or theorems from a
4125 theory node or theory hierarchy, respectively:
4127 Theory.axioms_of: theory -> (string * term) list
4128 Theory.all_axioms_of: theory -> (string * term) list
4129 PureThy.thms_of: theory -> (string * thm) list
4130 PureThy.all_thms_of: theory -> (string * thm) list
4132 * Pure: print_tac now outputs the goal through the trace channel.
4134 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4135 Reference Toplevel.debug (default false) controls detailed printing
4136 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4137 controls execution profiling -- set to 1 for time and 2 for space
4138 (both increase the runtime).
4140 * Isar session: The initial use of ROOT.ML is now always timed,
4141 i.e. the log will show the actual process times, in contrast to the
4142 elapsed wall-clock time that the outer shell wrapper produces.
4144 * Simplifier: improved handling of bound variables (nameless
4145 representation, avoid allocating new strings). Simprocs that invoke
4146 the Simplifier recursively should use Simplifier.inherit_bounds to
4147 avoid local name clashes. Failure to do so produces warnings
4148 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4149 for further details.
4151 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4152 bindings for all theorems stored within a given theory; this may help
4153 in porting non-Isar theories to Isar ones, while keeping ML proof
4154 scripts for the time being.
4156 * ML operator HTML.with_charset specifies the charset begin used for
4157 generated HTML files. For example:
4159 HTML.with_charset "utf-8" use_thy "Hebrew";
4160 HTML.with_charset "utf-8" use_thy "Chinese";
4165 * Allow symlinks to all proper Isabelle executables (Isabelle,
4166 isabelle, isatool etc.).
4168 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4169 isatool doc, isatool mkdir, display_drafts etc.).
4171 * isatool usedir: option -f allows specification of the ML file to be
4172 used by Isabelle; default is ROOT.ML.
4174 * New isatool version outputs the version identifier of the Isabelle
4175 distribution being used.
4177 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4178 (containing Boolean satisfiability problems) into Isabelle/HOL
4183 New in Isabelle2004 (April 2004)
4184 --------------------------------
4188 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4189 Replaces linorder.ML.
4191 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4192 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4193 (\<a>...\<z>), are now considered normal letters, and can therefore
4194 be used anywhere where an ASCII letter (a...zA...Z) has until
4195 now. COMPATIBILITY: This obviously changes the parsing of some
4196 terms, especially where a symbol has been used as a binder, say
4197 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4198 as an identifier. Fix it by inserting a space around former
4199 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4200 existing theory and ML files.
4202 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4204 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4205 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4206 a normal (but invisible) letter. For multiple letter subscripts repeat
4207 \<^isub> like this: x\<^isub>1\<^isub>2.
4209 * Pure: There are now sub-/superscripts that can span more than one
4210 character. Text between \<^bsub> and \<^esub> is set in subscript in
4211 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4212 superscript. The new control characters are not identifier parts.
4214 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4215 content of "..." to the latex file instead of \isacntrl... . The "..."
4216 may consist of any printable characters excluding the end bracket >.
4218 * Pure: Using new Isar command "finalconsts" (or the ML functions
4219 Theory.add_finals or Theory.add_finals_i) it is now possible to
4220 declare constants "final", which prevents their being given a definition
4221 later. It is useful for constants whose behaviour is fixed axiomatically
4222 rather than definitionally, such as the meta-logic connectives.
4224 * Pure: 'instance' now handles general arities with general sorts
4225 (i.e. intersections of classes),
4227 * Presentation: generated HTML now uses a CSS style sheet to make layout
4228 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4229 It can be changed to alter the colors/layout of generated pages.
4234 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4235 cut_tac, subgoal_tac and thin_tac:
4236 - Now understand static (Isar) contexts. As a consequence, users of Isar
4237 locales are no longer forced to write Isar proof scripts.
4238 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4240 - INCOMPATIBILITY: names of variables to be instantiated may no
4241 longer be enclosed in quotes. Instead, precede variable name with `?'.
4242 This is consistent with the instantiation attribute "where".
4244 * Attributes "where" and "of":
4245 - Now take type variables of instantiated theorem into account when reading
4246 the instantiation string. This fixes a bug that caused instantiated
4247 theorems to have too special types in some circumstances.
4248 - "where" permits explicit instantiations of type variables.
4250 * Calculation commands "moreover" and "also" no longer interfere with
4251 current facts ("this"), admitting arbitrary combinations with "then"
4255 - Goal statements involving the context element "includes" no longer
4256 generate theorems with internal delta predicates (those ending on
4257 "_axioms") in the premise.
4258 Resolve particular premise with <locale>.intro to obtain old form.
4259 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4260 specification and "includes" elements in goal statement.
4261 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4262 [intro?] and [elim?] (respectively) by default.
4263 - Experimental command for instantiation of locales in proof contexts:
4264 instantiate <label>[<attrs>]: <loc>
4265 Instantiates locale <loc> and adds all its theorems to the current context
4266 taking into account their attributes. Label and attrs are optional
4267 modifiers, like in theorem declarations. If present, names of
4268 instantiated theorems are qualified with <label>, and the attributes
4269 <attrs> are applied after any attributes these theorems might have already.
4270 If the locale has assumptions, a chained fact of the form
4271 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4272 are derived. The command does not support old-style locales declared
4273 with "locale (open)".
4274 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4276 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4282 * Proof import: new image HOL4 contains the imported library from
4283 the HOL4 system with about 2500 theorems. It is imported by
4284 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4285 can be used like any other Isabelle image. See
4286 HOL/Import/HOL/README for more information.
4289 - Much improved handling of linear and partial orders.
4290 Reasoners for linear and partial orders are set up for type classes
4291 "linorder" and "order" respectively, and are added to the default simpset
4292 as solvers. This means that the simplifier can build transitivity chains
4293 to solve goals from the assumptions.
4294 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4295 of blast or auto after simplification become unnecessary because the goal
4296 is solved by simplification already.
4298 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4299 all proved in axiomatic type classes for semirings, rings and fields.
4302 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4303 now formalized using the Ring_and_Field theory mentioned above.
4304 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4305 than before, because now they are set up once in a generic manner.
4306 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4307 Look for the general versions in Ring_and_Field (and Power if they concern
4310 * Type "rat" of the rational numbers is now available in HOL-Complex.
4313 - Record types are now by default printed with their type abbreviation
4314 instead of the list of all field types. This can be configured via
4315 the reference "print_record_type_abbr".
4316 - Simproc "record_upd_simproc" for simplification of multiple updates added
4317 (not enabled by default).
4318 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4319 EX x. x = sel r to True (not enabled by default).
4320 - Tactic "record_split_simp_tac" to split and simplify records added.
4322 * 'specification' command added, allowing for definition by
4323 specification. There is also an 'ax_specification' command that
4324 introduces the new constants axiomatically.
4326 * arith(_tac) is now able to generate counterexamples for reals as well.
4328 * HOL-Algebra: new locale "ring" for non-commutative rings.
4330 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4331 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4333 * HOL-Matrix: a first theory for matrices in HOL with an application of
4334 matrix theory to linear programming.
4336 * Unions and Intersections:
4337 The latex output syntax of UN and INT has been changed
4338 from "\Union x \in A. B" to "\Union_{x \in A} B"
4339 i.e. the index formulae has become a subscript.
4340 Similarly for "\Union x. B", and for \Inter instead of \Union.
4342 * Unions and Intersections over Intervals:
4343 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4344 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4345 like in normal math, and corresponding versions for < and for intersection.
4347 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4348 lexicographic dictonary ordering has been added as "lexord".
4350 * ML: the legacy theory structures Int and List have been removed. They had
4351 conflicted with ML Basis Library structures having the same names.
4353 * 'refute' command added to search for (finite) countermodels. Only works
4354 for a fragment of HOL. The installation of an external SAT solver is
4355 highly recommended. See "HOL/Refute.thy" for details.
4357 * 'quickcheck' command: Allows to find counterexamples by evaluating
4358 formulae under an assignment of free variables to random values.
4359 In contrast to 'refute', it can deal with inductive datatypes,
4360 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4366 * Streams now come with concatenation and are part of the HOLCF image
4370 New in Isabelle2003 (May 2003)
4371 ------------------------------
4375 * Provers/simplifier:
4377 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4378 Assumptions are now subject to complete mutual simplification,
4379 not just from left to right. The simplifier now preserves
4380 the order of assumptions.
4382 Potential INCOMPATIBILITY:
4384 -- simp sometimes diverges where the old version did
4385 not, e.g. invoking simp on the goal
4387 [| P (f x); y = x; f x = f y |] ==> Q
4389 now gives rise to the infinite reduction sequence
4391 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4393 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4396 -- Tactics combining classical reasoner and simplification (such as auto)
4397 are also affected by this change, because many of them rely on
4398 simp. They may sometimes diverge as well or yield a different numbers
4399 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4400 in case of problems. Sometimes subsequent calls to the classical
4401 reasoner will fail because a preceeding call to the simplifier too
4402 eagerly simplified the goal, e.g. deleted redundant premises.
4404 - The simplifier trace now shows the names of the applied rewrite rules
4406 - You can limit the number of recursive invocations of the simplifier
4407 during conditional rewriting (where the simplifie tries to solve the
4408 conditions before applying the rewrite rule):
4409 ML "simp_depth_limit := n"
4410 where n is an integer. Thus you can force termination where previously
4411 the simplifier would diverge.
4413 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4415 - No longer aborts on failed congruence proof. Instead, the
4416 congruence is ignored.
4418 * Pure: New generic framework for extracting programs from constructive
4419 proofs. See HOL/Extraction.thy for an example instantiation, as well
4420 as HOL/Extraction for some case studies.
4422 * Pure: The main goal of the proof state is no longer shown by default, only
4423 the subgoals. This behaviour is controlled by a new flag.
4424 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4425 (ML: Proof.show_main_goal).
4427 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4428 rules whose conclusion matches subgoal 1:
4429 PG menu: Isabelle/Isar -> Show me -> matching rules
4430 The rules are ordered by how closely they match the subgoal.
4431 In particular, rules that solve a subgoal outright are displayed first
4432 (or rather last, the way they are printed).
4433 (ML: ProofGeneral.print_intros())
4435 * Pure: New flag trace_unify_fail causes unification to print
4436 diagnostic information (PG: in trace buffer) when it fails. This is
4437 useful for figuring out why single step proofs like rule, erule or
4440 * Pure: Locale specifications now produce predicate definitions
4441 according to the body of text (covering assumptions modulo local
4442 definitions); predicate "loc_axioms" covers newly introduced text,
4443 while "loc" is cumulative wrt. all included locale expressions; the
4444 latter view is presented only on export into the global theory
4445 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4446 on the old view without predicates;
4448 * Pure: predefined locales "var" and "struct" are useful for sharing
4449 parameters (as in CASL, for example); just specify something like
4450 ``var x + var y + struct M'' as import;
4452 * Pure: improved thms_containing: proper indexing of facts instead of
4453 raw theorems; check validity of results wrt. current name space;
4454 include local facts of proof configuration (also covers active
4455 locales), cover fixed variables in index; may use "_" in term
4456 specification; an optional limit for the number of printed facts may
4457 be given (the default is 40);
4459 * Pure: disallow duplicate fact bindings within new-style theory files
4462 * Provers: improved induct method: assumptions introduced by case
4463 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4464 the goal statement); "foo" still refers to all facts collectively;
4466 * Provers: the function blast.overloaded has been removed: all constants
4467 are regarded as potentially overloaded, which improves robustness in exchange
4468 for slight decrease in efficiency;
4470 * Provers/linorder: New generic prover for transitivity reasoning over
4471 linear orders. Note: this prover is not efficient!
4473 * Isar: preview of problems to finish 'show' now produce an error
4474 rather than just a warning (in interactive mode);
4481 - Produces a counter example if it cannot prove a goal.
4482 Note that the counter example may be spurious if the goal is not a formula
4483 of quantifier-free linear arithmetic.
4484 In ProofGeneral the counter example appears in the trace buffer.
4486 - Knows about div k and mod k where k is a numeral of type nat or int.
4488 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4489 linear arithmetic fails. This takes account of quantifiers and divisibility.
4490 Presburger arithmetic can also be called explicitly via presburger(_tac).
4492 * simp's arithmetic capabilities have been enhanced a bit: it now
4493 takes ~= in premises into account (by performing a case split);
4495 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4496 are distributed over a sum of terms;
4498 * New tactic "trans_tac" and method "trans" instantiate
4499 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4502 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4503 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4505 * 'typedef' command has new option "open" to suppress the set
4508 * functions Min and Max on finite sets have been introduced (theory
4511 * attribute [symmetric] now works for relations as well; it turns
4512 (x,y) : R^-1 into (y,x) : R, and vice versa;
4514 * induct over a !!-quantified statement (say !!x1..xn):
4515 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4517 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4518 %x. None. Warning: empty_def now refers to the previously hidden definition
4521 * Algebra: formalization of classical algebra. Intended as base for
4522 any algebraic development in Isabelle. Currently covers group theory
4523 (up to Sylow's theorem) and ring theory (Universal Property of
4524 Univariate Polynomials). Contributions welcome;
4526 * GroupTheory: deleted, since its material has been moved to Algebra;
4528 * Complex: new directory of the complex numbers with numeric constants,
4529 nonstandard complex numbers, and some complex analysis, standard and
4530 nonstandard (Jacques Fleuriot);
4532 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4534 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4537 * Real/HahnBanach: updated and adapted to locales;
4539 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4542 * UNITY: added the Meier-Sanders theory of progress sets;
4544 * MicroJava: bytecode verifier and lightweight bytecode verifier
4545 as abstract algorithms, instantiated to the JVM;
4547 * Bali: Java source language formalization. Type system, operational
4548 semantics, axiomatic semantics. Supported language features:
4549 classes, interfaces, objects,virtual methods, static methods,
4550 static/instance fields, arrays, access modifiers, definite
4551 assignment, exceptions.
4556 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4559 * Main ZF: virtually all theories converted to new-style format;
4564 * Pure: Tactic.prove provides sane interface for internal proofs;
4565 omits the infamous "standard" operation, so this is more appropriate
4566 than prove_goalw_cterm in many situations (e.g. in simprocs);
4568 * Pure: improved error reporting of simprocs;
4570 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4574 *** Document preparation ***
4576 * uses \par instead of \\ for line breaks in theory text. This may
4577 shift some page breaks in large documents. To get the old behaviour
4578 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4580 * minimized dependencies of isabelle.sty and isabellesym.sty on
4583 * \<euro> now needs package babel/greek instead of marvosym (which
4586 * normal size for \<zero>...\<nine> (uses \mathbf instead of
4591 New in Isabelle2002 (March 2002)
4592 --------------------------------
4594 *** Document preparation ***
4596 * greatly simplified document preparation setup, including more
4597 graceful interpretation of isatool usedir -i/-d/-D options, and more
4598 instructive isatool mkdir; users should basically be able to get
4599 started with "isatool mkdir HOL Test && isatool make"; alternatively,
4600 users may run a separate document processing stage manually like this:
4601 "isatool usedir -D output HOL Test && isatool document Test/output";
4603 * theory dependency graph may now be incorporated into documents;
4604 isatool usedir -g true will produce session_graph.eps/.pdf for use
4605 with \includegraphics of LaTeX;
4607 * proper spacing of consecutive markup elements, especially text
4608 blocks after section headings;
4610 * support bold style (for single symbols only), input syntax is like
4611 this: "\<^bold>\<alpha>" or "\<^bold>A";
4613 * \<bullet> is now output as bold \cdot by default, which looks much
4614 better in printed text;
4616 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
4617 note that these symbols are currently unavailable in Proof General /
4618 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
4620 * isatool latex no longer depends on changed TEXINPUTS, instead
4621 isatool document copies the Isabelle style files to the target
4627 * Pure/Provers: improved proof by cases and induction;
4628 - 'case' command admits impromptu naming of parameters (such as
4630 - 'induct' method divinates rule instantiation from the inductive
4631 claim; no longer requires excessive ?P bindings for proper
4632 instantiation of cases;
4633 - 'induct' method properly enumerates all possibilities of set/type
4634 rules; as a consequence facts may be also passed through *type*
4635 rules without further ado;
4636 - 'induct' method now derives symbolic cases from the *rulified*
4637 rule (before it used to rulify cases stemming from the internal
4638 atomized version); this means that the context of a non-atomic
4639 statement becomes is included in the hypothesis, avoiding the
4640 slightly cumbersome show "PROP ?case" form;
4641 - 'induct' may now use elim-style induction rules without chaining
4642 facts, using ``missing'' premises from the goal state; this allows
4643 rules stemming from inductive sets to be applied in unstructured
4644 scripts, while still benefitting from proper handling of non-atomic
4645 statements; NB: major inductive premises need to be put first, all
4646 the rest of the goal is passed through the induction;
4647 - 'induct' proper support for mutual induction involving non-atomic
4648 rule statements (uses the new concept of simultaneous goals, see
4650 - append all possible rule selections, but only use the first
4651 success (no backtracking);
4652 - removed obsolete "(simplified)" and "(stripped)" options of methods;
4653 - undeclared rule case names default to numbers 1, 2, 3, ...;
4654 - added 'print_induct_rules' (covered by help item in recent Proof
4656 - moved induct/cases attributes to Pure, methods to Provers;
4657 - generic method setup instantiated for FOL and HOL;
4659 * Pure: support multiple simultaneous goal statements, for example
4660 "have a: A and b: B" (same for 'theorem' etc.); being a pure
4661 meta-level mechanism, this acts as if several individual goals had
4662 been stated separately; in particular common proof methods need to be
4663 repeated in order to cover all claims; note that a single elimination
4664 step is *not* sufficient to establish the two conjunctions, so this
4667 assume "A & B" then have A and B .. (*".." fails*)
4669 better use "obtain" in situations as above; alternative refer to
4670 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
4672 * Pure: proper integration with ``locales''; unlike the original
4673 version by Florian Kammller, Isar locales package high-level proof
4674 contexts rather than raw logical ones (e.g. we admit to include
4675 attributes everywhere); operations on locales include merge and
4676 rename; support for implicit arguments (``structures''); simultaneous
4677 type-inference over imports and text; see also HOL/ex/Locales.thy for
4680 * Pure: the following commands have been ``localized'', supporting a
4681 target locale specification "(in name)": 'lemma', 'theorem',
4682 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
4683 stored both within the locale and at the theory level (exported and
4684 qualified by the locale name);
4686 * Pure: theory goals may now be specified in ``long'' form, with
4687 ad-hoc contexts consisting of arbitrary locale elements. for example
4688 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
4689 definitions may be given, too); the result is a meta-level rule with
4690 the context elements being discharged in the obvious way;
4692 * Pure: new proof command 'using' allows to augment currently used
4693 facts after a goal statement ('using' is syntactically analogous to
4694 'apply', but acts on the goal's facts only); this allows chained facts
4695 to be separated into parts given before and after a claim, as in
4696 ``from a and b have C using d and e <proof>'';
4698 * Pure: renamed "antecedent" case to "rule_context";
4700 * Pure: new 'judgment' command records explicit information about the
4701 object-logic embedding (used by several tools internally); no longer
4702 use hard-wired "Trueprop";
4704 * Pure: added 'corollary' command;
4706 * Pure: fixed 'token_translation' command;
4708 * Pure: removed obsolete 'exported' attribute;
4710 * Pure: dummy pattern "_" in is/let is now automatically lifted over
4711 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
4712 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
4714 * Pure: method 'atomize' presents local goal premises as object-level
4715 statements (atomic meta-level propositions); setup controlled via
4716 rewrite rules declarations of 'atomize' attribute; example
4717 application: 'induct' method with proper rule statements in improper
4720 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
4721 now consider the syntactic context of assumptions, giving a better
4722 chance to get type-inference of the arguments right (this is
4723 especially important for locales);
4725 * Pure: "sorry" no longer requires quick_and_dirty in interactive
4728 * Pure/obtain: the formal conclusion "thesis", being marked as
4729 ``internal'', may no longer be reference directly in the text;
4730 potential INCOMPATIBILITY, may need to use "?thesis" in rare
4733 * Pure: generic 'sym' attribute which declares a rule both as pure
4734 'elim?' and for the 'symmetric' operation;
4736 * Pure: marginal comments ``--'' may now occur just anywhere in the
4737 text; the fixed correlation with particular command syntax has been
4740 * Pure: new method 'rules' is particularly well-suited for proof
4741 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
4742 but often produces more compact proof terms with less detours;
4744 * Pure/Provers/classical: simplified integration with pure rule
4745 attributes and methods; the classical "intro?/elim?/dest?"
4746 declarations coincide with the pure ones; the "rule" method no longer
4747 includes classically swapped intros; "intro" and "elim" methods no
4748 longer pick rules from the context; also got rid of ML declarations
4749 AddXIs/AddXEs/AddXDs; all of this has some potential for
4752 * Provers/classical: attribute 'swapped' produces classical inversions
4753 of introduction rules;
4755 * Provers/simplifier: 'simplified' attribute may refer to explicit
4756 rules instead of full simplifier context; 'iff' attribute handles
4759 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
4761 * HOL: 'recdef' now fails on unfinished automated proofs, use
4762 "(permissive)" option to recover old behavior;
4764 * HOL: 'inductive' no longer features separate (collective) attributes
4765 for 'intros' (was found too confusing);
4767 * HOL: properly declared induction rules less_induct and
4773 * HOL: moved over to sane numeral syntax; the new policy is as
4776 - 0 and 1 are polymorphic constants, which are defined on any
4777 numeric type (nat, int, real etc.);
4779 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
4780 binary representation internally;
4782 - type nat has special constructor Suc, and generally prefers Suc 0
4783 over 1::nat and Suc (Suc 0) over 2::nat;
4785 This change may cause significant problems of INCOMPATIBILITY; here
4786 are some hints on converting existing sources:
4788 - due to the new "num" token, "-0" and "-1" etc. are now atomic
4789 entities, so expressions involving "-" (unary or binary minus) need
4790 to be spaced properly;
4792 - existing occurrences of "1" may need to be constraint "1::nat" or
4793 even replaced by Suc 0; similar for old "2";
4795 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
4797 - remove all special provisions on numerals in proofs;
4799 * HOL: simp rules nat_number expand numerals on nat to Suc/0
4800 representation (depends on bin_arith_simps in the default context);
4802 * HOL: symbolic syntax for x^2 (numeral 2);
4804 * HOL: the class of all HOL types is now called "type" rather than
4805 "term"; INCOMPATIBILITY, need to adapt references to this type class
4806 in axclass/classes, instance/arities, and (usually rare) occurrences
4807 in typings (of consts etc.); internally the class is called
4808 "HOL.type", ML programs should refer to HOLogic.typeS;
4810 * HOL/record package improvements:
4811 - new derived operations "fields" to build a partial record section,
4812 "extend" to promote a fixed record to a record scheme, and
4813 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
4814 declared as simp by default;
4815 - shared operations ("more", "fields", etc.) now need to be always
4816 qualified) --- potential INCOMPATIBILITY;
4817 - removed "make_scheme" operations (use "make" with "extend") --
4819 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
4820 - provides cases/induct rules for use with corresponding Isar
4821 methods (for concrete records, record schemes, concrete more
4822 parts, and schematic more parts -- in that order);
4823 - internal definitions directly based on a light-weight abstract
4824 theory of product types over typedef rather than datatype;
4826 * HOL: generic code generator for generating executable ML code from
4827 specifications; specific support for HOL constructs such as inductive
4828 datatypes and sets, as well as recursive functions; can be invoked
4829 via 'generate_code' theory section;
4831 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
4833 * HOL: consolidated and renamed several theories. In particular:
4834 Ord.thy has been absorbed into HOL.thy
4835 String.thy has been absorbed into List.thy
4837 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
4838 (beware of argument permutation!);
4840 * HOL: linorder_less_split superseded by linorder_cases;
4842 * HOL/List: "nodups" renamed to "distinct";
4844 * HOL: added "The" definite description operator; move Hilbert's "Eps"
4845 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
4846 - Ex_def has changed, now need to use some_eq_ex
4848 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
4849 in this (rare) case use:
4851 delSWrapper "split_all_tac"
4852 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
4854 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
4857 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
4858 Isabelle's type classes, ^ on functions and relations has too general
4859 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
4860 necessary to attach explicit type constraints;
4862 * HOL/Relation: the prefix name of the infix "O" has been changed from
4863 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
4864 renamed accordingly (eg "compI" -> "rel_compI").
4866 * HOL: syntax translations now work properly with numerals and records
4869 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
4870 of "lam" -- INCOMPATIBILITY;
4872 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
4873 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
4874 renamed "Product_Type.unit";
4876 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
4878 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
4879 the "cases" method);
4881 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
4884 * HOL/IMP: updated and converted to new-style theory format; several
4885 parts turned into readable document, with proper Isar proof texts and
4886 some explanations (by Gerwin Klein);
4888 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
4890 * HOL-Hyperreal is now a logic image;
4895 * Isar: consts/constdefs supports mixfix syntax for continuous
4898 * Isar: domain package adapted to new-style theory format, e.g. see
4901 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
4902 potential INCOMPATIBILITY; now use plain induct_tac instead of former
4903 lift.induct_tac, always use UU instead of Undef;
4905 * HOLCF/IMP: updated and converted to new-style theory;
4910 * Isar: proper integration of logic-specific tools and packages,
4911 including theory commands '(co)inductive', '(co)datatype',
4912 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
4913 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
4915 * theory Main no longer includes AC; for the Axiom of Choice, base
4916 your theory on Main_ZFC;
4918 * the integer library now covers quotients and remainders, with many
4919 laws relating division to addition, multiplication, etc.;
4921 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
4922 typeless version of the formalism;
4924 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
4927 * ZF/Induct: new directory for examples of inductive definitions,
4928 including theory Multiset for multiset orderings; converted to
4929 new-style theory format;
4931 * ZF: many new theorems about lists, ordinals, etc.;
4936 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
4937 variable proof controls level of detail: 0 = no proofs (only oracle
4938 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
4939 also ref manual for further ML interfaces;
4941 * Pure/axclass: removed obsolete ML interface
4942 goal_subclass/goal_arity;
4944 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
4945 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
4946 separate tokens, so expressions involving minus need to be spaced
4949 * Pure/syntax: support non-oriented infixes, using keyword "infix"
4950 rather than "infixl" or "infixr";
4952 * Pure/syntax: concrete syntax for dummy type variables admits genuine
4953 sort constraint specifications in type inference; e.g. "x::_::foo"
4954 ensures that the type of "x" is of sort "foo" (but not necessarily a
4957 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
4958 control output of nested => (types); the default behavior is
4961 * Pure/syntax: builtin parse translation for "_constify" turns valued
4962 tokens into AST constants;
4964 * Pure/syntax: prefer later declarations of translations and print
4965 translation functions; potential INCOMPATIBILITY: need to reverse
4966 multiple declarations for same syntax element constant;
4968 * Pure/show_hyps reset by default (in accordance to existing Isar
4971 * Provers/classical: renamed addaltern to addafter, addSaltern to
4974 * Provers/clasimp: ``iff'' declarations now handle conditional rules
4977 * system: tested support for MacOS X; should be able to get Isabelle +
4978 Proof General to work in a plain Terminal after installing Poly/ML
4979 (e.g. from the Isabelle distribution area) and GNU bash alone
4980 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
4981 support requires further installations, e.g. from
4982 http://fink.sourceforge.net/);
4984 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
4986 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
4987 of 40 MB), cf. ML_OPTIONS;
4989 * system: Proof General keywords specification is now part of the
4990 Isabelle distribution (see etc/isar-keywords.el);
4992 * system: support for persistent Proof General sessions (refrain from
4993 outdating all loaded theories on startup); user may create writable
4994 logic images like this: ``isabelle -q HOL Test'';
4996 * system: smart selection of Isabelle process versus Isabelle
4997 interface, accommodates case-insensitive file systems (e.g. HFS+); may
4998 run both "isabelle" and "Isabelle" even if file names are badly
4999 damaged (executable inspects the case of the first letter of its own
5000 name); added separate "isabelle-process" and "isabelle-interface";
5002 * system: refrain from any attempt at filtering input streams; no
5003 longer support ``8bit'' encoding of old isabelle font, instead proper
5004 iso-latin characters may now be used; the related isatools
5005 "symbolinput" and "nonascii" have disappeared as well;
5007 * system: removed old "xterm" interface (the print modes "xterm" and
5008 "xterm_color" are still available for direct use in a suitable
5013 New in Isabelle99-2 (February 2001)
5014 -----------------------------------
5016 *** Overview of INCOMPATIBILITIES ***
5018 * HOL: please note that theories in the Library and elsewhere often use the
5019 new-style (Isar) format; to refer to their theorems in an ML script you must
5020 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5022 * HOL: inductive package no longer splits induction rule aggressively,
5023 but only as far as specified by the introductions given; the old
5024 format may be recovered via ML function complete_split_rule or attribute
5025 'split_rule (complete)';
5027 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5028 gfp_Tarski to gfp_unfold;
5030 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5032 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5033 relation); infix "^^" has been renamed "``"; infix "``" has been
5034 renamed "`"; "univalent" has been renamed "single_valued";
5036 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5039 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5041 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5043 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5044 consequence, it is no longer monotonic wrt. the local goal context
5045 (which is now passed through the inductive cases);
5047 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5048 \<gg> to \<ggreater>;
5051 *** Document preparation ***
5053 * \isabellestyle{NAME} selects version of Isabelle output (currently
5054 available: are "it" for near math-mode best-style output, "sl" for
5055 slanted text style, and "tt" for plain type-writer; if no
5056 \isabellestyle command is given, output is according to slanted
5059 * support sub/super scripts (for single symbols only), input syntax is
5060 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5062 * some more standard symbols; see Appendix A of the system manual for
5063 the complete list of symbols defined in isabellesym.sty;
5065 * improved isabelle style files; more abstract symbol implementation
5066 (should now use \isamath{...} and \isatext{...} in custom symbol
5069 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5070 state; Note that presentation of goal states does not conform to
5071 actual human-readable proof documents. Please do not include goal
5072 states into document output unless you really know what you are doing!
5074 * proper indentation of antiquoted output with proportional LaTeX
5077 * no_document ML operator temporarily disables LaTeX document
5080 * isatool unsymbolize tunes sources for plain ASCII communication;
5085 * Pure: Isar now suffers initial goal statements to contain unbound
5086 schematic variables (this does not conform to actual readable proof
5087 documents, due to unpredictable outcome and non-compositional proof
5088 checking); users who know what they are doing may use schematic goals
5089 for Prolog-style synthesis of proven results;
5091 * Pure: assumption method (an implicit finishing) now handles actual
5094 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5095 initial goal, declare "that" only as Pure intro (only for single
5096 steps); the "that" rule assumption may now be involved in implicit
5097 finishing, thus ".." becomes a feasible for trivial obtains;
5099 * Pure: default proof step now includes 'intro_classes'; thus trivial
5100 instance proofs may be performed by "..";
5102 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5105 * Pure: more robust selection of calculational rules;
5107 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5108 rule (as well as the assumption rule);
5110 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5111 lemmas, using the graph browser tool;
5113 * Pure: predict failure of "show" in interactive mode;
5115 * Pure: 'thms_containing' now takes actual terms as arguments;
5117 * HOL: improved method 'induct' --- now handles non-atomic goals
5118 (potential INCOMPATIBILITY); tuned error handling;
5120 * HOL: cases and induct rules now provide explicit hints about the
5121 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5122 any remaining facts are inserted into the goal verbatim;
5124 * HOL: local contexts (aka cases) may now contain term bindings as
5125 well; the 'cases' and 'induct' methods new provide a ?case binding for
5126 the result to be shown in each case;
5128 * HOL: added 'recdef_tc' command;
5130 * isatool convert assists in eliminating legacy ML scripts;
5135 * HOL/Library: a collection of generic theories to be used together
5136 with main HOL; the theory loader path already includes this directory
5137 by default; the following existing theories have been moved here:
5138 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5139 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5141 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5142 modelling and verification task performed in Isabelle/HOL +
5143 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5145 * HOL/Algebra: special summation operator SUM no longer exists, it has
5146 been replaced by setsum; infix 'assoc' now has priority 50 (like
5147 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5148 'domain', this makes the theory consistent with mathematical
5151 * HOL basics: added overloaded operations "inverse" and "divide"
5152 (infix "/"), syntax for generic "abs" operation, generic summation
5155 * HOL/typedef: simplified package, provide more useful rules (see also
5158 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5159 now expressed as a proper nested rule (old-style tactic scripts may
5160 require atomize_strip_tac to cope with non-atomic premises);
5162 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5163 to "split_conv" (old name still available for compatibility);
5165 * HOL: improved concrete syntax for strings (e.g. allows translation
5166 rules with string literals);
5168 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5169 and Fleuriot's mechanization of analysis, including the transcendental
5170 functions for the reals;
5172 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5177 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5178 "lam" is displayed as TWO lambda-symbols
5180 * CTT: theory Main now available, containing everything (that is, Bool
5186 * Pure: the Simplifier has been implemented properly as a derived rule
5187 outside of the actual kernel (at last!); the overall performance
5188 penalty in practical applications is about 50%, while reliability of
5189 the Isabelle inference kernel has been greatly improved;
5191 * print modes "brackets" and "no_brackets" control output of nested =>
5192 (types) and ==> (props); the default behaviour is "brackets";
5194 * Provers: fast_tac (and friends) now handle actual object-logic rules
5195 as assumptions as well;
5197 * system: support Poly/ML 4.0;
5199 * system: isatool install handles KDE version 1 or 2;
5203 New in Isabelle99-1 (October 2000)
5204 ----------------------------------
5206 *** Overview of INCOMPATIBILITIES ***
5208 * HOL: simplification of natural numbers is much changed; to partly
5209 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5210 issue the following ML commands:
5212 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5213 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5215 * HOL: simplification no longer dives into case-expressions; this is
5216 controlled by "t.weak_case_cong" for each datatype t;
5218 * HOL: nat_less_induct renamed to less_induct;
5220 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5221 fixsome to patch .thy and .ML sources automatically;
5223 select_equality -> some_equality
5224 select_eq_Ex -> some_eq_ex
5225 selectI2EX -> someI2_ex
5228 select1_equality -> some1_equality
5229 Eps_sym_eq -> some_sym_eq_trivial
5230 Eps_eq -> some_eq_trivial
5232 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5234 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5237 * HOL: the recursion equations generated by 'recdef' are now called
5238 f.simps instead of f.rules;
5240 * HOL: qed_spec_mp now also handles bounded ALL as well;
5242 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5243 sometimes be needed;
5245 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5247 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5249 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5250 product is now "<*>" instead of "Times"; the lexicographic product is
5251 now "<*lex*>" instead of "**";
5253 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5254 of main HOL, but was unused); better use HOL's datatype package;
5256 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5257 the old syntax may be recovered as follows:
5260 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5261 (infixl "\\<oplus>" 100)
5263 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5265 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5266 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5269 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5270 changed from A/r to A//r;
5272 * ZF: new treatment of arithmetic (nat & int) may break some old
5275 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5276 rulify -> rule_format, elimify -> elim_format, ...);
5278 * Isar/Provers: intro/elim/dest attributes changed; renamed
5279 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5280 should have to change intro!! to intro? only); replaced "delrule" by
5283 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5285 * Provers: strengthened force_tac by using new first_best_tac;
5287 * LaTeX document preparation: several changes of isabelle.sty (see
5291 *** Document preparation ***
5293 * formal comments (text blocks etc.) in new-style theories may now
5294 contain antiquotations of thm/prop/term/typ/text to be presented
5295 according to latex print mode; concrete syntax is like this:
5296 @{term[show_types] "f(x) = a + x"};
5298 * isatool mkdir provides easy setup of Isabelle session directories,
5299 including proper document sources;
5301 * generated LaTeX sources are now deleted after successful run
5302 (isatool document -c); may retain a copy somewhere else via -D option
5305 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5306 style files, achieving self-contained LaTeX sources and simplifying
5309 * old-style theories now produce (crude) LaTeX output as well;
5311 * browser info session directories are now self-contained (may be put
5312 on WWW server seperately); improved graphs of nested sessions; removed
5313 graph for 'all sessions';
5315 * several improvements in isabelle style files; \isabellestyle{it}
5316 produces fake math mode output; \isamarkupheader is now \section by
5317 default; see lib/texinputs/isabelle.sty etc.;
5322 * Isar/Pure: local results and corresponding term bindings are now
5323 subject to Hindley-Milner polymorphism (similar to ML); this
5324 accommodates incremental type-inference very nicely;
5326 * Isar/Pure: new derived language element 'obtain' supports
5327 generalized existence reasoning;
5329 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5330 support accumulation of results, without applying any rules yet;
5331 useful to collect intermediate results without explicit name
5332 references, and for use with transitivity rules with more than 2
5335 * Isar/Pure: scalable support for case-analysis type proofs: new
5336 'case' language element refers to local contexts symbolically, as
5337 produced by certain proof methods; internally, case names are attached
5338 to theorems as "tags";
5340 * Isar/Pure: theory command 'hide' removes declarations from
5341 class/type/const name spaces;
5343 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5344 indicate potential overloading;
5346 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5348 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5349 "{a,b,c}" instead of {a,b,c};
5351 * Isar/Pure now provides its own version of intro/elim/dest
5352 attributes; useful for building new logics, but beware of confusion
5353 with the version in Provers/classical;
5355 * Isar/Pure: the local context of (non-atomic) goals is provided via
5356 case name 'antecedent';
5358 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5359 to the current context is now done automatically);
5361 * Isar/Pure: theory command 'method_setup' provides a simple interface
5362 for definining proof methods in ML;
5364 * Isar/Provers: intro/elim/dest attributes changed; renamed
5365 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5366 most cases, one should have to change intro!! to intro? only);
5367 replaced "delrule" by "rule del";
5369 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5370 'symmetric' attribute (the latter supercedes [RS sym]);
5372 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5373 method modifier); 'simp' method: 'only:' modifier removes loopers as
5374 well (including splits);
5376 * Isar/Provers: Simplifier and Classical methods now support all kind
5377 of modifiers used in the past, including 'cong', 'iff', etc.
5379 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5380 of Simplifier and Classical reasoner);
5382 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5383 now support named cases; major packages (inductive, datatype, primrec,
5384 recdef) support case names and properly name parameters;
5386 * Isar/HOL: new transitivity rules for substitution in inequalities --
5387 monotonicity conditions are extracted to be proven at end of
5390 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5393 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5394 split_if split_if_asm; datatype package provides theorems foo.splits =
5395 foo.split foo.split_asm for each datatype;
5397 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5398 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5399 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5400 use "(cases (simplified))" method in proper proof texts);
5402 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5404 * Isar: names of theorems etc. may be natural numbers as well;
5406 * Isar: 'pr' command: optional arguments for goals_limit and
5407 ProofContext.prems_limit; no longer prints theory contexts, but only
5410 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5411 additional print modes to be specified; e.g. "pr(latex)" will print
5412 proof state according to the Isabelle LaTeX style;
5414 * Isar: improved support for emulating tactic scripts, including proof
5415 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5416 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5417 (for HOL datatypes);
5419 * Isar: simplified (more robust) goal selection of proof methods: 1st
5420 goal, all goals, or explicit goal specifier (tactic emulation); thus
5421 'proof method scripts' have to be in depth-first order;
5423 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5425 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5426 should instead use individual commands for printing items
5427 (print_commands, print_methods etc.);
5429 * Isar: added 'nothing' --- the empty list of theorems;
5434 * HOL/MicroJava: formalization of a fragment of Java, together with a
5435 corresponding virtual machine and a specification of its bytecode
5436 verifier and a lightweight bytecode verifier, including proofs of
5437 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5438 Cornelia Pusch (see also the homepage of project Bali at
5439 http://isabelle.in.tum.de/Bali/);
5441 * HOL/Algebra: new theory of rings and univariate polynomials, by
5444 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5445 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5448 * HOL/Lattice: fundamental concepts of lattice theory and order
5449 structures, including duals, properties of bounds versus algebraic
5450 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5451 Theorem for complete lattices etc.; may also serve as a demonstration
5452 for abstract algebraic reasoning using axiomatic type classes, and
5453 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5455 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5458 * HOL/IMPP: extension of IMP with local variables and mutually
5459 recursive procedures, by David von Oheimb;
5461 * HOL/Lambda: converted into new-style theory and document;
5463 * HOL/ex/Multiquote: example of multiple nested quotations and
5464 anti-quotations -- basically a generalized version of de-Bruijn
5465 representation; very useful in avoiding lifting of operations;
5467 * HOL/record: added general record equality rule to simpset; fixed
5468 select-update simplification procedure to handle extended records as
5469 well; admit "r" as field name;
5471 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5472 other numeric types and also as the identity of groups, rings, etc.;
5474 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5475 Types nat and int belong to this axclass;
5477 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5478 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5479 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5480 two terms #m*u and #n*u are replaced by #(m+n)*u
5481 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5482 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5483 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5485 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5486 powerful prover for predicate logic but knows nothing of clasets; see
5487 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5489 * HOL: new version of "case_tac" subsumes both boolean case split and
5490 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5491 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5493 * HOL: simplification no longer dives into case-expressions: only the
5494 selector expression is simplified, but not the remaining arms; to
5495 enable full simplification of case-expressions for datatype t, you may
5496 remove t.weak_case_cong from the simpset, either globally (Delcongs
5497 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5499 * HOL/recdef: the recursion equations generated by 'recdef' for
5500 function 'f' are now called f.simps instead of f.rules; if all
5501 termination conditions are proved automatically, these simplification
5502 rules are added to the simpset, as in primrec; rules may be named
5503 individually as well, resulting in a separate list of theorems for
5506 * HOL/While is a new theory that provides a while-combinator. It
5507 permits the definition of tail-recursive functions without the
5508 provision of a termination measure. The latter is necessary once the
5509 invariant proof rule for while is applied.
5511 * HOL: new (overloaded) notation for the set of elements below/above
5512 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5514 * HOL: theorems impI, allI, ballI bound as "strip";
5516 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5517 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5518 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5520 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5522 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5523 main HOL, but was unused);
5525 * HOL: fewer consts declared as global (e.g. have to refer to
5526 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5528 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5529 in case of overlap with user translations (e.g. judgements over
5530 tuples); (note that the underlying logical represenation is still
5536 * ZF: simplification automatically cancels common terms in arithmetic
5537 expressions over nat and int;
5539 * ZF: new treatment of nat to minimize type-checking: all operators
5540 coerce their operands to a natural number using the function natify,
5541 making the algebraic laws unconditional;
5543 * ZF: as above, for int: operators coerce their operands to an integer
5544 using the function intify;
5546 * ZF: the integer library now contains many of the usual laws for the
5547 orderings, including $<=, and monotonicity laws for $+ and $*;
5549 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5552 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5553 to the simplifier and classical reasoner simultaneously;
5558 * Provers: blast_tac now handles actual object-logic rules as
5559 assumptions; note that auto_tac uses blast_tac internally as well;
5561 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5562 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5564 * Provers: delrules now handles destruct rules as well (no longer need
5565 explicit make_elim);
5567 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5568 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5569 use instead the strong form,
5570 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5571 in HOL, FOL and ZF the function cla_make_elim will create such rules
5572 from destruct-rules;
5574 * Provers: Simplifier.easy_setup provides a fast path to basic
5575 Simplifier setup for new object-logics;
5577 * Pure: AST translation rules no longer require constant head on LHS;
5579 * Pure: improved name spaces: ambiguous output is qualified; support
5580 for hiding of names;
5582 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5583 XSYMBOL_HOME; no longer need to do manual configuration in most
5586 * system: compression of ML heaps images may now be controlled via -c
5587 option of isabelle and isatool usedir (currently only observed by
5590 * system: isatool installfonts may handle X-Symbol fonts as well (very
5591 useful for remote X11);
5593 * system: provide TAGS file for Isabelle sources;
5595 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
5598 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
5599 timing flag supersedes proof_timing and Toplevel.trace;
5601 * ML: new combinators |>> and |>>> for incremental transformations
5602 with secondary results (e.g. certain theory extensions):
5604 * ML: PureThy.add_defs gets additional argument to indicate potential
5605 overloading (usually false);
5607 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
5612 New in Isabelle99 (October 1999)
5613 --------------------------------
5615 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5617 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
5618 are no longer simplified. (This allows the simplifier to unfold recursive
5619 functional programs.) To restore the old behaviour, declare
5621 Delcongs [if_weak_cong];
5623 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
5626 * HOL: the predicate "inj" is now defined by translation to "inj_on";
5628 * HOL/datatype: mutual_induct_tac no longer exists --
5629 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
5631 * HOL/typedef: fixed type inference for representing set; type
5632 arguments now have to occur explicitly on the rhs as type constraints;
5634 * ZF: The con_defs part of an inductive definition may no longer refer
5635 to constants declared in the same theory;
5637 * HOL, ZF: the function mk_cases, generated by the inductive
5638 definition package, has lost an argument. To simplify its result, it
5639 uses the default simpset instead of a supplied list of theorems.
5641 * HOL/List: the constructors of type list are now Nil and Cons;
5643 * Simplifier: the type of the infix ML functions
5644 setSSolver addSSolver setSolver addSolver
5645 is now simpset * solver -> simpset where `solver' is a new abstract type
5646 for packaging solvers. A solver is created via
5647 mk_solver: string -> (thm list -> int -> tactic) -> solver
5648 where the string argument is only a comment.
5653 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
5654 decision procedure for linear arithmetic. Currently it is used for
5655 types `nat', `int', and `real' in HOL (see below); it can, should and
5656 will be instantiated for other types and logics as well.
5658 * The simplifier now accepts rewrite rules with flexible heads, eg
5659 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
5660 They are applied like any rule with a non-pattern lhs, i.e. by first-order
5666 * New Isabelle/Isar subsystem provides an alternative to traditional
5667 tactical theorem proving; together with the ProofGeneral/isar user
5668 interface it offers an interactive environment for developing human
5669 readable proof documents (Isar == Intelligible semi-automated
5670 reasoning); for further information see isatool doc isar-ref,
5671 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
5673 * improved and simplified presentation of theories: better HTML markup
5674 (including colors), graph views in several sizes; isatool usedir now
5675 provides a proper interface for user theories (via -P option); actual
5676 document preparation based on (PDF)LaTeX is available as well (for
5677 new-style theories only); see isatool doc system for more information;
5679 * native support for Proof General, both for classic Isabelle and
5682 * ML function thm_deps visualizes dependencies of theorems and lemmas,
5683 using the graph browser tool;
5685 * Isabelle manuals now also available as PDF;
5687 * theory loader rewritten from scratch (may not be fully
5688 bug-compatible); old loadpath variable has been replaced by show_path,
5689 add_path, del_path, reset_path functions; new operations such as
5690 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
5693 * improved isatool install: option -k creates KDE application icon,
5694 option -p DIR installs standalone binaries;
5696 * added ML_PLATFORM setting (useful for cross-platform installations);
5697 more robust handling of platform specific ML images for SML/NJ;
5699 * the settings environment is now statically scoped, i.e. it is never
5700 created again in sub-processes invoked from isabelle, isatool, or
5703 * path element specification '~~' refers to '$ISABELLE_HOME';
5705 * in locales, the "assumes" and "defines" parts may be omitted if
5708 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
5711 * new print_mode "HTML";
5713 * new flag show_tags controls display of tags of theorems (which are
5714 basically just comments that may be attached by some tools);
5716 * Isamode 2.6 requires patch to accomodate change of Isabelle font
5717 mode and goal output format:
5719 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
5721 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
5723 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
5724 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
5726 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
5728 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
5730 * function bind_thms stores lists of theorems (cf. bind_thm);
5732 * new shorthand tactics ftac, eatac, datac, fatac;
5734 * qed (and friends) now accept "" as result name; in that case the
5735 theorem is not stored, but proper checks and presentation of the
5738 * theorem database now also indexes constants "Trueprop", "all",
5739 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
5744 ** HOL arithmetic **
5746 * There are now decision procedures for linear arithmetic over nat and
5749 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
5750 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
5751 are treated as atomic; subformulae not involving type `nat' or `int'
5752 are ignored; quantified subformulae are ignored unless they are
5753 positive universal or negative existential. The tactic has to be
5754 invoked by hand and can be a little bit slow. In particular, the
5755 running time is exponential in the number of occurrences of `min' and
5756 `max', and `-' on `nat'.
5758 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
5759 (negated) (in)equalities among the premises and the conclusion into
5760 account (i.e. no compound formulae) and does not know about `min' and
5761 `max', and `-' on `nat'. It is fast and is used automatically by the
5764 NB: At the moment, these decision procedures do not cope with mixed
5765 nat/int formulae where the two parts interact, such as `m < n ==>
5768 * HOL/Numeral provides a generic theory of numerals (encoded
5769 efficiently as bit strings); setup for types nat/int/real is in place;
5770 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
5771 int, existing theories and proof scripts may require a few additional
5774 * integer division and remainder can now be performed on constant
5777 * many properties of integer multiplication, division and remainder
5780 * An interface to the Stanford Validity Checker (SVC) is available through the
5781 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
5782 are proved automatically. SVC must be installed separately, and its results
5783 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
5784 invocation of the underlying oracle). For SVC see
5785 http://verify.stanford.edu/SVC
5787 * IsaMakefile: the HOL-Real target now builds an actual image;
5792 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
5793 (in Isabelle/Isar) -- by Gertrud Bauer;
5795 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
5796 analysis for assembly languages with subtypes;
5798 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
5799 -- avoids syntactic ambiguities and treats state, transition, and
5800 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
5801 changed syntax and (many) tactics;
5803 * HOL/inductive: Now also handles more general introduction rules such
5804 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
5805 theorems are now maintained within the theory (maintained via the
5808 * HOL/datatype: Now also handles arbitrarily branching datatypes
5809 (using function types) such as
5811 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
5813 * HOL/record: record_simproc (part of the default simpset) takes care
5814 of selectors applied to updated records; record_split_tac is no longer
5815 part of the default claset; update_defs may now be removed from the
5816 simpset in many cases; COMPATIBILITY: old behavior achieved by
5818 claset_ref () := claset() addSWrapper record_split_wrapper;
5819 Delsimprocs [record_simproc]
5821 * HOL/typedef: fixed type inference for representing set; type
5822 arguments now have to occur explicitly on the rhs as type constraints;
5824 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
5825 names rather than an ML expression;
5827 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
5828 supplied later. Program schemes can be defined, such as
5829 "While B C s = (if B s then While B C (C s) else s)"
5830 where the well-founded relation can be chosen after B and C have been given.
5832 * HOL/List: the constructors of type list are now Nil and Cons;
5833 INCOMPATIBILITY: while [] and infix # syntax is still there, of
5834 course, ML tools referring to List.list.op # etc. have to be adapted;
5836 * HOL_quantifiers flag superseded by "HOL" print mode, which is
5837 disabled by default; run isabelle with option -m HOL to get back to
5838 the original Gordon/HOL-style output;
5840 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
5841 ALL x<=y. P, EX x<y. P, EX x<=y. P;
5843 * HOL basic syntax simplified (more orthogonal): all variants of
5844 All/Ex now support plain / symbolic / HOL notation; plain syntax for
5845 Eps operator is provided as well: "SOME x. P[x]";
5847 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
5849 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
5850 thus available for user theories;
5852 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
5853 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
5856 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
5857 several times and then mp;
5862 * the notation <<...>> is now available as a notation for sequences of
5865 * the simplifier is now installed
5867 * the axiom system has been generalized (thanks to Soren Heilmann)
5869 * the classical reasoner now has a default rule database
5874 * new primrec section allows primitive recursive functions to be given
5875 directly (as in HOL) over datatypes and the natural numbers;
5877 * new tactics induct_tac and exhaust_tac for induction (or case
5878 analysis) over datatypes and the natural numbers;
5880 * the datatype declaration of type T now defines the recursor T_rec;
5882 * simplification automatically does freeness reasoning for datatype
5885 * automatic type-inference, with AddTCs command to insert new
5886 type-checking rules;
5888 * datatype introduction rules are now added as Safe Introduction rules
5891 * the syntax "if P then x else y" is now available in addition to
5895 *** Internal programming interfaces ***
5897 * tuned simplifier trace output; new flag debug_simp;
5899 * structures Vartab / Termtab (instances of TableFun) offer efficient
5900 tables indexed by indexname_ord / term_ord (compatible with aconv);
5902 * AxClass.axclass_tac lost the theory argument;
5904 * tuned current_goals_markers semantics: begin / end goal avoids
5905 printing empty lines;
5907 * removed prs and prs_fn hook, which was broken because it did not
5908 include \n in its semantics, forcing writeln to add one
5909 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
5910 string -> unit if you really want to output text without newline;
5912 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
5913 plain output, interface builders may have to enable 'isabelle_font'
5914 mode to get Isabelle font glyphs as before;
5916 * refined token_translation interface; INCOMPATIBILITY: output length
5917 now of type real instead of int;
5919 * theory loader actions may be traced via new ThyInfo.add_hook
5920 interface (see src/Pure/Thy/thy_info.ML); example application: keep
5921 your own database of information attached to *whole* theories -- as
5922 opposed to intra-theory data slots offered via TheoryDataFun;
5924 * proper handling of dangling sort hypotheses (at last!);
5925 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
5926 extra sort hypotheses that can be witnessed from the type signature;
5927 the force_strip_shyps flag is gone, any remaining shyps are simply
5928 left in the theorem (with a warning issued by strip_shyps_warning);
5932 New in Isabelle98-1 (October 1998)
5933 ----------------------------------
5935 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5937 * several changes of automated proof tools;
5939 * HOL: major changes to the inductive and datatype packages, including
5940 some minor incompatibilities of theory syntax;
5942 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
5945 * HOL: removed duplicate thms in Arith:
5946 less_imp_add_less should be replaced by trans_less_add1
5947 le_imp_add_le should be replaced by trans_le_add1
5949 * HOL: unary minus is now overloaded (new type constraints may be
5952 * HOL and ZF: unary minus for integers is now #- instead of #~. In
5953 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
5954 now taken as an integer constant.
5956 * Pure: ML function 'theory_of' renamed to 'theory';
5962 1. Asm_full_simp_tac is now more aggressive.
5963 1. It will sometimes reorient premises if that increases their power to
5965 2. It does no longer proceed strictly from left to right but may also
5966 rotate premises to achieve further simplification.
5967 For compatibility reasons there is now Asm_lr_simp_tac which is like the
5968 old Asm_full_simp_tac in that it does not rotate premises.
5969 2. The simplifier now knows a little bit about nat-arithmetic.
5971 * Classical reasoner: wrapper mechanism for the classical reasoner now
5972 allows for selected deletion of wrappers, by introduction of names for
5973 wrapper functionals. This implies that addbefore, addSbefore,
5974 addaltern, and addSaltern now take a pair (name, tactic) as argument,
5975 and that adding two tactics with the same name overwrites the first
5976 one (emitting a warning).
5977 type wrapper = (int -> tactic) -> (int -> tactic)
5978 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
5979 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
5980 delWrapper, delSWrapper: claset * string -> claset
5981 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
5983 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
5984 semantics; addbefore now affects only the unsafe part of step_tac
5985 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
5986 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
5989 * Classical reasoner: setwrapper to setWrapper and compwrapper to
5990 compWrapper; added safe wrapper (and access functions for it);
5992 * HOL/split_all_tac is now much faster and fails if there is nothing
5993 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
5994 and the names of the automatically generated variables have changed.
5995 split_all_tac has moved within claset() from unsafe wrappers to safe
5996 wrappers, which means that !!-bound variables are split much more
5997 aggressively, and safe_tac and clarify_tac now split such variables.
5998 If this splitting is not appropriate, use delSWrapper "split_all_tac".
5999 Note: the same holds for record_split_tac, which does the job of
6000 split_all_tac for record fields.
6002 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6003 permanently to the default simpset using Addsplits just like
6004 Addsimps. They can be removed via Delsplits just like
6005 Delsimps. Lower-case versions are also available.
6007 * HOL/Simplifier: The rule split_if is now part of the default
6008 simpset. This means that the simplifier will eliminate all occurrences
6009 of if-then-else in the conclusion of a goal. To prevent this, you can
6010 either remove split_if completely from the default simpset by
6011 `Delsplits [split_if]' or remove it in a specific call of the
6012 simplifier using `... delsplits [split_if]'. You can also add/delete
6013 other case splitting rules to/from the default simpset: every datatype
6014 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6015 t is the name of the datatype).
6017 * Classical reasoner / Simplifier combination: new force_tac (and
6018 derivatives Force_tac, force) combines rewriting and classical
6019 reasoning (and whatever other tools) similarly to auto_tac, but is
6020 aimed to solve the given subgoal completely.
6025 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6026 and `goalw': the theory is no longer needed as an explicit argument -
6027 the current theory context is used; assumptions are no longer returned
6028 at the ML-level unless one of them starts with ==> or !!; it is
6029 recommended to convert to these new commands using isatool fixgoal
6030 (backup your sources first!);
6032 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6033 the current theory context, and 'theory' to lookup stored theories;
6035 * new theory section 'locale' for declaring constants, assumptions and
6036 definitions that have local scope;
6038 * new theory section 'nonterminals' for purely syntactic types;
6040 * new theory section 'setup' for generic ML setup functions
6041 (e.g. package initialization);
6043 * the distribution now includes Isabelle icons: see
6044 lib/logo/isabelle-{small,tiny}.xpm;
6046 * isatool install - install binaries with absolute references to
6049 * isatool logo -- create instances of the Isabelle logo (as EPS);
6051 * print mode 'emacs' reserved for Isamode;
6053 * support multiple print (ast) translations per constant name;
6055 * theorems involving oracles are now printed with a suffixed [!];
6060 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6062 * HOL/inductive package reorganized and improved: now supports mutual
6068 oddI "n : EVEN ==> Suc n : ODD"
6069 evenI "n : ODD ==> Suc n : EVEN"
6071 new theorem list "elims" contains an elimination rule for each of the
6072 recursive sets; inductive definitions now handle disjunctive premises
6073 correctly (also ZF);
6075 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6076 "mutual_induct" no longer exists - the induction rule is always
6077 contained in "induct";
6080 * HOL/datatype package re-implemented and greatly improved: now
6081 supports mutually recursive datatypes such as
6084 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6085 | SUM ('a aexp) ('a aexp)
6086 | DIFF ('a aexp) ('a aexp)
6089 'a bexp = LESS ('a aexp) ('a aexp)
6090 | AND ('a bexp) ('a bexp)
6091 | OR ('a bexp) ('a bexp)
6093 as well as indirectly recursive datatypes such as
6096 ('a, 'b) term = Var 'a
6097 | App 'b ((('a, 'b) term) list)
6099 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6100 induction on mutually / indirectly recursive datatypes.
6102 Primrec equations are now stored in theory and can be accessed via
6103 <function_name>.simps.
6107 - Theories using datatypes must now have theory Datatype as an
6109 - The specific <typename>.induct_tac no longer exists - use the
6110 generic induct_tac instead.
6111 - natE has been renamed to nat.exhaust - use exhaust_tac
6112 instead of res_inst_tac ... natE. Note that the variable
6113 names in nat.exhaust differ from the names in natE, this
6114 may cause some "fragile" proofs to fail.
6115 - The theorems split_<typename>_case and split_<typename>_case_asm
6116 have been renamed to <typename>.split and <typename>.split_asm.
6117 - Since default sorts of type variables are now handled correctly,
6118 some datatype definitions may have to be annotated with explicit
6120 - Primrec definitions no longer require function name and type
6121 of recursive argument.
6123 Consider using isatool fixdatatype to adapt your theories and proof
6124 scripts to the new package (backup your sources first!).
6127 * HOL/record package: considerably improved implementation; now
6128 includes concrete syntax for record types, terms, updates; theorems
6129 for surjective pairing and splitting !!-bound record variables; proof
6130 support is as follows:
6132 1) standard conversions (selectors or updates applied to record
6133 constructor terms) are part of the standard simpset;
6135 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6136 made part of standard simpset and claset via addIffs;
6138 3) a tactic for record field splitting (record_split_tac) is part of
6139 the standard claset (addSWrapper);
6141 To get a better idea about these rules you may retrieve them via
6142 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6143 the name of your record type.
6145 The split tactic 3) conceptually simplifies by the following rule:
6147 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6149 Thus any record variable that is bound by meta-all will automatically
6150 blow up into some record constructor term, consequently the
6151 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6152 solve record problems automatically.
6155 * reorganized the main HOL image: HOL/Integ and String loaded by
6156 default; theory Main includes everything;
6158 * automatic simplification of integer sums and comparisons, using cancellation;
6160 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6162 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6164 * many new identities for unions, intersections, set difference, etc.;
6166 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6167 called split_if, split_split, split_sum_case and split_nat_case (to go
6168 with add/delsplits);
6170 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6171 (?x::unit) = (); this is made part of the default simpset, which COULD
6172 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6173 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6174 unit_abs_eta_conv is added in order to counter the effect of
6175 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6178 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6181 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6182 It and 'sym RS equals0D' are now in the default claset, giving automatic
6183 disjointness reasoning but breaking a few old proofs.
6185 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6186 to 'converse' from 'inverse' (for compatibility with ZF and some
6189 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6190 the well-founded relation;
6192 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6193 Compl A. The "Compl" syntax remains available as input syntax for this
6196 * HOL/Update: new theory of function updates:
6197 f(a:=b) == %x. if x=a then b else f x
6198 may also be iterated as in f(a:=b,c:=d,...);
6200 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6203 - new function list_update written xs[i:=v] that updates the i-th
6204 list position. May also be iterated as in xs[i:=a,j:=b,...].
6205 - new function `upt' written [i..j(] which generates the list
6206 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6207 bound write [i..j], which is a shorthand for [i..j+1(].
6208 - new lexicographic orderings and corresponding wellfoundedness theorems.
6211 - removed 'pred' (predecessor) function;
6212 - generalized some theorems about n-1;
6213 - many new laws about "div" and "mod";
6214 - new laws about greatest common divisors (see theory ex/Primes);
6216 * HOL/Relation: renamed the relational operator r^-1 "converse"
6217 instead of "inverse";
6219 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6220 of the multiset ordering;
6222 * directory HOL/Real: a construction of the reals using Dedekind cuts
6223 (not included by default);
6225 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6227 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6228 programs, i.e. different program variables may have different types.
6230 * calling (stac rew i) now fails if "rew" has no effect on the goal
6231 [previously, this check worked only if the rewrite rule was unconditional]
6232 Now rew can involve either definitions or equalities (either == or =).
6237 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6238 only the theorems proved on ZF.ML;
6240 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6241 It and 'sym RS equals0D' are now in the default claset, giving automatic
6242 disjointness reasoning but breaking a few old proofs.
6244 * ZF/Update: new theory of function updates
6245 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6246 may also be iterated as in f(a:=b,c:=d,...);
6248 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6250 * calling (stac rew i) now fails if "rew" has no effect on the goal
6251 [previously, this check worked only if the rewrite rule was unconditional]
6252 Now rew can involve either definitions or equalities (either == or =).
6254 * case_tac provided for compatibility with HOL
6255 (like the old excluded_middle_tac, but with subgoals swapped)
6258 *** Internal programming interfaces ***
6260 * Pure: several new basic modules made available for general use, see
6261 also src/Pure/README;
6263 * improved the theory data mechanism to support encapsulation (data
6264 kind name replaced by private Object.kind, acting as authorization
6265 key); new type-safe user interface via functor TheoryDataFun; generic
6266 print_data function becomes basically useless;
6268 * removed global_names compatibility flag -- all theory declarations
6269 are qualified by default;
6271 * module Pure/Syntax now offers quote / antiquote translation
6272 functions (useful for Hoare logic etc. with implicit dependencies);
6273 see HOL/ex/Antiquote for an example use;
6275 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6278 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6281 * Display.print_goals function moved to Locale.print_goals;
6283 * standard print function for goals supports current_goals_markers
6284 variable for marking begin of proof, end of proof, start of goal; the
6285 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6286 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6291 New in Isabelle98 (January 1998)
6292 --------------------------------
6294 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6296 * changed lexical syntax of terms / types: dots made part of long
6297 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6299 * simpset (and claset) reference variable replaced by functions
6300 simpset / simpset_ref;
6302 * no longer supports theory aliases (via merge) and non-trivial
6303 implicit merge of thms' signatures;
6305 * most internal names of constants changed due to qualified names;
6307 * changed Pure/Sequence interface (see Pure/seq.ML);
6310 *** General Changes ***
6312 * hierachically structured name spaces (for consts, types, axms, thms
6313 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6314 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6315 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6316 long_names for fully qualified output names; NOTE: ML programs
6317 (special tactics, packages etc.) referring to internal names may have
6318 to be adapted to cope with fully qualified names; in case of severe
6319 backward campatibility problems try setting 'global_names' at compile
6320 time to have enrything declared within a flat name space; one may also
6321 fine tune name declarations in theories via the 'global' and 'local'
6324 * reimplemented the implicit simpset and claset using the new anytype
6325 data filed in signatures; references simpset:simpset ref etc. are
6326 replaced by functions simpset:unit->simpset and
6327 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6328 to patch your ML files accordingly;
6330 * HTML output now includes theory graph data for display with Java
6331 applet or isatool browser; data generated automatically via isatool
6332 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6334 * defs may now be conditional; improved rewrite_goals_tac to handle
6335 conditional equations;
6337 * defs now admits additional type arguments, using TYPE('a) syntax;
6339 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6340 creates a new theory node; implicit merge of thms' signatures is
6341 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6342 transfer:theory->thm->thm in (rare) cases;
6344 * improved handling of draft signatures / theories; draft thms (and
6345 ctyps, cterms) are automatically promoted to real ones;
6347 * slightly changed interfaces for oracles: admit many per theory, named
6348 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6350 * print_goals: optional output of const types (set show_consts and
6353 * improved output of warnings (###) and errors (***);
6355 * subgoal_tac displays a warning if the new subgoal has type variables;
6357 * removed old README and Makefiles;
6359 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6361 * removed obsolete init_pps and init_database;
6363 * deleted the obsolete tactical STATE, which was declared by
6364 fun STATE tacfun st = tacfun st st;
6366 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6367 (which abbreviates $HOME);
6369 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6370 use isatool fixseq to adapt your ML programs (this works for fully
6371 qualified references to the Sequence structure only!);
6373 * use_thy no longer requires writable current directory; it always
6374 reloads .ML *and* .thy file, if either one is out of date;
6377 *** Classical Reasoner ***
6379 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6380 tactics that use classical reasoning to simplify a subgoal without
6381 splitting it into several subgoals;
6383 * Safe_tac: like safe_tac but uses the default claset;
6388 * added simplification meta rules:
6389 (asm_)(full_)simplify: simpset -> thm -> thm;
6391 * simplifier.ML no longer part of Pure -- has to be loaded by object
6394 * added prems argument to simplification procedures;
6396 * HOL, FOL, ZF: added infix function `addsplits':
6397 instead of `<simpset> setloop (split_tac <thms>)'
6398 you can simply write `<simpset> addsplits <thms>'
6403 * TYPE('a) syntax for type reflection terms;
6405 * no longer handles consts with name "" -- declare as 'syntax' instead;
6407 * pretty printer: changed order of mixfix annotation preference (again!);
6409 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6414 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6415 with `addloop' of the simplifier to faciliate case splitting in premises.
6417 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6419 * HOL/Auth: new protocol proofs including some for the Internet
6422 * HOL/Map: new theory of `maps' a la VDM;
6424 * HOL/simplifier: simplification procedures nat_cancel_sums for
6425 cancelling out common nat summands from =, <, <= (in)equalities, or
6426 differences; simplification procedures nat_cancel_factor for
6427 cancelling common factor from =, <, <= (in)equalities over natural
6428 sums; nat_cancel contains both kinds of procedures, it is installed by
6429 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6431 * HOL/simplifier: terms of the form
6432 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6434 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6435 and those of the form
6436 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6438 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6441 Each datatype `t' now comes with a theorem `split_t_case' of the form
6443 P(t_case f1 ... fn x) =
6444 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6446 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6449 and a theorem `split_t_case_asm' of the form
6451 P(t_case f1 ... fn x) =
6452 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6454 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6456 which can be added to a simpset via `addsplits'. The existing theorems
6457 expand_list_case and expand_option_case have been renamed to
6458 split_list_case and split_option_case.
6461 - `pred n' is automatically converted to `n-1'.
6462 Users are strongly encouraged not to use `pred' any longer,
6463 because it will disappear altogether at some point.
6464 - Users are strongly encouraged to write "0 < n" rather than
6465 "n ~= 0". Theorems and proof tools have been modified towards this
6469 the function "set_of_list" has been renamed "set" (and its theorems too);
6470 the function "nth" now takes its arguments in the reverse order and
6471 has acquired the infix notation "!" as in "xs!n".
6473 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6475 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6476 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6478 * HOL/record: extensible records with schematic structural subtyping
6479 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6480 still lacks various theorems and concrete record syntax;
6485 * removed "axioms" and "generated by" sections;
6487 * replaced "ops" section by extended "consts" section, which is capable of
6488 handling the continuous function space "->" directly;
6491 . proves theorems immediately and stores them in the theory,
6492 . creates hierachical name space,
6493 . now uses normal mixfix annotations (instead of cinfix...),
6494 . minor changes to some names and values (for consistency),
6495 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6496 . separator between mutual domain defs: changed "," to "and",
6497 . improved handling of sort constraints; now they have to
6498 appear on the left-hand side of the equations only;
6500 * fixed LAM <x,y,zs>.b syntax;
6502 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6503 adm (%x. P (t x)), where P is chainfinite and t continuous;
6508 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6509 with `addloop' of the simplifier to faciliate case splitting in premises.
6511 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6512 in HOL, they strip ALL and --> from proved theorems;
6516 New in Isabelle94-8 (May 1997)
6517 ------------------------------
6519 *** General Changes ***
6521 * new utilities to build / run / maintain Isabelle etc. (in parts
6522 still somewhat experimental); old Makefiles etc. still functional;
6524 * new 'Isabelle System Manual';
6526 * INSTALL text, together with ./configure and ./build scripts;
6528 * reimplemented type inference for greater efficiency, better error
6529 messages and clean internal interface;
6531 * prlim command for dealing with lots of subgoals (an easier way of
6532 setting goals_limit);
6537 * supports alternative (named) syntax tables (parser and pretty
6538 printer); internal interface is provided by add_modesyntax(_i);
6540 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6541 be used in conjunction with the Isabelle symbol font; uses the
6542 "symbols" syntax table;
6544 * added token_translation interface (may translate name tokens in
6545 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6546 the current print_mode); IMPORTANT: user print translation functions
6547 are responsible for marking newly introduced bounds
6548 (Syntax.mark_boundT);
6550 * token translations for modes "xterm" and "xterm_color" that display
6551 names in bold, underline etc. or colors (which requires a color
6554 * infixes may now be declared with names independent of their syntax;
6556 * added typed_print_translation (like print_translation, but may
6557 access type of constant);
6560 *** Classical Reasoner ***
6562 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6563 some limitations. Blast_tac...
6564 + ignores addss, addbefore, addafter; this restriction is intrinsic
6565 + ignores elimination rules that don't have the correct format
6566 (the conclusion MUST be a formula variable)
6567 + ignores types, which can make HOL proofs fail
6568 + rules must not require higher-order unification, e.g. apply_type in ZF
6569 [message "Function Var's argument not a bound variable" relates to this]
6570 + its proof strategy is more general but can actually be slower
6572 * substitution with equality assumptions no longer permutes other
6575 * minor changes in semantics of addafter (now called addaltern); renamed
6576 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6577 (and access functions for it);
6579 * improved combination of classical reasoner and simplifier:
6580 + functions for handling clasimpsets
6581 + improvement of addss: now the simplifier is called _after_ the
6583 + safe variant of addss called addSss: uses safe simplifications
6584 _during_ the safe steps. It is more complete as it allows multiple
6585 instantiations of unknowns (e.g. with slow_tac).
6589 * added interface for simplification procedures (functions that
6590 produce *proven* rewrite rules on the fly, depending on current
6593 * ordering on terms as parameter (used for ordered rewriting);
6595 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
6597 * the solver is now split into a safe and an unsafe part.
6598 This should be invisible for the normal user, except that the
6599 functions setsolver and addsolver have been renamed to setSolver and
6600 addSolver; added safe_asm_full_simp_tac;
6605 * a generic induction tactic `induct_tac' which works for all datatypes and
6606 also for type `nat';
6608 * a generic case distinction tactic `exhaust_tac' which works for all
6609 datatypes and also for type `nat';
6611 * each datatype comes with a function `size';
6613 * patterns in case expressions allow tuple patterns as arguments to
6614 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
6616 * primrec now also works with type nat;
6618 * recdef: a new declaration form, allows general recursive functions to be
6619 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
6621 * the constant for negation has been renamed from "not" to "Not" to
6622 harmonize with FOL, ZF, LK, etc.;
6624 * HOL/ex/LFilter theory of a corecursive "filter" functional for
6627 * HOL/Modelcheck demonstrates invocation of model checker oracle;
6629 * HOL/ex/Ring.thy declares cring_simp, which solves equational
6630 problems in commutative rings, using axiomatic type classes for + and *;
6632 * more examples in HOL/MiniML and HOL/Auth;
6634 * more default rewrite rules for quantifiers, union/intersection;
6636 * a new constant `arbitrary == @x.False';
6638 * HOLCF/IOA replaces old HOL/IOA;
6640 * HOLCF changes: derived all rules and arities
6641 + axiomatic type classes instead of classes
6642 + typedef instead of faking type definitions
6643 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
6644 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
6645 + eliminated the types void, one, tr
6646 + use unit lift and bool lift (with translations) instead of one and tr
6647 + eliminated blift from Lift3.thy (use Def instead of blift)
6648 all eliminated rules are derived as theorems --> no visible changes ;
6653 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
6654 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
6655 as ZF_cs addSIs [equalityI];
6659 New in Isabelle94-7 (November 96)
6660 ---------------------------------
6662 * allowing negative levels (as offsets) in prlev and choplev;
6664 * super-linear speedup for large simplifications;
6666 * FOL, ZF and HOL now use miniscoping: rewriting pushes
6667 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
6668 FAIL); can suppress it using the command Delsimps (ex_simps @
6669 all_simps); De Morgan laws are also now included, by default;
6671 * improved printing of ==> : ~:
6673 * new object-logic "Sequents" adds linear logic, while replacing LK
6674 and Modal (thanks to Sara Kalvala);
6676 * HOL/Auth: correctness proofs for authentication protocols;
6678 * HOL: new auto_tac combines rewriting and classical reasoning (many
6679 examples on HOL/Auth);
6681 * HOL: new command AddIffs for declaring theorems of the form P=Q to
6682 the rewriter and classical reasoner simultaneously;
6684 * function uresult no longer returns theorems in "standard" format;
6685 regain previous version by: val uresult = standard o uresult;
6692 * oracles -- these establish an interface between Isabelle and trusted
6693 external reasoners, which may deliver results as theorems;
6695 * proof objects (in particular record all uses of oracles);
6697 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
6699 * "constdefs" section in theory files;
6701 * "primrec" section (HOL) no longer requires names;
6703 * internal type "tactic" now simply "thm -> thm Sequence.seq";
6710 * reduced space requirements;
6712 * automatic HTML generation from theories;
6714 * theory files no longer require "..." (quotes) around most types;
6716 * new examples, including two proofs of the Church-Rosser theorem;
6718 * non-curried (1994) version of HOL is no longer distributed;
6725 * greatly reduced space requirements;
6727 * theory files (.thy) no longer require \...\ escapes at line breaks;
6729 * searchable theorem database (see the section "Retrieving theorems" on
6730 page 8 of the Reference Manual);
6732 * new examples, including Grabczewski's monumental case study of the
6735 * The previous version of HOL renamed to Old_HOL;
6737 * The new version of HOL (previously called CHOL) uses a curried syntax
6738 for functions. Application looks like f a b instead of f(a,b);
6740 * Mutually recursive inductive definitions finally work in HOL;
6742 * In ZF, pattern-matching on tuples is now available in all abstractions and
6743 translates to the operator "split";
6750 * new infix operator, addss, allowing the classical reasoner to
6751 perform simplification at each step of its search. Example:
6752 fast_tac (cs addss ss)
6754 * a new logic, CHOL, the same as HOL, but with a curried syntax
6755 for functions. Application looks like f a b instead of f(a,b). Also pairs
6756 look like (a,b) instead of <a,b>;
6758 * PLEASE NOTE: CHOL will eventually replace HOL!
6760 * In CHOL, pattern-matching on tuples is now available in all abstractions.
6761 It translates to the operator "split". A new theory of integers is available;
6763 * In ZF, integer numerals now denote two's-complement binary integers.
6764 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
6766 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
6767 of the Axiom of Choice;
6774 * Significantly faster resolution;
6776 * the different sections in a .thy file can now be mixed and repeated
6779 * Database of theorems for FOL, HOL and ZF. New
6780 commands including qed, qed_goal and bind_thm store theorems in the database.
6782 * Simple database queries: return a named theorem (get_thm) or all theorems of
6783 a given theory (thms_of), or find out what theory a theorem was proved in
6786 * Bugs fixed in the inductive definition and datatype packages;
6788 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
6789 and HOL_dup_cs obsolete;
6791 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
6794 * Simpler definition of function space in ZF;
6796 * new results about cardinal and ordinal arithmetic in ZF;
6798 * 'subtype' facility in HOL for introducing new types as subsets of existing
6801 :mode=text:wrap=hard:maxLineLen=72: