Propagation of mixins for interpretation; reactivated diagnostic command print_interps.
1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
10 one backslash should be used, even in ML sources.
15 * On instantiation of classes, remaining undefined class parameters
16 are formally declared. INCOMPATIBILITY.
21 * New proof method "sos" (sum of squares) for nonlinear real arithmetic
22 (originally due to John Harison). It requires Library/Sum_Of_Squares.
23 It is not a complete decision procedure but works well in practice
24 on quantifier-free real arithmetic with +, -, *, ^, =, <= and <,
25 i.e. boolean combinations of equalities and inequalities between
26 polynomials. It makes use of external semidefinite programming solvers.
27 For more information and examples see Library/Sum_Of_Squares.
29 * Set.UNIV and Set.empty are mere abbreviations for top and bot. INCOMPATIBILITY.
31 * More convenient names for set intersection and union. INCOMPATIBILITY:
36 * Code generator attributes follow the usual underscore convention:
37 code_unfold replaces code unfold
38 code_post replaces code post
42 * New quickcheck implementation using new code generator.
44 * New class "boolean_algebra".
46 * Refinements to lattices classes:
47 - added boolean_algebra type class
48 - less default intro/elim rules in locale variant, more default
49 intro/elim rules in class variant: more uniformity
50 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with le_inf_iff
51 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and sup_aci)
52 - renamed ACI to inf_sup_aci
53 - class "complete_lattice" moved to separate theory "complete_lattice";
54 corresponding constants renamed:
56 Set.Inf ~> Complete_Lattice.Inf
57 Set.Sup ~> Complete_Lattice.Sup
58 Set.INFI ~> Complete_Lattice.INFI
59 Set.SUPR ~> Complete_Lattice.SUPR
60 Set.Inter ~> Complete_Lattice.Inter
61 Set.Union ~> Complete_Lattice.Union
62 Set.INTER ~> Complete_Lattice.INTER
63 Set.UNION ~> Complete_Lattice.UNION
67 * Class semiring_div requires superclass no_zero_divisors and proof of
68 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
69 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
70 generalized to class semiring_div, subsuming former theorems
71 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
72 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
75 * Power operations on relations and functions are now one dedicate
76 constant compow with infix syntax "^^". Power operations on
77 multiplicative monoids retains syntax "^" and is now defined generic
78 in class power. INCOMPATIBILITY.
80 * Relation composition "R O S" now has a "more standard" argument order,
81 i.e., "R O S = {(x,z). EX y. (x,y) : R & (y,z) : S }".
82 INCOMPATIBILITY: Rewrite propositions with "S O R" --> "R O S". Proofs
83 may occationally break, since the O_assoc rule was not rewritten like this.
84 Fix using O_assoc[symmetric].
85 The same applies to the curried version "R OO S".
87 * GCD now has functions Gcd/GCD and Lcm/LCM for the gcd and lcm of finite and
88 infinite sets. It is shown that they form a complete lattice.
90 * ML antiquotation @{code_datatype} inserts definition of a datatype
91 generated by the code generator; see Predicate.thy for an example.
93 * New method "linarith" invokes existing linear arithmetic decision
96 * Implementation of quickcheck using generic code generator; default
97 generators are provided for all suitable HOL types, records and
100 * Constants Set.Pow and Set.image now with authentic syntax;
101 object-logic definitions Set.Pow_def and Set.image_def.
105 Suc_eq_add_numeral_1 -> Suc_eq_plus1
106 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
107 Suc_plus1 -> Suc_eq_plus1
109 * New sledgehammer option "Full Types" in Proof General settings menu.
110 Causes full type information to be output to the ATPs. This slows
111 ATPs down considerably but eliminates a source of unsound "proofs"
114 * Discontinued ancient tradition to suffix certain ML module names
115 with "_package", e.g.:
117 DatatypePackage ~> Datatype
118 InductivePackage ~> Inductive
124 * NewNumberTheory: Jeremy Avigad's new version of part of
125 NumberTheory. If possible, use NewNumberTheory, not NumberTheory.
127 * Simplified interfaces of datatype module. INCOMPATIBILITY.
129 * Abbreviation "arbitrary" of "undefined" has disappeared; use
130 "undefined" directly. INCOMPATIBILITY.
132 * New evaluator "approximate" approximates an real valued term using
133 the same method as the approximation method.
135 * Method "approximate" supports now arithmetic expressions as
136 boundaries of intervals and implements interval splitting and Taylor
139 * Changed DERIV_intros to a dynamic fact (via Named_Thms). Each of
140 the theorems in DERIV_intros assumes composition with an additional
141 function and matches a variable to the derivative, which has to be
142 solved by the simplifier. Hence (auto intro!: DERIV_intros) computes
143 the derivative of most elementary terms.
145 * Maclauren.DERIV_tac and Maclauren.deriv_tac was removed, they are
146 replaced by: (auto intro!: DERIV_intros). INCOMPATIBILITY.
151 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
152 parallel tactical reasoning.
154 * Tactical FOCUS is similar to SUBPROOF, but allows the body tactic to
155 introduce new subgoals and schematic variables. FOCUS_PARAMS is
156 similar, but focuses on the parameter prefix only, leaving subgoal
159 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
160 functors have their own ML name space there is no point to mark them
161 separately.) Minor INCOMPATIBILITY.
163 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
165 * Eliminated old Attrib.add_attributes, Method.add_methods and related
166 cominators for "args". INCOMPATIBILITY, need to use simplified
167 Attrib/Method.setup introduced in Isabelle2009.
169 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
170 back on global_simpset_of, global_claset_of, global_clasimpset_of as
171 last resort. INCOMPATIBILITY.
173 * Display.pretty_thm now requires a proper context (cf. former
174 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
175 or even Display.pretty_thm_without_context as last resort.
181 * Support for additional "Isabelle components" via etc/components, see
182 also the system manual.
184 * The isabelle makeall tool now operates on all components with
185 IsaMakefile, not just hardwired "logics".
187 * Discontinued support for Poly/ML 4.x versions.
189 * Removed "compress" option from isabelle-process and isabelle usedir;
190 this is always enabled.
192 * More fine-grained control of proof parallelism, cf.
193 Goal.parallel_proofs in ML and usedir option -q LEVEL.
197 New in Isabelle2009 (April 2009)
198 --------------------------------
202 * Simplified main Isabelle executables, with less surprises on
203 case-insensitive file-systems (such as Mac OS).
205 - The main Isabelle tool wrapper is now called "isabelle" instead of
208 - The former "isabelle" alias for "isabelle-process" has been
209 removed (should rarely occur to regular users).
211 - The former "isabelle-interface" and its alias "Isabelle" have been
212 removed (interfaces are now regular Isabelle tools).
214 Within scripts and make files, the Isabelle environment variables
215 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
216 respectively. (The latter are still available as legacy feature.)
218 The old isabelle-interface wrapper could react in confusing ways if
219 the interface was uninstalled or changed otherwise. Individual
220 interface tool configuration is now more explicit, see also the
221 Isabelle system manual. In particular, Proof General is now available
222 via "isabelle emacs".
224 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
225 purge installed copies of Isabelle executables and re-run "isabelle
226 install -p ...", or use symlinks.
228 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
229 old ~/isabelle, which was slightly non-standard and apt to cause
230 surprises on case-insensitive file-systems (such as Mac OS).
232 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
233 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
234 care is required when using older releases of Isabelle. Note that
235 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
236 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
238 * Proofs of fully specified statements are run in parallel on
239 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
240 a regular 4-core machine, if the initial heap space is made reasonably
241 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
243 * The main reference manuals ("isar-ref", "implementation", and
244 "system") have been updated and extended. Formally checked references
245 as hyperlinks are now available uniformly.
250 * Complete re-implementation of locales. INCOMPATIBILITY in several
251 respects. The most important changes are listed below. See the
252 Tutorial on Locales ("locales" manual) for details.
254 - In locale expressions, instantiation replaces renaming. Parameters
255 must be declared in a for clause. To aid compatibility with previous
256 parameter inheritance, in locale declarations, parameters that are not
257 'touched' (instantiation position "_" or omitted) are implicitly added
258 with their syntax at the beginning of the for clause.
260 - Syntax from abbreviations and definitions in locales is available in
261 locale expressions and context elements. The latter is particularly
262 useful in locale declarations.
264 - More flexible mechanisms to qualify names generated by locale
265 expressions. Qualifiers (prefixes) may be specified in locale
266 expressions, and can be marked as mandatory (syntax: "name!:") or
267 optional (syntax "name?:"). The default depends for plain "name:"
268 depends on the situation where a locale expression is used: in
269 commands 'locale' and 'sublocale' prefixes are optional, in
270 'interpretation' and 'interpret' prefixes are mandatory. The old
271 implicit qualifiers derived from the parameter names of a locale are
274 - Command "sublocale l < e" replaces "interpretation l < e". The
275 instantiation clause in "interpretation" and "interpret" (square
276 brackets) is no longer available. Use locale expressions.
278 - When converting proof scripts, mandatory qualifiers in
279 'interpretation' and 'interpret' should be retained by default, even
280 if this is an INCOMPATIBILITY compared to former behavior. In the
281 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
282 in locale expressions range over a single locale instance only.
284 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
285 In existing theorem specifications replace the includes element by the
286 respective context elements of the included locale, omitting those
287 that are already present in the theorem specification. Multiple
288 assume elements of a locale should be replaced by a single one
289 involving the locale predicate. In the proof body, declarations (most
290 notably theorems) may be regained by interpreting the respective
291 locales in the proof context as required (command "interpret").
293 If using "includes" in replacement of a target solely because the
294 parameter types in the theorem are not as general as in the target,
295 consider declaring a new locale with additional type constraints on
296 the parameters (context element "constrains").
298 - Discontinued "locale (open)". INCOMPATIBILITY.
300 - Locale interpretation commands no longer attempt to simplify goal.
301 INCOMPATIBILITY: in rare situations the generated goal differs. Use
302 methods intro_locales and unfold_locales to clarify.
304 - Locale interpretation commands no longer accept interpretation
305 attributes. INCOMPATIBILITY.
307 * Class declaration: so-called "base sort" must not be given in import
308 list any longer, but is inferred from the specification. Particularly
315 class foo = type + ...
317 * Class target: global versions of theorems stemming do not carry a
318 parameter prefix any longer. INCOMPATIBILITY.
320 * Class 'instance' command no longer accepts attached definitions.
321 INCOMPATIBILITY, use proper 'instantiation' target instead.
323 * Recovered hiding of consts, which was accidentally broken in
324 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
325 makes c inaccessible; consider using ``hide (open) const c'' instead.
327 * Slightly more coherent Pure syntax, with updated documentation in
328 isar-ref manual. Removed locales meta_term_syntax and
329 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
330 INCOMPATIBILITY in rare situations. Note that &&& should not be used
331 directly in regular applications.
333 * There is a new syntactic category "float_const" for signed decimal
334 fractions (e.g. 123.45 or -123.45).
336 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
337 interface with 'setup' command instead.
339 * Command 'local_setup' is similar to 'setup', but operates on a local
342 * The 'axiomatization' command now only works within a global theory
343 context. INCOMPATIBILITY.
345 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
346 hypotheses. Sorts required in the course of reasoning need to be
347 covered by the constraints in the initial statement, completed by the
348 type instance information of the background theory. Non-trivial sort
349 hypotheses, which rarely occur in practice, may be specified via
350 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
352 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
354 The result contains an implicit sort hypotheses as before --
355 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
358 * Generalized Isar history, with support for linear undo, direct state
361 * Changed defaults for unify configuration options:
363 unify_trace_bound = 50 (formerly 25)
364 unify_search_bound = 60 (formerly 30)
366 * Different bookkeeping for code equations (INCOMPATIBILITY):
368 a) On theory merge, the last set of code equations for a particular
369 constant is taken (in accordance with the policy applied by other
370 parts of the code generator framework).
372 b) Code equations stemming from explicit declarations (e.g. code
373 attribute) gain priority over default code equations stemming
374 from definition, primrec, fun etc.
376 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
378 * Unified theorem tables for both code generators. Thus [code
379 func] has disappeared and only [code] remains. INCOMPATIBILITY.
381 * Command 'find_consts' searches for constants based on type and name
384 find_consts "_ => bool"
386 By default, matching is against subtypes, but it may be restricted to
387 the whole type. Searching by name is possible. Multiple queries are
388 conjunctive and queries may be negated by prefixing them with a
391 find_consts strict: "_ => bool" name: "Int" -"int => int"
393 * New 'find_theorems' criterion "solves" matches theorems that
394 directly solve the current goal (modulo higher-order unification).
396 * Auto solve feature for main theorem statements: whenever a new goal
397 is stated, "find_theorems solves" is called; any theorems that could
398 solve the lemma directly are listed as part of the goal state.
399 Cf. associated options in Proof General Isabelle settings menu,
400 enabled by default, with reasonable timeout for pathological cases of
401 higher-order unification.
404 *** Document preparation ***
406 * Antiquotation @{lemma} now imitates a regular terminal proof,
407 demanding keyword 'by' and supporting the full method expression
408 syntax just like the Isar command 'by'.
413 * Integrated main parts of former image HOL-Complex with HOL. Entry
414 points Main and Complex_Main remain as before.
416 * Logic image HOL-Plain provides a minimal HOL with the most important
417 tools available (inductive, datatype, primrec, ...). This facilitates
418 experimentation and tool development. Note that user applications
419 (and library theories) should never refer to anything below theory
422 * Logic image HOL-Main stops at theory Main, and thus facilitates
423 experimentation due to shorter build times.
425 * Logic image HOL-NSA contains theories of nonstandard analysis which
426 were previously part of former HOL-Complex. Entry point Hyperreal
427 remains valid, but theories formerly using Complex_Main should now use
428 new entry point Hypercomplex.
430 * Generic ATP manager for Sledgehammer, based on ML threads instead of
431 Posix processes. Avoids potentially expensive forking of the ML
432 process. New thread-based implementation also works on non-Unix
433 platforms (Cygwin). Provers are no longer hardwired, but defined
434 within the theory via plain ML wrapper functions. Basic Sledgehammer
435 commands are covered in the isar-ref manual.
437 * Wrapper scripts for remote SystemOnTPTP service allows to use
438 sledgehammer without local ATP installation (Vampire etc.). Other
439 provers may be included via suitable ML wrappers, see also
440 src/HOL/ATP_Linkup.thy.
442 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
445 * The metis method no longer fails because the theorem is too trivial
446 (contains the empty clause).
448 * The metis method now fails in the usual manner, rather than raising
449 an exception, if it determines that it cannot prove the theorem.
451 * Method "coherent" implements a prover for coherent logic (see also
452 src/Tools/coherent.ML).
454 * Constants "undefined" and "default" replace "arbitrary". Usually
455 "undefined" is the right choice to replace "arbitrary", though
456 logically there is no difference. INCOMPATIBILITY.
458 * Command "value" now integrates different evaluation mechanisms. The
459 result of the first successful evaluation mechanism is printed. In
460 square brackets a particular named evaluation mechanisms may be
461 specified (currently, [SML], [code] or [nbe]). See further
462 src/HOL/ex/Eval_Examples.thy.
464 * Normalization by evaluation now allows non-leftlinear equations.
465 Declare with attribute [code nbe].
467 * Methods "case_tac" and "induct_tac" now refer to the very same rules
468 as the structured Isar versions "cases" and "induct", cf. the
469 corresponding "cases" and "induct" attributes. Mutual induction rules
470 are now presented as a list of individual projections
471 (e.g. foo_bar.inducts for types foo and bar); the old format with
472 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
473 rare situations a different rule is selected --- notably nested tuple
474 elimination instead of former prod.exhaust: use explicit (case_tac t
475 rule: prod.exhaust) here.
477 * Attributes "cases", "induct", "coinduct" support "del" option.
479 * Removed fact "case_split_thm", which duplicates "case_split".
481 * The option datatype has been moved to a new theory Option. Renamed
482 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
484 * New predicate "strict_mono" classifies strict functions on partial
485 orders. With strict functions on linear orders, reasoning about
486 (in)equalities is facilitated by theorems "strict_mono_eq",
487 "strict_mono_less_eq" and "strict_mono_less".
489 * Some set operations are now proper qualified constants with
490 authentic syntax. INCOMPATIBILITY:
501 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
504 * Auxiliary class "itself" has disappeared -- classes without any
505 parameter are treated as expected by the 'class' command.
507 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
509 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
510 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
512 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
513 method "approximation". It proves formulas on real values by using
514 interval arithmetic. In the formulas are also the transcendental
515 functions sin, cos, tan, atan, ln, exp and the constant pi are
516 allowed. For examples see
517 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
519 * Theory "Reflection" now resides in HOL/Library.
521 * Entry point to Word library now simply named "Word".
524 * Made source layout more coherent with logical distribution
527 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
528 src/HOL/Library/Code_Message.thy ~> src/HOL/
529 src/HOL/Library/GCD.thy ~> src/HOL/
530 src/HOL/Library/Order_Relation.thy ~> src/HOL/
531 src/HOL/Library/Parity.thy ~> src/HOL/
532 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
533 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
534 src/HOL/Real/Lubs.thy ~> src/HOL/
535 src/HOL/Real/PReal.thy ~> src/HOL/
536 src/HOL/Real/Rational.thy ~> src/HOL/
537 src/HOL/Real/RComplete.thy ~> src/HOL/
538 src/HOL/Real/RealDef.thy ~> src/HOL/
539 src/HOL/Real/RealPow.thy ~> src/HOL/
540 src/HOL/Real/Real.thy ~> src/HOL/
541 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
542 src/HOL/Complex/Complex.thy ~> src/HOL/
543 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
544 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
545 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
546 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
547 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
548 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
549 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
550 src/HOL/Hyperreal/Log.thy ~> src/HOL/
551 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
552 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
553 src/HOL/Hyperreal/Series.thy ~> src/HOL/
554 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
555 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
556 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
557 src/HOL/Real/Float ~> src/HOL/Library/
558 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
559 src/HOL/Real/RealVector.thy ~> src/HOL/
561 src/HOL/arith_data.ML ~> src/HOL/Tools
562 src/HOL/hologic.ML ~> src/HOL/Tools
563 src/HOL/simpdata.ML ~> src/HOL/Tools
564 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
565 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
566 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
567 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
568 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
569 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
570 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
572 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
573 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
574 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
575 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
576 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
577 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
579 * If methods "eval" and "evaluation" encounter a structured proof
580 state with !!/==>, only the conclusion is evaluated to True (if
581 possible), avoiding strange error messages.
583 * Method "sizechange" automates termination proofs using (a
584 modification of) the size-change principle. Requires SAT solver. See
585 src/HOL/ex/Termination.thy for examples.
587 * Simplifier: simproc for let expressions now unfolds if bound
588 variable occurs at most once in let expression body. INCOMPATIBILITY.
590 * Method "arith": Linear arithmetic now ignores all inequalities when
591 fast_arith_neq_limit is exceeded, instead of giving up entirely.
593 * New attribute "arith" for facts that should always be used
594 automatically by arithmetic. It is intended to be used locally in
597 assumes [arith]: "x > 0"
599 Global usage is discouraged because of possible performance impact.
601 * New classes "top" and "bot" with corresponding operations "top" and
602 "bot" in theory Orderings; instantiation of class "complete_lattice"
603 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
605 * Changed definition lemma "less_fun_def" in order to provide an
606 instance for preorders on functions; use lemma "less_le" instead.
609 * Theory Orderings: class "wellorder" moved here, with explicit
610 induction rule "less_induct" as assumption. For instantiation of
611 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
614 * Theory Orderings: added class "preorder" as superclass of "order".
615 INCOMPATIBILITY: Instantiation proofs for order, linorder
616 etc. slightly changed. Some theorems named order_class.* now named
619 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
622 * Theory Finite_Set: added a new fold combinator of type
624 ('a => 'b => 'b) => 'b => 'a set => 'b
626 Occasionally this is more convenient than the old fold combinator
627 which is now defined in terms of the new one and renamed to
630 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
631 and "ring_simps" have been replaced by "algebra_simps" (which can be
632 extended with further lemmas!). At the moment both still exist but
633 the former will disappear at some point.
635 * Theory Power: Lemma power_Suc is now declared as a simp rule in
636 class recpower. Type-specific simp rules for various recpower types
637 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
639 rat_power_0 -> power_0
640 rat_power_Suc -> power_Suc
642 realpow_Suc -> power_Suc
643 complexpow_0 -> power_0
644 complexpow_Suc -> power_Suc
645 power_poly_0 -> power_0
646 power_poly_Suc -> power_Suc
648 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
649 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
650 dvd has been generalized to class comm_semiring_1. Likewise a bunch
651 of lemmas from Divides has been generalized from nat to class
652 semiring_div. INCOMPATIBILITY. This involves the following theorem
653 renames resulting from duplicate elimination:
655 dvd_def_mod ~> dvd_eq_mod_eq_0
656 zero_dvd_iff ~> dvd_0_left_iff
658 DIVISION_BY_ZERO_DIV ~> div_by_0
659 DIVISION_BY_ZERO_MOD ~> mod_by_0
660 mult_div ~> div_mult_self2_is_id
661 mult_mod ~> mod_mult_self2_is_0
663 * Theory IntDiv: removed many lemmas that are instances of class-based
664 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
665 rename old lemmas as follows:
667 dvd_diff -> nat_dvd_diff
668 dvd_zminus_iff -> dvd_minus_iff
669 mod_add1_eq -> mod_add_eq
670 mod_mult1_eq -> mod_mult_right_eq
671 mod_mult1_eq' -> mod_mult_left_eq
672 mod_mult_distrib_mod -> mod_mult_eq
673 nat_mod_add_left_eq -> mod_add_left_eq
674 nat_mod_add_right_eq -> mod_add_right_eq
675 nat_mod_div_trivial -> mod_div_trivial
676 nat_mod_mod_trivial -> mod_mod_trivial
677 zdiv_zadd_self1 -> div_add_self1
678 zdiv_zadd_self2 -> div_add_self2
679 zdiv_zmult_self1 -> div_mult_self2_is_id
680 zdiv_zmult_self2 -> div_mult_self1_is_id
681 zdvd_triv_left -> dvd_triv_left
682 zdvd_triv_right -> dvd_triv_right
683 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
684 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
685 zmod_zadd_left_eq -> mod_add_left_eq
686 zmod_zadd_right_eq -> mod_add_right_eq
687 zmod_zadd_self1 -> mod_add_self1
688 zmod_zadd_self2 -> mod_add_self2
689 zmod_zadd1_eq -> mod_add_eq
690 zmod_zdiff1_eq -> mod_diff_eq
691 zmod_zdvd_zmod -> mod_mod_cancel
692 zmod_zmod_cancel -> mod_mod_cancel
693 zmod_zmult_self1 -> mod_mult_self2_is_0
694 zmod_zmult_self2 -> mod_mult_self1_is_0
697 zdvd_abs1 -> abs_dvd_iff
698 zdvd_abs2 -> dvd_abs_iff
699 zdvd_refl -> dvd_refl
700 zdvd_trans -> dvd_trans
702 zdvd_zdiff -> dvd_diff
703 zdvd_zminus_iff -> dvd_minus_iff
704 zdvd_zminus2_iff -> minus_dvd_iff
705 zdvd_zmultD -> dvd_mult_right
706 zdvd_zmultD2 -> dvd_mult_left
707 zdvd_zmult_mono -> mult_dvd_mono
708 zdvd_0_right -> dvd_0_right
709 zdvd_0_left -> dvd_0_left_iff
710 zdvd_1_left -> one_dvd
711 zminus_dvd_iff -> minus_dvd_iff
713 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
715 * The real numbers offer decimal input syntax: 12.34 is translated
716 into 1234/10^2. This translation is not reversed upon output.
718 * Theory Library/Polynomial defines an abstract type 'a poly of
719 univariate polynomials with coefficients of type 'a. In addition to
720 the standard ring operations, it also supports div and mod. Code
721 generation is also supported, using list-style constructors.
723 * Theory Library/Inner_Product defines a class of real_inner for real
724 inner product spaces, with an overloaded operation inner :: 'a => 'a
725 => real. Class real_inner is a subclass of real_normed_vector from
728 * Theory Library/Product_Vector provides instances for the product
729 type 'a * 'b of several classes from RealVector and Inner_Product.
730 Definitions of addition, subtraction, scalar multiplication, norms,
731 and inner products are included.
733 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
734 addition to the field operations, numerals and case syntax are also
737 * Theory Library/Diagonalize provides constructive version of Cantor's
738 first diagonalization argument.
740 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
741 zlcm (for int); carried together from various gcd/lcm developements in
742 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
743 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
744 may recover tupled syntax as follows:
746 hide (open) const gcd
747 abbreviation gcd where
748 "gcd == (%(a, b). GCD.gcd a b)"
750 GCD.gcd ("gcd '(_, _')")
752 The same works for lcm, zgcd, zlcm.
754 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
755 instantiations for algebraic structures. Removed some duplicate
756 theorems. Changes in simp rules. INCOMPATIBILITY.
758 * ML antiquotation @{code} takes a constant as argument and generates
759 corresponding code in background and inserts name of the corresponding
760 resulting ML value/function/datatype constructor binding in place.
761 All occurrences of @{code} with a single ML block are generated
762 simultaneously. Provides a generic and safe interface for
763 instrumentalizing code generation. See
764 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
765 In future you ought to refrain from ad-hoc compiling generated SML
766 code on the ML toplevel. Note that (for technical reasons) @{code}
767 cannot refer to constants for which user-defined serializations are
768 set. Refer to the corresponding ML counterpart directly in that
771 * Command 'rep_datatype': instead of theorem names the command now
772 takes a list of terms denoting the constructors of the type to be
773 represented as datatype. The characteristic theorems have to be
774 proven. INCOMPATIBILITY. Also observe that the following theorems
775 have disappeared in favour of existing ones:
777 unit_induct ~> unit.induct
778 prod_induct ~> prod.induct
779 sum_induct ~> sum.induct
780 Suc_Suc_eq ~> nat.inject
781 Suc_not_Zero Zero_not_Suc ~> nat.distinct
786 * New locales for orders and lattices where the equivalence relation
787 is not restricted to equality. INCOMPATIBILITY: all order and lattice
788 locales use a record structure with field eq for the equivalence.
790 * New theory of factorial domains.
792 * Units_l_inv and Units_r_inv are now simp rules by default.
793 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
794 and/or r_inv will now also require deletion of these lemmas.
796 * Renamed the following theorems, INCOMPATIBILITY:
800 least_carrier ~> least_closed
801 greatest_carrier ~> greatest_closed
802 greatest_Lower_above ~> greatest_Lower_below
803 one_zero ~> carrier_one_zero
804 one_not_zero ~> carrier_one_not_zero (collision with assumption)
809 * Nominal datatypes can now contain type-variables.
811 * Commands 'nominal_inductive' and 'equivariance' work with local
814 * Nominal primrec can now works with local theory targets and its
815 specification syntax now conforms to the general format as seen in
818 * Method "perm_simp" honours the standard simplifier attributes
819 (no_asm), (no_asm_use) etc.
821 * The new predicate #* is defined like freshness, except that on the
822 left hand side can be a set or list of atoms.
824 * Experimental command 'nominal_inductive2' derives strong induction
825 principles for inductive definitions. In contrast to
826 'nominal_inductive', which can only deal with a fixed number of
827 binders, it can deal with arbitrary expressions standing for sets of
828 atoms to be avoided. The only inductive definition we have at the
829 moment that needs this generalisation is the typing rule for Lets in
832 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
833 -----------------------------------------------------------------
834 Gamma |- Let x be t1 in t2 : T2
836 In this rule one wants to avoid all the binders that are introduced by
837 "close Gamma T1". We are looking for other examples where this
838 feature might be useful. Please let us know.
843 * Reimplemented the simplification procedure for proving continuity
844 subgoals. The new simproc is extensible; users can declare additional
845 continuity introduction rules with the attribute [cont2cont].
847 * The continuity simproc now uses a different introduction rule for
848 solving continuity subgoals on terms with lambda abstractions. In
849 some rare cases the new simproc may fail to solve subgoals that the
850 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
851 Potential INCOMPATIBILITY.
853 * Command 'fixrec': specification syntax now conforms to the general
854 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
855 examples. INCOMPATIBILITY.
860 * Proof of Zorn's Lemma for partial orders.
865 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
866 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
867 depends on multithreading, so timouts will not work before Poly/ML
870 * High-level support for concurrent ML programming, see
871 src/Pure/Cuncurrent. The data-oriented model of "future values" is
872 particularly convenient to organize independent functional
873 computations. The concept of "synchronized variables" provides a
874 higher-order interface for components with shared state, avoiding the
875 delicate details of mutexes and condition variables. (Requires
876 Poly/ML 5.2.1 or later.)
878 * ML bindings produced via Isar commands are stored within the Isar
879 context (theory or proof). Consequently, commands like 'use' and 'ML'
880 become thread-safe and work with undo as expected (concerning
881 top-level bindings, not side-effects on global references).
882 INCOMPATIBILITY, need to provide proper Isar context when invoking the
883 compiler at runtime; really global bindings need to be given outside a
884 theory. (Requires Poly/ML 5.2 or later.)
886 * Command 'ML_prf' is analogous to 'ML' but works within a proof
887 context. Top-level ML bindings are stored within the proof context in
888 a purely sequential fashion, disregarding the nested proof structure.
889 ML bindings introduced by 'ML_prf' are discarded at the end of the
890 proof. (Requires Poly/ML 5.2 or later.)
892 * Simplified ML attribute and method setup, cf. functions Attrib.setup
893 and Method.setup, as well as Isar commands 'attribute_setup' and
894 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
895 existing code accordingly, or use plain 'setup' together with old
898 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
899 to 'a -> thm, while results are always tagged with an authentic oracle
900 name. The Isar command 'oracle' is now polymorphic, no argument type
901 is specified. INCOMPATIBILITY, need to simplify existing oracle code
902 accordingly. Note that extra performance may be gained by producing
903 the cterm carefully, avoiding slow Thm.cterm_of.
905 * Simplified interface for defining document antiquotations via
906 ThyOutput.antiquotation, ThyOutput.output, and optionally
907 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
908 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
911 * More systematic treatment of long names, abstract name bindings, and
912 name space operations. Basic operations on qualified names have been
913 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
914 Long_Name.append. Old type bstring has been mostly replaced by
915 abstract type binding (see structure Binding), which supports precise
916 qualification by packages and local theory targets, as well as proper
917 tracking of source positions. INCOMPATIBILITY, need to wrap old
918 bstring values into Binding.name, or better pass through abstract
919 bindings everywhere. See further src/Pure/General/long_name.ML,
920 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
922 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
923 LocalTheory.note etc.) now refer to the *full* internal name, not the
924 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
926 * Disposed old type and term read functions (Sign.read_def_typ,
927 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
928 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
929 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
930 Syntax.read_term_global etc.; see also OldGoals.read_term as last
931 resort for legacy applications.
933 * Disposed old declarations, tactics, tactic combinators that refer to
934 the simpset or claset of an implicit theory (such as Addsimps,
935 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
936 embedded ML text, or local_simpset_of with a proper context passed as
937 explicit runtime argument.
939 * Rules and tactics that read instantiations (read_instantiate,
940 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
941 context, which is required for parsing and type-checking. Moreover,
942 the variables are specified as plain indexnames, not string encodings
943 thereof. INCOMPATIBILITY.
945 * Generic Toplevel.add_hook interface allows to analyze the result of
946 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
947 for theorem dependency output of transactions resulting in a new
950 * ML antiquotations: block-structured compilation context indicated by
951 \<lbrace> ... \<rbrace>; additional antiquotation forms:
953 @{binding name} - basic name binding
954 @{let ?pat = term} - term abbreviation (HO matching)
955 @{note name = fact} - fact abbreviation
956 @{thm fact} - singleton fact (with attributes)
957 @{thms fact} - general fact (with attributes)
958 @{lemma prop by method} - singleton goal
959 @{lemma prop by meth1 meth2} - singleton goal
960 @{lemma prop1 ... propN by method} - general goal
961 @{lemma prop1 ... propN by meth1 meth2} - general goal
962 @{lemma (open) ...} - open derivation
967 * The Isabelle "emacs" tool provides a specific interface to invoke
968 Proof General / Emacs, with more explicit failure if that is not
969 installed (the old isabelle-interface script silently falls back on
970 isabelle-process). The PROOFGENERAL_HOME setting determines the
971 installation location of the Proof General distribution.
973 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
974 the Isabelle process into a JVM/Scala application. See
975 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
976 process wrapper has been discontinued.)
978 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
980 * Various status messages (with exact source position information) are
981 emitted, if proper markup print mode is enabled. This allows
982 user-interface components to provide detailed feedback on internal
987 New in Isabelle2008 (June 2008)
988 -------------------------------
992 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
993 and updated, with formally checked references as hyperlinks.
995 * Theory loader: use_thy (and similar operations) no longer set the
996 implicit ML context, which was occasionally hard to predict and in
997 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
998 provides a proper context already.
1000 * Theory loader: old-style ML proof scripts being *attached* to a thy
1001 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1002 'use' within a theory file will do the job.
1004 * Name space merge now observes canonical order, i.e. the second space
1005 is inserted into the first one, while existing entries in the first
1006 space take precedence. INCOMPATIBILITY in rare situations, may try to
1007 swap theory imports.
1009 * Syntax: symbol \<chi> is now considered a letter. Potential
1010 INCOMPATIBILITY in identifier syntax etc.
1012 * Outer syntax: string tokens no longer admit escaped white space,
1013 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1014 white space without escapes.
1016 * Outer syntax: string tokens may contain arbitrary character codes
1017 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1023 * Context-dependent token translations. Default setup reverts locally
1024 fixed variables, and adds hilite markup for undeclared frees.
1026 * Unused theorems can be found using the new command 'unused_thms'.
1027 There are three ways of invoking it:
1030 Only finds unused theorems in the current theory.
1032 (2) unused_thms thy_1 ... thy_n -
1033 Finds unused theorems in the current theory and all of its ancestors,
1034 excluding the theories thy_1 ... thy_n and all of their ancestors.
1036 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1037 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1038 their ancestors, excluding the theories thy_1 ... thy_n and all of
1041 In order to increase the readability of the list produced by
1042 unused_thms, theorems that have been created by a particular instance
1043 of a theory command such as 'inductive' or 'function' are considered
1044 to belong to the same "group", meaning that if at least one theorem in
1045 this group is used, the other theorems in the same group are no longer
1046 reported as unused. Moreover, if all theorems in the group are
1047 unused, only one theorem in the group is displayed.
1049 Note that proof objects have to be switched on in order for
1050 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1051 usually the case when using Proof General with the default settings).
1053 * Authentic naming of facts disallows ad-hoc overwriting of previous
1054 theorems within the same name space. INCOMPATIBILITY, need to remove
1055 duplicate fact bindings, or even accidental fact duplications. Note
1056 that tools may maintain dynamically scoped facts systematically, using
1057 PureThy.add_thms_dynamic.
1059 * Command 'hide' now allows to hide from "fact" name space as well.
1061 * Eliminated destructive theorem database, simpset, claset, and
1062 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1063 update of theories within ML code.
1065 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1066 INCOMPATIBILITY, object-logics depending on former Pure require
1067 additional setup PureThy.old_appl_syntax_setup; object-logics
1068 depending on former CPure need to refer to Pure.
1070 * Commands 'use' and 'ML' are now purely functional, operating on
1071 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1072 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1075 * Command 'setup': discontinued implicit version with ML reference.
1077 * Instantiation target allows for simultaneous specification of class
1078 instance operations together with an instantiation proof.
1079 Type-checking phase allows to refer to class operations uniformly.
1080 See src/HOL/Complex/Complex.thy for an Isar example and
1081 src/HOL/Library/Eval.thy for an ML example.
1083 * Indexing of literal facts: be more serious about including only
1084 facts from the visible specification/proof context, but not the
1085 background context (locale etc.). Affects `prop` notation and method
1086 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1089 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1090 "(open)" option, which used to expose internal bound variables to the
1093 * Isar statements: removed obsolete case "rule_context".
1094 INCOMPATIBILITY, better use explicit fixes/assumes.
1096 * Locale proofs: default proof step now includes 'unfold_locales';
1097 hence 'proof' without argument may be used to unfold locale
1101 *** Document preparation ***
1103 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1104 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1105 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1106 spot); renamed link color from "darkblue" to "linkcolor" (default
1107 value unchanged, can be redefined via \definecolor); no longer sets
1108 "a4paper" option (unnecessary or even intrusive).
1110 * Antiquotation @{lemma A method} proves proposition A by the given
1111 method (either a method name or a method name plus (optional) method
1112 arguments in parentheses) and prints A just like @{prop A}.
1117 * New primrec package. Specification syntax conforms in style to
1118 definition/function/.... No separate induction rule is provided. The
1119 "primrec" command distinguishes old-style and new-style specifications
1120 by syntax. The former primrec package is now named OldPrimrecPackage.
1121 When adjusting theories, beware: constants stemming from new-style
1122 primrec specifications have authentic syntax.
1124 * Metis prover is now an order of magnitude faster, and also works
1125 with multithreading.
1127 * Metis: the maximum number of clauses that can be produced from a
1128 theorem is now given by the attribute max_clauses. Theorems that
1129 exceed this number are ignored, with a warning printed.
1131 * Sledgehammer no longer produces structured proofs by default. To
1132 enable, declare [[sledgehammer_full = true]]. Attributes
1133 reconstruction_modulus, reconstruction_sorts renamed
1134 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1136 * Method "induct_scheme" derives user-specified induction rules
1137 from well-founded induction and completeness of patterns. This factors
1138 out some operations that are done internally by the function package
1139 and makes them available separately. See
1140 src/HOL/ex/Induction_Scheme.thy for examples.
1142 * More flexible generation of measure functions for termination
1143 proofs: Measure functions can be declared by proving a rule of the
1144 form "is_measure f" and giving it the [measure_function] attribute.
1145 The "is_measure" predicate is logically meaningless (always true), and
1146 just guides the heuristic. To find suitable measure functions, the
1147 termination prover sets up the goal "is_measure ?f" of the appropriate
1148 type and generates all solutions by prolog-style backwards proof using
1151 This setup also deals with rules like
1153 "is_measure f ==> is_measure (list_size f)"
1155 which accommodates nested datatypes that recurse through lists.
1156 Similar rules are predeclared for products and option types.
1158 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1162 - Definitions of overloaded constants on sets have to be replaced by
1163 definitions on => and bool.
1165 - Some definitions of overloaded operators on sets can now be proved
1166 using the definitions of the operators on => and bool. Therefore,
1167 the following theorems have been renamed:
1169 subset_def -> subset_eq
1170 psubset_def -> psubset_eq
1171 set_diff_def -> set_diff_eq
1172 Compl_def -> Compl_eq
1173 Sup_set_def -> Sup_set_eq
1174 Inf_set_def -> Inf_set_eq
1175 sup_set_def -> sup_set_eq
1176 inf_set_def -> inf_set_eq
1178 - Due to the incompleteness of the HO unification algorithm, some
1179 rules such as subst may require manual instantiation, if some of
1180 the unknowns in the rule is a set.
1182 - Higher order unification and forward proofs:
1185 have "P (S::'a set)" <...>
1186 then have "EX S. P S" ..
1188 no longer works (due to the incompleteness of the HO unification
1189 algorithm) and must be replaced by the pattern
1196 - Calculational reasoning with subst (or similar rules):
1199 have "P (S::'a set)" <...>
1200 also have "S = T" <...>
1201 finally have "P T" .
1203 no longer works (for similar reasons as the previous example) and
1204 must be replaced by something like
1206 have "P (S::'a set)" <...>
1207 moreover have "S = T" <...>
1208 ultimately have "P T" by simp
1210 - Tactics or packages written in ML code:
1211 Code performing pattern matching on types via
1213 Type ("set", [T]) => ...
1215 must be rewritten. Moreover, functions like strip_type or
1216 binder_types no longer return the right value when applied to a
1219 T1 => ... => Tn => U => bool
1223 T1 => ... => Tn => U set
1225 * Merged theories Wellfounded_Recursion, Accessible_Part and
1226 Wellfounded_Relations to theory Wellfounded.
1228 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1230 * Class finite no longer treats UNIV as class parameter. Use class
1231 enum from theory Library/Enum instead to achieve a similar effect.
1234 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1235 and "Cons". INCOMPATIBILITY.
1237 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1238 Potential INCOMPATIBILITY.
1240 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1241 injective_fst_snd removed, use split_eta and prod_eqI instead.
1242 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1244 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1245 the same name in theory Orderings:
1255 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
1256 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
1257 and different variable names.
1259 * Library/Option_ord.thy: Canonical order on option type.
1261 * Library/RBT.thy: Red-black trees, an efficient implementation of
1264 * Library/Countable.thy: Type class for countable types.
1266 * Theory Int: The representation of numerals has changed. The infix
1267 operator BIT and the bit datatype with constructors B0 and B1 have
1268 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
1269 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
1270 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
1273 * Theory Nat: definition of <= and < on natural numbers no longer
1274 depend on well-founded relations. INCOMPATIBILITY. Definitions
1275 le_def and less_def have disappeared. Consider lemmas not_less
1276 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
1278 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
1279 (whose purpose mainly is for various fold_set functionals) have been
1280 abandoned in favor of the existing algebraic classes
1281 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
1282 lower_semilattice (resp. upper_semilattice) and linorder.
1285 * Theory Transitive_Closure: induct and cases rules now declare proper
1286 case_names ("base" and "step"). INCOMPATIBILITY.
1288 * Theorem Inductive.lfp_ordinal_induct generalized to complete
1289 lattices. The form set-specific version is available as
1290 Inductive.lfp_ordinal_induct_set.
1292 * Renamed theorems "power.simps" to "power_int.simps".
1295 * Class semiring_div provides basic abstract properties of semirings
1296 with division and modulo operations. Subsumes former class dvd_mod.
1298 * Merged theories IntDef, Numeral and IntArith into unified theory
1299 Int. INCOMPATIBILITY.
1301 * Theory Library/Code_Index: type "index" now represents natural
1302 numbers rather than integers. INCOMPATIBILITY.
1304 * New class "uminus" with operation "uminus" (split of from class
1305 "minus" which now only has operation "minus", binary).
1308 * Constants "card", "internal_split", "option_map" now with authentic
1309 syntax. INCOMPATIBILITY.
1311 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
1312 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
1313 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
1314 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
1315 Sup_set_def, le_def, less_def, option_map_def now with object
1316 equality. INCOMPATIBILITY.
1318 * Records. Removed K_record, and replaced it by pure lambda term
1319 %x. c. The simplifier setup is now more robust against eta expansion.
1320 INCOMPATIBILITY: in cases explicitly referring to K_record.
1322 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
1324 * Library/ListVector: new theory of arithmetic vector operations.
1326 * Library/Order_Relation: new theory of various orderings as sets of
1327 pairs. Defines preorders, partial orders, linear orders and
1328 well-orders on sets and on types.
1333 * Renamed some theories to allow to loading both ZF and HOL in the
1336 Datatype -> Datatype_ZF
1337 Inductive -> Inductive_ZF
1344 INCOMPATIBILITY: ZF theories that import individual theories below
1345 Main might need to be adapted. Regular theory Main is still
1346 available, as trivial extension of Main_ZF.
1351 * ML within Isar: antiquotation @{const name} or @{const
1352 name(typargs)} produces statically-checked Const term.
1354 * Functor NamedThmsFun: data is available to the user as dynamic fact
1355 (of the same name). Removed obsolete print command.
1357 * Removed obsolete "use_legacy_bindings" function.
1359 * The ``print mode'' is now a thread-local value derived from a global
1360 template (the former print_mode reference), thus access becomes
1361 non-critical. The global print_mode reference is for session
1362 management only; user-code should use print_mode_value,
1363 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
1365 * Functions system/system_out provide a robust way to invoke external
1366 shell commands, with propagation of interrupts (requires Poly/ML
1367 5.2.1). Do not use OS.Process.system etc. from the basis library!
1372 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
1373 in accordance with Proof General 3.7, which prefers GNU emacs.
1375 * isatool tty runs Isabelle process with plain tty interaction;
1376 optional line editor may be specified via ISABELLE_LINE_EDITOR
1377 setting, the default settings attempt to locate "ledit" and "rlwrap".
1379 * isatool browser now works with Cygwin as well, using general
1380 "javapath" function defined in Isabelle process environment.
1382 * YXML notation provides a simple and efficient alternative to
1383 standard XML transfer syntax. See src/Pure/General/yxml.ML and
1384 isatool yxml as described in the Isabelle system manual.
1386 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
1387 provides general wrapper for managing an Isabelle process in a robust
1388 fashion, with ``cooked'' output from stdin/stderr.
1390 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
1391 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
1393 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
1394 way of changing the user's settings is via
1395 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
1398 * Multithreading.max_threads := 0 refers to the number of actual CPU
1399 cores of the underlying machine, which is a good starting point for
1400 optimal performance tuning. The corresponding usedir option -M allows
1401 "max" as an alias for "0". WARNING: does not work on certain versions
1402 of Mac OS (with Poly/ML 5.1).
1404 * isabelle-process: non-ML sessions are run with "nice", to reduce the
1405 adverse effect of Isabelle flooding interactive front-ends (notably
1406 ProofGeneral / XEmacs).
1410 New in Isabelle2007 (November 2007)
1411 -----------------------------------
1415 * More uniform information about legacy features, notably a
1416 warning/error of "Legacy feature: ...", depending on the state of the
1417 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
1418 legacy features will disappear eventually.
1420 * Theory syntax: the header format ``theory A = B + C:'' has been
1421 discontinued in favour of ``theory A imports B C begin''. Use isatool
1422 fixheaders to convert existing theory files. INCOMPATIBILITY.
1424 * Theory syntax: the old non-Isar theory file format has been
1425 discontinued altogether. Note that ML proof scripts may still be used
1426 with Isar theories; migration is usually quite simple with the ML
1427 function use_legacy_bindings. INCOMPATIBILITY.
1429 * Theory syntax: some popular names (e.g. 'class', 'declaration',
1430 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
1433 * Theory loader: be more serious about observing the static theory
1434 header specifications (including optional directories), but not the
1435 accidental file locations of previously successful loads. The strict
1436 update policy of former update_thy is now already performed by
1437 use_thy, so the former has been removed; use_thys updates several
1438 theories simultaneously, just as 'imports' within a theory header
1439 specification, but without merging the results. Potential
1440 INCOMPATIBILITY: may need to refine theory headers and commands
1441 ROOT.ML which depend on load order.
1443 * Theory loader: optional support for content-based file
1444 identification, instead of the traditional scheme of full physical
1445 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
1446 (cf. the system manual). The new scheme allows to work with
1447 non-finished theories in persistent session images, such that source
1448 files may be moved later on without requiring reloads.
1450 * Theory loader: old-style ML proof scripts being *attached* to a thy
1451 file (with the same base name as the theory) are considered a legacy
1452 feature, which will disappear eventually. Even now, the theory loader
1453 no longer maintains dependencies on such files.
1455 * Syntax: the scope for resolving ambiguities via type-inference is
1456 now limited to individual terms, instead of whole simultaneous
1457 specifications as before. This greatly reduces the complexity of the
1458 syntax module and improves flexibility by separating parsing and
1459 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
1460 'fixes' etc.) are required in rare situations.
1462 * Syntax: constants introduced by new-style packages ('definition',
1463 'abbreviation' etc.) are passed through the syntax module in
1464 ``authentic mode''. This means that associated mixfix annotations
1465 really stick to such constants, independently of potential name space
1466 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
1467 trees are represented slightly differently, may need to adapt syntax
1468 translations accordingly. Use CONST marker in 'translations' and
1469 @{const_syntax} antiquotation in 'parse_translation' etc.
1471 * Legacy goal package: reduced interface to the bare minimum required
1472 to keep existing proof scripts running. Most other user-level
1473 functions are now part of the OldGoals structure, which is *not* open
1474 by default (consider isatool expandshort before open OldGoals).
1475 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
1476 these tend to cause confusion about the actual goal (!) context being
1477 used here, which is not necessarily the same as the_context().
1479 * Command 'find_theorems': supports "*" wild-card in "name:"
1480 criterion; "with_dups" option. Certain ProofGeneral versions might
1481 support a specific search form (see ProofGeneral/CHANGES).
1483 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
1484 by default, which means that "prems" (and also "fixed variables") are
1485 suppressed from proof state output. Note that the ProofGeneral
1486 settings mechanism allows to change and save options persistently, but
1487 older versions of Isabelle will fail to start up if a negative prems
1490 * Local theory targets may be specified by non-nested blocks of
1491 ``context/locale/class ... begin'' followed by ``end''. The body may
1492 contain definitions, theorems etc., including any derived mechanism
1493 that has been implemented on top of these primitives. This concept
1494 generalizes the existing ``theorem (in ...)'' towards more versatility
1497 * Proof General interface: proper undo of final 'end' command;
1498 discontinued Isabelle/classic mode (ML proof scripts).
1501 *** Document preparation ***
1503 * Added antiquotation @{theory name} which prints the given name,
1504 after checking that it refers to a valid ancestor theory in the
1507 * Added antiquotations @{ML_type text} and @{ML_struct text} which
1508 check the given source text as ML type/structure, printing verbatim.
1510 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
1511 "c args == rhs" given in the current context. (Any number of
1512 arguments may be given on the LHS.)
1517 * The 'class' package offers a combination of axclass and locale to
1518 achieve Haskell-like type classes in Isabelle. Definitions and
1519 theorems within a class context produce both relative results (with
1520 implicit parameters according to the locale context), and polymorphic
1521 constants with qualified polymorphism (according to the class
1522 context). Within the body context of a 'class' target, a separate
1523 syntax layer ("user space type system") takes care of converting
1524 between global polymorphic consts and internal locale representation.
1525 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
1526 "isatool doc classes" provides a tutorial.
1528 * Generic code generator framework allows to generate executable
1529 code for ML and Haskell (including Isabelle classes). A short usage
1532 internal compilation:
1533 export_code <list of constants (term syntax)> in SML
1534 writing SML code to a file:
1535 export_code <list of constants (term syntax)> in SML <filename>
1536 writing OCaml code to a file:
1537 export_code <list of constants (term syntax)> in OCaml <filename>
1538 writing Haskell code to a bunch of files:
1539 export_code <list of constants (term syntax)> in Haskell <filename>
1541 evaluating closed propositions to True/False using code generation:
1544 Reasonable default setup of framework in HOL.
1546 Theorem attributs for selecting and transforming function equations theorems:
1548 [code fun]: select a theorem as function equation for a specific constant
1549 [code fun del]: deselect a theorem as function equation for a specific constant
1550 [code inline]: select an equation theorem for unfolding (inlining) in place
1551 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
1553 User-defined serializations (target in {SML, OCaml, Haskell}):
1555 code_const <and-list of constants (term syntax)>
1556 {(target) <and-list of const target syntax>}+
1558 code_type <and-list of type constructors>
1559 {(target) <and-list of type target syntax>}+
1561 code_instance <and-list of instances>
1563 where instance ::= <type constructor> :: <class>
1565 code_class <and_list of classes>
1566 {(target) <and-list of class target syntax>}+
1567 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
1569 code_instance and code_class only are effective to target Haskell.
1571 For example usage see src/HOL/ex/Codegenerator.thy and
1572 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
1573 generation from Isabelle/HOL theories is available via "isatool doc
1576 * Code generator: consts in 'consts_code' Isar commands are now
1577 referred to by usual term syntax (including optional type
1580 * Command 'no_translations' removes translation rules from theory
1583 * Overloaded definitions are now actually checked for acyclic
1584 dependencies. The overloading scheme is slightly more general than
1585 that of Haskell98, although Isabelle does not demand an exact
1586 correspondence to type class and instance declarations.
1587 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
1588 exotic versions of overloading -- at the discretion of the user!
1590 Polymorphic constants are represented via type arguments, i.e. the
1591 instantiation that matches an instance against the most general
1592 declaration given in the signature. For example, with the declaration
1593 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
1594 as c(nat). Overloading is essentially simultaneous structural
1595 recursion over such type arguments. Incomplete specification patterns
1596 impose global constraints on all occurrences, e.g. c('a * 'a) on the
1597 LHS means that more general c('a * 'b) will be disallowed on any RHS.
1598 Command 'print_theory' outputs the normalized system of recursive
1599 equations, see section "definitions".
1601 * Configuration options are maintained within the theory or proof
1602 context (with name and type bool/int/string), providing a very simple
1603 interface to a poor-man's version of general context data. Tools may
1604 declare options in ML (e.g. using Attrib.config_int) and then refer to
1605 these values using Config.get etc. Users may change options via an
1606 associated attribute of the same name. This form of context
1607 declaration works particularly well with commands 'declare' or
1608 'using', for example ``declare [[foo = 42]]''. Thus it has become
1609 very easy to avoid global references, which would not observe Isar
1610 toplevel undo/redo and fail to work with multithreading.
1612 Various global ML references of Pure and HOL have been turned into
1613 configuration options:
1615 Unify.search_bound unify_search_bound
1616 Unify.trace_bound unify_trace_bound
1617 Unify.trace_simp unify_trace_simp
1618 Unify.trace_types unify_trace_types
1619 Simplifier.simp_depth_limit simp_depth_limit
1620 Blast.depth_limit blast_depth_limit
1621 DatatypeProp.dtK datatype_distinctness_limit
1622 fast_arith_neq_limit fast_arith_neq_limit
1623 fast_arith_split_limit fast_arith_split_limit
1625 * Named collections of theorems may be easily installed as context
1626 data using the functor NamedThmsFun (see also
1627 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
1628 attributes; there is also a toplevel print command. This facility is
1629 just a common case of general context data, which is the preferred way
1630 for anything more complex than just a list of facts in canonical
1633 * Isar: command 'declaration' augments a local theory by generic
1634 declaration functions written in ML. This enables arbitrary content
1635 being added to the context, depending on a morphism that tells the
1636 difference of the original declaration context wrt. the application
1637 context encountered later on.
1639 * Isar: proper interfaces for simplification procedures. Command
1640 'simproc_setup' declares named simprocs (with match patterns, and body
1641 text in ML). Attribute "simproc" adds/deletes simprocs in the current
1642 context. ML antiquotation @{simproc name} retrieves named simprocs.
1644 * Isar: an extra pair of brackets around attribute declarations
1645 abbreviates a theorem reference involving an internal dummy fact,
1646 which will be ignored later --- only the effect of the attribute on
1647 the background context will persist. This form of in-place
1648 declarations is particularly useful with commands like 'declare' and
1649 'using', for example ``have A using [[simproc a]] by simp''.
1651 * Isar: method "assumption" (and implicit closing of subproofs) now
1652 takes simple non-atomic goal assumptions into account: after applying
1653 an assumption as a rule the resulting subgoals are solved by atomic
1654 assumption steps. This is particularly useful to finish 'obtain'
1655 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
1656 without referring to the original premise "!!x. P x ==> thesis" in the
1657 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
1660 * Isar: implicit use of prems from the Isar proof context is
1661 considered a legacy feature. Common applications like ``have A .''
1662 may be replaced by ``have A by fact'' or ``note `A`''. In general,
1663 referencing facts explicitly here improves readability and
1664 maintainability of proof texts.
1666 * Isar: improper proof element 'guess' is like 'obtain', but derives
1667 the obtained context from the course of reasoning! For example:
1669 assume "EX x y. A x & B y" -- "any previous fact"
1670 then guess x and y by clarify
1672 This technique is potentially adventurous, depending on the facts and
1673 proof tools being involved here.
1675 * Isar: known facts from the proof context may be specified as literal
1676 propositions, using ASCII back-quote syntax. This works wherever
1677 named facts used to be allowed so far, in proof commands, proof
1678 methods, attributes etc. Literal facts are retrieved from the context
1679 according to unification of type and term parameters. For example,
1680 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
1681 theorems in the current context, then these are valid literal facts:
1682 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
1684 There is also a proof method "fact" which does the same composition
1685 for explicit goal states, e.g. the following proof texts coincide with
1686 certain special cases of literal facts:
1688 have "A" by fact == note `A`
1689 have "A ==> B" by fact == note `A ==> B`
1690 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
1691 have "P a ==> Q a" by fact == note `P a ==> Q a`
1693 * Isar: ":" (colon) is no longer a symbolic identifier character in
1694 outer syntax. Thus symbolic identifiers may be used without
1695 additional white space in declarations like this: ``assume *: A''.
1697 * Isar: 'print_facts' prints all local facts of the current context,
1698 both named and unnamed ones.
1700 * Isar: 'def' now admits simultaneous definitions, e.g.:
1702 def x == "t" and y == "u"
1704 * Isar: added command 'unfolding', which is structurally similar to
1705 'using', but affects both the goal state and facts by unfolding given
1706 rewrite rules. Thus many occurrences of the 'unfold' method or
1707 'unfolded' attribute may be replaced by first-class proof text.
1709 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
1710 and command 'unfolding' now all support object-level equalities
1711 (potentially conditional). The underlying notion of rewrite rule is
1712 analogous to the 'rule_format' attribute, but *not* that of the
1713 Simplifier (which is usually more generous).
1715 * Isar: the new attribute [rotated n] (default n = 1) rotates the
1716 premises of a theorem by n. Useful in conjunction with drule.
1718 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
1719 method expression within a sandbox consisting of the first N
1720 sub-goals, which need to exist. For example, ``simp_all [3]''
1721 simplifies the first three sub-goals, while (rule foo, simp_all)[]
1722 simplifies all new goals that emerge from applying rule foo to the
1723 originally first one.
1725 * Isar: schematic goals are no longer restricted to higher-order
1726 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
1729 * Isar: the conclusion of a long theorem statement is now either
1730 'shows' (a simultaneous conjunction, as before), or 'obtains'
1731 (essentially a disjunction of cases with local parameters and
1732 assumptions). The latter allows to express general elimination rules
1733 adequately; in this notation common elimination rules look like this:
1735 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
1737 obtains x where "P x"
1739 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
1743 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
1749 The subsequent classical rules even refer to the formal "thesis"
1752 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
1755 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
1756 obtains "thesis ==> something"
1758 The actual proof of an 'obtains' statement is analogous to that of the
1759 Isar proof element 'obtain', only that there may be several cases.
1760 Optional case names may be specified in parentheses; these will be
1761 available both in the present proof and as annotations in the
1762 resulting rule, for later use with the 'cases' method (cf. attribute
1765 * Isar: the assumptions of a long theorem statement are available as
1766 "assms" fact in the proof context. This is more appropriate than the
1767 (historical) "prems", which refers to all assumptions of the current
1768 context, including those from the target locale, proof body etc.
1770 * Isar: 'print_statement' prints theorems from the current theory or
1771 proof context in long statement form, according to the syntax of a
1774 * Isar: 'obtain' takes an optional case name for the local context
1775 introduction rule (default "that").
1777 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
1778 explicit (is "_ ==> ?foo") in the rare cases where this still happens
1781 * Pure: syntax "CONST name" produces a fully internalized constant
1782 according to the current context. This is particularly useful for
1783 syntax translations that should refer to internal constant
1784 representations independently of name spaces.
1786 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
1787 instead of "FOO ". This allows multiple binder declarations to coexist
1788 in the same context. INCOMPATIBILITY.
1790 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
1791 primitive that also works in a locale context (both for constants and
1792 fixed variables). Type declaration and internal syntactic representation
1793 of given constants retrieved from the context. Likewise, the
1794 'no_notation' command allows to remove given syntax annotations from the
1797 * Isar/locales: new derived specification elements 'axiomatization',
1798 'definition', 'abbreviation', which support type-inference, admit
1799 object-level specifications (equality, equivalence). See also the
1800 isar-ref manual. Examples:
1803 eq (infix "===" 50) where
1804 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
1806 definition "f x y = x + y + 1"
1807 definition g where "g x = f x x"
1810 neq (infix "=!=" 50) where
1811 "x =!= y == ~ (x === y)"
1813 These specifications may be also used in a locale context. Then the
1814 constants being introduced depend on certain fixed parameters, and the
1815 constant name is qualified by the locale base name. An internal
1816 abbreviation takes care for convenient input and output, making the
1817 parameters implicit and using the original short name. See also
1818 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
1819 entities from a monomorphic theory.
1821 Presently, abbreviations are only available 'in' a target locale, but
1822 not inherited by general import expressions. Also note that
1823 'abbreviation' may be used as a type-safe replacement for 'syntax' +
1824 'translations' in common applications. The "no_abbrevs" print mode
1825 prevents folding of abbreviations in term output.
1827 Concrete syntax is attached to specified constants in internal form,
1828 independently of name spaces. The parse tree representation is
1829 slightly different -- use 'notation' instead of raw 'syntax', and
1830 'translations' with explicit "CONST" markup to accommodate this.
1832 * Pure/Isar: unified syntax for new-style specification mechanisms
1833 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
1834 full type inference and dummy patterns ("_"). For example:
1836 definition "K x _ = x"
1838 inductive conj for A B
1839 where "A ==> B ==> conj A B"
1841 * Pure: command 'print_abbrevs' prints all constant abbreviations of
1842 the current context. Print mode "no_abbrevs" prevents inversion of
1843 abbreviations on output.
1845 * Isar/locales: improved parameter handling: use of locales "var" and
1846 "struct" no longer necessary; - parameter renamings are no longer
1847 required to be injective. For example, this allows to define
1848 endomorphisms as locale endom = homom mult mult h.
1850 * Isar/locales: changed the way locales with predicates are defined.
1851 Instead of accumulating the specification, the imported expression is
1852 now an interpretation. INCOMPATIBILITY: different normal form of
1853 locale expressions. In particular, in interpretations of locales with
1854 predicates, goals repesenting already interpreted fragments are not
1855 removed automatically. Use methods `intro_locales' and
1856 `unfold_locales'; see below.
1858 * Isar/locales: new methods `intro_locales' and `unfold_locales'
1859 provide backward reasoning on locales predicates. The methods are
1860 aware of interpretations and discharge corresponding goals.
1861 `intro_locales' is less aggressive then `unfold_locales' and does not
1862 unfold predicates to assumptions.
1864 * Isar/locales: the order in which locale fragments are accumulated
1865 has changed. This enables to override declarations from fragments due
1866 to interpretations -- for example, unwanted simp rules.
1868 * Isar/locales: interpretation in theories and proof contexts has been
1869 extended. One may now specify (and prove) equations, which are
1870 unfolded in interpreted theorems. This is useful for replacing
1871 defined concepts (constants depending on locale parameters) by
1872 concepts already existing in the target context. Example:
1874 interpretation partial_order ["op <= :: [int, int] => bool"]
1875 where "partial_order.less (op <=) (x::int) y = (x < y)"
1877 Typically, the constant `partial_order.less' is created by a
1878 definition specification element in the context of locale
1881 * Method "induct": improved internal context management to support
1882 local fixes and defines on-the-fly. Thus explicit meta-level
1883 connectives !! and ==> are rarely required anymore in inductive goals
1884 (using object-logic connectives for this purpose has been long
1885 obsolete anyway). Common proof patterns are explained in
1886 src/HOL/Induct/Common_Patterns.thy, see also
1887 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
1890 * Method "induct": improved handling of simultaneous goals. Instead of
1891 introducing object-level conjunction, the statement is now split into
1892 several conclusions, while the corresponding symbolic cases are nested
1893 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
1894 see src/HOL/Induct/Common_Patterns.thy, for example.
1896 * Method "induct": mutual induction rules are now specified as a list
1897 of rule sharing the same induction cases. HOL packages usually provide
1898 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
1899 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
1900 mutual induction rules differently, i.e. like this:
1902 (induct rule: foo_bar.inducts)
1903 (induct set: foo bar)
1904 (induct pred: foo bar)
1905 (induct type: foo bar)
1907 The ML function ProjectRule.projections turns old-style rules into the
1910 * Method "coinduct": dual of induction, see
1911 src/HOL/Library/Coinductive_List.thy for various examples.
1913 * Method "cases", "induct", "coinduct": the ``(open)'' option is
1914 considered a legacy feature.
1916 * Attribute "symmetric" produces result with standardized schematic
1917 variables (index 0). Potential INCOMPATIBILITY.
1919 * Simplifier: by default the simplifier trace only shows top level
1920 rewrites now. That is, trace_simp_depth_limit is set to 1 by
1921 default. Thus there is less danger of being flooded by the trace. The
1922 trace indicates where parts have been suppressed.
1924 * Provers/classical: removed obsolete classical version of elim_format
1925 attribute; classical elim/dest rules are now treated uniformly when
1926 manipulating the claset.
1928 * Provers/classical: stricter checks to ensure that supplied intro,
1929 dest and elim rules are well-formed; dest and elim rules must have at
1932 * Provers/classical: attributes dest/elim/intro take an optional
1933 weight argument for the rule (just as the Pure versions). Weights are
1934 ignored by automated tools, but determine the search order of single
1937 * Syntax: input syntax now supports dummy variable binding "%_. b",
1938 where the body does not mention the bound variable. Note that dummy
1939 patterns implicitly depend on their context of bounds, which makes
1940 "{_. _}" match any set comprehension as expected. Potential
1941 INCOMPATIBILITY -- parse translations need to cope with syntactic
1942 constant "_idtdummy" in the binding position.
1944 * Syntax: removed obsolete syntactic constant "_K" and its associated
1945 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
1946 for example "A -> B" => "Pi A (%_. B)".
1948 * Pure: 'class_deps' command visualizes the subclass relation, using
1949 the graph browser tool.
1951 * Pure: 'print_theory' now suppresses certain internal declarations by
1952 default; use '!' option for full details.
1957 * Method "metis" proves goals by applying the Metis general-purpose
1958 resolution prover (see also http://gilith.com/software/metis/).
1959 Examples are in the directory MetisExamples. WARNING: the
1960 Isabelle/HOL-Metis integration does not yet work properly with
1963 * Command 'sledgehammer' invokes external automatic theorem provers as
1964 background processes. It generates calls to the "metis" method if
1965 successful. These can be pasted into the proof. Users do not have to
1966 wait for the automatic provers to return. WARNING: does not really
1967 work with multi-threading.
1969 * New "auto_quickcheck" feature tests outermost goal statements for
1970 potential counter-examples. Controlled by ML references
1971 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
1972 5000 milliseconds). Fails silently if statements is outside of
1973 executable fragment, or any other codgenerator problem occurs.
1975 * New constant "undefined" with axiom "undefined x = undefined".
1977 * Added class "HOL.eq", allowing for code generation with polymorphic
1980 * Some renaming of class constants due to canonical name prefixing in
1981 the new 'class' package:
1983 HOL.abs ~> HOL.abs_class.abs
1984 HOL.divide ~> HOL.divide_class.divide
1985 0 ~> HOL.zero_class.zero
1986 1 ~> HOL.one_class.one
1987 op + ~> HOL.plus_class.plus
1988 op - ~> HOL.minus_class.minus
1989 uminus ~> HOL.minus_class.uminus
1990 op * ~> HOL.times_class.times
1991 op < ~> HOL.ord_class.less
1992 op <= > HOL.ord_class.less_eq
1993 Nat.power ~> Power.power_class.power
1994 Nat.size ~> Nat.size_class.size
1995 Numeral.number_of ~> Numeral.number_class.number_of
1996 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
1997 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
1998 Orderings.min ~> Orderings.ord_class.min
1999 Orderings.max ~> Orderings.ord_class.max
2000 Divides.op div ~> Divides.div_class.div
2001 Divides.op mod ~> Divides.div_class.mod
2002 Divides.op dvd ~> Divides.div_class.dvd
2004 INCOMPATIBILITY. Adaptions may be required in the following cases:
2006 a) User-defined constants using any of the names "plus", "minus",
2007 "times", "less" or "less_eq". The standard syntax translations for
2008 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2011 b) Variables named "plus", "minus", "times", "less", "less_eq"
2012 INCOMPATIBILITY: use more specific names.
2014 c) Permutative equations (e.g. "a + b = b + a")
2015 Since the change of names also changes the order of terms, permutative
2016 rewrite rules may get applied in a different order. Experience shows
2017 that this is rarely the case (only two adaptions in the whole Isabelle
2018 distribution). INCOMPATIBILITY: rewrite proofs
2020 d) ML code directly refering to constant names
2021 This in general only affects hand-written proof tactics, simprocs and
2022 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2023 Consider using @{const_name} antiquotation.
2025 * New class "default" with associated constant "default".
2027 * Function "sgn" is now overloaded and available on int, real, complex
2028 (and other numeric types), using class "sgn". Two possible defs of
2029 sgn are given as equational assumptions in the classes sgn_if and
2030 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2033 * Locale "partial_order" now unified with class "order" (cf. theory
2034 Orderings), added parameter "less". INCOMPATIBILITY.
2036 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2037 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2038 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2040 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2041 changed order of proof goals in instance proofs.
2043 * The transitivity reasoner for partial and linear orders is set up
2044 for classes "order" and "linorder". Instances of the reasoner are available
2045 in all contexts importing or interpreting the corresponding locales.
2046 Method "order" invokes the reasoner separately; the reasoner
2047 is also integrated with the Simplifier as a solver. Diagnostic
2048 command 'print_orders' shows the available instances of the reasoner
2049 in the current context.
2051 * Localized monotonicity predicate in theory "Orderings"; integrated
2052 lemmas max_of_mono and min_of_mono with this predicate.
2055 * Formulation of theorem "dense" changed slightly due to integration
2056 with new class dense_linear_order.
2058 * Uniform lattice theory development in HOL.
2060 constants "meet" and "join" now named "inf" and "sup"
2061 constant "Meet" now named "Inf"
2063 classes "meet_semilorder" and "join_semilorder" now named
2064 "lower_semilattice" and "upper_semilattice"
2065 class "lorder" now named "lattice"
2066 class "comp_lat" now named "complete_lattice"
2068 Instantiation of lattice classes allows explicit definitions
2069 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2071 INCOMPATIBILITY. Theorem renames:
2073 meet_left_le ~> inf_le1
2074 meet_right_le ~> inf_le2
2075 join_left_le ~> sup_ge1
2076 join_right_le ~> sup_ge2
2077 meet_join_le ~> inf_sup_ord
2080 le_meet ~> le_inf_iff
2081 le_join ~> ge_sup_conv
2082 meet_idempotent ~> inf_idem
2083 join_idempotent ~> sup_idem
2084 meet_comm ~> inf_commute
2085 join_comm ~> sup_commute
2086 meet_leI1 ~> le_infI1
2087 meet_leI2 ~> le_infI2
2088 le_joinI1 ~> le_supI1
2089 le_joinI2 ~> le_supI2
2090 meet_assoc ~> inf_assoc
2091 join_assoc ~> sup_assoc
2092 meet_left_comm ~> inf_left_commute
2093 meet_left_idempotent ~> inf_left_idem
2094 join_left_comm ~> sup_left_commute
2095 join_left_idempotent ~> sup_left_idem
2098 le_def_meet ~> le_iff_inf
2099 le_def_join ~> le_iff_sup
2100 join_absorp2 ~> sup_absorb2
2101 join_absorp1 ~> sup_absorb1
2102 meet_absorp1 ~> inf_absorb1
2103 meet_absorp2 ~> inf_absorb2
2104 meet_join_absorp ~> inf_sup_absorb
2105 join_meet_absorp ~> sup_inf_absorb
2106 distrib_join_le ~> distrib_sup_le
2107 distrib_meet_le ~> distrib_inf_le
2109 add_meet_distrib_left ~> add_inf_distrib_left
2110 add_join_distrib_left ~> add_sup_distrib_left
2111 is_join_neg_meet ~> is_join_neg_inf
2112 is_meet_neg_join ~> is_meet_neg_sup
2113 add_meet_distrib_right ~> add_inf_distrib_right
2114 add_join_distrib_right ~> add_sup_distrib_right
2115 add_meet_join_distribs ~> add_sup_inf_distribs
2116 join_eq_neg_meet ~> sup_eq_neg_inf
2117 meet_eq_neg_join ~> inf_eq_neg_sup
2118 add_eq_meet_join ~> add_eq_inf_sup
2119 meet_0_imp_0 ~> inf_0_imp_0
2120 join_0_imp_0 ~> sup_0_imp_0
2121 meet_0_eq_0 ~> inf_0_eq_0
2122 join_0_eq_0 ~> sup_0_eq_0
2123 neg_meet_eq_join ~> neg_inf_eq_sup
2124 neg_join_eq_meet ~> neg_sup_eq_inf
2125 join_eq_if ~> sup_eq_if
2127 mono_meet ~> mono_inf
2128 mono_join ~> mono_sup
2129 meet_bool_eq ~> inf_bool_eq
2130 join_bool_eq ~> sup_bool_eq
2131 meet_fun_eq ~> inf_fun_eq
2132 join_fun_eq ~> sup_fun_eq
2133 meet_set_eq ~> inf_set_eq
2134 join_set_eq ~> sup_set_eq
2135 meet1_iff ~> inf1_iff
2136 meet2_iff ~> inf2_iff
2145 join1_iff ~> sup1_iff
2146 join2_iff ~> sup2_iff
2156 is_meet_Meet ~> is_meet_Inf
2157 Meet_bool_def ~> Inf_bool_def
2158 Meet_fun_def ~> Inf_fun_def
2159 Meet_greatest ~> Inf_greatest
2160 Meet_lower ~> Inf_lower
2161 Meet_set_def ~> Inf_set_def
2164 Sup_bool_eq ~> Sup_bool_def
2165 Sup_fun_eq ~> Sup_fun_def
2166 Sup_set_eq ~> Sup_set_def
2168 listsp_meetI ~> listsp_infI
2169 listsp_meet_eq ~> listsp_inf_eq
2174 * Added syntactic class "size"; overloaded constant "size" now has
2175 type "'a::size ==> bool"
2177 * Internal reorganisation of `size' of datatypes: size theorems
2178 "foo.size" are no longer subsumed by "foo.simps" (but are still
2179 simplification rules by default!); theorems "prod.size" now named
2182 * Class "div" now inherits from class "times" rather than "type".
2185 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2186 Linorder etc. have disappeared; operations defined in terms of
2187 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2189 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2191 * HOL-Word: New extensive library and type for generic, fixed size
2192 machine words, with arithemtic, bit-wise, shifting and rotating
2193 operations, reflection into int, nat, and bool lists, automation for
2194 linear arithmetic (by automatic reflection into nat or int), including
2195 lemmas on overflow and monotonicity. Instantiated to all appropriate
2196 arithmetic type classes, supporting automatic simplification of
2197 numerals on all operations.
2199 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2201 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2203 * Code generator library theories:
2204 - Code_Integer represents HOL integers by big integer literals in target
2206 - Code_Char represents HOL characters by character literals in target
2208 - Code_Char_chr like Code_Char, but also offers treatment of character
2209 codes; includes Code_Integer.
2210 - Executable_Set allows to generate code for finite sets using lists.
2211 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2213 - Executable_Real implements a subset of real numbers, namly those
2214 representable by rational numbers.
2215 - Efficient_Nat implements natural numbers by integers, which in general will
2216 result in higher efficency; pattern matching with 0/Suc is eliminated;
2217 includes Code_Integer.
2218 - Code_Index provides an additional datatype index which is mapped to
2219 target-language built-in integers.
2220 - Code_Message provides an additional datatype message_string which is isomorphic to
2221 strings; messages are mapped to target-language strings.
2223 * New package for inductive predicates
2225 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2228 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2229 for z_1 :: U_1 and ... and z_n :: U_m
2231 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2234 with full support for type-inference, rather than
2236 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2238 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2239 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2241 inductive "s z_1 ... z_m"
2243 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2246 For backward compatibility, there is a wrapper allowing inductive
2247 sets to be defined with the new package via
2250 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2251 for z_1 :: U_1 and ... and z_n :: U_m
2253 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2259 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2260 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2261 for z_1 :: U_1 and ... and z_n :: U_m
2263 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2264 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2267 if the additional syntax "p ..." is required.
2269 Numerous examples can be found in the subdirectories src/HOL/Auth,
2270 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
2274 - Since declaration and definition of inductive sets or predicates
2275 is no longer separated, abbreviations involving the newly
2276 introduced sets or predicates must be specified together with the
2277 introduction rules after the 'where' keyword (see above), rather
2278 than before the actual inductive definition.
2280 - The variables in induction and elimination rules are now
2281 quantified in the order of their occurrence in the introduction
2282 rules, rather than in alphabetical order. Since this may break
2283 some proofs, these proofs either have to be repaired, e.g. by
2284 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
2285 statements of the form
2287 case (rule_i a_i_1 ... a_i_{k_i})
2289 or the old order of quantification has to be restored by explicitly adding
2290 meta-level quantifiers in the introduction rules, i.e.
2292 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
2294 - The format of the elimination rules is now
2296 p z_1 ... z_m x_1 ... x_n ==>
2297 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2302 (x_1, ..., x_n) : s z_1 ... z_m ==>
2303 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2306 for sets rather than
2308 x : s z_1 ... z_m ==>
2309 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
2312 This may require terms in goals to be expanded to n-tuples
2313 (e.g. using case_tac or simplification with the split_paired_all
2314 rule) before the above elimination rule is applicable.
2316 - The elimination or case analysis rules for (mutually) inductive
2317 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
2318 list of rules "p_1_..._p_k.elims" is no longer available.
2320 * New package "function"/"fun" for general recursive functions,
2321 supporting mutual and nested recursion, definitions in local contexts,
2322 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
2323 for small examples, and the separate tutorial on the function
2324 package. The old recdef "package" is still available as before, but
2325 users are encouraged to use the new package.
2327 * Method "lexicographic_order" automatically synthesizes termination
2328 relations as lexicographic combinations of size measures.
2330 * Case-expressions allow arbitrary constructor-patterns (including
2331 "_") and take their order into account, like in functional
2332 programming. Internally, this is translated into nested
2333 case-expressions; missing cases are added and mapped to the predefined
2334 constant "undefined". In complicated cases printing may no longer show
2335 the original input but the internal form. Lambda-abstractions allow
2336 the same form of pattern matching: "% pat1 => e1 | ..." is an
2337 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
2340 * IntDef: The constant "int :: nat => int" has been removed; now "int"
2341 is an abbreviation for "of_nat :: nat => int". The simplification
2342 rules for "of_nat" have been changed to work like "int" did
2343 previously. Potential INCOMPATIBILITY:
2344 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
2345 - of_nat_diff and of_nat_mult are no longer default simp rules
2347 * Method "algebra" solves polynomial equations over (semi)rings using
2348 Groebner bases. The (semi)ring structure is defined by locales and the
2349 tool setup depends on that generic context. Installing the method for
2350 a specific type involves instantiating the locale and possibly adding
2351 declarations for computation on the coefficients. The method is
2352 already instantiated for natural numbers and for the axiomatic class
2353 of idoms with numerals. See also the paper by Chaieb and Wenzel at
2354 CALCULEMUS 2007 for the general principles underlying this
2355 architecture of context-aware proof-tools.
2357 * Method "ferrack" implements quantifier elimination over
2358 special-purpose dense linear orders using locales (analogous to
2359 "algebra"). The method is already installed for class
2360 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
2363 * Former constant "List.op @" now named "List.append". Use ML
2364 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
2365 circumvent possible incompatibilities when working on ML level.
2367 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
2369 * New function listsum :: 'a list => 'a for arbitrary monoids.
2370 Special syntax: "SUM x <- xs. f x" (and latex variants)
2372 * New syntax for Haskell-like list comprehension (input only), eg.
2373 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
2375 * The special syntax for function "filter" has changed from [x :
2376 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
2377 comprehension syntax, and for uniformity. INCOMPATIBILITY.
2379 * [a..b] is now defined for arbitrary linear orders. It used to be
2380 defined on nat only, as an abbreviation for [a..<Suc b]
2383 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
2385 * New functions "sorted" and "sort" in src/HOL/List.thy.
2387 * New lemma collection field_simps (an extension of ring_simps) for
2388 manipulating (in)equations involving division. Multiplies with all
2389 denominators that can be proved to be non-zero (in equations) or
2390 positive/negative (in inequations).
2392 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
2393 have been improved and renamed to ring_simps, group_simps and
2394 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
2395 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
2397 * Theory Library/Commutative_Ring: switched from recdef to function
2398 package; constants add, mul, pow now curried. Infix syntax for
2399 algebraic operations.
2401 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
2404 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
2407 * HOL/records: generalised field-update to take a function on the
2408 field rather than the new value: r(|A := x|) is translated to A_update
2409 (K x) r The K-combinator that is internally used is called K_record.
2410 INCOMPATIBILITY: Usage of the plain update functions has to be
2413 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
2414 * x = 0, which are required for a semiring. Richer structures do not
2415 inherit from semiring_0 anymore, because this property is a theorem
2416 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
2417 there is more to prove, but this is mostly trivial.
2419 * Class "recpower" is generalized to arbitrary monoids, not just
2420 commutative semirings. INCOMPATIBILITY: may need to incorporate
2421 commutativity or semiring properties additionally.
2423 * Constant "List.list_all2" in List.thy now uses authentic syntax.
2424 INCOMPATIBILITY: translations containing list_all2 may go wrong,
2425 better use 'abbreviation'.
2427 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
2429 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
2430 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
2431 significant changes for setting up numeral syntax for types:
2432 - New constants Numeral.pred and Numeral.succ instead
2433 of former Numeral.bin_pred and Numeral.bin_succ.
2434 - Use integer operations instead of bin_add, bin_mult and so on.
2435 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
2436 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
2438 See src/HOL/Integ/IntArith.thy for an example setup.
2440 * Command 'normal_form' computes the normal form of a term that may
2441 contain free variables. For example ``normal_form "rev [a, b, c]"''
2442 produces ``[b, c, a]'' (without proof). This command is suitable for
2443 heavy-duty computations because the functions are compiled to ML
2444 first. Correspondingly, a method "normalization" is provided. See
2445 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
2447 * Alternative iff syntax "A <-> B" for equality on bool (with priority
2448 25 like -->); output depends on the "iff" print_mode, the default is
2449 "A = B" (with priority 50).
2451 * Relations less (<) and less_eq (<=) are also available on type bool.
2452 Modified syntax to disallow nesting without explicit parentheses,
2453 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
2456 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
2458 * Relation composition operator "op O" now has precedence 75 and binds
2459 stronger than union and intersection. INCOMPATIBILITY.
2461 * The old set interval syntax "{m..n(}" (and relatives) has been
2462 removed. Use "{m..<n}" (and relatives) instead.
2464 * In the context of the assumption "~(s = t)" the Simplifier rewrites
2465 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
2466 ``declare [[simproc del: neq]]''.
2468 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
2471 * Theorem Cons_eq_map_conv no longer declared as "simp".
2473 * Theorem setsum_mult renamed to setsum_right_distrib.
2475 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
2478 * Reimplemented methods "sat" and "satx", with several improvements:
2479 goals no longer need to be stated as "<prems> ==> False", equivalences
2480 (i.e. "=" on type bool) are handled, variable names of the form
2481 "lit_<n>" are no longer reserved, significant speedup.
2483 * Methods "sat" and "satx" can now replay MiniSat proof traces.
2484 zChaff is still supported as well.
2486 * 'inductive' and 'datatype': provide projections of mutual rules,
2487 bundled as foo_bar.inducts;
2489 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
2492 * Library: moved theory Accessible_Part to main HOL.
2494 * Library: added theory Coinductive_List of potentially infinite lists
2495 as greatest fixed-point.
2497 * Library: added theory AssocList which implements (finite) maps as
2500 * Method "evaluation" solves goals (i.e. a boolean expression)
2501 efficiently by compiling it to ML. The goal is "proved" (via an
2502 oracle) if it evaluates to True.
2504 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
2505 also when invoked by the simplifier. This results in the Simplifier
2506 being more powerful on arithmetic goals. INCOMPATIBILITY.
2507 Configuration option fast_arith_split_limit=0 recovers the old
2510 * Support for hex (0x20) and binary (0b1001) numerals.
2512 * New method: reify eqs (t), where eqs are equations for an
2513 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
2514 parameter, computes a term s::'b and a list xs::'a list and proves the
2515 theorem I xs s = t. This is also known as reification or quoting. The
2516 resulting theorem is applied to the subgoal to substitute t with I xs
2517 s. If t is omitted, the subgoal itself is reified.
2519 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
2520 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
2521 where f is supposed to be a computable function (in the sense of code
2522 generattion). The method uses reify to compute s and xs as above then
2523 applies corr_thm and uses normalization by evaluation to "prove" f s =
2524 r and finally gets the theorem t = r, which is again applied to the
2525 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
2527 * Reflection: Automatic reification now handels binding, an example is
2528 available in src/HOL/ex/ReflectionEx.thy
2530 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
2531 command 'statespace' that is similar to 'record', but introduces an
2532 abstract specification based on the locale infrastructure instead of
2533 HOL types. This leads to extra flexibility in composing state spaces,
2534 in particular multiple inheritance and renaming of components.
2539 * Hyperreal: Functions root and sqrt are now defined on negative real
2540 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
2541 Nonnegativity side conditions have been removed from many lemmas, so
2542 that more subgoals may now be solved by simplification; potential
2545 * Real: new type classes formalize real normed vector spaces and
2546 algebras, using new overloaded constants scaleR :: real => 'a => 'a
2547 and norm :: 'a => real.
2549 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
2550 reals into other types. The overloaded constant Reals :: 'a set is now
2551 defined as range of_real; potential INCOMPATIBILITY.
2553 * Real: proper support for ML code generation, including 'quickcheck'.
2554 Reals are implemented as arbitrary precision rationals.
2556 * Hyperreal: Several constants that previously worked only for the
2557 reals have been generalized, so they now work over arbitrary vector
2558 spaces. Type annotations may need to be added in some cases; potential
2561 Infinitesimal :: ('a::real_normed_vector) star set
2562 HFinite :: ('a::real_normed_vector) star set
2563 HInfinite :: ('a::real_normed_vector) star set
2564 approx :: ('a::real_normed_vector) star => 'a star => bool
2565 monad :: ('a::real_normed_vector) star => 'a star set
2566 galaxy :: ('a::real_normed_vector) star => 'a star set
2567 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
2568 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
2569 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
2570 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
2571 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
2572 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
2573 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
2574 sgn :: 'a::real_normed_vector => 'a
2575 exp :: 'a::{recpower,real_normed_field,banach} => 'a
2577 * Complex: Some complex-specific constants are now abbreviations for
2578 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
2579 hnorm. Other constants have been entirely removed in favor of the
2580 polymorphic versions (INCOMPATIBILITY):
2584 HInfinite <-- CInfinite
2585 Infinitesimal <-- CInfinitesimal
2588 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
2589 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
2590 (ns)deriv <-- (ns)cderiv
2595 * Formalisation of ideals and the quotient construction over rings.
2597 * Order and lattice theory no longer based on records.
2600 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
2601 greatest_closed. INCOMPATIBILITY.
2603 * Method algebra is now set up via an attribute. For examples see
2604 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
2605 of algebraic structures.
2607 * Renamed theory CRing to Ring.
2612 * Substantial, yet incomplete support for nominal datatypes (binding
2613 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
2614 src/HOL/Nominal/Examples. Prospective users should consult
2615 http://isabelle.in.tum.de/nominal/
2620 * ML basics: just one true type int, which coincides with IntInf.int
2623 * ML within Isar: antiquotations allow to embed statically-checked
2624 formal entities in the source, referring to the context available at
2625 compile-time. For example:
2627 ML {* @{sort "{zero,one}"} *}
2628 ML {* @{typ "'a => 'b"} *}
2629 ML {* @{term "%x. x"} *}
2630 ML {* @{prop "x == y"} *}
2631 ML {* @{ctyp "'a => 'b"} *}
2632 ML {* @{cterm "%x. x"} *}
2633 ML {* @{cprop "x == y"} *}
2634 ML {* @{thm asm_rl} *}
2635 ML {* @{thms asm_rl} *}
2636 ML {* @{type_name c} *}
2637 ML {* @{type_syntax c} *}
2638 ML {* @{const_name c} *}
2639 ML {* @{const_syntax c} *}
2642 ML {* @{theory Pure} *}
2643 ML {* @{theory_ref} *}
2644 ML {* @{theory_ref Pure} *}
2647 ML {* @{clasimpset} *}
2649 The same works for sources being ``used'' within an Isar context.
2651 * ML in Isar: improved error reporting; extra verbosity with
2652 ML_Context.trace enabled.
2654 * Pure/General/table.ML: the join operations now works via exceptions
2655 DUP/SAME instead of type option. This is simpler in simple cases, and
2656 admits slightly more efficient complex applications.
2658 * Pure: 'advanced' translation functions (parse_translation etc.) now
2659 use Context.generic instead of just theory.
2661 * Pure: datatype Context.generic joins theory/Proof.context and
2662 provides some facilities for code that works in either kind of
2663 context, notably GenericDataFun for uniform theory and proof data.
2665 * Pure: simplified internal attribute type, which is now always
2666 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
2667 local (Proof.context) attributes have been discontinued, while
2668 minimizing code duplication. Thm.rule_attribute and
2669 Thm.declaration_attribute build canonical attributes; see also structure
2670 Context for further operations on Context.generic, notably
2671 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
2672 declarations and definitions.
2674 * Context data interfaces (Theory/Proof/GenericDataFun): removed
2675 name/print, uninitialized data defaults to ad-hoc copy of empty value,
2676 init only required for impure data. INCOMPATIBILITY: empty really need
2677 to be empty (no dependencies on theory content!)
2679 * Pure/kernel: consts certification ignores sort constraints given in
2680 signature declarations. (This information is not relevant to the
2681 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
2682 potential INCOMPATIBILITY.
2684 * Pure: axiomatic type classes are now purely definitional, with
2685 explicit proofs of class axioms and super class relations performed
2686 internally. See Pure/axclass.ML for the main internal interfaces --
2687 notably AxClass.define_class supercedes AxClass.add_axclass, and
2688 AxClass.axiomatize_class/classrel/arity supersede
2689 Sign.add_classes/classrel/arities.
2691 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
2692 global/local versions on theory vs. Proof.context have been
2693 discontinued; Attrib.syntax and Method.syntax have been adapted
2694 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
2695 attributes, methods, etc.
2697 * Pure: several functions of signature "... -> theory -> theory * ..."
2698 have been reoriented to "... -> theory -> ... * theory" in order to
2699 allow natural usage in combination with the ||>, ||>>, |-> and
2700 fold_map combinators.
2702 * Pure: official theorem names (closed derivations) and additional
2703 comments (tags) are now strictly separate. Name hints -- which are
2704 maintained as tags -- may be attached any time without affecting the
2707 * Pure: primitive rule lift_rule now takes goal cterm instead of an
2708 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
2709 achieve the old behaviour.
2711 * Pure: the "Goal" constant is now called "prop", supporting a
2712 slightly more general idea of ``protecting'' meta-level rule
2715 * Pure: Logic.(un)varify only works in a global context, which is now
2716 enforced instead of silently assumed. INCOMPATIBILITY, may use
2717 Logic.legacy_(un)varify as temporary workaround.
2719 * Pure: structure Name provides scalable operations for generating
2720 internal variable names, notably Name.variants etc. This replaces
2721 some popular functions from term.ML:
2723 Term.variant -> Name.variant
2724 Term.variantlist -> Name.variant_list
2725 Term.invent_names -> Name.invent_list
2727 Note that low-level renaming rarely occurs in new code -- operations
2728 from structure Variable are used instead (see below).
2730 * Pure: structure Variable provides fundamental operations for proper
2731 treatment of fixed/schematic variables in a context. For example,
2732 Variable.import introduces fixes for schematics of given facts and
2733 Variable.export reverses the effect (up to renaming) -- this replaces
2734 various freeze_thaw operations.
2736 * Pure: structure Goal provides simple interfaces for
2737 init/conclude/finish and tactical prove operations (replacing former
2738 Tactic.prove). Goal.prove is the canonical way to prove results
2739 within a given context; Goal.prove_global is a degraded version for
2740 theory level goals, including a global Drule.standard. Note that
2741 OldGoals.prove_goalw_cterm has long been obsolete, since it is
2742 ill-behaved in a local proof context (e.g. with local fixes/assumes or
2743 in a locale context).
2745 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
2746 and type checking (Syntax.check_term etc.), with common combinations
2747 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
2748 which are considered legacy and await removal.
2750 * Pure/Syntax: generic interfaces for type unchecking
2751 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
2752 with common combinations (Syntax.pretty_term, Syntax.string_of_term
2753 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
2754 available for convenience, but refer to the very same operations using
2755 a mere theory instead of a full context.
2757 * Isar: simplified treatment of user-level errors, using exception
2758 ERROR of string uniformly. Function error now merely raises ERROR,
2759 without any side effect on output channels. The Isar toplevel takes
2760 care of proper display of ERROR exceptions. ML code may use plain
2761 handle/can/try; cat_error may be used to concatenate errors like this:
2763 ... handle ERROR msg => cat_error msg "..."
2765 Toplevel ML code (run directly or through the Isar toplevel) may be
2766 embedded into the Isar toplevel with exception display/debug like
2769 Isar.toplevel (fn () => ...)
2771 INCOMPATIBILITY, removed special transform_error facilities, removed
2772 obsolete variants of user-level exceptions (ERROR_MESSAGE,
2773 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
2774 -- use plain ERROR instead.
2776 * Isar: theory setup now has type (theory -> theory), instead of a
2777 list. INCOMPATIBILITY, may use #> to compose setup functions.
2779 * Isar: ML toplevel pretty printer for type Proof.context, subject to
2780 ProofContext.debug/verbose flags.
2782 * Isar: Toplevel.theory_to_proof admits transactions that modify the
2783 theory before entering a proof state. Transactions now always see a
2784 quasi-functional intermediate checkpoint, both in interactive and
2787 * Isar: simplified interfaces for outer syntax. Renamed
2788 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
2789 OuterSyntax.add_parsers -- this functionality is now included in
2790 OuterSyntax.command etc. INCOMPATIBILITY.
2792 * Simplifier: the simpset of a running simplification process now
2793 contains a proof context (cf. Simplifier.the_context), which is the
2794 very context that the initial simpset has been retrieved from (by
2795 simpset_of/local_simpset_of). Consequently, all plug-in components
2796 (solver, looper etc.) may depend on arbitrary proof data.
2798 * Simplifier.inherit_context inherits the proof context (plus the
2799 local bounds) of the current simplification process; any simproc
2800 etc. that calls the Simplifier recursively should do this! Removed
2801 former Simplifier.inherit_bounds, which is already included here --
2802 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
2803 specify an explicit context using Simplifier.context/theory_context.
2805 * Simplifier/Classical Reasoner: more abstract interfaces
2806 change_simpset/claset for modifying the simpset/claset reference of a
2807 theory; raw versions simpset/claset_ref etc. have been discontinued --
2810 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
2816 * settings: the default heap location within ISABELLE_HOME_USER now
2817 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
2818 Isabelle installations.
2820 * isabelle-process: option -S (secure mode) disables some critical
2821 operations, notably runtime compilation and evaluation of ML source
2824 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
2826 * Support for parallel execution, using native multicore support of
2827 Poly/ML 5.1. The theory loader exploits parallelism when processing
2828 independent theories, according to the given theory header
2829 specifications. The maximum number of worker threads is specified via
2830 usedir option -M or the "max-threads" setting in Proof General. A
2831 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
2832 to 6 on a 8-core machine. User-code needs to observe certain
2833 guidelines for thread-safe programming, see appendix A in the Isar
2834 Implementation manual.
2838 New in Isabelle2005 (October 2005)
2839 ----------------------------------
2843 * Theory headers: the new header syntax for Isar theories is
2846 imports <theory1> ... <theoryN>
2847 uses <file1> ... <fileM>
2850 where the 'uses' part is optional. The previous syntax
2852 theory <name> = <theory1> + ... + <theoryN>:
2854 will disappear in the next release. Use isatool fixheaders to convert
2855 existing theory files. Note that there is no change in ancient
2856 non-Isar theories now, but these will disappear soon.
2858 * Theory loader: parent theories can now also be referred to via
2859 relative and absolute paths.
2861 * Command 'find_theorems' searches for a list of criteria instead of a
2862 list of constants. Known criteria are: intro, elim, dest, name:string,
2863 simp:term, and any term. Criteria can be preceded by '-' to select
2864 theorems that do not match. Intro, elim, dest select theorems that
2865 match the current goal, name:s selects theorems whose fully qualified
2866 name contain s, and simp:term selects all simplification rules whose
2867 lhs match term. Any other term is interpreted as pattern and selects
2868 all theorems matching the pattern. Available in ProofGeneral under
2869 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
2871 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
2873 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
2874 matching the current goal as introduction rule and not having "HOL."
2875 in their name (i.e. not being defined in theory HOL).
2877 * Command 'thms_containing' has been discontinued in favour of
2878 'find_theorems'; INCOMPATIBILITY.
2880 * Communication with Proof General is now 8bit clean, which means that
2881 Unicode text in UTF-8 encoding may be used within theory texts (both
2882 formal and informal parts). Cf. option -U of the Isabelle Proof
2883 General interface. Here are some simple examples (cf. src/HOL/ex):
2885 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
2886 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
2888 * Improved efficiency of the Simplifier and, to a lesser degree, the
2889 Classical Reasoner. Typical big applications run around 2 times
2893 *** Document preparation ***
2895 * Commands 'display_drafts' and 'print_drafts' perform simple output
2896 of raw sources. Only those symbols that do not require additional
2897 LaTeX packages (depending on comments in isabellesym.sty) are
2898 displayed properly, everything else is left verbatim. isatool display
2899 and isatool print are used as front ends (these are subject to the
2900 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
2902 * Command tags control specific markup of certain regions of text,
2903 notably folding and hiding. Predefined tags include "theory" (for
2904 theory begin and end), "proof" for proof commands, and "ML" for
2905 commands involving ML code; the additional tags "visible" and
2906 "invisible" are unused by default. Users may give explicit tag
2907 specifications in the text, e.g. ''by %invisible (auto)''. The
2908 interpretation of tags is determined by the LaTeX job during document
2909 preparation: see option -V of isatool usedir, or options -n and -t of
2910 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
2913 Several document versions may be produced at the same time via isatool
2914 usedir (the generated index.html will link all of them). Typical
2915 specifications include ''-V document=theory,proof,ML'' to present
2916 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
2917 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
2918 these parts without any formal replacement text. The Isabelle site
2919 default settings produce ''document'' and ''outline'' versions as
2922 * Several new antiquotations:
2924 @{term_type term} prints a term with its type annotated;
2926 @{typeof term} prints the type of a term;
2928 @{const const} is the same as @{term const}, but checks that the
2929 argument is a known logical constant;
2931 @{term_style style term} and @{thm_style style thm} print a term or
2932 theorem applying a "style" to it
2936 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
2937 definitions, equations, inequations etc., 'concl' printing only the
2938 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
2939 to print the specified premise. TermStyle.add_style provides an ML
2940 interface for introducing further styles. See also the "LaTeX Sugar"
2941 document practical applications. The ML antiquotation prints
2942 type-checked ML expressions verbatim.
2944 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
2945 and 'text' support optional locale specification '(in loc)', which
2946 specifies the default context for interpreting antiquotations. For
2947 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
2949 * Option 'locale=NAME' of antiquotations specifies an alternative
2950 context interpreting the subsequent argument. For example: @{thm
2951 [locale=lattice] inf_assoc}.
2953 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
2956 * Proper output of antiquotations for theory commands involving a
2957 proof context (such as 'locale' or 'theorem (in loc) ...').
2959 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
2960 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
2962 * isatool usedir: new option -C (default true) controls whether option
2963 -D should include a copy of the original document directory; -C false
2964 prevents unwanted effects such as copying of administrative CVS data.
2969 * Considerably improved version of 'constdefs' command. Now performs
2970 automatic type-inference of declared constants; additional support for
2971 local structure declarations (cf. locales and HOL records), see also
2972 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
2973 sequential dependencies of definitions within a single 'constdefs'
2974 section; moreover, the declared name needs to be an identifier. If
2975 all fails, consider to fall back on 'consts' and 'defs' separately.
2977 * Improved indexed syntax and implicit structures. First of all,
2978 indexed syntax provides a notational device for subscripted
2979 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
2980 expressions. Secondly, in a local context with structure
2981 declarations, number indexes \<^sub>n or the empty index (default
2982 number 1) refer to a certain fixed variable implicitly; option
2983 show_structs controls printing of implicit structures. Typical
2984 applications of these concepts involve record types and locales.
2986 * New command 'no_syntax' removes grammar declarations (and
2987 translations) resulting from the given syntax specification, which is
2988 interpreted in the same manner as for the 'syntax' command.
2990 * 'Advanced' translation functions (parse_translation etc.) may depend
2991 on the signature of the theory context being presently used for
2992 parsing/printing, see also isar-ref manual.
2994 * Improved 'oracle' command provides a type-safe interface to turn an
2995 ML expression of type theory -> T -> term into a primitive rule of
2996 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
2997 is already included here); see also FOL/ex/IffExample.thy;
3000 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3001 before); "cI" is no longer bound, use "c.intro" instead.
3002 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3003 axclasses vs. locales.
3005 * Improved internal renaming of symbolic identifiers -- attach primes
3006 instead of base 26 numbers.
3008 * New flag show_question_marks controls printing of leading question
3009 marks in schematic variable names.
3011 * In schematic variable names, *any* symbol following \<^isub> or
3012 \<^isup> is now treated as part of the base name. For example, the
3013 following works without printing of awkward ".0" indexes:
3015 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3018 * Inner syntax includes (*(*nested*) comments*).
3020 * Pretty printer now supports unbreakable blocks, specified in mixfix
3021 annotations as "(00...)".
3023 * Clear separation of logical types and nonterminals, where the latter
3024 may only occur in 'syntax' specifications or type abbreviations.
3025 Before that distinction was only partially implemented via type class
3026 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3027 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3028 exotic syntax specifications may require further adaption
3029 (e.g. Cube/Cube.thy).
3031 * Removed obsolete type class "logic", use the top sort {} instead.
3032 Note that non-logical types should be declared as 'nonterminals'
3033 rather than 'types'. INCOMPATIBILITY for new object-logic
3036 * Attributes 'induct' and 'cases': type or set names may now be
3037 locally fixed variables as well.
3039 * Simplifier: can now control the depth to which conditional rewriting
3040 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3043 * Simplifier: simplification procedures may now take the current
3044 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3045 interface), which is very useful for calling the Simplifier
3046 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3047 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3048 low-level mk_simproc no longer applies Logic.varify internally, to
3049 allow for use in a context of fixed variables.
3051 * thin_tac now works even if the assumption being deleted contains !!
3052 or ==>. More generally, erule now works even if the major premise of
3053 the elimination rule contains !! or ==>.
3055 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3057 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3058 from Pure, which contains all common declarations already. Both
3059 theories are defined via plain Isabelle/Isar .thy files.
3060 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3061 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3062 use isatool fixcpure to adapt your theory and ML sources.
3064 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3065 selections of theorems in named facts via index ranges.
3067 * 'print_theorems': in theory mode, really print the difference
3068 wrt. the last state (works for interactive theory development only),
3069 in proof mode print all local facts (cf. 'print_facts');
3071 * 'hide': option '(open)' hides only base names.
3073 * More efficient treatment of intermediate checkpoints in interactive
3076 * Code generator is now invoked via code_module (incremental code
3077 generation) and code_library (modular code generation, ML structures
3078 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3079 must be quoted when used as identifiers.
3081 * New 'value' command for reading, evaluating and printing terms using
3082 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3083 quoted when used as identifier.
3088 * New commands for the interpretation of locale expressions in
3089 theories (1), locales (2) and proof contexts (3). These generate
3090 proof obligations from the expression specification. After the
3091 obligations have been discharged, theorems of the expression are added
3092 to the theory, target locale or proof context. The synopsis of the
3093 commands is a follows:
3095 (1) interpretation expr inst
3096 (2) interpretation target < expr
3097 (3) interpret expr inst
3099 Interpretation in theories and proof contexts require a parameter
3100 instantiation of terms from the current context. This is applied to
3101 specifications and theorems of the interpreted expression.
3102 Interpretation in locales only permits parameter renaming through the
3103 locale expression. Interpretation is smart in that interpretations
3104 that are active already do not occur in proof obligations, neither are
3105 instantiated theorems stored in duplicate. Use 'print_interps' to
3106 inspect active interpretations of a particular locale. For details,
3107 see the Isar Reference manual. Examples can be found in
3108 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3110 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3111 'interpret' instead.
3113 * New context element 'constrains' for adding type constraints to
3116 * Context expressions: renaming of parameters with syntax
3119 * Locale declaration: 'includes' disallowed.
3121 * Proper static binding of attribute syntax -- i.e. types / terms /
3122 facts mentioned as arguments are always those of the locale definition
3123 context, independently of the context of later invocations. Moreover,
3124 locale operations (renaming and type / term instantiation) are applied
3125 to attribute arguments as expected.
3127 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3128 actual attributes; rare situations may require Attrib.attribute to
3129 embed those attributes into Attrib.src that lack concrete syntax.
3130 Attribute implementations need to cooperate properly with the static
3131 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3132 Attrib.XXX_thm etc. already do the right thing without further
3133 intervention. Only unusual applications -- such as "where" or "of"
3134 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3135 on the context and the facts involved -- may have to assign parsed
3136 values to argument tokens explicitly.
3138 * Changed parameter management in theorem generation for long goal
3139 statements with 'includes'. INCOMPATIBILITY: produces a different
3140 theorem statement in rare situations.
3142 * Locale inspection command 'print_locale' omits notes elements. Use
3143 'print_locale!' to have them included in the output.
3148 * Provers/hypsubst.ML: improved version of the subst method, for
3149 single-step rewriting: it now works in bound variable contexts. New is
3150 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3151 rewrite a different subterm than the original subst method, which is
3152 still available as 'simplesubst'.
3154 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3157 * Provers/trancl.ML: new transitivity reasoner for transitive and
3158 reflexive-transitive closure of relations.
3160 * Provers/blast.ML: new reference depth_limit to make blast's depth
3161 limit (previously hard-coded with a value of 20) user-definable.
3163 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3164 is peformed already. Object-logics merely need to finish their
3165 initial simpset configuration as before. INCOMPATIBILITY.
3170 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3173 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3175 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3176 and x-symbol; use option '-m epsilon' to get it actually printed.
3177 Moreover, the mathematically important symbolic identifier \<epsilon>
3178 becomes available as variable, constant etc. INCOMPATIBILITY,
3180 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3181 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3182 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3183 support corresponding Isar calculations.
3185 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3188 * theory SetInterval: changed the syntax for open intervals:
3197 The old syntax is still supported but will disappear in the next
3198 release. For conversion use the following Emacs search and replace
3199 patterns (these are not perfect but work quite well):
3201 {)\([^\.]*\)\.\. -> {\1<\.\.}
3202 \.\.\([^(}]*\)(} -> \.\.<\1}
3204 * Theory Commutative_Ring (in Library): method comm_ring for proving
3205 equalities in commutative rings; method 'algebra' provides a generic
3208 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3209 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3210 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3213 Some new syntax forms are available:
3215 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3216 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3217 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3218 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3220 The latter form "\<Sum>x < k. e" used to be based on a separate
3221 function "Summation", which has been discontinued.
3223 * theory Finite_Set: in structured induction proofs, the insert case
3224 is now 'case (insert x F)' instead of the old counterintuitive 'case
3227 * The 'refute' command has been extended to support a much larger
3228 fragment of HOL, including axiomatic type classes, constdefs and
3229 typedefs, inductive datatypes and recursion.
3231 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3232 Requires zChaff with proof generation to be installed. See
3233 HOL/ex/SAT_Examples.thy for examples.
3235 * Datatype induction via method 'induct' now preserves the name of the
3236 induction variable. For example, when proving P(xs::'a list) by
3237 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3238 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3239 in unstructured proof scripts.
3241 * Reworked implementation of records. Improved scalability for
3242 records with many fields, avoiding performance problems for type
3243 inference. Records are no longer composed of nested field types, but
3244 of nested extension types. Therefore the record type only grows linear
3245 in the number of extensions and not in the number of fields. The
3246 top-level (users) view on records is preserved. Potential
3247 INCOMPATIBILITY only in strange cases, where the theory depends on the
3248 old record representation. The type generated for a record is called
3249 <record_name>_ext_type.
3251 Flag record_quick_and_dirty_sensitive can be enabled to skip the
3252 proofs triggered by a record definition or a simproc (if
3253 quick_and_dirty is enabled). Definitions of large records can take
3256 New simproc record_upd_simproc for simplification of multiple record
3257 updates enabled by default. Moreover, trivial updates are also
3258 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
3259 occasionally, since simplification is more powerful by default.
3261 * typedef: proper support for polymorphic sets, which contain extra
3262 type-variables in the term.
3264 * Simplifier: automatically reasons about transitivity chains
3265 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
3266 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
3267 old proofs break occasionally as simplification may now solve more
3268 goals than previously.
3270 * Simplifier: converts x <= y into x = y if assumption y <= x is
3271 present. Works for all partial orders (class "order"), in particular
3272 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
3275 * Simplifier: new simproc for "let x = a in f x". If a is a free or
3276 bound variable or a constant then the let is unfolded. Otherwise
3277 first a is simplified to b, and then f b is simplified to g. If
3278 possible we abstract b from g arriving at "let x = b in h x",
3279 otherwise we unfold the let and arrive at g. The simproc can be
3280 enabled/disabled by the reference use_let_simproc. Potential
3281 INCOMPATIBILITY since simplification is more powerful by default.
3283 * Classical reasoning: the meson method now accepts theorems as arguments.
3285 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
3286 jobs to provide advice on the provability of subgoals.
3288 * Theory OrderedGroup and Ring_and_Field: various additions and
3289 improvements to faciliate calculations involving equalities and
3292 The following theorems have been eliminated or modified
3295 abs_eq now named abs_of_nonneg
3296 abs_of_ge_0 now named abs_of_nonneg
3297 abs_minus_eq now named abs_of_nonpos
3298 imp_abs_id now named abs_of_nonneg
3299 imp_abs_neg_id now named abs_of_nonpos
3300 mult_pos now named mult_pos_pos
3301 mult_pos_le now named mult_nonneg_nonneg
3302 mult_pos_neg_le now named mult_nonneg_nonpos
3303 mult_pos_neg2_le now named mult_nonneg_nonpos2
3304 mult_neg now named mult_neg_neg
3305 mult_neg_le now named mult_nonpos_nonpos
3307 * The following lemmas in Ring_and_Field have been added to the simplifier:
3310 not_square_less_zero
3312 The following lemmas have been deleted from Real/RealPow:
3322 * Theory Parity: added rules for simplifying exponents.
3326 The following theorems have been eliminated or modified
3329 list_all_Nil now named list_all.simps(1)
3330 list_all_Cons now named list_all.simps(2)
3331 list_all_conv now named list_all_iff
3332 set_mem_eq now named mem_iff
3334 * Theories SetsAndFunctions and BigO (see HOL/Library) support
3335 asymptotic "big O" calculations. See the notes in BigO.thy.
3340 * Theory RealDef: better support for embedding natural numbers and
3341 integers in the reals.
3343 The following theorems have been eliminated or modified
3346 exp_ge_add_one_self now requires no hypotheses
3347 real_of_int_add reversed direction of equality (use [symmetric])
3348 real_of_int_minus reversed direction of equality (use [symmetric])
3349 real_of_int_diff reversed direction of equality (use [symmetric])
3350 real_of_int_mult reversed direction of equality (use [symmetric])
3352 * Theory RComplete: expanded support for floor and ceiling functions.
3354 * Theory Ln is new, with properties of the natural logarithm
3356 * Hyperreal: There is a new type constructor "star" for making
3357 nonstandard types. The old type names are now type synonyms:
3361 hcomplex = complex star
3363 * Hyperreal: Many groups of similarly-defined constants have been
3364 replaced by polymorphic versions (INCOMPATIBILITY):
3366 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
3368 starset <-- starsetNat, starsetC
3369 *s* <-- *sNat*, *sc*
3370 starset_n <-- starsetNat_n, starsetC_n
3371 *sn* <-- *sNatn*, *scn*
3372 InternalSets <-- InternalNatSets, InternalCSets
3374 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3375 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
3376 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
3377 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
3378 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
3380 * Hyperreal: Many type-specific theorems have been removed in favor of
3381 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
3383 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
3384 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
3385 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
3386 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
3387 right_minus <-- hypreal_add_minus
3388 left_minus <-- {hypreal,hcomplex}_add_minus_left
3389 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
3390 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
3391 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
3392 mult_1_right <-- hcomplex_mult_one_right
3393 mult_zero_left <-- hcomplex_mult_zero_left
3394 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
3395 right_distrib <-- hypnat_add_mult_distrib2
3396 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
3397 right_inverse <-- hypreal_mult_inverse
3398 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
3399 order_refl <-- {hypreal,hypnat}_le_refl
3400 order_trans <-- {hypreal,hypnat}_le_trans
3401 order_antisym <-- {hypreal,hypnat}_le_anti_sym
3402 order_less_le <-- {hypreal,hypnat}_less_le
3403 linorder_linear <-- {hypreal,hypnat}_le_linear
3404 add_left_mono <-- {hypreal,hypnat}_add_left_mono
3405 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
3406 add_nonneg_nonneg <-- hypreal_le_add_order
3408 * Hyperreal: Separate theorems having to do with type-specific
3409 versions of constants have been merged into theorems that apply to the
3410 new polymorphic constants (INCOMPATIBILITY):
3412 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
3413 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
3414 STAR_Un <-- {STAR,NatStar,STARC}_Un
3415 STAR_Int <-- {STAR,NatStar,STARC}_Int
3416 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
3417 STAR_subset <-- {STAR,NatStar,STARC}_subset
3418 STAR_mem <-- {STAR,NatStar,STARC}_mem
3419 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
3420 STAR_diff <-- {STAR,STARC}_diff
3421 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
3422 STARC_hcomplex_of_complex}_image_subset
3423 starset_n_Un <-- starset{Nat,C}_n_Un
3424 starset_n_Int <-- starset{Nat,C}_n_Int
3425 starset_n_Compl <-- starset{Nat,C}_n_Compl
3426 starset_n_diff <-- starset{Nat,C}_n_diff
3427 InternalSets_Un <-- Internal{Nat,C}Sets_Un
3428 InternalSets_Int <-- Internal{Nat,C}Sets_Int
3429 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
3430 InternalSets_diff <-- Internal{Nat,C}Sets_diff
3431 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
3432 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
3433 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
3434 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
3435 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
3436 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3437 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
3438 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
3439 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
3440 starfun_diff <-- starfun{C,RC,CR}_diff
3441 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
3442 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
3443 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
3444 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
3445 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
3446 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
3447 starfun_Id <-- starfunC_Id
3448 starfun_approx <-- starfun{Nat,CR}_approx
3449 starfun_capprox <-- starfun{C,RC}_capprox
3450 starfun_abs <-- starfunNat_rabs
3451 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
3452 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
3453 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
3454 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
3455 starfun_add_capprox <-- starfun{C,RC}_add_capprox
3456 starfun_add_approx <-- starfunCR_add_approx
3457 starfun_inverse_inverse <-- starfunC_inverse_inverse
3458 starfun_divide <-- starfun{C,CR,RC}_divide
3459 starfun_n <-- starfun{Nat,C}_n
3460 starfun_n_mult <-- starfun{Nat,C}_n_mult
3461 starfun_n_add <-- starfun{Nat,C}_n_add
3462 starfun_n_add_minus <-- starfunNat_n_add_minus
3463 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
3464 starfun_n_minus <-- starfun{Nat,C}_n_minus
3465 starfun_n_eq <-- starfun{Nat,C}_n_eq
3467 star_n_add <-- {hypreal,hypnat,hcomplex}_add
3468 star_n_minus <-- {hypreal,hcomplex}_minus
3469 star_n_diff <-- {hypreal,hcomplex}_diff
3470 star_n_mult <-- {hypreal,hcomplex}_mult
3471 star_n_inverse <-- {hypreal,hcomplex}_inverse
3472 star_n_le <-- {hypreal,hypnat}_le
3473 star_n_less <-- {hypreal,hypnat}_less
3474 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
3475 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
3476 star_n_abs <-- hypreal_hrabs
3477 star_n_divide <-- hcomplex_divide
3479 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
3480 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
3481 star_of_diff <-- hypreal_of_real_diff
3482 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
3483 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
3484 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
3485 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
3486 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
3487 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
3488 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
3489 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
3490 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
3491 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
3492 star_of_number_of <-- {hypreal,hcomplex}_number_of
3493 star_of_number_less <-- number_of_less_hypreal_of_real_iff
3494 star_of_number_le <-- number_of_le_hypreal_of_real_iff
3495 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
3496 star_of_less_number <-- hypreal_of_real_less_number_of_iff
3497 star_of_le_number <-- hypreal_of_real_le_number_of_iff
3498 star_of_power <-- hypreal_of_real_power
3499 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
3501 * Hyperreal: new method "transfer" that implements the transfer
3502 principle of nonstandard analysis. With a subgoal that mentions
3503 nonstandard types like "'a star", the command "apply transfer"
3504 replaces it with an equivalent one that mentions only standard types.
3505 To be successful, all free variables must have standard types; non-
3506 standard variables must have explicit universal quantifiers.
3508 * Hyperreal: A theory of Taylor series.
3513 * Discontinued special version of 'constdefs' (which used to support
3514 continuous functions) in favor of the general Pure one with full
3517 * New simplification procedure for solving continuity conditions; it
3518 is much faster on terms with many nested lambda abstractions (cubic
3519 instead of exponential time).
3521 * New syntax for domain package: selector names are now optional.
3522 Parentheses should be omitted unless argument is lazy, for example:
3524 domain 'a stream = cons "'a" (lazy "'a stream")
3526 * New command 'fixrec' for defining recursive functions with pattern
3527 matching; defining multiple functions with mutual recursion is also
3528 supported. Patterns may include the constants cpair, spair, up, sinl,
3529 sinr, or any data constructor defined by the domain package. The given
3530 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
3531 syntax and examples.
3533 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
3534 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
3535 but the proof obligation additionally includes an admissibility
3536 requirement. The packages generate instances of class cpo or pcpo,
3537 with continuity and strictness theorems for Rep and Abs.
3539 * HOLCF: Many theorems have been renamed according to a more standard naming
3540 scheme (INCOMPATIBILITY):
3542 foo_inject: "foo$x = foo$y ==> x = y"
3543 foo_eq: "(foo$x = foo$y) = (x = y)"
3544 foo_less: "(foo$x << foo$y) = (x << y)"
3545 foo_strict: "foo$UU = UU"
3546 foo_defined: "... ==> foo$x ~= UU"
3547 foo_defined_iff: "(foo$x = UU) = (x = UU)"
3552 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
3553 including the First Isomorphism Theorem (on quotienting by the kernel
3556 * ZF/Simplifier: install second copy of type solver that actually
3557 makes use of TC rules declared to Isar proof contexts (or locales);
3558 the old version is still required for ML proof scripts.
3563 * Converted to Isar theory format; use locales instead of axiomatic
3569 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
3572 * Pure/library.ML no longer defines its own option datatype, but uses
3573 that of the SML basis, which has constructors NONE and SOME instead of
3574 None and Some, as well as exception Option.Option instead of OPTION.
3575 The functions the, if_none, is_some, is_none have been adapted
3576 accordingly, while Option.map replaces apsome.
3578 * Pure/library.ML: the exception LIST has been given up in favour of
3579 the standard exceptions Empty and Subscript, as well as
3580 Library.UnequalLengths. Function like Library.hd and Library.tl are
3581 superceded by the standard hd and tl functions etc.
3583 A number of basic list functions are no longer exported to the ML
3584 toplevel, as they are variants of predefined functions. The following
3585 suggests how one can translate existing code:
3587 rev_append xs ys = List.revAppend (xs, ys)
3588 nth_elem (i, xs) = List.nth (xs, i)
3589 last_elem xs = List.last xs
3590 flat xss = List.concat xss
3591 seq fs = List.app fs
3592 partition P xs = List.partition P xs
3593 mapfilter f xs = List.mapPartial f xs
3595 * Pure/library.ML: several combinators for linear functional
3596 transformations, notably reverse application and composition:
3599 (x, y) |-> f f #-> g
3601 * Pure/library.ML: introduced/changed precedence of infix operators:
3603 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
3605 infix 3 o oo ooo oooo;
3606 infix 4 ~~ upto downto;
3608 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
3611 * Pure/library.ML: natural list combinators fold, fold_rev, and
3612 fold_map support linear functional transformations and nesting. For
3615 fold f [x1, ..., xN] y =
3616 y |> f x1 |> ... |> f xN
3618 (fold o fold) f [xs1, ..., xsN] y =
3619 y |> fold f xs1 |> ... |> fold f xsN
3621 fold f [x1, ..., xN] =
3624 (fold o fold) f [xs1, ..., xsN] =
3625 fold f xs1 #> ... #> fold f xsN
3627 * Pure/library.ML: the following selectors on type 'a option are
3630 the: 'a option -> 'a (*partial*)
3631 these: 'a option -> 'a where 'a = 'b list
3632 the_default: 'a -> 'a option -> 'a
3633 the_list: 'a option -> 'a list
3635 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
3636 basic operations for association lists, following natural argument
3637 order; moreover the explicit equality predicate passed here avoids
3638 potentially expensive polymorphic runtime equality checks.
3639 The old functions may be expressed as follows:
3641 assoc = uncurry (AList.lookup (op =))
3642 assocs = these oo AList.lookup (op =)
3643 overwrite = uncurry (AList.update (op =)) o swap
3645 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
3647 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
3648 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
3650 replacing make_keylist and keyfilter (occassionally used)
3653 make_keylist = AList.make
3654 keyfilter = AList.find (op =)
3656 * eq_fst and eq_snd now take explicit equality parameter, thus
3657 avoiding eqtypes. Naive rewrites:
3659 eq_fst = eq_fst (op =)
3660 eq_snd = eq_snd (op =)
3662 * Removed deprecated apl and apr (rarely used).
3665 apl (n, op) =>>= curry op n
3666 apr (op, m) =>>= fn n => op (n, m)
3668 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
3669 provides a reasonably efficient light-weight implementation of sets as
3672 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
3673 few new operations; existing lookup and update are now curried to
3674 follow natural argument order (for use with fold etc.);
3675 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
3677 * Pure/General: output via the Isabelle channels of
3678 writeln/warning/error etc. is now passed through Output.output, with a
3679 hook for arbitrary transformations depending on the print_mode
3680 (cf. Output.add_mode -- the first active mode that provides a output
3681 function wins). Already formatted output may be embedded into further
3682 text via Output.raw; the result of Pretty.string_of/str_of and derived
3683 functions (string_of_term/cterm/thm etc.) is already marked raw to
3684 accommodate easy composition of diagnostic messages etc. Programmers
3685 rarely need to care about Output.output or Output.raw at all, with
3686 some notable exceptions: Output.output is required when bypassing the
3687 standard channels (writeln etc.), or in token translations to produce
3688 properly formatted results; Output.raw is required when capturing
3689 already output material that will eventually be presented to the user
3690 a second time. For the default print mode, both Output.output and
3691 Output.raw have no effect.
3693 * Pure/General: Output.time_accumulator NAME creates an operator ('a
3694 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
3695 cumulative results are displayed at the end of a batch session.
3697 * Pure/General: File.sysify_path and File.quote_sysify path have been
3698 replaced by File.platform_path and File.shell_path (with appropriate
3699 hooks). This provides a clean interface for unusual systems where the
3700 internal and external process view of file names are different.
3702 * Pure: more efficient orders for basic syntactic entities: added
3703 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
3704 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
3705 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
3706 orders now -- potential INCOMPATIBILITY for code that depends on a
3707 particular order for Symtab.keys, Symtab.dest, etc. (consider using
3708 Library.sort_strings on result).
3710 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
3711 fold_types traverse types/terms from left to right, observing natural
3712 argument order. Supercedes previous foldl_XXX versions, add_frees,
3713 add_vars etc. have been adapted as well: INCOMPATIBILITY.
3715 * Pure: name spaces have been refined, with significant changes of the
3716 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
3717 to extern(_table). The plain name entry path is superceded by a
3718 general 'naming' context, which also includes the 'policy' to produce
3719 a fully qualified name and external accesses of a fully qualified
3720 name; NameSpace.extend is superceded by context dependent
3721 Sign.declare_name. Several theory and proof context operations modify
3722 the naming context. Especially note Theory.restore_naming and
3723 ProofContext.restore_naming to get back to a sane state; note that
3724 Theory.add_path is no longer sufficient to recover from
3725 Theory.absolute_path in particular.
3727 * Pure: new flags short_names (default false) and unique_names
3728 (default true) for controlling output of qualified names. If
3729 short_names is set, names are printed unqualified. If unique_names is
3730 reset, the name prefix is reduced to the minimum required to achieve
3731 the original result when interning again, even if there is an overlap
3732 with earlier declarations.
3734 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
3735 now 'extend', and 'merge' gets an additional Pretty.pp argument
3736 (useful for printing error messages). INCOMPATIBILITY.
3738 * Pure: major reorganization of the theory context. Type Sign.sg and
3739 Theory.theory are now identified, referring to the universal
3740 Context.theory (see Pure/context.ML). Actual signature and theory
3741 content is managed as theory data. The old code and interfaces were
3742 spread over many files and structures; the new arrangement introduces
3743 considerable INCOMPATIBILITY to gain more clarity:
3745 Context -- theory management operations (name, identity, inclusion,
3746 parents, ancestors, merge, etc.), plus generic theory data;
3748 Sign -- logical signature and syntax operations (declaring consts,
3749 types, etc.), plus certify/read for common entities;
3751 Theory -- logical theory operations (stating axioms, definitions,
3752 oracles), plus a copy of logical signature operations (consts,
3753 types, etc.); also a few basic management operations (Theory.copy,
3756 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
3757 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
3758 for convenience -- they merely return the theory.
3760 * Pure: type Type.tsig is superceded by theory in most interfaces.
3762 * Pure: the Isar proof context type is already defined early in Pure
3763 as Context.proof (note that ProofContext.context and Proof.context are
3764 aliases, where the latter is the preferred name). This enables other
3765 Isabelle components to refer to that type even before Isar is present.
3767 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
3768 typeK, constK, axiomK, oracleK), but provide explicit operations for
3769 any of these kinds. For example, Sign.intern typeK is now
3770 Sign.intern_type, Theory.hide_space Sign.typeK is now
3771 Theory.hide_types. Also note that former
3772 Theory.hide_classes/types/consts are now
3773 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
3774 internalize their arguments! INCOMPATIBILITY.
3776 * Pure: get_thm interface (of PureThy and ProofContext) expects
3777 datatype thmref (with constructors Name and NameSelection) instead of
3778 plain string -- INCOMPATIBILITY;
3780 * Pure: cases produced by proof methods specify options, where NONE
3781 means to remove case bindings -- INCOMPATIBILITY in
3784 * Pure: the following operations retrieve axioms or theorems from a
3785 theory node or theory hierarchy, respectively:
3787 Theory.axioms_of: theory -> (string * term) list
3788 Theory.all_axioms_of: theory -> (string * term) list
3789 PureThy.thms_of: theory -> (string * thm) list
3790 PureThy.all_thms_of: theory -> (string * thm) list
3792 * Pure: print_tac now outputs the goal through the trace channel.
3794 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
3795 Reference Toplevel.debug (default false) controls detailed printing
3796 and tracing of low-level exceptions; Toplevel.profiling (default 0)
3797 controls execution profiling -- set to 1 for time and 2 for space
3798 (both increase the runtime).
3800 * Isar session: The initial use of ROOT.ML is now always timed,
3801 i.e. the log will show the actual process times, in contrast to the
3802 elapsed wall-clock time that the outer shell wrapper produces.
3804 * Simplifier: improved handling of bound variables (nameless
3805 representation, avoid allocating new strings). Simprocs that invoke
3806 the Simplifier recursively should use Simplifier.inherit_bounds to
3807 avoid local name clashes. Failure to do so produces warnings
3808 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
3809 for further details.
3811 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
3812 bindings for all theorems stored within a given theory; this may help
3813 in porting non-Isar theories to Isar ones, while keeping ML proof
3814 scripts for the time being.
3816 * ML operator HTML.with_charset specifies the charset begin used for
3817 generated HTML files. For example:
3819 HTML.with_charset "utf-8" use_thy "Hebrew";
3820 HTML.with_charset "utf-8" use_thy "Chinese";
3825 * Allow symlinks to all proper Isabelle executables (Isabelle,
3826 isabelle, isatool etc.).
3828 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
3829 isatool doc, isatool mkdir, display_drafts etc.).
3831 * isatool usedir: option -f allows specification of the ML file to be
3832 used by Isabelle; default is ROOT.ML.
3834 * New isatool version outputs the version identifier of the Isabelle
3835 distribution being used.
3837 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
3838 (containing Boolean satisfiability problems) into Isabelle/HOL
3843 New in Isabelle2004 (April 2004)
3844 --------------------------------
3848 * Provers/order.ML: new efficient reasoner for partial and linear orders.
3849 Replaces linorder.ML.
3851 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
3852 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
3853 (\<a>...\<z>), are now considered normal letters, and can therefore
3854 be used anywhere where an ASCII letter (a...zA...Z) has until
3855 now. COMPATIBILITY: This obviously changes the parsing of some
3856 terms, especially where a symbol has been used as a binder, say
3857 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
3858 as an identifier. Fix it by inserting a space around former
3859 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
3860 existing theory and ML files.
3862 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
3864 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
3865 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
3866 a normal (but invisible) letter. For multiple letter subscripts repeat
3867 \<^isub> like this: x\<^isub>1\<^isub>2.
3869 * Pure: There are now sub-/superscripts that can span more than one
3870 character. Text between \<^bsub> and \<^esub> is set in subscript in
3871 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
3872 superscript. The new control characters are not identifier parts.
3874 * Pure: Control-symbols of the form \<^raw:...> will literally print the
3875 content of "..." to the latex file instead of \isacntrl... . The "..."
3876 may consist of any printable characters excluding the end bracket >.
3878 * Pure: Using new Isar command "finalconsts" (or the ML functions
3879 Theory.add_finals or Theory.add_finals_i) it is now possible to
3880 declare constants "final", which prevents their being given a definition
3881 later. It is useful for constants whose behaviour is fixed axiomatically
3882 rather than definitionally, such as the meta-logic connectives.
3884 * Pure: 'instance' now handles general arities with general sorts
3885 (i.e. intersections of classes),
3887 * Presentation: generated HTML now uses a CSS style sheet to make layout
3888 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
3889 It can be changed to alter the colors/layout of generated pages.
3894 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
3895 cut_tac, subgoal_tac and thin_tac:
3896 - Now understand static (Isar) contexts. As a consequence, users of Isar
3897 locales are no longer forced to write Isar proof scripts.
3898 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
3900 - INCOMPATIBILITY: names of variables to be instantiated may no
3901 longer be enclosed in quotes. Instead, precede variable name with `?'.
3902 This is consistent with the instantiation attribute "where".
3904 * Attributes "where" and "of":
3905 - Now take type variables of instantiated theorem into account when reading
3906 the instantiation string. This fixes a bug that caused instantiated
3907 theorems to have too special types in some circumstances.
3908 - "where" permits explicit instantiations of type variables.
3910 * Calculation commands "moreover" and "also" no longer interfere with
3911 current facts ("this"), admitting arbitrary combinations with "then"
3915 - Goal statements involving the context element "includes" no longer
3916 generate theorems with internal delta predicates (those ending on
3917 "_axioms") in the premise.
3918 Resolve particular premise with <locale>.intro to obtain old form.
3919 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
3920 specification and "includes" elements in goal statement.
3921 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
3922 [intro?] and [elim?] (respectively) by default.
3923 - Experimental command for instantiation of locales in proof contexts:
3924 instantiate <label>[<attrs>]: <loc>
3925 Instantiates locale <loc> and adds all its theorems to the current context
3926 taking into account their attributes. Label and attrs are optional
3927 modifiers, like in theorem declarations. If present, names of
3928 instantiated theorems are qualified with <label>, and the attributes
3929 <attrs> are applied after any attributes these theorems might have already.
3930 If the locale has assumptions, a chained fact of the form
3931 "<loc> t1 ... tn" is expected from which instantiations of the parameters
3932 are derived. The command does not support old-style locales declared
3933 with "locale (open)".
3934 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
3936 * HOL: Tactic emulation methods induct_tac and case_tac understand static
3942 * Proof import: new image HOL4 contains the imported library from
3943 the HOL4 system with about 2500 theorems. It is imported by
3944 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
3945 can be used like any other Isabelle image. See
3946 HOL/Import/HOL/README for more information.
3949 - Much improved handling of linear and partial orders.
3950 Reasoners for linear and partial orders are set up for type classes
3951 "linorder" and "order" respectively, and are added to the default simpset
3952 as solvers. This means that the simplifier can build transitivity chains
3953 to solve goals from the assumptions.
3954 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
3955 of blast or auto after simplification become unnecessary because the goal
3956 is solved by simplification already.
3958 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
3959 all proved in axiomatic type classes for semirings, rings and fields.
3962 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
3963 now formalized using the Ring_and_Field theory mentioned above.
3964 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
3965 than before, because now they are set up once in a generic manner.
3966 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
3967 Look for the general versions in Ring_and_Field (and Power if they concern
3970 * Type "rat" of the rational numbers is now available in HOL-Complex.
3973 - Record types are now by default printed with their type abbreviation
3974 instead of the list of all field types. This can be configured via
3975 the reference "print_record_type_abbr".
3976 - Simproc "record_upd_simproc" for simplification of multiple updates added
3977 (not enabled by default).
3978 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
3979 EX x. x = sel r to True (not enabled by default).
3980 - Tactic "record_split_simp_tac" to split and simplify records added.
3982 * 'specification' command added, allowing for definition by
3983 specification. There is also an 'ax_specification' command that
3984 introduces the new constants axiomatically.
3986 * arith(_tac) is now able to generate counterexamples for reals as well.
3988 * HOL-Algebra: new locale "ring" for non-commutative rings.
3990 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
3991 definitions, thanks to Sava Krsti\'{c} and John Matthews.
3993 * HOL-Matrix: a first theory for matrices in HOL with an application of
3994 matrix theory to linear programming.
3996 * Unions and Intersections:
3997 The latex output syntax of UN and INT has been changed
3998 from "\Union x \in A. B" to "\Union_{x \in A} B"
3999 i.e. the index formulae has become a subscript.
4000 Similarly for "\Union x. B", and for \Inter instead of \Union.
4002 * Unions and Intersections over Intervals:
4003 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4004 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4005 like in normal math, and corresponding versions for < and for intersection.
4007 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4008 lexicographic dictonary ordering has been added as "lexord".
4010 * ML: the legacy theory structures Int and List have been removed. They had
4011 conflicted with ML Basis Library structures having the same names.
4013 * 'refute' command added to search for (finite) countermodels. Only works
4014 for a fragment of HOL. The installation of an external SAT solver is
4015 highly recommended. See "HOL/Refute.thy" for details.
4017 * 'quickcheck' command: Allows to find counterexamples by evaluating
4018 formulae under an assignment of free variables to random values.
4019 In contrast to 'refute', it can deal with inductive datatypes,
4020 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4026 * Streams now come with concatenation and are part of the HOLCF image
4030 New in Isabelle2003 (May 2003)
4031 ------------------------------
4035 * Provers/simplifier:
4037 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4038 Assumptions are now subject to complete mutual simplification,
4039 not just from left to right. The simplifier now preserves
4040 the order of assumptions.
4042 Potential INCOMPATIBILITY:
4044 -- simp sometimes diverges where the old version did
4045 not, e.g. invoking simp on the goal
4047 [| P (f x); y = x; f x = f y |] ==> Q
4049 now gives rise to the infinite reduction sequence
4051 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4053 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4056 -- Tactics combining classical reasoner and simplification (such as auto)
4057 are also affected by this change, because many of them rely on
4058 simp. They may sometimes diverge as well or yield a different numbers
4059 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4060 in case of problems. Sometimes subsequent calls to the classical
4061 reasoner will fail because a preceeding call to the simplifier too
4062 eagerly simplified the goal, e.g. deleted redundant premises.
4064 - The simplifier trace now shows the names of the applied rewrite rules
4066 - You can limit the number of recursive invocations of the simplifier
4067 during conditional rewriting (where the simplifie tries to solve the
4068 conditions before applying the rewrite rule):
4069 ML "simp_depth_limit := n"
4070 where n is an integer. Thus you can force termination where previously
4071 the simplifier would diverge.
4073 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4075 - No longer aborts on failed congruence proof. Instead, the
4076 congruence is ignored.
4078 * Pure: New generic framework for extracting programs from constructive
4079 proofs. See HOL/Extraction.thy for an example instantiation, as well
4080 as HOL/Extraction for some case studies.
4082 * Pure: The main goal of the proof state is no longer shown by default, only
4083 the subgoals. This behaviour is controlled by a new flag.
4084 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4085 (ML: Proof.show_main_goal).
4087 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4088 rules whose conclusion matches subgoal 1:
4089 PG menu: Isabelle/Isar -> Show me -> matching rules
4090 The rules are ordered by how closely they match the subgoal.
4091 In particular, rules that solve a subgoal outright are displayed first
4092 (or rather last, the way they are printed).
4093 (ML: ProofGeneral.print_intros())
4095 * Pure: New flag trace_unify_fail causes unification to print
4096 diagnostic information (PG: in trace buffer) when it fails. This is
4097 useful for figuring out why single step proofs like rule, erule or
4100 * Pure: Locale specifications now produce predicate definitions
4101 according to the body of text (covering assumptions modulo local
4102 definitions); predicate "loc_axioms" covers newly introduced text,
4103 while "loc" is cumulative wrt. all included locale expressions; the
4104 latter view is presented only on export into the global theory
4105 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4106 on the old view without predicates;
4108 * Pure: predefined locales "var" and "struct" are useful for sharing
4109 parameters (as in CASL, for example); just specify something like
4110 ``var x + var y + struct M'' as import;
4112 * Pure: improved thms_containing: proper indexing of facts instead of
4113 raw theorems; check validity of results wrt. current name space;
4114 include local facts of proof configuration (also covers active
4115 locales), cover fixed variables in index; may use "_" in term
4116 specification; an optional limit for the number of printed facts may
4117 be given (the default is 40);
4119 * Pure: disallow duplicate fact bindings within new-style theory files
4122 * Provers: improved induct method: assumptions introduced by case
4123 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4124 the goal statement); "foo" still refers to all facts collectively;
4126 * Provers: the function blast.overloaded has been removed: all constants
4127 are regarded as potentially overloaded, which improves robustness in exchange
4128 for slight decrease in efficiency;
4130 * Provers/linorder: New generic prover for transitivity reasoning over
4131 linear orders. Note: this prover is not efficient!
4133 * Isar: preview of problems to finish 'show' now produce an error
4134 rather than just a warning (in interactive mode);
4141 - Produces a counter example if it cannot prove a goal.
4142 Note that the counter example may be spurious if the goal is not a formula
4143 of quantifier-free linear arithmetic.
4144 In ProofGeneral the counter example appears in the trace buffer.
4146 - Knows about div k and mod k where k is a numeral of type nat or int.
4148 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4149 linear arithmetic fails. This takes account of quantifiers and divisibility.
4150 Presburger arithmetic can also be called explicitly via presburger(_tac).
4152 * simp's arithmetic capabilities have been enhanced a bit: it now
4153 takes ~= in premises into account (by performing a case split);
4155 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4156 are distributed over a sum of terms;
4158 * New tactic "trans_tac" and method "trans" instantiate
4159 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4162 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4163 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4165 * 'typedef' command has new option "open" to suppress the set
4168 * functions Min and Max on finite sets have been introduced (theory
4171 * attribute [symmetric] now works for relations as well; it turns
4172 (x,y) : R^-1 into (y,x) : R, and vice versa;
4174 * induct over a !!-quantified statement (say !!x1..xn):
4175 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4177 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4178 %x. None. Warning: empty_def now refers to the previously hidden definition
4181 * Algebra: formalization of classical algebra. Intended as base for
4182 any algebraic development in Isabelle. Currently covers group theory
4183 (up to Sylow's theorem) and ring theory (Universal Property of
4184 Univariate Polynomials). Contributions welcome;
4186 * GroupTheory: deleted, since its material has been moved to Algebra;
4188 * Complex: new directory of the complex numbers with numeric constants,
4189 nonstandard complex numbers, and some complex analysis, standard and
4190 nonstandard (Jacques Fleuriot);
4192 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4194 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4197 * Real/HahnBanach: updated and adapted to locales;
4199 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4202 * UNITY: added the Meier-Sanders theory of progress sets;
4204 * MicroJava: bytecode verifier and lightweight bytecode verifier
4205 as abstract algorithms, instantiated to the JVM;
4207 * Bali: Java source language formalization. Type system, operational
4208 semantics, axiomatic semantics. Supported language features:
4209 classes, interfaces, objects,virtual methods, static methods,
4210 static/instance fields, arrays, access modifiers, definite
4211 assignment, exceptions.
4216 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4219 * Main ZF: virtually all theories converted to new-style format;
4224 * Pure: Tactic.prove provides sane interface for internal proofs;
4225 omits the infamous "standard" operation, so this is more appropriate
4226 than prove_goalw_cterm in many situations (e.g. in simprocs);
4228 * Pure: improved error reporting of simprocs;
4230 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4234 *** Document preparation ***
4236 * uses \par instead of \\ for line breaks in theory text. This may
4237 shift some page breaks in large documents. To get the old behaviour
4238 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4240 * minimized dependencies of isabelle.sty and isabellesym.sty on
4243 * \<euro> now needs package babel/greek instead of marvosym (which
4246 * normal size for \<zero>...\<nine> (uses \mathbf instead of
4251 New in Isabelle2002 (March 2002)
4252 --------------------------------
4254 *** Document preparation ***
4256 * greatly simplified document preparation setup, including more
4257 graceful interpretation of isatool usedir -i/-d/-D options, and more
4258 instructive isatool mkdir; users should basically be able to get
4259 started with "isatool mkdir HOL Test && isatool make"; alternatively,
4260 users may run a separate document processing stage manually like this:
4261 "isatool usedir -D output HOL Test && isatool document Test/output";
4263 * theory dependency graph may now be incorporated into documents;
4264 isatool usedir -g true will produce session_graph.eps/.pdf for use
4265 with \includegraphics of LaTeX;
4267 * proper spacing of consecutive markup elements, especially text
4268 blocks after section headings;
4270 * support bold style (for single symbols only), input syntax is like
4271 this: "\<^bold>\<alpha>" or "\<^bold>A";
4273 * \<bullet> is now output as bold \cdot by default, which looks much
4274 better in printed text;
4276 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
4277 note that these symbols are currently unavailable in Proof General /
4278 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
4280 * isatool latex no longer depends on changed TEXINPUTS, instead
4281 isatool document copies the Isabelle style files to the target
4287 * Pure/Provers: improved proof by cases and induction;
4288 - 'case' command admits impromptu naming of parameters (such as
4290 - 'induct' method divinates rule instantiation from the inductive
4291 claim; no longer requires excessive ?P bindings for proper
4292 instantiation of cases;
4293 - 'induct' method properly enumerates all possibilities of set/type
4294 rules; as a consequence facts may be also passed through *type*
4295 rules without further ado;
4296 - 'induct' method now derives symbolic cases from the *rulified*
4297 rule (before it used to rulify cases stemming from the internal
4298 atomized version); this means that the context of a non-atomic
4299 statement becomes is included in the hypothesis, avoiding the
4300 slightly cumbersome show "PROP ?case" form;
4301 - 'induct' may now use elim-style induction rules without chaining
4302 facts, using ``missing'' premises from the goal state; this allows
4303 rules stemming from inductive sets to be applied in unstructured
4304 scripts, while still benefitting from proper handling of non-atomic
4305 statements; NB: major inductive premises need to be put first, all
4306 the rest of the goal is passed through the induction;
4307 - 'induct' proper support for mutual induction involving non-atomic
4308 rule statements (uses the new concept of simultaneous goals, see
4310 - append all possible rule selections, but only use the first
4311 success (no backtracking);
4312 - removed obsolete "(simplified)" and "(stripped)" options of methods;
4313 - undeclared rule case names default to numbers 1, 2, 3, ...;
4314 - added 'print_induct_rules' (covered by help item in recent Proof
4316 - moved induct/cases attributes to Pure, methods to Provers;
4317 - generic method setup instantiated for FOL and HOL;
4319 * Pure: support multiple simultaneous goal statements, for example
4320 "have a: A and b: B" (same for 'theorem' etc.); being a pure
4321 meta-level mechanism, this acts as if several individual goals had
4322 been stated separately; in particular common proof methods need to be
4323 repeated in order to cover all claims; note that a single elimination
4324 step is *not* sufficient to establish the two conjunctions, so this
4327 assume "A & B" then have A and B .. (*".." fails*)
4329 better use "obtain" in situations as above; alternative refer to
4330 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
4332 * Pure: proper integration with ``locales''; unlike the original
4333 version by Florian Kammller, Isar locales package high-level proof
4334 contexts rather than raw logical ones (e.g. we admit to include
4335 attributes everywhere); operations on locales include merge and
4336 rename; support for implicit arguments (``structures''); simultaneous
4337 type-inference over imports and text; see also HOL/ex/Locales.thy for
4340 * Pure: the following commands have been ``localized'', supporting a
4341 target locale specification "(in name)": 'lemma', 'theorem',
4342 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
4343 stored both within the locale and at the theory level (exported and
4344 qualified by the locale name);
4346 * Pure: theory goals may now be specified in ``long'' form, with
4347 ad-hoc contexts consisting of arbitrary locale elements. for example
4348 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
4349 definitions may be given, too); the result is a meta-level rule with
4350 the context elements being discharged in the obvious way;
4352 * Pure: new proof command 'using' allows to augment currently used
4353 facts after a goal statement ('using' is syntactically analogous to
4354 'apply', but acts on the goal's facts only); this allows chained facts
4355 to be separated into parts given before and after a claim, as in
4356 ``from a and b have C using d and e <proof>'';
4358 * Pure: renamed "antecedent" case to "rule_context";
4360 * Pure: new 'judgment' command records explicit information about the
4361 object-logic embedding (used by several tools internally); no longer
4362 use hard-wired "Trueprop";
4364 * Pure: added 'corollary' command;
4366 * Pure: fixed 'token_translation' command;
4368 * Pure: removed obsolete 'exported' attribute;
4370 * Pure: dummy pattern "_" in is/let is now automatically lifted over
4371 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
4372 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
4374 * Pure: method 'atomize' presents local goal premises as object-level
4375 statements (atomic meta-level propositions); setup controlled via
4376 rewrite rules declarations of 'atomize' attribute; example
4377 application: 'induct' method with proper rule statements in improper
4380 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
4381 now consider the syntactic context of assumptions, giving a better
4382 chance to get type-inference of the arguments right (this is
4383 especially important for locales);
4385 * Pure: "sorry" no longer requires quick_and_dirty in interactive
4388 * Pure/obtain: the formal conclusion "thesis", being marked as
4389 ``internal'', may no longer be reference directly in the text;
4390 potential INCOMPATIBILITY, may need to use "?thesis" in rare
4393 * Pure: generic 'sym' attribute which declares a rule both as pure
4394 'elim?' and for the 'symmetric' operation;
4396 * Pure: marginal comments ``--'' may now occur just anywhere in the
4397 text; the fixed correlation with particular command syntax has been
4400 * Pure: new method 'rules' is particularly well-suited for proof
4401 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
4402 but often produces more compact proof terms with less detours;
4404 * Pure/Provers/classical: simplified integration with pure rule
4405 attributes and methods; the classical "intro?/elim?/dest?"
4406 declarations coincide with the pure ones; the "rule" method no longer
4407 includes classically swapped intros; "intro" and "elim" methods no
4408 longer pick rules from the context; also got rid of ML declarations
4409 AddXIs/AddXEs/AddXDs; all of this has some potential for
4412 * Provers/classical: attribute 'swapped' produces classical inversions
4413 of introduction rules;
4415 * Provers/simplifier: 'simplified' attribute may refer to explicit
4416 rules instead of full simplifier context; 'iff' attribute handles
4419 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
4421 * HOL: 'recdef' now fails on unfinished automated proofs, use
4422 "(permissive)" option to recover old behavior;
4424 * HOL: 'inductive' no longer features separate (collective) attributes
4425 for 'intros' (was found too confusing);
4427 * HOL: properly declared induction rules less_induct and
4433 * HOL: moved over to sane numeral syntax; the new policy is as
4436 - 0 and 1 are polymorphic constants, which are defined on any
4437 numeric type (nat, int, real etc.);
4439 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
4440 binary representation internally;
4442 - type nat has special constructor Suc, and generally prefers Suc 0
4443 over 1::nat and Suc (Suc 0) over 2::nat;
4445 This change may cause significant problems of INCOMPATIBILITY; here
4446 are some hints on converting existing sources:
4448 - due to the new "num" token, "-0" and "-1" etc. are now atomic
4449 entities, so expressions involving "-" (unary or binary minus) need
4450 to be spaced properly;
4452 - existing occurrences of "1" may need to be constraint "1::nat" or
4453 even replaced by Suc 0; similar for old "2";
4455 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
4457 - remove all special provisions on numerals in proofs;
4459 * HOL: simp rules nat_number expand numerals on nat to Suc/0
4460 representation (depends on bin_arith_simps in the default context);
4462 * HOL: symbolic syntax for x^2 (numeral 2);
4464 * HOL: the class of all HOL types is now called "type" rather than
4465 "term"; INCOMPATIBILITY, need to adapt references to this type class
4466 in axclass/classes, instance/arities, and (usually rare) occurrences
4467 in typings (of consts etc.); internally the class is called
4468 "HOL.type", ML programs should refer to HOLogic.typeS;
4470 * HOL/record package improvements:
4471 - new derived operations "fields" to build a partial record section,
4472 "extend" to promote a fixed record to a record scheme, and
4473 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
4474 declared as simp by default;
4475 - shared operations ("more", "fields", etc.) now need to be always
4476 qualified) --- potential INCOMPATIBILITY;
4477 - removed "make_scheme" operations (use "make" with "extend") --
4479 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
4480 - provides cases/induct rules for use with corresponding Isar
4481 methods (for concrete records, record schemes, concrete more
4482 parts, and schematic more parts -- in that order);
4483 - internal definitions directly based on a light-weight abstract
4484 theory of product types over typedef rather than datatype;
4486 * HOL: generic code generator for generating executable ML code from
4487 specifications; specific support for HOL constructs such as inductive
4488 datatypes and sets, as well as recursive functions; can be invoked
4489 via 'generate_code' theory section;
4491 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
4493 * HOL: consolidated and renamed several theories. In particular:
4494 Ord.thy has been absorbed into HOL.thy
4495 String.thy has been absorbed into List.thy
4497 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
4498 (beware of argument permutation!);
4500 * HOL: linorder_less_split superseded by linorder_cases;
4502 * HOL/List: "nodups" renamed to "distinct";
4504 * HOL: added "The" definite description operator; move Hilbert's "Eps"
4505 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
4506 - Ex_def has changed, now need to use some_eq_ex
4508 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
4509 in this (rare) case use:
4511 delSWrapper "split_all_tac"
4512 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
4514 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
4517 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
4518 Isabelle's type classes, ^ on functions and relations has too general
4519 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
4520 necessary to attach explicit type constraints;
4522 * HOL/Relation: the prefix name of the infix "O" has been changed from
4523 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
4524 renamed accordingly (eg "compI" -> "rel_compI").
4526 * HOL: syntax translations now work properly with numerals and records
4529 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
4530 of "lam" -- INCOMPATIBILITY;
4532 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
4533 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
4534 renamed "Product_Type.unit";
4536 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
4538 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
4539 the "cases" method);
4541 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
4544 * HOL/IMP: updated and converted to new-style theory format; several
4545 parts turned into readable document, with proper Isar proof texts and
4546 some explanations (by Gerwin Klein);
4548 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
4550 * HOL-Hyperreal is now a logic image;
4555 * Isar: consts/constdefs supports mixfix syntax for continuous
4558 * Isar: domain package adapted to new-style theory format, e.g. see
4561 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
4562 potential INCOMPATIBILITY; now use plain induct_tac instead of former
4563 lift.induct_tac, always use UU instead of Undef;
4565 * HOLCF/IMP: updated and converted to new-style theory;
4570 * Isar: proper integration of logic-specific tools and packages,
4571 including theory commands '(co)inductive', '(co)datatype',
4572 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
4573 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
4575 * theory Main no longer includes AC; for the Axiom of Choice, base
4576 your theory on Main_ZFC;
4578 * the integer library now covers quotients and remainders, with many
4579 laws relating division to addition, multiplication, etc.;
4581 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
4582 typeless version of the formalism;
4584 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
4587 * ZF/Induct: new directory for examples of inductive definitions,
4588 including theory Multiset for multiset orderings; converted to
4589 new-style theory format;
4591 * ZF: many new theorems about lists, ordinals, etc.;
4596 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
4597 variable proof controls level of detail: 0 = no proofs (only oracle
4598 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
4599 also ref manual for further ML interfaces;
4601 * Pure/axclass: removed obsolete ML interface
4602 goal_subclass/goal_arity;
4604 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
4605 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
4606 separate tokens, so expressions involving minus need to be spaced
4609 * Pure/syntax: support non-oriented infixes, using keyword "infix"
4610 rather than "infixl" or "infixr";
4612 * Pure/syntax: concrete syntax for dummy type variables admits genuine
4613 sort constraint specifications in type inference; e.g. "x::_::foo"
4614 ensures that the type of "x" is of sort "foo" (but not necessarily a
4617 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
4618 control output of nested => (types); the default behavior is
4621 * Pure/syntax: builtin parse translation for "_constify" turns valued
4622 tokens into AST constants;
4624 * Pure/syntax: prefer later declarations of translations and print
4625 translation functions; potential INCOMPATIBILITY: need to reverse
4626 multiple declarations for same syntax element constant;
4628 * Pure/show_hyps reset by default (in accordance to existing Isar
4631 * Provers/classical: renamed addaltern to addafter, addSaltern to
4634 * Provers/clasimp: ``iff'' declarations now handle conditional rules
4637 * system: tested support for MacOS X; should be able to get Isabelle +
4638 Proof General to work in a plain Terminal after installing Poly/ML
4639 (e.g. from the Isabelle distribution area) and GNU bash alone
4640 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
4641 support requires further installations, e.g. from
4642 http://fink.sourceforge.net/);
4644 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
4646 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
4647 of 40 MB), cf. ML_OPTIONS;
4649 * system: Proof General keywords specification is now part of the
4650 Isabelle distribution (see etc/isar-keywords.el);
4652 * system: support for persistent Proof General sessions (refrain from
4653 outdating all loaded theories on startup); user may create writable
4654 logic images like this: ``isabelle -q HOL Test'';
4656 * system: smart selection of Isabelle process versus Isabelle
4657 interface, accommodates case-insensitive file systems (e.g. HFS+); may
4658 run both "isabelle" and "Isabelle" even if file names are badly
4659 damaged (executable inspects the case of the first letter of its own
4660 name); added separate "isabelle-process" and "isabelle-interface";
4662 * system: refrain from any attempt at filtering input streams; no
4663 longer support ``8bit'' encoding of old isabelle font, instead proper
4664 iso-latin characters may now be used; the related isatools
4665 "symbolinput" and "nonascii" have disappeared as well;
4667 * system: removed old "xterm" interface (the print modes "xterm" and
4668 "xterm_color" are still available for direct use in a suitable
4673 New in Isabelle99-2 (February 2001)
4674 -----------------------------------
4676 *** Overview of INCOMPATIBILITIES ***
4678 * HOL: please note that theories in the Library and elsewhere often use the
4679 new-style (Isar) format; to refer to their theorems in an ML script you must
4680 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
4682 * HOL: inductive package no longer splits induction rule aggressively,
4683 but only as far as specified by the introductions given; the old
4684 format may be recovered via ML function complete_split_rule or attribute
4685 'split_rule (complete)';
4687 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
4688 gfp_Tarski to gfp_unfold;
4690 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
4692 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
4693 relation); infix "^^" has been renamed "``"; infix "``" has been
4694 renamed "`"; "univalent" has been renamed "single_valued";
4696 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
4699 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
4701 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
4703 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
4704 consequence, it is no longer monotonic wrt. the local goal context
4705 (which is now passed through the inductive cases);
4707 * Document preparation: renamed standard symbols \<ll> to \<lless> and
4708 \<gg> to \<ggreater>;
4711 *** Document preparation ***
4713 * \isabellestyle{NAME} selects version of Isabelle output (currently
4714 available: are "it" for near math-mode best-style output, "sl" for
4715 slanted text style, and "tt" for plain type-writer; if no
4716 \isabellestyle command is given, output is according to slanted
4719 * support sub/super scripts (for single symbols only), input syntax is
4720 like this: "A\<^sup>*" or "A\<^sup>\<star>";
4722 * some more standard symbols; see Appendix A of the system manual for
4723 the complete list of symbols defined in isabellesym.sty;
4725 * improved isabelle style files; more abstract symbol implementation
4726 (should now use \isamath{...} and \isatext{...} in custom symbol
4729 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
4730 state; Note that presentation of goal states does not conform to
4731 actual human-readable proof documents. Please do not include goal
4732 states into document output unless you really know what you are doing!
4734 * proper indentation of antiquoted output with proportional LaTeX
4737 * no_document ML operator temporarily disables LaTeX document
4740 * isatool unsymbolize tunes sources for plain ASCII communication;
4745 * Pure: Isar now suffers initial goal statements to contain unbound
4746 schematic variables (this does not conform to actual readable proof
4747 documents, due to unpredictable outcome and non-compositional proof
4748 checking); users who know what they are doing may use schematic goals
4749 for Prolog-style synthesis of proven results;
4751 * Pure: assumption method (an implicit finishing) now handles actual
4754 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
4755 initial goal, declare "that" only as Pure intro (only for single
4756 steps); the "that" rule assumption may now be involved in implicit
4757 finishing, thus ".." becomes a feasible for trivial obtains;
4759 * Pure: default proof step now includes 'intro_classes'; thus trivial
4760 instance proofs may be performed by "..";
4762 * Pure: ?thesis / ?this / "..." now work for pure meta-level
4765 * Pure: more robust selection of calculational rules;
4767 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
4768 rule (as well as the assumption rule);
4770 * Pure: 'thm_deps' command visualizes dependencies of theorems and
4771 lemmas, using the graph browser tool;
4773 * Pure: predict failure of "show" in interactive mode;
4775 * Pure: 'thms_containing' now takes actual terms as arguments;
4777 * HOL: improved method 'induct' --- now handles non-atomic goals
4778 (potential INCOMPATIBILITY); tuned error handling;
4780 * HOL: cases and induct rules now provide explicit hints about the
4781 number of facts to be consumed (0 for "type" and 1 for "set" rules);
4782 any remaining facts are inserted into the goal verbatim;
4784 * HOL: local contexts (aka cases) may now contain term bindings as
4785 well; the 'cases' and 'induct' methods new provide a ?case binding for
4786 the result to be shown in each case;
4788 * HOL: added 'recdef_tc' command;
4790 * isatool convert assists in eliminating legacy ML scripts;
4795 * HOL/Library: a collection of generic theories to be used together
4796 with main HOL; the theory loader path already includes this directory
4797 by default; the following existing theories have been moved here:
4798 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
4799 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
4801 * HOL/Unix: "Some aspects of Unix file-system security", a typical
4802 modelling and verification task performed in Isabelle/HOL +
4803 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
4805 * HOL/Algebra: special summation operator SUM no longer exists, it has
4806 been replaced by setsum; infix 'assoc' now has priority 50 (like
4807 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
4808 'domain', this makes the theory consistent with mathematical
4811 * HOL basics: added overloaded operations "inverse" and "divide"
4812 (infix "/"), syntax for generic "abs" operation, generic summation
4815 * HOL/typedef: simplified package, provide more useful rules (see also
4818 * HOL/datatype: induction rule for arbitrarily branching datatypes is
4819 now expressed as a proper nested rule (old-style tactic scripts may
4820 require atomize_strip_tac to cope with non-atomic premises);
4822 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
4823 to "split_conv" (old name still available for compatibility);
4825 * HOL: improved concrete syntax for strings (e.g. allows translation
4826 rules with string literals);
4828 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
4829 and Fleuriot's mechanization of analysis, including the transcendental
4830 functions for the reals;
4832 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
4837 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
4838 "lam" is displayed as TWO lambda-symbols
4840 * CTT: theory Main now available, containing everything (that is, Bool
4846 * Pure: the Simplifier has been implemented properly as a derived rule
4847 outside of the actual kernel (at last!); the overall performance
4848 penalty in practical applications is about 50%, while reliability of
4849 the Isabelle inference kernel has been greatly improved;
4851 * print modes "brackets" and "no_brackets" control output of nested =>
4852 (types) and ==> (props); the default behaviour is "brackets";
4854 * Provers: fast_tac (and friends) now handle actual object-logic rules
4855 as assumptions as well;
4857 * system: support Poly/ML 4.0;
4859 * system: isatool install handles KDE version 1 or 2;
4863 New in Isabelle99-1 (October 2000)
4864 ----------------------------------
4866 *** Overview of INCOMPATIBILITIES ***
4868 * HOL: simplification of natural numbers is much changed; to partly
4869 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
4870 issue the following ML commands:
4872 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
4873 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
4875 * HOL: simplification no longer dives into case-expressions; this is
4876 controlled by "t.weak_case_cong" for each datatype t;
4878 * HOL: nat_less_induct renamed to less_induct;
4880 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
4881 fixsome to patch .thy and .ML sources automatically;
4883 select_equality -> some_equality
4884 select_eq_Ex -> some_eq_ex
4885 selectI2EX -> someI2_ex
4888 select1_equality -> some1_equality
4889 Eps_sym_eq -> some_sym_eq_trivial
4890 Eps_eq -> some_eq_trivial
4892 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
4894 * HOL: removed obsolete theorem binding expand_if (refer to split_if
4897 * HOL: the recursion equations generated by 'recdef' are now called
4898 f.simps instead of f.rules;
4900 * HOL: qed_spec_mp now also handles bounded ALL as well;
4902 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
4903 sometimes be needed;
4905 * HOL: the constant for "f``x" is now "image" rather than "op ``";
4907 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
4909 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
4910 product is now "<*>" instead of "Times"; the lexicographic product is
4911 now "<*lex*>" instead of "**";
4913 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
4914 of main HOL, but was unused); better use HOL's datatype package;
4916 * HOL: removed "symbols" syntax for constant "override" of theory Map;
4917 the old syntax may be recovered as follows:
4920 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
4921 (infixl "\\<oplus>" 100)
4923 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4925 * HOL/ML: even fewer consts are declared as global (see theories Ord,
4926 Lfp, Gfp, WF); this only affects ML packages that refer to const names
4929 * HOL and ZF: syntax for quotienting wrt an equivalence relation
4930 changed from A/r to A//r;
4932 * ZF: new treatment of arithmetic (nat & int) may break some old
4935 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
4936 rulify -> rule_format, elimify -> elim_format, ...);
4938 * Isar/Provers: intro/elim/dest attributes changed; renamed
4939 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
4940 should have to change intro!! to intro? only); replaced "delrule" by
4943 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
4945 * Provers: strengthened force_tac by using new first_best_tac;
4947 * LaTeX document preparation: several changes of isabelle.sty (see
4951 *** Document preparation ***
4953 * formal comments (text blocks etc.) in new-style theories may now
4954 contain antiquotations of thm/prop/term/typ/text to be presented
4955 according to latex print mode; concrete syntax is like this:
4956 @{term[show_types] "f(x) = a + x"};
4958 * isatool mkdir provides easy setup of Isabelle session directories,
4959 including proper document sources;
4961 * generated LaTeX sources are now deleted after successful run
4962 (isatool document -c); may retain a copy somewhere else via -D option
4965 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
4966 style files, achieving self-contained LaTeX sources and simplifying
4969 * old-style theories now produce (crude) LaTeX output as well;
4971 * browser info session directories are now self-contained (may be put
4972 on WWW server seperately); improved graphs of nested sessions; removed
4973 graph for 'all sessions';
4975 * several improvements in isabelle style files; \isabellestyle{it}
4976 produces fake math mode output; \isamarkupheader is now \section by
4977 default; see lib/texinputs/isabelle.sty etc.;
4982 * Isar/Pure: local results and corresponding term bindings are now
4983 subject to Hindley-Milner polymorphism (similar to ML); this
4984 accommodates incremental type-inference very nicely;
4986 * Isar/Pure: new derived language element 'obtain' supports
4987 generalized existence reasoning;
4989 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
4990 support accumulation of results, without applying any rules yet;
4991 useful to collect intermediate results without explicit name
4992 references, and for use with transitivity rules with more than 2
4995 * Isar/Pure: scalable support for case-analysis type proofs: new
4996 'case' language element refers to local contexts symbolically, as
4997 produced by certain proof methods; internally, case names are attached
4998 to theorems as "tags";
5000 * Isar/Pure: theory command 'hide' removes declarations from
5001 class/type/const name spaces;
5003 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5004 indicate potential overloading;
5006 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5008 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5009 "{a,b,c}" instead of {a,b,c};
5011 * Isar/Pure now provides its own version of intro/elim/dest
5012 attributes; useful for building new logics, but beware of confusion
5013 with the version in Provers/classical;
5015 * Isar/Pure: the local context of (non-atomic) goals is provided via
5016 case name 'antecedent';
5018 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5019 to the current context is now done automatically);
5021 * Isar/Pure: theory command 'method_setup' provides a simple interface
5022 for definining proof methods in ML;
5024 * Isar/Provers: intro/elim/dest attributes changed; renamed
5025 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5026 most cases, one should have to change intro!! to intro? only);
5027 replaced "delrule" by "rule del";
5029 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5030 'symmetric' attribute (the latter supercedes [RS sym]);
5032 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5033 method modifier); 'simp' method: 'only:' modifier removes loopers as
5034 well (including splits);
5036 * Isar/Provers: Simplifier and Classical methods now support all kind
5037 of modifiers used in the past, including 'cong', 'iff', etc.
5039 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5040 of Simplifier and Classical reasoner);
5042 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5043 now support named cases; major packages (inductive, datatype, primrec,
5044 recdef) support case names and properly name parameters;
5046 * Isar/HOL: new transitivity rules for substitution in inequalities --
5047 monotonicity conditions are extracted to be proven at end of
5050 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5053 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5054 split_if split_if_asm; datatype package provides theorems foo.splits =
5055 foo.split foo.split_asm for each datatype;
5057 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5058 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5059 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5060 use "(cases (simplified))" method in proper proof texts);
5062 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5064 * Isar: names of theorems etc. may be natural numbers as well;
5066 * Isar: 'pr' command: optional arguments for goals_limit and
5067 ProofContext.prems_limit; no longer prints theory contexts, but only
5070 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5071 additional print modes to be specified; e.g. "pr(latex)" will print
5072 proof state according to the Isabelle LaTeX style;
5074 * Isar: improved support for emulating tactic scripts, including proof
5075 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5076 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5077 (for HOL datatypes);
5079 * Isar: simplified (more robust) goal selection of proof methods: 1st
5080 goal, all goals, or explicit goal specifier (tactic emulation); thus
5081 'proof method scripts' have to be in depth-first order;
5083 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5085 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5086 should instead use individual commands for printing items
5087 (print_commands, print_methods etc.);
5089 * Isar: added 'nothing' --- the empty list of theorems;
5094 * HOL/MicroJava: formalization of a fragment of Java, together with a
5095 corresponding virtual machine and a specification of its bytecode
5096 verifier and a lightweight bytecode verifier, including proofs of
5097 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5098 Cornelia Pusch (see also the homepage of project Bali at
5099 http://isabelle.in.tum.de/Bali/);
5101 * HOL/Algebra: new theory of rings and univariate polynomials, by
5104 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5105 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5108 * HOL/Lattice: fundamental concepts of lattice theory and order
5109 structures, including duals, properties of bounds versus algebraic
5110 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5111 Theorem for complete lattices etc.; may also serve as a demonstration
5112 for abstract algebraic reasoning using axiomatic type classes, and
5113 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5115 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5118 * HOL/IMPP: extension of IMP with local variables and mutually
5119 recursive procedures, by David von Oheimb;
5121 * HOL/Lambda: converted into new-style theory and document;
5123 * HOL/ex/Multiquote: example of multiple nested quotations and
5124 anti-quotations -- basically a generalized version of de-Bruijn
5125 representation; very useful in avoiding lifting of operations;
5127 * HOL/record: added general record equality rule to simpset; fixed
5128 select-update simplification procedure to handle extended records as
5129 well; admit "r" as field name;
5131 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5132 other numeric types and also as the identity of groups, rings, etc.;
5134 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5135 Types nat and int belong to this axclass;
5137 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5138 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5139 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5140 two terms #m*u and #n*u are replaced by #(m+n)*u
5141 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5142 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5143 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5145 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5146 powerful prover for predicate logic but knows nothing of clasets; see
5147 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5149 * HOL: new version of "case_tac" subsumes both boolean case split and
5150 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5151 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5153 * HOL: simplification no longer dives into case-expressions: only the
5154 selector expression is simplified, but not the remaining arms; to
5155 enable full simplification of case-expressions for datatype t, you may
5156 remove t.weak_case_cong from the simpset, either globally (Delcongs
5157 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5159 * HOL/recdef: the recursion equations generated by 'recdef' for
5160 function 'f' are now called f.simps instead of f.rules; if all
5161 termination conditions are proved automatically, these simplification
5162 rules are added to the simpset, as in primrec; rules may be named
5163 individually as well, resulting in a separate list of theorems for
5166 * HOL/While is a new theory that provides a while-combinator. It
5167 permits the definition of tail-recursive functions without the
5168 provision of a termination measure. The latter is necessary once the
5169 invariant proof rule for while is applied.
5171 * HOL: new (overloaded) notation for the set of elements below/above
5172 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5174 * HOL: theorems impI, allI, ballI bound as "strip";
5176 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5177 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5178 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5180 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5182 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5183 main HOL, but was unused);
5185 * HOL: fewer consts declared as global (e.g. have to refer to
5186 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5188 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5189 in case of overlap with user translations (e.g. judgements over
5190 tuples); (note that the underlying logical represenation is still
5196 * ZF: simplification automatically cancels common terms in arithmetic
5197 expressions over nat and int;
5199 * ZF: new treatment of nat to minimize type-checking: all operators
5200 coerce their operands to a natural number using the function natify,
5201 making the algebraic laws unconditional;
5203 * ZF: as above, for int: operators coerce their operands to an integer
5204 using the function intify;
5206 * ZF: the integer library now contains many of the usual laws for the
5207 orderings, including $<=, and monotonicity laws for $+ and $*;
5209 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5212 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5213 to the simplifier and classical reasoner simultaneously;
5218 * Provers: blast_tac now handles actual object-logic rules as
5219 assumptions; note that auto_tac uses blast_tac internally as well;
5221 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5222 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5224 * Provers: delrules now handles destruct rules as well (no longer need
5225 explicit make_elim);
5227 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5228 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5229 use instead the strong form,
5230 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5231 in HOL, FOL and ZF the function cla_make_elim will create such rules
5232 from destruct-rules;
5234 * Provers: Simplifier.easy_setup provides a fast path to basic
5235 Simplifier setup for new object-logics;
5237 * Pure: AST translation rules no longer require constant head on LHS;
5239 * Pure: improved name spaces: ambiguous output is qualified; support
5240 for hiding of names;
5242 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5243 XSYMBOL_HOME; no longer need to do manual configuration in most
5246 * system: compression of ML heaps images may now be controlled via -c
5247 option of isabelle and isatool usedir (currently only observed by
5250 * system: isatool installfonts may handle X-Symbol fonts as well (very
5251 useful for remote X11);
5253 * system: provide TAGS file for Isabelle sources;
5255 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
5258 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
5259 timing flag supersedes proof_timing and Toplevel.trace;
5261 * ML: new combinators |>> and |>>> for incremental transformations
5262 with secondary results (e.g. certain theory extensions):
5264 * ML: PureThy.add_defs gets additional argument to indicate potential
5265 overloading (usually false);
5267 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
5272 New in Isabelle99 (October 1999)
5273 --------------------------------
5275 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5277 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
5278 are no longer simplified. (This allows the simplifier to unfold recursive
5279 functional programs.) To restore the old behaviour, declare
5281 Delcongs [if_weak_cong];
5283 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
5286 * HOL: the predicate "inj" is now defined by translation to "inj_on";
5288 * HOL/datatype: mutual_induct_tac no longer exists --
5289 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
5291 * HOL/typedef: fixed type inference for representing set; type
5292 arguments now have to occur explicitly on the rhs as type constraints;
5294 * ZF: The con_defs part of an inductive definition may no longer refer
5295 to constants declared in the same theory;
5297 * HOL, ZF: the function mk_cases, generated by the inductive
5298 definition package, has lost an argument. To simplify its result, it
5299 uses the default simpset instead of a supplied list of theorems.
5301 * HOL/List: the constructors of type list are now Nil and Cons;
5303 * Simplifier: the type of the infix ML functions
5304 setSSolver addSSolver setSolver addSolver
5305 is now simpset * solver -> simpset where `solver' is a new abstract type
5306 for packaging solvers. A solver is created via
5307 mk_solver: string -> (thm list -> int -> tactic) -> solver
5308 where the string argument is only a comment.
5313 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
5314 decision procedure for linear arithmetic. Currently it is used for
5315 types `nat', `int', and `real' in HOL (see below); it can, should and
5316 will be instantiated for other types and logics as well.
5318 * The simplifier now accepts rewrite rules with flexible heads, eg
5319 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
5320 They are applied like any rule with a non-pattern lhs, i.e. by first-order
5326 * New Isabelle/Isar subsystem provides an alternative to traditional
5327 tactical theorem proving; together with the ProofGeneral/isar user
5328 interface it offers an interactive environment for developing human
5329 readable proof documents (Isar == Intelligible semi-automated
5330 reasoning); for further information see isatool doc isar-ref,
5331 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
5333 * improved and simplified presentation of theories: better HTML markup
5334 (including colors), graph views in several sizes; isatool usedir now
5335 provides a proper interface for user theories (via -P option); actual
5336 document preparation based on (PDF)LaTeX is available as well (for
5337 new-style theories only); see isatool doc system for more information;
5339 * native support for Proof General, both for classic Isabelle and
5342 * ML function thm_deps visualizes dependencies of theorems and lemmas,
5343 using the graph browser tool;
5345 * Isabelle manuals now also available as PDF;
5347 * theory loader rewritten from scratch (may not be fully
5348 bug-compatible); old loadpath variable has been replaced by show_path,
5349 add_path, del_path, reset_path functions; new operations such as
5350 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
5353 * improved isatool install: option -k creates KDE application icon,
5354 option -p DIR installs standalone binaries;
5356 * added ML_PLATFORM setting (useful for cross-platform installations);
5357 more robust handling of platform specific ML images for SML/NJ;
5359 * the settings environment is now statically scoped, i.e. it is never
5360 created again in sub-processes invoked from isabelle, isatool, or
5363 * path element specification '~~' refers to '$ISABELLE_HOME';
5365 * in locales, the "assumes" and "defines" parts may be omitted if
5368 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
5371 * new print_mode "HTML";
5373 * new flag show_tags controls display of tags of theorems (which are
5374 basically just comments that may be attached by some tools);
5376 * Isamode 2.6 requires patch to accomodate change of Isabelle font
5377 mode and goal output format:
5379 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
5381 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
5383 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
5384 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
5386 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
5388 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
5390 * function bind_thms stores lists of theorems (cf. bind_thm);
5392 * new shorthand tactics ftac, eatac, datac, fatac;
5394 * qed (and friends) now accept "" as result name; in that case the
5395 theorem is not stored, but proper checks and presentation of the
5398 * theorem database now also indexes constants "Trueprop", "all",
5399 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
5404 ** HOL arithmetic **
5406 * There are now decision procedures for linear arithmetic over nat and
5409 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
5410 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
5411 are treated as atomic; subformulae not involving type `nat' or `int'
5412 are ignored; quantified subformulae are ignored unless they are
5413 positive universal or negative existential. The tactic has to be
5414 invoked by hand and can be a little bit slow. In particular, the
5415 running time is exponential in the number of occurrences of `min' and
5416 `max', and `-' on `nat'.
5418 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
5419 (negated) (in)equalities among the premises and the conclusion into
5420 account (i.e. no compound formulae) and does not know about `min' and
5421 `max', and `-' on `nat'. It is fast and is used automatically by the
5424 NB: At the moment, these decision procedures do not cope with mixed
5425 nat/int formulae where the two parts interact, such as `m < n ==>
5428 * HOL/Numeral provides a generic theory of numerals (encoded
5429 efficiently as bit strings); setup for types nat/int/real is in place;
5430 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
5431 int, existing theories and proof scripts may require a few additional
5434 * integer division and remainder can now be performed on constant
5437 * many properties of integer multiplication, division and remainder
5440 * An interface to the Stanford Validity Checker (SVC) is available through the
5441 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
5442 are proved automatically. SVC must be installed separately, and its results
5443 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
5444 invocation of the underlying oracle). For SVC see
5445 http://verify.stanford.edu/SVC
5447 * IsaMakefile: the HOL-Real target now builds an actual image;
5452 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
5453 (in Isabelle/Isar) -- by Gertrud Bauer;
5455 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
5456 analysis for assembly languages with subtypes;
5458 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
5459 -- avoids syntactic ambiguities and treats state, transition, and
5460 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
5461 changed syntax and (many) tactics;
5463 * HOL/inductive: Now also handles more general introduction rules such
5464 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
5465 theorems are now maintained within the theory (maintained via the
5468 * HOL/datatype: Now also handles arbitrarily branching datatypes
5469 (using function types) such as
5471 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
5473 * HOL/record: record_simproc (part of the default simpset) takes care
5474 of selectors applied to updated records; record_split_tac is no longer
5475 part of the default claset; update_defs may now be removed from the
5476 simpset in many cases; COMPATIBILITY: old behavior achieved by
5478 claset_ref () := claset() addSWrapper record_split_wrapper;
5479 Delsimprocs [record_simproc]
5481 * HOL/typedef: fixed type inference for representing set; type
5482 arguments now have to occur explicitly on the rhs as type constraints;
5484 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
5485 names rather than an ML expression;
5487 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
5488 supplied later. Program schemes can be defined, such as
5489 "While B C s = (if B s then While B C (C s) else s)"
5490 where the well-founded relation can be chosen after B and C have been given.
5492 * HOL/List: the constructors of type list are now Nil and Cons;
5493 INCOMPATIBILITY: while [] and infix # syntax is still there, of
5494 course, ML tools referring to List.list.op # etc. have to be adapted;
5496 * HOL_quantifiers flag superseded by "HOL" print mode, which is
5497 disabled by default; run isabelle with option -m HOL to get back to
5498 the original Gordon/HOL-style output;
5500 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
5501 ALL x<=y. P, EX x<y. P, EX x<=y. P;
5503 * HOL basic syntax simplified (more orthogonal): all variants of
5504 All/Ex now support plain / symbolic / HOL notation; plain syntax for
5505 Eps operator is provided as well: "SOME x. P[x]";
5507 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
5509 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
5510 thus available for user theories;
5512 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
5513 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
5516 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
5517 several times and then mp;
5522 * the notation <<...>> is now available as a notation for sequences of
5525 * the simplifier is now installed
5527 * the axiom system has been generalized (thanks to Soren Heilmann)
5529 * the classical reasoner now has a default rule database
5534 * new primrec section allows primitive recursive functions to be given
5535 directly (as in HOL) over datatypes and the natural numbers;
5537 * new tactics induct_tac and exhaust_tac for induction (or case
5538 analysis) over datatypes and the natural numbers;
5540 * the datatype declaration of type T now defines the recursor T_rec;
5542 * simplification automatically does freeness reasoning for datatype
5545 * automatic type-inference, with AddTCs command to insert new
5546 type-checking rules;
5548 * datatype introduction rules are now added as Safe Introduction rules
5551 * the syntax "if P then x else y" is now available in addition to
5555 *** Internal programming interfaces ***
5557 * tuned simplifier trace output; new flag debug_simp;
5559 * structures Vartab / Termtab (instances of TableFun) offer efficient
5560 tables indexed by indexname_ord / term_ord (compatible with aconv);
5562 * AxClass.axclass_tac lost the theory argument;
5564 * tuned current_goals_markers semantics: begin / end goal avoids
5565 printing empty lines;
5567 * removed prs and prs_fn hook, which was broken because it did not
5568 include \n in its semantics, forcing writeln to add one
5569 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
5570 string -> unit if you really want to output text without newline;
5572 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
5573 plain output, interface builders may have to enable 'isabelle_font'
5574 mode to get Isabelle font glyphs as before;
5576 * refined token_translation interface; INCOMPATIBILITY: output length
5577 now of type real instead of int;
5579 * theory loader actions may be traced via new ThyInfo.add_hook
5580 interface (see src/Pure/Thy/thy_info.ML); example application: keep
5581 your own database of information attached to *whole* theories -- as
5582 opposed to intra-theory data slots offered via TheoryDataFun;
5584 * proper handling of dangling sort hypotheses (at last!);
5585 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
5586 extra sort hypotheses that can be witnessed from the type signature;
5587 the force_strip_shyps flag is gone, any remaining shyps are simply
5588 left in the theorem (with a warning issued by strip_shyps_warning);
5592 New in Isabelle98-1 (October 1998)
5593 ----------------------------------
5595 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5597 * several changes of automated proof tools;
5599 * HOL: major changes to the inductive and datatype packages, including
5600 some minor incompatibilities of theory syntax;
5602 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
5605 * HOL: removed duplicate thms in Arith:
5606 less_imp_add_less should be replaced by trans_less_add1
5607 le_imp_add_le should be replaced by trans_le_add1
5609 * HOL: unary minus is now overloaded (new type constraints may be
5612 * HOL and ZF: unary minus for integers is now #- instead of #~. In
5613 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
5614 now taken as an integer constant.
5616 * Pure: ML function 'theory_of' renamed to 'theory';
5622 1. Asm_full_simp_tac is now more aggressive.
5623 1. It will sometimes reorient premises if that increases their power to
5625 2. It does no longer proceed strictly from left to right but may also
5626 rotate premises to achieve further simplification.
5627 For compatibility reasons there is now Asm_lr_simp_tac which is like the
5628 old Asm_full_simp_tac in that it does not rotate premises.
5629 2. The simplifier now knows a little bit about nat-arithmetic.
5631 * Classical reasoner: wrapper mechanism for the classical reasoner now
5632 allows for selected deletion of wrappers, by introduction of names for
5633 wrapper functionals. This implies that addbefore, addSbefore,
5634 addaltern, and addSaltern now take a pair (name, tactic) as argument,
5635 and that adding two tactics with the same name overwrites the first
5636 one (emitting a warning).
5637 type wrapper = (int -> tactic) -> (int -> tactic)
5638 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
5639 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
5640 delWrapper, delSWrapper: claset * string -> claset
5641 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
5643 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
5644 semantics; addbefore now affects only the unsafe part of step_tac
5645 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
5646 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
5649 * Classical reasoner: setwrapper to setWrapper and compwrapper to
5650 compWrapper; added safe wrapper (and access functions for it);
5652 * HOL/split_all_tac is now much faster and fails if there is nothing
5653 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
5654 and the names of the automatically generated variables have changed.
5655 split_all_tac has moved within claset() from unsafe wrappers to safe
5656 wrappers, which means that !!-bound variables are split much more
5657 aggressively, and safe_tac and clarify_tac now split such variables.
5658 If this splitting is not appropriate, use delSWrapper "split_all_tac".
5659 Note: the same holds for record_split_tac, which does the job of
5660 split_all_tac for record fields.
5662 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
5663 permanently to the default simpset using Addsplits just like
5664 Addsimps. They can be removed via Delsplits just like
5665 Delsimps. Lower-case versions are also available.
5667 * HOL/Simplifier: The rule split_if is now part of the default
5668 simpset. This means that the simplifier will eliminate all occurrences
5669 of if-then-else in the conclusion of a goal. To prevent this, you can
5670 either remove split_if completely from the default simpset by
5671 `Delsplits [split_if]' or remove it in a specific call of the
5672 simplifier using `... delsplits [split_if]'. You can also add/delete
5673 other case splitting rules to/from the default simpset: every datatype
5674 generates suitable rules `split_t_case' and `split_t_case_asm' (where
5675 t is the name of the datatype).
5677 * Classical reasoner / Simplifier combination: new force_tac (and
5678 derivatives Force_tac, force) combines rewriting and classical
5679 reasoning (and whatever other tools) similarly to auto_tac, but is
5680 aimed to solve the given subgoal completely.
5685 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
5686 and `goalw': the theory is no longer needed as an explicit argument -
5687 the current theory context is used; assumptions are no longer returned
5688 at the ML-level unless one of them starts with ==> or !!; it is
5689 recommended to convert to these new commands using isatool fixgoal
5690 (backup your sources first!);
5692 * new top-level commands 'thm' and 'thms' for retrieving theorems from
5693 the current theory context, and 'theory' to lookup stored theories;
5695 * new theory section 'locale' for declaring constants, assumptions and
5696 definitions that have local scope;
5698 * new theory section 'nonterminals' for purely syntactic types;
5700 * new theory section 'setup' for generic ML setup functions
5701 (e.g. package initialization);
5703 * the distribution now includes Isabelle icons: see
5704 lib/logo/isabelle-{small,tiny}.xpm;
5706 * isatool install - install binaries with absolute references to
5709 * isatool logo -- create instances of the Isabelle logo (as EPS);
5711 * print mode 'emacs' reserved for Isamode;
5713 * support multiple print (ast) translations per constant name;
5715 * theorems involving oracles are now printed with a suffixed [!];
5720 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
5722 * HOL/inductive package reorganized and improved: now supports mutual
5728 oddI "n : EVEN ==> Suc n : ODD"
5729 evenI "n : ODD ==> Suc n : EVEN"
5731 new theorem list "elims" contains an elimination rule for each of the
5732 recursive sets; inductive definitions now handle disjunctive premises
5733 correctly (also ZF);
5735 INCOMPATIBILITIES: requires Inductive as an ancestor; component
5736 "mutual_induct" no longer exists - the induction rule is always
5737 contained in "induct";
5740 * HOL/datatype package re-implemented and greatly improved: now
5741 supports mutually recursive datatypes such as
5744 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
5745 | SUM ('a aexp) ('a aexp)
5746 | DIFF ('a aexp) ('a aexp)
5749 'a bexp = LESS ('a aexp) ('a aexp)
5750 | AND ('a bexp) ('a bexp)
5751 | OR ('a bexp) ('a bexp)
5753 as well as indirectly recursive datatypes such as
5756 ('a, 'b) term = Var 'a
5757 | App 'b ((('a, 'b) term) list)
5759 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
5760 induction on mutually / indirectly recursive datatypes.
5762 Primrec equations are now stored in theory and can be accessed via
5763 <function_name>.simps.
5767 - Theories using datatypes must now have theory Datatype as an
5769 - The specific <typename>.induct_tac no longer exists - use the
5770 generic induct_tac instead.
5771 - natE has been renamed to nat.exhaust - use exhaust_tac
5772 instead of res_inst_tac ... natE. Note that the variable
5773 names in nat.exhaust differ from the names in natE, this
5774 may cause some "fragile" proofs to fail.
5775 - The theorems split_<typename>_case and split_<typename>_case_asm
5776 have been renamed to <typename>.split and <typename>.split_asm.
5777 - Since default sorts of type variables are now handled correctly,
5778 some datatype definitions may have to be annotated with explicit
5780 - Primrec definitions no longer require function name and type
5781 of recursive argument.
5783 Consider using isatool fixdatatype to adapt your theories and proof
5784 scripts to the new package (backup your sources first!).
5787 * HOL/record package: considerably improved implementation; now
5788 includes concrete syntax for record types, terms, updates; theorems
5789 for surjective pairing and splitting !!-bound record variables; proof
5790 support is as follows:
5792 1) standard conversions (selectors or updates applied to record
5793 constructor terms) are part of the standard simpset;
5795 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
5796 made part of standard simpset and claset via addIffs;
5798 3) a tactic for record field splitting (record_split_tac) is part of
5799 the standard claset (addSWrapper);
5801 To get a better idea about these rules you may retrieve them via
5802 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
5803 the name of your record type.
5805 The split tactic 3) conceptually simplifies by the following rule:
5807 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
5809 Thus any record variable that is bound by meta-all will automatically
5810 blow up into some record constructor term, consequently the
5811 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
5812 solve record problems automatically.
5815 * reorganized the main HOL image: HOL/Integ and String loaded by
5816 default; theory Main includes everything;
5818 * automatic simplification of integer sums and comparisons, using cancellation;
5820 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
5822 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
5824 * many new identities for unions, intersections, set difference, etc.;
5826 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
5827 called split_if, split_split, split_sum_case and split_nat_case (to go
5828 with add/delsplits);
5830 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
5831 (?x::unit) = (); this is made part of the default simpset, which COULD
5832 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
5833 'Delsimprocs [unit_eq_proc];' as last resort); also note that
5834 unit_abs_eta_conv is added in order to counter the effect of
5835 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
5838 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
5841 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5842 It and 'sym RS equals0D' are now in the default claset, giving automatic
5843 disjointness reasoning but breaking a few old proofs.
5845 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
5846 to 'converse' from 'inverse' (for compatibility with ZF and some
5849 * HOL/recdef can now declare non-recursive functions, with {} supplied as
5850 the well-founded relation;
5852 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
5853 Compl A. The "Compl" syntax remains available as input syntax for this
5856 * HOL/Update: new theory of function updates:
5857 f(a:=b) == %x. if x=a then b else f x
5858 may also be iterated as in f(a:=b,c:=d,...);
5860 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
5863 - new function list_update written xs[i:=v] that updates the i-th
5864 list position. May also be iterated as in xs[i:=a,j:=b,...].
5865 - new function `upt' written [i..j(] which generates the list
5866 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
5867 bound write [i..j], which is a shorthand for [i..j+1(].
5868 - new lexicographic orderings and corresponding wellfoundedness theorems.
5871 - removed 'pred' (predecessor) function;
5872 - generalized some theorems about n-1;
5873 - many new laws about "div" and "mod";
5874 - new laws about greatest common divisors (see theory ex/Primes);
5876 * HOL/Relation: renamed the relational operator r^-1 "converse"
5877 instead of "inverse";
5879 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
5880 of the multiset ordering;
5882 * directory HOL/Real: a construction of the reals using Dedekind cuts
5883 (not included by default);
5885 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
5887 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
5888 programs, i.e. different program variables may have different types.
5890 * calling (stac rew i) now fails if "rew" has no effect on the goal
5891 [previously, this check worked only if the rewrite rule was unconditional]
5892 Now rew can involve either definitions or equalities (either == or =).
5897 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
5898 only the theorems proved on ZF.ML;
5900 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5901 It and 'sym RS equals0D' are now in the default claset, giving automatic
5902 disjointness reasoning but breaking a few old proofs.
5904 * ZF/Update: new theory of function updates
5905 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
5906 may also be iterated as in f(a:=b,c:=d,...);
5908 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
5910 * calling (stac rew i) now fails if "rew" has no effect on the goal
5911 [previously, this check worked only if the rewrite rule was unconditional]
5912 Now rew can involve either definitions or equalities (either == or =).
5914 * case_tac provided for compatibility with HOL
5915 (like the old excluded_middle_tac, but with subgoals swapped)
5918 *** Internal programming interfaces ***
5920 * Pure: several new basic modules made available for general use, see
5921 also src/Pure/README;
5923 * improved the theory data mechanism to support encapsulation (data
5924 kind name replaced by private Object.kind, acting as authorization
5925 key); new type-safe user interface via functor TheoryDataFun; generic
5926 print_data function becomes basically useless;
5928 * removed global_names compatibility flag -- all theory declarations
5929 are qualified by default;
5931 * module Pure/Syntax now offers quote / antiquote translation
5932 functions (useful for Hoare logic etc. with implicit dependencies);
5933 see HOL/ex/Antiquote for an example use;
5935 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
5938 * new tactical CHANGED_GOAL for checking that a tactic modifies a
5941 * Display.print_goals function moved to Locale.print_goals;
5943 * standard print function for goals supports current_goals_markers
5944 variable for marking begin of proof, end of proof, start of goal; the
5945 default is ("", "", ""); setting current_goals_markers := ("<proof>",
5946 "</proof>", "<goal>") causes SGML like tagged proof state printing,
5951 New in Isabelle98 (January 1998)
5952 --------------------------------
5954 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5956 * changed lexical syntax of terms / types: dots made part of long
5957 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
5959 * simpset (and claset) reference variable replaced by functions
5960 simpset / simpset_ref;
5962 * no longer supports theory aliases (via merge) and non-trivial
5963 implicit merge of thms' signatures;
5965 * most internal names of constants changed due to qualified names;
5967 * changed Pure/Sequence interface (see Pure/seq.ML);
5970 *** General Changes ***
5972 * hierachically structured name spaces (for consts, types, axms, thms
5973 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
5974 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
5975 isatool fixdots ensures space after dots (e.g. "%x. x"); set
5976 long_names for fully qualified output names; NOTE: ML programs
5977 (special tactics, packages etc.) referring to internal names may have
5978 to be adapted to cope with fully qualified names; in case of severe
5979 backward campatibility problems try setting 'global_names' at compile
5980 time to have enrything declared within a flat name space; one may also
5981 fine tune name declarations in theories via the 'global' and 'local'
5984 * reimplemented the implicit simpset and claset using the new anytype
5985 data filed in signatures; references simpset:simpset ref etc. are
5986 replaced by functions simpset:unit->simpset and
5987 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
5988 to patch your ML files accordingly;
5990 * HTML output now includes theory graph data for display with Java
5991 applet or isatool browser; data generated automatically via isatool
5992 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
5994 * defs may now be conditional; improved rewrite_goals_tac to handle
5995 conditional equations;
5997 * defs now admits additional type arguments, using TYPE('a) syntax;
5999 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6000 creates a new theory node; implicit merge of thms' signatures is
6001 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6002 transfer:theory->thm->thm in (rare) cases;
6004 * improved handling of draft signatures / theories; draft thms (and
6005 ctyps, cterms) are automatically promoted to real ones;
6007 * slightly changed interfaces for oracles: admit many per theory, named
6008 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6010 * print_goals: optional output of const types (set show_consts and
6013 * improved output of warnings (###) and errors (***);
6015 * subgoal_tac displays a warning if the new subgoal has type variables;
6017 * removed old README and Makefiles;
6019 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6021 * removed obsolete init_pps and init_database;
6023 * deleted the obsolete tactical STATE, which was declared by
6024 fun STATE tacfun st = tacfun st st;
6026 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6027 (which abbreviates $HOME);
6029 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6030 use isatool fixseq to adapt your ML programs (this works for fully
6031 qualified references to the Sequence structure only!);
6033 * use_thy no longer requires writable current directory; it always
6034 reloads .ML *and* .thy file, if either one is out of date;
6037 *** Classical Reasoner ***
6039 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6040 tactics that use classical reasoning to simplify a subgoal without
6041 splitting it into several subgoals;
6043 * Safe_tac: like safe_tac but uses the default claset;
6048 * added simplification meta rules:
6049 (asm_)(full_)simplify: simpset -> thm -> thm;
6051 * simplifier.ML no longer part of Pure -- has to be loaded by object
6054 * added prems argument to simplification procedures;
6056 * HOL, FOL, ZF: added infix function `addsplits':
6057 instead of `<simpset> setloop (split_tac <thms>)'
6058 you can simply write `<simpset> addsplits <thms>'
6063 * TYPE('a) syntax for type reflection terms;
6065 * no longer handles consts with name "" -- declare as 'syntax' instead;
6067 * pretty printer: changed order of mixfix annotation preference (again!);
6069 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6074 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6075 with `addloop' of the simplifier to faciliate case splitting in premises.
6077 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6079 * HOL/Auth: new protocol proofs including some for the Internet
6082 * HOL/Map: new theory of `maps' a la VDM;
6084 * HOL/simplifier: simplification procedures nat_cancel_sums for
6085 cancelling out common nat summands from =, <, <= (in)equalities, or
6086 differences; simplification procedures nat_cancel_factor for
6087 cancelling common factor from =, <, <= (in)equalities over natural
6088 sums; nat_cancel contains both kinds of procedures, it is installed by
6089 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6091 * HOL/simplifier: terms of the form
6092 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6094 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6095 and those of the form
6096 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6098 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6101 Each datatype `t' now comes with a theorem `split_t_case' of the form
6103 P(t_case f1 ... fn x) =
6104 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6106 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6109 and a theorem `split_t_case_asm' of the form
6111 P(t_case f1 ... fn x) =
6112 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6114 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6116 which can be added to a simpset via `addsplits'. The existing theorems
6117 expand_list_case and expand_option_case have been renamed to
6118 split_list_case and split_option_case.
6121 - `pred n' is automatically converted to `n-1'.
6122 Users are strongly encouraged not to use `pred' any longer,
6123 because it will disappear altogether at some point.
6124 - Users are strongly encouraged to write "0 < n" rather than
6125 "n ~= 0". Theorems and proof tools have been modified towards this
6129 the function "set_of_list" has been renamed "set" (and its theorems too);
6130 the function "nth" now takes its arguments in the reverse order and
6131 has acquired the infix notation "!" as in "xs!n".
6133 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6135 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6136 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6138 * HOL/record: extensible records with schematic structural subtyping
6139 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6140 still lacks various theorems and concrete record syntax;
6145 * removed "axioms" and "generated by" sections;
6147 * replaced "ops" section by extended "consts" section, which is capable of
6148 handling the continuous function space "->" directly;
6151 . proves theorems immediately and stores them in the theory,
6152 . creates hierachical name space,
6153 . now uses normal mixfix annotations (instead of cinfix...),
6154 . minor changes to some names and values (for consistency),
6155 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6156 . separator between mutual domain defs: changed "," to "and",
6157 . improved handling of sort constraints; now they have to
6158 appear on the left-hand side of the equations only;
6160 * fixed LAM <x,y,zs>.b syntax;
6162 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6163 adm (%x. P (t x)), where P is chainfinite and t continuous;
6168 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6169 with `addloop' of the simplifier to faciliate case splitting in premises.
6171 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6172 in HOL, they strip ALL and --> from proved theorems;
6176 New in Isabelle94-8 (May 1997)
6177 ------------------------------
6179 *** General Changes ***
6181 * new utilities to build / run / maintain Isabelle etc. (in parts
6182 still somewhat experimental); old Makefiles etc. still functional;
6184 * new 'Isabelle System Manual';
6186 * INSTALL text, together with ./configure and ./build scripts;
6188 * reimplemented type inference for greater efficiency, better error
6189 messages and clean internal interface;
6191 * prlim command for dealing with lots of subgoals (an easier way of
6192 setting goals_limit);
6197 * supports alternative (named) syntax tables (parser and pretty
6198 printer); internal interface is provided by add_modesyntax(_i);
6200 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6201 be used in conjunction with the Isabelle symbol font; uses the
6202 "symbols" syntax table;
6204 * added token_translation interface (may translate name tokens in
6205 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6206 the current print_mode); IMPORTANT: user print translation functions
6207 are responsible for marking newly introduced bounds
6208 (Syntax.mark_boundT);
6210 * token translations for modes "xterm" and "xterm_color" that display
6211 names in bold, underline etc. or colors (which requires a color
6214 * infixes may now be declared with names independent of their syntax;
6216 * added typed_print_translation (like print_translation, but may
6217 access type of constant);
6220 *** Classical Reasoner ***
6222 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6223 some limitations. Blast_tac...
6224 + ignores addss, addbefore, addafter; this restriction is intrinsic
6225 + ignores elimination rules that don't have the correct format
6226 (the conclusion MUST be a formula variable)
6227 + ignores types, which can make HOL proofs fail
6228 + rules must not require higher-order unification, e.g. apply_type in ZF
6229 [message "Function Var's argument not a bound variable" relates to this]
6230 + its proof strategy is more general but can actually be slower
6232 * substitution with equality assumptions no longer permutes other
6235 * minor changes in semantics of addafter (now called addaltern); renamed
6236 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6237 (and access functions for it);
6239 * improved combination of classical reasoner and simplifier:
6240 + functions for handling clasimpsets
6241 + improvement of addss: now the simplifier is called _after_ the
6243 + safe variant of addss called addSss: uses safe simplifications
6244 _during_ the safe steps. It is more complete as it allows multiple
6245 instantiations of unknowns (e.g. with slow_tac).
6249 * added interface for simplification procedures (functions that
6250 produce *proven* rewrite rules on the fly, depending on current
6253 * ordering on terms as parameter (used for ordered rewriting);
6255 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
6257 * the solver is now split into a safe and an unsafe part.
6258 This should be invisible for the normal user, except that the
6259 functions setsolver and addsolver have been renamed to setSolver and
6260 addSolver; added safe_asm_full_simp_tac;
6265 * a generic induction tactic `induct_tac' which works for all datatypes and
6266 also for type `nat';
6268 * a generic case distinction tactic `exhaust_tac' which works for all
6269 datatypes and also for type `nat';
6271 * each datatype comes with a function `size';
6273 * patterns in case expressions allow tuple patterns as arguments to
6274 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
6276 * primrec now also works with type nat;
6278 * recdef: a new declaration form, allows general recursive functions to be
6279 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
6281 * the constant for negation has been renamed from "not" to "Not" to
6282 harmonize with FOL, ZF, LK, etc.;
6284 * HOL/ex/LFilter theory of a corecursive "filter" functional for
6287 * HOL/Modelcheck demonstrates invocation of model checker oracle;
6289 * HOL/ex/Ring.thy declares cring_simp, which solves equational
6290 problems in commutative rings, using axiomatic type classes for + and *;
6292 * more examples in HOL/MiniML and HOL/Auth;
6294 * more default rewrite rules for quantifiers, union/intersection;
6296 * a new constant `arbitrary == @x.False';
6298 * HOLCF/IOA replaces old HOL/IOA;
6300 * HOLCF changes: derived all rules and arities
6301 + axiomatic type classes instead of classes
6302 + typedef instead of faking type definitions
6303 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
6304 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
6305 + eliminated the types void, one, tr
6306 + use unit lift and bool lift (with translations) instead of one and tr
6307 + eliminated blift from Lift3.thy (use Def instead of blift)
6308 all eliminated rules are derived as theorems --> no visible changes ;
6313 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
6314 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
6315 as ZF_cs addSIs [equalityI];
6319 New in Isabelle94-7 (November 96)
6320 ---------------------------------
6322 * allowing negative levels (as offsets) in prlev and choplev;
6324 * super-linear speedup for large simplifications;
6326 * FOL, ZF and HOL now use miniscoping: rewriting pushes
6327 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
6328 FAIL); can suppress it using the command Delsimps (ex_simps @
6329 all_simps); De Morgan laws are also now included, by default;
6331 * improved printing of ==> : ~:
6333 * new object-logic "Sequents" adds linear logic, while replacing LK
6334 and Modal (thanks to Sara Kalvala);
6336 * HOL/Auth: correctness proofs for authentication protocols;
6338 * HOL: new auto_tac combines rewriting and classical reasoning (many
6339 examples on HOL/Auth);
6341 * HOL: new command AddIffs for declaring theorems of the form P=Q to
6342 the rewriter and classical reasoner simultaneously;
6344 * function uresult no longer returns theorems in "standard" format;
6345 regain previous version by: val uresult = standard o uresult;
6352 * oracles -- these establish an interface between Isabelle and trusted
6353 external reasoners, which may deliver results as theorems;
6355 * proof objects (in particular record all uses of oracles);
6357 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
6359 * "constdefs" section in theory files;
6361 * "primrec" section (HOL) no longer requires names;
6363 * internal type "tactic" now simply "thm -> thm Sequence.seq";
6370 * reduced space requirements;
6372 * automatic HTML generation from theories;
6374 * theory files no longer require "..." (quotes) around most types;
6376 * new examples, including two proofs of the Church-Rosser theorem;
6378 * non-curried (1994) version of HOL is no longer distributed;
6385 * greatly reduced space requirements;
6387 * theory files (.thy) no longer require \...\ escapes at line breaks;
6389 * searchable theorem database (see the section "Retrieving theorems" on
6390 page 8 of the Reference Manual);
6392 * new examples, including Grabczewski's monumental case study of the
6395 * The previous version of HOL renamed to Old_HOL;
6397 * The new version of HOL (previously called CHOL) uses a curried syntax
6398 for functions. Application looks like f a b instead of f(a,b);
6400 * Mutually recursive inductive definitions finally work in HOL;
6402 * In ZF, pattern-matching on tuples is now available in all abstractions and
6403 translates to the operator "split";
6410 * new infix operator, addss, allowing the classical reasoner to
6411 perform simplification at each step of its search. Example:
6412 fast_tac (cs addss ss)
6414 * a new logic, CHOL, the same as HOL, but with a curried syntax
6415 for functions. Application looks like f a b instead of f(a,b). Also pairs
6416 look like (a,b) instead of <a,b>;
6418 * PLEASE NOTE: CHOL will eventually replace HOL!
6420 * In CHOL, pattern-matching on tuples is now available in all abstractions.
6421 It translates to the operator "split". A new theory of integers is available;
6423 * In ZF, integer numerals now denote two's-complement binary integers.
6424 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
6426 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
6427 of the Axiom of Choice;
6434 * Significantly faster resolution;
6436 * the different sections in a .thy file can now be mixed and repeated
6439 * Database of theorems for FOL, HOL and ZF. New
6440 commands including qed, qed_goal and bind_thm store theorems in the database.
6442 * Simple database queries: return a named theorem (get_thm) or all theorems of
6443 a given theory (thms_of), or find out what theory a theorem was proved in
6446 * Bugs fixed in the inductive definition and datatype packages;
6448 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
6449 and HOL_dup_cs obsolete;
6451 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
6454 * Simpler definition of function space in ZF;
6456 * new results about cardinal and ordinal arithmetic in ZF;
6458 * 'subtype' facility in HOL for introducing new types as subsets of existing
6461 :mode=text:wrap=hard:maxLineLen=72: