1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle release
5 ----------------------------
9 * Theory syntax: the header format ``theory A = B + C:'' has been
10 discontinued in favour of ``theory A imports B C begin''. Use isatool
11 fixheaders to convert existing theory files. INCOMPATIBILITY.
13 * Theory syntax: the old non-Isar theory file format has been
14 discontinued altogether. Note that ML proof scripts may still be used
15 with Isar theories; migration is usually quite simple with the ML
16 function use_legacy_bindings. INCOMPATIBILITY.
18 * Legacy goal package: reduced interface to the bare minimum required
19 to keep existing proof scripts running. Most other user-level
20 functions are now part of the OldGoals structure, which is *not* open
21 by default (consider isatool expandshort before open OldGoals).
22 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
23 these tend to cause confusion about the actual goal (!) context being
24 used here, which is not necessarily the same as the_context().
26 * Command 'find_theorems': support "*" wildcard in "name:" criterion.
29 *** Document preparation ***
31 * Added antiquotations @{ML_type text} and @{ML_struct text} which
32 check the given source text as ML type/structure, printing verbatim.
37 * Command 'no_translations' removes translation rules from theory
40 * Isar: improper proof element 'guess' is like 'obtain', but derives
41 the obtained context from the course of reasoning! For example:
43 assume "EX x y. A x & B y" -- "any previous fact"
44 then guess x and y by clarify
46 This technique is potentially adventurous, depending on the facts and
47 proof tools being involved here.
49 * Isar: known facts from the proof context may be specified as literal
50 propositions, using ASCII back-quote syntax. This works wherever
51 named facts used to be allowed so far, in proof commands, proof
52 methods, attributes etc. Literal facts are retrieved from the context
53 according to unification of type and term parameters. For example,
54 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
55 theorems in the current context, then these are valid literal facts:
56 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
58 There is also a proof method "fact" which does the same composition
59 for explicit goal states, e.g. the following proof texts coincide with
60 certain special cases of literal facts:
62 have "A" by fact == note `A`
63 have "A ==> B" by fact == note `A ==> B`
64 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
65 have "P a ==> Q a" by fact == note `P a ==> Q a`
67 * Isar: 'def' now admits simultaneous definitions, e.g.:
69 def x == "t" and y == "u"
71 * Isar: added command 'unfolding', which is structurally similar to
72 'using', but affects both the goal state and facts by unfolding given
73 rewrite rules. Thus many occurrences of the 'unfold' method or
74 'unfolded' attribute may be replaced by first-class proof text.
76 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
77 and command 'unfolding' now all support object-level equalities
78 (potentially conditional). The underlying notion of rewrite rule is
79 analogous to the 'rule_format' attribute, but *not* that of the
80 Simplifier (which is usually more generous).
82 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
83 method expression within a sandbox consisting of the first N
84 sub-goals, which need to exist. For example, ``simp_all [3]''
85 simplifies the first three sub-goals, while (rule foo, simp_all)[]
86 simplifies all new goals that emerge from applying rule foo to the
89 * Isar: the conclusion of a long theorem statement is now either
90 'shows' (a simultaneous conjunction, as before), or 'obtains'
91 (essentially a disjunction of cases with local parameters and
92 assumptions). The latter allows to express general elimination rules
93 adequately; in this notation common elimination rules look like this:
95 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
99 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
103 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
109 The subsequent classical rules even refer to the formal "thesis"
112 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
115 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
116 obtains "thesis ==> something"
118 The actual proof of an 'obtains' statement is analogous to that of the
119 Isar proof element 'obtain', only that there may be several cases.
120 Optional case names may be specified in parentheses; these will be
121 available both in the present proof and as annotations in the
122 resulting rule, for later use with the 'cases' method (cf. attribute
125 * Isar: 'print_statement' prints theorems from the current theory or
126 proof context in long statement form, according to the syntax of a
129 * Isar: 'obtain' takes an optional case name for the local context
130 introduction rule (default "that").
132 * Isar/locales: new derived specification elements 'definition',
133 'abbreviation', 'axiomatization', which support type-inference, admit
134 object-level specifications (equality, equivalence). See also the
135 isar-ref manual. Examples:
145 where eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
149 "x =!= y == ~ (x === y)"
151 These specifications may be also used in a locale context. Then the
152 constants being introduced depend on certain fixed parameters, and the
153 constant name is qualified by the locale base name. An internal
154 abbreviation takes care for convenient input and output, making the
155 parameters implicit and using the original short name. See also
156 HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
157 entities from a monomorphic theory.
159 Presently, abbreviations are only available 'in' a target locale, but
160 not inherited by general import expressions. Also note that
161 'abbreviation' may be used as a type-safe replacement for 'syntax' +
162 'translations' in common applications.
164 * Provers/induct: improved internal context management to support
165 local fixes and defines on-the-fly. Thus explicit meta-level
166 connectives !! and ==> are rarely required anymore in inductive goals
167 (using object-logic connectives for this purpose has been long
168 obsolete anyway). The subsequent proof patterns illustrate advanced
169 techniques of natural induction; general datatypes and inductive sets
170 work analogously (see also src/HOL/Lambda for realistic examples).
172 (1) This is how to ``strengthen'' an inductive goal wrt. certain
176 fixes n :: nat and x :: 'a
179 using a -- {* make induct insert fact a *}
180 proof (induct n fixing: x) -- {* generalize goal to "!!x. A n x ==> P n x" *}
185 note `!!x. A n x ==> P n x` -- {* induction hypothesis, according to induction rule *}
186 note `A (Suc n) x` -- {* induction premise, stemming from fact a *}
190 (2) This is how to perform induction over ``expressions of a certain
191 form'', using a locally defined inductive parameter n == "a x"
192 together with strengthening (the latter is usually required to get
193 sufficiently flexible induction hypotheses):
196 fixes a :: "'a => nat"
200 proof (induct n == "a x" fixing: x)
203 See also HOL/Isar_examples/Puzzle.thy for an application of the this
204 particular technique.
206 (3) This is how to perform existential reasoning ('obtains' or
207 'obtain') by induction, while avoiding explicit object-logic
212 obtains x :: 'a where "P n x" and "Q n x"
213 proof (induct n fixing: thesis)
215 obtain x where "P 0 x" and "Q 0 x" sorry
216 then show thesis by (rule 0)
219 obtain x where "P n x" and "Q n x" by (rule Suc.hyps)
220 obtain x where "P (Suc n) x" and "Q (Suc n) x" sorry
221 then show thesis by (rule Suc.prems)
224 Here the 'fixing: thesis' specification essentially modifies the scope
225 of the formal thesis parameter, in order to the get the whole
226 existence statement through the induction as expected.
228 * Provers/induct: mutual induction rules are now specified as a list
229 of rule sharing the same induction cases. HOL packages usually
230 provide foo_bar.inducts for mutually defined items foo and bar
231 (e.g. inductive sets or datatypes). INCOMPATIBILITY, users need to
232 specify mutual induction rules differently, i.e. like this:
234 (induct rule: foo_bar.inducts)
235 (induct set: foo bar)
236 (induct type: foo bar)
238 The ML function ProjectRule.projections turns old-style rules into the
241 * Provers/induct: improved handling of simultaneous goals. Instead of
242 introducing object-level conjunction, the statement is now split into
243 several conclusions, while the corresponding symbolic cases are
244 nested accordingly. INCOMPATIBILITY, proofs need to be structured
245 explicitly. For example:
249 shows "P n" and "Q n"
259 show "P (Suc n)" sorry
263 show "Q (Suc n)" sorry
266 The split into subcases may be deferred as follows -- this is
267 particularly relevant for goal statements with local premises.
271 shows "A n ==> P n" and "B n ==> Q n"
285 note `A n ==> P n` and `B n ==> Q n`
289 show "P (Suc n)" sorry
293 show "Q (Suc n)" sorry
297 If simultaneous goals are to be used with mutual rules, the statement
298 needs to be structured carefully as a two-level conjunction, using
299 lists of propositions separated by 'and':
302 shows "a : A ==> P1 a"
307 proof (induct set: A B)
309 * Provers/induct: support coinduction as well. See
310 src/HOL/Library/Coinductive_List.thy for various examples.
312 * Simplifier: by default the simplifier trace only shows top level rewrites
313 now. That is, trace_simp_depth_limit is set to 1 by default. Thus there is
314 less danger of being flooded by the trace. The trace indicates where parts
315 have been suppressed.
317 * Provers/classical: removed obsolete classical version of elim_format
318 attribute; classical elim/dest rules are now treated uniformly when
319 manipulating the claset.
321 * Provers/classical: stricter checks to ensure that supplied intro,
322 dest and elim rules are well-formed; dest and elim rules must have at
325 * Provers/classical: attributes dest/elim/intro take an optional
326 weight argument for the rule (just as the Pure versions). Weights are
327 ignored by automated tools, but determine the search order of single
330 * Syntax: input syntax now supports dummy variable binding "%_. b",
331 where the body does not mention the bound variable. Note that dummy
332 patterns implicitly depend on their context of bounds, which makes
333 "{_. _}" match any set comprehension as expected. Potential
334 INCOMPATIBILITY -- parse translations need to cope with syntactic
335 constant "_idtdummy" in the binding position.
337 * Syntax: removed obsolete syntactic constant "_K" and its associated
338 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
339 for example "A -> B" => "Pi A (%_. B)".
344 * Alternative iff syntax "A <-> B" for equality on bool (with priority
345 25 like -->); output depends on the "iff" print_mode, the default is
346 "A = B" (with priority 50).
348 * Renamed constants in HOL.thy and Orderings.thy:
353 op < ~> Orderings.less
354 op <= ~> Orderings.less_eq
356 Adaptions may be required in the following cases:
358 a) User-defined constants using any of the names "plus", "minus", "times",
359 "less" or "less_eq". The standard syntax translations for "+", "-" and "*"
361 INCOMPATIBILITY: use more specific names.
363 b) Variables named "plus", "minus", "times", "less", "less_eq"
364 INCOMPATIBILITY: use more specific names.
366 c) Permutative equations (e.g. "a + b = b + a")
367 Since the change of names also changes the order of terms, permutative
368 rewrite rules may get applied in a different order. Experience shows that
369 this is rarely the case (only two adaptions in the whole Isabelle
371 INCOMPATIBILITY: rewrite proofs
373 d) ML code directly refering to constant names
374 This in general only affects hand-written proof tactics, simprocs and so on.
375 INCOMPATIBILITY: grep your sourcecode and replace names.
377 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
379 * The old set interval syntax "{m..n(}" (and relatives) has been removed.
380 Use "{m..<n}" (and relatives) instead.
382 * In the context of the assumption "~(s = t)" the Simplifier rewrites
383 "t = s" to False (by simproc "neq_simproc"). For backward
384 compatibility this can be disabled by ML "reset use_neq_simproc".
386 * "m dvd n" where m and n are numbers is evaluated to True/False by simp.
388 * Theorem Cons_eq_map_conv no longer has attribute `simp'.
390 * Theorem setsum_mult renamed to setsum_right_distrib.
392 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
395 * Tactics 'sat' and 'satx' reimplemented, several improvements: goals
396 no longer need to be stated as "<prems> ==> False", equivalences (i.e.
397 "=" on type bool) are handled, variable names of the form "lit_<n>"
398 are no longer reserved, significant speedup.
400 * inductive and datatype: provide projections of mutual rules, bundled
403 * Library: added theory Coinductive_List of potentially infinite lists
404 as greatest fixed-point.
406 * Library: added theory AssocList which implements (finite) maps as
414 val burrow: ('a list -> 'b list) -> 'a list list -> 'b list list
415 val fold_burrow: ('a list -> 'c -> 'b list * 'd) -> 'a list list -> 'c -> 'b list list * 'd
417 The semantics of "burrow" is: "take a function with *simulatanously*
418 transforms a list of value, and apply it *simulatanously* to a list of
419 list of values of the appropriate type". Confer this with "map" which
420 would *not* apply its argument function simulatanously but in
421 sequence. "fold_burrow" has an additional context.
423 Both actually avoid the usage of "unflat" since they hide away
424 "unflat" from the user.
426 * Pure/library: functions map2 and fold2 with curried syntax for
427 simultanous mapping and folding:
429 val map2: ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
430 val fold2: ('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> 'c -> 'c
432 * Pure/library: indexed lists - some functions in the Isabelle library
433 treating lists over 'a as finite mappings from [0...n] to 'a have been
434 given more convenient names and signatures reminiscent of similar
435 functions for alists, tables, etc:
437 val nth: 'a list -> int -> 'a
438 val nth_update: int * 'a -> 'a list -> 'a list
439 val nth_map: int -> ('a -> 'a) -> 'a list -> 'a list
440 val fold_index: (int * 'a -> 'b -> 'b) -> 'a list -> 'b -> 'b
442 Note that fold_index starts counting at index 0, not 1 like foldln
445 * Pure/General/name_mangler.ML provides a functor for generic name
446 mangling (bijective mapping from any expression values to strings).
448 * Pure/General/rat.ML implements rational numbers.
450 * Pure/General/table.ML: the join operations now works via exceptions
451 DUP/SAME instead of type option. This is simpler in simple cases, and
452 admits slightly more efficient complex applications.
454 * Pure: datatype Context.generic joins theory/Proof.context and
455 provides some facilities for code that works in either kind of
456 context, notably GenericDataFun for uniform theory and proof data.
458 * Pure: 'advanced' translation functions (parse_translation etc.) now
459 use Context.generic instead of just theory.
461 * Pure: simplified internal attribute type, which is now always
462 Context.generic * thm -> Context.generic * thm. Global (theory)
463 vs. local (Proof.context) attributes have been discontinued, while
464 minimizing code duplication. Thm.rule_attribute and
465 Thm.declaration_attribute build canonical attributes; see also
466 structure Context for further operations on Context.generic, notably
467 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
468 declarations and definitions.
470 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
471 global/local versions on theory vs. Proof.context have been
472 discontinued; Attrib.syntax and Method.syntax have been adapted
473 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
474 attributes, methods, etc.
476 * Pure: several functions of signature "... -> theory -> theory * ..."
477 have been reoriented to "... -> theory -> ... * theory" in order to
478 allow natural usage in combination with the ||>, ||>>, |-> and
479 fold_map combinators.
481 * Pure: primitive rule lift_rule now takes goal cterm instead of an
482 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
483 achieve the old behaviour.
485 * Pure: the "Goal" constant is now called "prop", supporting a
486 slightly more general idea of ``protecting'' meta-level rule
489 * Pure: structure Goal provides simple interfaces for
490 init/conclude/finish and tactical prove operations (replacing former
491 Tactic.prove). Note that OldGoals.prove_goalw_cterm has long been
492 obsolete, it is ill-behaved in a local proof context (e.g. with local
493 fixes/assumes or in a locale context).
495 * Isar: simplified treatment of user-level errors, using exception
496 ERROR of string uniformly. Function error now merely raises ERROR,
497 without any side effect on output channels. The Isar toplevel takes
498 care of proper display of ERROR exceptions. ML code may use plain
499 handle/can/try; cat_error may be used to concatenate errors like this:
501 ... handle ERROR msg => cat_error msg "..."
503 Toplevel ML code (run directly or through the Isar toplevel) may be
504 embedded into the Isar toplevel with exception display/debug like
507 Isar.toplevel (fn () => ...)
509 INCOMPATIBILITY, removed special transform_error facilities, removed
510 obsolete variants of user-level exceptions (ERROR_MESSAGE,
511 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
512 -- use plain ERROR instead.
514 * Isar: theory setup now has type (theory -> theory), instead of a
515 list. INCOMPATIBILITY, may use #> to compose setup functions.
517 * Isar: installed ML toplevel pretty printer for type Proof.context,
518 subject to ProofContext.debug/verbose flags.
520 * Isar: Toplevel.theory_to_proof admits transactions that modify the
521 theory before entering a proof state. Transactions now always see a
522 quasi-functional intermediate checkpoint, both in interactive and
525 * Simplifier: the simpset of a running simplification process now
526 contains a proof context (cf. Simplifier.the_context), which is the
527 very context that the initial simpset has been retrieved from (by
528 simpset_of/local_simpset_of). Consequently, all plug-in components
529 (solver, looper etc.) may depend on arbitrary proof data.
531 * Simplifier.inherit_context inherits the proof context (plus the
532 local bounds) of the current simplification process; any simproc
533 etc. that calls the Simplifier recursively should do this! Removed
534 former Simplifier.inherit_bounds, which is already included here --
535 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
536 specify an explicit context using Simplifier.context/theory_context.
538 * Simplifier/Classical Reasoner: more abstract interfaces
539 change_simpset/claset for modifying the simpset/claset reference of a
540 theory; raw versions simpset/claset_ref etc. have been discontinued --
543 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
548 New in Isabelle2005 (October 2005)
549 ----------------------------------
553 * Theory headers: the new header syntax for Isar theories is
556 imports <theory1> ... <theoryN>
557 uses <file1> ... <fileM>
560 where the 'uses' part is optional. The previous syntax
562 theory <name> = <theory1> + ... + <theoryN>:
564 will disappear in the next release. Use isatool fixheaders to convert
565 existing theory files. Note that there is no change in ancient
566 non-Isar theories now, but these will disappear soon.
568 * Theory loader: parent theories can now also be referred to via
569 relative and absolute paths.
571 * Command 'find_theorems' searches for a list of criteria instead of a
572 list of constants. Known criteria are: intro, elim, dest, name:string,
573 simp:term, and any term. Criteria can be preceded by '-' to select
574 theorems that do not match. Intro, elim, dest select theorems that
575 match the current goal, name:s selects theorems whose fully qualified
576 name contain s, and simp:term selects all simplification rules whose
577 lhs match term. Any other term is interpreted as pattern and selects
578 all theorems matching the pattern. Available in ProofGeneral under
579 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
581 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
583 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
584 matching the current goal as introduction rule and not having "HOL."
585 in their name (i.e. not being defined in theory HOL).
587 * Command 'thms_containing' has been discontinued in favour of
588 'find_theorems'; INCOMPATIBILITY.
590 * Communication with Proof General is now 8bit clean, which means that
591 Unicode text in UTF-8 encoding may be used within theory texts (both
592 formal and informal parts). Cf. option -U of the Isabelle Proof
593 General interface. Here are some simple examples (cf. src/HOL/ex):
595 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
596 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
598 * Improved efficiency of the Simplifier and, to a lesser degree, the
599 Classical Reasoner. Typical big applications run around 2 times
603 *** Document preparation ***
605 * Commands 'display_drafts' and 'print_drafts' perform simple output
606 of raw sources. Only those symbols that do not require additional
607 LaTeX packages (depending on comments in isabellesym.sty) are
608 displayed properly, everything else is left verbatim. isatool display
609 and isatool print are used as front ends (these are subject to the
610 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
612 * Command tags control specific markup of certain regions of text,
613 notably folding and hiding. Predefined tags include "theory" (for
614 theory begin and end), "proof" for proof commands, and "ML" for
615 commands involving ML code; the additional tags "visible" and
616 "invisible" are unused by default. Users may give explicit tag
617 specifications in the text, e.g. ''by %invisible (auto)''. The
618 interpretation of tags is determined by the LaTeX job during document
619 preparation: see option -V of isatool usedir, or options -n and -t of
620 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
623 Several document versions may be produced at the same time via isatool
624 usedir (the generated index.html will link all of them). Typical
625 specifications include ''-V document=theory,proof,ML'' to present
626 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
627 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
628 these parts without any formal replacement text. The Isabelle site
629 default settings produce ''document'' and ''outline'' versions as
632 * Several new antiquotations:
634 @{term_type term} prints a term with its type annotated;
636 @{typeof term} prints the type of a term;
638 @{const const} is the same as @{term const}, but checks that the
639 argument is a known logical constant;
641 @{term_style style term} and @{thm_style style thm} print a term or
642 theorem applying a "style" to it
646 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
647 definitions, equations, inequations etc., 'concl' printing only the
648 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
649 to print the specified premise. TermStyle.add_style provides an ML
650 interface for introducing further styles. See also the "LaTeX Sugar"
651 document practical applications. The ML antiquotation prints
652 type-checked ML expressions verbatim.
654 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
655 and 'text' support optional locale specification '(in loc)', which
656 specifies the default context for interpreting antiquotations. For
657 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
659 * Option 'locale=NAME' of antiquotations specifies an alternative
660 context interpreting the subsequent argument. For example: @{thm
661 [locale=lattice] inf_assoc}.
663 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
666 * Proper output of antiquotations for theory commands involving a
667 proof context (such as 'locale' or 'theorem (in loc) ...').
669 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
670 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
672 * isatool usedir: new option -C (default true) controls whether option
673 -D should include a copy of the original document directory; -C false
674 prevents unwanted effects such as copying of administrative CVS data.
679 * Considerably improved version of 'constdefs' command. Now performs
680 automatic type-inference of declared constants; additional support for
681 local structure declarations (cf. locales and HOL records), see also
682 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
683 sequential dependencies of definitions within a single 'constdefs'
684 section; moreover, the declared name needs to be an identifier. If
685 all fails, consider to fall back on 'consts' and 'defs' separately.
687 * Improved indexed syntax and implicit structures. First of all,
688 indexed syntax provides a notational device for subscripted
689 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
690 expressions. Secondly, in a local context with structure
691 declarations, number indexes \<^sub>n or the empty index (default
692 number 1) refer to a certain fixed variable implicitly; option
693 show_structs controls printing of implicit structures. Typical
694 applications of these concepts involve record types and locales.
696 * New command 'no_syntax' removes grammar declarations (and
697 translations) resulting from the given syntax specification, which is
698 interpreted in the same manner as for the 'syntax' command.
700 * 'Advanced' translation functions (parse_translation etc.) may depend
701 on the signature of the theory context being presently used for
702 parsing/printing, see also isar-ref manual.
704 * Improved 'oracle' command provides a type-safe interface to turn an
705 ML expression of type theory -> T -> term into a primitive rule of
706 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
707 is already included here); see also FOL/ex/IffExample.thy;
710 * axclass: name space prefix for class "c" is now "c_class" (was "c"
711 before); "cI" is no longer bound, use "c.intro" instead.
712 INCOMPATIBILITY. This change avoids clashes of fact bindings for
713 axclasses vs. locales.
715 * Improved internal renaming of symbolic identifiers -- attach primes
716 instead of base 26 numbers.
718 * New flag show_question_marks controls printing of leading question
719 marks in schematic variable names.
721 * In schematic variable names, *any* symbol following \<^isub> or
722 \<^isup> is now treated as part of the base name. For example, the
723 following works without printing of awkward ".0" indexes:
725 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
728 * Inner syntax includes (*(*nested*) comments*).
730 * Pretty printer now supports unbreakable blocks, specified in mixfix
731 annotations as "(00...)".
733 * Clear separation of logical types and nonterminals, where the latter
734 may only occur in 'syntax' specifications or type abbreviations.
735 Before that distinction was only partially implemented via type class
736 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
737 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
738 exotic syntax specifications may require further adaption
739 (e.g. Cube/Cube.thy).
741 * Removed obsolete type class "logic", use the top sort {} instead.
742 Note that non-logical types should be declared as 'nonterminals'
743 rather than 'types'. INCOMPATIBILITY for new object-logic
746 * Attributes 'induct' and 'cases': type or set names may now be
747 locally fixed variables as well.
749 * Simplifier: can now control the depth to which conditional rewriting
750 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
753 * Simplifier: simplification procedures may now take the current
754 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
755 interface), which is very useful for calling the Simplifier
756 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
757 is gone -- use prems_of_ss on the simpset instead. Moreover, the
758 low-level mk_simproc no longer applies Logic.varify internally, to
759 allow for use in a context of fixed variables.
761 * thin_tac now works even if the assumption being deleted contains !!
762 or ==>. More generally, erule now works even if the major premise of
763 the elimination rule contains !! or ==>.
765 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
767 * Reorganized bootstrapping of the Pure theories; CPure is now derived
768 from Pure, which contains all common declarations already. Both
769 theories are defined via plain Isabelle/Isar .thy files.
770 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
771 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
772 use isatool fixcpure to adapt your theory and ML sources.
774 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
775 selections of theorems in named facts via index ranges.
777 * 'print_theorems': in theory mode, really print the difference
778 wrt. the last state (works for interactive theory development only),
779 in proof mode print all local facts (cf. 'print_facts');
781 * 'hide': option '(open)' hides only base names.
783 * More efficient treatment of intermediate checkpoints in interactive
786 * Code generator is now invoked via code_module (incremental code
787 generation) and code_library (modular code generation, ML structures
788 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
789 must be quoted when used as identifiers.
791 * New 'value' command for reading, evaluating and printing terms using
792 the code generator. INCOMPATIBILITY: command keyword 'value' must be
793 quoted when used as identifier.
798 * New commands for the interpretation of locale expressions in
799 theories (1), locales (2) and proof contexts (3). These generate
800 proof obligations from the expression specification. After the
801 obligations have been discharged, theorems of the expression are added
802 to the theory, target locale or proof context. The synopsis of the
803 commands is a follows:
805 (1) interpretation expr inst
806 (2) interpretation target < expr
807 (3) interpret expr inst
809 Interpretation in theories and proof contexts require a parameter
810 instantiation of terms from the current context. This is applied to
811 specifications and theorems of the interpreted expression.
812 Interpretation in locales only permits parameter renaming through the
813 locale expression. Interpretation is smart in that interpretations
814 that are active already do not occur in proof obligations, neither are
815 instantiated theorems stored in duplicate. Use 'print_interps' to
816 inspect active interpretations of a particular locale. For details,
817 see the Isar Reference manual. Examples can be found in
818 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
820 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
823 * New context element 'constrains' for adding type constraints to
826 * Context expressions: renaming of parameters with syntax
829 * Locale declaration: 'includes' disallowed.
831 * Proper static binding of attribute syntax -- i.e. types / terms /
832 facts mentioned as arguments are always those of the locale definition
833 context, independently of the context of later invocations. Moreover,
834 locale operations (renaming and type / term instantiation) are applied
835 to attribute arguments as expected.
837 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
838 actual attributes; rare situations may require Attrib.attribute to
839 embed those attributes into Attrib.src that lack concrete syntax.
840 Attribute implementations need to cooperate properly with the static
841 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
842 Attrib.XXX_thm etc. already do the right thing without further
843 intervention. Only unusual applications -- such as "where" or "of"
844 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
845 on the context and the facts involved -- may have to assign parsed
846 values to argument tokens explicitly.
848 * Changed parameter management in theorem generation for long goal
849 statements with 'includes'. INCOMPATIBILITY: produces a different
850 theorem statement in rare situations.
852 * Locale inspection command 'print_locale' omits notes elements. Use
853 'print_locale!' to have them included in the output.
858 * Provers/hypsubst.ML: improved version of the subst method, for
859 single-step rewriting: it now works in bound variable contexts. New is
860 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
861 rewrite a different subterm than the original subst method, which is
862 still available as 'simplesubst'.
864 * Provers/quasi.ML: new transitivity reasoners for transitivity only
867 * Provers/trancl.ML: new transitivity reasoner for transitive and
868 reflexive-transitive closure of relations.
870 * Provers/blast.ML: new reference depth_limit to make blast's depth
871 limit (previously hard-coded with a value of 20) user-definable.
873 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
874 is peformed already. Object-logics merely need to finish their
875 initial simpset configuration as before. INCOMPATIBILITY.
880 * Symbolic syntax of Hilbert Choice Operator is now as follows:
883 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
885 The symbol \<some> is displayed as the alternative epsilon of LaTeX
886 and x-symbol; use option '-m epsilon' to get it actually printed.
887 Moreover, the mathematically important symbolic identifier \<epsilon>
888 becomes available as variable, constant etc. INCOMPATIBILITY,
890 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
891 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
892 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
893 support corresponding Isar calculations.
895 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
898 * theory SetInterval: changed the syntax for open intervals:
907 The old syntax is still supported but will disappear in the next
908 release. For conversion use the following Emacs search and replace
909 patterns (these are not perfect but work quite well):
911 {)\([^\.]*\)\.\. -> {\1<\.\.}
912 \.\.\([^(}]*\)(} -> \.\.<\1}
914 * Theory Commutative_Ring (in Library): method comm_ring for proving
915 equalities in commutative rings; method 'algebra' provides a generic
918 * Theory Finite_Set: changed the syntax for 'setsum', summation over
919 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
920 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
923 Some new syntax forms are available:
925 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
926 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
927 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
928 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
930 The latter form "\<Sum>x < k. e" used to be based on a separate
931 function "Summation", which has been discontinued.
933 * theory Finite_Set: in structured induction proofs, the insert case
934 is now 'case (insert x F)' instead of the old counterintuitive 'case
937 * The 'refute' command has been extended to support a much larger
938 fragment of HOL, including axiomatic type classes, constdefs and
939 typedefs, inductive datatypes and recursion.
941 * New tactics 'sat' and 'satx' to prove propositional tautologies.
942 Requires zChaff with proof generation to be installed. See
943 HOL/ex/SAT_Examples.thy for examples.
945 * Datatype induction via method 'induct' now preserves the name of the
946 induction variable. For example, when proving P(xs::'a list) by
947 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
948 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
949 in unstructured proof scripts.
951 * Reworked implementation of records. Improved scalability for
952 records with many fields, avoiding performance problems for type
953 inference. Records are no longer composed of nested field types, but
954 of nested extension types. Therefore the record type only grows linear
955 in the number of extensions and not in the number of fields. The
956 top-level (users) view on records is preserved. Potential
957 INCOMPATIBILITY only in strange cases, where the theory depends on the
958 old record representation. The type generated for a record is called
959 <record_name>_ext_type.
961 Flag record_quick_and_dirty_sensitive can be enabled to skip the
962 proofs triggered by a record definition or a simproc (if
963 quick_and_dirty is enabled). Definitions of large records can take
966 New simproc record_upd_simproc for simplification of multiple record
967 updates enabled by default. Moreover, trivial updates are also
968 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
969 occasionally, since simplification is more powerful by default.
971 * typedef: proper support for polymorphic sets, which contain extra
972 type-variables in the term.
974 * Simplifier: automatically reasons about transitivity chains
975 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
976 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
977 old proofs break occasionally as simplification may now solve more
978 goals than previously.
980 * Simplifier: converts x <= y into x = y if assumption y <= x is
981 present. Works for all partial orders (class "order"), in particular
982 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
985 * Simplifier: new simproc for "let x = a in f x". If a is a free or
986 bound variable or a constant then the let is unfolded. Otherwise
987 first a is simplified to b, and then f b is simplified to g. If
988 possible we abstract b from g arriving at "let x = b in h x",
989 otherwise we unfold the let and arrive at g. The simproc can be
990 enabled/disabled by the reference use_let_simproc. Potential
991 INCOMPATIBILITY since simplification is more powerful by default.
993 * Classical reasoning: the meson method now accepts theorems as arguments.
995 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
996 jobs to provide advice on the provability of subgoals.
998 * Theory OrderedGroup and Ring_and_Field: various additions and
999 improvements to faciliate calculations involving equalities and
1002 The following theorems have been eliminated or modified
1005 abs_eq now named abs_of_nonneg
1006 abs_of_ge_0 now named abs_of_nonneg
1007 abs_minus_eq now named abs_of_nonpos
1008 imp_abs_id now named abs_of_nonneg
1009 imp_abs_neg_id now named abs_of_nonpos
1010 mult_pos now named mult_pos_pos
1011 mult_pos_le now named mult_nonneg_nonneg
1012 mult_pos_neg_le now named mult_nonneg_nonpos
1013 mult_pos_neg2_le now named mult_nonneg_nonpos2
1014 mult_neg now named mult_neg_neg
1015 mult_neg_le now named mult_nonpos_nonpos
1017 * Theory Parity: added rules for simplifying exponents.
1021 The following theorems have been eliminated or modified
1024 list_all_Nil now named list_all.simps(1)
1025 list_all_Cons now named list_all.simps(2)
1026 list_all_conv now named list_all_iff
1027 set_mem_eq now named mem_iff
1029 * Theories SetsAndFunctions and BigO (see HOL/Library) support
1030 asymptotic "big O" calculations. See the notes in BigO.thy.
1035 * Theory RealDef: better support for embedding natural numbers and
1036 integers in the reals.
1038 The following theorems have been eliminated or modified
1041 exp_ge_add_one_self now requires no hypotheses
1042 real_of_int_add reversed direction of equality (use [symmetric])
1043 real_of_int_minus reversed direction of equality (use [symmetric])
1044 real_of_int_diff reversed direction of equality (use [symmetric])
1045 real_of_int_mult reversed direction of equality (use [symmetric])
1047 * Theory RComplete: expanded support for floor and ceiling functions.
1049 * Theory Ln is new, with properties of the natural logarithm
1051 * Hyperreal: There is a new type constructor "star" for making
1052 nonstandard types. The old type names are now type synonyms:
1056 hcomplex = complex star
1058 * Hyperreal: Many groups of similarly-defined constants have been
1059 replaced by polymorphic versions (INCOMPATIBILITY):
1061 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
1063 starset <-- starsetNat, starsetC
1064 *s* <-- *sNat*, *sc*
1065 starset_n <-- starsetNat_n, starsetC_n
1066 *sn* <-- *sNatn*, *scn*
1067 InternalSets <-- InternalNatSets, InternalCSets
1069 starfun <-- starfun{Nat,Nat2,C,RC,CR}
1070 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
1071 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
1072 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
1073 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
1075 * Hyperreal: Many type-specific theorems have been removed in favor of
1076 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
1078 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
1079 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
1080 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
1081 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
1082 right_minus <-- hypreal_add_minus
1083 left_minus <-- {hypreal,hcomplex}_add_minus_left
1084 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
1085 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
1086 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
1087 mult_1_right <-- hcomplex_mult_one_right
1088 mult_zero_left <-- hcomplex_mult_zero_left
1089 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
1090 right_distrib <-- hypnat_add_mult_distrib2
1091 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
1092 right_inverse <-- hypreal_mult_inverse
1093 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
1094 order_refl <-- {hypreal,hypnat}_le_refl
1095 order_trans <-- {hypreal,hypnat}_le_trans
1096 order_antisym <-- {hypreal,hypnat}_le_anti_sym
1097 order_less_le <-- {hypreal,hypnat}_less_le
1098 linorder_linear <-- {hypreal,hypnat}_le_linear
1099 add_left_mono <-- {hypreal,hypnat}_add_left_mono
1100 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
1101 add_nonneg_nonneg <-- hypreal_le_add_order
1103 * Hyperreal: Separate theorems having to do with type-specific
1104 versions of constants have been merged into theorems that apply to the
1105 new polymorphic constants (INCOMPATIBILITY):
1107 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
1108 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
1109 STAR_Un <-- {STAR,NatStar,STARC}_Un
1110 STAR_Int <-- {STAR,NatStar,STARC}_Int
1111 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
1112 STAR_subset <-- {STAR,NatStar,STARC}_subset
1113 STAR_mem <-- {STAR,NatStar,STARC}_mem
1114 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
1115 STAR_diff <-- {STAR,STARC}_diff
1116 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
1117 STARC_hcomplex_of_complex}_image_subset
1118 starset_n_Un <-- starset{Nat,C}_n_Un
1119 starset_n_Int <-- starset{Nat,C}_n_Int
1120 starset_n_Compl <-- starset{Nat,C}_n_Compl
1121 starset_n_diff <-- starset{Nat,C}_n_diff
1122 InternalSets_Un <-- Internal{Nat,C}Sets_Un
1123 InternalSets_Int <-- Internal{Nat,C}Sets_Int
1124 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
1125 InternalSets_diff <-- Internal{Nat,C}Sets_diff
1126 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
1127 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
1128 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
1129 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
1130 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
1131 starfun <-- starfun{Nat,Nat2,C,RC,CR}
1132 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
1133 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
1134 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
1135 starfun_diff <-- starfun{C,RC,CR}_diff
1136 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
1137 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
1138 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
1139 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
1140 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
1141 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
1142 starfun_Id <-- starfunC_Id
1143 starfun_approx <-- starfun{Nat,CR}_approx
1144 starfun_capprox <-- starfun{C,RC}_capprox
1145 starfun_abs <-- starfunNat_rabs
1146 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
1147 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
1148 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
1149 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
1150 starfun_add_capprox <-- starfun{C,RC}_add_capprox
1151 starfun_add_approx <-- starfunCR_add_approx
1152 starfun_inverse_inverse <-- starfunC_inverse_inverse
1153 starfun_divide <-- starfun{C,CR,RC}_divide
1154 starfun_n <-- starfun{Nat,C}_n
1155 starfun_n_mult <-- starfun{Nat,C}_n_mult
1156 starfun_n_add <-- starfun{Nat,C}_n_add
1157 starfun_n_add_minus <-- starfunNat_n_add_minus
1158 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
1159 starfun_n_minus <-- starfun{Nat,C}_n_minus
1160 starfun_n_eq <-- starfun{Nat,C}_n_eq
1162 star_n_add <-- {hypreal,hypnat,hcomplex}_add
1163 star_n_minus <-- {hypreal,hcomplex}_minus
1164 star_n_diff <-- {hypreal,hcomplex}_diff
1165 star_n_mult <-- {hypreal,hcomplex}_mult
1166 star_n_inverse <-- {hypreal,hcomplex}_inverse
1167 star_n_le <-- {hypreal,hypnat}_le
1168 star_n_less <-- {hypreal,hypnat}_less
1169 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
1170 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
1171 star_n_abs <-- hypreal_hrabs
1172 star_n_divide <-- hcomplex_divide
1174 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
1175 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
1176 star_of_diff <-- hypreal_of_real_diff
1177 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
1178 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
1179 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
1180 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
1181 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
1182 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
1183 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
1184 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
1185 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
1186 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
1187 star_of_number_of <-- {hypreal,hcomplex}_number_of
1188 star_of_number_less <-- number_of_less_hypreal_of_real_iff
1189 star_of_number_le <-- number_of_le_hypreal_of_real_iff
1190 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
1191 star_of_less_number <-- hypreal_of_real_less_number_of_iff
1192 star_of_le_number <-- hypreal_of_real_le_number_of_iff
1193 star_of_power <-- hypreal_of_real_power
1194 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
1196 * Hyperreal: new method "transfer" that implements the transfer
1197 principle of nonstandard analysis. With a subgoal that mentions
1198 nonstandard types like "'a star", the command "apply transfer"
1199 replaces it with an equivalent one that mentions only standard types.
1200 To be successful, all free variables must have standard types; non-
1201 standard variables must have explicit universal quantifiers.
1203 * Hyperreal: A theory of Taylor series.
1208 * Discontinued special version of 'constdefs' (which used to support
1209 continuous functions) in favor of the general Pure one with full
1212 * New simplification procedure for solving continuity conditions; it
1213 is much faster on terms with many nested lambda abstractions (cubic
1214 instead of exponential time).
1216 * New syntax for domain package: selector names are now optional.
1217 Parentheses should be omitted unless argument is lazy, for example:
1219 domain 'a stream = cons "'a" (lazy "'a stream")
1221 * New command 'fixrec' for defining recursive functions with pattern
1222 matching; defining multiple functions with mutual recursion is also
1223 supported. Patterns may include the constants cpair, spair, up, sinl,
1224 sinr, or any data constructor defined by the domain package. The given
1225 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
1226 syntax and examples.
1228 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
1229 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
1230 but the proof obligation additionally includes an admissibility
1231 requirement. The packages generate instances of class cpo or pcpo,
1232 with continuity and strictness theorems for Rep and Abs.
1234 * HOLCF: Many theorems have been renamed according to a more standard naming
1235 scheme (INCOMPATIBILITY):
1237 foo_inject: "foo$x = foo$y ==> x = y"
1238 foo_eq: "(foo$x = foo$y) = (x = y)"
1239 foo_less: "(foo$x << foo$y) = (x << y)"
1240 foo_strict: "foo$UU = UU"
1241 foo_defined: "... ==> foo$x ~= UU"
1242 foo_defined_iff: "(foo$x = UU) = (x = UU)"
1247 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
1248 including the First Isomorphism Theorem (on quotienting by the kernel
1251 * ZF/Simplifier: install second copy of type solver that actually
1252 makes use of TC rules declared to Isar proof contexts (or locales);
1253 the old version is still required for ML proof scripts.
1258 * Converted to Isar theory format; use locales instead of axiomatic
1264 * Pure/library.ML no longer defines its own option datatype, but uses
1265 that of the SML basis, which has constructors NONE and SOME instead of
1266 None and Some, as well as exception Option.Option instead of OPTION.
1267 The functions the, if_none, is_some, is_none have been adapted
1268 accordingly, while Option.map replaces apsome.
1270 * Pure/library.ML: the exception LIST has been given up in favour of
1271 the standard exceptions Empty and Subscript, as well as
1272 Library.UnequalLengths. Function like Library.hd and Library.tl are
1273 superceded by the standard hd and tl functions etc.
1275 A number of basic list functions are no longer exported to the ML
1276 toplevel, as they are variants of predefined functions. The following
1277 suggests how one can translate existing code:
1279 rev_append xs ys = List.revAppend (xs, ys)
1280 nth_elem (i, xs) = List.nth (xs, i)
1281 last_elem xs = List.last xs
1282 flat xss = List.concat xss
1283 seq fs = List.app fs
1284 partition P xs = List.partition P xs
1285 mapfilter f xs = List.mapPartial f xs
1287 * Pure/library.ML: several combinators for linear functional
1288 transformations, notably reverse application and composition:
1291 (x, y) |-> f f #-> g
1293 * Pure/library.ML: introduced/changed precedence of infix operators:
1295 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
1297 infix 3 o oo ooo oooo;
1298 infix 4 ~~ upto downto;
1300 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
1303 * Pure/library.ML: natural list combinators fold, fold_rev, and
1304 fold_map support linear functional transformations and nesting. For
1307 fold f [x1, ..., xN] y =
1308 y |> f x1 |> ... |> f xN
1310 (fold o fold) f [xs1, ..., xsN] y =
1311 y |> fold f xs1 |> ... |> fold f xsN
1313 fold f [x1, ..., xN] =
1316 (fold o fold) f [xs1, ..., xsN] =
1317 fold f xs1 #> ... #> fold f xsN
1319 * Pure/library.ML: the following selectors on type 'a option are
1322 the: 'a option -> 'a (*partial*)
1323 these: 'a option -> 'a where 'a = 'b list
1324 the_default: 'a -> 'a option -> 'a
1325 the_list: 'a option -> 'a list
1327 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
1328 basic operations for association lists, following natural argument
1329 order; moreover the explicit equality predicate passed here avoids
1330 potentially expensive polymorphic runtime equality checks.
1331 The old functions may be expressed as follows:
1333 assoc = uncurry (AList.lookup (op =))
1334 assocs = these oo AList.lookup (op =)
1335 overwrite = uncurry (AList.update (op =)) o swap
1337 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
1339 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
1340 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
1342 replacing make_keylist and keyfilter (occassionally used)
1345 make_keylist = AList.make
1346 keyfilter = AList.find (op =)
1348 * eq_fst and eq_snd now take explicit equality parameter, thus
1349 avoiding eqtypes. Naive rewrites:
1351 eq_fst = eq_fst (op =)
1352 eq_snd = eq_snd (op =)
1354 * Removed deprecated apl and apr (rarely used).
1357 apl (n, op) =>>= curry op n
1358 apr (op, m) =>>= fn n => op (n, m)
1360 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
1361 provides a reasonably efficient light-weight implementation of sets as
1364 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
1365 few new operations; existing lookup and update are now curried to
1366 follow natural argument order (for use with fold etc.);
1367 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
1369 * Pure/General: output via the Isabelle channels of
1370 writeln/warning/error etc. is now passed through Output.output, with a
1371 hook for arbitrary transformations depending on the print_mode
1372 (cf. Output.add_mode -- the first active mode that provides a output
1373 function wins). Already formatted output may be embedded into further
1374 text via Output.raw; the result of Pretty.string_of/str_of and derived
1375 functions (string_of_term/cterm/thm etc.) is already marked raw to
1376 accommodate easy composition of diagnostic messages etc. Programmers
1377 rarely need to care about Output.output or Output.raw at all, with
1378 some notable exceptions: Output.output is required when bypassing the
1379 standard channels (writeln etc.), or in token translations to produce
1380 properly formatted results; Output.raw is required when capturing
1381 already output material that will eventually be presented to the user
1382 a second time. For the default print mode, both Output.output and
1383 Output.raw have no effect.
1385 * Pure/General: Output.time_accumulator NAME creates an operator ('a
1386 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
1387 cumulative results are displayed at the end of a batch session.
1389 * Pure/General: File.sysify_path and File.quote_sysify path have been
1390 replaced by File.platform_path and File.shell_path (with appropriate
1391 hooks). This provides a clean interface for unusual systems where the
1392 internal and external process view of file names are different.
1394 * Pure: more efficient orders for basic syntactic entities: added
1395 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
1396 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
1397 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
1398 orders now -- potential INCOMPATIBILITY for code that depends on a
1399 particular order for Symtab.keys, Symtab.dest, etc. (consider using
1400 Library.sort_strings on result).
1402 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
1403 fold_types traverse types/terms from left to right, observing natural
1404 argument order. Supercedes previous foldl_XXX versions, add_frees,
1405 add_vars etc. have been adapted as well: INCOMPATIBILITY.
1407 * Pure: name spaces have been refined, with significant changes of the
1408 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
1409 to extern(_table). The plain name entry path is superceded by a
1410 general 'naming' context, which also includes the 'policy' to produce
1411 a fully qualified name and external accesses of a fully qualified
1412 name; NameSpace.extend is superceded by context dependent
1413 Sign.declare_name. Several theory and proof context operations modify
1414 the naming context. Especially note Theory.restore_naming and
1415 ProofContext.restore_naming to get back to a sane state; note that
1416 Theory.add_path is no longer sufficient to recover from
1417 Theory.absolute_path in particular.
1419 * Pure: new flags short_names (default false) and unique_names
1420 (default true) for controlling output of qualified names. If
1421 short_names is set, names are printed unqualified. If unique_names is
1422 reset, the name prefix is reduced to the minimum required to achieve
1423 the original result when interning again, even if there is an overlap
1424 with earlier declarations.
1426 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
1427 now 'extend', and 'merge' gets an additional Pretty.pp argument
1428 (useful for printing error messages). INCOMPATIBILITY.
1430 * Pure: major reorganization of the theory context. Type Sign.sg and
1431 Theory.theory are now identified, referring to the universal
1432 Context.theory (see Pure/context.ML). Actual signature and theory
1433 content is managed as theory data. The old code and interfaces were
1434 spread over many files and structures; the new arrangement introduces
1435 considerable INCOMPATIBILITY to gain more clarity:
1437 Context -- theory management operations (name, identity, inclusion,
1438 parents, ancestors, merge, etc.), plus generic theory data;
1440 Sign -- logical signature and syntax operations (declaring consts,
1441 types, etc.), plus certify/read for common entities;
1443 Theory -- logical theory operations (stating axioms, definitions,
1444 oracles), plus a copy of logical signature operations (consts,
1445 types, etc.); also a few basic management operations (Theory.copy,
1448 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
1449 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
1450 for convenience -- they merely return the theory.
1452 * Pure: type Type.tsig is superceded by theory in most interfaces.
1454 * Pure: the Isar proof context type is already defined early in Pure
1455 as Context.proof (note that ProofContext.context and Proof.context are
1456 aliases, where the latter is the preferred name). This enables other
1457 Isabelle components to refer to that type even before Isar is present.
1459 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
1460 typeK, constK, axiomK, oracleK), but provide explicit operations for
1461 any of these kinds. For example, Sign.intern typeK is now
1462 Sign.intern_type, Theory.hide_space Sign.typeK is now
1463 Theory.hide_types. Also note that former
1464 Theory.hide_classes/types/consts are now
1465 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
1466 internalize their arguments! INCOMPATIBILITY.
1468 * Pure: get_thm interface (of PureThy and ProofContext) expects
1469 datatype thmref (with constructors Name and NameSelection) instead of
1470 plain string -- INCOMPATIBILITY;
1472 * Pure: cases produced by proof methods specify options, where NONE
1473 means to remove case bindings -- INCOMPATIBILITY in
1476 * Pure: the following operations retrieve axioms or theorems from a
1477 theory node or theory hierarchy, respectively:
1479 Theory.axioms_of: theory -> (string * term) list
1480 Theory.all_axioms_of: theory -> (string * term) list
1481 PureThy.thms_of: theory -> (string * thm) list
1482 PureThy.all_thms_of: theory -> (string * thm) list
1484 * Pure: print_tac now outputs the goal through the trace channel.
1486 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
1487 Reference Toplevel.debug (default false) controls detailed printing
1488 and tracing of low-level exceptions; Toplevel.profiling (default 0)
1489 controls execution profiling -- set to 1 for time and 2 for space
1490 (both increase the runtime).
1492 * Isar session: The initial use of ROOT.ML is now always timed,
1493 i.e. the log will show the actual process times, in contrast to the
1494 elapsed wall-clock time that the outer shell wrapper produces.
1496 * Simplifier: improved handling of bound variables (nameless
1497 representation, avoid allocating new strings). Simprocs that invoke
1498 the Simplifier recursively should use Simplifier.inherit_bounds to
1499 avoid local name clashes. Failure to do so produces warnings
1500 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
1501 for further details.
1503 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
1504 bindings for all theorems stored within a given theory; this may help
1505 in porting non-Isar theories to Isar ones, while keeping ML proof
1506 scripts for the time being.
1508 * ML operator HTML.with_charset specifies the charset begin used for
1509 generated HTML files. For example:
1511 HTML.with_charset "utf-8" use_thy "Hebrew";
1512 HTML.with_charset "utf-8" use_thy "Chinese";
1517 * Allow symlinks to all proper Isabelle executables (Isabelle,
1518 isabelle, isatool etc.).
1520 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
1521 isatool doc, isatool mkdir, display_drafts etc.).
1523 * isatool usedir: option -f allows specification of the ML file to be
1524 used by Isabelle; default is ROOT.ML.
1526 * New isatool version outputs the version identifier of the Isabelle
1527 distribution being used.
1529 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
1530 (containing Boolean satisfiability problems) into Isabelle/HOL
1535 New in Isabelle2004 (April 2004)
1536 --------------------------------
1540 * Provers/order.ML: new efficient reasoner for partial and linear orders.
1541 Replaces linorder.ML.
1543 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
1544 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
1545 (\<a>...\<z>), are now considered normal letters, and can therefore
1546 be used anywhere where an ASCII letter (a...zA...Z) has until
1547 now. COMPATIBILITY: This obviously changes the parsing of some
1548 terms, especially where a symbol has been used as a binder, say
1549 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
1550 as an identifier. Fix it by inserting a space around former
1551 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
1552 existing theory and ML files.
1554 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
1556 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
1557 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
1558 a normal (but invisible) letter. For multiple letter subscripts repeat
1559 \<^isub> like this: x\<^isub>1\<^isub>2.
1561 * Pure: There are now sub-/superscripts that can span more than one
1562 character. Text between \<^bsub> and \<^esub> is set in subscript in
1563 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
1564 superscript. The new control characters are not identifier parts.
1566 * Pure: Control-symbols of the form \<^raw:...> will literally print the
1567 content of "..." to the latex file instead of \isacntrl... . The "..."
1568 may consist of any printable characters excluding the end bracket >.
1570 * Pure: Using new Isar command "finalconsts" (or the ML functions
1571 Theory.add_finals or Theory.add_finals_i) it is now possible to
1572 declare constants "final", which prevents their being given a definition
1573 later. It is useful for constants whose behaviour is fixed axiomatically
1574 rather than definitionally, such as the meta-logic connectives.
1576 * Pure: 'instance' now handles general arities with general sorts
1577 (i.e. intersections of classes),
1579 * Presentation: generated HTML now uses a CSS style sheet to make layout
1580 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
1581 It can be changed to alter the colors/layout of generated pages.
1586 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
1587 cut_tac, subgoal_tac and thin_tac:
1588 - Now understand static (Isar) contexts. As a consequence, users of Isar
1589 locales are no longer forced to write Isar proof scripts.
1590 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
1592 - INCOMPATIBILITY: names of variables to be instantiated may no
1593 longer be enclosed in quotes. Instead, precede variable name with `?'.
1594 This is consistent with the instantiation attribute "where".
1596 * Attributes "where" and "of":
1597 - Now take type variables of instantiated theorem into account when reading
1598 the instantiation string. This fixes a bug that caused instantiated
1599 theorems to have too special types in some circumstances.
1600 - "where" permits explicit instantiations of type variables.
1602 * Calculation commands "moreover" and "also" no longer interfere with
1603 current facts ("this"), admitting arbitrary combinations with "then"
1607 - Goal statements involving the context element "includes" no longer
1608 generate theorems with internal delta predicates (those ending on
1609 "_axioms") in the premise.
1610 Resolve particular premise with <locale>.intro to obtain old form.
1611 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
1612 specification and "includes" elements in goal statement.
1613 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
1614 [intro?] and [elim?] (respectively) by default.
1615 - Experimental command for instantiation of locales in proof contexts:
1616 instantiate <label>[<attrs>]: <loc>
1617 Instantiates locale <loc> and adds all its theorems to the current context
1618 taking into account their attributes. Label and attrs are optional
1619 modifiers, like in theorem declarations. If present, names of
1620 instantiated theorems are qualified with <label>, and the attributes
1621 <attrs> are applied after any attributes these theorems might have already.
1622 If the locale has assumptions, a chained fact of the form
1623 "<loc> t1 ... tn" is expected from which instantiations of the parameters
1624 are derived. The command does not support old-style locales declared
1625 with "locale (open)".
1626 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
1628 * HOL: Tactic emulation methods induct_tac and case_tac understand static
1634 * Proof import: new image HOL4 contains the imported library from
1635 the HOL4 system with about 2500 theorems. It is imported by
1636 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
1637 can be used like any other Isabelle image. See
1638 HOL/Import/HOL/README for more information.
1641 - Much improved handling of linear and partial orders.
1642 Reasoners for linear and partial orders are set up for type classes
1643 "linorder" and "order" respectively, and are added to the default simpset
1644 as solvers. This means that the simplifier can build transitivity chains
1645 to solve goals from the assumptions.
1646 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
1647 of blast or auto after simplification become unnecessary because the goal
1648 is solved by simplification already.
1650 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
1651 all proved in axiomatic type classes for semirings, rings and fields.
1654 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
1655 now formalized using the Ring_and_Field theory mentioned above.
1656 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
1657 than before, because now they are set up once in a generic manner.
1658 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
1659 Look for the general versions in Ring_and_Field (and Power if they concern
1662 * Type "rat" of the rational numbers is now available in HOL-Complex.
1665 - Record types are now by default printed with their type abbreviation
1666 instead of the list of all field types. This can be configured via
1667 the reference "print_record_type_abbr".
1668 - Simproc "record_upd_simproc" for simplification of multiple updates added
1669 (not enabled by default).
1670 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
1671 EX x. x = sel r to True (not enabled by default).
1672 - Tactic "record_split_simp_tac" to split and simplify records added.
1674 * 'specification' command added, allowing for definition by
1675 specification. There is also an 'ax_specification' command that
1676 introduces the new constants axiomatically.
1678 * arith(_tac) is now able to generate counterexamples for reals as well.
1680 * HOL-Algebra: new locale "ring" for non-commutative rings.
1682 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
1683 definitions, thanks to Sava Krsti\'{c} and John Matthews.
1685 * HOL-Matrix: a first theory for matrices in HOL with an application of
1686 matrix theory to linear programming.
1688 * Unions and Intersections:
1689 The latex output syntax of UN and INT has been changed
1690 from "\Union x \in A. B" to "\Union_{x \in A} B"
1691 i.e. the index formulae has become a subscript.
1692 Similarly for "\Union x. B", and for \Inter instead of \Union.
1694 * Unions and Intersections over Intervals:
1695 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
1696 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
1697 like in normal math, and corresponding versions for < and for intersection.
1699 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
1700 lexicographic dictonary ordering has been added as "lexord".
1702 * ML: the legacy theory structures Int and List have been removed. They had
1703 conflicted with ML Basis Library structures having the same names.
1705 * 'refute' command added to search for (finite) countermodels. Only works
1706 for a fragment of HOL. The installation of an external SAT solver is
1707 highly recommended. See "HOL/Refute.thy" for details.
1709 * 'quickcheck' command: Allows to find counterexamples by evaluating
1710 formulae under an assignment of free variables to random values.
1711 In contrast to 'refute', it can deal with inductive datatypes,
1712 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
1718 * Streams now come with concatenation and are part of the HOLCF image
1722 New in Isabelle2003 (May 2003)
1723 ------------------------------
1727 * Provers/simplifier:
1729 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
1730 Assumptions are now subject to complete mutual simplification,
1731 not just from left to right. The simplifier now preserves
1732 the order of assumptions.
1734 Potential INCOMPATIBILITY:
1736 -- simp sometimes diverges where the old version did
1737 not, e.g. invoking simp on the goal
1739 [| P (f x); y = x; f x = f y |] ==> Q
1741 now gives rise to the infinite reduction sequence
1743 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
1745 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
1748 -- Tactics combining classical reasoner and simplification (such as auto)
1749 are also affected by this change, because many of them rely on
1750 simp. They may sometimes diverge as well or yield a different numbers
1751 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
1752 in case of problems. Sometimes subsequent calls to the classical
1753 reasoner will fail because a preceeding call to the simplifier too
1754 eagerly simplified the goal, e.g. deleted redundant premises.
1756 - The simplifier trace now shows the names of the applied rewrite rules
1758 - You can limit the number of recursive invocations of the simplifier
1759 during conditional rewriting (where the simplifie tries to solve the
1760 conditions before applying the rewrite rule):
1761 ML "simp_depth_limit := n"
1762 where n is an integer. Thus you can force termination where previously
1763 the simplifier would diverge.
1765 - Accepts free variables as head terms in congruence rules. Useful in Isar.
1767 - No longer aborts on failed congruence proof. Instead, the
1768 congruence is ignored.
1770 * Pure: New generic framework for extracting programs from constructive
1771 proofs. See HOL/Extraction.thy for an example instantiation, as well
1772 as HOL/Extraction for some case studies.
1774 * Pure: The main goal of the proof state is no longer shown by default, only
1775 the subgoals. This behaviour is controlled by a new flag.
1776 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
1777 (ML: Proof.show_main_goal).
1779 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
1780 rules whose conclusion matches subgoal 1:
1781 PG menu: Isabelle/Isar -> Show me -> matching rules
1782 The rules are ordered by how closely they match the subgoal.
1783 In particular, rules that solve a subgoal outright are displayed first
1784 (or rather last, the way they are printed).
1785 (ML: ProofGeneral.print_intros())
1787 * Pure: New flag trace_unify_fail causes unification to print
1788 diagnostic information (PG: in trace buffer) when it fails. This is
1789 useful for figuring out why single step proofs like rule, erule or
1792 * Pure: Locale specifications now produce predicate definitions
1793 according to the body of text (covering assumptions modulo local
1794 definitions); predicate "loc_axioms" covers newly introduced text,
1795 while "loc" is cumulative wrt. all included locale expressions; the
1796 latter view is presented only on export into the global theory
1797 context; potential INCOMPATIBILITY, use "(open)" option to fall back
1798 on the old view without predicates;
1800 * Pure: predefined locales "var" and "struct" are useful for sharing
1801 parameters (as in CASL, for example); just specify something like
1802 ``var x + var y + struct M'' as import;
1804 * Pure: improved thms_containing: proper indexing of facts instead of
1805 raw theorems; check validity of results wrt. current name space;
1806 include local facts of proof configuration (also covers active
1807 locales), cover fixed variables in index; may use "_" in term
1808 specification; an optional limit for the number of printed facts may
1809 be given (the default is 40);
1811 * Pure: disallow duplicate fact bindings within new-style theory files
1814 * Provers: improved induct method: assumptions introduced by case
1815 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
1816 the goal statement); "foo" still refers to all facts collectively;
1818 * Provers: the function blast.overloaded has been removed: all constants
1819 are regarded as potentially overloaded, which improves robustness in exchange
1820 for slight decrease in efficiency;
1822 * Provers/linorder: New generic prover for transitivity reasoning over
1823 linear orders. Note: this prover is not efficient!
1825 * Isar: preview of problems to finish 'show' now produce an error
1826 rather than just a warning (in interactive mode);
1833 - Produces a counter example if it cannot prove a goal.
1834 Note that the counter example may be spurious if the goal is not a formula
1835 of quantifier-free linear arithmetic.
1836 In ProofGeneral the counter example appears in the trace buffer.
1838 - Knows about div k and mod k where k is a numeral of type nat or int.
1840 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
1841 linear arithmetic fails. This takes account of quantifiers and divisibility.
1842 Presburger arithmetic can also be called explicitly via presburger(_tac).
1844 * simp's arithmetic capabilities have been enhanced a bit: it now
1845 takes ~= in premises into account (by performing a case split);
1847 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
1848 are distributed over a sum of terms;
1850 * New tactic "trans_tac" and method "trans" instantiate
1851 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
1854 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
1855 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
1857 * 'typedef' command has new option "open" to suppress the set
1860 * functions Min and Max on finite sets have been introduced (theory
1863 * attribute [symmetric] now works for relations as well; it turns
1864 (x,y) : R^-1 into (y,x) : R, and vice versa;
1866 * induct over a !!-quantified statement (say !!x1..xn):
1867 each "case" automatically performs "fix x1 .. xn" with exactly those names.
1869 * Map: `empty' is no longer a constant but a syntactic abbreviation for
1870 %x. None. Warning: empty_def now refers to the previously hidden definition
1873 * Algebra: formalization of classical algebra. Intended as base for
1874 any algebraic development in Isabelle. Currently covers group theory
1875 (up to Sylow's theorem) and ring theory (Universal Property of
1876 Univariate Polynomials). Contributions welcome;
1878 * GroupTheory: deleted, since its material has been moved to Algebra;
1880 * Complex: new directory of the complex numbers with numeric constants,
1881 nonstandard complex numbers, and some complex analysis, standard and
1882 nonstandard (Jacques Fleuriot);
1884 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
1886 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
1889 * Real/HahnBanach: updated and adapted to locales;
1891 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
1894 * UNITY: added the Meier-Sanders theory of progress sets;
1896 * MicroJava: bytecode verifier and lightweight bytecode verifier
1897 as abstract algorithms, instantiated to the JVM;
1899 * Bali: Java source language formalization. Type system, operational
1900 semantics, axiomatic semantics. Supported language features:
1901 classes, interfaces, objects,virtual methods, static methods,
1902 static/instance fields, arrays, access modifiers, definite
1903 assignment, exceptions.
1908 * ZF/Constructible: consistency proof for AC (Gdel's constructible
1911 * Main ZF: virtually all theories converted to new-style format;
1916 * Pure: Tactic.prove provides sane interface for internal proofs;
1917 omits the infamous "standard" operation, so this is more appropriate
1918 than prove_goalw_cterm in many situations (e.g. in simprocs);
1920 * Pure: improved error reporting of simprocs;
1922 * Provers: Simplifier.simproc(_i) provides sane interface for setting
1926 *** Document preparation ***
1928 * uses \par instead of \\ for line breaks in theory text. This may
1929 shift some page breaks in large documents. To get the old behaviour
1930 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
1932 * minimized dependencies of isabelle.sty and isabellesym.sty on
1935 * \<euro> now needs package babel/greek instead of marvosym (which
1938 * normal size for \<zero>...\<nine> (uses \mathbf instead of
1943 New in Isabelle2002 (March 2002)
1944 --------------------------------
1946 *** Document preparation ***
1948 * greatly simplified document preparation setup, including more
1949 graceful interpretation of isatool usedir -i/-d/-D options, and more
1950 instructive isatool mkdir; users should basically be able to get
1951 started with "isatool mkdir HOL Test && isatool make"; alternatively,
1952 users may run a separate document processing stage manually like this:
1953 "isatool usedir -D output HOL Test && isatool document Test/output";
1955 * theory dependency graph may now be incorporated into documents;
1956 isatool usedir -g true will produce session_graph.eps/.pdf for use
1957 with \includegraphics of LaTeX;
1959 * proper spacing of consecutive markup elements, especially text
1960 blocks after section headings;
1962 * support bold style (for single symbols only), input syntax is like
1963 this: "\<^bold>\<alpha>" or "\<^bold>A";
1965 * \<bullet> is now output as bold \cdot by default, which looks much
1966 better in printed text;
1968 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
1969 note that these symbols are currently unavailable in Proof General /
1970 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
1972 * isatool latex no longer depends on changed TEXINPUTS, instead
1973 isatool document copies the Isabelle style files to the target
1979 * Pure/Provers: improved proof by cases and induction;
1980 - 'case' command admits impromptu naming of parameters (such as
1982 - 'induct' method divinates rule instantiation from the inductive
1983 claim; no longer requires excessive ?P bindings for proper
1984 instantiation of cases;
1985 - 'induct' method properly enumerates all possibilities of set/type
1986 rules; as a consequence facts may be also passed through *type*
1987 rules without further ado;
1988 - 'induct' method now derives symbolic cases from the *rulified*
1989 rule (before it used to rulify cases stemming from the internal
1990 atomized version); this means that the context of a non-atomic
1991 statement becomes is included in the hypothesis, avoiding the
1992 slightly cumbersome show "PROP ?case" form;
1993 - 'induct' may now use elim-style induction rules without chaining
1994 facts, using ``missing'' premises from the goal state; this allows
1995 rules stemming from inductive sets to be applied in unstructured
1996 scripts, while still benefitting from proper handling of non-atomic
1997 statements; NB: major inductive premises need to be put first, all
1998 the rest of the goal is passed through the induction;
1999 - 'induct' proper support for mutual induction involving non-atomic
2000 rule statements (uses the new concept of simultaneous goals, see
2002 - append all possible rule selections, but only use the first
2003 success (no backtracking);
2004 - removed obsolete "(simplified)" and "(stripped)" options of methods;
2005 - undeclared rule case names default to numbers 1, 2, 3, ...;
2006 - added 'print_induct_rules' (covered by help item in recent Proof
2008 - moved induct/cases attributes to Pure, methods to Provers;
2009 - generic method setup instantiated for FOL and HOL;
2011 * Pure: support multiple simultaneous goal statements, for example
2012 "have a: A and b: B" (same for 'theorem' etc.); being a pure
2013 meta-level mechanism, this acts as if several individual goals had
2014 been stated separately; in particular common proof methods need to be
2015 repeated in order to cover all claims; note that a single elimination
2016 step is *not* sufficient to establish the two conjunctions, so this
2019 assume "A & B" then have A and B .. (*".." fails*)
2021 better use "obtain" in situations as above; alternative refer to
2022 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
2024 * Pure: proper integration with ``locales''; unlike the original
2025 version by Florian Kammller, Isar locales package high-level proof
2026 contexts rather than raw logical ones (e.g. we admit to include
2027 attributes everywhere); operations on locales include merge and
2028 rename; support for implicit arguments (``structures''); simultaneous
2029 type-inference over imports and text; see also HOL/ex/Locales.thy for
2032 * Pure: the following commands have been ``localized'', supporting a
2033 target locale specification "(in name)": 'lemma', 'theorem',
2034 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
2035 stored both within the locale and at the theory level (exported and
2036 qualified by the locale name);
2038 * Pure: theory goals may now be specified in ``long'' form, with
2039 ad-hoc contexts consisting of arbitrary locale elements. for example
2040 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
2041 definitions may be given, too); the result is a meta-level rule with
2042 the context elements being discharged in the obvious way;
2044 * Pure: new proof command 'using' allows to augment currently used
2045 facts after a goal statement ('using' is syntactically analogous to
2046 'apply', but acts on the goal's facts only); this allows chained facts
2047 to be separated into parts given before and after a claim, as in
2048 ``from a and b have C using d and e <proof>'';
2050 * Pure: renamed "antecedent" case to "rule_context";
2052 * Pure: new 'judgment' command records explicit information about the
2053 object-logic embedding (used by several tools internally); no longer
2054 use hard-wired "Trueprop";
2056 * Pure: added 'corollary' command;
2058 * Pure: fixed 'token_translation' command;
2060 * Pure: removed obsolete 'exported' attribute;
2062 * Pure: dummy pattern "_" in is/let is now automatically lifted over
2063 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
2064 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
2066 * Pure: method 'atomize' presents local goal premises as object-level
2067 statements (atomic meta-level propositions); setup controlled via
2068 rewrite rules declarations of 'atomize' attribute; example
2069 application: 'induct' method with proper rule statements in improper
2072 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
2073 now consider the syntactic context of assumptions, giving a better
2074 chance to get type-inference of the arguments right (this is
2075 especially important for locales);
2077 * Pure: "sorry" no longer requires quick_and_dirty in interactive
2080 * Pure/obtain: the formal conclusion "thesis", being marked as
2081 ``internal'', may no longer be reference directly in the text;
2082 potential INCOMPATIBILITY, may need to use "?thesis" in rare
2085 * Pure: generic 'sym' attribute which declares a rule both as pure
2086 'elim?' and for the 'symmetric' operation;
2088 * Pure: marginal comments ``--'' may now occur just anywhere in the
2089 text; the fixed correlation with particular command syntax has been
2092 * Pure: new method 'rules' is particularly well-suited for proof
2093 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
2094 but often produces more compact proof terms with less detours;
2096 * Pure/Provers/classical: simplified integration with pure rule
2097 attributes and methods; the classical "intro?/elim?/dest?"
2098 declarations coincide with the pure ones; the "rule" method no longer
2099 includes classically swapped intros; "intro" and "elim" methods no
2100 longer pick rules from the context; also got rid of ML declarations
2101 AddXIs/AddXEs/AddXDs; all of this has some potential for
2104 * Provers/classical: attribute 'swapped' produces classical inversions
2105 of introduction rules;
2107 * Provers/simplifier: 'simplified' attribute may refer to explicit
2108 rules instead of full simplifier context; 'iff' attribute handles
2111 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
2113 * HOL: 'recdef' now fails on unfinished automated proofs, use
2114 "(permissive)" option to recover old behavior;
2116 * HOL: 'inductive' no longer features separate (collective) attributes
2117 for 'intros' (was found too confusing);
2119 * HOL: properly declared induction rules less_induct and
2125 * HOL: moved over to sane numeral syntax; the new policy is as
2128 - 0 and 1 are polymorphic constants, which are defined on any
2129 numeric type (nat, int, real etc.);
2131 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
2132 binary representation internally;
2134 - type nat has special constructor Suc, and generally prefers Suc 0
2135 over 1::nat and Suc (Suc 0) over 2::nat;
2137 This change may cause significant problems of INCOMPATIBILITY; here
2138 are some hints on converting existing sources:
2140 - due to the new "num" token, "-0" and "-1" etc. are now atomic
2141 entities, so expressions involving "-" (unary or binary minus) need
2142 to be spaced properly;
2144 - existing occurrences of "1" may need to be constraint "1::nat" or
2145 even replaced by Suc 0; similar for old "2";
2147 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
2149 - remove all special provisions on numerals in proofs;
2151 * HOL: simp rules nat_number expand numerals on nat to Suc/0
2152 representation (depends on bin_arith_simps in the default context);
2154 * HOL: symbolic syntax for x^2 (numeral 2);
2156 * HOL: the class of all HOL types is now called "type" rather than
2157 "term"; INCOMPATIBILITY, need to adapt references to this type class
2158 in axclass/classes, instance/arities, and (usually rare) occurrences
2159 in typings (of consts etc.); internally the class is called
2160 "HOL.type", ML programs should refer to HOLogic.typeS;
2162 * HOL/record package improvements:
2163 - new derived operations "fields" to build a partial record section,
2164 "extend" to promote a fixed record to a record scheme, and
2165 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
2166 declared as simp by default;
2167 - shared operations ("more", "fields", etc.) now need to be always
2168 qualified) --- potential INCOMPATIBILITY;
2169 - removed "make_scheme" operations (use "make" with "extend") --
2171 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
2172 - provides cases/induct rules for use with corresponding Isar
2173 methods (for concrete records, record schemes, concrete more
2174 parts, and schematic more parts -- in that order);
2175 - internal definitions directly based on a light-weight abstract
2176 theory of product types over typedef rather than datatype;
2178 * HOL: generic code generator for generating executable ML code from
2179 specifications; specific support for HOL constructs such as inductive
2180 datatypes and sets, as well as recursive functions; can be invoked
2181 via 'generate_code' theory section;
2183 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
2185 * HOL: consolidated and renamed several theories. In particular:
2186 Ord.thy has been absorbed into HOL.thy
2187 String.thy has been absorbed into List.thy
2189 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
2190 (beware of argument permutation!);
2192 * HOL: linorder_less_split superseded by linorder_cases;
2194 * HOL/List: "nodups" renamed to "distinct";
2196 * HOL: added "The" definite description operator; move Hilbert's "Eps"
2197 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
2198 - Ex_def has changed, now need to use some_eq_ex
2200 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
2201 in this (rare) case use:
2203 delSWrapper "split_all_tac"
2204 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
2206 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
2209 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
2210 Isabelle's type classes, ^ on functions and relations has too general
2211 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
2212 necessary to attach explicit type constraints;
2214 * HOL/Relation: the prefix name of the infix "O" has been changed from
2215 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
2216 renamed accordingly (eg "compI" -> "rel_compI").
2218 * HOL: syntax translations now work properly with numerals and records
2221 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
2222 of "lam" -- INCOMPATIBILITY;
2224 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
2225 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
2226 renamed "Product_Type.unit";
2228 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
2230 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
2231 the "cases" method);
2233 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
2236 * HOL/IMP: updated and converted to new-style theory format; several
2237 parts turned into readable document, with proper Isar proof texts and
2238 some explanations (by Gerwin Klein);
2240 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
2242 * HOL-Hyperreal is now a logic image;
2247 * Isar: consts/constdefs supports mixfix syntax for continuous
2250 * Isar: domain package adapted to new-style theory format, e.g. see
2253 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
2254 potential INCOMPATIBILITY; now use plain induct_tac instead of former
2255 lift.induct_tac, always use UU instead of Undef;
2257 * HOLCF/IMP: updated and converted to new-style theory;
2262 * Isar: proper integration of logic-specific tools and packages,
2263 including theory commands '(co)inductive', '(co)datatype',
2264 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
2265 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
2267 * theory Main no longer includes AC; for the Axiom of Choice, base
2268 your theory on Main_ZFC;
2270 * the integer library now covers quotients and remainders, with many
2271 laws relating division to addition, multiplication, etc.;
2273 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
2274 typeless version of the formalism;
2276 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
2279 * ZF/Induct: new directory for examples of inductive definitions,
2280 including theory Multiset for multiset orderings; converted to
2281 new-style theory format;
2283 * ZF: many new theorems about lists, ordinals, etc.;
2288 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
2289 variable proof controls level of detail: 0 = no proofs (only oracle
2290 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
2291 also ref manual for further ML interfaces;
2293 * Pure/axclass: removed obsolete ML interface
2294 goal_subclass/goal_arity;
2296 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
2297 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
2298 separate tokens, so expressions involving minus need to be spaced
2301 * Pure/syntax: support non-oriented infixes, using keyword "infix"
2302 rather than "infixl" or "infixr";
2304 * Pure/syntax: concrete syntax for dummy type variables admits genuine
2305 sort constraint specifications in type inference; e.g. "x::_::foo"
2306 ensures that the type of "x" is of sort "foo" (but not necessarily a
2309 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
2310 control output of nested => (types); the default behavior is
2313 * Pure/syntax: builtin parse translation for "_constify" turns valued
2314 tokens into AST constants;
2316 * Pure/syntax: prefer later declarations of translations and print
2317 translation functions; potential INCOMPATIBILITY: need to reverse
2318 multiple declarations for same syntax element constant;
2320 * Pure/show_hyps reset by default (in accordance to existing Isar
2323 * Provers/classical: renamed addaltern to addafter, addSaltern to
2326 * Provers/clasimp: ``iff'' declarations now handle conditional rules
2329 * system: tested support for MacOS X; should be able to get Isabelle +
2330 Proof General to work in a plain Terminal after installing Poly/ML
2331 (e.g. from the Isabelle distribution area) and GNU bash alone
2332 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
2333 support requires further installations, e.g. from
2334 http://fink.sourceforge.net/);
2336 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
2338 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
2339 of 40 MB), cf. ML_OPTIONS;
2341 * system: Proof General keywords specification is now part of the
2342 Isabelle distribution (see etc/isar-keywords.el);
2344 * system: support for persistent Proof General sessions (refrain from
2345 outdating all loaded theories on startup); user may create writable
2346 logic images like this: ``isabelle -q HOL Test'';
2348 * system: smart selection of Isabelle process versus Isabelle
2349 interface, accommodates case-insensitive file systems (e.g. HFS+); may
2350 run both "isabelle" and "Isabelle" even if file names are badly
2351 damaged (executable inspects the case of the first letter of its own
2352 name); added separate "isabelle-process" and "isabelle-interface";
2354 * system: refrain from any attempt at filtering input streams; no
2355 longer support ``8bit'' encoding of old isabelle font, instead proper
2356 iso-latin characters may now be used; the related isatools
2357 "symbolinput" and "nonascii" have disappeared as well;
2359 * system: removed old "xterm" interface (the print modes "xterm" and
2360 "xterm_color" are still available for direct use in a suitable
2365 New in Isabelle99-2 (February 2001)
2366 -----------------------------------
2368 *** Overview of INCOMPATIBILITIES ***
2370 * HOL: please note that theories in the Library and elsewhere often use the
2371 new-style (Isar) format; to refer to their theorems in an ML script you must
2372 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
2374 * HOL: inductive package no longer splits induction rule aggressively,
2375 but only as far as specified by the introductions given; the old
2376 format may be recovered via ML function complete_split_rule or attribute
2377 'split_rule (complete)';
2379 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
2380 gfp_Tarski to gfp_unfold;
2382 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
2384 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
2385 relation); infix "^^" has been renamed "``"; infix "``" has been
2386 renamed "`"; "univalent" has been renamed "single_valued";
2388 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
2391 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
2393 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
2395 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
2396 consequence, it is no longer monotonic wrt. the local goal context
2397 (which is now passed through the inductive cases);
2399 * Document preparation: renamed standard symbols \<ll> to \<lless> and
2400 \<gg> to \<ggreater>;
2403 *** Document preparation ***
2405 * \isabellestyle{NAME} selects version of Isabelle output (currently
2406 available: are "it" for near math-mode best-style output, "sl" for
2407 slanted text style, and "tt" for plain type-writer; if no
2408 \isabellestyle command is given, output is according to slanted
2411 * support sub/super scripts (for single symbols only), input syntax is
2412 like this: "A\<^sup>*" or "A\<^sup>\<star>";
2414 * some more standard symbols; see Appendix A of the system manual for
2415 the complete list of symbols defined in isabellesym.sty;
2417 * improved isabelle style files; more abstract symbol implementation
2418 (should now use \isamath{...} and \isatext{...} in custom symbol
2421 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
2422 state; Note that presentation of goal states does not conform to
2423 actual human-readable proof documents. Please do not include goal
2424 states into document output unless you really know what you are doing!
2426 * proper indentation of antiquoted output with proportional LaTeX
2429 * no_document ML operator temporarily disables LaTeX document
2432 * isatool unsymbolize tunes sources for plain ASCII communication;
2437 * Pure: Isar now suffers initial goal statements to contain unbound
2438 schematic variables (this does not conform to actual readable proof
2439 documents, due to unpredictable outcome and non-compositional proof
2440 checking); users who know what they are doing may use schematic goals
2441 for Prolog-style synthesis of proven results;
2443 * Pure: assumption method (an implicit finishing) now handles actual
2446 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
2447 initial goal, declare "that" only as Pure intro (only for single
2448 steps); the "that" rule assumption may now be involved in implicit
2449 finishing, thus ".." becomes a feasible for trivial obtains;
2451 * Pure: default proof step now includes 'intro_classes'; thus trivial
2452 instance proofs may be performed by "..";
2454 * Pure: ?thesis / ?this / "..." now work for pure meta-level
2457 * Pure: more robust selection of calculational rules;
2459 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
2460 rule (as well as the assumption rule);
2462 * Pure: 'thm_deps' command visualizes dependencies of theorems and
2463 lemmas, using the graph browser tool;
2465 * Pure: predict failure of "show" in interactive mode;
2467 * Pure: 'thms_containing' now takes actual terms as arguments;
2469 * HOL: improved method 'induct' --- now handles non-atomic goals
2470 (potential INCOMPATIBILITY); tuned error handling;
2472 * HOL: cases and induct rules now provide explicit hints about the
2473 number of facts to be consumed (0 for "type" and 1 for "set" rules);
2474 any remaining facts are inserted into the goal verbatim;
2476 * HOL: local contexts (aka cases) may now contain term bindings as
2477 well; the 'cases' and 'induct' methods new provide a ?case binding for
2478 the result to be shown in each case;
2480 * HOL: added 'recdef_tc' command;
2482 * isatool convert assists in eliminating legacy ML scripts;
2487 * HOL/Library: a collection of generic theories to be used together
2488 with main HOL; the theory loader path already includes this directory
2489 by default; the following existing theories have been moved here:
2490 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
2491 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
2493 * HOL/Unix: "Some aspects of Unix file-system security", a typical
2494 modelling and verification task performed in Isabelle/HOL +
2495 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
2497 * HOL/Algebra: special summation operator SUM no longer exists, it has
2498 been replaced by setsum; infix 'assoc' now has priority 50 (like
2499 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
2500 'domain', this makes the theory consistent with mathematical
2503 * HOL basics: added overloaded operations "inverse" and "divide"
2504 (infix "/"), syntax for generic "abs" operation, generic summation
2507 * HOL/typedef: simplified package, provide more useful rules (see also
2510 * HOL/datatype: induction rule for arbitrarily branching datatypes is
2511 now expressed as a proper nested rule (old-style tactic scripts may
2512 require atomize_strip_tac to cope with non-atomic premises);
2514 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
2515 to "split_conv" (old name still available for compatibility);
2517 * HOL: improved concrete syntax for strings (e.g. allows translation
2518 rules with string literals);
2520 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
2521 and Fleuriot's mechanization of analysis, including the transcendental
2522 functions for the reals;
2524 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
2529 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
2530 "lam" is displayed as TWO lambda-symbols
2532 * CTT: theory Main now available, containing everything (that is, Bool
2538 * Pure: the Simplifier has been implemented properly as a derived rule
2539 outside of the actual kernel (at last!); the overall performance
2540 penalty in practical applications is about 50%, while reliability of
2541 the Isabelle inference kernel has been greatly improved;
2543 * print modes "brackets" and "no_brackets" control output of nested =>
2544 (types) and ==> (props); the default behaviour is "brackets";
2546 * Provers: fast_tac (and friends) now handle actual object-logic rules
2547 as assumptions as well;
2549 * system: support Poly/ML 4.0;
2551 * system: isatool install handles KDE version 1 or 2;
2555 New in Isabelle99-1 (October 2000)
2556 ----------------------------------
2558 *** Overview of INCOMPATIBILITIES ***
2560 * HOL: simplification of natural numbers is much changed; to partly
2561 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
2562 issue the following ML commands:
2564 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
2565 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
2567 * HOL: simplification no longer dives into case-expressions; this is
2568 controlled by "t.weak_case_cong" for each datatype t;
2570 * HOL: nat_less_induct renamed to less_induct;
2572 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
2573 fixsome to patch .thy and .ML sources automatically;
2575 select_equality -> some_equality
2576 select_eq_Ex -> some_eq_ex
2577 selectI2EX -> someI2_ex
2580 select1_equality -> some1_equality
2581 Eps_sym_eq -> some_sym_eq_trivial
2582 Eps_eq -> some_eq_trivial
2584 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
2586 * HOL: removed obsolete theorem binding expand_if (refer to split_if
2589 * HOL: the recursion equations generated by 'recdef' are now called
2590 f.simps instead of f.rules;
2592 * HOL: qed_spec_mp now also handles bounded ALL as well;
2594 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
2595 sometimes be needed;
2597 * HOL: the constant for "f``x" is now "image" rather than "op ``";
2599 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
2601 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
2602 product is now "<*>" instead of "Times"; the lexicographic product is
2603 now "<*lex*>" instead of "**";
2605 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
2606 of main HOL, but was unused); better use HOL's datatype package;
2608 * HOL: removed "symbols" syntax for constant "override" of theory Map;
2609 the old syntax may be recovered as follows:
2612 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
2613 (infixl "\\<oplus>" 100)
2615 * HOL/Real: "rabs" replaced by overloaded "abs" function;
2617 * HOL/ML: even fewer consts are declared as global (see theories Ord,
2618 Lfp, Gfp, WF); this only affects ML packages that refer to const names
2621 * HOL and ZF: syntax for quotienting wrt an equivalence relation
2622 changed from A/r to A//r;
2624 * ZF: new treatment of arithmetic (nat & int) may break some old
2627 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
2628 rulify -> rule_format, elimify -> elim_format, ...);
2630 * Isar/Provers: intro/elim/dest attributes changed; renamed
2631 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
2632 should have to change intro!! to intro? only); replaced "delrule" by
2635 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
2637 * Provers: strengthened force_tac by using new first_best_tac;
2639 * LaTeX document preparation: several changes of isabelle.sty (see
2643 *** Document preparation ***
2645 * formal comments (text blocks etc.) in new-style theories may now
2646 contain antiquotations of thm/prop/term/typ/text to be presented
2647 according to latex print mode; concrete syntax is like this:
2648 @{term[show_types] "f(x) = a + x"};
2650 * isatool mkdir provides easy setup of Isabelle session directories,
2651 including proper document sources;
2653 * generated LaTeX sources are now deleted after successful run
2654 (isatool document -c); may retain a copy somewhere else via -D option
2657 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
2658 style files, achieving self-contained LaTeX sources and simplifying
2661 * old-style theories now produce (crude) LaTeX output as well;
2663 * browser info session directories are now self-contained (may be put
2664 on WWW server seperately); improved graphs of nested sessions; removed
2665 graph for 'all sessions';
2667 * several improvements in isabelle style files; \isabellestyle{it}
2668 produces fake math mode output; \isamarkupheader is now \section by
2669 default; see lib/texinputs/isabelle.sty etc.;
2674 * Isar/Pure: local results and corresponding term bindings are now
2675 subject to Hindley-Milner polymorphism (similar to ML); this
2676 accommodates incremental type-inference very nicely;
2678 * Isar/Pure: new derived language element 'obtain' supports
2679 generalized existence reasoning;
2681 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
2682 support accumulation of results, without applying any rules yet;
2683 useful to collect intermediate results without explicit name
2684 references, and for use with transitivity rules with more than 2
2687 * Isar/Pure: scalable support for case-analysis type proofs: new
2688 'case' language element refers to local contexts symbolically, as
2689 produced by certain proof methods; internally, case names are attached
2690 to theorems as "tags";
2692 * Isar/Pure: theory command 'hide' removes declarations from
2693 class/type/const name spaces;
2695 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
2696 indicate potential overloading;
2698 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
2700 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
2701 "{a,b,c}" instead of {a,b,c};
2703 * Isar/Pure now provides its own version of intro/elim/dest
2704 attributes; useful for building new logics, but beware of confusion
2705 with the version in Provers/classical;
2707 * Isar/Pure: the local context of (non-atomic) goals is provided via
2708 case name 'antecedent';
2710 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
2711 to the current context is now done automatically);
2713 * Isar/Pure: theory command 'method_setup' provides a simple interface
2714 for definining proof methods in ML;
2716 * Isar/Provers: intro/elim/dest attributes changed; renamed
2717 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
2718 most cases, one should have to change intro!! to intro? only);
2719 replaced "delrule" by "rule del";
2721 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
2722 'symmetric' attribute (the latter supercedes [RS sym]);
2724 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
2725 method modifier); 'simp' method: 'only:' modifier removes loopers as
2726 well (including splits);
2728 * Isar/Provers: Simplifier and Classical methods now support all kind
2729 of modifiers used in the past, including 'cong', 'iff', etc.
2731 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
2732 of Simplifier and Classical reasoner);
2734 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
2735 now support named cases; major packages (inductive, datatype, primrec,
2736 recdef) support case names and properly name parameters;
2738 * Isar/HOL: new transitivity rules for substitution in inequalities --
2739 monotonicity conditions are extracted to be proven at end of
2742 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
2745 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
2746 split_if split_if_asm; datatype package provides theorems foo.splits =
2747 foo.split foo.split_asm for each datatype;
2749 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
2750 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
2751 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
2752 use "(cases (simplified))" method in proper proof texts);
2754 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
2756 * Isar: names of theorems etc. may be natural numbers as well;
2758 * Isar: 'pr' command: optional arguments for goals_limit and
2759 ProofContext.prems_limit; no longer prints theory contexts, but only
2762 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
2763 additional print modes to be specified; e.g. "pr(latex)" will print
2764 proof state according to the Isabelle LaTeX style;
2766 * Isar: improved support for emulating tactic scripts, including proof
2767 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
2768 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
2769 (for HOL datatypes);
2771 * Isar: simplified (more robust) goal selection of proof methods: 1st
2772 goal, all goals, or explicit goal specifier (tactic emulation); thus
2773 'proof method scripts' have to be in depth-first order;
2775 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
2777 * Isar: removed 'help' command, which hasn't been too helpful anyway;
2778 should instead use individual commands for printing items
2779 (print_commands, print_methods etc.);
2781 * Isar: added 'nothing' --- the empty list of theorems;
2786 * HOL/MicroJava: formalization of a fragment of Java, together with a
2787 corresponding virtual machine and a specification of its bytecode
2788 verifier and a lightweight bytecode verifier, including proofs of
2789 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
2790 Cornelia Pusch (see also the homepage of project Bali at
2791 http://isabelle.in.tum.de/Bali/);
2793 * HOL/Algebra: new theory of rings and univariate polynomials, by
2796 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
2797 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
2800 * HOL/Lattice: fundamental concepts of lattice theory and order
2801 structures, including duals, properties of bounds versus algebraic
2802 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
2803 Theorem for complete lattices etc.; may also serve as a demonstration
2804 for abstract algebraic reasoning using axiomatic type classes, and
2805 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
2807 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
2810 * HOL/IMPP: extension of IMP with local variables and mutually
2811 recursive procedures, by David von Oheimb;
2813 * HOL/Lambda: converted into new-style theory and document;
2815 * HOL/ex/Multiquote: example of multiple nested quotations and
2816 anti-quotations -- basically a generalized version of de-Bruijn
2817 representation; very useful in avoiding lifting of operations;
2819 * HOL/record: added general record equality rule to simpset; fixed
2820 select-update simplification procedure to handle extended records as
2821 well; admit "r" as field name;
2823 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
2824 other numeric types and also as the identity of groups, rings, etc.;
2826 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
2827 Types nat and int belong to this axclass;
2829 * HOL: greatly improved simplification involving numerals of type nat, int, real:
2830 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
2831 i*j + k + j*#3*i simplifies to #4*(i*j) + k
2832 two terms #m*u and #n*u are replaced by #(m+n)*u
2833 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
2834 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
2835 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
2837 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
2838 powerful prover for predicate logic but knows nothing of clasets; see
2839 ex/mesontest.ML and ex/mesontest2.ML for example applications;
2841 * HOL: new version of "case_tac" subsumes both boolean case split and
2842 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
2843 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
2845 * HOL: simplification no longer dives into case-expressions: only the
2846 selector expression is simplified, but not the remaining arms; to
2847 enable full simplification of case-expressions for datatype t, you may
2848 remove t.weak_case_cong from the simpset, either globally (Delcongs
2849 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
2851 * HOL/recdef: the recursion equations generated by 'recdef' for
2852 function 'f' are now called f.simps instead of f.rules; if all
2853 termination conditions are proved automatically, these simplification
2854 rules are added to the simpset, as in primrec; rules may be named
2855 individually as well, resulting in a separate list of theorems for
2858 * HOL/While is a new theory that provides a while-combinator. It
2859 permits the definition of tail-recursive functions without the
2860 provision of a termination measure. The latter is necessary once the
2861 invariant proof rule for while is applied.
2863 * HOL: new (overloaded) notation for the set of elements below/above
2864 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
2866 * HOL: theorems impI, allI, ballI bound as "strip";
2868 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
2869 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
2870 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
2872 * HOL/Real: "rabs" replaced by overloaded "abs" function;
2874 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
2875 main HOL, but was unused);
2877 * HOL: fewer consts declared as global (e.g. have to refer to
2878 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
2880 * HOL: tuned AST representation of nested pairs, avoiding bogus output
2881 in case of overlap with user translations (e.g. judgements over
2882 tuples); (note that the underlying logical represenation is still
2888 * ZF: simplification automatically cancels common terms in arithmetic
2889 expressions over nat and int;
2891 * ZF: new treatment of nat to minimize type-checking: all operators
2892 coerce their operands to a natural number using the function natify,
2893 making the algebraic laws unconditional;
2895 * ZF: as above, for int: operators coerce their operands to an integer
2896 using the function intify;
2898 * ZF: the integer library now contains many of the usual laws for the
2899 orderings, including $<=, and monotonicity laws for $+ and $*;
2901 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
2904 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
2905 to the simplifier and classical reasoner simultaneously;
2910 * Provers: blast_tac now handles actual object-logic rules as
2911 assumptions; note that auto_tac uses blast_tac internally as well;
2913 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
2914 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
2916 * Provers: delrules now handles destruct rules as well (no longer need
2917 explicit make_elim);
2919 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
2920 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
2921 use instead the strong form,
2922 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
2923 in HOL, FOL and ZF the function cla_make_elim will create such rules
2924 from destruct-rules;
2926 * Provers: Simplifier.easy_setup provides a fast path to basic
2927 Simplifier setup for new object-logics;
2929 * Pure: AST translation rules no longer require constant head on LHS;
2931 * Pure: improved name spaces: ambiguous output is qualified; support
2932 for hiding of names;
2934 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
2935 XSYMBOL_HOME; no longer need to do manual configuration in most
2938 * system: compression of ML heaps images may now be controlled via -c
2939 option of isabelle and isatool usedir (currently only observed by
2942 * system: isatool installfonts may handle X-Symbol fonts as well (very
2943 useful for remote X11);
2945 * system: provide TAGS file for Isabelle sources;
2947 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
2950 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
2951 timing flag supersedes proof_timing and Toplevel.trace;
2953 * ML: new combinators |>> and |>>> for incremental transformations
2954 with secondary results (e.g. certain theory extensions):
2956 * ML: PureThy.add_defs gets additional argument to indicate potential
2957 overloading (usually false);
2959 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
2964 New in Isabelle99 (October 1999)
2965 --------------------------------
2967 *** Overview of INCOMPATIBILITIES (see below for more details) ***
2969 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
2970 are no longer simplified. (This allows the simplifier to unfold recursive
2971 functional programs.) To restore the old behaviour, declare
2973 Delcongs [if_weak_cong];
2975 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
2978 * HOL: the predicate "inj" is now defined by translation to "inj_on";
2980 * HOL/datatype: mutual_induct_tac no longer exists --
2981 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
2983 * HOL/typedef: fixed type inference for representing set; type
2984 arguments now have to occur explicitly on the rhs as type constraints;
2986 * ZF: The con_defs part of an inductive definition may no longer refer
2987 to constants declared in the same theory;
2989 * HOL, ZF: the function mk_cases, generated by the inductive
2990 definition package, has lost an argument. To simplify its result, it
2991 uses the default simpset instead of a supplied list of theorems.
2993 * HOL/List: the constructors of type list are now Nil and Cons;
2995 * Simplifier: the type of the infix ML functions
2996 setSSolver addSSolver setSolver addSolver
2997 is now simpset * solver -> simpset where `solver' is a new abstract type
2998 for packaging solvers. A solver is created via
2999 mk_solver: string -> (thm list -> int -> tactic) -> solver
3000 where the string argument is only a comment.
3005 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
3006 decision procedure for linear arithmetic. Currently it is used for
3007 types `nat', `int', and `real' in HOL (see below); it can, should and
3008 will be instantiated for other types and logics as well.
3010 * The simplifier now accepts rewrite rules with flexible heads, eg
3011 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
3012 They are applied like any rule with a non-pattern lhs, i.e. by first-order
3018 * New Isabelle/Isar subsystem provides an alternative to traditional
3019 tactical theorem proving; together with the ProofGeneral/isar user
3020 interface it offers an interactive environment for developing human
3021 readable proof documents (Isar == Intelligible semi-automated
3022 reasoning); for further information see isatool doc isar-ref,
3023 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
3025 * improved and simplified presentation of theories: better HTML markup
3026 (including colors), graph views in several sizes; isatool usedir now
3027 provides a proper interface for user theories (via -P option); actual
3028 document preparation based on (PDF)LaTeX is available as well (for
3029 new-style theories only); see isatool doc system for more information;
3031 * native support for Proof General, both for classic Isabelle and
3034 * ML function thm_deps visualizes dependencies of theorems and lemmas,
3035 using the graph browser tool;
3037 * Isabelle manuals now also available as PDF;
3039 * theory loader rewritten from scratch (may not be fully
3040 bug-compatible); old loadpath variable has been replaced by show_path,
3041 add_path, del_path, reset_path functions; new operations such as
3042 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
3045 * improved isatool install: option -k creates KDE application icon,
3046 option -p DIR installs standalone binaries;
3048 * added ML_PLATFORM setting (useful for cross-platform installations);
3049 more robust handling of platform specific ML images for SML/NJ;
3051 * the settings environment is now statically scoped, i.e. it is never
3052 created again in sub-processes invoked from isabelle, isatool, or
3055 * path element specification '~~' refers to '$ISABELLE_HOME';
3057 * in locales, the "assumes" and "defines" parts may be omitted if
3060 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
3063 * new print_mode "HTML";
3065 * new flag show_tags controls display of tags of theorems (which are
3066 basically just comments that may be attached by some tools);
3068 * Isamode 2.6 requires patch to accomodate change of Isabelle font
3069 mode and goal output format:
3071 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
3073 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
3075 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
3076 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
3078 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
3080 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
3082 * function bind_thms stores lists of theorems (cf. bind_thm);
3084 * new shorthand tactics ftac, eatac, datac, fatac;
3086 * qed (and friends) now accept "" as result name; in that case the
3087 theorem is not stored, but proper checks and presentation of the
3090 * theorem database now also indexes constants "Trueprop", "all",
3091 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
3096 ** HOL arithmetic **
3098 * There are now decision procedures for linear arithmetic over nat and
3101 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
3102 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
3103 are treated as atomic; subformulae not involving type `nat' or `int'
3104 are ignored; quantified subformulae are ignored unless they are
3105 positive universal or negative existential. The tactic has to be
3106 invoked by hand and can be a little bit slow. In particular, the
3107 running time is exponential in the number of occurrences of `min' and
3108 `max', and `-' on `nat'.
3110 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
3111 (negated) (in)equalities among the premises and the conclusion into
3112 account (i.e. no compound formulae) and does not know about `min' and
3113 `max', and `-' on `nat'. It is fast and is used automatically by the
3116 NB: At the moment, these decision procedures do not cope with mixed
3117 nat/int formulae where the two parts interact, such as `m < n ==>
3120 * HOL/Numeral provides a generic theory of numerals (encoded
3121 efficiently as bit strings); setup for types nat/int/real is in place;
3122 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
3123 int, existing theories and proof scripts may require a few additional
3126 * integer division and remainder can now be performed on constant
3129 * many properties of integer multiplication, division and remainder
3132 * An interface to the Stanford Validity Checker (SVC) is available through the
3133 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
3134 are proved automatically. SVC must be installed separately, and its results
3135 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
3136 invocation of the underlying oracle). For SVC see
3137 http://verify.stanford.edu/SVC
3139 * IsaMakefile: the HOL-Real target now builds an actual image;
3144 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
3145 (in Isabelle/Isar) -- by Gertrud Bauer;
3147 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
3148 analysis for assembly languages with subtypes;
3150 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
3151 -- avoids syntactic ambiguities and treats state, transition, and
3152 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
3153 changed syntax and (many) tactics;
3155 * HOL/inductive: Now also handles more general introduction rules such
3156 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
3157 theorems are now maintained within the theory (maintained via the
3160 * HOL/datatype: Now also handles arbitrarily branching datatypes
3161 (using function types) such as
3163 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
3165 * HOL/record: record_simproc (part of the default simpset) takes care
3166 of selectors applied to updated records; record_split_tac is no longer
3167 part of the default claset; update_defs may now be removed from the
3168 simpset in many cases; COMPATIBILITY: old behavior achieved by
3170 claset_ref () := claset() addSWrapper record_split_wrapper;
3171 Delsimprocs [record_simproc]
3173 * HOL/typedef: fixed type inference for representing set; type
3174 arguments now have to occur explicitly on the rhs as type constraints;
3176 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
3177 names rather than an ML expression;
3179 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
3180 supplied later. Program schemes can be defined, such as
3181 "While B C s = (if B s then While B C (C s) else s)"
3182 where the well-founded relation can be chosen after B and C have been given.
3184 * HOL/List: the constructors of type list are now Nil and Cons;
3185 INCOMPATIBILITY: while [] and infix # syntax is still there, of
3186 course, ML tools referring to List.list.op # etc. have to be adapted;
3188 * HOL_quantifiers flag superseded by "HOL" print mode, which is
3189 disabled by default; run isabelle with option -m HOL to get back to
3190 the original Gordon/HOL-style output;
3192 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
3193 ALL x<=y. P, EX x<y. P, EX x<=y. P;
3195 * HOL basic syntax simplified (more orthogonal): all variants of
3196 All/Ex now support plain / symbolic / HOL notation; plain syntax for
3197 Eps operator is provided as well: "SOME x. P[x]";
3199 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
3201 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
3202 thus available for user theories;
3204 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
3205 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
3208 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
3209 several times and then mp;
3214 * the notation <<...>> is now available as a notation for sequences of
3217 * the simplifier is now installed
3219 * the axiom system has been generalized (thanks to Soren Heilmann)
3221 * the classical reasoner now has a default rule database
3226 * new primrec section allows primitive recursive functions to be given
3227 directly (as in HOL) over datatypes and the natural numbers;
3229 * new tactics induct_tac and exhaust_tac for induction (or case
3230 analysis) over datatypes and the natural numbers;
3232 * the datatype declaration of type T now defines the recursor T_rec;
3234 * simplification automatically does freeness reasoning for datatype
3237 * automatic type-inference, with AddTCs command to insert new
3238 type-checking rules;
3240 * datatype introduction rules are now added as Safe Introduction rules
3243 * the syntax "if P then x else y" is now available in addition to
3247 *** Internal programming interfaces ***
3249 * tuned simplifier trace output; new flag debug_simp;
3251 * structures Vartab / Termtab (instances of TableFun) offer efficient
3252 tables indexed by indexname_ord / term_ord (compatible with aconv);
3254 * AxClass.axclass_tac lost the theory argument;
3256 * tuned current_goals_markers semantics: begin / end goal avoids
3257 printing empty lines;
3259 * removed prs and prs_fn hook, which was broken because it did not
3260 include \n in its semantics, forcing writeln to add one
3261 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
3262 string -> unit if you really want to output text without newline;
3264 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
3265 plain output, interface builders may have to enable 'isabelle_font'
3266 mode to get Isabelle font glyphs as before;
3268 * refined token_translation interface; INCOMPATIBILITY: output length
3269 now of type real instead of int;
3271 * theory loader actions may be traced via new ThyInfo.add_hook
3272 interface (see src/Pure/Thy/thy_info.ML); example application: keep
3273 your own database of information attached to *whole* theories -- as
3274 opposed to intra-theory data slots offered via TheoryDataFun;
3276 * proper handling of dangling sort hypotheses (at last!);
3277 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
3278 extra sort hypotheses that can be witnessed from the type signature;
3279 the force_strip_shyps flag is gone, any remaining shyps are simply
3280 left in the theorem (with a warning issued by strip_shyps_warning);
3284 New in Isabelle98-1 (October 1998)
3285 ----------------------------------
3287 *** Overview of INCOMPATIBILITIES (see below for more details) ***
3289 * several changes of automated proof tools;
3291 * HOL: major changes to the inductive and datatype packages, including
3292 some minor incompatibilities of theory syntax;
3294 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
3297 * HOL: removed duplicate thms in Arith:
3298 less_imp_add_less should be replaced by trans_less_add1
3299 le_imp_add_le should be replaced by trans_le_add1
3301 * HOL: unary minus is now overloaded (new type constraints may be
3304 * HOL and ZF: unary minus for integers is now #- instead of #~. In
3305 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
3306 now taken as an integer constant.
3308 * Pure: ML function 'theory_of' renamed to 'theory';
3314 1. Asm_full_simp_tac is now more aggressive.
3315 1. It will sometimes reorient premises if that increases their power to
3317 2. It does no longer proceed strictly from left to right but may also
3318 rotate premises to achieve further simplification.
3319 For compatibility reasons there is now Asm_lr_simp_tac which is like the
3320 old Asm_full_simp_tac in that it does not rotate premises.
3321 2. The simplifier now knows a little bit about nat-arithmetic.
3323 * Classical reasoner: wrapper mechanism for the classical reasoner now
3324 allows for selected deletion of wrappers, by introduction of names for
3325 wrapper functionals. This implies that addbefore, addSbefore,
3326 addaltern, and addSaltern now take a pair (name, tactic) as argument,
3327 and that adding two tactics with the same name overwrites the first
3328 one (emitting a warning).
3329 type wrapper = (int -> tactic) -> (int -> tactic)
3330 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
3331 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
3332 delWrapper, delSWrapper: claset * string -> claset
3333 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
3335 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
3336 semantics; addbefore now affects only the unsafe part of step_tac
3337 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
3338 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
3341 * Classical reasoner: setwrapper to setWrapper and compwrapper to
3342 compWrapper; added safe wrapper (and access functions for it);
3344 * HOL/split_all_tac is now much faster and fails if there is nothing
3345 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
3346 and the names of the automatically generated variables have changed.
3347 split_all_tac has moved within claset() from unsafe wrappers to safe
3348 wrappers, which means that !!-bound variables are split much more
3349 aggressively, and safe_tac and clarify_tac now split such variables.
3350 If this splitting is not appropriate, use delSWrapper "split_all_tac".
3351 Note: the same holds for record_split_tac, which does the job of
3352 split_all_tac for record fields.
3354 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
3355 permanently to the default simpset using Addsplits just like
3356 Addsimps. They can be removed via Delsplits just like
3357 Delsimps. Lower-case versions are also available.
3359 * HOL/Simplifier: The rule split_if is now part of the default
3360 simpset. This means that the simplifier will eliminate all occurrences
3361 of if-then-else in the conclusion of a goal. To prevent this, you can
3362 either remove split_if completely from the default simpset by
3363 `Delsplits [split_if]' or remove it in a specific call of the
3364 simplifier using `... delsplits [split_if]'. You can also add/delete
3365 other case splitting rules to/from the default simpset: every datatype
3366 generates suitable rules `split_t_case' and `split_t_case_asm' (where
3367 t is the name of the datatype).
3369 * Classical reasoner / Simplifier combination: new force_tac (and
3370 derivatives Force_tac, force) combines rewriting and classical
3371 reasoning (and whatever other tools) similarly to auto_tac, but is
3372 aimed to solve the given subgoal completely.
3377 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
3378 and `goalw': the theory is no longer needed as an explicit argument -
3379 the current theory context is used; assumptions are no longer returned
3380 at the ML-level unless one of them starts with ==> or !!; it is
3381 recommended to convert to these new commands using isatool fixgoal
3382 (backup your sources first!);
3384 * new top-level commands 'thm' and 'thms' for retrieving theorems from
3385 the current theory context, and 'theory' to lookup stored theories;
3387 * new theory section 'locale' for declaring constants, assumptions and
3388 definitions that have local scope;
3390 * new theory section 'nonterminals' for purely syntactic types;
3392 * new theory section 'setup' for generic ML setup functions
3393 (e.g. package initialization);
3395 * the distribution now includes Isabelle icons: see
3396 lib/logo/isabelle-{small,tiny}.xpm;
3398 * isatool install - install binaries with absolute references to
3401 * isatool logo -- create instances of the Isabelle logo (as EPS);
3403 * print mode 'emacs' reserved for Isamode;
3405 * support multiple print (ast) translations per constant name;
3407 * theorems involving oracles are now printed with a suffixed [!];
3412 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
3414 * HOL/inductive package reorganized and improved: now supports mutual
3420 oddI "n : EVEN ==> Suc n : ODD"
3421 evenI "n : ODD ==> Suc n : EVEN"
3423 new theorem list "elims" contains an elimination rule for each of the
3424 recursive sets; inductive definitions now handle disjunctive premises
3425 correctly (also ZF);
3427 INCOMPATIBILITIES: requires Inductive as an ancestor; component
3428 "mutual_induct" no longer exists - the induction rule is always
3429 contained in "induct";
3432 * HOL/datatype package re-implemented and greatly improved: now
3433 supports mutually recursive datatypes such as
3436 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
3437 | SUM ('a aexp) ('a aexp)
3438 | DIFF ('a aexp) ('a aexp)
3441 'a bexp = LESS ('a aexp) ('a aexp)
3442 | AND ('a bexp) ('a bexp)
3443 | OR ('a bexp) ('a bexp)
3445 as well as indirectly recursive datatypes such as
3448 ('a, 'b) term = Var 'a
3449 | App 'b ((('a, 'b) term) list)
3451 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
3452 induction on mutually / indirectly recursive datatypes.
3454 Primrec equations are now stored in theory and can be accessed via
3455 <function_name>.simps.
3459 - Theories using datatypes must now have theory Datatype as an
3461 - The specific <typename>.induct_tac no longer exists - use the
3462 generic induct_tac instead.
3463 - natE has been renamed to nat.exhaust - use exhaust_tac
3464 instead of res_inst_tac ... natE. Note that the variable
3465 names in nat.exhaust differ from the names in natE, this
3466 may cause some "fragile" proofs to fail.
3467 - The theorems split_<typename>_case and split_<typename>_case_asm
3468 have been renamed to <typename>.split and <typename>.split_asm.
3469 - Since default sorts of type variables are now handled correctly,
3470 some datatype definitions may have to be annotated with explicit
3472 - Primrec definitions no longer require function name and type
3473 of recursive argument.
3475 Consider using isatool fixdatatype to adapt your theories and proof
3476 scripts to the new package (backup your sources first!).
3479 * HOL/record package: considerably improved implementation; now
3480 includes concrete syntax for record types, terms, updates; theorems
3481 for surjective pairing and splitting !!-bound record variables; proof
3482 support is as follows:
3484 1) standard conversions (selectors or updates applied to record
3485 constructor terms) are part of the standard simpset;
3487 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
3488 made part of standard simpset and claset via addIffs;
3490 3) a tactic for record field splitting (record_split_tac) is part of
3491 the standard claset (addSWrapper);
3493 To get a better idea about these rules you may retrieve them via
3494 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
3495 the name of your record type.
3497 The split tactic 3) conceptually simplifies by the following rule:
3499 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
3501 Thus any record variable that is bound by meta-all will automatically
3502 blow up into some record constructor term, consequently the
3503 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
3504 solve record problems automatically.
3507 * reorganized the main HOL image: HOL/Integ and String loaded by
3508 default; theory Main includes everything;
3510 * automatic simplification of integer sums and comparisons, using cancellation;
3512 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
3514 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
3516 * many new identities for unions, intersections, set difference, etc.;
3518 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
3519 called split_if, split_split, split_sum_case and split_nat_case (to go
3520 with add/delsplits);
3522 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
3523 (?x::unit) = (); this is made part of the default simpset, which COULD
3524 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
3525 'Delsimprocs [unit_eq_proc];' as last resort); also note that
3526 unit_abs_eta_conv is added in order to counter the effect of
3527 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
3530 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
3533 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
3534 It and 'sym RS equals0D' are now in the default claset, giving automatic
3535 disjointness reasoning but breaking a few old proofs.
3537 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
3538 to 'converse' from 'inverse' (for compatibility with ZF and some
3541 * HOL/recdef can now declare non-recursive functions, with {} supplied as
3542 the well-founded relation;
3544 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
3545 Compl A. The "Compl" syntax remains available as input syntax for this
3548 * HOL/Update: new theory of function updates:
3549 f(a:=b) == %x. if x=a then b else f x
3550 may also be iterated as in f(a:=b,c:=d,...);
3552 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
3555 - new function list_update written xs[i:=v] that updates the i-th
3556 list position. May also be iterated as in xs[i:=a,j:=b,...].
3557 - new function `upt' written [i..j(] which generates the list
3558 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
3559 bound write [i..j], which is a shorthand for [i..j+1(].
3560 - new lexicographic orderings and corresponding wellfoundedness theorems.
3563 - removed 'pred' (predecessor) function;
3564 - generalized some theorems about n-1;
3565 - many new laws about "div" and "mod";
3566 - new laws about greatest common divisors (see theory ex/Primes);
3568 * HOL/Relation: renamed the relational operator r^-1 "converse"
3569 instead of "inverse";
3571 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
3572 of the multiset ordering;
3574 * directory HOL/Real: a construction of the reals using Dedekind cuts
3575 (not included by default);
3577 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
3579 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
3580 programs, i.e. different program variables may have different types.
3582 * calling (stac rew i) now fails if "rew" has no effect on the goal
3583 [previously, this check worked only if the rewrite rule was unconditional]
3584 Now rew can involve either definitions or equalities (either == or =).
3589 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
3590 only the theorems proved on ZF.ML;
3592 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
3593 It and 'sym RS equals0D' are now in the default claset, giving automatic
3594 disjointness reasoning but breaking a few old proofs.
3596 * ZF/Update: new theory of function updates
3597 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
3598 may also be iterated as in f(a:=b,c:=d,...);
3600 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
3602 * calling (stac rew i) now fails if "rew" has no effect on the goal
3603 [previously, this check worked only if the rewrite rule was unconditional]
3604 Now rew can involve either definitions or equalities (either == or =).
3606 * case_tac provided for compatibility with HOL
3607 (like the old excluded_middle_tac, but with subgoals swapped)
3610 *** Internal programming interfaces ***
3612 * Pure: several new basic modules made available for general use, see
3613 also src/Pure/README;
3615 * improved the theory data mechanism to support encapsulation (data
3616 kind name replaced by private Object.kind, acting as authorization
3617 key); new type-safe user interface via functor TheoryDataFun; generic
3618 print_data function becomes basically useless;
3620 * removed global_names compatibility flag -- all theory declarations
3621 are qualified by default;
3623 * module Pure/Syntax now offers quote / antiquote translation
3624 functions (useful for Hoare logic etc. with implicit dependencies);
3625 see HOL/ex/Antiquote for an example use;
3627 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
3630 * new tactical CHANGED_GOAL for checking that a tactic modifies a
3633 * Display.print_goals function moved to Locale.print_goals;
3635 * standard print function for goals supports current_goals_markers
3636 variable for marking begin of proof, end of proof, start of goal; the
3637 default is ("", "", ""); setting current_goals_markers := ("<proof>",
3638 "</proof>", "<goal>") causes SGML like tagged proof state printing,
3643 New in Isabelle98 (January 1998)
3644 --------------------------------
3646 *** Overview of INCOMPATIBILITIES (see below for more details) ***
3648 * changed lexical syntax of terms / types: dots made part of long
3649 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
3651 * simpset (and claset) reference variable replaced by functions
3652 simpset / simpset_ref;
3654 * no longer supports theory aliases (via merge) and non-trivial
3655 implicit merge of thms' signatures;
3657 * most internal names of constants changed due to qualified names;
3659 * changed Pure/Sequence interface (see Pure/seq.ML);
3662 *** General Changes ***
3664 * hierachically structured name spaces (for consts, types, axms, thms
3665 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
3666 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
3667 isatool fixdots ensures space after dots (e.g. "%x. x"); set
3668 long_names for fully qualified output names; NOTE: ML programs
3669 (special tactics, packages etc.) referring to internal names may have
3670 to be adapted to cope with fully qualified names; in case of severe
3671 backward campatibility problems try setting 'global_names' at compile
3672 time to have enrything declared within a flat name space; one may also
3673 fine tune name declarations in theories via the 'global' and 'local'
3676 * reimplemented the implicit simpset and claset using the new anytype
3677 data filed in signatures; references simpset:simpset ref etc. are
3678 replaced by functions simpset:unit->simpset and
3679 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
3680 to patch your ML files accordingly;
3682 * HTML output now includes theory graph data for display with Java
3683 applet or isatool browser; data generated automatically via isatool
3684 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
3686 * defs may now be conditional; improved rewrite_goals_tac to handle
3687 conditional equations;
3689 * defs now admits additional type arguments, using TYPE('a) syntax;
3691 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
3692 creates a new theory node; implicit merge of thms' signatures is
3693 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
3694 transfer:theory->thm->thm in (rare) cases;
3696 * improved handling of draft signatures / theories; draft thms (and
3697 ctyps, cterms) are automatically promoted to real ones;
3699 * slightly changed interfaces for oracles: admit many per theory, named
3700 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
3702 * print_goals: optional output of const types (set show_consts and
3705 * improved output of warnings (###) and errors (***);
3707 * subgoal_tac displays a warning if the new subgoal has type variables;
3709 * removed old README and Makefiles;
3711 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
3713 * removed obsolete init_pps and init_database;
3715 * deleted the obsolete tactical STATE, which was declared by
3716 fun STATE tacfun st = tacfun st st;
3718 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
3719 (which abbreviates $HOME);
3721 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
3722 use isatool fixseq to adapt your ML programs (this works for fully
3723 qualified references to the Sequence structure only!);
3725 * use_thy no longer requires writable current directory; it always
3726 reloads .ML *and* .thy file, if either one is out of date;
3729 *** Classical Reasoner ***
3731 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
3732 tactics that use classical reasoning to simplify a subgoal without
3733 splitting it into several subgoals;
3735 * Safe_tac: like safe_tac but uses the default claset;
3740 * added simplification meta rules:
3741 (asm_)(full_)simplify: simpset -> thm -> thm;
3743 * simplifier.ML no longer part of Pure -- has to be loaded by object
3746 * added prems argument to simplification procedures;
3748 * HOL, FOL, ZF: added infix function `addsplits':
3749 instead of `<simpset> setloop (split_tac <thms>)'
3750 you can simply write `<simpset> addsplits <thms>'
3755 * TYPE('a) syntax for type reflection terms;
3757 * no longer handles consts with name "" -- declare as 'syntax' instead;
3759 * pretty printer: changed order of mixfix annotation preference (again!);
3761 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
3766 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
3767 with `addloop' of the simplifier to faciliate case splitting in premises.
3769 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
3771 * HOL/Auth: new protocol proofs including some for the Internet
3774 * HOL/Map: new theory of `maps' a la VDM;
3776 * HOL/simplifier: simplification procedures nat_cancel_sums for
3777 cancelling out common nat summands from =, <, <= (in)equalities, or
3778 differences; simplification procedures nat_cancel_factor for
3779 cancelling common factor from =, <, <= (in)equalities over natural
3780 sums; nat_cancel contains both kinds of procedures, it is installed by
3781 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
3783 * HOL/simplifier: terms of the form
3784 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
3786 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
3787 and those of the form
3788 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
3790 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
3793 Each datatype `t' now comes with a theorem `split_t_case' of the form
3795 P(t_case f1 ... fn x) =
3796 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
3798 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
3801 and a theorem `split_t_case_asm' of the form
3803 P(t_case f1 ... fn x) =
3804 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
3806 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
3808 which can be added to a simpset via `addsplits'. The existing theorems
3809 expand_list_case and expand_option_case have been renamed to
3810 split_list_case and split_option_case.
3813 - `pred n' is automatically converted to `n-1'.
3814 Users are strongly encouraged not to use `pred' any longer,
3815 because it will disappear altogether at some point.
3816 - Users are strongly encouraged to write "0 < n" rather than
3817 "n ~= 0". Theorems and proof tools have been modified towards this
3821 the function "set_of_list" has been renamed "set" (and its theorems too);
3822 the function "nth" now takes its arguments in the reverse order and
3823 has acquired the infix notation "!" as in "xs!n".
3825 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
3827 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
3828 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
3830 * HOL/record: extensible records with schematic structural subtyping
3831 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
3832 still lacks various theorems and concrete record syntax;
3837 * removed "axioms" and "generated by" sections;
3839 * replaced "ops" section by extended "consts" section, which is capable of
3840 handling the continuous function space "->" directly;
3843 . proves theorems immediately and stores them in the theory,
3844 . creates hierachical name space,
3845 . now uses normal mixfix annotations (instead of cinfix...),
3846 . minor changes to some names and values (for consistency),
3847 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
3848 . separator between mutual domain defs: changed "," to "and",
3849 . improved handling of sort constraints; now they have to
3850 appear on the left-hand side of the equations only;
3852 * fixed LAM <x,y,zs>.b syntax;
3854 * added extended adm_tac to simplifier in HOLCF -- can now discharge
3855 adm (%x. P (t x)), where P is chainfinite and t continuous;
3860 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
3861 with `addloop' of the simplifier to faciliate case splitting in premises.
3863 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
3864 in HOL, they strip ALL and --> from proved theorems;
3868 New in Isabelle94-8 (May 1997)
3869 ------------------------------
3871 *** General Changes ***
3873 * new utilities to build / run / maintain Isabelle etc. (in parts
3874 still somewhat experimental); old Makefiles etc. still functional;
3876 * new 'Isabelle System Manual';
3878 * INSTALL text, together with ./configure and ./build scripts;
3880 * reimplemented type inference for greater efficiency, better error
3881 messages and clean internal interface;
3883 * prlim command for dealing with lots of subgoals (an easier way of
3884 setting goals_limit);
3889 * supports alternative (named) syntax tables (parser and pretty
3890 printer); internal interface is provided by add_modesyntax(_i);
3892 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
3893 be used in conjunction with the Isabelle symbol font; uses the
3894 "symbols" syntax table;
3896 * added token_translation interface (may translate name tokens in
3897 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
3898 the current print_mode); IMPORTANT: user print translation functions
3899 are responsible for marking newly introduced bounds
3900 (Syntax.mark_boundT);
3902 * token translations for modes "xterm" and "xterm_color" that display
3903 names in bold, underline etc. or colors (which requires a color
3906 * infixes may now be declared with names independent of their syntax;
3908 * added typed_print_translation (like print_translation, but may
3909 access type of constant);
3912 *** Classical Reasoner ***
3914 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
3915 some limitations. Blast_tac...
3916 + ignores addss, addbefore, addafter; this restriction is intrinsic
3917 + ignores elimination rules that don't have the correct format
3918 (the conclusion MUST be a formula variable)
3919 + ignores types, which can make HOL proofs fail
3920 + rules must not require higher-order unification, e.g. apply_type in ZF
3921 [message "Function Var's argument not a bound variable" relates to this]
3922 + its proof strategy is more general but can actually be slower
3924 * substitution with equality assumptions no longer permutes other
3927 * minor changes in semantics of addafter (now called addaltern); renamed
3928 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
3929 (and access functions for it);
3931 * improved combination of classical reasoner and simplifier:
3932 + functions for handling clasimpsets
3933 + improvement of addss: now the simplifier is called _after_ the
3935 + safe variant of addss called addSss: uses safe simplifications
3936 _during_ the safe steps. It is more complete as it allows multiple
3937 instantiations of unknowns (e.g. with slow_tac).
3941 * added interface for simplification procedures (functions that
3942 produce *proven* rewrite rules on the fly, depending on current
3945 * ordering on terms as parameter (used for ordered rewriting);
3947 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
3949 * the solver is now split into a safe and an unsafe part.
3950 This should be invisible for the normal user, except that the
3951 functions setsolver and addsolver have been renamed to setSolver and
3952 addSolver; added safe_asm_full_simp_tac;
3957 * a generic induction tactic `induct_tac' which works for all datatypes and
3958 also for type `nat';
3960 * a generic case distinction tactic `exhaust_tac' which works for all
3961 datatypes and also for type `nat';
3963 * each datatype comes with a function `size';
3965 * patterns in case expressions allow tuple patterns as arguments to
3966 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
3968 * primrec now also works with type nat;
3970 * recdef: a new declaration form, allows general recursive functions to be
3971 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
3973 * the constant for negation has been renamed from "not" to "Not" to
3974 harmonize with FOL, ZF, LK, etc.;
3976 * HOL/ex/LFilter theory of a corecursive "filter" functional for
3979 * HOL/Modelcheck demonstrates invocation of model checker oracle;
3981 * HOL/ex/Ring.thy declares cring_simp, which solves equational
3982 problems in commutative rings, using axiomatic type classes for + and *;
3984 * more examples in HOL/MiniML and HOL/Auth;
3986 * more default rewrite rules for quantifiers, union/intersection;
3988 * a new constant `arbitrary == @x.False';
3990 * HOLCF/IOA replaces old HOL/IOA;
3992 * HOLCF changes: derived all rules and arities
3993 + axiomatic type classes instead of classes
3994 + typedef instead of faking type definitions
3995 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
3996 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
3997 + eliminated the types void, one, tr
3998 + use unit lift and bool lift (with translations) instead of one and tr
3999 + eliminated blift from Lift3.thy (use Def instead of blift)
4000 all eliminated rules are derived as theorems --> no visible changes ;
4005 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
4006 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
4007 as ZF_cs addSIs [equalityI];
4011 New in Isabelle94-7 (November 96)
4012 ---------------------------------
4014 * allowing negative levels (as offsets) in prlev and choplev;
4016 * super-linear speedup for large simplifications;
4018 * FOL, ZF and HOL now use miniscoping: rewriting pushes
4019 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
4020 FAIL); can suppress it using the command Delsimps (ex_simps @
4021 all_simps); De Morgan laws are also now included, by default;
4023 * improved printing of ==> : ~:
4025 * new object-logic "Sequents" adds linear logic, while replacing LK
4026 and Modal (thanks to Sara Kalvala);
4028 * HOL/Auth: correctness proofs for authentication protocols;
4030 * HOL: new auto_tac combines rewriting and classical reasoning (many
4031 examples on HOL/Auth);
4033 * HOL: new command AddIffs for declaring theorems of the form P=Q to
4034 the rewriter and classical reasoner simultaneously;
4036 * function uresult no longer returns theorems in "standard" format;
4037 regain previous version by: val uresult = standard o uresult;
4044 * oracles -- these establish an interface between Isabelle and trusted
4045 external reasoners, which may deliver results as theorems;
4047 * proof objects (in particular record all uses of oracles);
4049 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
4051 * "constdefs" section in theory files;
4053 * "primrec" section (HOL) no longer requires names;
4055 * internal type "tactic" now simply "thm -> thm Sequence.seq";
4062 * reduced space requirements;
4064 * automatic HTML generation from theories;
4066 * theory files no longer require "..." (quotes) around most types;
4068 * new examples, including two proofs of the Church-Rosser theorem;
4070 * non-curried (1994) version of HOL is no longer distributed;
4077 * greatly reduced space requirements;
4079 * theory files (.thy) no longer require \...\ escapes at line breaks;
4081 * searchable theorem database (see the section "Retrieving theorems" on
4082 page 8 of the Reference Manual);
4084 * new examples, including Grabczewski's monumental case study of the
4087 * The previous version of HOL renamed to Old_HOL;
4089 * The new version of HOL (previously called CHOL) uses a curried syntax
4090 for functions. Application looks like f a b instead of f(a,b);
4092 * Mutually recursive inductive definitions finally work in HOL;
4094 * In ZF, pattern-matching on tuples is now available in all abstractions and
4095 translates to the operator "split";
4102 * new infix operator, addss, allowing the classical reasoner to
4103 perform simplification at each step of its search. Example:
4104 fast_tac (cs addss ss)
4106 * a new logic, CHOL, the same as HOL, but with a curried syntax
4107 for functions. Application looks like f a b instead of f(a,b). Also pairs
4108 look like (a,b) instead of <a,b>;
4110 * PLEASE NOTE: CHOL will eventually replace HOL!
4112 * In CHOL, pattern-matching on tuples is now available in all abstractions.
4113 It translates to the operator "split". A new theory of integers is available;
4115 * In ZF, integer numerals now denote two's-complement binary integers.
4116 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
4118 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
4119 of the Axiom of Choice;
4126 * Significantly faster resolution;
4128 * the different sections in a .thy file can now be mixed and repeated
4131 * Database of theorems for FOL, HOL and ZF. New
4132 commands including qed, qed_goal and bind_thm store theorems in the database.
4134 * Simple database queries: return a named theorem (get_thm) or all theorems of
4135 a given theory (thms_of), or find out what theory a theorem was proved in
4138 * Bugs fixed in the inductive definition and datatype packages;
4140 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
4141 and HOL_dup_cs obsolete;
4143 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
4146 * Simpler definition of function space in ZF;
4148 * new results about cardinal and ordinal arithmetic in ZF;
4150 * 'subtype' facility in HOL for introducing new types as subsets of existing