1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Authentic syntax for *all* logical entities (type classes, type
10 constructors, term constants): provides simple and robust
11 correspondence between formal entities and concrete syntax. Within
12 the parse tree / AST representations, "constants" are decorated by
13 their category (class, type, const) and spelled out explicitly with
14 their full internal name.
16 Substantial INCOMPATIBILITY concerning low-level syntax declarations
17 and translations (translation rules and translation functions in ML).
18 Some hints on upgrading:
20 - Many existing uses of 'syntax' and 'translations' can be replaced
21 by more modern 'type_notation', 'notation' and 'abbreviation',
22 which are independent of this issue.
24 - 'translations' require markup within the AST; the term syntax
25 provides the following special forms:
27 CONST c -- produces syntax version of constant c from context
28 XCONST c -- literally c, checked as constant from context
29 c -- literally c, if declared by 'syntax'
31 Plain identifiers are treated as AST variables -- occasionally the
32 system indicates accidental variables via the error "rhs contains
35 Type classes and type constructors are marked according to their
36 concrete syntax. Some old translations rules need to be written
37 for the "type" category, using type constructor application
38 instead of pseudo-term application of the default category
41 - 'parse_translation' etc. in ML may use the following
44 @{class_syntax c} -- type class c within parse tree / AST
45 @{term_syntax c} -- type constructor c within parse tree / AST
46 @{const_syntax c} -- ML version of "CONST c" above
47 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
49 - Literal types within 'typed_print_translations', i.e. those *not*
50 represented as pseudo-terms are represented verbatim. Use @{class
51 c} or @{type_name c} here instead of the above syntax
54 Note that old non-authentic syntax was based on unqualified base
55 names, so all of the above "constant" names would coincide. Recall
56 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
57 diagnose syntax problems.
59 * Type constructors admit general mixfix syntax, not just infix.
61 * Use of cumulative prems via "!" in some proof methods has been
62 discontinued (legacy feature).
67 * Local theory specifications may depend on extra type variables that
68 are not present in the result type -- arguments TYPE('a) :: 'a itself
69 are added internally. For example:
71 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
73 * Code generator: details of internal data cache have no impact on
74 the user space functionality any longer.
76 * Discontinued unnamed infix syntax (legacy feature for many years) --
77 need to specify constant name and syntax separately. Internal ML
78 datatype constructors have been renamed from InfixName to Infix etc.
79 Minor INCOMPATIBILITY.
81 * Commands 'type_notation' and 'no_type_notation' declare type syntax
82 within a local theory context, with explicit checking of the
83 constructors involved (in contrast to the raw 'syntax' versions).
85 * Command 'typedecl' now works within a local theory context --
86 without introducing dependencies on parameters or assumptions, which
87 is not possible in Isabelle/Pure.
92 * Command 'typedef' now works within a local theory context -- without
93 introducing dependencies on parameters or assumptions, which is not
94 possible in Isabelle/Pure/HOL. Note that the logical environment may
95 contain multiple interpretations of local typedefs (with different
96 non-emptiness proofs), even in a global theory context.
98 * Theory Library/Coinductive_List has been removed -- superceded by
101 * Split off theory Big_Operators containing setsum, setprod, Inf_fin, Sup_fin,
102 Min, Max from theory Finite_Set. INCOMPATIBILITY.
104 * Theory "Rational" renamed to "Rat", for consistency with "Nat", "Int" etc.
107 * New set of rules "ac_simps" provides combined assoc / commute rewrites
108 for all interpretations of the appropriate generic locales.
110 * Renamed theory "OrderedGroup" to "Groups" and split theory "Ring_and_Field"
111 into theories "Rings" and "Fields"; for more appropriate and more
112 consistent names suitable for name prefixes within the HOL theories.
115 * Some generic constants have been put to appropriate theories:
117 less_eq, less: Orderings
118 zero, one, plus, minus, uminus, times, abs, sgn: Groups
119 inverse, divide: Rings
123 * Class division_ring also requires proof of fact divide_inverse. However instantiation
124 of parameter divide has also been required previously. INCOMPATIBILITY.
126 * More consistent naming of type classes involving orderings (and lattices):
128 lower_semilattice ~> semilattice_inf
129 upper_semilattice ~> semilattice_sup
131 dense_linear_order ~> dense_linorder
133 pordered_ab_group_add ~> ordered_ab_group_add
134 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
135 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
136 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
137 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
138 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
139 pordered_cancel_semiring ~> ordered_cancel_semiring
140 pordered_comm_monoid_add ~> ordered_comm_monoid_add
141 pordered_comm_ring ~> ordered_comm_ring
142 pordered_comm_semiring ~> ordered_comm_semiring
143 pordered_ring ~> ordered_ring
144 pordered_ring_abs ~> ordered_ring_abs
145 pordered_semiring ~> ordered_semiring
147 ordered_ab_group_add ~> linordered_ab_group_add
148 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
149 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
150 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
151 ordered_field ~> linordered_field
152 ordered_field_no_lb ~> linordered_field_no_lb
153 ordered_field_no_ub ~> linordered_field_no_ub
154 ordered_field_dense_linear_order ~> dense_linordered_field
155 ordered_idom ~> linordered_idom
156 ordered_ring ~> linordered_ring
157 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
158 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
159 ordered_ring_strict ~> linordered_ring_strict
160 ordered_semidom ~> linordered_semidom
161 ordered_semiring ~> linordered_semiring
162 ordered_semiring_1 ~> linordered_semiring_1
163 ordered_semiring_1_strict ~> linordered_semiring_1_strict
164 ordered_semiring_strict ~> linordered_semiring_strict
166 The following slightly odd type classes have been moved to
167 a separate theory Library/Lattice_Algebras.thy:
169 lordered_ab_group_add ~> lattice_ab_group_add
170 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
171 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
172 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
173 lordered_ring ~> lattice_ring
177 * HOLogic.strip_psplit: types are returned in syntactic order, similar
178 to other strip and tuple operations. INCOMPATIBILITY.
180 * Various old-style primrec specifications in the HOL theories have been
181 replaced by new-style primrec, especially in theory List. The corresponding
182 constants now have authentic syntax. INCOMPATIBILITY.
184 * Reorganized theory Multiset: swapped notation of pointwise and multiset order:
185 * pointwise ordering is instance of class order with standard syntax <= and <;
186 * multiset ordering has syntax <=# and <#; partial order properties are provided
187 by means of interpretation with prefix multiset_order.
188 Less duplication, less historical organization of sections,
189 conversion from associations lists to multisets, rudimentary code generation.
190 Use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union, if needed.
193 * Reorganized theory Sum_Type; Inl and Inr now have authentic syntax.
196 * Code generation: ML and OCaml code is decorated with signatures.
198 * Theory Complete_Lattice: lemmas top_def and bot_def have been
199 replaced by the more convenient lemmas Inf_empty and Sup_empty.
200 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
201 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
202 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
203 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
205 * Theory Finite_Set and List: some lemmas have been generalized from
208 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
209 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
210 inter_Inter_fold_inter ~> inf_Inf_fold_inf
211 union_Union_fold_union ~> sup_Sup_fold_sup
212 Inter_fold_inter ~> Inf_fold_inf
213 Union_fold_union ~> Sup_fold_sup
214 inter_INTER_fold_inter ~> inf_INFI_fold_inf
215 union_UNION_fold_union ~> sup_SUPR_fold_sup
216 INTER_fold_inter ~> INFI_fold_inf
217 UNION_fold_union ~> SUPR_fold_sup
219 * Theory List: added transpose.
221 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
222 clash with new theory Quotient in Main HOL.
227 * Antiquotations for basic formal entities:
229 @{class NAME} -- type class
230 @{class_syntax NAME} -- syntax representation of the above
232 @{type_name NAME} -- logical type
233 @{type_abbrev NAME} -- type abbreviation
234 @{nonterminal NAME} -- type of concrete syntactic category
235 @{type_syntax NAME} -- syntax representation of any of the above
237 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
238 @{const_abbrev NAME} -- abbreviated constant
239 @{const_syntax NAME} -- syntax representation of any of the above
241 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
242 syntax constant (cf. 'syntax' command).
244 * Renamed old-style Drule.standard to Drule.export_without_context, to
245 emphasize that this is in no way a standard operation.
248 * Curried take and drop in library.ML; negative length is interpreted
249 as infinity (as in chop). INCOMPATIBILITY.
251 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
252 usual for resolution. Rare INCOMPATIBILITY.
254 * Discontinued old TheoryDataFun with its copy/init operation -- data
255 needs to be pure. Functor Theory_Data_PP retains the traditional
256 Pretty.pp argument to merge, which is absent in the standard
262 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
263 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
264 proof terms are enabled unconditionally in the new HOL-Proofs image.
266 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
267 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
272 New in Isabelle2009-1 (December 2009)
273 -------------------------------------
277 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
278 one backslash should be used, even in ML sources.
283 * Locale interpretation propagates mixins along the locale hierarchy.
284 The currently only available mixins are the equations used to map
285 local definitions to terms of the target domain of an interpretation.
287 * Reactivated diagnostic command 'print_interps'. Use "print_interps
288 loc" to print all interpretations of locale "loc" in the theory.
289 Interpretations in proofs are not shown.
291 * Thoroughly revised locales tutorial. New section on conditional
294 * On instantiation of classes, remaining undefined class parameters
295 are formally declared. INCOMPATIBILITY.
298 *** Document preparation ***
300 * New generalized style concept for printing terms: @{foo (style) ...}
301 instead of @{foo_style style ...} (old form is still retained for
302 backward compatibility). Styles can be also applied for
303 antiquotations prop, term_type and typeof.
308 * New proof method "smt" for a combination of first-order logic with
309 equality, linear and nonlinear (natural/integer/real) arithmetic, and
310 fixed-size bitvectors; there is also basic support for higher-order
311 features (esp. lambda abstractions). It is an incomplete decision
312 procedure based on external SMT solvers using the oracle mechanism;
313 for the SMT solver Z3, this method is proof-producing. Certificates
314 are provided to avoid calling the external solvers solely for
315 re-checking proofs. Due to a remote SMT service there is no need for
316 installing SMT solvers locally. See src/HOL/SMT.
318 * New commands to load and prove verification conditions generated by
319 the Boogie program verifier or derived systems (e.g. the Verifying C
320 Compiler (VCC) or Spec#). See src/HOL/Boogie.
322 * New counterexample generator tool 'nitpick' based on the Kodkod
323 relational model finder. See src/HOL/Tools/Nitpick and
324 src/HOL/Nitpick_Examples.
326 * New commands 'code_pred' and 'values' to invoke the predicate
327 compiler and to enumerate values of inductive predicates.
329 * A tabled implementation of the reflexive transitive closure.
331 * New implementation of quickcheck uses generic code generator;
332 default generators are provided for all suitable HOL types, records
333 and datatypes. Old quickcheck can be re-activated importing theory
334 Library/SML_Quickcheck.
336 * New testing tool Mirabelle for automated proof tools. Applies
337 several tools and tactics like sledgehammer, metis, or quickcheck, to
338 every proof step in a theory. To be used in batch mode via the
341 * New proof method "sos" (sum of squares) for nonlinear real
342 arithmetic (originally due to John Harison). It requires theory
343 Library/Sum_Of_Squares. It is not a complete decision procedure but
344 works well in practice on quantifier-free real arithmetic with +, -,
345 *, ^, =, <= and <, i.e. boolean combinations of equalities and
346 inequalities between polynomials. It makes use of external
347 semidefinite programming solvers. Method "sos" generates a
348 certificate that can be pasted into the proof thus avoiding the need
349 to call an external tool every time the proof is checked. See
350 src/HOL/Library/Sum_Of_Squares.
352 * New method "linarith" invokes existing linear arithmetic decision
355 * New command 'atp_minimal' reduces result produced by Sledgehammer.
357 * New Sledgehammer option "Full Types" in Proof General settings menu.
358 Causes full type information to be output to the ATPs. This slows
359 ATPs down considerably but eliminates a source of unsound "proofs"
362 * New method "metisFT": A version of metis that uses full type
363 information in order to avoid failures of proof reconstruction.
365 * New evaluator "approximate" approximates an real valued term using
366 the same method as the approximation method.
368 * Method "approximate" now supports arithmetic expressions as
369 boundaries of intervals and implements interval splitting and Taylor
372 * ML antiquotation @{code_datatype} inserts definition of a datatype
373 generated by the code generator; e.g. see src/HOL/Predicate.thy.
375 * New theory SupInf of the supremum and infimum operators for sets of
378 * New theory Probability, which contains a development of measure
379 theory, eventually leading to Lebesgue integration and probability.
381 * Extended Multivariate Analysis to include derivation and Brouwer's
384 * Reorganization of number theory, INCOMPATIBILITY:
385 - new number theory development for nat and int, in theories Divides
386 and GCD as well as in new session Number_Theory
387 - some constants and facts now suffixed with _nat and _int
389 - former session NumberTheory now named Old_Number_Theory, including
390 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
391 - moved theory Pocklington from src/HOL/Library to
392 src/HOL/Old_Number_Theory
394 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
395 lcm of finite and infinite sets. It is shown that they form a complete
398 * Class semiring_div requires superclass no_zero_divisors and proof of
399 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
400 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
401 generalized to class semiring_div, subsuming former theorems
402 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
403 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
406 * Refinements to lattice classes and sets:
407 - less default intro/elim rules in locale variant, more default
408 intro/elim rules in class variant: more uniformity
409 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
411 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
413 - renamed ACI to inf_sup_aci
414 - new class "boolean_algebra"
415 - class "complete_lattice" moved to separate theory
416 "Complete_Lattice"; corresponding constants (and abbreviations)
417 renamed and with authentic syntax:
418 Set.Inf ~> Complete_Lattice.Inf
419 Set.Sup ~> Complete_Lattice.Sup
420 Set.INFI ~> Complete_Lattice.INFI
421 Set.SUPR ~> Complete_Lattice.SUPR
422 Set.Inter ~> Complete_Lattice.Inter
423 Set.Union ~> Complete_Lattice.Union
424 Set.INTER ~> Complete_Lattice.INTER
425 Set.UNION ~> Complete_Lattice.UNION
426 - authentic syntax for
429 - mere abbreviations:
432 Set.inter (for inf, formerly Set.Int)
433 Set.union (for sup, formerly Set.Un)
434 Complete_Lattice.Inter (for Inf)
435 Complete_Lattice.Union (for Sup)
436 Complete_Lattice.INTER (for INFI)
437 Complete_Lattice.UNION (for SUPR)
438 - object-logic definitions as far as appropriate
440 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
441 Un_subset_iff are explicitly deleted as default simp rules; then also
442 their lattice counterparts le_inf_iff and le_sup_iff have to be
443 deleted to achieve the desired effect.
445 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
446 rules by default any longer; the same applies to min_max.inf_absorb1
447 etc. INCOMPATIBILITY.
449 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
450 pred_set_conv by default. INCOMPATIBILITY.
452 * Power operations on relations and functions are now one dedicated
453 constant "compow" with infix syntax "^^". Power operation on
454 multiplicative monoids retains syntax "^" and is now defined generic
455 in class power. INCOMPATIBILITY.
457 * Relation composition "R O S" now has a more standard argument order:
458 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
459 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
460 break, since the O_assoc rule was not rewritten like this. Fix using
461 O_assoc[symmetric]. The same applies to the curried version "R OO S".
463 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
464 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
467 * Most rules produced by inductive and datatype package have mandatory
468 prefixes. INCOMPATIBILITY.
470 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
471 the attribute of the same name. Each of the theorems in the list
472 DERIV_intros assumes composition with an additional function and
473 matches a variable to the derivative, which has to be solved by the
474 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
475 of most elementary terms. Former Maclauren.DERIV_tac and
476 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
479 * Code generator attributes follow the usual underscore convention:
480 code_unfold replaces code unfold
481 code_post replaces code post
486 sizechange -> size_change
487 induct_scheme -> induction_schema
490 * Discontinued abbreviation "arbitrary" of constant "undefined".
491 INCOMPATIBILITY, use "undefined" directly.
494 Suc_eq_add_numeral_1 -> Suc_eq_plus1
495 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
496 Suc_plus1 -> Suc_eq_plus1
497 *anti_sym -> *antisym*
498 vector_less_eq_def -> vector_le_def
501 * Added theorem List.map_map as [simp]. Removed List.map_compose.
504 * Removed predicate "M hassize n" (<--> card M = n & finite M).
510 * Theory Representable defines a class "rep" of domains that are
511 representable (via an ep-pair) in the universal domain type "udom".
512 Instances are provided for all type constructors defined in HOLCF.
514 * The 'new_domain' command is a purely definitional version of the
515 domain package, for representable domains. Syntax is identical to the
516 old domain package. The 'new_domain' package also supports indirect
517 recursion using previously-defined type constructors. See
518 src/HOLCF/ex/New_Domain.thy for examples.
520 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
521 on the left-hand side of an equation, and then performs
522 simplification. Rewriting is done using rules declared with the
523 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
524 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
526 * The pattern-match compiler in 'fixrec' can now handle constructors
527 with HOL function types. Pattern-match combinators for the Pair
528 constructor are pre-configured.
530 * The 'fixrec' package now produces better fixed-point induction rules
531 for mutually-recursive definitions: Induction rules have conclusions
532 of the form "P foo bar" instead of "P <foo, bar>".
534 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
535 been renamed to "below". The name "below" now replaces "less" in many
536 theorem names. (Legacy theorem names using "less" are still supported
539 * The 'fixrec' package now supports "bottom patterns". Bottom
540 patterns can be used to generate strictness rules, or to make
541 functions more strict (much like the bang-patterns supported by the
542 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
548 * Support for Poly/ML 5.3.0, with improved reporting of compiler
549 errors and run-time exceptions, including detailed source positions.
551 * Structure Name_Space (formerly NameSpace) now manages uniquely
552 identified entries, with some additional information such as source
553 position, logical grouping etc.
555 * Theory and context data is now introduced by the simplified and
556 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
557 to be pure, but the old TheoryDataFun for mutable data (with explicit
558 copy operation) is still available for some time.
560 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
561 provides a high-level programming interface to synchronized state
562 variables with atomic update. This works via pure function
563 application within a critical section -- its runtime should be as
564 short as possible; beware of deadlocks if critical code is nested,
565 either directly or indirectly via other synchronized variables!
567 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
568 wraps raw ML references, explicitly indicating their non-thread-safe
569 behaviour. The Isar toplevel keeps this structure open, to
570 accommodate Proof General as well as quick and dirty interactive
571 experiments with references.
573 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
574 parallel tactical reasoning.
576 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
577 are similar to SUBPROOF, but are slightly more flexible: only the
578 specified parts of the subgoal are imported into the context, and the
579 body tactic may introduce new subgoals and schematic variables.
581 * Old tactical METAHYPS, which does not observe the proof context, has
582 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
583 or Subgoal.FOCUS etc.
585 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
586 functors have their own ML name space there is no point to mark them
587 separately.) Minor INCOMPATIBILITY.
589 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
591 * Renamed several structures FooBar to Foo_Bar. Occasional,
594 * Operations of structure Skip_Proof no longer require quick_and_dirty
595 mode, which avoids critical setmp.
597 * Eliminated old Attrib.add_attributes, Method.add_methods and related
598 combinators for "args". INCOMPATIBILITY, need to use simplified
599 Attrib/Method.setup introduced in Isabelle2009.
601 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
602 back on global_simpset_of, global_claset_of, global_clasimpset_of as
603 last resort. INCOMPATIBILITY.
605 * Display.pretty_thm now requires a proper context (cf. former
606 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
607 or even Display.pretty_thm_without_context as last resort.
610 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
611 Syntax.pretty_typ/term directly, preferably with proper context
612 instead of global theory.
617 * Further fine tuning of parallel proof checking, scales up to 8 cores
618 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
621 * Support for additional "Isabelle components" via etc/components, see
622 also the system manual.
624 * The isabelle makeall tool now operates on all components with
625 IsaMakefile, not just hardwired "logics".
627 * Removed "compress" option from isabelle-process and isabelle usedir;
628 this is always enabled.
630 * Discontinued support for Poly/ML 4.x versions.
632 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
633 on a given logic image. This requires the lighttpd webserver and is
634 currently supported on Linux only.
638 New in Isabelle2009 (April 2009)
639 --------------------------------
643 * Simplified main Isabelle executables, with less surprises on
644 case-insensitive file-systems (such as Mac OS).
646 - The main Isabelle tool wrapper is now called "isabelle" instead of
649 - The former "isabelle" alias for "isabelle-process" has been
650 removed (should rarely occur to regular users).
652 - The former "isabelle-interface" and its alias "Isabelle" have been
653 removed (interfaces are now regular Isabelle tools).
655 Within scripts and make files, the Isabelle environment variables
656 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
657 respectively. (The latter are still available as legacy feature.)
659 The old isabelle-interface wrapper could react in confusing ways if
660 the interface was uninstalled or changed otherwise. Individual
661 interface tool configuration is now more explicit, see also the
662 Isabelle system manual. In particular, Proof General is now available
663 via "isabelle emacs".
665 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
666 purge installed copies of Isabelle executables and re-run "isabelle
667 install -p ...", or use symlinks.
669 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
670 old ~/isabelle, which was slightly non-standard and apt to cause
671 surprises on case-insensitive file-systems (such as Mac OS).
673 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
674 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
675 care is required when using older releases of Isabelle. Note that
676 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
677 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
679 * Proofs of fully specified statements are run in parallel on
680 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
681 a regular 4-core machine, if the initial heap space is made reasonably
682 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
684 * The main reference manuals ("isar-ref", "implementation", and
685 "system") have been updated and extended. Formally checked references
686 as hyperlinks are now available uniformly.
691 * Complete re-implementation of locales. INCOMPATIBILITY in several
692 respects. The most important changes are listed below. See the
693 Tutorial on Locales ("locales" manual) for details.
695 - In locale expressions, instantiation replaces renaming. Parameters
696 must be declared in a for clause. To aid compatibility with previous
697 parameter inheritance, in locale declarations, parameters that are not
698 'touched' (instantiation position "_" or omitted) are implicitly added
699 with their syntax at the beginning of the for clause.
701 - Syntax from abbreviations and definitions in locales is available in
702 locale expressions and context elements. The latter is particularly
703 useful in locale declarations.
705 - More flexible mechanisms to qualify names generated by locale
706 expressions. Qualifiers (prefixes) may be specified in locale
707 expressions, and can be marked as mandatory (syntax: "name!:") or
708 optional (syntax "name?:"). The default depends for plain "name:"
709 depends on the situation where a locale expression is used: in
710 commands 'locale' and 'sublocale' prefixes are optional, in
711 'interpretation' and 'interpret' prefixes are mandatory. The old
712 implicit qualifiers derived from the parameter names of a locale are
715 - Command "sublocale l < e" replaces "interpretation l < e". The
716 instantiation clause in "interpretation" and "interpret" (square
717 brackets) is no longer available. Use locale expressions.
719 - When converting proof scripts, mandatory qualifiers in
720 'interpretation' and 'interpret' should be retained by default, even
721 if this is an INCOMPATIBILITY compared to former behavior. In the
722 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
723 in locale expressions range over a single locale instance only.
725 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
726 In existing theorem specifications replace the includes element by the
727 respective context elements of the included locale, omitting those
728 that are already present in the theorem specification. Multiple
729 assume elements of a locale should be replaced by a single one
730 involving the locale predicate. In the proof body, declarations (most
731 notably theorems) may be regained by interpreting the respective
732 locales in the proof context as required (command "interpret").
734 If using "includes" in replacement of a target solely because the
735 parameter types in the theorem are not as general as in the target,
736 consider declaring a new locale with additional type constraints on
737 the parameters (context element "constrains").
739 - Discontinued "locale (open)". INCOMPATIBILITY.
741 - Locale interpretation commands no longer attempt to simplify goal.
742 INCOMPATIBILITY: in rare situations the generated goal differs. Use
743 methods intro_locales and unfold_locales to clarify.
745 - Locale interpretation commands no longer accept interpretation
746 attributes. INCOMPATIBILITY.
748 * Class declaration: so-called "base sort" must not be given in import
749 list any longer, but is inferred from the specification. Particularly
756 class foo = type + ...
758 * Class target: global versions of theorems stemming do not carry a
759 parameter prefix any longer. INCOMPATIBILITY.
761 * Class 'instance' command no longer accepts attached definitions.
762 INCOMPATIBILITY, use proper 'instantiation' target instead.
764 * Recovered hiding of consts, which was accidentally broken in
765 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
766 makes c inaccessible; consider using ``hide (open) const c'' instead.
768 * Slightly more coherent Pure syntax, with updated documentation in
769 isar-ref manual. Removed locales meta_term_syntax and
770 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
771 INCOMPATIBILITY in rare situations. Note that &&& should not be used
772 directly in regular applications.
774 * There is a new syntactic category "float_const" for signed decimal
775 fractions (e.g. 123.45 or -123.45).
777 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
778 interface with 'setup' command instead.
780 * Command 'local_setup' is similar to 'setup', but operates on a local
783 * The 'axiomatization' command now only works within a global theory
784 context. INCOMPATIBILITY.
786 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
787 hypotheses. Sorts required in the course of reasoning need to be
788 covered by the constraints in the initial statement, completed by the
789 type instance information of the background theory. Non-trivial sort
790 hypotheses, which rarely occur in practice, may be specified via
791 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
793 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
795 The result contains an implicit sort hypotheses as before --
796 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
799 * Generalized Isar history, with support for linear undo, direct state
802 * Changed defaults for unify configuration options:
804 unify_trace_bound = 50 (formerly 25)
805 unify_search_bound = 60 (formerly 30)
807 * Different bookkeeping for code equations (INCOMPATIBILITY):
809 a) On theory merge, the last set of code equations for a particular
810 constant is taken (in accordance with the policy applied by other
811 parts of the code generator framework).
813 b) Code equations stemming from explicit declarations (e.g. code
814 attribute) gain priority over default code equations stemming
815 from definition, primrec, fun etc.
817 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
819 * Unified theorem tables for both code generators. Thus [code
820 func] has disappeared and only [code] remains. INCOMPATIBILITY.
822 * Command 'find_consts' searches for constants based on type and name
825 find_consts "_ => bool"
827 By default, matching is against subtypes, but it may be restricted to
828 the whole type. Searching by name is possible. Multiple queries are
829 conjunctive and queries may be negated by prefixing them with a
832 find_consts strict: "_ => bool" name: "Int" -"int => int"
834 * New 'find_theorems' criterion "solves" matches theorems that
835 directly solve the current goal (modulo higher-order unification).
837 * Auto solve feature for main theorem statements: whenever a new goal
838 is stated, "find_theorems solves" is called; any theorems that could
839 solve the lemma directly are listed as part of the goal state.
840 Cf. associated options in Proof General Isabelle settings menu,
841 enabled by default, with reasonable timeout for pathological cases of
842 higher-order unification.
845 *** Document preparation ***
847 * Antiquotation @{lemma} now imitates a regular terminal proof,
848 demanding keyword 'by' and supporting the full method expression
849 syntax just like the Isar command 'by'.
854 * Integrated main parts of former image HOL-Complex with HOL. Entry
855 points Main and Complex_Main remain as before.
857 * Logic image HOL-Plain provides a minimal HOL with the most important
858 tools available (inductive, datatype, primrec, ...). This facilitates
859 experimentation and tool development. Note that user applications
860 (and library theories) should never refer to anything below theory
863 * Logic image HOL-Main stops at theory Main, and thus facilitates
864 experimentation due to shorter build times.
866 * Logic image HOL-NSA contains theories of nonstandard analysis which
867 were previously part of former HOL-Complex. Entry point Hyperreal
868 remains valid, but theories formerly using Complex_Main should now use
869 new entry point Hypercomplex.
871 * Generic ATP manager for Sledgehammer, based on ML threads instead of
872 Posix processes. Avoids potentially expensive forking of the ML
873 process. New thread-based implementation also works on non-Unix
874 platforms (Cygwin). Provers are no longer hardwired, but defined
875 within the theory via plain ML wrapper functions. Basic Sledgehammer
876 commands are covered in the isar-ref manual.
878 * Wrapper scripts for remote SystemOnTPTP service allows to use
879 sledgehammer without local ATP installation (Vampire etc.). Other
880 provers may be included via suitable ML wrappers, see also
881 src/HOL/ATP_Linkup.thy.
883 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
886 * The metis method no longer fails because the theorem is too trivial
887 (contains the empty clause).
889 * The metis method now fails in the usual manner, rather than raising
890 an exception, if it determines that it cannot prove the theorem.
892 * Method "coherent" implements a prover for coherent logic (see also
893 src/Tools/coherent.ML).
895 * Constants "undefined" and "default" replace "arbitrary". Usually
896 "undefined" is the right choice to replace "arbitrary", though
897 logically there is no difference. INCOMPATIBILITY.
899 * Command "value" now integrates different evaluation mechanisms. The
900 result of the first successful evaluation mechanism is printed. In
901 square brackets a particular named evaluation mechanisms may be
902 specified (currently, [SML], [code] or [nbe]). See further
903 src/HOL/ex/Eval_Examples.thy.
905 * Normalization by evaluation now allows non-leftlinear equations.
906 Declare with attribute [code nbe].
908 * Methods "case_tac" and "induct_tac" now refer to the very same rules
909 as the structured Isar versions "cases" and "induct", cf. the
910 corresponding "cases" and "induct" attributes. Mutual induction rules
911 are now presented as a list of individual projections
912 (e.g. foo_bar.inducts for types foo and bar); the old format with
913 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
914 rare situations a different rule is selected --- notably nested tuple
915 elimination instead of former prod.exhaust: use explicit (case_tac t
916 rule: prod.exhaust) here.
918 * Attributes "cases", "induct", "coinduct" support "del" option.
920 * Removed fact "case_split_thm", which duplicates "case_split".
922 * The option datatype has been moved to a new theory Option. Renamed
923 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
925 * New predicate "strict_mono" classifies strict functions on partial
926 orders. With strict functions on linear orders, reasoning about
927 (in)equalities is facilitated by theorems "strict_mono_eq",
928 "strict_mono_less_eq" and "strict_mono_less".
930 * Some set operations are now proper qualified constants with
931 authentic syntax. INCOMPATIBILITY:
942 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
945 * Auxiliary class "itself" has disappeared -- classes without any
946 parameter are treated as expected by the 'class' command.
948 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
950 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
951 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
953 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
954 method "approximation". It proves formulas on real values by using
955 interval arithmetic. In the formulas are also the transcendental
956 functions sin, cos, tan, atan, ln, exp and the constant pi are
957 allowed. For examples see
958 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
960 * Theory "Reflection" now resides in HOL/Library.
962 * Entry point to Word library now simply named "Word".
965 * Made source layout more coherent with logical distribution
968 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
969 src/HOL/Library/Code_Message.thy ~> src/HOL/
970 src/HOL/Library/GCD.thy ~> src/HOL/
971 src/HOL/Library/Order_Relation.thy ~> src/HOL/
972 src/HOL/Library/Parity.thy ~> src/HOL/
973 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
974 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
975 src/HOL/Real/Lubs.thy ~> src/HOL/
976 src/HOL/Real/PReal.thy ~> src/HOL/
977 src/HOL/Real/Rational.thy ~> src/HOL/
978 src/HOL/Real/RComplete.thy ~> src/HOL/
979 src/HOL/Real/RealDef.thy ~> src/HOL/
980 src/HOL/Real/RealPow.thy ~> src/HOL/
981 src/HOL/Real/Real.thy ~> src/HOL/
982 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
983 src/HOL/Complex/Complex.thy ~> src/HOL/
984 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
985 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
986 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
987 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
988 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
989 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
990 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
991 src/HOL/Hyperreal/Log.thy ~> src/HOL/
992 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
993 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
994 src/HOL/Hyperreal/Series.thy ~> src/HOL/
995 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
996 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
997 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
998 src/HOL/Real/Float ~> src/HOL/Library/
999 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1000 src/HOL/Real/RealVector.thy ~> src/HOL/
1002 src/HOL/arith_data.ML ~> src/HOL/Tools
1003 src/HOL/hologic.ML ~> src/HOL/Tools
1004 src/HOL/simpdata.ML ~> src/HOL/Tools
1005 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1006 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1007 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1008 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1009 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1010 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1011 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1013 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1014 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1015 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1016 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1017 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1018 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1020 * If methods "eval" and "evaluation" encounter a structured proof
1021 state with !!/==>, only the conclusion is evaluated to True (if
1022 possible), avoiding strange error messages.
1024 * Method "sizechange" automates termination proofs using (a
1025 modification of) the size-change principle. Requires SAT solver. See
1026 src/HOL/ex/Termination.thy for examples.
1028 * Simplifier: simproc for let expressions now unfolds if bound
1029 variable occurs at most once in let expression body. INCOMPATIBILITY.
1031 * Method "arith": Linear arithmetic now ignores all inequalities when
1032 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1034 * New attribute "arith" for facts that should always be used
1035 automatically by arithmetic. It is intended to be used locally in
1038 assumes [arith]: "x > 0"
1040 Global usage is discouraged because of possible performance impact.
1042 * New classes "top" and "bot" with corresponding operations "top" and
1043 "bot" in theory Orderings; instantiation of class "complete_lattice"
1044 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1046 * Changed definition lemma "less_fun_def" in order to provide an
1047 instance for preorders on functions; use lemma "less_le" instead.
1050 * Theory Orderings: class "wellorder" moved here, with explicit
1051 induction rule "less_induct" as assumption. For instantiation of
1052 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1055 * Theory Orderings: added class "preorder" as superclass of "order".
1056 INCOMPATIBILITY: Instantiation proofs for order, linorder
1057 etc. slightly changed. Some theorems named order_class.* now named
1060 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1063 * Theory Finite_Set: added a new fold combinator of type
1065 ('a => 'b => 'b) => 'b => 'a set => 'b
1067 Occasionally this is more convenient than the old fold combinator
1068 which is now defined in terms of the new one and renamed to
1071 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1072 and "ring_simps" have been replaced by "algebra_simps" (which can be
1073 extended with further lemmas!). At the moment both still exist but
1074 the former will disappear at some point.
1076 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1077 class recpower. Type-specific simp rules for various recpower types
1078 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1080 rat_power_0 -> power_0
1081 rat_power_Suc -> power_Suc
1082 realpow_0 -> power_0
1083 realpow_Suc -> power_Suc
1084 complexpow_0 -> power_0
1085 complexpow_Suc -> power_Suc
1086 power_poly_0 -> power_0
1087 power_poly_Suc -> power_Suc
1089 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1090 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1091 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1092 of lemmas from Divides has been generalized from nat to class
1093 semiring_div. INCOMPATIBILITY. This involves the following theorem
1094 renames resulting from duplicate elimination:
1096 dvd_def_mod ~> dvd_eq_mod_eq_0
1097 zero_dvd_iff ~> dvd_0_left_iff
1098 dvd_0 ~> dvd_0_right
1099 DIVISION_BY_ZERO_DIV ~> div_by_0
1100 DIVISION_BY_ZERO_MOD ~> mod_by_0
1101 mult_div ~> div_mult_self2_is_id
1102 mult_mod ~> mod_mult_self2_is_0
1104 * Theory IntDiv: removed many lemmas that are instances of class-based
1105 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1106 rename old lemmas as follows:
1108 dvd_diff -> nat_dvd_diff
1109 dvd_zminus_iff -> dvd_minus_iff
1110 mod_add1_eq -> mod_add_eq
1111 mod_mult1_eq -> mod_mult_right_eq
1112 mod_mult1_eq' -> mod_mult_left_eq
1113 mod_mult_distrib_mod -> mod_mult_eq
1114 nat_mod_add_left_eq -> mod_add_left_eq
1115 nat_mod_add_right_eq -> mod_add_right_eq
1116 nat_mod_div_trivial -> mod_div_trivial
1117 nat_mod_mod_trivial -> mod_mod_trivial
1118 zdiv_zadd_self1 -> div_add_self1
1119 zdiv_zadd_self2 -> div_add_self2
1120 zdiv_zmult_self1 -> div_mult_self2_is_id
1121 zdiv_zmult_self2 -> div_mult_self1_is_id
1122 zdvd_triv_left -> dvd_triv_left
1123 zdvd_triv_right -> dvd_triv_right
1124 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1125 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1126 zmod_zadd_left_eq -> mod_add_left_eq
1127 zmod_zadd_right_eq -> mod_add_right_eq
1128 zmod_zadd_self1 -> mod_add_self1
1129 zmod_zadd_self2 -> mod_add_self2
1130 zmod_zadd1_eq -> mod_add_eq
1131 zmod_zdiff1_eq -> mod_diff_eq
1132 zmod_zdvd_zmod -> mod_mod_cancel
1133 zmod_zmod_cancel -> mod_mod_cancel
1134 zmod_zmult_self1 -> mod_mult_self2_is_0
1135 zmod_zmult_self2 -> mod_mult_self1_is_0
1138 zdvd_abs1 -> abs_dvd_iff
1139 zdvd_abs2 -> dvd_abs_iff
1140 zdvd_refl -> dvd_refl
1141 zdvd_trans -> dvd_trans
1142 zdvd_zadd -> dvd_add
1143 zdvd_zdiff -> dvd_diff
1144 zdvd_zminus_iff -> dvd_minus_iff
1145 zdvd_zminus2_iff -> minus_dvd_iff
1146 zdvd_zmultD -> dvd_mult_right
1147 zdvd_zmultD2 -> dvd_mult_left
1148 zdvd_zmult_mono -> mult_dvd_mono
1149 zdvd_0_right -> dvd_0_right
1150 zdvd_0_left -> dvd_0_left_iff
1151 zdvd_1_left -> one_dvd
1152 zminus_dvd_iff -> minus_dvd_iff
1154 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1156 * The real numbers offer decimal input syntax: 12.34 is translated
1157 into 1234/10^2. This translation is not reversed upon output.
1159 * Theory Library/Polynomial defines an abstract type 'a poly of
1160 univariate polynomials with coefficients of type 'a. In addition to
1161 the standard ring operations, it also supports div and mod. Code
1162 generation is also supported, using list-style constructors.
1164 * Theory Library/Inner_Product defines a class of real_inner for real
1165 inner product spaces, with an overloaded operation inner :: 'a => 'a
1166 => real. Class real_inner is a subclass of real_normed_vector from
1169 * Theory Library/Product_Vector provides instances for the product
1170 type 'a * 'b of several classes from RealVector and Inner_Product.
1171 Definitions of addition, subtraction, scalar multiplication, norms,
1172 and inner products are included.
1174 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1175 addition to the field operations, numerals and case syntax are also
1178 * Theory Library/Diagonalize provides constructive version of Cantor's
1179 first diagonalization argument.
1181 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1182 zlcm (for int); carried together from various gcd/lcm developements in
1183 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1184 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1185 may recover tupled syntax as follows:
1187 hide (open) const gcd
1188 abbreviation gcd where
1189 "gcd == (%(a, b). GCD.gcd a b)"
1191 GCD.gcd ("gcd '(_, _')")
1193 The same works for lcm, zgcd, zlcm.
1195 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1196 instantiations for algebraic structures. Removed some duplicate
1197 theorems. Changes in simp rules. INCOMPATIBILITY.
1199 * ML antiquotation @{code} takes a constant as argument and generates
1200 corresponding code in background and inserts name of the corresponding
1201 resulting ML value/function/datatype constructor binding in place.
1202 All occurrences of @{code} with a single ML block are generated
1203 simultaneously. Provides a generic and safe interface for
1204 instrumentalizing code generation. See
1205 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1206 In future you ought to refrain from ad-hoc compiling generated SML
1207 code on the ML toplevel. Note that (for technical reasons) @{code}
1208 cannot refer to constants for which user-defined serializations are
1209 set. Refer to the corresponding ML counterpart directly in that
1212 * Command 'rep_datatype': instead of theorem names the command now
1213 takes a list of terms denoting the constructors of the type to be
1214 represented as datatype. The characteristic theorems have to be
1215 proven. INCOMPATIBILITY. Also observe that the following theorems
1216 have disappeared in favour of existing ones:
1218 unit_induct ~> unit.induct
1219 prod_induct ~> prod.induct
1220 sum_induct ~> sum.induct
1221 Suc_Suc_eq ~> nat.inject
1222 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1227 * New locales for orders and lattices where the equivalence relation
1228 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1229 locales use a record structure with field eq for the equivalence.
1231 * New theory of factorial domains.
1233 * Units_l_inv and Units_r_inv are now simp rules by default.
1234 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1235 and/or r_inv will now also require deletion of these lemmas.
1237 * Renamed the following theorems, INCOMPATIBILITY:
1239 UpperD ~> Upper_memD
1240 LowerD ~> Lower_memD
1241 least_carrier ~> least_closed
1242 greatest_carrier ~> greatest_closed
1243 greatest_Lower_above ~> greatest_Lower_below
1244 one_zero ~> carrier_one_zero
1245 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1250 * Nominal datatypes can now contain type-variables.
1252 * Commands 'nominal_inductive' and 'equivariance' work with local
1255 * Nominal primrec can now works with local theory targets and its
1256 specification syntax now conforms to the general format as seen in
1259 * Method "perm_simp" honours the standard simplifier attributes
1260 (no_asm), (no_asm_use) etc.
1262 * The new predicate #* is defined like freshness, except that on the
1263 left hand side can be a set or list of atoms.
1265 * Experimental command 'nominal_inductive2' derives strong induction
1266 principles for inductive definitions. In contrast to
1267 'nominal_inductive', which can only deal with a fixed number of
1268 binders, it can deal with arbitrary expressions standing for sets of
1269 atoms to be avoided. The only inductive definition we have at the
1270 moment that needs this generalisation is the typing rule for Lets in
1273 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1274 -----------------------------------------------------------------
1275 Gamma |- Let x be t1 in t2 : T2
1277 In this rule one wants to avoid all the binders that are introduced by
1278 "close Gamma T1". We are looking for other examples where this
1279 feature might be useful. Please let us know.
1284 * Reimplemented the simplification procedure for proving continuity
1285 subgoals. The new simproc is extensible; users can declare additional
1286 continuity introduction rules with the attribute [cont2cont].
1288 * The continuity simproc now uses a different introduction rule for
1289 solving continuity subgoals on terms with lambda abstractions. In
1290 some rare cases the new simproc may fail to solve subgoals that the
1291 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1292 Potential INCOMPATIBILITY.
1294 * Command 'fixrec': specification syntax now conforms to the general
1295 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1296 examples. INCOMPATIBILITY.
1301 * Proof of Zorn's Lemma for partial orders.
1306 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1307 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1308 depends on multithreading, so timouts will not work before Poly/ML
1311 * High-level support for concurrent ML programming, see
1312 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1313 particularly convenient to organize independent functional
1314 computations. The concept of "synchronized variables" provides a
1315 higher-order interface for components with shared state, avoiding the
1316 delicate details of mutexes and condition variables. (Requires
1317 Poly/ML 5.2.1 or later.)
1319 * ML bindings produced via Isar commands are stored within the Isar
1320 context (theory or proof). Consequently, commands like 'use' and 'ML'
1321 become thread-safe and work with undo as expected (concerning
1322 top-level bindings, not side-effects on global references).
1323 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1324 compiler at runtime; really global bindings need to be given outside a
1325 theory. (Requires Poly/ML 5.2 or later.)
1327 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1328 context. Top-level ML bindings are stored within the proof context in
1329 a purely sequential fashion, disregarding the nested proof structure.
1330 ML bindings introduced by 'ML_prf' are discarded at the end of the
1331 proof. (Requires Poly/ML 5.2 or later.)
1333 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1334 and Method.setup, as well as Isar commands 'attribute_setup' and
1335 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1336 existing code accordingly, or use plain 'setup' together with old
1339 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1340 to 'a -> thm, while results are always tagged with an authentic oracle
1341 name. The Isar command 'oracle' is now polymorphic, no argument type
1342 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1343 accordingly. Note that extra performance may be gained by producing
1344 the cterm carefully, avoiding slow Thm.cterm_of.
1346 * Simplified interface for defining document antiquotations via
1347 ThyOutput.antiquotation, ThyOutput.output, and optionally
1348 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1349 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1352 * More systematic treatment of long names, abstract name bindings, and
1353 name space operations. Basic operations on qualified names have been
1354 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1355 Long_Name.append. Old type bstring has been mostly replaced by
1356 abstract type binding (see structure Binding), which supports precise
1357 qualification by packages and local theory targets, as well as proper
1358 tracking of source positions. INCOMPATIBILITY, need to wrap old
1359 bstring values into Binding.name, or better pass through abstract
1360 bindings everywhere. See further src/Pure/General/long_name.ML,
1361 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1363 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1364 LocalTheory.note etc.) now refer to the *full* internal name, not the
1365 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1367 * Disposed old type and term read functions (Sign.read_def_typ,
1368 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1369 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1370 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1371 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1372 resort for legacy applications.
1374 * Disposed old declarations, tactics, tactic combinators that refer to
1375 the simpset or claset of an implicit theory (such as Addsimps,
1376 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1377 embedded ML text, or local_simpset_of with a proper context passed as
1378 explicit runtime argument.
1380 * Rules and tactics that read instantiations (read_instantiate,
1381 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1382 context, which is required for parsing and type-checking. Moreover,
1383 the variables are specified as plain indexnames, not string encodings
1384 thereof. INCOMPATIBILITY.
1386 * Generic Toplevel.add_hook interface allows to analyze the result of
1387 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1388 for theorem dependency output of transactions resulting in a new
1391 * ML antiquotations: block-structured compilation context indicated by
1392 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1394 @{binding name} - basic name binding
1395 @{let ?pat = term} - term abbreviation (HO matching)
1396 @{note name = fact} - fact abbreviation
1397 @{thm fact} - singleton fact (with attributes)
1398 @{thms fact} - general fact (with attributes)
1399 @{lemma prop by method} - singleton goal
1400 @{lemma prop by meth1 meth2} - singleton goal
1401 @{lemma prop1 ... propN by method} - general goal
1402 @{lemma prop1 ... propN by meth1 meth2} - general goal
1403 @{lemma (open) ...} - open derivation
1408 * The Isabelle "emacs" tool provides a specific interface to invoke
1409 Proof General / Emacs, with more explicit failure if that is not
1410 installed (the old isabelle-interface script silently falls back on
1411 isabelle-process). The PROOFGENERAL_HOME setting determines the
1412 installation location of the Proof General distribution.
1414 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1415 the Isabelle process into a JVM/Scala application. See
1416 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1417 process wrapper has been discontinued.)
1419 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1421 * Various status messages (with exact source position information) are
1422 emitted, if proper markup print mode is enabled. This allows
1423 user-interface components to provide detailed feedback on internal
1428 New in Isabelle2008 (June 2008)
1429 -------------------------------
1433 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1434 and updated, with formally checked references as hyperlinks.
1436 * Theory loader: use_thy (and similar operations) no longer set the
1437 implicit ML context, which was occasionally hard to predict and in
1438 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1439 provides a proper context already.
1441 * Theory loader: old-style ML proof scripts being *attached* to a thy
1442 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1443 'use' within a theory file will do the job.
1445 * Name space merge now observes canonical order, i.e. the second space
1446 is inserted into the first one, while existing entries in the first
1447 space take precedence. INCOMPATIBILITY in rare situations, may try to
1448 swap theory imports.
1450 * Syntax: symbol \<chi> is now considered a letter. Potential
1451 INCOMPATIBILITY in identifier syntax etc.
1453 * Outer syntax: string tokens no longer admit escaped white space,
1454 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1455 white space without escapes.
1457 * Outer syntax: string tokens may contain arbitrary character codes
1458 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1464 * Context-dependent token translations. Default setup reverts locally
1465 fixed variables, and adds hilite markup for undeclared frees.
1467 * Unused theorems can be found using the new command 'unused_thms'.
1468 There are three ways of invoking it:
1471 Only finds unused theorems in the current theory.
1473 (2) unused_thms thy_1 ... thy_n -
1474 Finds unused theorems in the current theory and all of its ancestors,
1475 excluding the theories thy_1 ... thy_n and all of their ancestors.
1477 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1478 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1479 their ancestors, excluding the theories thy_1 ... thy_n and all of
1482 In order to increase the readability of the list produced by
1483 unused_thms, theorems that have been created by a particular instance
1484 of a theory command such as 'inductive' or 'function' are considered
1485 to belong to the same "group", meaning that if at least one theorem in
1486 this group is used, the other theorems in the same group are no longer
1487 reported as unused. Moreover, if all theorems in the group are
1488 unused, only one theorem in the group is displayed.
1490 Note that proof objects have to be switched on in order for
1491 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1492 usually the case when using Proof General with the default settings).
1494 * Authentic naming of facts disallows ad-hoc overwriting of previous
1495 theorems within the same name space. INCOMPATIBILITY, need to remove
1496 duplicate fact bindings, or even accidental fact duplications. Note
1497 that tools may maintain dynamically scoped facts systematically, using
1498 PureThy.add_thms_dynamic.
1500 * Command 'hide' now allows to hide from "fact" name space as well.
1502 * Eliminated destructive theorem database, simpset, claset, and
1503 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1504 update of theories within ML code.
1506 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1507 INCOMPATIBILITY, object-logics depending on former Pure require
1508 additional setup PureThy.old_appl_syntax_setup; object-logics
1509 depending on former CPure need to refer to Pure.
1511 * Commands 'use' and 'ML' are now purely functional, operating on
1512 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1513 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1516 * Command 'setup': discontinued implicit version with ML reference.
1518 * Instantiation target allows for simultaneous specification of class
1519 instance operations together with an instantiation proof.
1520 Type-checking phase allows to refer to class operations uniformly.
1521 See src/HOL/Complex/Complex.thy for an Isar example and
1522 src/HOL/Library/Eval.thy for an ML example.
1524 * Indexing of literal facts: be more serious about including only
1525 facts from the visible specification/proof context, but not the
1526 background context (locale etc.). Affects `prop` notation and method
1527 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1530 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1531 "(open)" option, which used to expose internal bound variables to the
1534 * Isar statements: removed obsolete case "rule_context".
1535 INCOMPATIBILITY, better use explicit fixes/assumes.
1537 * Locale proofs: default proof step now includes 'unfold_locales';
1538 hence 'proof' without argument may be used to unfold locale
1542 *** Document preparation ***
1544 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1545 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1546 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1547 spot); renamed link color from "darkblue" to "linkcolor" (default
1548 value unchanged, can be redefined via \definecolor); no longer sets
1549 "a4paper" option (unnecessary or even intrusive).
1551 * Antiquotation @{lemma A method} proves proposition A by the given
1552 method (either a method name or a method name plus (optional) method
1553 arguments in parentheses) and prints A just like @{prop A}.
1558 * New primrec package. Specification syntax conforms in style to
1559 definition/function/.... No separate induction rule is provided. The
1560 "primrec" command distinguishes old-style and new-style specifications
1561 by syntax. The former primrec package is now named OldPrimrecPackage.
1562 When adjusting theories, beware: constants stemming from new-style
1563 primrec specifications have authentic syntax.
1565 * Metis prover is now an order of magnitude faster, and also works
1566 with multithreading.
1568 * Metis: the maximum number of clauses that can be produced from a
1569 theorem is now given by the attribute max_clauses. Theorems that
1570 exceed this number are ignored, with a warning printed.
1572 * Sledgehammer no longer produces structured proofs by default. To
1573 enable, declare [[sledgehammer_full = true]]. Attributes
1574 reconstruction_modulus, reconstruction_sorts renamed
1575 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1577 * Method "induct_scheme" derives user-specified induction rules
1578 from well-founded induction and completeness of patterns. This factors
1579 out some operations that are done internally by the function package
1580 and makes them available separately. See
1581 src/HOL/ex/Induction_Scheme.thy for examples.
1583 * More flexible generation of measure functions for termination
1584 proofs: Measure functions can be declared by proving a rule of the
1585 form "is_measure f" and giving it the [measure_function] attribute.
1586 The "is_measure" predicate is logically meaningless (always true), and
1587 just guides the heuristic. To find suitable measure functions, the
1588 termination prover sets up the goal "is_measure ?f" of the appropriate
1589 type and generates all solutions by prolog-style backwards proof using
1592 This setup also deals with rules like
1594 "is_measure f ==> is_measure (list_size f)"
1596 which accommodates nested datatypes that recurse through lists.
1597 Similar rules are predeclared for products and option types.
1599 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1603 - Definitions of overloaded constants on sets have to be replaced by
1604 definitions on => and bool.
1606 - Some definitions of overloaded operators on sets can now be proved
1607 using the definitions of the operators on => and bool. Therefore,
1608 the following theorems have been renamed:
1610 subset_def -> subset_eq
1611 psubset_def -> psubset_eq
1612 set_diff_def -> set_diff_eq
1613 Compl_def -> Compl_eq
1614 Sup_set_def -> Sup_set_eq
1615 Inf_set_def -> Inf_set_eq
1616 sup_set_def -> sup_set_eq
1617 inf_set_def -> inf_set_eq
1619 - Due to the incompleteness of the HO unification algorithm, some
1620 rules such as subst may require manual instantiation, if some of
1621 the unknowns in the rule is a set.
1623 - Higher order unification and forward proofs:
1626 have "P (S::'a set)" <...>
1627 then have "EX S. P S" ..
1629 no longer works (due to the incompleteness of the HO unification
1630 algorithm) and must be replaced by the pattern
1637 - Calculational reasoning with subst (or similar rules):
1640 have "P (S::'a set)" <...>
1641 also have "S = T" <...>
1642 finally have "P T" .
1644 no longer works (for similar reasons as the previous example) and
1645 must be replaced by something like
1647 have "P (S::'a set)" <...>
1648 moreover have "S = T" <...>
1649 ultimately have "P T" by simp
1651 - Tactics or packages written in ML code:
1652 Code performing pattern matching on types via
1654 Type ("set", [T]) => ...
1656 must be rewritten. Moreover, functions like strip_type or
1657 binder_types no longer return the right value when applied to a
1660 T1 => ... => Tn => U => bool
1664 T1 => ... => Tn => U set
1666 * Merged theories Wellfounded_Recursion, Accessible_Part and
1667 Wellfounded_Relations to theory Wellfounded.
1669 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1671 * Class finite no longer treats UNIV as class parameter. Use class
1672 enum from theory Library/Enum instead to achieve a similar effect.
1675 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1676 and "Cons". INCOMPATIBILITY.
1678 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1679 Potential INCOMPATIBILITY.
1681 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1682 injective_fst_snd removed, use split_eta and prod_eqI instead.
1683 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1685 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1686 the same name in theory Orderings:
1696 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
1697 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
1698 and different variable names.
1700 * Library/Option_ord.thy: Canonical order on option type.
1702 * Library/RBT.thy: Red-black trees, an efficient implementation of
1705 * Library/Countable.thy: Type class for countable types.
1707 * Theory Int: The representation of numerals has changed. The infix
1708 operator BIT and the bit datatype with constructors B0 and B1 have
1709 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
1710 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
1711 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
1714 * Theory Nat: definition of <= and < on natural numbers no longer
1715 depend on well-founded relations. INCOMPATIBILITY. Definitions
1716 le_def and less_def have disappeared. Consider lemmas not_less
1717 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
1719 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
1720 (whose purpose mainly is for various fold_set functionals) have been
1721 abandoned in favor of the existing algebraic classes
1722 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
1723 lower_semilattice (resp. upper_semilattice) and linorder.
1726 * Theory Transitive_Closure: induct and cases rules now declare proper
1727 case_names ("base" and "step"). INCOMPATIBILITY.
1729 * Theorem Inductive.lfp_ordinal_induct generalized to complete
1730 lattices. The form set-specific version is available as
1731 Inductive.lfp_ordinal_induct_set.
1733 * Renamed theorems "power.simps" to "power_int.simps".
1736 * Class semiring_div provides basic abstract properties of semirings
1737 with division and modulo operations. Subsumes former class dvd_mod.
1739 * Merged theories IntDef, Numeral and IntArith into unified theory
1740 Int. INCOMPATIBILITY.
1742 * Theory Library/Code_Index: type "index" now represents natural
1743 numbers rather than integers. INCOMPATIBILITY.
1745 * New class "uminus" with operation "uminus" (split of from class
1746 "minus" which now only has operation "minus", binary).
1749 * Constants "card", "internal_split", "option_map" now with authentic
1750 syntax. INCOMPATIBILITY.
1752 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
1753 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
1754 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
1755 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
1756 Sup_set_def, le_def, less_def, option_map_def now with object
1757 equality. INCOMPATIBILITY.
1759 * Records. Removed K_record, and replaced it by pure lambda term
1760 %x. c. The simplifier setup is now more robust against eta expansion.
1761 INCOMPATIBILITY: in cases explicitly referring to K_record.
1763 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
1765 * Library/ListVector: new theory of arithmetic vector operations.
1767 * Library/Order_Relation: new theory of various orderings as sets of
1768 pairs. Defines preorders, partial orders, linear orders and
1769 well-orders on sets and on types.
1774 * Renamed some theories to allow to loading both ZF and HOL in the
1777 Datatype -> Datatype_ZF
1778 Inductive -> Inductive_ZF
1785 INCOMPATIBILITY: ZF theories that import individual theories below
1786 Main might need to be adapted. Regular theory Main is still
1787 available, as trivial extension of Main_ZF.
1792 * ML within Isar: antiquotation @{const name} or @{const
1793 name(typargs)} produces statically-checked Const term.
1795 * Functor NamedThmsFun: data is available to the user as dynamic fact
1796 (of the same name). Removed obsolete print command.
1798 * Removed obsolete "use_legacy_bindings" function.
1800 * The ``print mode'' is now a thread-local value derived from a global
1801 template (the former print_mode reference), thus access becomes
1802 non-critical. The global print_mode reference is for session
1803 management only; user-code should use print_mode_value,
1804 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
1806 * Functions system/system_out provide a robust way to invoke external
1807 shell commands, with propagation of interrupts (requires Poly/ML
1808 5.2.1). Do not use OS.Process.system etc. from the basis library!
1813 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
1814 in accordance with Proof General 3.7, which prefers GNU emacs.
1816 * isatool tty runs Isabelle process with plain tty interaction;
1817 optional line editor may be specified via ISABELLE_LINE_EDITOR
1818 setting, the default settings attempt to locate "ledit" and "rlwrap".
1820 * isatool browser now works with Cygwin as well, using general
1821 "javapath" function defined in Isabelle process environment.
1823 * YXML notation provides a simple and efficient alternative to
1824 standard XML transfer syntax. See src/Pure/General/yxml.ML and
1825 isatool yxml as described in the Isabelle system manual.
1827 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
1828 provides general wrapper for managing an Isabelle process in a robust
1829 fashion, with ``cooked'' output from stdin/stderr.
1831 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
1832 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
1834 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
1835 way of changing the user's settings is via
1836 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
1839 * Multithreading.max_threads := 0 refers to the number of actual CPU
1840 cores of the underlying machine, which is a good starting point for
1841 optimal performance tuning. The corresponding usedir option -M allows
1842 "max" as an alias for "0". WARNING: does not work on certain versions
1843 of Mac OS (with Poly/ML 5.1).
1845 * isabelle-process: non-ML sessions are run with "nice", to reduce the
1846 adverse effect of Isabelle flooding interactive front-ends (notably
1847 ProofGeneral / XEmacs).
1851 New in Isabelle2007 (November 2007)
1852 -----------------------------------
1856 * More uniform information about legacy features, notably a
1857 warning/error of "Legacy feature: ...", depending on the state of the
1858 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
1859 legacy features will disappear eventually.
1861 * Theory syntax: the header format ``theory A = B + C:'' has been
1862 discontinued in favour of ``theory A imports B C begin''. Use isatool
1863 fixheaders to convert existing theory files. INCOMPATIBILITY.
1865 * Theory syntax: the old non-Isar theory file format has been
1866 discontinued altogether. Note that ML proof scripts may still be used
1867 with Isar theories; migration is usually quite simple with the ML
1868 function use_legacy_bindings. INCOMPATIBILITY.
1870 * Theory syntax: some popular names (e.g. 'class', 'declaration',
1871 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
1874 * Theory loader: be more serious about observing the static theory
1875 header specifications (including optional directories), but not the
1876 accidental file locations of previously successful loads. The strict
1877 update policy of former update_thy is now already performed by
1878 use_thy, so the former has been removed; use_thys updates several
1879 theories simultaneously, just as 'imports' within a theory header
1880 specification, but without merging the results. Potential
1881 INCOMPATIBILITY: may need to refine theory headers and commands
1882 ROOT.ML which depend on load order.
1884 * Theory loader: optional support for content-based file
1885 identification, instead of the traditional scheme of full physical
1886 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
1887 (cf. the system manual). The new scheme allows to work with
1888 non-finished theories in persistent session images, such that source
1889 files may be moved later on without requiring reloads.
1891 * Theory loader: old-style ML proof scripts being *attached* to a thy
1892 file (with the same base name as the theory) are considered a legacy
1893 feature, which will disappear eventually. Even now, the theory loader
1894 no longer maintains dependencies on such files.
1896 * Syntax: the scope for resolving ambiguities via type-inference is
1897 now limited to individual terms, instead of whole simultaneous
1898 specifications as before. This greatly reduces the complexity of the
1899 syntax module and improves flexibility by separating parsing and
1900 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
1901 'fixes' etc.) are required in rare situations.
1903 * Syntax: constants introduced by new-style packages ('definition',
1904 'abbreviation' etc.) are passed through the syntax module in
1905 ``authentic mode''. This means that associated mixfix annotations
1906 really stick to such constants, independently of potential name space
1907 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
1908 trees are represented slightly differently, may need to adapt syntax
1909 translations accordingly. Use CONST marker in 'translations' and
1910 @{const_syntax} antiquotation in 'parse_translation' etc.
1912 * Legacy goal package: reduced interface to the bare minimum required
1913 to keep existing proof scripts running. Most other user-level
1914 functions are now part of the OldGoals structure, which is *not* open
1915 by default (consider isatool expandshort before open OldGoals).
1916 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
1917 these tend to cause confusion about the actual goal (!) context being
1918 used here, which is not necessarily the same as the_context().
1920 * Command 'find_theorems': supports "*" wild-card in "name:"
1921 criterion; "with_dups" option. Certain ProofGeneral versions might
1922 support a specific search form (see ProofGeneral/CHANGES).
1924 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
1925 by default, which means that "prems" (and also "fixed variables") are
1926 suppressed from proof state output. Note that the ProofGeneral
1927 settings mechanism allows to change and save options persistently, but
1928 older versions of Isabelle will fail to start up if a negative prems
1931 * Local theory targets may be specified by non-nested blocks of
1932 ``context/locale/class ... begin'' followed by ``end''. The body may
1933 contain definitions, theorems etc., including any derived mechanism
1934 that has been implemented on top of these primitives. This concept
1935 generalizes the existing ``theorem (in ...)'' towards more versatility
1938 * Proof General interface: proper undo of final 'end' command;
1939 discontinued Isabelle/classic mode (ML proof scripts).
1942 *** Document preparation ***
1944 * Added antiquotation @{theory name} which prints the given name,
1945 after checking that it refers to a valid ancestor theory in the
1948 * Added antiquotations @{ML_type text} and @{ML_struct text} which
1949 check the given source text as ML type/structure, printing verbatim.
1951 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
1952 "c args == rhs" given in the current context. (Any number of
1953 arguments may be given on the LHS.)
1958 * The 'class' package offers a combination of axclass and locale to
1959 achieve Haskell-like type classes in Isabelle. Definitions and
1960 theorems within a class context produce both relative results (with
1961 implicit parameters according to the locale context), and polymorphic
1962 constants with qualified polymorphism (according to the class
1963 context). Within the body context of a 'class' target, a separate
1964 syntax layer ("user space type system") takes care of converting
1965 between global polymorphic consts and internal locale representation.
1966 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
1967 "isatool doc classes" provides a tutorial.
1969 * Generic code generator framework allows to generate executable
1970 code for ML and Haskell (including Isabelle classes). A short usage
1973 internal compilation:
1974 export_code <list of constants (term syntax)> in SML
1975 writing SML code to a file:
1976 export_code <list of constants (term syntax)> in SML <filename>
1977 writing OCaml code to a file:
1978 export_code <list of constants (term syntax)> in OCaml <filename>
1979 writing Haskell code to a bunch of files:
1980 export_code <list of constants (term syntax)> in Haskell <filename>
1982 evaluating closed propositions to True/False using code generation:
1985 Reasonable default setup of framework in HOL.
1987 Theorem attributs for selecting and transforming function equations theorems:
1989 [code fun]: select a theorem as function equation for a specific constant
1990 [code fun del]: deselect a theorem as function equation for a specific constant
1991 [code inline]: select an equation theorem for unfolding (inlining) in place
1992 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
1994 User-defined serializations (target in {SML, OCaml, Haskell}):
1996 code_const <and-list of constants (term syntax)>
1997 {(target) <and-list of const target syntax>}+
1999 code_type <and-list of type constructors>
2000 {(target) <and-list of type target syntax>}+
2002 code_instance <and-list of instances>
2004 where instance ::= <type constructor> :: <class>
2006 code_class <and_list of classes>
2007 {(target) <and-list of class target syntax>}+
2008 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2010 code_instance and code_class only are effective to target Haskell.
2012 For example usage see src/HOL/ex/Codegenerator.thy and
2013 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2014 generation from Isabelle/HOL theories is available via "isatool doc
2017 * Code generator: consts in 'consts_code' Isar commands are now
2018 referred to by usual term syntax (including optional type
2021 * Command 'no_translations' removes translation rules from theory
2024 * Overloaded definitions are now actually checked for acyclic
2025 dependencies. The overloading scheme is slightly more general than
2026 that of Haskell98, although Isabelle does not demand an exact
2027 correspondence to type class and instance declarations.
2028 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2029 exotic versions of overloading -- at the discretion of the user!
2031 Polymorphic constants are represented via type arguments, i.e. the
2032 instantiation that matches an instance against the most general
2033 declaration given in the signature. For example, with the declaration
2034 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2035 as c(nat). Overloading is essentially simultaneous structural
2036 recursion over such type arguments. Incomplete specification patterns
2037 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2038 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2039 Command 'print_theory' outputs the normalized system of recursive
2040 equations, see section "definitions".
2042 * Configuration options are maintained within the theory or proof
2043 context (with name and type bool/int/string), providing a very simple
2044 interface to a poor-man's version of general context data. Tools may
2045 declare options in ML (e.g. using Attrib.config_int) and then refer to
2046 these values using Config.get etc. Users may change options via an
2047 associated attribute of the same name. This form of context
2048 declaration works particularly well with commands 'declare' or
2049 'using', for example ``declare [[foo = 42]]''. Thus it has become
2050 very easy to avoid global references, which would not observe Isar
2051 toplevel undo/redo and fail to work with multithreading.
2053 Various global ML references of Pure and HOL have been turned into
2054 configuration options:
2056 Unify.search_bound unify_search_bound
2057 Unify.trace_bound unify_trace_bound
2058 Unify.trace_simp unify_trace_simp
2059 Unify.trace_types unify_trace_types
2060 Simplifier.simp_depth_limit simp_depth_limit
2061 Blast.depth_limit blast_depth_limit
2062 DatatypeProp.dtK datatype_distinctness_limit
2063 fast_arith_neq_limit fast_arith_neq_limit
2064 fast_arith_split_limit fast_arith_split_limit
2066 * Named collections of theorems may be easily installed as context
2067 data using the functor NamedThmsFun (see also
2068 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2069 attributes; there is also a toplevel print command. This facility is
2070 just a common case of general context data, which is the preferred way
2071 for anything more complex than just a list of facts in canonical
2074 * Isar: command 'declaration' augments a local theory by generic
2075 declaration functions written in ML. This enables arbitrary content
2076 being added to the context, depending on a morphism that tells the
2077 difference of the original declaration context wrt. the application
2078 context encountered later on.
2080 * Isar: proper interfaces for simplification procedures. Command
2081 'simproc_setup' declares named simprocs (with match patterns, and body
2082 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2083 context. ML antiquotation @{simproc name} retrieves named simprocs.
2085 * Isar: an extra pair of brackets around attribute declarations
2086 abbreviates a theorem reference involving an internal dummy fact,
2087 which will be ignored later --- only the effect of the attribute on
2088 the background context will persist. This form of in-place
2089 declarations is particularly useful with commands like 'declare' and
2090 'using', for example ``have A using [[simproc a]] by simp''.
2092 * Isar: method "assumption" (and implicit closing of subproofs) now
2093 takes simple non-atomic goal assumptions into account: after applying
2094 an assumption as a rule the resulting subgoals are solved by atomic
2095 assumption steps. This is particularly useful to finish 'obtain'
2096 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2097 without referring to the original premise "!!x. P x ==> thesis" in the
2098 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2101 * Isar: implicit use of prems from the Isar proof context is
2102 considered a legacy feature. Common applications like ``have A .''
2103 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2104 referencing facts explicitly here improves readability and
2105 maintainability of proof texts.
2107 * Isar: improper proof element 'guess' is like 'obtain', but derives
2108 the obtained context from the course of reasoning! For example:
2110 assume "EX x y. A x & B y" -- "any previous fact"
2111 then guess x and y by clarify
2113 This technique is potentially adventurous, depending on the facts and
2114 proof tools being involved here.
2116 * Isar: known facts from the proof context may be specified as literal
2117 propositions, using ASCII back-quote syntax. This works wherever
2118 named facts used to be allowed so far, in proof commands, proof
2119 methods, attributes etc. Literal facts are retrieved from the context
2120 according to unification of type and term parameters. For example,
2121 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2122 theorems in the current context, then these are valid literal facts:
2123 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2125 There is also a proof method "fact" which does the same composition
2126 for explicit goal states, e.g. the following proof texts coincide with
2127 certain special cases of literal facts:
2129 have "A" by fact == note `A`
2130 have "A ==> B" by fact == note `A ==> B`
2131 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2132 have "P a ==> Q a" by fact == note `P a ==> Q a`
2134 * Isar: ":" (colon) is no longer a symbolic identifier character in
2135 outer syntax. Thus symbolic identifiers may be used without
2136 additional white space in declarations like this: ``assume *: A''.
2138 * Isar: 'print_facts' prints all local facts of the current context,
2139 both named and unnamed ones.
2141 * Isar: 'def' now admits simultaneous definitions, e.g.:
2143 def x == "t" and y == "u"
2145 * Isar: added command 'unfolding', which is structurally similar to
2146 'using', but affects both the goal state and facts by unfolding given
2147 rewrite rules. Thus many occurrences of the 'unfold' method or
2148 'unfolded' attribute may be replaced by first-class proof text.
2150 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2151 and command 'unfolding' now all support object-level equalities
2152 (potentially conditional). The underlying notion of rewrite rule is
2153 analogous to the 'rule_format' attribute, but *not* that of the
2154 Simplifier (which is usually more generous).
2156 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2157 premises of a theorem by n. Useful in conjunction with drule.
2159 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2160 method expression within a sandbox consisting of the first N
2161 sub-goals, which need to exist. For example, ``simp_all [3]''
2162 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2163 simplifies all new goals that emerge from applying rule foo to the
2164 originally first one.
2166 * Isar: schematic goals are no longer restricted to higher-order
2167 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2170 * Isar: the conclusion of a long theorem statement is now either
2171 'shows' (a simultaneous conjunction, as before), or 'obtains'
2172 (essentially a disjunction of cases with local parameters and
2173 assumptions). The latter allows to express general elimination rules
2174 adequately; in this notation common elimination rules look like this:
2176 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2178 obtains x where "P x"
2180 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2184 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2190 The subsequent classical rules even refer to the formal "thesis"
2193 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2196 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2197 obtains "thesis ==> something"
2199 The actual proof of an 'obtains' statement is analogous to that of the
2200 Isar proof element 'obtain', only that there may be several cases.
2201 Optional case names may be specified in parentheses; these will be
2202 available both in the present proof and as annotations in the
2203 resulting rule, for later use with the 'cases' method (cf. attribute
2206 * Isar: the assumptions of a long theorem statement are available as
2207 "assms" fact in the proof context. This is more appropriate than the
2208 (historical) "prems", which refers to all assumptions of the current
2209 context, including those from the target locale, proof body etc.
2211 * Isar: 'print_statement' prints theorems from the current theory or
2212 proof context in long statement form, according to the syntax of a
2215 * Isar: 'obtain' takes an optional case name for the local context
2216 introduction rule (default "that").
2218 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2219 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2222 * Pure: syntax "CONST name" produces a fully internalized constant
2223 according to the current context. This is particularly useful for
2224 syntax translations that should refer to internal constant
2225 representations independently of name spaces.
2227 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2228 instead of "FOO ". This allows multiple binder declarations to coexist
2229 in the same context. INCOMPATIBILITY.
2231 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2232 primitive that also works in a locale context (both for constants and
2233 fixed variables). Type declaration and internal syntactic representation
2234 of given constants retrieved from the context. Likewise, the
2235 'no_notation' command allows to remove given syntax annotations from the
2238 * Isar/locales: new derived specification elements 'axiomatization',
2239 'definition', 'abbreviation', which support type-inference, admit
2240 object-level specifications (equality, equivalence). See also the
2241 isar-ref manual. Examples:
2244 eq (infix "===" 50) where
2245 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2247 definition "f x y = x + y + 1"
2248 definition g where "g x = f x x"
2251 neq (infix "=!=" 50) where
2252 "x =!= y == ~ (x === y)"
2254 These specifications may be also used in a locale context. Then the
2255 constants being introduced depend on certain fixed parameters, and the
2256 constant name is qualified by the locale base name. An internal
2257 abbreviation takes care for convenient input and output, making the
2258 parameters implicit and using the original short name. See also
2259 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2260 entities from a monomorphic theory.
2262 Presently, abbreviations are only available 'in' a target locale, but
2263 not inherited by general import expressions. Also note that
2264 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2265 'translations' in common applications. The "no_abbrevs" print mode
2266 prevents folding of abbreviations in term output.
2268 Concrete syntax is attached to specified constants in internal form,
2269 independently of name spaces. The parse tree representation is
2270 slightly different -- use 'notation' instead of raw 'syntax', and
2271 'translations' with explicit "CONST" markup to accommodate this.
2273 * Pure/Isar: unified syntax for new-style specification mechanisms
2274 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2275 full type inference and dummy patterns ("_"). For example:
2277 definition "K x _ = x"
2279 inductive conj for A B
2280 where "A ==> B ==> conj A B"
2282 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2283 the current context. Print mode "no_abbrevs" prevents inversion of
2284 abbreviations on output.
2286 * Isar/locales: improved parameter handling: use of locales "var" and
2287 "struct" no longer necessary; - parameter renamings are no longer
2288 required to be injective. For example, this allows to define
2289 endomorphisms as locale endom = homom mult mult h.
2291 * Isar/locales: changed the way locales with predicates are defined.
2292 Instead of accumulating the specification, the imported expression is
2293 now an interpretation. INCOMPATIBILITY: different normal form of
2294 locale expressions. In particular, in interpretations of locales with
2295 predicates, goals repesenting already interpreted fragments are not
2296 removed automatically. Use methods `intro_locales' and
2297 `unfold_locales'; see below.
2299 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2300 provide backward reasoning on locales predicates. The methods are
2301 aware of interpretations and discharge corresponding goals.
2302 `intro_locales' is less aggressive then `unfold_locales' and does not
2303 unfold predicates to assumptions.
2305 * Isar/locales: the order in which locale fragments are accumulated
2306 has changed. This enables to override declarations from fragments due
2307 to interpretations -- for example, unwanted simp rules.
2309 * Isar/locales: interpretation in theories and proof contexts has been
2310 extended. One may now specify (and prove) equations, which are
2311 unfolded in interpreted theorems. This is useful for replacing
2312 defined concepts (constants depending on locale parameters) by
2313 concepts already existing in the target context. Example:
2315 interpretation partial_order ["op <= :: [int, int] => bool"]
2316 where "partial_order.less (op <=) (x::int) y = (x < y)"
2318 Typically, the constant `partial_order.less' is created by a
2319 definition specification element in the context of locale
2322 * Method "induct": improved internal context management to support
2323 local fixes and defines on-the-fly. Thus explicit meta-level
2324 connectives !! and ==> are rarely required anymore in inductive goals
2325 (using object-logic connectives for this purpose has been long
2326 obsolete anyway). Common proof patterns are explained in
2327 src/HOL/Induct/Common_Patterns.thy, see also
2328 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2331 * Method "induct": improved handling of simultaneous goals. Instead of
2332 introducing object-level conjunction, the statement is now split into
2333 several conclusions, while the corresponding symbolic cases are nested
2334 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2335 see src/HOL/Induct/Common_Patterns.thy, for example.
2337 * Method "induct": mutual induction rules are now specified as a list
2338 of rule sharing the same induction cases. HOL packages usually provide
2339 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2340 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2341 mutual induction rules differently, i.e. like this:
2343 (induct rule: foo_bar.inducts)
2344 (induct set: foo bar)
2345 (induct pred: foo bar)
2346 (induct type: foo bar)
2348 The ML function ProjectRule.projections turns old-style rules into the
2351 * Method "coinduct": dual of induction, see
2352 src/HOL/Library/Coinductive_List.thy for various examples.
2354 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2355 considered a legacy feature.
2357 * Attribute "symmetric" produces result with standardized schematic
2358 variables (index 0). Potential INCOMPATIBILITY.
2360 * Simplifier: by default the simplifier trace only shows top level
2361 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2362 default. Thus there is less danger of being flooded by the trace. The
2363 trace indicates where parts have been suppressed.
2365 * Provers/classical: removed obsolete classical version of elim_format
2366 attribute; classical elim/dest rules are now treated uniformly when
2367 manipulating the claset.
2369 * Provers/classical: stricter checks to ensure that supplied intro,
2370 dest and elim rules are well-formed; dest and elim rules must have at
2373 * Provers/classical: attributes dest/elim/intro take an optional
2374 weight argument for the rule (just as the Pure versions). Weights are
2375 ignored by automated tools, but determine the search order of single
2378 * Syntax: input syntax now supports dummy variable binding "%_. b",
2379 where the body does not mention the bound variable. Note that dummy
2380 patterns implicitly depend on their context of bounds, which makes
2381 "{_. _}" match any set comprehension as expected. Potential
2382 INCOMPATIBILITY -- parse translations need to cope with syntactic
2383 constant "_idtdummy" in the binding position.
2385 * Syntax: removed obsolete syntactic constant "_K" and its associated
2386 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2387 for example "A -> B" => "Pi A (%_. B)".
2389 * Pure: 'class_deps' command visualizes the subclass relation, using
2390 the graph browser tool.
2392 * Pure: 'print_theory' now suppresses certain internal declarations by
2393 default; use '!' option for full details.
2398 * Method "metis" proves goals by applying the Metis general-purpose
2399 resolution prover (see also http://gilith.com/software/metis/).
2400 Examples are in the directory MetisExamples. WARNING: the
2401 Isabelle/HOL-Metis integration does not yet work properly with
2404 * Command 'sledgehammer' invokes external automatic theorem provers as
2405 background processes. It generates calls to the "metis" method if
2406 successful. These can be pasted into the proof. Users do not have to
2407 wait for the automatic provers to return. WARNING: does not really
2408 work with multi-threading.
2410 * New "auto_quickcheck" feature tests outermost goal statements for
2411 potential counter-examples. Controlled by ML references
2412 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2413 5000 milliseconds). Fails silently if statements is outside of
2414 executable fragment, or any other codgenerator problem occurs.
2416 * New constant "undefined" with axiom "undefined x = undefined".
2418 * Added class "HOL.eq", allowing for code generation with polymorphic
2421 * Some renaming of class constants due to canonical name prefixing in
2422 the new 'class' package:
2424 HOL.abs ~> HOL.abs_class.abs
2425 HOL.divide ~> HOL.divide_class.divide
2426 0 ~> HOL.zero_class.zero
2427 1 ~> HOL.one_class.one
2428 op + ~> HOL.plus_class.plus
2429 op - ~> HOL.minus_class.minus
2430 uminus ~> HOL.minus_class.uminus
2431 op * ~> HOL.times_class.times
2432 op < ~> HOL.ord_class.less
2433 op <= > HOL.ord_class.less_eq
2434 Nat.power ~> Power.power_class.power
2435 Nat.size ~> Nat.size_class.size
2436 Numeral.number_of ~> Numeral.number_class.number_of
2437 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2438 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2439 Orderings.min ~> Orderings.ord_class.min
2440 Orderings.max ~> Orderings.ord_class.max
2441 Divides.op div ~> Divides.div_class.div
2442 Divides.op mod ~> Divides.div_class.mod
2443 Divides.op dvd ~> Divides.div_class.dvd
2445 INCOMPATIBILITY. Adaptions may be required in the following cases:
2447 a) User-defined constants using any of the names "plus", "minus",
2448 "times", "less" or "less_eq". The standard syntax translations for
2449 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2452 b) Variables named "plus", "minus", "times", "less", "less_eq"
2453 INCOMPATIBILITY: use more specific names.
2455 c) Permutative equations (e.g. "a + b = b + a")
2456 Since the change of names also changes the order of terms, permutative
2457 rewrite rules may get applied in a different order. Experience shows
2458 that this is rarely the case (only two adaptions in the whole Isabelle
2459 distribution). INCOMPATIBILITY: rewrite proofs
2461 d) ML code directly refering to constant names
2462 This in general only affects hand-written proof tactics, simprocs and
2463 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2464 Consider using @{const_name} antiquotation.
2466 * New class "default" with associated constant "default".
2468 * Function "sgn" is now overloaded and available on int, real, complex
2469 (and other numeric types), using class "sgn". Two possible defs of
2470 sgn are given as equational assumptions in the classes sgn_if and
2471 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2474 * Locale "partial_order" now unified with class "order" (cf. theory
2475 Orderings), added parameter "less". INCOMPATIBILITY.
2477 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2478 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2479 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2481 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2482 changed order of proof goals in instance proofs.
2484 * The transitivity reasoner for partial and linear orders is set up
2485 for classes "order" and "linorder". Instances of the reasoner are available
2486 in all contexts importing or interpreting the corresponding locales.
2487 Method "order" invokes the reasoner separately; the reasoner
2488 is also integrated with the Simplifier as a solver. Diagnostic
2489 command 'print_orders' shows the available instances of the reasoner
2490 in the current context.
2492 * Localized monotonicity predicate in theory "Orderings"; integrated
2493 lemmas max_of_mono and min_of_mono with this predicate.
2496 * Formulation of theorem "dense" changed slightly due to integration
2497 with new class dense_linear_order.
2499 * Uniform lattice theory development in HOL.
2501 constants "meet" and "join" now named "inf" and "sup"
2502 constant "Meet" now named "Inf"
2504 classes "meet_semilorder" and "join_semilorder" now named
2505 "lower_semilattice" and "upper_semilattice"
2506 class "lorder" now named "lattice"
2507 class "comp_lat" now named "complete_lattice"
2509 Instantiation of lattice classes allows explicit definitions
2510 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2512 INCOMPATIBILITY. Theorem renames:
2514 meet_left_le ~> inf_le1
2515 meet_right_le ~> inf_le2
2516 join_left_le ~> sup_ge1
2517 join_right_le ~> sup_ge2
2518 meet_join_le ~> inf_sup_ord
2521 le_meet ~> le_inf_iff
2522 le_join ~> ge_sup_conv
2523 meet_idempotent ~> inf_idem
2524 join_idempotent ~> sup_idem
2525 meet_comm ~> inf_commute
2526 join_comm ~> sup_commute
2527 meet_leI1 ~> le_infI1
2528 meet_leI2 ~> le_infI2
2529 le_joinI1 ~> le_supI1
2530 le_joinI2 ~> le_supI2
2531 meet_assoc ~> inf_assoc
2532 join_assoc ~> sup_assoc
2533 meet_left_comm ~> inf_left_commute
2534 meet_left_idempotent ~> inf_left_idem
2535 join_left_comm ~> sup_left_commute
2536 join_left_idempotent ~> sup_left_idem
2539 le_def_meet ~> le_iff_inf
2540 le_def_join ~> le_iff_sup
2541 join_absorp2 ~> sup_absorb2
2542 join_absorp1 ~> sup_absorb1
2543 meet_absorp1 ~> inf_absorb1
2544 meet_absorp2 ~> inf_absorb2
2545 meet_join_absorp ~> inf_sup_absorb
2546 join_meet_absorp ~> sup_inf_absorb
2547 distrib_join_le ~> distrib_sup_le
2548 distrib_meet_le ~> distrib_inf_le
2550 add_meet_distrib_left ~> add_inf_distrib_left
2551 add_join_distrib_left ~> add_sup_distrib_left
2552 is_join_neg_meet ~> is_join_neg_inf
2553 is_meet_neg_join ~> is_meet_neg_sup
2554 add_meet_distrib_right ~> add_inf_distrib_right
2555 add_join_distrib_right ~> add_sup_distrib_right
2556 add_meet_join_distribs ~> add_sup_inf_distribs
2557 join_eq_neg_meet ~> sup_eq_neg_inf
2558 meet_eq_neg_join ~> inf_eq_neg_sup
2559 add_eq_meet_join ~> add_eq_inf_sup
2560 meet_0_imp_0 ~> inf_0_imp_0
2561 join_0_imp_0 ~> sup_0_imp_0
2562 meet_0_eq_0 ~> inf_0_eq_0
2563 join_0_eq_0 ~> sup_0_eq_0
2564 neg_meet_eq_join ~> neg_inf_eq_sup
2565 neg_join_eq_meet ~> neg_sup_eq_inf
2566 join_eq_if ~> sup_eq_if
2568 mono_meet ~> mono_inf
2569 mono_join ~> mono_sup
2570 meet_bool_eq ~> inf_bool_eq
2571 join_bool_eq ~> sup_bool_eq
2572 meet_fun_eq ~> inf_fun_eq
2573 join_fun_eq ~> sup_fun_eq
2574 meet_set_eq ~> inf_set_eq
2575 join_set_eq ~> sup_set_eq
2576 meet1_iff ~> inf1_iff
2577 meet2_iff ~> inf2_iff
2586 join1_iff ~> sup1_iff
2587 join2_iff ~> sup2_iff
2597 is_meet_Meet ~> is_meet_Inf
2598 Meet_bool_def ~> Inf_bool_def
2599 Meet_fun_def ~> Inf_fun_def
2600 Meet_greatest ~> Inf_greatest
2601 Meet_lower ~> Inf_lower
2602 Meet_set_def ~> Inf_set_def
2605 Sup_bool_eq ~> Sup_bool_def
2606 Sup_fun_eq ~> Sup_fun_def
2607 Sup_set_eq ~> Sup_set_def
2609 listsp_meetI ~> listsp_infI
2610 listsp_meet_eq ~> listsp_inf_eq
2615 * Added syntactic class "size"; overloaded constant "size" now has
2616 type "'a::size ==> bool"
2618 * Internal reorganisation of `size' of datatypes: size theorems
2619 "foo.size" are no longer subsumed by "foo.simps" (but are still
2620 simplification rules by default!); theorems "prod.size" now named
2623 * Class "div" now inherits from class "times" rather than "type".
2626 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2627 Linorder etc. have disappeared; operations defined in terms of
2628 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2630 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2632 * HOL-Word: New extensive library and type for generic, fixed size
2633 machine words, with arithemtic, bit-wise, shifting and rotating
2634 operations, reflection into int, nat, and bool lists, automation for
2635 linear arithmetic (by automatic reflection into nat or int), including
2636 lemmas on overflow and monotonicity. Instantiated to all appropriate
2637 arithmetic type classes, supporting automatic simplification of
2638 numerals on all operations.
2640 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2642 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2644 * Code generator library theories:
2645 - Code_Integer represents HOL integers by big integer literals in target
2647 - Code_Char represents HOL characters by character literals in target
2649 - Code_Char_chr like Code_Char, but also offers treatment of character
2650 codes; includes Code_Integer.
2651 - Executable_Set allows to generate code for finite sets using lists.
2652 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2654 - Executable_Real implements a subset of real numbers, namly those
2655 representable by rational numbers.
2656 - Efficient_Nat implements natural numbers by integers, which in general will
2657 result in higher efficency; pattern matching with 0/Suc is eliminated;
2658 includes Code_Integer.
2659 - Code_Index provides an additional datatype index which is mapped to
2660 target-language built-in integers.
2661 - Code_Message provides an additional datatype message_string which is isomorphic to
2662 strings; messages are mapped to target-language strings.
2664 * New package for inductive predicates
2666 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2669 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2670 for z_1 :: U_1 and ... and z_n :: U_m
2672 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2675 with full support for type-inference, rather than
2677 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2679 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2680 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2682 inductive "s z_1 ... z_m"
2684 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2687 For backward compatibility, there is a wrapper allowing inductive
2688 sets to be defined with the new package via
2691 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2692 for z_1 :: U_1 and ... and z_n :: U_m
2694 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2700 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2701 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2702 for z_1 :: U_1 and ... and z_n :: U_m
2704 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2705 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2708 if the additional syntax "p ..." is required.
2710 Numerous examples can be found in the subdirectories src/HOL/Auth,
2711 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
2715 - Since declaration and definition of inductive sets or predicates
2716 is no longer separated, abbreviations involving the newly
2717 introduced sets or predicates must be specified together with the
2718 introduction rules after the 'where' keyword (see above), rather
2719 than before the actual inductive definition.
2721 - The variables in induction and elimination rules are now
2722 quantified in the order of their occurrence in the introduction
2723 rules, rather than in alphabetical order. Since this may break
2724 some proofs, these proofs either have to be repaired, e.g. by
2725 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
2726 statements of the form
2728 case (rule_i a_i_1 ... a_i_{k_i})
2730 or the old order of quantification has to be restored by explicitly adding
2731 meta-level quantifiers in the introduction rules, i.e.
2733 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
2735 - The format of the elimination rules is now
2737 p z_1 ... z_m x_1 ... x_n ==>
2738 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2743 (x_1, ..., x_n) : s z_1 ... z_m ==>
2744 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2747 for sets rather than
2749 x : s z_1 ... z_m ==>
2750 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
2753 This may require terms in goals to be expanded to n-tuples
2754 (e.g. using case_tac or simplification with the split_paired_all
2755 rule) before the above elimination rule is applicable.
2757 - The elimination or case analysis rules for (mutually) inductive
2758 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
2759 list of rules "p_1_..._p_k.elims" is no longer available.
2761 * New package "function"/"fun" for general recursive functions,
2762 supporting mutual and nested recursion, definitions in local contexts,
2763 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
2764 for small examples, and the separate tutorial on the function
2765 package. The old recdef "package" is still available as before, but
2766 users are encouraged to use the new package.
2768 * Method "lexicographic_order" automatically synthesizes termination
2769 relations as lexicographic combinations of size measures.
2771 * Case-expressions allow arbitrary constructor-patterns (including
2772 "_") and take their order into account, like in functional
2773 programming. Internally, this is translated into nested
2774 case-expressions; missing cases are added and mapped to the predefined
2775 constant "undefined". In complicated cases printing may no longer show
2776 the original input but the internal form. Lambda-abstractions allow
2777 the same form of pattern matching: "% pat1 => e1 | ..." is an
2778 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
2781 * IntDef: The constant "int :: nat => int" has been removed; now "int"
2782 is an abbreviation for "of_nat :: nat => int". The simplification
2783 rules for "of_nat" have been changed to work like "int" did
2784 previously. Potential INCOMPATIBILITY:
2785 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
2786 - of_nat_diff and of_nat_mult are no longer default simp rules
2788 * Method "algebra" solves polynomial equations over (semi)rings using
2789 Groebner bases. The (semi)ring structure is defined by locales and the
2790 tool setup depends on that generic context. Installing the method for
2791 a specific type involves instantiating the locale and possibly adding
2792 declarations for computation on the coefficients. The method is
2793 already instantiated for natural numbers and for the axiomatic class
2794 of idoms with numerals. See also the paper by Chaieb and Wenzel at
2795 CALCULEMUS 2007 for the general principles underlying this
2796 architecture of context-aware proof-tools.
2798 * Method "ferrack" implements quantifier elimination over
2799 special-purpose dense linear orders using locales (analogous to
2800 "algebra"). The method is already installed for class
2801 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
2804 * Former constant "List.op @" now named "List.append". Use ML
2805 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
2806 circumvent possible incompatibilities when working on ML level.
2808 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
2810 * New function listsum :: 'a list => 'a for arbitrary monoids.
2811 Special syntax: "SUM x <- xs. f x" (and latex variants)
2813 * New syntax for Haskell-like list comprehension (input only), eg.
2814 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
2816 * The special syntax for function "filter" has changed from [x :
2817 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
2818 comprehension syntax, and for uniformity. INCOMPATIBILITY.
2820 * [a..b] is now defined for arbitrary linear orders. It used to be
2821 defined on nat only, as an abbreviation for [a..<Suc b]
2824 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
2826 * New functions "sorted" and "sort" in src/HOL/List.thy.
2828 * New lemma collection field_simps (an extension of ring_simps) for
2829 manipulating (in)equations involving division. Multiplies with all
2830 denominators that can be proved to be non-zero (in equations) or
2831 positive/negative (in inequations).
2833 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
2834 have been improved and renamed to ring_simps, group_simps and
2835 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
2836 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
2838 * Theory Library/Commutative_Ring: switched from recdef to function
2839 package; constants add, mul, pow now curried. Infix syntax for
2840 algebraic operations.
2842 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
2845 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
2848 * HOL/records: generalised field-update to take a function on the
2849 field rather than the new value: r(|A := x|) is translated to A_update
2850 (K x) r The K-combinator that is internally used is called K_record.
2851 INCOMPATIBILITY: Usage of the plain update functions has to be
2854 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
2855 * x = 0, which are required for a semiring. Richer structures do not
2856 inherit from semiring_0 anymore, because this property is a theorem
2857 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
2858 there is more to prove, but this is mostly trivial.
2860 * Class "recpower" is generalized to arbitrary monoids, not just
2861 commutative semirings. INCOMPATIBILITY: may need to incorporate
2862 commutativity or semiring properties additionally.
2864 * Constant "List.list_all2" in List.thy now uses authentic syntax.
2865 INCOMPATIBILITY: translations containing list_all2 may go wrong,
2866 better use 'abbreviation'.
2868 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
2870 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
2871 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
2872 significant changes for setting up numeral syntax for types:
2873 - New constants Numeral.pred and Numeral.succ instead
2874 of former Numeral.bin_pred and Numeral.bin_succ.
2875 - Use integer operations instead of bin_add, bin_mult and so on.
2876 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
2877 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
2879 See src/HOL/Integ/IntArith.thy for an example setup.
2881 * Command 'normal_form' computes the normal form of a term that may
2882 contain free variables. For example ``normal_form "rev [a, b, c]"''
2883 produces ``[b, c, a]'' (without proof). This command is suitable for
2884 heavy-duty computations because the functions are compiled to ML
2885 first. Correspondingly, a method "normalization" is provided. See
2886 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
2888 * Alternative iff syntax "A <-> B" for equality on bool (with priority
2889 25 like -->); output depends on the "iff" print_mode, the default is
2890 "A = B" (with priority 50).
2892 * Relations less (<) and less_eq (<=) are also available on type bool.
2893 Modified syntax to disallow nesting without explicit parentheses,
2894 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
2897 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
2899 * Relation composition operator "op O" now has precedence 75 and binds
2900 stronger than union and intersection. INCOMPATIBILITY.
2902 * The old set interval syntax "{m..n(}" (and relatives) has been
2903 removed. Use "{m..<n}" (and relatives) instead.
2905 * In the context of the assumption "~(s = t)" the Simplifier rewrites
2906 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
2907 ``declare [[simproc del: neq]]''.
2909 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
2912 * Theorem Cons_eq_map_conv no longer declared as "simp".
2914 * Theorem setsum_mult renamed to setsum_right_distrib.
2916 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
2919 * Reimplemented methods "sat" and "satx", with several improvements:
2920 goals no longer need to be stated as "<prems> ==> False", equivalences
2921 (i.e. "=" on type bool) are handled, variable names of the form
2922 "lit_<n>" are no longer reserved, significant speedup.
2924 * Methods "sat" and "satx" can now replay MiniSat proof traces.
2925 zChaff is still supported as well.
2927 * 'inductive' and 'datatype': provide projections of mutual rules,
2928 bundled as foo_bar.inducts;
2930 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
2933 * Library: moved theory Accessible_Part to main HOL.
2935 * Library: added theory Coinductive_List of potentially infinite lists
2936 as greatest fixed-point.
2938 * Library: added theory AssocList which implements (finite) maps as
2941 * Method "evaluation" solves goals (i.e. a boolean expression)
2942 efficiently by compiling it to ML. The goal is "proved" (via an
2943 oracle) if it evaluates to True.
2945 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
2946 also when invoked by the simplifier. This results in the Simplifier
2947 being more powerful on arithmetic goals. INCOMPATIBILITY.
2948 Configuration option fast_arith_split_limit=0 recovers the old
2951 * Support for hex (0x20) and binary (0b1001) numerals.
2953 * New method: reify eqs (t), where eqs are equations for an
2954 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
2955 parameter, computes a term s::'b and a list xs::'a list and proves the
2956 theorem I xs s = t. This is also known as reification or quoting. The
2957 resulting theorem is applied to the subgoal to substitute t with I xs
2958 s. If t is omitted, the subgoal itself is reified.
2960 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
2961 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
2962 where f is supposed to be a computable function (in the sense of code
2963 generattion). The method uses reify to compute s and xs as above then
2964 applies corr_thm and uses normalization by evaluation to "prove" f s =
2965 r and finally gets the theorem t = r, which is again applied to the
2966 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
2968 * Reflection: Automatic reification now handels binding, an example is
2969 available in src/HOL/ex/ReflectionEx.thy
2971 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
2972 command 'statespace' that is similar to 'record', but introduces an
2973 abstract specification based on the locale infrastructure instead of
2974 HOL types. This leads to extra flexibility in composing state spaces,
2975 in particular multiple inheritance and renaming of components.
2980 * Hyperreal: Functions root and sqrt are now defined on negative real
2981 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
2982 Nonnegativity side conditions have been removed from many lemmas, so
2983 that more subgoals may now be solved by simplification; potential
2986 * Real: new type classes formalize real normed vector spaces and
2987 algebras, using new overloaded constants scaleR :: real => 'a => 'a
2988 and norm :: 'a => real.
2990 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
2991 reals into other types. The overloaded constant Reals :: 'a set is now
2992 defined as range of_real; potential INCOMPATIBILITY.
2994 * Real: proper support for ML code generation, including 'quickcheck'.
2995 Reals are implemented as arbitrary precision rationals.
2997 * Hyperreal: Several constants that previously worked only for the
2998 reals have been generalized, so they now work over arbitrary vector
2999 spaces. Type annotations may need to be added in some cases; potential
3002 Infinitesimal :: ('a::real_normed_vector) star set
3003 HFinite :: ('a::real_normed_vector) star set
3004 HInfinite :: ('a::real_normed_vector) star set
3005 approx :: ('a::real_normed_vector) star => 'a star => bool
3006 monad :: ('a::real_normed_vector) star => 'a star set
3007 galaxy :: ('a::real_normed_vector) star => 'a star set
3008 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3009 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3010 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3011 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3012 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3013 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3014 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3015 sgn :: 'a::real_normed_vector => 'a
3016 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3018 * Complex: Some complex-specific constants are now abbreviations for
3019 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3020 hnorm. Other constants have been entirely removed in favor of the
3021 polymorphic versions (INCOMPATIBILITY):
3025 HInfinite <-- CInfinite
3026 Infinitesimal <-- CInfinitesimal
3029 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3030 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3031 (ns)deriv <-- (ns)cderiv
3036 * Formalisation of ideals and the quotient construction over rings.
3038 * Order and lattice theory no longer based on records.
3041 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3042 greatest_closed. INCOMPATIBILITY.
3044 * Method algebra is now set up via an attribute. For examples see
3045 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3046 of algebraic structures.
3048 * Renamed theory CRing to Ring.
3053 * Substantial, yet incomplete support for nominal datatypes (binding
3054 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3055 src/HOL/Nominal/Examples. Prospective users should consult
3056 http://isabelle.in.tum.de/nominal/
3061 * ML basics: just one true type int, which coincides with IntInf.int
3064 * ML within Isar: antiquotations allow to embed statically-checked
3065 formal entities in the source, referring to the context available at
3066 compile-time. For example:
3068 ML {* @{sort "{zero,one}"} *}
3069 ML {* @{typ "'a => 'b"} *}
3070 ML {* @{term "%x. x"} *}
3071 ML {* @{prop "x == y"} *}
3072 ML {* @{ctyp "'a => 'b"} *}
3073 ML {* @{cterm "%x. x"} *}
3074 ML {* @{cprop "x == y"} *}
3075 ML {* @{thm asm_rl} *}
3076 ML {* @{thms asm_rl} *}
3077 ML {* @{type_name c} *}
3078 ML {* @{type_syntax c} *}
3079 ML {* @{const_name c} *}
3080 ML {* @{const_syntax c} *}
3083 ML {* @{theory Pure} *}
3084 ML {* @{theory_ref} *}
3085 ML {* @{theory_ref Pure} *}
3088 ML {* @{clasimpset} *}
3090 The same works for sources being ``used'' within an Isar context.
3092 * ML in Isar: improved error reporting; extra verbosity with
3093 ML_Context.trace enabled.
3095 * Pure/General/table.ML: the join operations now works via exceptions
3096 DUP/SAME instead of type option. This is simpler in simple cases, and
3097 admits slightly more efficient complex applications.
3099 * Pure: 'advanced' translation functions (parse_translation etc.) now
3100 use Context.generic instead of just theory.
3102 * Pure: datatype Context.generic joins theory/Proof.context and
3103 provides some facilities for code that works in either kind of
3104 context, notably GenericDataFun for uniform theory and proof data.
3106 * Pure: simplified internal attribute type, which is now always
3107 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3108 local (Proof.context) attributes have been discontinued, while
3109 minimizing code duplication. Thm.rule_attribute and
3110 Thm.declaration_attribute build canonical attributes; see also structure
3111 Context for further operations on Context.generic, notably
3112 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3113 declarations and definitions.
3115 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3116 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3117 init only required for impure data. INCOMPATIBILITY: empty really need
3118 to be empty (no dependencies on theory content!)
3120 * Pure/kernel: consts certification ignores sort constraints given in
3121 signature declarations. (This information is not relevant to the
3122 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3123 potential INCOMPATIBILITY.
3125 * Pure: axiomatic type classes are now purely definitional, with
3126 explicit proofs of class axioms and super class relations performed
3127 internally. See Pure/axclass.ML for the main internal interfaces --
3128 notably AxClass.define_class supercedes AxClass.add_axclass, and
3129 AxClass.axiomatize_class/classrel/arity supersede
3130 Sign.add_classes/classrel/arities.
3132 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3133 global/local versions on theory vs. Proof.context have been
3134 discontinued; Attrib.syntax and Method.syntax have been adapted
3135 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3136 attributes, methods, etc.
3138 * Pure: several functions of signature "... -> theory -> theory * ..."
3139 have been reoriented to "... -> theory -> ... * theory" in order to
3140 allow natural usage in combination with the ||>, ||>>, |-> and
3141 fold_map combinators.
3143 * Pure: official theorem names (closed derivations) and additional
3144 comments (tags) are now strictly separate. Name hints -- which are
3145 maintained as tags -- may be attached any time without affecting the
3148 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3149 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3150 achieve the old behaviour.
3152 * Pure: the "Goal" constant is now called "prop", supporting a
3153 slightly more general idea of ``protecting'' meta-level rule
3156 * Pure: Logic.(un)varify only works in a global context, which is now
3157 enforced instead of silently assumed. INCOMPATIBILITY, may use
3158 Logic.legacy_(un)varify as temporary workaround.
3160 * Pure: structure Name provides scalable operations for generating
3161 internal variable names, notably Name.variants etc. This replaces
3162 some popular functions from term.ML:
3164 Term.variant -> Name.variant
3165 Term.variantlist -> Name.variant_list
3166 Term.invent_names -> Name.invent_list
3168 Note that low-level renaming rarely occurs in new code -- operations
3169 from structure Variable are used instead (see below).
3171 * Pure: structure Variable provides fundamental operations for proper
3172 treatment of fixed/schematic variables in a context. For example,
3173 Variable.import introduces fixes for schematics of given facts and
3174 Variable.export reverses the effect (up to renaming) -- this replaces
3175 various freeze_thaw operations.
3177 * Pure: structure Goal provides simple interfaces for
3178 init/conclude/finish and tactical prove operations (replacing former
3179 Tactic.prove). Goal.prove is the canonical way to prove results
3180 within a given context; Goal.prove_global is a degraded version for
3181 theory level goals, including a global Drule.standard. Note that
3182 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3183 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3184 in a locale context).
3186 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3187 and type checking (Syntax.check_term etc.), with common combinations
3188 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3189 which are considered legacy and await removal.
3191 * Pure/Syntax: generic interfaces for type unchecking
3192 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3193 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3194 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3195 available for convenience, but refer to the very same operations using
3196 a mere theory instead of a full context.
3198 * Isar: simplified treatment of user-level errors, using exception
3199 ERROR of string uniformly. Function error now merely raises ERROR,
3200 without any side effect on output channels. The Isar toplevel takes
3201 care of proper display of ERROR exceptions. ML code may use plain
3202 handle/can/try; cat_error may be used to concatenate errors like this:
3204 ... handle ERROR msg => cat_error msg "..."
3206 Toplevel ML code (run directly or through the Isar toplevel) may be
3207 embedded into the Isar toplevel with exception display/debug like
3210 Isar.toplevel (fn () => ...)
3212 INCOMPATIBILITY, removed special transform_error facilities, removed
3213 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3214 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3215 -- use plain ERROR instead.
3217 * Isar: theory setup now has type (theory -> theory), instead of a
3218 list. INCOMPATIBILITY, may use #> to compose setup functions.
3220 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3221 ProofContext.debug/verbose flags.
3223 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3224 theory before entering a proof state. Transactions now always see a
3225 quasi-functional intermediate checkpoint, both in interactive and
3228 * Isar: simplified interfaces for outer syntax. Renamed
3229 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3230 OuterSyntax.add_parsers -- this functionality is now included in
3231 OuterSyntax.command etc. INCOMPATIBILITY.
3233 * Simplifier: the simpset of a running simplification process now
3234 contains a proof context (cf. Simplifier.the_context), which is the
3235 very context that the initial simpset has been retrieved from (by
3236 simpset_of/local_simpset_of). Consequently, all plug-in components
3237 (solver, looper etc.) may depend on arbitrary proof data.
3239 * Simplifier.inherit_context inherits the proof context (plus the
3240 local bounds) of the current simplification process; any simproc
3241 etc. that calls the Simplifier recursively should do this! Removed
3242 former Simplifier.inherit_bounds, which is already included here --
3243 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3244 specify an explicit context using Simplifier.context/theory_context.
3246 * Simplifier/Classical Reasoner: more abstract interfaces
3247 change_simpset/claset for modifying the simpset/claset reference of a
3248 theory; raw versions simpset/claset_ref etc. have been discontinued --
3251 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3257 * settings: the default heap location within ISABELLE_HOME_USER now
3258 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3259 Isabelle installations.
3261 * isabelle-process: option -S (secure mode) disables some critical
3262 operations, notably runtime compilation and evaluation of ML source
3265 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3267 * Support for parallel execution, using native multicore support of
3268 Poly/ML 5.1. The theory loader exploits parallelism when processing
3269 independent theories, according to the given theory header
3270 specifications. The maximum number of worker threads is specified via
3271 usedir option -M or the "max-threads" setting in Proof General. A
3272 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3273 to 6 on a 8-core machine. User-code needs to observe certain
3274 guidelines for thread-safe programming, see appendix A in the Isar
3275 Implementation manual.
3279 New in Isabelle2005 (October 2005)
3280 ----------------------------------
3284 * Theory headers: the new header syntax for Isar theories is
3287 imports <theory1> ... <theoryN>
3288 uses <file1> ... <fileM>
3291 where the 'uses' part is optional. The previous syntax
3293 theory <name> = <theory1> + ... + <theoryN>:
3295 will disappear in the next release. Use isatool fixheaders to convert
3296 existing theory files. Note that there is no change in ancient
3297 non-Isar theories now, but these will disappear soon.
3299 * Theory loader: parent theories can now also be referred to via
3300 relative and absolute paths.
3302 * Command 'find_theorems' searches for a list of criteria instead of a
3303 list of constants. Known criteria are: intro, elim, dest, name:string,
3304 simp:term, and any term. Criteria can be preceded by '-' to select
3305 theorems that do not match. Intro, elim, dest select theorems that
3306 match the current goal, name:s selects theorems whose fully qualified
3307 name contain s, and simp:term selects all simplification rules whose
3308 lhs match term. Any other term is interpreted as pattern and selects
3309 all theorems matching the pattern. Available in ProofGeneral under
3310 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3312 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3314 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3315 matching the current goal as introduction rule and not having "HOL."
3316 in their name (i.e. not being defined in theory HOL).
3318 * Command 'thms_containing' has been discontinued in favour of
3319 'find_theorems'; INCOMPATIBILITY.
3321 * Communication with Proof General is now 8bit clean, which means that
3322 Unicode text in UTF-8 encoding may be used within theory texts (both
3323 formal and informal parts). Cf. option -U of the Isabelle Proof
3324 General interface. Here are some simple examples (cf. src/HOL/ex):
3326 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3327 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3329 * Improved efficiency of the Simplifier and, to a lesser degree, the
3330 Classical Reasoner. Typical big applications run around 2 times
3334 *** Document preparation ***
3336 * Commands 'display_drafts' and 'print_drafts' perform simple output
3337 of raw sources. Only those symbols that do not require additional
3338 LaTeX packages (depending on comments in isabellesym.sty) are
3339 displayed properly, everything else is left verbatim. isatool display
3340 and isatool print are used as front ends (these are subject to the
3341 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3343 * Command tags control specific markup of certain regions of text,
3344 notably folding and hiding. Predefined tags include "theory" (for
3345 theory begin and end), "proof" for proof commands, and "ML" for
3346 commands involving ML code; the additional tags "visible" and
3347 "invisible" are unused by default. Users may give explicit tag
3348 specifications in the text, e.g. ''by %invisible (auto)''. The
3349 interpretation of tags is determined by the LaTeX job during document
3350 preparation: see option -V of isatool usedir, or options -n and -t of
3351 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3354 Several document versions may be produced at the same time via isatool
3355 usedir (the generated index.html will link all of them). Typical
3356 specifications include ''-V document=theory,proof,ML'' to present
3357 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3358 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3359 these parts without any formal replacement text. The Isabelle site
3360 default settings produce ''document'' and ''outline'' versions as
3363 * Several new antiquotations:
3365 @{term_type term} prints a term with its type annotated;
3367 @{typeof term} prints the type of a term;
3369 @{const const} is the same as @{term const}, but checks that the
3370 argument is a known logical constant;
3372 @{term_style style term} and @{thm_style style thm} print a term or
3373 theorem applying a "style" to it
3377 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3378 definitions, equations, inequations etc., 'concl' printing only the
3379 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3380 to print the specified premise. TermStyle.add_style provides an ML
3381 interface for introducing further styles. See also the "LaTeX Sugar"
3382 document practical applications. The ML antiquotation prints
3383 type-checked ML expressions verbatim.
3385 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3386 and 'text' support optional locale specification '(in loc)', which
3387 specifies the default context for interpreting antiquotations. For
3388 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3390 * Option 'locale=NAME' of antiquotations specifies an alternative
3391 context interpreting the subsequent argument. For example: @{thm
3392 [locale=lattice] inf_assoc}.
3394 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3397 * Proper output of antiquotations for theory commands involving a
3398 proof context (such as 'locale' or 'theorem (in loc) ...').
3400 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3401 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3403 * isatool usedir: new option -C (default true) controls whether option
3404 -D should include a copy of the original document directory; -C false
3405 prevents unwanted effects such as copying of administrative CVS data.
3410 * Considerably improved version of 'constdefs' command. Now performs
3411 automatic type-inference of declared constants; additional support for
3412 local structure declarations (cf. locales and HOL records), see also
3413 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3414 sequential dependencies of definitions within a single 'constdefs'
3415 section; moreover, the declared name needs to be an identifier. If
3416 all fails, consider to fall back on 'consts' and 'defs' separately.
3418 * Improved indexed syntax and implicit structures. First of all,
3419 indexed syntax provides a notational device for subscripted
3420 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3421 expressions. Secondly, in a local context with structure
3422 declarations, number indexes \<^sub>n or the empty index (default
3423 number 1) refer to a certain fixed variable implicitly; option
3424 show_structs controls printing of implicit structures. Typical
3425 applications of these concepts involve record types and locales.
3427 * New command 'no_syntax' removes grammar declarations (and
3428 translations) resulting from the given syntax specification, which is
3429 interpreted in the same manner as for the 'syntax' command.
3431 * 'Advanced' translation functions (parse_translation etc.) may depend
3432 on the signature of the theory context being presently used for
3433 parsing/printing, see also isar-ref manual.
3435 * Improved 'oracle' command provides a type-safe interface to turn an
3436 ML expression of type theory -> T -> term into a primitive rule of
3437 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3438 is already included here); see also FOL/ex/IffExample.thy;
3441 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3442 before); "cI" is no longer bound, use "c.intro" instead.
3443 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3444 axclasses vs. locales.
3446 * Improved internal renaming of symbolic identifiers -- attach primes
3447 instead of base 26 numbers.
3449 * New flag show_question_marks controls printing of leading question
3450 marks in schematic variable names.
3452 * In schematic variable names, *any* symbol following \<^isub> or
3453 \<^isup> is now treated as part of the base name. For example, the
3454 following works without printing of awkward ".0" indexes:
3456 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3459 * Inner syntax includes (*(*nested*) comments*).
3461 * Pretty printer now supports unbreakable blocks, specified in mixfix
3462 annotations as "(00...)".
3464 * Clear separation of logical types and nonterminals, where the latter
3465 may only occur in 'syntax' specifications or type abbreviations.
3466 Before that distinction was only partially implemented via type class
3467 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3468 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3469 exotic syntax specifications may require further adaption
3470 (e.g. Cube/Cube.thy).
3472 * Removed obsolete type class "logic", use the top sort {} instead.
3473 Note that non-logical types should be declared as 'nonterminals'
3474 rather than 'types'. INCOMPATIBILITY for new object-logic
3477 * Attributes 'induct' and 'cases': type or set names may now be
3478 locally fixed variables as well.
3480 * Simplifier: can now control the depth to which conditional rewriting
3481 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3484 * Simplifier: simplification procedures may now take the current
3485 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3486 interface), which is very useful for calling the Simplifier
3487 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3488 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3489 low-level mk_simproc no longer applies Logic.varify internally, to
3490 allow for use in a context of fixed variables.
3492 * thin_tac now works even if the assumption being deleted contains !!
3493 or ==>. More generally, erule now works even if the major premise of
3494 the elimination rule contains !! or ==>.
3496 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3498 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3499 from Pure, which contains all common declarations already. Both
3500 theories are defined via plain Isabelle/Isar .thy files.
3501 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3502 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3503 use isatool fixcpure to adapt your theory and ML sources.
3505 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3506 selections of theorems in named facts via index ranges.
3508 * 'print_theorems': in theory mode, really print the difference
3509 wrt. the last state (works for interactive theory development only),
3510 in proof mode print all local facts (cf. 'print_facts');
3512 * 'hide': option '(open)' hides only base names.
3514 * More efficient treatment of intermediate checkpoints in interactive
3517 * Code generator is now invoked via code_module (incremental code
3518 generation) and code_library (modular code generation, ML structures
3519 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3520 must be quoted when used as identifiers.
3522 * New 'value' command for reading, evaluating and printing terms using
3523 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3524 quoted when used as identifier.
3529 * New commands for the interpretation of locale expressions in
3530 theories (1), locales (2) and proof contexts (3). These generate
3531 proof obligations from the expression specification. After the
3532 obligations have been discharged, theorems of the expression are added
3533 to the theory, target locale or proof context. The synopsis of the
3534 commands is a follows:
3536 (1) interpretation expr inst
3537 (2) interpretation target < expr
3538 (3) interpret expr inst
3540 Interpretation in theories and proof contexts require a parameter
3541 instantiation of terms from the current context. This is applied to
3542 specifications and theorems of the interpreted expression.
3543 Interpretation in locales only permits parameter renaming through the
3544 locale expression. Interpretation is smart in that interpretations
3545 that are active already do not occur in proof obligations, neither are
3546 instantiated theorems stored in duplicate. Use 'print_interps' to
3547 inspect active interpretations of a particular locale. For details,
3548 see the Isar Reference manual. Examples can be found in
3549 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3551 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3552 'interpret' instead.
3554 * New context element 'constrains' for adding type constraints to
3557 * Context expressions: renaming of parameters with syntax
3560 * Locale declaration: 'includes' disallowed.
3562 * Proper static binding of attribute syntax -- i.e. types / terms /
3563 facts mentioned as arguments are always those of the locale definition
3564 context, independently of the context of later invocations. Moreover,
3565 locale operations (renaming and type / term instantiation) are applied
3566 to attribute arguments as expected.
3568 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3569 actual attributes; rare situations may require Attrib.attribute to
3570 embed those attributes into Attrib.src that lack concrete syntax.
3571 Attribute implementations need to cooperate properly with the static
3572 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3573 Attrib.XXX_thm etc. already do the right thing without further
3574 intervention. Only unusual applications -- such as "where" or "of"
3575 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3576 on the context and the facts involved -- may have to assign parsed
3577 values to argument tokens explicitly.
3579 * Changed parameter management in theorem generation for long goal
3580 statements with 'includes'. INCOMPATIBILITY: produces a different
3581 theorem statement in rare situations.
3583 * Locale inspection command 'print_locale' omits notes elements. Use
3584 'print_locale!' to have them included in the output.
3589 * Provers/hypsubst.ML: improved version of the subst method, for
3590 single-step rewriting: it now works in bound variable contexts. New is
3591 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3592 rewrite a different subterm than the original subst method, which is
3593 still available as 'simplesubst'.
3595 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3598 * Provers/trancl.ML: new transitivity reasoner for transitive and
3599 reflexive-transitive closure of relations.
3601 * Provers/blast.ML: new reference depth_limit to make blast's depth
3602 limit (previously hard-coded with a value of 20) user-definable.
3604 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3605 is peformed already. Object-logics merely need to finish their
3606 initial simpset configuration as before. INCOMPATIBILITY.
3611 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3614 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3616 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3617 and x-symbol; use option '-m epsilon' to get it actually printed.
3618 Moreover, the mathematically important symbolic identifier \<epsilon>
3619 becomes available as variable, constant etc. INCOMPATIBILITY,
3621 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3622 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3623 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3624 support corresponding Isar calculations.
3626 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3629 * theory SetInterval: changed the syntax for open intervals:
3638 The old syntax is still supported but will disappear in the next
3639 release. For conversion use the following Emacs search and replace
3640 patterns (these are not perfect but work quite well):
3642 {)\([^\.]*\)\.\. -> {\1<\.\.}
3643 \.\.\([^(}]*\)(} -> \.\.<\1}
3645 * Theory Commutative_Ring (in Library): method comm_ring for proving
3646 equalities in commutative rings; method 'algebra' provides a generic
3649 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3650 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3651 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3654 Some new syntax forms are available:
3656 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3657 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3658 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3659 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3661 The latter form "\<Sum>x < k. e" used to be based on a separate
3662 function "Summation", which has been discontinued.
3664 * theory Finite_Set: in structured induction proofs, the insert case
3665 is now 'case (insert x F)' instead of the old counterintuitive 'case
3668 * The 'refute' command has been extended to support a much larger
3669 fragment of HOL, including axiomatic type classes, constdefs and
3670 typedefs, inductive datatypes and recursion.
3672 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3673 Requires zChaff with proof generation to be installed. See
3674 HOL/ex/SAT_Examples.thy for examples.
3676 * Datatype induction via method 'induct' now preserves the name of the
3677 induction variable. For example, when proving P(xs::'a list) by
3678 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3679 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3680 in unstructured proof scripts.
3682 * Reworked implementation of records. Improved scalability for
3683 records with many fields, avoiding performance problems for type
3684 inference. Records are no longer composed of nested field types, but
3685 of nested extension types. Therefore the record type only grows linear
3686 in the number of extensions and not in the number of fields. The
3687 top-level (users) view on records is preserved. Potential
3688 INCOMPATIBILITY only in strange cases, where the theory depends on the
3689 old record representation. The type generated for a record is called
3690 <record_name>_ext_type.
3692 Flag record_quick_and_dirty_sensitive can be enabled to skip the
3693 proofs triggered by a record definition or a simproc (if
3694 quick_and_dirty is enabled). Definitions of large records can take
3697 New simproc record_upd_simproc for simplification of multiple record
3698 updates enabled by default. Moreover, trivial updates are also
3699 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
3700 occasionally, since simplification is more powerful by default.
3702 * typedef: proper support for polymorphic sets, which contain extra
3703 type-variables in the term.
3705 * Simplifier: automatically reasons about transitivity chains
3706 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
3707 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
3708 old proofs break occasionally as simplification may now solve more
3709 goals than previously.
3711 * Simplifier: converts x <= y into x = y if assumption y <= x is
3712 present. Works for all partial orders (class "order"), in particular
3713 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
3716 * Simplifier: new simproc for "let x = a in f x". If a is a free or
3717 bound variable or a constant then the let is unfolded. Otherwise
3718 first a is simplified to b, and then f b is simplified to g. If
3719 possible we abstract b from g arriving at "let x = b in h x",
3720 otherwise we unfold the let and arrive at g. The simproc can be
3721 enabled/disabled by the reference use_let_simproc. Potential
3722 INCOMPATIBILITY since simplification is more powerful by default.
3724 * Classical reasoning: the meson method now accepts theorems as arguments.
3726 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
3727 jobs to provide advice on the provability of subgoals.
3729 * Theory OrderedGroup and Ring_and_Field: various additions and
3730 improvements to faciliate calculations involving equalities and
3733 The following theorems have been eliminated or modified
3736 abs_eq now named abs_of_nonneg
3737 abs_of_ge_0 now named abs_of_nonneg
3738 abs_minus_eq now named abs_of_nonpos
3739 imp_abs_id now named abs_of_nonneg
3740 imp_abs_neg_id now named abs_of_nonpos
3741 mult_pos now named mult_pos_pos
3742 mult_pos_le now named mult_nonneg_nonneg
3743 mult_pos_neg_le now named mult_nonneg_nonpos
3744 mult_pos_neg2_le now named mult_nonneg_nonpos2
3745 mult_neg now named mult_neg_neg
3746 mult_neg_le now named mult_nonpos_nonpos
3748 * The following lemmas in Ring_and_Field have been added to the simplifier:
3751 not_square_less_zero
3753 The following lemmas have been deleted from Real/RealPow:
3763 * Theory Parity: added rules for simplifying exponents.
3767 The following theorems have been eliminated or modified
3770 list_all_Nil now named list_all.simps(1)
3771 list_all_Cons now named list_all.simps(2)
3772 list_all_conv now named list_all_iff
3773 set_mem_eq now named mem_iff
3775 * Theories SetsAndFunctions and BigO (see HOL/Library) support
3776 asymptotic "big O" calculations. See the notes in BigO.thy.
3781 * Theory RealDef: better support for embedding natural numbers and
3782 integers in the reals.
3784 The following theorems have been eliminated or modified
3787 exp_ge_add_one_self now requires no hypotheses
3788 real_of_int_add reversed direction of equality (use [symmetric])
3789 real_of_int_minus reversed direction of equality (use [symmetric])
3790 real_of_int_diff reversed direction of equality (use [symmetric])
3791 real_of_int_mult reversed direction of equality (use [symmetric])
3793 * Theory RComplete: expanded support for floor and ceiling functions.
3795 * Theory Ln is new, with properties of the natural logarithm
3797 * Hyperreal: There is a new type constructor "star" for making
3798 nonstandard types. The old type names are now type synonyms:
3802 hcomplex = complex star
3804 * Hyperreal: Many groups of similarly-defined constants have been
3805 replaced by polymorphic versions (INCOMPATIBILITY):
3807 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
3809 starset <-- starsetNat, starsetC
3810 *s* <-- *sNat*, *sc*
3811 starset_n <-- starsetNat_n, starsetC_n
3812 *sn* <-- *sNatn*, *scn*
3813 InternalSets <-- InternalNatSets, InternalCSets
3815 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3816 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
3817 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
3818 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
3819 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
3821 * Hyperreal: Many type-specific theorems have been removed in favor of
3822 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
3824 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
3825 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
3826 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
3827 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
3828 right_minus <-- hypreal_add_minus
3829 left_minus <-- {hypreal,hcomplex}_add_minus_left
3830 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
3831 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
3832 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
3833 mult_1_right <-- hcomplex_mult_one_right
3834 mult_zero_left <-- hcomplex_mult_zero_left
3835 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
3836 right_distrib <-- hypnat_add_mult_distrib2
3837 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
3838 right_inverse <-- hypreal_mult_inverse
3839 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
3840 order_refl <-- {hypreal,hypnat}_le_refl
3841 order_trans <-- {hypreal,hypnat}_le_trans
3842 order_antisym <-- {hypreal,hypnat}_le_anti_sym
3843 order_less_le <-- {hypreal,hypnat}_less_le
3844 linorder_linear <-- {hypreal,hypnat}_le_linear
3845 add_left_mono <-- {hypreal,hypnat}_add_left_mono
3846 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
3847 add_nonneg_nonneg <-- hypreal_le_add_order
3849 * Hyperreal: Separate theorems having to do with type-specific
3850 versions of constants have been merged into theorems that apply to the
3851 new polymorphic constants (INCOMPATIBILITY):
3853 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
3854 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
3855 STAR_Un <-- {STAR,NatStar,STARC}_Un
3856 STAR_Int <-- {STAR,NatStar,STARC}_Int
3857 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
3858 STAR_subset <-- {STAR,NatStar,STARC}_subset
3859 STAR_mem <-- {STAR,NatStar,STARC}_mem
3860 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
3861 STAR_diff <-- {STAR,STARC}_diff
3862 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
3863 STARC_hcomplex_of_complex}_image_subset
3864 starset_n_Un <-- starset{Nat,C}_n_Un
3865 starset_n_Int <-- starset{Nat,C}_n_Int
3866 starset_n_Compl <-- starset{Nat,C}_n_Compl
3867 starset_n_diff <-- starset{Nat,C}_n_diff
3868 InternalSets_Un <-- Internal{Nat,C}Sets_Un
3869 InternalSets_Int <-- Internal{Nat,C}Sets_Int
3870 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
3871 InternalSets_diff <-- Internal{Nat,C}Sets_diff
3872 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
3873 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
3874 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
3875 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
3876 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
3877 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3878 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
3879 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
3880 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
3881 starfun_diff <-- starfun{C,RC,CR}_diff
3882 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
3883 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
3884 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
3885 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
3886 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
3887 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
3888 starfun_Id <-- starfunC_Id
3889 starfun_approx <-- starfun{Nat,CR}_approx
3890 starfun_capprox <-- starfun{C,RC}_capprox
3891 starfun_abs <-- starfunNat_rabs
3892 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
3893 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
3894 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
3895 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
3896 starfun_add_capprox <-- starfun{C,RC}_add_capprox
3897 starfun_add_approx <-- starfunCR_add_approx
3898 starfun_inverse_inverse <-- starfunC_inverse_inverse
3899 starfun_divide <-- starfun{C,CR,RC}_divide
3900 starfun_n <-- starfun{Nat,C}_n
3901 starfun_n_mult <-- starfun{Nat,C}_n_mult
3902 starfun_n_add <-- starfun{Nat,C}_n_add
3903 starfun_n_add_minus <-- starfunNat_n_add_minus
3904 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
3905 starfun_n_minus <-- starfun{Nat,C}_n_minus
3906 starfun_n_eq <-- starfun{Nat,C}_n_eq
3908 star_n_add <-- {hypreal,hypnat,hcomplex}_add
3909 star_n_minus <-- {hypreal,hcomplex}_minus
3910 star_n_diff <-- {hypreal,hcomplex}_diff
3911 star_n_mult <-- {hypreal,hcomplex}_mult
3912 star_n_inverse <-- {hypreal,hcomplex}_inverse
3913 star_n_le <-- {hypreal,hypnat}_le
3914 star_n_less <-- {hypreal,hypnat}_less
3915 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
3916 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
3917 star_n_abs <-- hypreal_hrabs
3918 star_n_divide <-- hcomplex_divide
3920 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
3921 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
3922 star_of_diff <-- hypreal_of_real_diff
3923 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
3924 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
3925 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
3926 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
3927 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
3928 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
3929 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
3930 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
3931 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
3932 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
3933 star_of_number_of <-- {hypreal,hcomplex}_number_of
3934 star_of_number_less <-- number_of_less_hypreal_of_real_iff
3935 star_of_number_le <-- number_of_le_hypreal_of_real_iff
3936 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
3937 star_of_less_number <-- hypreal_of_real_less_number_of_iff
3938 star_of_le_number <-- hypreal_of_real_le_number_of_iff
3939 star_of_power <-- hypreal_of_real_power
3940 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
3942 * Hyperreal: new method "transfer" that implements the transfer
3943 principle of nonstandard analysis. With a subgoal that mentions
3944 nonstandard types like "'a star", the command "apply transfer"
3945 replaces it with an equivalent one that mentions only standard types.
3946 To be successful, all free variables must have standard types; non-
3947 standard variables must have explicit universal quantifiers.
3949 * Hyperreal: A theory of Taylor series.
3954 * Discontinued special version of 'constdefs' (which used to support
3955 continuous functions) in favor of the general Pure one with full
3958 * New simplification procedure for solving continuity conditions; it
3959 is much faster on terms with many nested lambda abstractions (cubic
3960 instead of exponential time).
3962 * New syntax for domain package: selector names are now optional.
3963 Parentheses should be omitted unless argument is lazy, for example:
3965 domain 'a stream = cons "'a" (lazy "'a stream")
3967 * New command 'fixrec' for defining recursive functions with pattern
3968 matching; defining multiple functions with mutual recursion is also
3969 supported. Patterns may include the constants cpair, spair, up, sinl,
3970 sinr, or any data constructor defined by the domain package. The given
3971 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
3972 syntax and examples.
3974 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
3975 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
3976 but the proof obligation additionally includes an admissibility
3977 requirement. The packages generate instances of class cpo or pcpo,
3978 with continuity and strictness theorems for Rep and Abs.
3980 * HOLCF: Many theorems have been renamed according to a more standard naming
3981 scheme (INCOMPATIBILITY):
3983 foo_inject: "foo$x = foo$y ==> x = y"
3984 foo_eq: "(foo$x = foo$y) = (x = y)"
3985 foo_less: "(foo$x << foo$y) = (x << y)"
3986 foo_strict: "foo$UU = UU"
3987 foo_defined: "... ==> foo$x ~= UU"
3988 foo_defined_iff: "(foo$x = UU) = (x = UU)"
3993 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
3994 including the First Isomorphism Theorem (on quotienting by the kernel
3997 * ZF/Simplifier: install second copy of type solver that actually
3998 makes use of TC rules declared to Isar proof contexts (or locales);
3999 the old version is still required for ML proof scripts.
4004 * Converted to Isar theory format; use locales instead of axiomatic
4010 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4013 * Pure/library.ML no longer defines its own option datatype, but uses
4014 that of the SML basis, which has constructors NONE and SOME instead of
4015 None and Some, as well as exception Option.Option instead of OPTION.
4016 The functions the, if_none, is_some, is_none have been adapted
4017 accordingly, while Option.map replaces apsome.
4019 * Pure/library.ML: the exception LIST has been given up in favour of
4020 the standard exceptions Empty and Subscript, as well as
4021 Library.UnequalLengths. Function like Library.hd and Library.tl are
4022 superceded by the standard hd and tl functions etc.
4024 A number of basic list functions are no longer exported to the ML
4025 toplevel, as they are variants of predefined functions. The following
4026 suggests how one can translate existing code:
4028 rev_append xs ys = List.revAppend (xs, ys)
4029 nth_elem (i, xs) = List.nth (xs, i)
4030 last_elem xs = List.last xs
4031 flat xss = List.concat xss
4032 seq fs = List.app fs
4033 partition P xs = List.partition P xs
4034 mapfilter f xs = List.mapPartial f xs
4036 * Pure/library.ML: several combinators for linear functional
4037 transformations, notably reverse application and composition:
4040 (x, y) |-> f f #-> g
4042 * Pure/library.ML: introduced/changed precedence of infix operators:
4044 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4046 infix 3 o oo ooo oooo;
4047 infix 4 ~~ upto downto;
4049 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4052 * Pure/library.ML: natural list combinators fold, fold_rev, and
4053 fold_map support linear functional transformations and nesting. For
4056 fold f [x1, ..., xN] y =
4057 y |> f x1 |> ... |> f xN
4059 (fold o fold) f [xs1, ..., xsN] y =
4060 y |> fold f xs1 |> ... |> fold f xsN
4062 fold f [x1, ..., xN] =
4065 (fold o fold) f [xs1, ..., xsN] =
4066 fold f xs1 #> ... #> fold f xsN
4068 * Pure/library.ML: the following selectors on type 'a option are
4071 the: 'a option -> 'a (*partial*)
4072 these: 'a option -> 'a where 'a = 'b list
4073 the_default: 'a -> 'a option -> 'a
4074 the_list: 'a option -> 'a list
4076 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4077 basic operations for association lists, following natural argument
4078 order; moreover the explicit equality predicate passed here avoids
4079 potentially expensive polymorphic runtime equality checks.
4080 The old functions may be expressed as follows:
4082 assoc = uncurry (AList.lookup (op =))
4083 assocs = these oo AList.lookup (op =)
4084 overwrite = uncurry (AList.update (op =)) o swap
4086 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4088 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4089 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4091 replacing make_keylist and keyfilter (occassionally used)
4094 make_keylist = AList.make
4095 keyfilter = AList.find (op =)
4097 * eq_fst and eq_snd now take explicit equality parameter, thus
4098 avoiding eqtypes. Naive rewrites:
4100 eq_fst = eq_fst (op =)
4101 eq_snd = eq_snd (op =)
4103 * Removed deprecated apl and apr (rarely used).
4106 apl (n, op) =>>= curry op n
4107 apr (op, m) =>>= fn n => op (n, m)
4109 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4110 provides a reasonably efficient light-weight implementation of sets as
4113 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4114 few new operations; existing lookup and update are now curried to
4115 follow natural argument order (for use with fold etc.);
4116 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4118 * Pure/General: output via the Isabelle channels of
4119 writeln/warning/error etc. is now passed through Output.output, with a
4120 hook for arbitrary transformations depending on the print_mode
4121 (cf. Output.add_mode -- the first active mode that provides a output
4122 function wins). Already formatted output may be embedded into further
4123 text via Output.raw; the result of Pretty.string_of/str_of and derived
4124 functions (string_of_term/cterm/thm etc.) is already marked raw to
4125 accommodate easy composition of diagnostic messages etc. Programmers
4126 rarely need to care about Output.output or Output.raw at all, with
4127 some notable exceptions: Output.output is required when bypassing the
4128 standard channels (writeln etc.), or in token translations to produce
4129 properly formatted results; Output.raw is required when capturing
4130 already output material that will eventually be presented to the user
4131 a second time. For the default print mode, both Output.output and
4132 Output.raw have no effect.
4134 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4135 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4136 cumulative results are displayed at the end of a batch session.
4138 * Pure/General: File.sysify_path and File.quote_sysify path have been
4139 replaced by File.platform_path and File.shell_path (with appropriate
4140 hooks). This provides a clean interface for unusual systems where the
4141 internal and external process view of file names are different.
4143 * Pure: more efficient orders for basic syntactic entities: added
4144 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4145 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4146 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4147 orders now -- potential INCOMPATIBILITY for code that depends on a
4148 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4149 Library.sort_strings on result).
4151 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4152 fold_types traverse types/terms from left to right, observing natural
4153 argument order. Supercedes previous foldl_XXX versions, add_frees,
4154 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4156 * Pure: name spaces have been refined, with significant changes of the
4157 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4158 to extern(_table). The plain name entry path is superceded by a
4159 general 'naming' context, which also includes the 'policy' to produce
4160 a fully qualified name and external accesses of a fully qualified
4161 name; NameSpace.extend is superceded by context dependent
4162 Sign.declare_name. Several theory and proof context operations modify
4163 the naming context. Especially note Theory.restore_naming and
4164 ProofContext.restore_naming to get back to a sane state; note that
4165 Theory.add_path is no longer sufficient to recover from
4166 Theory.absolute_path in particular.
4168 * Pure: new flags short_names (default false) and unique_names
4169 (default true) for controlling output of qualified names. If
4170 short_names is set, names are printed unqualified. If unique_names is
4171 reset, the name prefix is reduced to the minimum required to achieve
4172 the original result when interning again, even if there is an overlap
4173 with earlier declarations.
4175 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4176 now 'extend', and 'merge' gets an additional Pretty.pp argument
4177 (useful for printing error messages). INCOMPATIBILITY.
4179 * Pure: major reorganization of the theory context. Type Sign.sg and
4180 Theory.theory are now identified, referring to the universal
4181 Context.theory (see Pure/context.ML). Actual signature and theory
4182 content is managed as theory data. The old code and interfaces were
4183 spread over many files and structures; the new arrangement introduces
4184 considerable INCOMPATIBILITY to gain more clarity:
4186 Context -- theory management operations (name, identity, inclusion,
4187 parents, ancestors, merge, etc.), plus generic theory data;
4189 Sign -- logical signature and syntax operations (declaring consts,
4190 types, etc.), plus certify/read for common entities;
4192 Theory -- logical theory operations (stating axioms, definitions,
4193 oracles), plus a copy of logical signature operations (consts,
4194 types, etc.); also a few basic management operations (Theory.copy,
4197 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4198 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4199 for convenience -- they merely return the theory.
4201 * Pure: type Type.tsig is superceded by theory in most interfaces.
4203 * Pure: the Isar proof context type is already defined early in Pure
4204 as Context.proof (note that ProofContext.context and Proof.context are
4205 aliases, where the latter is the preferred name). This enables other
4206 Isabelle components to refer to that type even before Isar is present.
4208 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4209 typeK, constK, axiomK, oracleK), but provide explicit operations for
4210 any of these kinds. For example, Sign.intern typeK is now
4211 Sign.intern_type, Theory.hide_space Sign.typeK is now
4212 Theory.hide_types. Also note that former
4213 Theory.hide_classes/types/consts are now
4214 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4215 internalize their arguments! INCOMPATIBILITY.
4217 * Pure: get_thm interface (of PureThy and ProofContext) expects
4218 datatype thmref (with constructors Name and NameSelection) instead of
4219 plain string -- INCOMPATIBILITY;
4221 * Pure: cases produced by proof methods specify options, where NONE
4222 means to remove case bindings -- INCOMPATIBILITY in
4225 * Pure: the following operations retrieve axioms or theorems from a
4226 theory node or theory hierarchy, respectively:
4228 Theory.axioms_of: theory -> (string * term) list
4229 Theory.all_axioms_of: theory -> (string * term) list
4230 PureThy.thms_of: theory -> (string * thm) list
4231 PureThy.all_thms_of: theory -> (string * thm) list
4233 * Pure: print_tac now outputs the goal through the trace channel.
4235 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4236 Reference Toplevel.debug (default false) controls detailed printing
4237 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4238 controls execution profiling -- set to 1 for time and 2 for space
4239 (both increase the runtime).
4241 * Isar session: The initial use of ROOT.ML is now always timed,
4242 i.e. the log will show the actual process times, in contrast to the
4243 elapsed wall-clock time that the outer shell wrapper produces.
4245 * Simplifier: improved handling of bound variables (nameless
4246 representation, avoid allocating new strings). Simprocs that invoke
4247 the Simplifier recursively should use Simplifier.inherit_bounds to
4248 avoid local name clashes. Failure to do so produces warnings
4249 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4250 for further details.
4252 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4253 bindings for all theorems stored within a given theory; this may help
4254 in porting non-Isar theories to Isar ones, while keeping ML proof
4255 scripts for the time being.
4257 * ML operator HTML.with_charset specifies the charset begin used for
4258 generated HTML files. For example:
4260 HTML.with_charset "utf-8" use_thy "Hebrew";
4261 HTML.with_charset "utf-8" use_thy "Chinese";
4266 * Allow symlinks to all proper Isabelle executables (Isabelle,
4267 isabelle, isatool etc.).
4269 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4270 isatool doc, isatool mkdir, display_drafts etc.).
4272 * isatool usedir: option -f allows specification of the ML file to be
4273 used by Isabelle; default is ROOT.ML.
4275 * New isatool version outputs the version identifier of the Isabelle
4276 distribution being used.
4278 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4279 (containing Boolean satisfiability problems) into Isabelle/HOL
4284 New in Isabelle2004 (April 2004)
4285 --------------------------------
4289 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4290 Replaces linorder.ML.
4292 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4293 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4294 (\<a>...\<z>), are now considered normal letters, and can therefore
4295 be used anywhere where an ASCII letter (a...zA...Z) has until
4296 now. COMPATIBILITY: This obviously changes the parsing of some
4297 terms, especially where a symbol has been used as a binder, say
4298 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4299 as an identifier. Fix it by inserting a space around former
4300 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4301 existing theory and ML files.
4303 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4305 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4306 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4307 a normal (but invisible) letter. For multiple letter subscripts repeat
4308 \<^isub> like this: x\<^isub>1\<^isub>2.
4310 * Pure: There are now sub-/superscripts that can span more than one
4311 character. Text between \<^bsub> and \<^esub> is set in subscript in
4312 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4313 superscript. The new control characters are not identifier parts.
4315 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4316 content of "..." to the latex file instead of \isacntrl... . The "..."
4317 may consist of any printable characters excluding the end bracket >.
4319 * Pure: Using new Isar command "finalconsts" (or the ML functions
4320 Theory.add_finals or Theory.add_finals_i) it is now possible to
4321 declare constants "final", which prevents their being given a definition
4322 later. It is useful for constants whose behaviour is fixed axiomatically
4323 rather than definitionally, such as the meta-logic connectives.
4325 * Pure: 'instance' now handles general arities with general sorts
4326 (i.e. intersections of classes),
4328 * Presentation: generated HTML now uses a CSS style sheet to make layout
4329 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4330 It can be changed to alter the colors/layout of generated pages.
4335 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4336 cut_tac, subgoal_tac and thin_tac:
4337 - Now understand static (Isar) contexts. As a consequence, users of Isar
4338 locales are no longer forced to write Isar proof scripts.
4339 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4341 - INCOMPATIBILITY: names of variables to be instantiated may no
4342 longer be enclosed in quotes. Instead, precede variable name with `?'.
4343 This is consistent with the instantiation attribute "where".
4345 * Attributes "where" and "of":
4346 - Now take type variables of instantiated theorem into account when reading
4347 the instantiation string. This fixes a bug that caused instantiated
4348 theorems to have too special types in some circumstances.
4349 - "where" permits explicit instantiations of type variables.
4351 * Calculation commands "moreover" and "also" no longer interfere with
4352 current facts ("this"), admitting arbitrary combinations with "then"
4356 - Goal statements involving the context element "includes" no longer
4357 generate theorems with internal delta predicates (those ending on
4358 "_axioms") in the premise.
4359 Resolve particular premise with <locale>.intro to obtain old form.
4360 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4361 specification and "includes" elements in goal statement.
4362 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4363 [intro?] and [elim?] (respectively) by default.
4364 - Experimental command for instantiation of locales in proof contexts:
4365 instantiate <label>[<attrs>]: <loc>
4366 Instantiates locale <loc> and adds all its theorems to the current context
4367 taking into account their attributes. Label and attrs are optional
4368 modifiers, like in theorem declarations. If present, names of
4369 instantiated theorems are qualified with <label>, and the attributes
4370 <attrs> are applied after any attributes these theorems might have already.
4371 If the locale has assumptions, a chained fact of the form
4372 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4373 are derived. The command does not support old-style locales declared
4374 with "locale (open)".
4375 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4377 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4383 * Proof import: new image HOL4 contains the imported library from
4384 the HOL4 system with about 2500 theorems. It is imported by
4385 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4386 can be used like any other Isabelle image. See
4387 HOL/Import/HOL/README for more information.
4390 - Much improved handling of linear and partial orders.
4391 Reasoners for linear and partial orders are set up for type classes
4392 "linorder" and "order" respectively, and are added to the default simpset
4393 as solvers. This means that the simplifier can build transitivity chains
4394 to solve goals from the assumptions.
4395 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4396 of blast or auto after simplification become unnecessary because the goal
4397 is solved by simplification already.
4399 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4400 all proved in axiomatic type classes for semirings, rings and fields.
4403 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4404 now formalized using the Ring_and_Field theory mentioned above.
4405 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4406 than before, because now they are set up once in a generic manner.
4407 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4408 Look for the general versions in Ring_and_Field (and Power if they concern
4411 * Type "rat" of the rational numbers is now available in HOL-Complex.
4414 - Record types are now by default printed with their type abbreviation
4415 instead of the list of all field types. This can be configured via
4416 the reference "print_record_type_abbr".
4417 - Simproc "record_upd_simproc" for simplification of multiple updates added
4418 (not enabled by default).
4419 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4420 EX x. x = sel r to True (not enabled by default).
4421 - Tactic "record_split_simp_tac" to split and simplify records added.
4423 * 'specification' command added, allowing for definition by
4424 specification. There is also an 'ax_specification' command that
4425 introduces the new constants axiomatically.
4427 * arith(_tac) is now able to generate counterexamples for reals as well.
4429 * HOL-Algebra: new locale "ring" for non-commutative rings.
4431 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4432 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4434 * HOL-Matrix: a first theory for matrices in HOL with an application of
4435 matrix theory to linear programming.
4437 * Unions and Intersections:
4438 The latex output syntax of UN and INT has been changed
4439 from "\Union x \in A. B" to "\Union_{x \in A} B"
4440 i.e. the index formulae has become a subscript.
4441 Similarly for "\Union x. B", and for \Inter instead of \Union.
4443 * Unions and Intersections over Intervals:
4444 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4445 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4446 like in normal math, and corresponding versions for < and for intersection.
4448 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4449 lexicographic dictonary ordering has been added as "lexord".
4451 * ML: the legacy theory structures Int and List have been removed. They had
4452 conflicted with ML Basis Library structures having the same names.
4454 * 'refute' command added to search for (finite) countermodels. Only works
4455 for a fragment of HOL. The installation of an external SAT solver is
4456 highly recommended. See "HOL/Refute.thy" for details.
4458 * 'quickcheck' command: Allows to find counterexamples by evaluating
4459 formulae under an assignment of free variables to random values.
4460 In contrast to 'refute', it can deal with inductive datatypes,
4461 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4467 * Streams now come with concatenation and are part of the HOLCF image
4471 New in Isabelle2003 (May 2003)
4472 ------------------------------
4476 * Provers/simplifier:
4478 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4479 Assumptions are now subject to complete mutual simplification,
4480 not just from left to right. The simplifier now preserves
4481 the order of assumptions.
4483 Potential INCOMPATIBILITY:
4485 -- simp sometimes diverges where the old version did
4486 not, e.g. invoking simp on the goal
4488 [| P (f x); y = x; f x = f y |] ==> Q
4490 now gives rise to the infinite reduction sequence
4492 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4494 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4497 -- Tactics combining classical reasoner and simplification (such as auto)
4498 are also affected by this change, because many of them rely on
4499 simp. They may sometimes diverge as well or yield a different numbers
4500 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4501 in case of problems. Sometimes subsequent calls to the classical
4502 reasoner will fail because a preceeding call to the simplifier too
4503 eagerly simplified the goal, e.g. deleted redundant premises.
4505 - The simplifier trace now shows the names of the applied rewrite rules
4507 - You can limit the number of recursive invocations of the simplifier
4508 during conditional rewriting (where the simplifie tries to solve the
4509 conditions before applying the rewrite rule):
4510 ML "simp_depth_limit := n"
4511 where n is an integer. Thus you can force termination where previously
4512 the simplifier would diverge.
4514 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4516 - No longer aborts on failed congruence proof. Instead, the
4517 congruence is ignored.
4519 * Pure: New generic framework for extracting programs from constructive
4520 proofs. See HOL/Extraction.thy for an example instantiation, as well
4521 as HOL/Extraction for some case studies.
4523 * Pure: The main goal of the proof state is no longer shown by default, only
4524 the subgoals. This behaviour is controlled by a new flag.
4525 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4526 (ML: Proof.show_main_goal).
4528 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4529 rules whose conclusion matches subgoal 1:
4530 PG menu: Isabelle/Isar -> Show me -> matching rules
4531 The rules are ordered by how closely they match the subgoal.
4532 In particular, rules that solve a subgoal outright are displayed first
4533 (or rather last, the way they are printed).
4534 (ML: ProofGeneral.print_intros())
4536 * Pure: New flag trace_unify_fail causes unification to print
4537 diagnostic information (PG: in trace buffer) when it fails. This is
4538 useful for figuring out why single step proofs like rule, erule or
4541 * Pure: Locale specifications now produce predicate definitions
4542 according to the body of text (covering assumptions modulo local
4543 definitions); predicate "loc_axioms" covers newly introduced text,
4544 while "loc" is cumulative wrt. all included locale expressions; the
4545 latter view is presented only on export into the global theory
4546 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4547 on the old view without predicates;
4549 * Pure: predefined locales "var" and "struct" are useful for sharing
4550 parameters (as in CASL, for example); just specify something like
4551 ``var x + var y + struct M'' as import;
4553 * Pure: improved thms_containing: proper indexing of facts instead of
4554 raw theorems; check validity of results wrt. current name space;
4555 include local facts of proof configuration (also covers active
4556 locales), cover fixed variables in index; may use "_" in term
4557 specification; an optional limit for the number of printed facts may
4558 be given (the default is 40);
4560 * Pure: disallow duplicate fact bindings within new-style theory files
4563 * Provers: improved induct method: assumptions introduced by case
4564 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4565 the goal statement); "foo" still refers to all facts collectively;
4567 * Provers: the function blast.overloaded has been removed: all constants
4568 are regarded as potentially overloaded, which improves robustness in exchange
4569 for slight decrease in efficiency;
4571 * Provers/linorder: New generic prover for transitivity reasoning over
4572 linear orders. Note: this prover is not efficient!
4574 * Isar: preview of problems to finish 'show' now produce an error
4575 rather than just a warning (in interactive mode);
4582 - Produces a counter example if it cannot prove a goal.
4583 Note that the counter example may be spurious if the goal is not a formula
4584 of quantifier-free linear arithmetic.
4585 In ProofGeneral the counter example appears in the trace buffer.
4587 - Knows about div k and mod k where k is a numeral of type nat or int.
4589 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4590 linear arithmetic fails. This takes account of quantifiers and divisibility.
4591 Presburger arithmetic can also be called explicitly via presburger(_tac).
4593 * simp's arithmetic capabilities have been enhanced a bit: it now
4594 takes ~= in premises into account (by performing a case split);
4596 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4597 are distributed over a sum of terms;
4599 * New tactic "trans_tac" and method "trans" instantiate
4600 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4603 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4604 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4606 * 'typedef' command has new option "open" to suppress the set
4609 * functions Min and Max on finite sets have been introduced (theory
4612 * attribute [symmetric] now works for relations as well; it turns
4613 (x,y) : R^-1 into (y,x) : R, and vice versa;
4615 * induct over a !!-quantified statement (say !!x1..xn):
4616 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4618 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4619 %x. None. Warning: empty_def now refers to the previously hidden definition
4622 * Algebra: formalization of classical algebra. Intended as base for
4623 any algebraic development in Isabelle. Currently covers group theory
4624 (up to Sylow's theorem) and ring theory (Universal Property of
4625 Univariate Polynomials). Contributions welcome;
4627 * GroupTheory: deleted, since its material has been moved to Algebra;
4629 * Complex: new directory of the complex numbers with numeric constants,
4630 nonstandard complex numbers, and some complex analysis, standard and
4631 nonstandard (Jacques Fleuriot);
4633 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4635 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4638 * Real/HahnBanach: updated and adapted to locales;
4640 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4643 * UNITY: added the Meier-Sanders theory of progress sets;
4645 * MicroJava: bytecode verifier and lightweight bytecode verifier
4646 as abstract algorithms, instantiated to the JVM;
4648 * Bali: Java source language formalization. Type system, operational
4649 semantics, axiomatic semantics. Supported language features:
4650 classes, interfaces, objects,virtual methods, static methods,
4651 static/instance fields, arrays, access modifiers, definite
4652 assignment, exceptions.
4657 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4660 * Main ZF: virtually all theories converted to new-style format;
4665 * Pure: Tactic.prove provides sane interface for internal proofs;
4666 omits the infamous "standard" operation, so this is more appropriate
4667 than prove_goalw_cterm in many situations (e.g. in simprocs);
4669 * Pure: improved error reporting of simprocs;
4671 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4675 *** Document preparation ***
4677 * uses \par instead of \\ for line breaks in theory text. This may
4678 shift some page breaks in large documents. To get the old behaviour
4679 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4681 * minimized dependencies of isabelle.sty and isabellesym.sty on
4684 * \<euro> now needs package babel/greek instead of marvosym (which
4687 * normal size for \<zero>...\<nine> (uses \mathbf instead of
4692 New in Isabelle2002 (March 2002)
4693 --------------------------------
4695 *** Document preparation ***
4697 * greatly simplified document preparation setup, including more
4698 graceful interpretation of isatool usedir -i/-d/-D options, and more
4699 instructive isatool mkdir; users should basically be able to get
4700 started with "isatool mkdir HOL Test && isatool make"; alternatively,
4701 users may run a separate document processing stage manually like this:
4702 "isatool usedir -D output HOL Test && isatool document Test/output";
4704 * theory dependency graph may now be incorporated into documents;
4705 isatool usedir -g true will produce session_graph.eps/.pdf for use
4706 with \includegraphics of LaTeX;
4708 * proper spacing of consecutive markup elements, especially text
4709 blocks after section headings;
4711 * support bold style (for single symbols only), input syntax is like
4712 this: "\<^bold>\<alpha>" or "\<^bold>A";
4714 * \<bullet> is now output as bold \cdot by default, which looks much
4715 better in printed text;
4717 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
4718 note that these symbols are currently unavailable in Proof General /
4719 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
4721 * isatool latex no longer depends on changed TEXINPUTS, instead
4722 isatool document copies the Isabelle style files to the target
4728 * Pure/Provers: improved proof by cases and induction;
4729 - 'case' command admits impromptu naming of parameters (such as
4731 - 'induct' method divinates rule instantiation from the inductive
4732 claim; no longer requires excessive ?P bindings for proper
4733 instantiation of cases;
4734 - 'induct' method properly enumerates all possibilities of set/type
4735 rules; as a consequence facts may be also passed through *type*
4736 rules without further ado;
4737 - 'induct' method now derives symbolic cases from the *rulified*
4738 rule (before it used to rulify cases stemming from the internal
4739 atomized version); this means that the context of a non-atomic
4740 statement becomes is included in the hypothesis, avoiding the
4741 slightly cumbersome show "PROP ?case" form;
4742 - 'induct' may now use elim-style induction rules without chaining
4743 facts, using ``missing'' premises from the goal state; this allows
4744 rules stemming from inductive sets to be applied in unstructured
4745 scripts, while still benefitting from proper handling of non-atomic
4746 statements; NB: major inductive premises need to be put first, all
4747 the rest of the goal is passed through the induction;
4748 - 'induct' proper support for mutual induction involving non-atomic
4749 rule statements (uses the new concept of simultaneous goals, see
4751 - append all possible rule selections, but only use the first
4752 success (no backtracking);
4753 - removed obsolete "(simplified)" and "(stripped)" options of methods;
4754 - undeclared rule case names default to numbers 1, 2, 3, ...;
4755 - added 'print_induct_rules' (covered by help item in recent Proof
4757 - moved induct/cases attributes to Pure, methods to Provers;
4758 - generic method setup instantiated for FOL and HOL;
4760 * Pure: support multiple simultaneous goal statements, for example
4761 "have a: A and b: B" (same for 'theorem' etc.); being a pure
4762 meta-level mechanism, this acts as if several individual goals had
4763 been stated separately; in particular common proof methods need to be
4764 repeated in order to cover all claims; note that a single elimination
4765 step is *not* sufficient to establish the two conjunctions, so this
4768 assume "A & B" then have A and B .. (*".." fails*)
4770 better use "obtain" in situations as above; alternative refer to
4771 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
4773 * Pure: proper integration with ``locales''; unlike the original
4774 version by Florian Kammller, Isar locales package high-level proof
4775 contexts rather than raw logical ones (e.g. we admit to include
4776 attributes everywhere); operations on locales include merge and
4777 rename; support for implicit arguments (``structures''); simultaneous
4778 type-inference over imports and text; see also HOL/ex/Locales.thy for
4781 * Pure: the following commands have been ``localized'', supporting a
4782 target locale specification "(in name)": 'lemma', 'theorem',
4783 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
4784 stored both within the locale and at the theory level (exported and
4785 qualified by the locale name);
4787 * Pure: theory goals may now be specified in ``long'' form, with
4788 ad-hoc contexts consisting of arbitrary locale elements. for example
4789 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
4790 definitions may be given, too); the result is a meta-level rule with
4791 the context elements being discharged in the obvious way;
4793 * Pure: new proof command 'using' allows to augment currently used
4794 facts after a goal statement ('using' is syntactically analogous to
4795 'apply', but acts on the goal's facts only); this allows chained facts
4796 to be separated into parts given before and after a claim, as in
4797 ``from a and b have C using d and e <proof>'';
4799 * Pure: renamed "antecedent" case to "rule_context";
4801 * Pure: new 'judgment' command records explicit information about the
4802 object-logic embedding (used by several tools internally); no longer
4803 use hard-wired "Trueprop";
4805 * Pure: added 'corollary' command;
4807 * Pure: fixed 'token_translation' command;
4809 * Pure: removed obsolete 'exported' attribute;
4811 * Pure: dummy pattern "_" in is/let is now automatically lifted over
4812 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
4813 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
4815 * Pure: method 'atomize' presents local goal premises as object-level
4816 statements (atomic meta-level propositions); setup controlled via
4817 rewrite rules declarations of 'atomize' attribute; example
4818 application: 'induct' method with proper rule statements in improper
4821 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
4822 now consider the syntactic context of assumptions, giving a better
4823 chance to get type-inference of the arguments right (this is
4824 especially important for locales);
4826 * Pure: "sorry" no longer requires quick_and_dirty in interactive
4829 * Pure/obtain: the formal conclusion "thesis", being marked as
4830 ``internal'', may no longer be reference directly in the text;
4831 potential INCOMPATIBILITY, may need to use "?thesis" in rare
4834 * Pure: generic 'sym' attribute which declares a rule both as pure
4835 'elim?' and for the 'symmetric' operation;
4837 * Pure: marginal comments ``--'' may now occur just anywhere in the
4838 text; the fixed correlation with particular command syntax has been
4841 * Pure: new method 'rules' is particularly well-suited for proof
4842 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
4843 but often produces more compact proof terms with less detours;
4845 * Pure/Provers/classical: simplified integration with pure rule
4846 attributes and methods; the classical "intro?/elim?/dest?"
4847 declarations coincide with the pure ones; the "rule" method no longer
4848 includes classically swapped intros; "intro" and "elim" methods no
4849 longer pick rules from the context; also got rid of ML declarations
4850 AddXIs/AddXEs/AddXDs; all of this has some potential for
4853 * Provers/classical: attribute 'swapped' produces classical inversions
4854 of introduction rules;
4856 * Provers/simplifier: 'simplified' attribute may refer to explicit
4857 rules instead of full simplifier context; 'iff' attribute handles
4860 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
4862 * HOL: 'recdef' now fails on unfinished automated proofs, use
4863 "(permissive)" option to recover old behavior;
4865 * HOL: 'inductive' no longer features separate (collective) attributes
4866 for 'intros' (was found too confusing);
4868 * HOL: properly declared induction rules less_induct and
4874 * HOL: moved over to sane numeral syntax; the new policy is as
4877 - 0 and 1 are polymorphic constants, which are defined on any
4878 numeric type (nat, int, real etc.);
4880 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
4881 binary representation internally;
4883 - type nat has special constructor Suc, and generally prefers Suc 0
4884 over 1::nat and Suc (Suc 0) over 2::nat;
4886 This change may cause significant problems of INCOMPATIBILITY; here
4887 are some hints on converting existing sources:
4889 - due to the new "num" token, "-0" and "-1" etc. are now atomic
4890 entities, so expressions involving "-" (unary or binary minus) need
4891 to be spaced properly;
4893 - existing occurrences of "1" may need to be constraint "1::nat" or
4894 even replaced by Suc 0; similar for old "2";
4896 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
4898 - remove all special provisions on numerals in proofs;
4900 * HOL: simp rules nat_number expand numerals on nat to Suc/0
4901 representation (depends on bin_arith_simps in the default context);
4903 * HOL: symbolic syntax for x^2 (numeral 2);
4905 * HOL: the class of all HOL types is now called "type" rather than
4906 "term"; INCOMPATIBILITY, need to adapt references to this type class
4907 in axclass/classes, instance/arities, and (usually rare) occurrences
4908 in typings (of consts etc.); internally the class is called
4909 "HOL.type", ML programs should refer to HOLogic.typeS;
4911 * HOL/record package improvements:
4912 - new derived operations "fields" to build a partial record section,
4913 "extend" to promote a fixed record to a record scheme, and
4914 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
4915 declared as simp by default;
4916 - shared operations ("more", "fields", etc.) now need to be always
4917 qualified) --- potential INCOMPATIBILITY;
4918 - removed "make_scheme" operations (use "make" with "extend") --
4920 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
4921 - provides cases/induct rules for use with corresponding Isar
4922 methods (for concrete records, record schemes, concrete more
4923 parts, and schematic more parts -- in that order);
4924 - internal definitions directly based on a light-weight abstract
4925 theory of product types over typedef rather than datatype;
4927 * HOL: generic code generator for generating executable ML code from
4928 specifications; specific support for HOL constructs such as inductive
4929 datatypes and sets, as well as recursive functions; can be invoked
4930 via 'generate_code' theory section;
4932 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
4934 * HOL: consolidated and renamed several theories. In particular:
4935 Ord.thy has been absorbed into HOL.thy
4936 String.thy has been absorbed into List.thy
4938 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
4939 (beware of argument permutation!);
4941 * HOL: linorder_less_split superseded by linorder_cases;
4943 * HOL/List: "nodups" renamed to "distinct";
4945 * HOL: added "The" definite description operator; move Hilbert's "Eps"
4946 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
4947 - Ex_def has changed, now need to use some_eq_ex
4949 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
4950 in this (rare) case use:
4952 delSWrapper "split_all_tac"
4953 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
4955 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
4958 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
4959 Isabelle's type classes, ^ on functions and relations has too general
4960 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
4961 necessary to attach explicit type constraints;
4963 * HOL/Relation: the prefix name of the infix "O" has been changed from
4964 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
4965 renamed accordingly (eg "compI" -> "rel_compI").
4967 * HOL: syntax translations now work properly with numerals and records
4970 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
4971 of "lam" -- INCOMPATIBILITY;
4973 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
4974 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
4975 renamed "Product_Type.unit";
4977 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
4979 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
4980 the "cases" method);
4982 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
4985 * HOL/IMP: updated and converted to new-style theory format; several
4986 parts turned into readable document, with proper Isar proof texts and
4987 some explanations (by Gerwin Klein);
4989 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
4991 * HOL-Hyperreal is now a logic image;
4996 * Isar: consts/constdefs supports mixfix syntax for continuous
4999 * Isar: domain package adapted to new-style theory format, e.g. see
5002 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5003 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5004 lift.induct_tac, always use UU instead of Undef;
5006 * HOLCF/IMP: updated and converted to new-style theory;
5011 * Isar: proper integration of logic-specific tools and packages,
5012 including theory commands '(co)inductive', '(co)datatype',
5013 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5014 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5016 * theory Main no longer includes AC; for the Axiom of Choice, base
5017 your theory on Main_ZFC;
5019 * the integer library now covers quotients and remainders, with many
5020 laws relating division to addition, multiplication, etc.;
5022 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5023 typeless version of the formalism;
5025 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5028 * ZF/Induct: new directory for examples of inductive definitions,
5029 including theory Multiset for multiset orderings; converted to
5030 new-style theory format;
5032 * ZF: many new theorems about lists, ordinals, etc.;
5037 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5038 variable proof controls level of detail: 0 = no proofs (only oracle
5039 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5040 also ref manual for further ML interfaces;
5042 * Pure/axclass: removed obsolete ML interface
5043 goal_subclass/goal_arity;
5045 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5046 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5047 separate tokens, so expressions involving minus need to be spaced
5050 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5051 rather than "infixl" or "infixr";
5053 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5054 sort constraint specifications in type inference; e.g. "x::_::foo"
5055 ensures that the type of "x" is of sort "foo" (but not necessarily a
5058 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5059 control output of nested => (types); the default behavior is
5062 * Pure/syntax: builtin parse translation for "_constify" turns valued
5063 tokens into AST constants;
5065 * Pure/syntax: prefer later declarations of translations and print
5066 translation functions; potential INCOMPATIBILITY: need to reverse
5067 multiple declarations for same syntax element constant;
5069 * Pure/show_hyps reset by default (in accordance to existing Isar
5072 * Provers/classical: renamed addaltern to addafter, addSaltern to
5075 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5078 * system: tested support for MacOS X; should be able to get Isabelle +
5079 Proof General to work in a plain Terminal after installing Poly/ML
5080 (e.g. from the Isabelle distribution area) and GNU bash alone
5081 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5082 support requires further installations, e.g. from
5083 http://fink.sourceforge.net/);
5085 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5087 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5088 of 40 MB), cf. ML_OPTIONS;
5090 * system: Proof General keywords specification is now part of the
5091 Isabelle distribution (see etc/isar-keywords.el);
5093 * system: support for persistent Proof General sessions (refrain from
5094 outdating all loaded theories on startup); user may create writable
5095 logic images like this: ``isabelle -q HOL Test'';
5097 * system: smart selection of Isabelle process versus Isabelle
5098 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5099 run both "isabelle" and "Isabelle" even if file names are badly
5100 damaged (executable inspects the case of the first letter of its own
5101 name); added separate "isabelle-process" and "isabelle-interface";
5103 * system: refrain from any attempt at filtering input streams; no
5104 longer support ``8bit'' encoding of old isabelle font, instead proper
5105 iso-latin characters may now be used; the related isatools
5106 "symbolinput" and "nonascii" have disappeared as well;
5108 * system: removed old "xterm" interface (the print modes "xterm" and
5109 "xterm_color" are still available for direct use in a suitable
5114 New in Isabelle99-2 (February 2001)
5115 -----------------------------------
5117 *** Overview of INCOMPATIBILITIES ***
5119 * HOL: please note that theories in the Library and elsewhere often use the
5120 new-style (Isar) format; to refer to their theorems in an ML script you must
5121 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5123 * HOL: inductive package no longer splits induction rule aggressively,
5124 but only as far as specified by the introductions given; the old
5125 format may be recovered via ML function complete_split_rule or attribute
5126 'split_rule (complete)';
5128 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5129 gfp_Tarski to gfp_unfold;
5131 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5133 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5134 relation); infix "^^" has been renamed "``"; infix "``" has been
5135 renamed "`"; "univalent" has been renamed "single_valued";
5137 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5140 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5142 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5144 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5145 consequence, it is no longer monotonic wrt. the local goal context
5146 (which is now passed through the inductive cases);
5148 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5149 \<gg> to \<ggreater>;
5152 *** Document preparation ***
5154 * \isabellestyle{NAME} selects version of Isabelle output (currently
5155 available: are "it" for near math-mode best-style output, "sl" for
5156 slanted text style, and "tt" for plain type-writer; if no
5157 \isabellestyle command is given, output is according to slanted
5160 * support sub/super scripts (for single symbols only), input syntax is
5161 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5163 * some more standard symbols; see Appendix A of the system manual for
5164 the complete list of symbols defined in isabellesym.sty;
5166 * improved isabelle style files; more abstract symbol implementation
5167 (should now use \isamath{...} and \isatext{...} in custom symbol
5170 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5171 state; Note that presentation of goal states does not conform to
5172 actual human-readable proof documents. Please do not include goal
5173 states into document output unless you really know what you are doing!
5175 * proper indentation of antiquoted output with proportional LaTeX
5178 * no_document ML operator temporarily disables LaTeX document
5181 * isatool unsymbolize tunes sources for plain ASCII communication;
5186 * Pure: Isar now suffers initial goal statements to contain unbound
5187 schematic variables (this does not conform to actual readable proof
5188 documents, due to unpredictable outcome and non-compositional proof
5189 checking); users who know what they are doing may use schematic goals
5190 for Prolog-style synthesis of proven results;
5192 * Pure: assumption method (an implicit finishing) now handles actual
5195 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5196 initial goal, declare "that" only as Pure intro (only for single
5197 steps); the "that" rule assumption may now be involved in implicit
5198 finishing, thus ".." becomes a feasible for trivial obtains;
5200 * Pure: default proof step now includes 'intro_classes'; thus trivial
5201 instance proofs may be performed by "..";
5203 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5206 * Pure: more robust selection of calculational rules;
5208 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5209 rule (as well as the assumption rule);
5211 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5212 lemmas, using the graph browser tool;
5214 * Pure: predict failure of "show" in interactive mode;
5216 * Pure: 'thms_containing' now takes actual terms as arguments;
5218 * HOL: improved method 'induct' --- now handles non-atomic goals
5219 (potential INCOMPATIBILITY); tuned error handling;
5221 * HOL: cases and induct rules now provide explicit hints about the
5222 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5223 any remaining facts are inserted into the goal verbatim;
5225 * HOL: local contexts (aka cases) may now contain term bindings as
5226 well; the 'cases' and 'induct' methods new provide a ?case binding for
5227 the result to be shown in each case;
5229 * HOL: added 'recdef_tc' command;
5231 * isatool convert assists in eliminating legacy ML scripts;
5236 * HOL/Library: a collection of generic theories to be used together
5237 with main HOL; the theory loader path already includes this directory
5238 by default; the following existing theories have been moved here:
5239 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5240 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5242 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5243 modelling and verification task performed in Isabelle/HOL +
5244 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5246 * HOL/Algebra: special summation operator SUM no longer exists, it has
5247 been replaced by setsum; infix 'assoc' now has priority 50 (like
5248 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5249 'domain', this makes the theory consistent with mathematical
5252 * HOL basics: added overloaded operations "inverse" and "divide"
5253 (infix "/"), syntax for generic "abs" operation, generic summation
5256 * HOL/typedef: simplified package, provide more useful rules (see also
5259 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5260 now expressed as a proper nested rule (old-style tactic scripts may
5261 require atomize_strip_tac to cope with non-atomic premises);
5263 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5264 to "split_conv" (old name still available for compatibility);
5266 * HOL: improved concrete syntax for strings (e.g. allows translation
5267 rules with string literals);
5269 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5270 and Fleuriot's mechanization of analysis, including the transcendental
5271 functions for the reals;
5273 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5278 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5279 "lam" is displayed as TWO lambda-symbols
5281 * CTT: theory Main now available, containing everything (that is, Bool
5287 * Pure: the Simplifier has been implemented properly as a derived rule
5288 outside of the actual kernel (at last!); the overall performance
5289 penalty in practical applications is about 50%, while reliability of
5290 the Isabelle inference kernel has been greatly improved;
5292 * print modes "brackets" and "no_brackets" control output of nested =>
5293 (types) and ==> (props); the default behaviour is "brackets";
5295 * Provers: fast_tac (and friends) now handle actual object-logic rules
5296 as assumptions as well;
5298 * system: support Poly/ML 4.0;
5300 * system: isatool install handles KDE version 1 or 2;
5304 New in Isabelle99-1 (October 2000)
5305 ----------------------------------
5307 *** Overview of INCOMPATIBILITIES ***
5309 * HOL: simplification of natural numbers is much changed; to partly
5310 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5311 issue the following ML commands:
5313 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5314 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5316 * HOL: simplification no longer dives into case-expressions; this is
5317 controlled by "t.weak_case_cong" for each datatype t;
5319 * HOL: nat_less_induct renamed to less_induct;
5321 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5322 fixsome to patch .thy and .ML sources automatically;
5324 select_equality -> some_equality
5325 select_eq_Ex -> some_eq_ex
5326 selectI2EX -> someI2_ex
5329 select1_equality -> some1_equality
5330 Eps_sym_eq -> some_sym_eq_trivial
5331 Eps_eq -> some_eq_trivial
5333 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5335 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5338 * HOL: the recursion equations generated by 'recdef' are now called
5339 f.simps instead of f.rules;
5341 * HOL: qed_spec_mp now also handles bounded ALL as well;
5343 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5344 sometimes be needed;
5346 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5348 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5350 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5351 product is now "<*>" instead of "Times"; the lexicographic product is
5352 now "<*lex*>" instead of "**";
5354 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5355 of main HOL, but was unused); better use HOL's datatype package;
5357 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5358 the old syntax may be recovered as follows:
5361 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5362 (infixl "\\<oplus>" 100)
5364 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5366 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5367 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5370 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5371 changed from A/r to A//r;
5373 * ZF: new treatment of arithmetic (nat & int) may break some old
5376 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5377 rulify -> rule_format, elimify -> elim_format, ...);
5379 * Isar/Provers: intro/elim/dest attributes changed; renamed
5380 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5381 should have to change intro!! to intro? only); replaced "delrule" by
5384 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5386 * Provers: strengthened force_tac by using new first_best_tac;
5388 * LaTeX document preparation: several changes of isabelle.sty (see
5392 *** Document preparation ***
5394 * formal comments (text blocks etc.) in new-style theories may now
5395 contain antiquotations of thm/prop/term/typ/text to be presented
5396 according to latex print mode; concrete syntax is like this:
5397 @{term[show_types] "f(x) = a + x"};
5399 * isatool mkdir provides easy setup of Isabelle session directories,
5400 including proper document sources;
5402 * generated LaTeX sources are now deleted after successful run
5403 (isatool document -c); may retain a copy somewhere else via -D option
5406 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5407 style files, achieving self-contained LaTeX sources and simplifying
5410 * old-style theories now produce (crude) LaTeX output as well;
5412 * browser info session directories are now self-contained (may be put
5413 on WWW server seperately); improved graphs of nested sessions; removed
5414 graph for 'all sessions';
5416 * several improvements in isabelle style files; \isabellestyle{it}
5417 produces fake math mode output; \isamarkupheader is now \section by
5418 default; see lib/texinputs/isabelle.sty etc.;
5423 * Isar/Pure: local results and corresponding term bindings are now
5424 subject to Hindley-Milner polymorphism (similar to ML); this
5425 accommodates incremental type-inference very nicely;
5427 * Isar/Pure: new derived language element 'obtain' supports
5428 generalized existence reasoning;
5430 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5431 support accumulation of results, without applying any rules yet;
5432 useful to collect intermediate results without explicit name
5433 references, and for use with transitivity rules with more than 2
5436 * Isar/Pure: scalable support for case-analysis type proofs: new
5437 'case' language element refers to local contexts symbolically, as
5438 produced by certain proof methods; internally, case names are attached
5439 to theorems as "tags";
5441 * Isar/Pure: theory command 'hide' removes declarations from
5442 class/type/const name spaces;
5444 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5445 indicate potential overloading;
5447 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5449 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5450 "{a,b,c}" instead of {a,b,c};
5452 * Isar/Pure now provides its own version of intro/elim/dest
5453 attributes; useful for building new logics, but beware of confusion
5454 with the version in Provers/classical;
5456 * Isar/Pure: the local context of (non-atomic) goals is provided via
5457 case name 'antecedent';
5459 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5460 to the current context is now done automatically);
5462 * Isar/Pure: theory command 'method_setup' provides a simple interface
5463 for definining proof methods in ML;
5465 * Isar/Provers: intro/elim/dest attributes changed; renamed
5466 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5467 most cases, one should have to change intro!! to intro? only);
5468 replaced "delrule" by "rule del";
5470 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5471 'symmetric' attribute (the latter supercedes [RS sym]);
5473 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5474 method modifier); 'simp' method: 'only:' modifier removes loopers as
5475 well (including splits);
5477 * Isar/Provers: Simplifier and Classical methods now support all kind
5478 of modifiers used in the past, including 'cong', 'iff', etc.
5480 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5481 of Simplifier and Classical reasoner);
5483 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5484 now support named cases; major packages (inductive, datatype, primrec,
5485 recdef) support case names and properly name parameters;
5487 * Isar/HOL: new transitivity rules for substitution in inequalities --
5488 monotonicity conditions are extracted to be proven at end of
5491 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5494 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5495 split_if split_if_asm; datatype package provides theorems foo.splits =
5496 foo.split foo.split_asm for each datatype;
5498 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5499 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5500 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5501 use "(cases (simplified))" method in proper proof texts);
5503 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5505 * Isar: names of theorems etc. may be natural numbers as well;
5507 * Isar: 'pr' command: optional arguments for goals_limit and
5508 ProofContext.prems_limit; no longer prints theory contexts, but only
5511 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5512 additional print modes to be specified; e.g. "pr(latex)" will print
5513 proof state according to the Isabelle LaTeX style;
5515 * Isar: improved support for emulating tactic scripts, including proof
5516 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5517 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5518 (for HOL datatypes);
5520 * Isar: simplified (more robust) goal selection of proof methods: 1st
5521 goal, all goals, or explicit goal specifier (tactic emulation); thus
5522 'proof method scripts' have to be in depth-first order;
5524 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5526 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5527 should instead use individual commands for printing items
5528 (print_commands, print_methods etc.);
5530 * Isar: added 'nothing' --- the empty list of theorems;
5535 * HOL/MicroJava: formalization of a fragment of Java, together with a
5536 corresponding virtual machine and a specification of its bytecode
5537 verifier and a lightweight bytecode verifier, including proofs of
5538 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5539 Cornelia Pusch (see also the homepage of project Bali at
5540 http://isabelle.in.tum.de/Bali/);
5542 * HOL/Algebra: new theory of rings and univariate polynomials, by
5545 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5546 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5549 * HOL/Lattice: fundamental concepts of lattice theory and order
5550 structures, including duals, properties of bounds versus algebraic
5551 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5552 Theorem for complete lattices etc.; may also serve as a demonstration
5553 for abstract algebraic reasoning using axiomatic type classes, and
5554 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5556 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5559 * HOL/IMPP: extension of IMP with local variables and mutually
5560 recursive procedures, by David von Oheimb;
5562 * HOL/Lambda: converted into new-style theory and document;
5564 * HOL/ex/Multiquote: example of multiple nested quotations and
5565 anti-quotations -- basically a generalized version of de-Bruijn
5566 representation; very useful in avoiding lifting of operations;
5568 * HOL/record: added general record equality rule to simpset; fixed
5569 select-update simplification procedure to handle extended records as
5570 well; admit "r" as field name;
5572 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5573 other numeric types and also as the identity of groups, rings, etc.;
5575 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5576 Types nat and int belong to this axclass;
5578 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5579 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5580 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5581 two terms #m*u and #n*u are replaced by #(m+n)*u
5582 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5583 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5584 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5586 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5587 powerful prover for predicate logic but knows nothing of clasets; see
5588 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5590 * HOL: new version of "case_tac" subsumes both boolean case split and
5591 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5592 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5594 * HOL: simplification no longer dives into case-expressions: only the
5595 selector expression is simplified, but not the remaining arms; to
5596 enable full simplification of case-expressions for datatype t, you may
5597 remove t.weak_case_cong from the simpset, either globally (Delcongs
5598 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5600 * HOL/recdef: the recursion equations generated by 'recdef' for
5601 function 'f' are now called f.simps instead of f.rules; if all
5602 termination conditions are proved automatically, these simplification
5603 rules are added to the simpset, as in primrec; rules may be named
5604 individually as well, resulting in a separate list of theorems for
5607 * HOL/While is a new theory that provides a while-combinator. It
5608 permits the definition of tail-recursive functions without the
5609 provision of a termination measure. The latter is necessary once the
5610 invariant proof rule for while is applied.
5612 * HOL: new (overloaded) notation for the set of elements below/above
5613 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5615 * HOL: theorems impI, allI, ballI bound as "strip";
5617 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5618 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5619 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5621 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5623 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5624 main HOL, but was unused);
5626 * HOL: fewer consts declared as global (e.g. have to refer to
5627 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5629 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5630 in case of overlap with user translations (e.g. judgements over
5631 tuples); (note that the underlying logical represenation is still
5637 * ZF: simplification automatically cancels common terms in arithmetic
5638 expressions over nat and int;
5640 * ZF: new treatment of nat to minimize type-checking: all operators
5641 coerce their operands to a natural number using the function natify,
5642 making the algebraic laws unconditional;
5644 * ZF: as above, for int: operators coerce their operands to an integer
5645 using the function intify;
5647 * ZF: the integer library now contains many of the usual laws for the
5648 orderings, including $<=, and monotonicity laws for $+ and $*;
5650 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5653 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5654 to the simplifier and classical reasoner simultaneously;
5659 * Provers: blast_tac now handles actual object-logic rules as
5660 assumptions; note that auto_tac uses blast_tac internally as well;
5662 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5663 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5665 * Provers: delrules now handles destruct rules as well (no longer need
5666 explicit make_elim);
5668 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5669 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5670 use instead the strong form,
5671 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5672 in HOL, FOL and ZF the function cla_make_elim will create such rules
5673 from destruct-rules;
5675 * Provers: Simplifier.easy_setup provides a fast path to basic
5676 Simplifier setup for new object-logics;
5678 * Pure: AST translation rules no longer require constant head on LHS;
5680 * Pure: improved name spaces: ambiguous output is qualified; support
5681 for hiding of names;
5683 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5684 XSYMBOL_HOME; no longer need to do manual configuration in most
5687 * system: compression of ML heaps images may now be controlled via -c
5688 option of isabelle and isatool usedir (currently only observed by
5691 * system: isatool installfonts may handle X-Symbol fonts as well (very
5692 useful for remote X11);
5694 * system: provide TAGS file for Isabelle sources;
5696 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
5699 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
5700 timing flag supersedes proof_timing and Toplevel.trace;
5702 * ML: new combinators |>> and |>>> for incremental transformations
5703 with secondary results (e.g. certain theory extensions):
5705 * ML: PureThy.add_defs gets additional argument to indicate potential
5706 overloading (usually false);
5708 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
5713 New in Isabelle99 (October 1999)
5714 --------------------------------
5716 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5718 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
5719 are no longer simplified. (This allows the simplifier to unfold recursive
5720 functional programs.) To restore the old behaviour, declare
5722 Delcongs [if_weak_cong];
5724 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
5727 * HOL: the predicate "inj" is now defined by translation to "inj_on";
5729 * HOL/datatype: mutual_induct_tac no longer exists --
5730 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
5732 * HOL/typedef: fixed type inference for representing set; type
5733 arguments now have to occur explicitly on the rhs as type constraints;
5735 * ZF: The con_defs part of an inductive definition may no longer refer
5736 to constants declared in the same theory;
5738 * HOL, ZF: the function mk_cases, generated by the inductive
5739 definition package, has lost an argument. To simplify its result, it
5740 uses the default simpset instead of a supplied list of theorems.
5742 * HOL/List: the constructors of type list are now Nil and Cons;
5744 * Simplifier: the type of the infix ML functions
5745 setSSolver addSSolver setSolver addSolver
5746 is now simpset * solver -> simpset where `solver' is a new abstract type
5747 for packaging solvers. A solver is created via
5748 mk_solver: string -> (thm list -> int -> tactic) -> solver
5749 where the string argument is only a comment.
5754 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
5755 decision procedure for linear arithmetic. Currently it is used for
5756 types `nat', `int', and `real' in HOL (see below); it can, should and
5757 will be instantiated for other types and logics as well.
5759 * The simplifier now accepts rewrite rules with flexible heads, eg
5760 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
5761 They are applied like any rule with a non-pattern lhs, i.e. by first-order
5767 * New Isabelle/Isar subsystem provides an alternative to traditional
5768 tactical theorem proving; together with the ProofGeneral/isar user
5769 interface it offers an interactive environment for developing human
5770 readable proof documents (Isar == Intelligible semi-automated
5771 reasoning); for further information see isatool doc isar-ref,
5772 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
5774 * improved and simplified presentation of theories: better HTML markup
5775 (including colors), graph views in several sizes; isatool usedir now
5776 provides a proper interface for user theories (via -P option); actual
5777 document preparation based on (PDF)LaTeX is available as well (for
5778 new-style theories only); see isatool doc system for more information;
5780 * native support for Proof General, both for classic Isabelle and
5783 * ML function thm_deps visualizes dependencies of theorems and lemmas,
5784 using the graph browser tool;
5786 * Isabelle manuals now also available as PDF;
5788 * theory loader rewritten from scratch (may not be fully
5789 bug-compatible); old loadpath variable has been replaced by show_path,
5790 add_path, del_path, reset_path functions; new operations such as
5791 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
5794 * improved isatool install: option -k creates KDE application icon,
5795 option -p DIR installs standalone binaries;
5797 * added ML_PLATFORM setting (useful for cross-platform installations);
5798 more robust handling of platform specific ML images for SML/NJ;
5800 * the settings environment is now statically scoped, i.e. it is never
5801 created again in sub-processes invoked from isabelle, isatool, or
5804 * path element specification '~~' refers to '$ISABELLE_HOME';
5806 * in locales, the "assumes" and "defines" parts may be omitted if
5809 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
5812 * new print_mode "HTML";
5814 * new flag show_tags controls display of tags of theorems (which are
5815 basically just comments that may be attached by some tools);
5817 * Isamode 2.6 requires patch to accomodate change of Isabelle font
5818 mode and goal output format:
5820 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
5822 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
5824 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
5825 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
5827 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
5829 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
5831 * function bind_thms stores lists of theorems (cf. bind_thm);
5833 * new shorthand tactics ftac, eatac, datac, fatac;
5835 * qed (and friends) now accept "" as result name; in that case the
5836 theorem is not stored, but proper checks and presentation of the
5839 * theorem database now also indexes constants "Trueprop", "all",
5840 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
5845 ** HOL arithmetic **
5847 * There are now decision procedures for linear arithmetic over nat and
5850 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
5851 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
5852 are treated as atomic; subformulae not involving type `nat' or `int'
5853 are ignored; quantified subformulae are ignored unless they are
5854 positive universal or negative existential. The tactic has to be
5855 invoked by hand and can be a little bit slow. In particular, the
5856 running time is exponential in the number of occurrences of `min' and
5857 `max', and `-' on `nat'.
5859 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
5860 (negated) (in)equalities among the premises and the conclusion into
5861 account (i.e. no compound formulae) and does not know about `min' and
5862 `max', and `-' on `nat'. It is fast and is used automatically by the
5865 NB: At the moment, these decision procedures do not cope with mixed
5866 nat/int formulae where the two parts interact, such as `m < n ==>
5869 * HOL/Numeral provides a generic theory of numerals (encoded
5870 efficiently as bit strings); setup for types nat/int/real is in place;
5871 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
5872 int, existing theories and proof scripts may require a few additional
5875 * integer division and remainder can now be performed on constant
5878 * many properties of integer multiplication, division and remainder
5881 * An interface to the Stanford Validity Checker (SVC) is available through the
5882 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
5883 are proved automatically. SVC must be installed separately, and its results
5884 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
5885 invocation of the underlying oracle). For SVC see
5886 http://verify.stanford.edu/SVC
5888 * IsaMakefile: the HOL-Real target now builds an actual image;
5893 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
5894 (in Isabelle/Isar) -- by Gertrud Bauer;
5896 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
5897 analysis for assembly languages with subtypes;
5899 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
5900 -- avoids syntactic ambiguities and treats state, transition, and
5901 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
5902 changed syntax and (many) tactics;
5904 * HOL/inductive: Now also handles more general introduction rules such
5905 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
5906 theorems are now maintained within the theory (maintained via the
5909 * HOL/datatype: Now also handles arbitrarily branching datatypes
5910 (using function types) such as
5912 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
5914 * HOL/record: record_simproc (part of the default simpset) takes care
5915 of selectors applied to updated records; record_split_tac is no longer
5916 part of the default claset; update_defs may now be removed from the
5917 simpset in many cases; COMPATIBILITY: old behavior achieved by
5919 claset_ref () := claset() addSWrapper record_split_wrapper;
5920 Delsimprocs [record_simproc]
5922 * HOL/typedef: fixed type inference for representing set; type
5923 arguments now have to occur explicitly on the rhs as type constraints;
5925 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
5926 names rather than an ML expression;
5928 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
5929 supplied later. Program schemes can be defined, such as
5930 "While B C s = (if B s then While B C (C s) else s)"
5931 where the well-founded relation can be chosen after B and C have been given.
5933 * HOL/List: the constructors of type list are now Nil and Cons;
5934 INCOMPATIBILITY: while [] and infix # syntax is still there, of
5935 course, ML tools referring to List.list.op # etc. have to be adapted;
5937 * HOL_quantifiers flag superseded by "HOL" print mode, which is
5938 disabled by default; run isabelle with option -m HOL to get back to
5939 the original Gordon/HOL-style output;
5941 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
5942 ALL x<=y. P, EX x<y. P, EX x<=y. P;
5944 * HOL basic syntax simplified (more orthogonal): all variants of
5945 All/Ex now support plain / symbolic / HOL notation; plain syntax for
5946 Eps operator is provided as well: "SOME x. P[x]";
5948 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
5950 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
5951 thus available for user theories;
5953 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
5954 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
5957 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
5958 several times and then mp;
5963 * the notation <<...>> is now available as a notation for sequences of
5966 * the simplifier is now installed
5968 * the axiom system has been generalized (thanks to Soren Heilmann)
5970 * the classical reasoner now has a default rule database
5975 * new primrec section allows primitive recursive functions to be given
5976 directly (as in HOL) over datatypes and the natural numbers;
5978 * new tactics induct_tac and exhaust_tac for induction (or case
5979 analysis) over datatypes and the natural numbers;
5981 * the datatype declaration of type T now defines the recursor T_rec;
5983 * simplification automatically does freeness reasoning for datatype
5986 * automatic type-inference, with AddTCs command to insert new
5987 type-checking rules;
5989 * datatype introduction rules are now added as Safe Introduction rules
5992 * the syntax "if P then x else y" is now available in addition to
5996 *** Internal programming interfaces ***
5998 * tuned simplifier trace output; new flag debug_simp;
6000 * structures Vartab / Termtab (instances of TableFun) offer efficient
6001 tables indexed by indexname_ord / term_ord (compatible with aconv);
6003 * AxClass.axclass_tac lost the theory argument;
6005 * tuned current_goals_markers semantics: begin / end goal avoids
6006 printing empty lines;
6008 * removed prs and prs_fn hook, which was broken because it did not
6009 include \n in its semantics, forcing writeln to add one
6010 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6011 string -> unit if you really want to output text without newline;
6013 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6014 plain output, interface builders may have to enable 'isabelle_font'
6015 mode to get Isabelle font glyphs as before;
6017 * refined token_translation interface; INCOMPATIBILITY: output length
6018 now of type real instead of int;
6020 * theory loader actions may be traced via new ThyInfo.add_hook
6021 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6022 your own database of information attached to *whole* theories -- as
6023 opposed to intra-theory data slots offered via TheoryDataFun;
6025 * proper handling of dangling sort hypotheses (at last!);
6026 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6027 extra sort hypotheses that can be witnessed from the type signature;
6028 the force_strip_shyps flag is gone, any remaining shyps are simply
6029 left in the theorem (with a warning issued by strip_shyps_warning);
6033 New in Isabelle98-1 (October 1998)
6034 ----------------------------------
6036 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6038 * several changes of automated proof tools;
6040 * HOL: major changes to the inductive and datatype packages, including
6041 some minor incompatibilities of theory syntax;
6043 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6046 * HOL: removed duplicate thms in Arith:
6047 less_imp_add_less should be replaced by trans_less_add1
6048 le_imp_add_le should be replaced by trans_le_add1
6050 * HOL: unary minus is now overloaded (new type constraints may be
6053 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6054 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6055 now taken as an integer constant.
6057 * Pure: ML function 'theory_of' renamed to 'theory';
6063 1. Asm_full_simp_tac is now more aggressive.
6064 1. It will sometimes reorient premises if that increases their power to
6066 2. It does no longer proceed strictly from left to right but may also
6067 rotate premises to achieve further simplification.
6068 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6069 old Asm_full_simp_tac in that it does not rotate premises.
6070 2. The simplifier now knows a little bit about nat-arithmetic.
6072 * Classical reasoner: wrapper mechanism for the classical reasoner now
6073 allows for selected deletion of wrappers, by introduction of names for
6074 wrapper functionals. This implies that addbefore, addSbefore,
6075 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6076 and that adding two tactics with the same name overwrites the first
6077 one (emitting a warning).
6078 type wrapper = (int -> tactic) -> (int -> tactic)
6079 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6080 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6081 delWrapper, delSWrapper: claset * string -> claset
6082 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6084 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6085 semantics; addbefore now affects only the unsafe part of step_tac
6086 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6087 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6090 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6091 compWrapper; added safe wrapper (and access functions for it);
6093 * HOL/split_all_tac is now much faster and fails if there is nothing
6094 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6095 and the names of the automatically generated variables have changed.
6096 split_all_tac has moved within claset() from unsafe wrappers to safe
6097 wrappers, which means that !!-bound variables are split much more
6098 aggressively, and safe_tac and clarify_tac now split such variables.
6099 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6100 Note: the same holds for record_split_tac, which does the job of
6101 split_all_tac for record fields.
6103 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6104 permanently to the default simpset using Addsplits just like
6105 Addsimps. They can be removed via Delsplits just like
6106 Delsimps. Lower-case versions are also available.
6108 * HOL/Simplifier: The rule split_if is now part of the default
6109 simpset. This means that the simplifier will eliminate all occurrences
6110 of if-then-else in the conclusion of a goal. To prevent this, you can
6111 either remove split_if completely from the default simpset by
6112 `Delsplits [split_if]' or remove it in a specific call of the
6113 simplifier using `... delsplits [split_if]'. You can also add/delete
6114 other case splitting rules to/from the default simpset: every datatype
6115 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6116 t is the name of the datatype).
6118 * Classical reasoner / Simplifier combination: new force_tac (and
6119 derivatives Force_tac, force) combines rewriting and classical
6120 reasoning (and whatever other tools) similarly to auto_tac, but is
6121 aimed to solve the given subgoal completely.
6126 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6127 and `goalw': the theory is no longer needed as an explicit argument -
6128 the current theory context is used; assumptions are no longer returned
6129 at the ML-level unless one of them starts with ==> or !!; it is
6130 recommended to convert to these new commands using isatool fixgoal
6131 (backup your sources first!);
6133 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6134 the current theory context, and 'theory' to lookup stored theories;
6136 * new theory section 'locale' for declaring constants, assumptions and
6137 definitions that have local scope;
6139 * new theory section 'nonterminals' for purely syntactic types;
6141 * new theory section 'setup' for generic ML setup functions
6142 (e.g. package initialization);
6144 * the distribution now includes Isabelle icons: see
6145 lib/logo/isabelle-{small,tiny}.xpm;
6147 * isatool install - install binaries with absolute references to
6150 * isatool logo -- create instances of the Isabelle logo (as EPS);
6152 * print mode 'emacs' reserved for Isamode;
6154 * support multiple print (ast) translations per constant name;
6156 * theorems involving oracles are now printed with a suffixed [!];
6161 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6163 * HOL/inductive package reorganized and improved: now supports mutual
6169 oddI "n : EVEN ==> Suc n : ODD"
6170 evenI "n : ODD ==> Suc n : EVEN"
6172 new theorem list "elims" contains an elimination rule for each of the
6173 recursive sets; inductive definitions now handle disjunctive premises
6174 correctly (also ZF);
6176 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6177 "mutual_induct" no longer exists - the induction rule is always
6178 contained in "induct";
6181 * HOL/datatype package re-implemented and greatly improved: now
6182 supports mutually recursive datatypes such as
6185 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6186 | SUM ('a aexp) ('a aexp)
6187 | DIFF ('a aexp) ('a aexp)
6190 'a bexp = LESS ('a aexp) ('a aexp)
6191 | AND ('a bexp) ('a bexp)
6192 | OR ('a bexp) ('a bexp)
6194 as well as indirectly recursive datatypes such as
6197 ('a, 'b) term = Var 'a
6198 | App 'b ((('a, 'b) term) list)
6200 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6201 induction on mutually / indirectly recursive datatypes.
6203 Primrec equations are now stored in theory and can be accessed via
6204 <function_name>.simps.
6208 - Theories using datatypes must now have theory Datatype as an
6210 - The specific <typename>.induct_tac no longer exists - use the
6211 generic induct_tac instead.
6212 - natE has been renamed to nat.exhaust - use exhaust_tac
6213 instead of res_inst_tac ... natE. Note that the variable
6214 names in nat.exhaust differ from the names in natE, this
6215 may cause some "fragile" proofs to fail.
6216 - The theorems split_<typename>_case and split_<typename>_case_asm
6217 have been renamed to <typename>.split and <typename>.split_asm.
6218 - Since default sorts of type variables are now handled correctly,
6219 some datatype definitions may have to be annotated with explicit
6221 - Primrec definitions no longer require function name and type
6222 of recursive argument.
6224 Consider using isatool fixdatatype to adapt your theories and proof
6225 scripts to the new package (backup your sources first!).
6228 * HOL/record package: considerably improved implementation; now
6229 includes concrete syntax for record types, terms, updates; theorems
6230 for surjective pairing and splitting !!-bound record variables; proof
6231 support is as follows:
6233 1) standard conversions (selectors or updates applied to record
6234 constructor terms) are part of the standard simpset;
6236 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6237 made part of standard simpset and claset via addIffs;
6239 3) a tactic for record field splitting (record_split_tac) is part of
6240 the standard claset (addSWrapper);
6242 To get a better idea about these rules you may retrieve them via
6243 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6244 the name of your record type.
6246 The split tactic 3) conceptually simplifies by the following rule:
6248 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6250 Thus any record variable that is bound by meta-all will automatically
6251 blow up into some record constructor term, consequently the
6252 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6253 solve record problems automatically.
6256 * reorganized the main HOL image: HOL/Integ and String loaded by
6257 default; theory Main includes everything;
6259 * automatic simplification of integer sums and comparisons, using cancellation;
6261 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6263 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6265 * many new identities for unions, intersections, set difference, etc.;
6267 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6268 called split_if, split_split, split_sum_case and split_nat_case (to go
6269 with add/delsplits);
6271 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6272 (?x::unit) = (); this is made part of the default simpset, which COULD
6273 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6274 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6275 unit_abs_eta_conv is added in order to counter the effect of
6276 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6279 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6282 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6283 It and 'sym RS equals0D' are now in the default claset, giving automatic
6284 disjointness reasoning but breaking a few old proofs.
6286 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6287 to 'converse' from 'inverse' (for compatibility with ZF and some
6290 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6291 the well-founded relation;
6293 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6294 Compl A. The "Compl" syntax remains available as input syntax for this
6297 * HOL/Update: new theory of function updates:
6298 f(a:=b) == %x. if x=a then b else f x
6299 may also be iterated as in f(a:=b,c:=d,...);
6301 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6304 - new function list_update written xs[i:=v] that updates the i-th
6305 list position. May also be iterated as in xs[i:=a,j:=b,...].
6306 - new function `upt' written [i..j(] which generates the list
6307 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6308 bound write [i..j], which is a shorthand for [i..j+1(].
6309 - new lexicographic orderings and corresponding wellfoundedness theorems.
6312 - removed 'pred' (predecessor) function;
6313 - generalized some theorems about n-1;
6314 - many new laws about "div" and "mod";
6315 - new laws about greatest common divisors (see theory ex/Primes);
6317 * HOL/Relation: renamed the relational operator r^-1 "converse"
6318 instead of "inverse";
6320 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6321 of the multiset ordering;
6323 * directory HOL/Real: a construction of the reals using Dedekind cuts
6324 (not included by default);
6326 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6328 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6329 programs, i.e. different program variables may have different types.
6331 * calling (stac rew i) now fails if "rew" has no effect on the goal
6332 [previously, this check worked only if the rewrite rule was unconditional]
6333 Now rew can involve either definitions or equalities (either == or =).
6338 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6339 only the theorems proved on ZF.ML;
6341 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6342 It and 'sym RS equals0D' are now in the default claset, giving automatic
6343 disjointness reasoning but breaking a few old proofs.
6345 * ZF/Update: new theory of function updates
6346 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6347 may also be iterated as in f(a:=b,c:=d,...);
6349 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6351 * calling (stac rew i) now fails if "rew" has no effect on the goal
6352 [previously, this check worked only if the rewrite rule was unconditional]
6353 Now rew can involve either definitions or equalities (either == or =).
6355 * case_tac provided for compatibility with HOL
6356 (like the old excluded_middle_tac, but with subgoals swapped)
6359 *** Internal programming interfaces ***
6361 * Pure: several new basic modules made available for general use, see
6362 also src/Pure/README;
6364 * improved the theory data mechanism to support encapsulation (data
6365 kind name replaced by private Object.kind, acting as authorization
6366 key); new type-safe user interface via functor TheoryDataFun; generic
6367 print_data function becomes basically useless;
6369 * removed global_names compatibility flag -- all theory declarations
6370 are qualified by default;
6372 * module Pure/Syntax now offers quote / antiquote translation
6373 functions (useful for Hoare logic etc. with implicit dependencies);
6374 see HOL/ex/Antiquote for an example use;
6376 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6379 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6382 * Display.print_goals function moved to Locale.print_goals;
6384 * standard print function for goals supports current_goals_markers
6385 variable for marking begin of proof, end of proof, start of goal; the
6386 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6387 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6392 New in Isabelle98 (January 1998)
6393 --------------------------------
6395 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6397 * changed lexical syntax of terms / types: dots made part of long
6398 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6400 * simpset (and claset) reference variable replaced by functions
6401 simpset / simpset_ref;
6403 * no longer supports theory aliases (via merge) and non-trivial
6404 implicit merge of thms' signatures;
6406 * most internal names of constants changed due to qualified names;
6408 * changed Pure/Sequence interface (see Pure/seq.ML);
6411 *** General Changes ***
6413 * hierachically structured name spaces (for consts, types, axms, thms
6414 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6415 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6416 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6417 long_names for fully qualified output names; NOTE: ML programs
6418 (special tactics, packages etc.) referring to internal names may have
6419 to be adapted to cope with fully qualified names; in case of severe
6420 backward campatibility problems try setting 'global_names' at compile
6421 time to have enrything declared within a flat name space; one may also
6422 fine tune name declarations in theories via the 'global' and 'local'
6425 * reimplemented the implicit simpset and claset using the new anytype
6426 data filed in signatures; references simpset:simpset ref etc. are
6427 replaced by functions simpset:unit->simpset and
6428 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6429 to patch your ML files accordingly;
6431 * HTML output now includes theory graph data for display with Java
6432 applet or isatool browser; data generated automatically via isatool
6433 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6435 * defs may now be conditional; improved rewrite_goals_tac to handle
6436 conditional equations;
6438 * defs now admits additional type arguments, using TYPE('a) syntax;
6440 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6441 creates a new theory node; implicit merge of thms' signatures is
6442 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6443 transfer:theory->thm->thm in (rare) cases;
6445 * improved handling of draft signatures / theories; draft thms (and
6446 ctyps, cterms) are automatically promoted to real ones;
6448 * slightly changed interfaces for oracles: admit many per theory, named
6449 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6451 * print_goals: optional output of const types (set show_consts and
6454 * improved output of warnings (###) and errors (***);
6456 * subgoal_tac displays a warning if the new subgoal has type variables;
6458 * removed old README and Makefiles;
6460 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6462 * removed obsolete init_pps and init_database;
6464 * deleted the obsolete tactical STATE, which was declared by
6465 fun STATE tacfun st = tacfun st st;
6467 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6468 (which abbreviates $HOME);
6470 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6471 use isatool fixseq to adapt your ML programs (this works for fully
6472 qualified references to the Sequence structure only!);
6474 * use_thy no longer requires writable current directory; it always
6475 reloads .ML *and* .thy file, if either one is out of date;
6478 *** Classical Reasoner ***
6480 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6481 tactics that use classical reasoning to simplify a subgoal without
6482 splitting it into several subgoals;
6484 * Safe_tac: like safe_tac but uses the default claset;
6489 * added simplification meta rules:
6490 (asm_)(full_)simplify: simpset -> thm -> thm;
6492 * simplifier.ML no longer part of Pure -- has to be loaded by object
6495 * added prems argument to simplification procedures;
6497 * HOL, FOL, ZF: added infix function `addsplits':
6498 instead of `<simpset> setloop (split_tac <thms>)'
6499 you can simply write `<simpset> addsplits <thms>'
6504 * TYPE('a) syntax for type reflection terms;
6506 * no longer handles consts with name "" -- declare as 'syntax' instead;
6508 * pretty printer: changed order of mixfix annotation preference (again!);
6510 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6515 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6516 with `addloop' of the simplifier to faciliate case splitting in premises.
6518 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6520 * HOL/Auth: new protocol proofs including some for the Internet
6523 * HOL/Map: new theory of `maps' a la VDM;
6525 * HOL/simplifier: simplification procedures nat_cancel_sums for
6526 cancelling out common nat summands from =, <, <= (in)equalities, or
6527 differences; simplification procedures nat_cancel_factor for
6528 cancelling common factor from =, <, <= (in)equalities over natural
6529 sums; nat_cancel contains both kinds of procedures, it is installed by
6530 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6532 * HOL/simplifier: terms of the form
6533 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6535 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6536 and those of the form
6537 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6539 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6542 Each datatype `t' now comes with a theorem `split_t_case' of the form
6544 P(t_case f1 ... fn x) =
6545 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6547 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6550 and a theorem `split_t_case_asm' of the form
6552 P(t_case f1 ... fn x) =
6553 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6555 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6557 which can be added to a simpset via `addsplits'. The existing theorems
6558 expand_list_case and expand_option_case have been renamed to
6559 split_list_case and split_option_case.
6562 - `pred n' is automatically converted to `n-1'.
6563 Users are strongly encouraged not to use `pred' any longer,
6564 because it will disappear altogether at some point.
6565 - Users are strongly encouraged to write "0 < n" rather than
6566 "n ~= 0". Theorems and proof tools have been modified towards this
6570 the function "set_of_list" has been renamed "set" (and its theorems too);
6571 the function "nth" now takes its arguments in the reverse order and
6572 has acquired the infix notation "!" as in "xs!n".
6574 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6576 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6577 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6579 * HOL/record: extensible records with schematic structural subtyping
6580 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6581 still lacks various theorems and concrete record syntax;
6586 * removed "axioms" and "generated by" sections;
6588 * replaced "ops" section by extended "consts" section, which is capable of
6589 handling the continuous function space "->" directly;
6592 . proves theorems immediately and stores them in the theory,
6593 . creates hierachical name space,
6594 . now uses normal mixfix annotations (instead of cinfix...),
6595 . minor changes to some names and values (for consistency),
6596 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6597 . separator between mutual domain defs: changed "," to "and",
6598 . improved handling of sort constraints; now they have to
6599 appear on the left-hand side of the equations only;
6601 * fixed LAM <x,y,zs>.b syntax;
6603 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6604 adm (%x. P (t x)), where P is chainfinite and t continuous;
6609 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6610 with `addloop' of the simplifier to faciliate case splitting in premises.
6612 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6613 in HOL, they strip ALL and --> from proved theorems;
6617 New in Isabelle94-8 (May 1997)
6618 ------------------------------
6620 *** General Changes ***
6622 * new utilities to build / run / maintain Isabelle etc. (in parts
6623 still somewhat experimental); old Makefiles etc. still functional;
6625 * new 'Isabelle System Manual';
6627 * INSTALL text, together with ./configure and ./build scripts;
6629 * reimplemented type inference for greater efficiency, better error
6630 messages and clean internal interface;
6632 * prlim command for dealing with lots of subgoals (an easier way of
6633 setting goals_limit);
6638 * supports alternative (named) syntax tables (parser and pretty
6639 printer); internal interface is provided by add_modesyntax(_i);
6641 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6642 be used in conjunction with the Isabelle symbol font; uses the
6643 "symbols" syntax table;
6645 * added token_translation interface (may translate name tokens in
6646 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6647 the current print_mode); IMPORTANT: user print translation functions
6648 are responsible for marking newly introduced bounds
6649 (Syntax.mark_boundT);
6651 * token translations for modes "xterm" and "xterm_color" that display
6652 names in bold, underline etc. or colors (which requires a color
6655 * infixes may now be declared with names independent of their syntax;
6657 * added typed_print_translation (like print_translation, but may
6658 access type of constant);
6661 *** Classical Reasoner ***
6663 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6664 some limitations. Blast_tac...
6665 + ignores addss, addbefore, addafter; this restriction is intrinsic
6666 + ignores elimination rules that don't have the correct format
6667 (the conclusion MUST be a formula variable)
6668 + ignores types, which can make HOL proofs fail
6669 + rules must not require higher-order unification, e.g. apply_type in ZF
6670 [message "Function Var's argument not a bound variable" relates to this]
6671 + its proof strategy is more general but can actually be slower
6673 * substitution with equality assumptions no longer permutes other
6676 * minor changes in semantics of addafter (now called addaltern); renamed
6677 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6678 (and access functions for it);
6680 * improved combination of classical reasoner and simplifier:
6681 + functions for handling clasimpsets
6682 + improvement of addss: now the simplifier is called _after_ the
6684 + safe variant of addss called addSss: uses safe simplifications
6685 _during_ the safe steps. It is more complete as it allows multiple
6686 instantiations of unknowns (e.g. with slow_tac).
6690 * added interface for simplification procedures (functions that
6691 produce *proven* rewrite rules on the fly, depending on current
6694 * ordering on terms as parameter (used for ordered rewriting);
6696 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
6698 * the solver is now split into a safe and an unsafe part.
6699 This should be invisible for the normal user, except that the
6700 functions setsolver and addsolver have been renamed to setSolver and
6701 addSolver; added safe_asm_full_simp_tac;
6706 * a generic induction tactic `induct_tac' which works for all datatypes and
6707 also for type `nat';
6709 * a generic case distinction tactic `exhaust_tac' which works for all
6710 datatypes and also for type `nat';
6712 * each datatype comes with a function `size';
6714 * patterns in case expressions allow tuple patterns as arguments to
6715 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
6717 * primrec now also works with type nat;
6719 * recdef: a new declaration form, allows general recursive functions to be
6720 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
6722 * the constant for negation has been renamed from "not" to "Not" to
6723 harmonize with FOL, ZF, LK, etc.;
6725 * HOL/ex/LFilter theory of a corecursive "filter" functional for
6728 * HOL/Modelcheck demonstrates invocation of model checker oracle;
6730 * HOL/ex/Ring.thy declares cring_simp, which solves equational
6731 problems in commutative rings, using axiomatic type classes for + and *;
6733 * more examples in HOL/MiniML and HOL/Auth;
6735 * more default rewrite rules for quantifiers, union/intersection;
6737 * a new constant `arbitrary == @x.False';
6739 * HOLCF/IOA replaces old HOL/IOA;
6741 * HOLCF changes: derived all rules and arities
6742 + axiomatic type classes instead of classes
6743 + typedef instead of faking type definitions
6744 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
6745 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
6746 + eliminated the types void, one, tr
6747 + use unit lift and bool lift (with translations) instead of one and tr
6748 + eliminated blift from Lift3.thy (use Def instead of blift)
6749 all eliminated rules are derived as theorems --> no visible changes ;
6754 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
6755 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
6756 as ZF_cs addSIs [equalityI];
6760 New in Isabelle94-7 (November 96)
6761 ---------------------------------
6763 * allowing negative levels (as offsets) in prlev and choplev;
6765 * super-linear speedup for large simplifications;
6767 * FOL, ZF and HOL now use miniscoping: rewriting pushes
6768 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
6769 FAIL); can suppress it using the command Delsimps (ex_simps @
6770 all_simps); De Morgan laws are also now included, by default;
6772 * improved printing of ==> : ~:
6774 * new object-logic "Sequents" adds linear logic, while replacing LK
6775 and Modal (thanks to Sara Kalvala);
6777 * HOL/Auth: correctness proofs for authentication protocols;
6779 * HOL: new auto_tac combines rewriting and classical reasoning (many
6780 examples on HOL/Auth);
6782 * HOL: new command AddIffs for declaring theorems of the form P=Q to
6783 the rewriter and classical reasoner simultaneously;
6785 * function uresult no longer returns theorems in "standard" format;
6786 regain previous version by: val uresult = standard o uresult;
6793 * oracles -- these establish an interface between Isabelle and trusted
6794 external reasoners, which may deliver results as theorems;
6796 * proof objects (in particular record all uses of oracles);
6798 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
6800 * "constdefs" section in theory files;
6802 * "primrec" section (HOL) no longer requires names;
6804 * internal type "tactic" now simply "thm -> thm Sequence.seq";
6811 * reduced space requirements;
6813 * automatic HTML generation from theories;
6815 * theory files no longer require "..." (quotes) around most types;
6817 * new examples, including two proofs of the Church-Rosser theorem;
6819 * non-curried (1994) version of HOL is no longer distributed;
6826 * greatly reduced space requirements;
6828 * theory files (.thy) no longer require \...\ escapes at line breaks;
6830 * searchable theorem database (see the section "Retrieving theorems" on
6831 page 8 of the Reference Manual);
6833 * new examples, including Grabczewski's monumental case study of the
6836 * The previous version of HOL renamed to Old_HOL;
6838 * The new version of HOL (previously called CHOL) uses a curried syntax
6839 for functions. Application looks like f a b instead of f(a,b);
6841 * Mutually recursive inductive definitions finally work in HOL;
6843 * In ZF, pattern-matching on tuples is now available in all abstractions and
6844 translates to the operator "split";
6851 * new infix operator, addss, allowing the classical reasoner to
6852 perform simplification at each step of its search. Example:
6853 fast_tac (cs addss ss)
6855 * a new logic, CHOL, the same as HOL, but with a curried syntax
6856 for functions. Application looks like f a b instead of f(a,b). Also pairs
6857 look like (a,b) instead of <a,b>;
6859 * PLEASE NOTE: CHOL will eventually replace HOL!
6861 * In CHOL, pattern-matching on tuples is now available in all abstractions.
6862 It translates to the operator "split". A new theory of integers is available;
6864 * In ZF, integer numerals now denote two's-complement binary integers.
6865 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
6867 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
6868 of the Axiom of Choice;
6875 * Significantly faster resolution;
6877 * the different sections in a .thy file can now be mixed and repeated
6880 * Database of theorems for FOL, HOL and ZF. New
6881 commands including qed, qed_goal and bind_thm store theorems in the database.
6883 * Simple database queries: return a named theorem (get_thm) or all theorems of
6884 a given theory (thms_of), or find out what theory a theorem was proved in
6887 * Bugs fixed in the inductive definition and datatype packages;
6889 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
6890 and HOL_dup_cs obsolete;
6892 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
6895 * Simpler definition of function space in ZF;
6897 * new results about cardinal and ordinal arithmetic in ZF;
6899 * 'subtype' facility in HOL for introducing new types as subsets of existing
6902 :mode=text:wrap=hard:maxLineLen=72: