1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Simplified main Isabelle executables, with less surprises on
10 case-insensitive file-systems (such as Mac OS).
12 - The main Isabelle tool wrapper is now called "isabelle" instead of
15 - The former "isabelle" alias for "isabelle-process" has been
16 removed (should rarely occur to regular users).
18 - The "Isabelle" alias for "isabelle-interface" has been removed.
20 Within scripts and make files, the Isabelle environment variables
21 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
22 respectively. (The latter are still available as legacy feature.)
24 Also note that user interfaces are now better wrapped as regular
25 Isabelle tools instead of using the special isabelle-interface wrapper
26 (which can be confusing if the interface is uninstalled or changed
27 otherwise). See "isabelle tty" and "isabelle emacs" for contemporary
30 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
31 purge installed copies of Isabelle executables and re-run "isabelle
32 install -p ...", or use symlinks.
34 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
35 old ~/isabelle, which was slightly non-standard and apt cause
36 surprises on case-insensitive file-systems.
38 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
39 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
40 care is required when using older releases of Isabelle. Note that
41 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
42 Isabelle distribution.
44 * The Isabelle System Manual (system) has been updated, with formally
45 checked references as hyperlinks.
47 * Generalized Isar history, with support for linear undo, direct state
50 * Recovered hiding of consts, which was accidentally broken in
51 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
52 makes c inaccessible; consider using ``hide (open) const c'' instead.
54 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
60 * Slightly more coherent Pure syntax, with updated documentation in
61 isar-ref manual. Removed locales meta_term_syntax and
62 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
63 INCOMPATIBILITY in rare situations.
65 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
66 hypotheses. Sorts required in the course of reasoning need to be
67 covered by the constraints in the initial statement, completed by the
68 type instance information of the background theory. Non-trivial sort
69 hypotheses, which rarely occur in practice, may be specified via
70 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
72 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
74 The result contains an implicit sort hypotheses as before --
75 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
78 * Changed defaults for unify configuration options:
80 unify_trace_bound = 50 (formerly 25)
81 unify_search_bound = 60 (formerly 30)
83 * Different bookkeeping for code equations:
84 a) On theory merge, the last set of code equations for a particular constant
85 is taken (in accordance with the policy applied by other parts of the
86 code generator framework).
87 b) Code equations stemming from explicit declarations (e.g. code attribute)
88 gain priority over default code equations stemming from definition, primrec,
92 * Global versions of theorems stemming from classes do not carry
93 a parameter prefix any longer. INCOMPATIBILITY.
95 * Dropped locale element "includes". This is a major INCOMPATIBILITY.
96 In existing theorem specifications replace the includes element by the
97 respective context elements of the included locale, omitting those that
98 are already present in the theorem specification. Multiple assume
99 elements of a locale should be replaced by a single one involving the
100 locale predicate. In the proof body, declarations (most notably
101 theorems) may be regained by interpreting the respective locales in the
102 proof context as required (command "interpret").
103 If using "includes" in replacement of a target solely because the
104 parameter types in the theorem are not as general as in the target,
105 consider declaring a new locale with additional type constraints on the
106 parameters (context element "constrains").
108 * Dropped "locale (open)". INCOMPATBILITY.
110 * Interpretation commands no longer attempt to simplify goal.
111 INCOMPATIBILITY: in rare situations the generated goal differs. Use
112 methods intro_locales and unfold_locales to clarify.
114 * Interpretation commands no longer accept interpretation attributes.
117 * Command 'instance': attached definitions no longer accepted.
118 INCOMPATIBILITY, use proper 'instantiation' target.
120 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
122 * The 'axiomatization' command now only works within a global theory
123 context. INCOMPATIBILITY.
126 *** Document preparation ***
128 * Antiquotation @{lemma} now imitates a regular terminal proof,
129 demanding keyword 'by' and supporting the full method expression
130 syntax just like the Isar command 'by'.
135 * If methods "eval" and "evaluation" encounter a structured proof state
136 with !!/==>, only the conclusion is evaluated to True (if possible),
137 avoiding strange error messages.
139 * Simplifier: simproc for let expressions now unfolds if bound variable
140 occurs at most one time in let expression body. INCOMPATIBILITY.
142 * New classes "top" and "bot" with corresponding operations "top" and "bot"
143 in theory Orderings; instantiation of class "complete_lattice" requires
144 instantiation of classes "top" and "bot". INCOMPATIBILITY.
146 * Changed definition lemma "less_fun_def" in order to provide an instance
147 for preorders on functions; use lemma "less_le" instead. INCOMPATIBILITY.
149 * Unified theorem tables for both code code generators. Thus
150 [code func] has disappeared and only [code] remains. INCOMPATIBILITY.
152 * Constants "undefined" and "default" replace "arbitrary". Usually
153 "undefined" is the right choice to replace "arbitrary", though logically
154 there is no difference. INCOMPATIBILITY.
156 * Generic ATP manager for Sledgehammer, based on ML threads instead of
157 Posix processes. Avoids potentially expensive forking of the ML
158 process. New thread-based implementation also works on non-Unix
159 platforms (Cygwin). Provers are no longer hardwired, but defined
160 within the theory via plain ML wrapper functions. Basic Sledgehammer
161 commands are covered in the isar-ref manual
163 * Wrapper scripts for remote SystemOnTPTP service allows to use
164 sledgehammer without local ATP installation (Vampire etc.). See also
165 ISABELLE_HOME/contrib/SystemOnTPTP and the VAMPIRE_HOME setting
166 variable. Other provers may be included via suitable ML wrappers, see
167 also src/HOL/ATP_Linkup.thy.
169 * Normalization by evaluation now allows non-leftlinear equations.
170 Declare with attribute [code nbe].
172 * Command "value" now integrates different evaluation
173 mechanisms. The result of the first successful evaluation mechanism
174 is printed. In square brackets a particular named evaluation
175 mechanisms may be specified (currently, [SML], [code] or [nbe]). See
176 further src/HOL/ex/Eval_Examples.thy.
178 * HOL/Orderings: class "wellorder" moved here, with explicit induction
179 rule "less_induct" as assumption. For instantiation of "wellorder" by
180 means of predicate "wf", use rule wf_wellorderI. INCOMPATIBILITY.
182 * HOL/Orderings: added class "preorder" as superclass of "order".
183 INCOMPATIBILITY: Instantiation proofs for order, linorder
184 etc. slightly changed. Some theorems named order_class.* now named
187 * HOL/Finite_Set: added a new fold combinator of type
188 ('a => 'b => 'b) => 'b => 'a set => 'b
189 Occasionally this is more convenient than the old fold combinator which is
190 now defined in terms of the new one and renamed to fold_image.
192 * HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been
193 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
194 dvd has been generalized to class comm_semiring_1. Likewise a bunch
195 of lemmas from Divides has been generalized from nat to class
196 semiring_div. INCOMPATIBILITY. This involves the following theorem
197 renames resulting from duplicate elimination:
199 dvd_def_mod ~> dvd_eq_mod_eq_0
200 zero_dvd_iff ~> dvd_0_left_iff
202 DIVISION_BY_ZERO_DIV ~> div_by_0
203 DIVISION_BY_ZERO_MOD ~> mod_by_0
204 mult_div ~> div_mult_self2_is_id
205 mult_mod ~> mod_mult_self2_is_0
207 * HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
208 zlcm (for int); carried together from various gcd/lcm developements in
209 the HOL Distribution. zgcd and zlcm replace former igcd and ilcm;
210 corresponding theorems renamed accordingly. INCOMPATIBILY. To
211 recover tupled syntax, use syntax declarations like:
213 hide (open) const gcd
214 abbreviation gcd where
215 "gcd == (%(a, b). GCD.gcd a b)"
217 GCD.gcd ("gcd '(_, _')")
219 (analogously for lcm, zgcd, zlcm).
221 * HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
223 * New ML antiquotation @{code}: takes constant as argument, generates
224 corresponding code in background and inserts name of the corresponding
225 resulting ML value/function/datatype constructor binding in place.
226 All occurrences of @{code} with a single ML block are generated
227 simultaneously. Provides a generic and safe interface for
228 instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy
229 example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious
230 application. In future you ought refrain from ad-hoc compiling
231 generated SML code on the ML toplevel. Note that (for technical
232 reasons) @{code} cannot refer to constants for which user-defined
233 serializations are set. Refer to the corresponding ML counterpart
234 directly in that cases.
236 * Integrated image HOL-Complex with HOL. Entry points Main.thy and
237 Complex_Main.thy remain as they are.
239 * New image HOL-Plain provides a minimal HOL with the most important
240 tools available (inductive, datatype, primrec, ...). By convention
241 the corresponding theory Plain should be ancestor of every further
242 (library) theory. Some library theories now have ancestor Plain
243 (instead of Main), thus theory Main occasionally has to be imported
246 * The metis method now fails in the usual manner, rather than raising
247 an exception, if it determines that it cannot prove the theorem.
249 * The metis method no longer fails because the theorem is too trivial
250 (contains the empty clause).
252 * Methods "case_tac" and "induct_tac" now refer to the very same rules
253 as the structured Isar versions "cases" and "induct", cf. the
254 corresponding "cases" and "induct" attributes. Mutual induction rules
255 are now presented as a list of individual projections
256 (e.g. foo_bar.inducts for types foo and bar); the old format with
257 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
258 rare situations a different rule is selected --- notably nested tuple
259 elimination instead of former prod.exhaust: use explicit (case_tac t
260 rule: prod.exhaust) here.
262 * Attributes "cases", "induct", "coinduct" support "del" option.
264 * Removed fact "case_split_thm", which duplicates "case_split".
266 * Command 'rep_datatype': instead of theorem names the command now
267 takes a list of terms denoting the constructors of the type to be
268 represented as datatype. The characteristic theorems have to be
269 proven. INCOMPATIBILITY. Also observe that the following theorems
270 have disappeared in favour of existing ones:
272 unit_induct ~> unit.induct
273 prod_induct ~> prod.induct
274 sum_induct ~> sum.induct
275 Suc_Suc_eq ~> nat.inject
276 Suc_not_Zero Zero_not_Suc ~> nat.distinct
278 * Library/Nat_Infinity: added addition, numeral syntax and more
279 instantiations for algebraic structures. Removed some duplicate
280 theorems. Changes in simp rules. INCOMPATIBILITY.
282 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
288 * New locales for orders and lattices where the equivalence relation
289 is not restricted to equality. INCOMPATIBILITY: all order and
290 lattice locales use a record structure with field eq for the
293 * New theory of factorial domains.
295 * Units_l_inv and Units_r_inv are now simprules by default.
296 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
297 and/or r_inv will now also require deletion of these lemmas.
299 * Renamed the following theorems. INCOMPATIBILITY.
302 least_carrier ~> least_closed
303 greatest_carrier ~> greatest_closed
304 greatest_Lower_above ~> greatest_Lower_below
305 one_zero ~> carrier_one_zero
306 one_not_zero ~> carrier_one_not_zero (collision with assumption)
311 * Created new image HOL-NSA, containing theories of nonstandard
312 analysis which were previously part of HOL-Complex. Entry point
313 Hyperreal.thy remains valid, but theories formerly using
314 Complex_Main.thy should now use new entry point Hypercomplex.thy.
319 * Proof of Zorn's Lemma for partial orders.
324 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
325 to 'a -> thm, while results are always tagged with an authentic oracle
326 name. The Isar command 'oracle' is now polymorphic, no argument type
327 is specified. INCOMPATIBILITY, need to simplify existing oracle code
328 accordingly. Note that extra performance may be gained by producing
329 the cterm carefully, avoiding slow Thm.cterm_of.
331 * ML bindings produced via Isar commands are stored within the Isar
332 context (theory or proof). Consequently, commands like 'use' and 'ML'
333 become thread-safe and work with undo as expected (concerning
334 top-level bindings, not side-effects on global references).
335 INCOMPATIBILITY, need to provide proper Isar context when invoking the
336 compiler at runtime; really global bindings need to be given outside a
337 theory. [Poly/ML 5.2 or later]
339 * Command 'ML_prf' is analogous to 'ML' but works within a proof
340 context. Top-level ML bindings are stored within the proof context in
341 a purely sequential fashion, disregarding the nested proof structure.
342 ML bindings introduced by 'ML_prf' are discarded at the end of the
343 proof. [Poly/ML 5.2 or later]
345 * Generic Toplevel.add_hook interface allows to analyze the result of
346 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
347 for theorem dependency output of transactions resulting in a new
350 * Name bindings in higher specification mechanisms (notably
351 LocalTheory.define, LocalTheory.note, and derived packages) are now
352 formalized as type Name.binding, replacing old bstring.
353 INCOMPATIBILITY, need to wrap strings via Name.binding function, see
354 also Name.name_of. Packages should pass name bindings given by the
355 user to underlying specification mechanisms; this enables precise
356 tracking of source positions, for example.
358 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
359 LocalTheory.note etc.) now refer to the *full* internal name, not the
360 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
362 * Rules and tactics that read instantiations (read_instantiate,
363 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
364 context, which is required for parsing and type-checking. Moreover,
365 the variables are specified as plain indexnames, not string encodings
366 thereof. INCOMPATIBILITY.
368 * Disposed old type and term read functions (Sign.read_def_typ,
369 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
370 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
371 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
372 Syntax.read_term_global etc.; see also OldGoals.read_term as last
373 resort for legacy applications.
375 * Antiquotations: block-structured compilation context indicated by
376 \<lbrace> ... \<rbrace>; additional antiquotation forms:
378 @{let ?pat = term} - term abbreviation (HO matching)
379 @{note name = fact} - fact abbreviation
380 @{thm fact} - singleton fact (with attributes)
381 @{thms fact} - general fact (with attributes)
382 @{lemma prop by method} - singleton goal
383 @{lemma prop by meth1 meth2} - singleton goal
384 @{lemma prop1 ... propN by method} - general goal
385 @{lemma prop1 ... propN by meth1 meth2} - general goal
386 @{lemma (open) ...} - open derivation
391 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
392 Poly/ML 5.2.1 or later.
394 * The Isabelle "emacs" tool provides a specific interface to invoke
395 Proof General / Emacs, with more explicit failure if that is not
396 installed (the old isabelle-interface script silently falls back on
397 isabelle-process). The PROOFGENERAL_HOME setting determines the
398 installation location of the Proof General distribution.
400 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
401 the Isabelle process into a JVM/Scala application. See
402 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
403 process wrapper has been discontinued.)
405 * Status messages (with exact source position information) are
406 emitted, if proper markup print mode is enabled. This allows
407 user-interface components to provide detailed feedback on internal
410 * Homegrown Isabelle font with unicode layout, see Isabelle/lib/fonts.
414 New in Isabelle2008 (June 2008)
415 -------------------------------
419 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
420 and updated, with formally checked references as hyperlinks.
422 * Theory loader: use_thy (and similar operations) no longer set the
423 implicit ML context, which was occasionally hard to predict and in
424 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
425 provides a proper context already.
427 * Theory loader: old-style ML proof scripts being *attached* to a thy
428 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
429 'use' within a theory file will do the job.
431 * Name space merge now observes canonical order, i.e. the second space
432 is inserted into the first one, while existing entries in the first
433 space take precedence. INCOMPATIBILITY in rare situations, may try to
436 * Syntax: symbol \<chi> is now considered a letter. Potential
437 INCOMPATIBILITY in identifier syntax etc.
439 * Outer syntax: string tokens no longer admit escaped white space,
440 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
441 white space without escapes.
443 * Outer syntax: string tokens may contain arbitrary character codes
444 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
450 * Context-dependent token translations. Default setup reverts locally
451 fixed variables, and adds hilite markup for undeclared frees.
453 * Unused theorems can be found using the new command 'unused_thms'.
454 There are three ways of invoking it:
457 Only finds unused theorems in the current theory.
459 (2) unused_thms thy_1 ... thy_n -
460 Finds unused theorems in the current theory and all of its ancestors,
461 excluding the theories thy_1 ... thy_n and all of their ancestors.
463 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
464 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
465 their ancestors, excluding the theories thy_1 ... thy_n and all of
468 In order to increase the readability of the list produced by
469 unused_thms, theorems that have been created by a particular instance
470 of a theory command such as 'inductive' or 'function' are considered
471 to belong to the same "group", meaning that if at least one theorem in
472 this group is used, the other theorems in the same group are no longer
473 reported as unused. Moreover, if all theorems in the group are
474 unused, only one theorem in the group is displayed.
476 Note that proof objects have to be switched on in order for
477 unused_thms to work properly (i.e. !proofs must be >= 1, which is
478 usually the case when using Proof General with the default settings).
480 * Authentic naming of facts disallows ad-hoc overwriting of previous
481 theorems within the same name space. INCOMPATIBILITY, need to remove
482 duplicate fact bindings, or even accidental fact duplications. Note
483 that tools may maintain dynamically scoped facts systematically, using
484 PureThy.add_thms_dynamic.
486 * Command 'hide' now allows to hide from "fact" name space as well.
488 * Eliminated destructive theorem database, simpset, claset, and
489 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
490 update of theories within ML code.
492 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
493 INCOMPATIBILITY, object-logics depending on former Pure require
494 additional setup PureThy.old_appl_syntax_setup; object-logics
495 depending on former CPure need to refer to Pure.
497 * Commands 'use' and 'ML' are now purely functional, operating on
498 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
499 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
502 * Command 'setup': discontinued implicit version with ML reference.
504 * Instantiation target allows for simultaneous specification of class
505 instance operations together with an instantiation proof.
506 Type-checking phase allows to refer to class operations uniformly.
507 See src/HOL/Complex/Complex.thy for an Isar example and
508 src/HOL/Library/Eval.thy for an ML example.
510 * Indexing of literal facts: be more serious about including only
511 facts from the visible specification/proof context, but not the
512 background context (locale etc.). Affects `prop` notation and method
513 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
516 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
517 "(open)" option, which used to expose internal bound variables to the
520 * Isar statements: removed obsolete case "rule_context".
521 INCOMPATIBILITY, better use explicit fixes/assumes.
523 * Locale proofs: default proof step now includes 'unfold_locales';
524 hence 'proof' without argument may be used to unfold locale
528 *** Document preparation ***
530 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
531 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
532 obsolete thumbpdf setup (contemporary PDF viewers do this on the
533 spot); renamed link color from "darkblue" to "linkcolor" (default
534 value unchanged, can be redefined via \definecolor); no longer sets
535 "a4paper" option (unnecessary or even intrusive).
537 * Antiquotation @{lemma A method} proves proposition A by the given
538 method (either a method name or a method name plus (optional) method
539 arguments in parentheses) and prints A just like @{prop A}.
544 * New primrec package. Specification syntax conforms in style to
545 definition/function/.... No separate induction rule is provided. The
546 "primrec" command distinguishes old-style and new-style specifications
547 by syntax. The former primrec package is now named OldPrimrecPackage.
548 When adjusting theories, beware: constants stemming from new-style
549 primrec specifications have authentic syntax.
551 * Metis prover is now an order of magnitude faster, and also works
554 * Metis: the maximum number of clauses that can be produced from a
555 theorem is now given by the attribute max_clauses. Theorems that
556 exceed this number are ignored, with a warning printed.
558 * Sledgehammer no longer produces structured proofs by default. To
559 enable, declare [[sledgehammer_full = true]]. Attributes
560 reconstruction_modulus, reconstruction_sorts renamed
561 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
563 * Method "induct_scheme" derives user-specified induction rules
564 from well-founded induction and completeness of patterns. This factors
565 out some operations that are done internally by the function package
566 and makes them available separately. See
567 src/HOL/ex/Induction_Scheme.thy for examples.
569 * More flexible generation of measure functions for termination
570 proofs: Measure functions can be declared by proving a rule of the
571 form "is_measure f" and giving it the [measure_function] attribute.
572 The "is_measure" predicate is logically meaningless (always true), and
573 just guides the heuristic. To find suitable measure functions, the
574 termination prover sets up the goal "is_measure ?f" of the appropriate
575 type and generates all solutions by prolog-style backwards proof using
578 This setup also deals with rules like
580 "is_measure f ==> is_measure (list_size f)"
582 which accommodates nested datatypes that recurse through lists.
583 Similar rules are predeclared for products and option types.
585 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
589 - Definitions of overloaded constants on sets have to be replaced by
590 definitions on => and bool.
592 - Some definitions of overloaded operators on sets can now be proved
593 using the definitions of the operators on => and bool. Therefore,
594 the following theorems have been renamed:
596 subset_def -> subset_eq
597 psubset_def -> psubset_eq
598 set_diff_def -> set_diff_eq
599 Compl_def -> Compl_eq
600 Sup_set_def -> Sup_set_eq
601 Inf_set_def -> Inf_set_eq
602 sup_set_def -> sup_set_eq
603 inf_set_def -> inf_set_eq
605 - Due to the incompleteness of the HO unification algorithm, some
606 rules such as subst may require manual instantiation, if some of
607 the unknowns in the rule is a set.
609 - Higher order unification and forward proofs:
612 have "P (S::'a set)" <...>
613 then have "EX S. P S" ..
615 no longer works (due to the incompleteness of the HO unification
616 algorithm) and must be replaced by the pattern
623 - Calculational reasoning with subst (or similar rules):
626 have "P (S::'a set)" <...>
627 also have "S = T" <...>
630 no longer works (for similar reasons as the previous example) and
631 must be replaced by something like
633 have "P (S::'a set)" <...>
634 moreover have "S = T" <...>
635 ultimately have "P T" by simp
637 - Tactics or packages written in ML code:
638 Code performing pattern matching on types via
640 Type ("set", [T]) => ...
642 must be rewritten. Moreover, functions like strip_type or
643 binder_types no longer return the right value when applied to a
646 T1 => ... => Tn => U => bool
650 T1 => ... => Tn => U set
652 * Merged theories Wellfounded_Recursion, Accessible_Part and
653 Wellfounded_Relations to theory Wellfounded.
655 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
657 * Class finite no longer treats UNIV as class parameter. Use class
658 enum from theory Library/Enum instead to achieve a similar effect.
661 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
662 and "Cons". INCOMPATIBILITY.
664 * HOL (and FOL): renamed variables in rules imp_elim and swap.
665 Potential INCOMPATIBILITY.
667 * Theory Product_Type: duplicated lemmas split_Pair_apply and
668 injective_fst_snd removed, use split_eta and prod_eqI instead.
669 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
671 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
672 the same name in theory Orderings:
682 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
683 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
684 and different variable names.
686 * Library/Option_ord.thy: Canonical order on option type.
688 * Library/RBT.thy: Red-black trees, an efficient implementation of
691 * Library/Countable.thy: Type class for countable types.
693 * Theory Int: The representation of numerals has changed. The infix
694 operator BIT and the bit datatype with constructors B0 and B1 have
695 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
696 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
697 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
700 * Theory Nat: definition of <= and < on natural numbers no longer
701 depend on well-founded relations. INCOMPATIBILITY. Definitions
702 le_def and less_def have disappeared. Consider lemmas not_less
703 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
705 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
706 (whose purpose mainly is for various fold_set functionals) have been
707 abandoned in favor of the existing algebraic classes
708 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
709 lower_semilattice (resp. upper_semilattice) and linorder.
712 * Theory Transitive_Closure: induct and cases rules now declare proper
713 case_names ("base" and "step"). INCOMPATIBILITY.
715 * Theorem Inductive.lfp_ordinal_induct generalized to complete
716 lattices. The form set-specific version is available as
717 Inductive.lfp_ordinal_induct_set.
719 * Renamed theorems "power.simps" to "power_int.simps".
722 * Class semiring_div provides basic abstract properties of semirings
723 with division and modulo operations. Subsumes former class dvd_mod.
725 * Merged theories IntDef, Numeral and IntArith into unified theory
726 Int. INCOMPATIBILITY.
728 * Theory Library/Code_Index: type "index" now represents natural
729 numbers rather than integers. INCOMPATIBILITY.
731 * New class "uminus" with operation "uminus" (split of from class
732 "minus" which now only has operation "minus", binary).
735 * Constants "card", "internal_split", "option_map" now with authentic
736 syntax. INCOMPATIBILITY.
738 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
739 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
740 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
741 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
742 Sup_set_def, le_def, less_def, option_map_def now with object
743 equality. INCOMPATIBILITY.
745 * Records. Removed K_record, and replaced it by pure lambda term
746 %x. c. The simplifier setup is now more robust against eta expansion.
747 INCOMPATIBILITY: in cases explicitly referring to K_record.
749 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
751 * Library/ListVector: new theory of arithmetic vector operations.
753 * Library/Order_Relation: new theory of various orderings as sets of
754 pairs. Defines preorders, partial orders, linear orders and
755 well-orders on sets and on types.
760 * Renamed some theories to allow to loading both ZF and HOL in the
763 Datatype -> Datatype_ZF
764 Inductive -> Inductive_ZF
771 INCOMPATIBILITY: ZF theories that import individual theories below
772 Main might need to be adapted. Regular theory Main is still
773 available, as trivial extension of Main_ZF.
778 * ML within Isar: antiquotation @{const name} or @{const
779 name(typargs)} produces statically-checked Const term.
781 * Functor NamedThmsFun: data is available to the user as dynamic fact
782 (of the same name). Removed obsolete print command.
784 * Removed obsolete "use_legacy_bindings" function.
786 * The ``print mode'' is now a thread-local value derived from a global
787 template (the former print_mode reference), thus access becomes
788 non-critical. The global print_mode reference is for session
789 management only; user-code should use print_mode_value,
790 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
792 * Functions system/system_out provide a robust way to invoke external
793 shell commands, with propagation of interrupts (requires Poly/ML 5.2).
794 Do not use OS.Process.system etc. from the basis library!
799 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
800 in accordance with Proof General 3.7, which prefers GNU emacs.
802 * isatool tty runs Isabelle process with plain tty interaction;
803 optional line editor may be specified via ISABELLE_LINE_EDITOR
804 setting, the default settings attempt to locate "ledit" and "rlwrap".
806 * isatool browser now works with Cygwin as well, using general
807 "javapath" function defined in Isabelle process environment.
809 * YXML notation provides a simple and efficient alternative to
810 standard XML transfer syntax. See src/Pure/General/yxml.ML and
811 isatool yxml as described in the Isabelle system manual.
813 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
814 provides general wrapper for managing an Isabelle process in a robust
815 fashion, with ``cooked'' output from stdin/stderr.
817 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
818 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
820 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
821 way of changing the user's settings is via
822 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
825 * Multithreading.max_threads := 0 refers to the number of actual CPU
826 cores of the underlying machine, which is a good starting point for
827 optimal performance tuning. The corresponding usedir option -M allows
828 "max" as an alias for "0". WARNING: does not work on certain versions
829 of Mac OS (with Poly/ML 5.1).
831 * isabelle-process: non-ML sessions are run with "nice", to reduce the
832 adverse effect of Isabelle flooding interactive front-ends (notably
833 ProofGeneral / XEmacs).
837 New in Isabelle2007 (November 2007)
838 -----------------------------------
842 * More uniform information about legacy features, notably a
843 warning/error of "Legacy feature: ...", depending on the state of the
844 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
845 legacy features will disappear eventually.
847 * Theory syntax: the header format ``theory A = B + C:'' has been
848 discontinued in favour of ``theory A imports B C begin''. Use isatool
849 fixheaders to convert existing theory files. INCOMPATIBILITY.
851 * Theory syntax: the old non-Isar theory file format has been
852 discontinued altogether. Note that ML proof scripts may still be used
853 with Isar theories; migration is usually quite simple with the ML
854 function use_legacy_bindings. INCOMPATIBILITY.
856 * Theory syntax: some popular names (e.g. 'class', 'declaration',
857 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
860 * Theory loader: be more serious about observing the static theory
861 header specifications (including optional directories), but not the
862 accidental file locations of previously successful loads. The strict
863 update policy of former update_thy is now already performed by
864 use_thy, so the former has been removed; use_thys updates several
865 theories simultaneously, just as 'imports' within a theory header
866 specification, but without merging the results. Potential
867 INCOMPATIBILITY: may need to refine theory headers and commands
868 ROOT.ML which depend on load order.
870 * Theory loader: optional support for content-based file
871 identification, instead of the traditional scheme of full physical
872 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
873 (cf. the system manual). The new scheme allows to work with
874 non-finished theories in persistent session images, such that source
875 files may be moved later on without requiring reloads.
877 * Theory loader: old-style ML proof scripts being *attached* to a thy
878 file (with the same base name as the theory) are considered a legacy
879 feature, which will disappear eventually. Even now, the theory loader
880 no longer maintains dependencies on such files.
882 * Syntax: the scope for resolving ambiguities via type-inference is
883 now limited to individual terms, instead of whole simultaneous
884 specifications as before. This greatly reduces the complexity of the
885 syntax module and improves flexibility by separating parsing and
886 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
887 'fixes' etc.) are required in rare situations.
889 * Syntax: constants introduced by new-style packages ('definition',
890 'abbreviation' etc.) are passed through the syntax module in
891 ``authentic mode''. This means that associated mixfix annotations
892 really stick to such constants, independently of potential name space
893 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
894 trees are represented slightly differently, may need to adapt syntax
895 translations accordingly. Use CONST marker in 'translations' and
896 @{const_syntax} antiquotation in 'parse_translation' etc.
898 * Legacy goal package: reduced interface to the bare minimum required
899 to keep existing proof scripts running. Most other user-level
900 functions are now part of the OldGoals structure, which is *not* open
901 by default (consider isatool expandshort before open OldGoals).
902 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
903 these tend to cause confusion about the actual goal (!) context being
904 used here, which is not necessarily the same as the_context().
906 * Command 'find_theorems': supports "*" wild-card in "name:"
907 criterion; "with_dups" option. Certain ProofGeneral versions might
908 support a specific search form (see ProofGeneral/CHANGES).
910 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
911 by default, which means that "prems" (and also "fixed variables") are
912 suppressed from proof state output. Note that the ProofGeneral
913 settings mechanism allows to change and save options persistently, but
914 older versions of Isabelle will fail to start up if a negative prems
917 * Local theory targets may be specified by non-nested blocks of
918 ``context/locale/class ... begin'' followed by ``end''. The body may
919 contain definitions, theorems etc., including any derived mechanism
920 that has been implemented on top of these primitives. This concept
921 generalizes the existing ``theorem (in ...)'' towards more versatility
924 * Proof General interface: proper undo of final 'end' command;
925 discontinued Isabelle/classic mode (ML proof scripts).
928 *** Document preparation ***
930 * Added antiquotation @{theory name} which prints the given name,
931 after checking that it refers to a valid ancestor theory in the
934 * Added antiquotations @{ML_type text} and @{ML_struct text} which
935 check the given source text as ML type/structure, printing verbatim.
937 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
938 "c args == rhs" given in the current context. (Any number of
939 arguments may be given on the LHS.)
944 * The 'class' package offers a combination of axclass and locale to
945 achieve Haskell-like type classes in Isabelle. Definitions and
946 theorems within a class context produce both relative results (with
947 implicit parameters according to the locale context), and polymorphic
948 constants with qualified polymorphism (according to the class
949 context). Within the body context of a 'class' target, a separate
950 syntax layer ("user space type system") takes care of converting
951 between global polymorphic consts and internal locale representation.
952 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
953 "isatool doc classes" provides a tutorial.
955 * Generic code generator framework allows to generate executable
956 code for ML and Haskell (including Isabelle classes). A short usage
959 internal compilation:
960 export_code <list of constants (term syntax)> in SML
961 writing SML code to a file:
962 export_code <list of constants (term syntax)> in SML <filename>
963 writing OCaml code to a file:
964 export_code <list of constants (term syntax)> in OCaml <filename>
965 writing Haskell code to a bunch of files:
966 export_code <list of constants (term syntax)> in Haskell <filename>
968 evaluating closed propositions to True/False using code generation:
971 Reasonable default setup of framework in HOL.
973 Theorem attributs for selecting and transforming function equations theorems:
975 [code fun]: select a theorem as function equation for a specific constant
976 [code fun del]: deselect a theorem as function equation for a specific constant
977 [code inline]: select an equation theorem for unfolding (inlining) in place
978 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
980 User-defined serializations (target in {SML, OCaml, Haskell}):
982 code_const <and-list of constants (term syntax)>
983 {(target) <and-list of const target syntax>}+
985 code_type <and-list of type constructors>
986 {(target) <and-list of type target syntax>}+
988 code_instance <and-list of instances>
990 where instance ::= <type constructor> :: <class>
992 code_class <and_list of classes>
993 {(target) <and-list of class target syntax>}+
994 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
996 code_instance and code_class only are effective to target Haskell.
998 For example usage see src/HOL/ex/Codegenerator.thy and
999 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
1000 generation from Isabelle/HOL theories is available via "isatool doc
1003 * Code generator: consts in 'consts_code' Isar commands are now
1004 referred to by usual term syntax (including optional type
1007 * Command 'no_translations' removes translation rules from theory
1010 * Overloaded definitions are now actually checked for acyclic
1011 dependencies. The overloading scheme is slightly more general than
1012 that of Haskell98, although Isabelle does not demand an exact
1013 correspondence to type class and instance declarations.
1014 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
1015 exotic versions of overloading -- at the discretion of the user!
1017 Polymorphic constants are represented via type arguments, i.e. the
1018 instantiation that matches an instance against the most general
1019 declaration given in the signature. For example, with the declaration
1020 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
1021 as c(nat). Overloading is essentially simultaneous structural
1022 recursion over such type arguments. Incomplete specification patterns
1023 impose global constraints on all occurrences, e.g. c('a * 'a) on the
1024 LHS means that more general c('a * 'b) will be disallowed on any RHS.
1025 Command 'print_theory' outputs the normalized system of recursive
1026 equations, see section "definitions".
1028 * Configuration options are maintained within the theory or proof
1029 context (with name and type bool/int/string), providing a very simple
1030 interface to a poor-man's version of general context data. Tools may
1031 declare options in ML (e.g. using Attrib.config_int) and then refer to
1032 these values using Config.get etc. Users may change options via an
1033 associated attribute of the same name. This form of context
1034 declaration works particularly well with commands 'declare' or
1035 'using', for example ``declare [[foo = 42]]''. Thus it has become
1036 very easy to avoid global references, which would not observe Isar
1037 toplevel undo/redo and fail to work with multithreading.
1039 Various global ML references of Pure and HOL have been turned into
1040 configuration options:
1042 Unify.search_bound unify_search_bound
1043 Unify.trace_bound unify_trace_bound
1044 Unify.trace_simp unify_trace_simp
1045 Unify.trace_types unify_trace_types
1046 Simplifier.simp_depth_limit simp_depth_limit
1047 Blast.depth_limit blast_depth_limit
1048 DatatypeProp.dtK datatype_distinctness_limit
1049 fast_arith_neq_limit fast_arith_neq_limit
1050 fast_arith_split_limit fast_arith_split_limit
1052 * Named collections of theorems may be easily installed as context
1053 data using the functor NamedThmsFun (see also
1054 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
1055 attributes; there is also a toplevel print command. This facility is
1056 just a common case of general context data, which is the preferred way
1057 for anything more complex than just a list of facts in canonical
1060 * Isar: command 'declaration' augments a local theory by generic
1061 declaration functions written in ML. This enables arbitrary content
1062 being added to the context, depending on a morphism that tells the
1063 difference of the original declaration context wrt. the application
1064 context encountered later on.
1066 * Isar: proper interfaces for simplification procedures. Command
1067 'simproc_setup' declares named simprocs (with match patterns, and body
1068 text in ML). Attribute "simproc" adds/deletes simprocs in the current
1069 context. ML antiquotation @{simproc name} retrieves named simprocs.
1071 * Isar: an extra pair of brackets around attribute declarations
1072 abbreviates a theorem reference involving an internal dummy fact,
1073 which will be ignored later --- only the effect of the attribute on
1074 the background context will persist. This form of in-place
1075 declarations is particularly useful with commands like 'declare' and
1076 'using', for example ``have A using [[simproc a]] by simp''.
1078 * Isar: method "assumption" (and implicit closing of subproofs) now
1079 takes simple non-atomic goal assumptions into account: after applying
1080 an assumption as a rule the resulting subgoals are solved by atomic
1081 assumption steps. This is particularly useful to finish 'obtain'
1082 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
1083 without referring to the original premise "!!x. P x ==> thesis" in the
1084 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
1087 * Isar: implicit use of prems from the Isar proof context is
1088 considered a legacy feature. Common applications like ``have A .''
1089 may be replaced by ``have A by fact'' or ``note `A`''. In general,
1090 referencing facts explicitly here improves readability and
1091 maintainability of proof texts.
1093 * Isar: improper proof element 'guess' is like 'obtain', but derives
1094 the obtained context from the course of reasoning! For example:
1096 assume "EX x y. A x & B y" -- "any previous fact"
1097 then guess x and y by clarify
1099 This technique is potentially adventurous, depending on the facts and
1100 proof tools being involved here.
1102 * Isar: known facts from the proof context may be specified as literal
1103 propositions, using ASCII back-quote syntax. This works wherever
1104 named facts used to be allowed so far, in proof commands, proof
1105 methods, attributes etc. Literal facts are retrieved from the context
1106 according to unification of type and term parameters. For example,
1107 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
1108 theorems in the current context, then these are valid literal facts:
1109 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
1111 There is also a proof method "fact" which does the same composition
1112 for explicit goal states, e.g. the following proof texts coincide with
1113 certain special cases of literal facts:
1115 have "A" by fact == note `A`
1116 have "A ==> B" by fact == note `A ==> B`
1117 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
1118 have "P a ==> Q a" by fact == note `P a ==> Q a`
1120 * Isar: ":" (colon) is no longer a symbolic identifier character in
1121 outer syntax. Thus symbolic identifiers may be used without
1122 additional white space in declarations like this: ``assume *: A''.
1124 * Isar: 'print_facts' prints all local facts of the current context,
1125 both named and unnamed ones.
1127 * Isar: 'def' now admits simultaneous definitions, e.g.:
1129 def x == "t" and y == "u"
1131 * Isar: added command 'unfolding', which is structurally similar to
1132 'using', but affects both the goal state and facts by unfolding given
1133 rewrite rules. Thus many occurrences of the 'unfold' method or
1134 'unfolded' attribute may be replaced by first-class proof text.
1136 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
1137 and command 'unfolding' now all support object-level equalities
1138 (potentially conditional). The underlying notion of rewrite rule is
1139 analogous to the 'rule_format' attribute, but *not* that of the
1140 Simplifier (which is usually more generous).
1142 * Isar: the new attribute [rotated n] (default n = 1) rotates the
1143 premises of a theorem by n. Useful in conjunction with drule.
1145 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
1146 method expression within a sandbox consisting of the first N
1147 sub-goals, which need to exist. For example, ``simp_all [3]''
1148 simplifies the first three sub-goals, while (rule foo, simp_all)[]
1149 simplifies all new goals that emerge from applying rule foo to the
1150 originally first one.
1152 * Isar: schematic goals are no longer restricted to higher-order
1153 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
1156 * Isar: the conclusion of a long theorem statement is now either
1157 'shows' (a simultaneous conjunction, as before), or 'obtains'
1158 (essentially a disjunction of cases with local parameters and
1159 assumptions). The latter allows to express general elimination rules
1160 adequately; in this notation common elimination rules look like this:
1162 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
1164 obtains x where "P x"
1166 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
1170 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
1176 The subsequent classical rules even refer to the formal "thesis"
1179 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
1182 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
1183 obtains "thesis ==> something"
1185 The actual proof of an 'obtains' statement is analogous to that of the
1186 Isar proof element 'obtain', only that there may be several cases.
1187 Optional case names may be specified in parentheses; these will be
1188 available both in the present proof and as annotations in the
1189 resulting rule, for later use with the 'cases' method (cf. attribute
1192 * Isar: the assumptions of a long theorem statement are available as
1193 "assms" fact in the proof context. This is more appropriate than the
1194 (historical) "prems", which refers to all assumptions of the current
1195 context, including those from the target locale, proof body etc.
1197 * Isar: 'print_statement' prints theorems from the current theory or
1198 proof context in long statement form, according to the syntax of a
1201 * Isar: 'obtain' takes an optional case name for the local context
1202 introduction rule (default "that").
1204 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
1205 explicit (is "_ ==> ?foo") in the rare cases where this still happens
1208 * Pure: syntax "CONST name" produces a fully internalized constant
1209 according to the current context. This is particularly useful for
1210 syntax translations that should refer to internal constant
1211 representations independently of name spaces.
1213 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
1214 instead of "FOO ". This allows multiple binder declarations to coexist
1215 in the same context. INCOMPATIBILITY.
1217 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
1218 primitive that also works in a locale context (both for constants and
1219 fixed variables). Type declaration and internal syntactic representation
1220 of given constants retrieved from the context. Likewise, the
1221 'no_notation' command allows to remove given syntax annotations from the
1224 * Isar/locales: new derived specification elements 'axiomatization',
1225 'definition', 'abbreviation', which support type-inference, admit
1226 object-level specifications (equality, equivalence). See also the
1227 isar-ref manual. Examples:
1230 eq (infix "===" 50) where
1231 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
1233 definition "f x y = x + y + 1"
1234 definition g where "g x = f x x"
1237 neq (infix "=!=" 50) where
1238 "x =!= y == ~ (x === y)"
1240 These specifications may be also used in a locale context. Then the
1241 constants being introduced depend on certain fixed parameters, and the
1242 constant name is qualified by the locale base name. An internal
1243 abbreviation takes care for convenient input and output, making the
1244 parameters implicit and using the original short name. See also
1245 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
1246 entities from a monomorphic theory.
1248 Presently, abbreviations are only available 'in' a target locale, but
1249 not inherited by general import expressions. Also note that
1250 'abbreviation' may be used as a type-safe replacement for 'syntax' +
1251 'translations' in common applications. The "no_abbrevs" print mode
1252 prevents folding of abbreviations in term output.
1254 Concrete syntax is attached to specified constants in internal form,
1255 independently of name spaces. The parse tree representation is
1256 slightly different -- use 'notation' instead of raw 'syntax', and
1257 'translations' with explicit "CONST" markup to accommodate this.
1259 * Pure/Isar: unified syntax for new-style specification mechanisms
1260 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
1261 full type inference and dummy patterns ("_"). For example:
1263 definition "K x _ = x"
1265 inductive conj for A B
1266 where "A ==> B ==> conj A B"
1268 * Pure: command 'print_abbrevs' prints all constant abbreviations of
1269 the current context. Print mode "no_abbrevs" prevents inversion of
1270 abbreviations on output.
1272 * Isar/locales: improved parameter handling: use of locales "var" and
1273 "struct" no longer necessary; - parameter renamings are no longer
1274 required to be injective. For example, this allows to define
1275 endomorphisms as locale endom = homom mult mult h.
1277 * Isar/locales: changed the way locales with predicates are defined.
1278 Instead of accumulating the specification, the imported expression is
1279 now an interpretation. INCOMPATIBILITY: different normal form of
1280 locale expressions. In particular, in interpretations of locales with
1281 predicates, goals repesenting already interpreted fragments are not
1282 removed automatically. Use methods `intro_locales' and
1283 `unfold_locales'; see below.
1285 * Isar/locales: new methods `intro_locales' and `unfold_locales'
1286 provide backward reasoning on locales predicates. The methods are
1287 aware of interpretations and discharge corresponding goals.
1288 `intro_locales' is less aggressive then `unfold_locales' and does not
1289 unfold predicates to assumptions.
1291 * Isar/locales: the order in which locale fragments are accumulated
1292 has changed. This enables to override declarations from fragments due
1293 to interpretations -- for example, unwanted simp rules.
1295 * Isar/locales: interpretation in theories and proof contexts has been
1296 extended. One may now specify (and prove) equations, which are
1297 unfolded in interpreted theorems. This is useful for replacing
1298 defined concepts (constants depending on locale parameters) by
1299 concepts already existing in the target context. Example:
1301 interpretation partial_order ["op <= :: [int, int] => bool"]
1302 where "partial_order.less (op <=) (x::int) y = (x < y)"
1304 Typically, the constant `partial_order.less' is created by a
1305 definition specification element in the context of locale
1308 * Method "induct": improved internal context management to support
1309 local fixes and defines on-the-fly. Thus explicit meta-level
1310 connectives !! and ==> are rarely required anymore in inductive goals
1311 (using object-logic connectives for this purpose has been long
1312 obsolete anyway). Common proof patterns are explained in
1313 src/HOL/Induct/Common_Patterns.thy, see also
1314 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
1317 * Method "induct": improved handling of simultaneous goals. Instead of
1318 introducing object-level conjunction, the statement is now split into
1319 several conclusions, while the corresponding symbolic cases are nested
1320 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
1321 see src/HOL/Induct/Common_Patterns.thy, for example.
1323 * Method "induct": mutual induction rules are now specified as a list
1324 of rule sharing the same induction cases. HOL packages usually provide
1325 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
1326 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
1327 mutual induction rules differently, i.e. like this:
1329 (induct rule: foo_bar.inducts)
1330 (induct set: foo bar)
1331 (induct pred: foo bar)
1332 (induct type: foo bar)
1334 The ML function ProjectRule.projections turns old-style rules into the
1337 * Method "coinduct": dual of induction, see
1338 src/HOL/Library/Coinductive_List.thy for various examples.
1340 * Method "cases", "induct", "coinduct": the ``(open)'' option is
1341 considered a legacy feature.
1343 * Attribute "symmetric" produces result with standardized schematic
1344 variables (index 0). Potential INCOMPATIBILITY.
1346 * Simplifier: by default the simplifier trace only shows top level
1347 rewrites now. That is, trace_simp_depth_limit is set to 1 by
1348 default. Thus there is less danger of being flooded by the trace. The
1349 trace indicates where parts have been suppressed.
1351 * Provers/classical: removed obsolete classical version of elim_format
1352 attribute; classical elim/dest rules are now treated uniformly when
1353 manipulating the claset.
1355 * Provers/classical: stricter checks to ensure that supplied intro,
1356 dest and elim rules are well-formed; dest and elim rules must have at
1359 * Provers/classical: attributes dest/elim/intro take an optional
1360 weight argument for the rule (just as the Pure versions). Weights are
1361 ignored by automated tools, but determine the search order of single
1364 * Syntax: input syntax now supports dummy variable binding "%_. b",
1365 where the body does not mention the bound variable. Note that dummy
1366 patterns implicitly depend on their context of bounds, which makes
1367 "{_. _}" match any set comprehension as expected. Potential
1368 INCOMPATIBILITY -- parse translations need to cope with syntactic
1369 constant "_idtdummy" in the binding position.
1371 * Syntax: removed obsolete syntactic constant "_K" and its associated
1372 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
1373 for example "A -> B" => "Pi A (%_. B)".
1375 * Pure: 'class_deps' command visualizes the subclass relation, using
1376 the graph browser tool.
1378 * Pure: 'print_theory' now suppresses certain internal declarations by
1379 default; use '!' option for full details.
1384 * Method "metis" proves goals by applying the Metis general-purpose
1385 resolution prover (see also http://gilith.com/software/metis/).
1386 Examples are in the directory MetisExamples. WARNING: the
1387 Isabelle/HOL-Metis integration does not yet work properly with
1390 * Command 'sledgehammer' invokes external automatic theorem provers as
1391 background processes. It generates calls to the "metis" method if
1392 successful. These can be pasted into the proof. Users do not have to
1393 wait for the automatic provers to return. WARNING: does not really
1394 work with multi-threading.
1396 * New "auto_quickcheck" feature tests outermost goal statements for
1397 potential counter-examples. Controlled by ML references
1398 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
1399 5000 milliseconds). Fails silently if statements is outside of
1400 executable fragment, or any other codgenerator problem occurs.
1402 * New constant "undefined" with axiom "undefined x = undefined".
1404 * Added class "HOL.eq", allowing for code generation with polymorphic
1407 * Some renaming of class constants due to canonical name prefixing in
1408 the new 'class' package:
1410 HOL.abs ~> HOL.abs_class.abs
1411 HOL.divide ~> HOL.divide_class.divide
1412 0 ~> HOL.zero_class.zero
1413 1 ~> HOL.one_class.one
1414 op + ~> HOL.plus_class.plus
1415 op - ~> HOL.minus_class.minus
1416 uminus ~> HOL.minus_class.uminus
1417 op * ~> HOL.times_class.times
1418 op < ~> HOL.ord_class.less
1419 op <= > HOL.ord_class.less_eq
1420 Nat.power ~> Power.power_class.power
1421 Nat.size ~> Nat.size_class.size
1422 Numeral.number_of ~> Numeral.number_class.number_of
1423 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
1424 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
1425 Orderings.min ~> Orderings.ord_class.min
1426 Orderings.max ~> Orderings.ord_class.max
1427 Divides.op div ~> Divides.div_class.div
1428 Divides.op mod ~> Divides.div_class.mod
1429 Divides.op dvd ~> Divides.div_class.dvd
1431 INCOMPATIBILITY. Adaptions may be required in the following cases:
1433 a) User-defined constants using any of the names "plus", "minus",
1434 "times", "less" or "less_eq". The standard syntax translations for
1435 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
1438 b) Variables named "plus", "minus", "times", "less", "less_eq"
1439 INCOMPATIBILITY: use more specific names.
1441 c) Permutative equations (e.g. "a + b = b + a")
1442 Since the change of names also changes the order of terms, permutative
1443 rewrite rules may get applied in a different order. Experience shows
1444 that this is rarely the case (only two adaptions in the whole Isabelle
1445 distribution). INCOMPATIBILITY: rewrite proofs
1447 d) ML code directly refering to constant names
1448 This in general only affects hand-written proof tactics, simprocs and
1449 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
1450 Consider using @{const_name} antiquotation.
1452 * New class "default" with associated constant "default".
1454 * Function "sgn" is now overloaded and available on int, real, complex
1455 (and other numeric types), using class "sgn". Two possible defs of
1456 sgn are given as equational assumptions in the classes sgn_if and
1457 sgn_div_norm; ordered_idom now also inherits from sgn_if.
1460 * Locale "partial_order" now unified with class "order" (cf. theory
1461 Orderings), added parameter "less". INCOMPATIBILITY.
1463 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
1464 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
1465 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
1467 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
1468 changed order of proof goals in instance proofs.
1470 * The transitivity reasoner for partial and linear orders is set up
1471 for classes "order" and "linorder". Instances of the reasoner are available
1472 in all contexts importing or interpreting the corresponding locales.
1473 Method "order" invokes the reasoner separately; the reasoner
1474 is also integrated with the Simplifier as a solver. Diagnostic
1475 command 'print_orders' shows the available instances of the reasoner
1476 in the current context.
1478 * Localized monotonicity predicate in theory "Orderings"; integrated
1479 lemmas max_of_mono and min_of_mono with this predicate.
1482 * Formulation of theorem "dense" changed slightly due to integration
1483 with new class dense_linear_order.
1485 * Uniform lattice theory development in HOL.
1487 constants "meet" and "join" now named "inf" and "sup"
1488 constant "Meet" now named "Inf"
1490 classes "meet_semilorder" and "join_semilorder" now named
1491 "lower_semilattice" and "upper_semilattice"
1492 class "lorder" now named "lattice"
1493 class "comp_lat" now named "complete_lattice"
1495 Instantiation of lattice classes allows explicit definitions
1496 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
1498 INCOMPATIBILITY. Theorem renames:
1500 meet_left_le ~> inf_le1
1501 meet_right_le ~> inf_le2
1502 join_left_le ~> sup_ge1
1503 join_right_le ~> sup_ge2
1504 meet_join_le ~> inf_sup_ord
1507 le_meet ~> le_inf_iff
1508 le_join ~> ge_sup_conv
1509 meet_idempotent ~> inf_idem
1510 join_idempotent ~> sup_idem
1511 meet_comm ~> inf_commute
1512 join_comm ~> sup_commute
1513 meet_leI1 ~> le_infI1
1514 meet_leI2 ~> le_infI2
1515 le_joinI1 ~> le_supI1
1516 le_joinI2 ~> le_supI2
1517 meet_assoc ~> inf_assoc
1518 join_assoc ~> sup_assoc
1519 meet_left_comm ~> inf_left_commute
1520 meet_left_idempotent ~> inf_left_idem
1521 join_left_comm ~> sup_left_commute
1522 join_left_idempotent ~> sup_left_idem
1525 le_def_meet ~> le_iff_inf
1526 le_def_join ~> le_iff_sup
1527 join_absorp2 ~> sup_absorb2
1528 join_absorp1 ~> sup_absorb1
1529 meet_absorp1 ~> inf_absorb1
1530 meet_absorp2 ~> inf_absorb2
1531 meet_join_absorp ~> inf_sup_absorb
1532 join_meet_absorp ~> sup_inf_absorb
1533 distrib_join_le ~> distrib_sup_le
1534 distrib_meet_le ~> distrib_inf_le
1536 add_meet_distrib_left ~> add_inf_distrib_left
1537 add_join_distrib_left ~> add_sup_distrib_left
1538 is_join_neg_meet ~> is_join_neg_inf
1539 is_meet_neg_join ~> is_meet_neg_sup
1540 add_meet_distrib_right ~> add_inf_distrib_right
1541 add_join_distrib_right ~> add_sup_distrib_right
1542 add_meet_join_distribs ~> add_sup_inf_distribs
1543 join_eq_neg_meet ~> sup_eq_neg_inf
1544 meet_eq_neg_join ~> inf_eq_neg_sup
1545 add_eq_meet_join ~> add_eq_inf_sup
1546 meet_0_imp_0 ~> inf_0_imp_0
1547 join_0_imp_0 ~> sup_0_imp_0
1548 meet_0_eq_0 ~> inf_0_eq_0
1549 join_0_eq_0 ~> sup_0_eq_0
1550 neg_meet_eq_join ~> neg_inf_eq_sup
1551 neg_join_eq_meet ~> neg_sup_eq_inf
1552 join_eq_if ~> sup_eq_if
1554 mono_meet ~> mono_inf
1555 mono_join ~> mono_sup
1556 meet_bool_eq ~> inf_bool_eq
1557 join_bool_eq ~> sup_bool_eq
1558 meet_fun_eq ~> inf_fun_eq
1559 join_fun_eq ~> sup_fun_eq
1560 meet_set_eq ~> inf_set_eq
1561 join_set_eq ~> sup_set_eq
1562 meet1_iff ~> inf1_iff
1563 meet2_iff ~> inf2_iff
1572 join1_iff ~> sup1_iff
1573 join2_iff ~> sup2_iff
1583 is_meet_Meet ~> is_meet_Inf
1584 Meet_bool_def ~> Inf_bool_def
1585 Meet_fun_def ~> Inf_fun_def
1586 Meet_greatest ~> Inf_greatest
1587 Meet_lower ~> Inf_lower
1588 Meet_set_def ~> Inf_set_def
1591 Sup_bool_eq ~> Sup_bool_def
1592 Sup_fun_eq ~> Sup_fun_def
1593 Sup_set_eq ~> Sup_set_def
1595 listsp_meetI ~> listsp_infI
1596 listsp_meet_eq ~> listsp_inf_eq
1601 * Added syntactic class "size"; overloaded constant "size" now has
1602 type "'a::size ==> bool"
1604 * Internal reorganisation of `size' of datatypes: size theorems
1605 "foo.size" are no longer subsumed by "foo.simps" (but are still
1606 simplification rules by default!); theorems "prod.size" now named
1609 * Class "div" now inherits from class "times" rather than "type".
1612 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
1613 Linorder etc. have disappeared; operations defined in terms of
1614 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
1616 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
1618 * HOL-Word: New extensive library and type for generic, fixed size
1619 machine words, with arithemtic, bit-wise, shifting and rotating
1620 operations, reflection into int, nat, and bool lists, automation for
1621 linear arithmetic (by automatic reflection into nat or int), including
1622 lemmas on overflow and monotonicity. Instantiated to all appropriate
1623 arithmetic type classes, supporting automatic simplification of
1624 numerals on all operations.
1626 * Library/Boolean_Algebra: locales for abstract boolean algebras.
1628 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
1630 * Code generator library theories:
1631 - Code_Integer represents HOL integers by big integer literals in target
1633 - Code_Char represents HOL characters by character literals in target
1635 - Code_Char_chr like Code_Char, but also offers treatment of character
1636 codes; includes Code_Integer.
1637 - Executable_Set allows to generate code for finite sets using lists.
1638 - Executable_Rat implements rational numbers as triples (sign, enumerator,
1640 - Executable_Real implements a subset of real numbers, namly those
1641 representable by rational numbers.
1642 - Efficient_Nat implements natural numbers by integers, which in general will
1643 result in higher efficency; pattern matching with 0/Suc is eliminated;
1644 includes Code_Integer.
1645 - Code_Index provides an additional datatype index which is mapped to
1646 target-language built-in integers.
1647 - Code_Message provides an additional datatype message_string which is isomorphic to
1648 strings; messages are mapped to target-language strings.
1650 * New package for inductive predicates
1652 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
1655 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1656 for z_1 :: U_1 and ... and z_n :: U_m
1658 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1661 with full support for type-inference, rather than
1663 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1665 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1666 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1668 inductive "s z_1 ... z_m"
1670 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1673 For backward compatibility, there is a wrapper allowing inductive
1674 sets to be defined with the new package via
1677 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1678 for z_1 :: U_1 and ... and z_n :: U_m
1680 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1686 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1687 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1688 for z_1 :: U_1 and ... and z_n :: U_m
1690 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1691 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1694 if the additional syntax "p ..." is required.
1696 Numerous examples can be found in the subdirectories src/HOL/Auth,
1697 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
1701 - Since declaration and definition of inductive sets or predicates
1702 is no longer separated, abbreviations involving the newly
1703 introduced sets or predicates must be specified together with the
1704 introduction rules after the 'where' keyword (see above), rather
1705 than before the actual inductive definition.
1707 - The variables in induction and elimination rules are now
1708 quantified in the order of their occurrence in the introduction
1709 rules, rather than in alphabetical order. Since this may break
1710 some proofs, these proofs either have to be repaired, e.g. by
1711 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
1712 statements of the form
1714 case (rule_i a_i_1 ... a_i_{k_i})
1716 or the old order of quantification has to be restored by explicitly adding
1717 meta-level quantifiers in the introduction rules, i.e.
1719 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
1721 - The format of the elimination rules is now
1723 p z_1 ... z_m x_1 ... x_n ==>
1724 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1729 (x_1, ..., x_n) : s z_1 ... z_m ==>
1730 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1733 for sets rather than
1735 x : s z_1 ... z_m ==>
1736 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
1739 This may require terms in goals to be expanded to n-tuples
1740 (e.g. using case_tac or simplification with the split_paired_all
1741 rule) before the above elimination rule is applicable.
1743 - The elimination or case analysis rules for (mutually) inductive
1744 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
1745 list of rules "p_1_..._p_k.elims" is no longer available.
1747 * New package "function"/"fun" for general recursive functions,
1748 supporting mutual and nested recursion, definitions in local contexts,
1749 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
1750 for small examples, and the separate tutorial on the function
1751 package. The old recdef "package" is still available as before, but
1752 users are encouraged to use the new package.
1754 * Method "lexicographic_order" automatically synthesizes termination
1755 relations as lexicographic combinations of size measures.
1757 * Case-expressions allow arbitrary constructor-patterns (including
1758 "_") and take their order into account, like in functional
1759 programming. Internally, this is translated into nested
1760 case-expressions; missing cases are added and mapped to the predefined
1761 constant "undefined". In complicated cases printing may no longer show
1762 the original input but the internal form. Lambda-abstractions allow
1763 the same form of pattern matching: "% pat1 => e1 | ..." is an
1764 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
1767 * IntDef: The constant "int :: nat => int" has been removed; now "int"
1768 is an abbreviation for "of_nat :: nat => int". The simplification
1769 rules for "of_nat" have been changed to work like "int" did
1770 previously. Potential INCOMPATIBILITY:
1771 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
1772 - of_nat_diff and of_nat_mult are no longer default simp rules
1774 * Method "algebra" solves polynomial equations over (semi)rings using
1775 Groebner bases. The (semi)ring structure is defined by locales and the
1776 tool setup depends on that generic context. Installing the method for
1777 a specific type involves instantiating the locale and possibly adding
1778 declarations for computation on the coefficients. The method is
1779 already instantiated for natural numbers and for the axiomatic class
1780 of idoms with numerals. See also the paper by Chaieb and Wenzel at
1781 CALCULEMUS 2007 for the general principles underlying this
1782 architecture of context-aware proof-tools.
1784 * Method "ferrack" implements quantifier elimination over
1785 special-purpose dense linear orders using locales (analogous to
1786 "algebra"). The method is already installed for class
1787 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
1790 * Former constant "List.op @" now named "List.append". Use ML
1791 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
1792 circumvent possible incompatibilities when working on ML level.
1794 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
1796 * New function listsum :: 'a list => 'a for arbitrary monoids.
1797 Special syntax: "SUM x <- xs. f x" (and latex variants)
1799 * New syntax for Haskell-like list comprehension (input only), eg.
1800 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
1802 * The special syntax for function "filter" has changed from [x :
1803 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
1804 comprehension syntax, and for uniformity. INCOMPATIBILITY.
1806 * [a..b] is now defined for arbitrary linear orders. It used to be
1807 defined on nat only, as an abbreviation for [a..<Suc b]
1810 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
1812 * New functions "sorted" and "sort" in src/HOL/List.thy.
1814 * New lemma collection field_simps (an extension of ring_simps) for
1815 manipulating (in)equations involving division. Multiplies with all
1816 denominators that can be proved to be non-zero (in equations) or
1817 positive/negative (in inequations).
1819 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
1820 have been improved and renamed to ring_simps, group_simps and
1821 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
1822 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
1824 * Theory Library/Commutative_Ring: switched from recdef to function
1825 package; constants add, mul, pow now curried. Infix syntax for
1826 algebraic operations.
1828 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
1831 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
1834 * HOL/records: generalised field-update to take a function on the
1835 field rather than the new value: r(|A := x|) is translated to A_update
1836 (K x) r The K-combinator that is internally used is called K_record.
1837 INCOMPATIBILITY: Usage of the plain update functions has to be
1840 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
1841 * x = 0, which are required for a semiring. Richer structures do not
1842 inherit from semiring_0 anymore, because this property is a theorem
1843 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
1844 there is more to prove, but this is mostly trivial.
1846 * Class "recpower" is generalized to arbitrary monoids, not just
1847 commutative semirings. INCOMPATIBILITY: may need to incorporate
1848 commutativity or semiring properties additionally.
1850 * Constant "List.list_all2" in List.thy now uses authentic syntax.
1851 INCOMPATIBILITY: translations containing list_all2 may go wrong,
1852 better use 'abbreviation'.
1854 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
1856 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
1857 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
1858 significant changes for setting up numeral syntax for types:
1859 - New constants Numeral.pred and Numeral.succ instead
1860 of former Numeral.bin_pred and Numeral.bin_succ.
1861 - Use integer operations instead of bin_add, bin_mult and so on.
1862 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
1863 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
1865 See src/HOL/Integ/IntArith.thy for an example setup.
1867 * Command 'normal_form' computes the normal form of a term that may
1868 contain free variables. For example ``normal_form "rev [a, b, c]"''
1869 produces ``[b, c, a]'' (without proof). This command is suitable for
1870 heavy-duty computations because the functions are compiled to ML
1871 first. Correspondingly, a method "normalization" is provided. See
1872 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
1874 * Alternative iff syntax "A <-> B" for equality on bool (with priority
1875 25 like -->); output depends on the "iff" print_mode, the default is
1876 "A = B" (with priority 50).
1878 * Relations less (<) and less_eq (<=) are also available on type bool.
1879 Modified syntax to disallow nesting without explicit parentheses,
1880 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
1883 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
1885 * Relation composition operator "op O" now has precedence 75 and binds
1886 stronger than union and intersection. INCOMPATIBILITY.
1888 * The old set interval syntax "{m..n(}" (and relatives) has been
1889 removed. Use "{m..<n}" (and relatives) instead.
1891 * In the context of the assumption "~(s = t)" the Simplifier rewrites
1892 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
1893 ``declare [[simproc del: neq]]''.
1895 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
1898 * Theorem Cons_eq_map_conv no longer declared as "simp".
1900 * Theorem setsum_mult renamed to setsum_right_distrib.
1902 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
1905 * Reimplemented methods "sat" and "satx", with several improvements:
1906 goals no longer need to be stated as "<prems> ==> False", equivalences
1907 (i.e. "=" on type bool) are handled, variable names of the form
1908 "lit_<n>" are no longer reserved, significant speedup.
1910 * Methods "sat" and "satx" can now replay MiniSat proof traces.
1911 zChaff is still supported as well.
1913 * 'inductive' and 'datatype': provide projections of mutual rules,
1914 bundled as foo_bar.inducts;
1916 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
1919 * Library: moved theory Accessible_Part to main HOL.
1921 * Library: added theory Coinductive_List of potentially infinite lists
1922 as greatest fixed-point.
1924 * Library: added theory AssocList which implements (finite) maps as
1927 * Method "evaluation" solves goals (i.e. a boolean expression)
1928 efficiently by compiling it to ML. The goal is "proved" (via an
1929 oracle) if it evaluates to True.
1931 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
1932 also when invoked by the simplifier. This results in the Simplifier
1933 being more powerful on arithmetic goals. INCOMPATIBILITY.
1934 Configuration option fast_arith_split_limit=0 recovers the old
1937 * Support for hex (0x20) and binary (0b1001) numerals.
1939 * New method: reify eqs (t), where eqs are equations for an
1940 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
1941 parameter, computes a term s::'b and a list xs::'a list and proves the
1942 theorem I xs s = t. This is also known as reification or quoting. The
1943 resulting theorem is applied to the subgoal to substitute t with I xs
1944 s. If t is omitted, the subgoal itself is reified.
1946 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
1947 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
1948 where f is supposed to be a computable function (in the sense of code
1949 generattion). The method uses reify to compute s and xs as above then
1950 applies corr_thm and uses normalization by evaluation to "prove" f s =
1951 r and finally gets the theorem t = r, which is again applied to the
1952 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
1954 * Reflection: Automatic reification now handels binding, an example is
1955 available in src/HOL/ex/ReflectionEx.thy
1957 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
1958 command 'statespace' that is similar to 'record', but introduces an
1959 abstract specification based on the locale infrastructure instead of
1960 HOL types. This leads to extra flexibility in composing state spaces,
1961 in particular multiple inheritance and renaming of components.
1966 * Hyperreal: Functions root and sqrt are now defined on negative real
1967 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
1968 Nonnegativity side conditions have been removed from many lemmas, so
1969 that more subgoals may now be solved by simplification; potential
1972 * Real: new type classes formalize real normed vector spaces and
1973 algebras, using new overloaded constants scaleR :: real => 'a => 'a
1974 and norm :: 'a => real.
1976 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
1977 reals into other types. The overloaded constant Reals :: 'a set is now
1978 defined as range of_real; potential INCOMPATIBILITY.
1980 * Real: proper support for ML code generation, including 'quickcheck'.
1981 Reals are implemented as arbitrary precision rationals.
1983 * Hyperreal: Several constants that previously worked only for the
1984 reals have been generalized, so they now work over arbitrary vector
1985 spaces. Type annotations may need to be added in some cases; potential
1988 Infinitesimal :: ('a::real_normed_vector) star set
1989 HFinite :: ('a::real_normed_vector) star set
1990 HInfinite :: ('a::real_normed_vector) star set
1991 approx :: ('a::real_normed_vector) star => 'a star => bool
1992 monad :: ('a::real_normed_vector) star => 'a star set
1993 galaxy :: ('a::real_normed_vector) star => 'a star set
1994 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
1995 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
1996 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
1997 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
1998 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
1999 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
2000 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
2001 sgn :: 'a::real_normed_vector => 'a
2002 exp :: 'a::{recpower,real_normed_field,banach} => 'a
2004 * Complex: Some complex-specific constants are now abbreviations for
2005 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
2006 hnorm. Other constants have been entirely removed in favor of the
2007 polymorphic versions (INCOMPATIBILITY):
2011 HInfinite <-- CInfinite
2012 Infinitesimal <-- CInfinitesimal
2015 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
2016 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
2017 (ns)deriv <-- (ns)cderiv
2022 * Formalisation of ideals and the quotient construction over rings.
2024 * Order and lattice theory no longer based on records.
2027 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
2028 greatest_closed. INCOMPATIBILITY.
2030 * Method algebra is now set up via an attribute. For examples see
2031 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
2032 of algebraic structures.
2034 * Renamed theory CRing to Ring.
2039 * Substantial, yet incomplete support for nominal datatypes (binding
2040 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
2041 src/HOL/Nominal/Examples. Prospective users should consult
2042 http://isabelle.in.tum.de/nominal/
2047 * ML basics: just one true type int, which coincides with IntInf.int
2050 * ML within Isar: antiquotations allow to embed statically-checked
2051 formal entities in the source, referring to the context available at
2052 compile-time. For example:
2054 ML {* @{sort "{zero,one}"} *}
2055 ML {* @{typ "'a => 'b"} *}
2056 ML {* @{term "%x. x"} *}
2057 ML {* @{prop "x == y"} *}
2058 ML {* @{ctyp "'a => 'b"} *}
2059 ML {* @{cterm "%x. x"} *}
2060 ML {* @{cprop "x == y"} *}
2061 ML {* @{thm asm_rl} *}
2062 ML {* @{thms asm_rl} *}
2063 ML {* @{type_name c} *}
2064 ML {* @{type_syntax c} *}
2065 ML {* @{const_name c} *}
2066 ML {* @{const_syntax c} *}
2069 ML {* @{theory Pure} *}
2070 ML {* @{theory_ref} *}
2071 ML {* @{theory_ref Pure} *}
2074 ML {* @{clasimpset} *}
2076 The same works for sources being ``used'' within an Isar context.
2078 * ML in Isar: improved error reporting; extra verbosity with
2079 ML_Context.trace enabled.
2081 * Pure/General/table.ML: the join operations now works via exceptions
2082 DUP/SAME instead of type option. This is simpler in simple cases, and
2083 admits slightly more efficient complex applications.
2085 * Pure: 'advanced' translation functions (parse_translation etc.) now
2086 use Context.generic instead of just theory.
2088 * Pure: datatype Context.generic joins theory/Proof.context and
2089 provides some facilities for code that works in either kind of
2090 context, notably GenericDataFun for uniform theory and proof data.
2092 * Pure: simplified internal attribute type, which is now always
2093 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
2094 local (Proof.context) attributes have been discontinued, while
2095 minimizing code duplication. Thm.rule_attribute and
2096 Thm.declaration_attribute build canonical attributes; see also structure
2097 Context for further operations on Context.generic, notably
2098 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
2099 declarations and definitions.
2101 * Context data interfaces (Theory/Proof/GenericDataFun): removed
2102 name/print, uninitialized data defaults to ad-hoc copy of empty value,
2103 init only required for impure data. INCOMPATIBILITY: empty really need
2104 to be empty (no dependencies on theory content!)
2106 * Pure/kernel: consts certification ignores sort constraints given in
2107 signature declarations. (This information is not relevant to the
2108 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
2109 potential INCOMPATIBILITY.
2111 * Pure: axiomatic type classes are now purely definitional, with
2112 explicit proofs of class axioms and super class relations performed
2113 internally. See Pure/axclass.ML for the main internal interfaces --
2114 notably AxClass.define_class supercedes AxClass.add_axclass, and
2115 AxClass.axiomatize_class/classrel/arity supersede
2116 Sign.add_classes/classrel/arities.
2118 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
2119 global/local versions on theory vs. Proof.context have been
2120 discontinued; Attrib.syntax and Method.syntax have been adapted
2121 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
2122 attributes, methods, etc.
2124 * Pure: several functions of signature "... -> theory -> theory * ..."
2125 have been reoriented to "... -> theory -> ... * theory" in order to
2126 allow natural usage in combination with the ||>, ||>>, |-> and
2127 fold_map combinators.
2129 * Pure: official theorem names (closed derivations) and additional
2130 comments (tags) are now strictly separate. Name hints -- which are
2131 maintained as tags -- may be attached any time without affecting the
2134 * Pure: primitive rule lift_rule now takes goal cterm instead of an
2135 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
2136 achieve the old behaviour.
2138 * Pure: the "Goal" constant is now called "prop", supporting a
2139 slightly more general idea of ``protecting'' meta-level rule
2142 * Pure: Logic.(un)varify only works in a global context, which is now
2143 enforced instead of silently assumed. INCOMPATIBILITY, may use
2144 Logic.legacy_(un)varify as temporary workaround.
2146 * Pure: structure Name provides scalable operations for generating
2147 internal variable names, notably Name.variants etc. This replaces
2148 some popular functions from term.ML:
2150 Term.variant -> Name.variant
2151 Term.variantlist -> Name.variant_list
2152 Term.invent_names -> Name.invent_list
2154 Note that low-level renaming rarely occurs in new code -- operations
2155 from structure Variable are used instead (see below).
2157 * Pure: structure Variable provides fundamental operations for proper
2158 treatment of fixed/schematic variables in a context. For example,
2159 Variable.import introduces fixes for schematics of given facts and
2160 Variable.export reverses the effect (up to renaming) -- this replaces
2161 various freeze_thaw operations.
2163 * Pure: structure Goal provides simple interfaces for
2164 init/conclude/finish and tactical prove operations (replacing former
2165 Tactic.prove). Goal.prove is the canonical way to prove results
2166 within a given context; Goal.prove_global is a degraded version for
2167 theory level goals, including a global Drule.standard. Note that
2168 OldGoals.prove_goalw_cterm has long been obsolete, since it is
2169 ill-behaved in a local proof context (e.g. with local fixes/assumes or
2170 in a locale context).
2172 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
2173 and type checking (Syntax.check_term etc.), with common combinations
2174 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
2175 which are considered legacy and await removal.
2177 * Pure/Syntax: generic interfaces for type unchecking
2178 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
2179 with common combinations (Syntax.pretty_term, Syntax.string_of_term
2180 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
2181 available for convenience, but refer to the very same operations using
2182 a mere theory instead of a full context.
2184 * Isar: simplified treatment of user-level errors, using exception
2185 ERROR of string uniformly. Function error now merely raises ERROR,
2186 without any side effect on output channels. The Isar toplevel takes
2187 care of proper display of ERROR exceptions. ML code may use plain
2188 handle/can/try; cat_error may be used to concatenate errors like this:
2190 ... handle ERROR msg => cat_error msg "..."
2192 Toplevel ML code (run directly or through the Isar toplevel) may be
2193 embedded into the Isar toplevel with exception display/debug like
2196 Isar.toplevel (fn () => ...)
2198 INCOMPATIBILITY, removed special transform_error facilities, removed
2199 obsolete variants of user-level exceptions (ERROR_MESSAGE,
2200 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
2201 -- use plain ERROR instead.
2203 * Isar: theory setup now has type (theory -> theory), instead of a
2204 list. INCOMPATIBILITY, may use #> to compose setup functions.
2206 * Isar: ML toplevel pretty printer for type Proof.context, subject to
2207 ProofContext.debug/verbose flags.
2209 * Isar: Toplevel.theory_to_proof admits transactions that modify the
2210 theory before entering a proof state. Transactions now always see a
2211 quasi-functional intermediate checkpoint, both in interactive and
2214 * Isar: simplified interfaces for outer syntax. Renamed
2215 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
2216 OuterSyntax.add_parsers -- this functionality is now included in
2217 OuterSyntax.command etc. INCOMPATIBILITY.
2219 * Simplifier: the simpset of a running simplification process now
2220 contains a proof context (cf. Simplifier.the_context), which is the
2221 very context that the initial simpset has been retrieved from (by
2222 simpset_of/local_simpset_of). Consequently, all plug-in components
2223 (solver, looper etc.) may depend on arbitrary proof data.
2225 * Simplifier.inherit_context inherits the proof context (plus the
2226 local bounds) of the current simplification process; any simproc
2227 etc. that calls the Simplifier recursively should do this! Removed
2228 former Simplifier.inherit_bounds, which is already included here --
2229 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
2230 specify an explicit context using Simplifier.context/theory_context.
2232 * Simplifier/Classical Reasoner: more abstract interfaces
2233 change_simpset/claset for modifying the simpset/claset reference of a
2234 theory; raw versions simpset/claset_ref etc. have been discontinued --
2237 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
2243 * settings: the default heap location within ISABELLE_HOME_USER now
2244 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
2245 Isabelle installations.
2247 * isabelle-process: option -S (secure mode) disables some critical
2248 operations, notably runtime compilation and evaluation of ML source
2251 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
2253 * Support for parallel execution, using native multicore support of
2254 Poly/ML 5.1. The theory loader exploits parallelism when processing
2255 independent theories, according to the given theory header
2256 specifications. The maximum number of worker threads is specified via
2257 usedir option -M or the "max-threads" setting in Proof General. A
2258 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
2259 to 6 on a 8-core machine. User-code needs to observe certain
2260 guidelines for thread-safe programming, see appendix A in the Isar
2261 Implementation manual.
2265 New in Isabelle2005 (October 2005)
2266 ----------------------------------
2270 * Theory headers: the new header syntax for Isar theories is
2273 imports <theory1> ... <theoryN>
2274 uses <file1> ... <fileM>
2277 where the 'uses' part is optional. The previous syntax
2279 theory <name> = <theory1> + ... + <theoryN>:
2281 will disappear in the next release. Use isatool fixheaders to convert
2282 existing theory files. Note that there is no change in ancient
2283 non-Isar theories now, but these will disappear soon.
2285 * Theory loader: parent theories can now also be referred to via
2286 relative and absolute paths.
2288 * Command 'find_theorems' searches for a list of criteria instead of a
2289 list of constants. Known criteria are: intro, elim, dest, name:string,
2290 simp:term, and any term. Criteria can be preceded by '-' to select
2291 theorems that do not match. Intro, elim, dest select theorems that
2292 match the current goal, name:s selects theorems whose fully qualified
2293 name contain s, and simp:term selects all simplification rules whose
2294 lhs match term. Any other term is interpreted as pattern and selects
2295 all theorems matching the pattern. Available in ProofGeneral under
2296 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
2298 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
2300 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
2301 matching the current goal as introduction rule and not having "HOL."
2302 in their name (i.e. not being defined in theory HOL).
2304 * Command 'thms_containing' has been discontinued in favour of
2305 'find_theorems'; INCOMPATIBILITY.
2307 * Communication with Proof General is now 8bit clean, which means that
2308 Unicode text in UTF-8 encoding may be used within theory texts (both
2309 formal and informal parts). Cf. option -U of the Isabelle Proof
2310 General interface. Here are some simple examples (cf. src/HOL/ex):
2312 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
2313 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
2315 * Improved efficiency of the Simplifier and, to a lesser degree, the
2316 Classical Reasoner. Typical big applications run around 2 times
2320 *** Document preparation ***
2322 * Commands 'display_drafts' and 'print_drafts' perform simple output
2323 of raw sources. Only those symbols that do not require additional
2324 LaTeX packages (depending on comments in isabellesym.sty) are
2325 displayed properly, everything else is left verbatim. isatool display
2326 and isatool print are used as front ends (these are subject to the
2327 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
2329 * Command tags control specific markup of certain regions of text,
2330 notably folding and hiding. Predefined tags include "theory" (for
2331 theory begin and end), "proof" for proof commands, and "ML" for
2332 commands involving ML code; the additional tags "visible" and
2333 "invisible" are unused by default. Users may give explicit tag
2334 specifications in the text, e.g. ''by %invisible (auto)''. The
2335 interpretation of tags is determined by the LaTeX job during document
2336 preparation: see option -V of isatool usedir, or options -n and -t of
2337 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
2340 Several document versions may be produced at the same time via isatool
2341 usedir (the generated index.html will link all of them). Typical
2342 specifications include ''-V document=theory,proof,ML'' to present
2343 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
2344 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
2345 these parts without any formal replacement text. The Isabelle site
2346 default settings produce ''document'' and ''outline'' versions as
2349 * Several new antiquotations:
2351 @{term_type term} prints a term with its type annotated;
2353 @{typeof term} prints the type of a term;
2355 @{const const} is the same as @{term const}, but checks that the
2356 argument is a known logical constant;
2358 @{term_style style term} and @{thm_style style thm} print a term or
2359 theorem applying a "style" to it
2363 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
2364 definitions, equations, inequations etc., 'concl' printing only the
2365 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
2366 to print the specified premise. TermStyle.add_style provides an ML
2367 interface for introducing further styles. See also the "LaTeX Sugar"
2368 document practical applications. The ML antiquotation prints
2369 type-checked ML expressions verbatim.
2371 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
2372 and 'text' support optional locale specification '(in loc)', which
2373 specifies the default context for interpreting antiquotations. For
2374 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
2376 * Option 'locale=NAME' of antiquotations specifies an alternative
2377 context interpreting the subsequent argument. For example: @{thm
2378 [locale=lattice] inf_assoc}.
2380 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
2383 * Proper output of antiquotations for theory commands involving a
2384 proof context (such as 'locale' or 'theorem (in loc) ...').
2386 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
2387 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
2389 * isatool usedir: new option -C (default true) controls whether option
2390 -D should include a copy of the original document directory; -C false
2391 prevents unwanted effects such as copying of administrative CVS data.
2396 * Considerably improved version of 'constdefs' command. Now performs
2397 automatic type-inference of declared constants; additional support for
2398 local structure declarations (cf. locales and HOL records), see also
2399 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
2400 sequential dependencies of definitions within a single 'constdefs'
2401 section; moreover, the declared name needs to be an identifier. If
2402 all fails, consider to fall back on 'consts' and 'defs' separately.
2404 * Improved indexed syntax and implicit structures. First of all,
2405 indexed syntax provides a notational device for subscripted
2406 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
2407 expressions. Secondly, in a local context with structure
2408 declarations, number indexes \<^sub>n or the empty index (default
2409 number 1) refer to a certain fixed variable implicitly; option
2410 show_structs controls printing of implicit structures. Typical
2411 applications of these concepts involve record types and locales.
2413 * New command 'no_syntax' removes grammar declarations (and
2414 translations) resulting from the given syntax specification, which is
2415 interpreted in the same manner as for the 'syntax' command.
2417 * 'Advanced' translation functions (parse_translation etc.) may depend
2418 on the signature of the theory context being presently used for
2419 parsing/printing, see also isar-ref manual.
2421 * Improved 'oracle' command provides a type-safe interface to turn an
2422 ML expression of type theory -> T -> term into a primitive rule of
2423 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
2424 is already included here); see also FOL/ex/IffExample.thy;
2427 * axclass: name space prefix for class "c" is now "c_class" (was "c"
2428 before); "cI" is no longer bound, use "c.intro" instead.
2429 INCOMPATIBILITY. This change avoids clashes of fact bindings for
2430 axclasses vs. locales.
2432 * Improved internal renaming of symbolic identifiers -- attach primes
2433 instead of base 26 numbers.
2435 * New flag show_question_marks controls printing of leading question
2436 marks in schematic variable names.
2438 * In schematic variable names, *any* symbol following \<^isub> or
2439 \<^isup> is now treated as part of the base name. For example, the
2440 following works without printing of awkward ".0" indexes:
2442 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
2445 * Inner syntax includes (*(*nested*) comments*).
2447 * Pretty printer now supports unbreakable blocks, specified in mixfix
2448 annotations as "(00...)".
2450 * Clear separation of logical types and nonterminals, where the latter
2451 may only occur in 'syntax' specifications or type abbreviations.
2452 Before that distinction was only partially implemented via type class
2453 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
2454 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
2455 exotic syntax specifications may require further adaption
2456 (e.g. Cube/Cube.thy).
2458 * Removed obsolete type class "logic", use the top sort {} instead.
2459 Note that non-logical types should be declared as 'nonterminals'
2460 rather than 'types'. INCOMPATIBILITY for new object-logic
2463 * Attributes 'induct' and 'cases': type or set names may now be
2464 locally fixed variables as well.
2466 * Simplifier: can now control the depth to which conditional rewriting
2467 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
2470 * Simplifier: simplification procedures may now take the current
2471 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
2472 interface), which is very useful for calling the Simplifier
2473 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
2474 is gone -- use prems_of_ss on the simpset instead. Moreover, the
2475 low-level mk_simproc no longer applies Logic.varify internally, to
2476 allow for use in a context of fixed variables.
2478 * thin_tac now works even if the assumption being deleted contains !!
2479 or ==>. More generally, erule now works even if the major premise of
2480 the elimination rule contains !! or ==>.
2482 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
2484 * Reorganized bootstrapping of the Pure theories; CPure is now derived
2485 from Pure, which contains all common declarations already. Both
2486 theories are defined via plain Isabelle/Isar .thy files.
2487 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
2488 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
2489 use isatool fixcpure to adapt your theory and ML sources.
2491 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
2492 selections of theorems in named facts via index ranges.
2494 * 'print_theorems': in theory mode, really print the difference
2495 wrt. the last state (works for interactive theory development only),
2496 in proof mode print all local facts (cf. 'print_facts');
2498 * 'hide': option '(open)' hides only base names.
2500 * More efficient treatment of intermediate checkpoints in interactive
2503 * Code generator is now invoked via code_module (incremental code
2504 generation) and code_library (modular code generation, ML structures
2505 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
2506 must be quoted when used as identifiers.
2508 * New 'value' command for reading, evaluating and printing terms using
2509 the code generator. INCOMPATIBILITY: command keyword 'value' must be
2510 quoted when used as identifier.
2515 * New commands for the interpretation of locale expressions in
2516 theories (1), locales (2) and proof contexts (3). These generate
2517 proof obligations from the expression specification. After the
2518 obligations have been discharged, theorems of the expression are added
2519 to the theory, target locale or proof context. The synopsis of the
2520 commands is a follows:
2522 (1) interpretation expr inst
2523 (2) interpretation target < expr
2524 (3) interpret expr inst
2526 Interpretation in theories and proof contexts require a parameter
2527 instantiation of terms from the current context. This is applied to
2528 specifications and theorems of the interpreted expression.
2529 Interpretation in locales only permits parameter renaming through the
2530 locale expression. Interpretation is smart in that interpretations
2531 that are active already do not occur in proof obligations, neither are
2532 instantiated theorems stored in duplicate. Use 'print_interps' to
2533 inspect active interpretations of a particular locale. For details,
2534 see the Isar Reference manual. Examples can be found in
2535 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
2537 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
2538 'interpret' instead.
2540 * New context element 'constrains' for adding type constraints to
2543 * Context expressions: renaming of parameters with syntax
2546 * Locale declaration: 'includes' disallowed.
2548 * Proper static binding of attribute syntax -- i.e. types / terms /
2549 facts mentioned as arguments are always those of the locale definition
2550 context, independently of the context of later invocations. Moreover,
2551 locale operations (renaming and type / term instantiation) are applied
2552 to attribute arguments as expected.
2554 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
2555 actual attributes; rare situations may require Attrib.attribute to
2556 embed those attributes into Attrib.src that lack concrete syntax.
2557 Attribute implementations need to cooperate properly with the static
2558 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
2559 Attrib.XXX_thm etc. already do the right thing without further
2560 intervention. Only unusual applications -- such as "where" or "of"
2561 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
2562 on the context and the facts involved -- may have to assign parsed
2563 values to argument tokens explicitly.
2565 * Changed parameter management in theorem generation for long goal
2566 statements with 'includes'. INCOMPATIBILITY: produces a different
2567 theorem statement in rare situations.
2569 * Locale inspection command 'print_locale' omits notes elements. Use
2570 'print_locale!' to have them included in the output.
2575 * Provers/hypsubst.ML: improved version of the subst method, for
2576 single-step rewriting: it now works in bound variable contexts. New is
2577 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
2578 rewrite a different subterm than the original subst method, which is
2579 still available as 'simplesubst'.
2581 * Provers/quasi.ML: new transitivity reasoners for transitivity only
2584 * Provers/trancl.ML: new transitivity reasoner for transitive and
2585 reflexive-transitive closure of relations.
2587 * Provers/blast.ML: new reference depth_limit to make blast's depth
2588 limit (previously hard-coded with a value of 20) user-definable.
2590 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
2591 is peformed already. Object-logics merely need to finish their
2592 initial simpset configuration as before. INCOMPATIBILITY.
2597 * Symbolic syntax of Hilbert Choice Operator is now as follows:
2600 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
2602 The symbol \<some> is displayed as the alternative epsilon of LaTeX
2603 and x-symbol; use option '-m epsilon' to get it actually printed.
2604 Moreover, the mathematically important symbolic identifier \<epsilon>
2605 becomes available as variable, constant etc. INCOMPATIBILITY,
2607 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
2608 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
2609 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
2610 support corresponding Isar calculations.
2612 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
2615 * theory SetInterval: changed the syntax for open intervals:
2624 The old syntax is still supported but will disappear in the next
2625 release. For conversion use the following Emacs search and replace
2626 patterns (these are not perfect but work quite well):
2628 {)\([^\.]*\)\.\. -> {\1<\.\.}
2629 \.\.\([^(}]*\)(} -> \.\.<\1}
2631 * Theory Commutative_Ring (in Library): method comm_ring for proving
2632 equalities in commutative rings; method 'algebra' provides a generic
2635 * Theory Finite_Set: changed the syntax for 'setsum', summation over
2636 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
2637 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
2640 Some new syntax forms are available:
2642 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
2643 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
2644 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
2645 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
2647 The latter form "\<Sum>x < k. e" used to be based on a separate
2648 function "Summation", which has been discontinued.
2650 * theory Finite_Set: in structured induction proofs, the insert case
2651 is now 'case (insert x F)' instead of the old counterintuitive 'case
2654 * The 'refute' command has been extended to support a much larger
2655 fragment of HOL, including axiomatic type classes, constdefs and
2656 typedefs, inductive datatypes and recursion.
2658 * New tactics 'sat' and 'satx' to prove propositional tautologies.
2659 Requires zChaff with proof generation to be installed. See
2660 HOL/ex/SAT_Examples.thy for examples.
2662 * Datatype induction via method 'induct' now preserves the name of the
2663 induction variable. For example, when proving P(xs::'a list) by
2664 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
2665 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
2666 in unstructured proof scripts.
2668 * Reworked implementation of records. Improved scalability for
2669 records with many fields, avoiding performance problems for type
2670 inference. Records are no longer composed of nested field types, but
2671 of nested extension types. Therefore the record type only grows linear
2672 in the number of extensions and not in the number of fields. The
2673 top-level (users) view on records is preserved. Potential
2674 INCOMPATIBILITY only in strange cases, where the theory depends on the
2675 old record representation. The type generated for a record is called
2676 <record_name>_ext_type.
2678 Flag record_quick_and_dirty_sensitive can be enabled to skip the
2679 proofs triggered by a record definition or a simproc (if
2680 quick_and_dirty is enabled). Definitions of large records can take
2683 New simproc record_upd_simproc for simplification of multiple record
2684 updates enabled by default. Moreover, trivial updates are also
2685 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
2686 occasionally, since simplification is more powerful by default.
2688 * typedef: proper support for polymorphic sets, which contain extra
2689 type-variables in the term.
2691 * Simplifier: automatically reasons about transitivity chains
2692 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
2693 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
2694 old proofs break occasionally as simplification may now solve more
2695 goals than previously.
2697 * Simplifier: converts x <= y into x = y if assumption y <= x is
2698 present. Works for all partial orders (class "order"), in particular
2699 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
2702 * Simplifier: new simproc for "let x = a in f x". If a is a free or
2703 bound variable or a constant then the let is unfolded. Otherwise
2704 first a is simplified to b, and then f b is simplified to g. If
2705 possible we abstract b from g arriving at "let x = b in h x",
2706 otherwise we unfold the let and arrive at g. The simproc can be
2707 enabled/disabled by the reference use_let_simproc. Potential
2708 INCOMPATIBILITY since simplification is more powerful by default.
2710 * Classical reasoning: the meson method now accepts theorems as arguments.
2712 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
2713 jobs to provide advice on the provability of subgoals.
2715 * Theory OrderedGroup and Ring_and_Field: various additions and
2716 improvements to faciliate calculations involving equalities and
2719 The following theorems have been eliminated or modified
2722 abs_eq now named abs_of_nonneg
2723 abs_of_ge_0 now named abs_of_nonneg
2724 abs_minus_eq now named abs_of_nonpos
2725 imp_abs_id now named abs_of_nonneg
2726 imp_abs_neg_id now named abs_of_nonpos
2727 mult_pos now named mult_pos_pos
2728 mult_pos_le now named mult_nonneg_nonneg
2729 mult_pos_neg_le now named mult_nonneg_nonpos
2730 mult_pos_neg2_le now named mult_nonneg_nonpos2
2731 mult_neg now named mult_neg_neg
2732 mult_neg_le now named mult_nonpos_nonpos
2734 * The following lemmas in Ring_and_Field have been added to the simplifier:
2737 not_square_less_zero
2739 The following lemmas have been deleted from Real/RealPow:
2749 * Theory Parity: added rules for simplifying exponents.
2753 The following theorems have been eliminated or modified
2756 list_all_Nil now named list_all.simps(1)
2757 list_all_Cons now named list_all.simps(2)
2758 list_all_conv now named list_all_iff
2759 set_mem_eq now named mem_iff
2761 * Theories SetsAndFunctions and BigO (see HOL/Library) support
2762 asymptotic "big O" calculations. See the notes in BigO.thy.
2767 * Theory RealDef: better support for embedding natural numbers and
2768 integers in the reals.
2770 The following theorems have been eliminated or modified
2773 exp_ge_add_one_self now requires no hypotheses
2774 real_of_int_add reversed direction of equality (use [symmetric])
2775 real_of_int_minus reversed direction of equality (use [symmetric])
2776 real_of_int_diff reversed direction of equality (use [symmetric])
2777 real_of_int_mult reversed direction of equality (use [symmetric])
2779 * Theory RComplete: expanded support for floor and ceiling functions.
2781 * Theory Ln is new, with properties of the natural logarithm
2783 * Hyperreal: There is a new type constructor "star" for making
2784 nonstandard types. The old type names are now type synonyms:
2788 hcomplex = complex star
2790 * Hyperreal: Many groups of similarly-defined constants have been
2791 replaced by polymorphic versions (INCOMPATIBILITY):
2793 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
2795 starset <-- starsetNat, starsetC
2796 *s* <-- *sNat*, *sc*
2797 starset_n <-- starsetNat_n, starsetC_n
2798 *sn* <-- *sNatn*, *scn*
2799 InternalSets <-- InternalNatSets, InternalCSets
2801 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2802 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
2803 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
2804 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
2805 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
2807 * Hyperreal: Many type-specific theorems have been removed in favor of
2808 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
2810 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
2811 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
2812 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
2813 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
2814 right_minus <-- hypreal_add_minus
2815 left_minus <-- {hypreal,hcomplex}_add_minus_left
2816 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
2817 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
2818 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
2819 mult_1_right <-- hcomplex_mult_one_right
2820 mult_zero_left <-- hcomplex_mult_zero_left
2821 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
2822 right_distrib <-- hypnat_add_mult_distrib2
2823 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
2824 right_inverse <-- hypreal_mult_inverse
2825 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
2826 order_refl <-- {hypreal,hypnat}_le_refl
2827 order_trans <-- {hypreal,hypnat}_le_trans
2828 order_antisym <-- {hypreal,hypnat}_le_anti_sym
2829 order_less_le <-- {hypreal,hypnat}_less_le
2830 linorder_linear <-- {hypreal,hypnat}_le_linear
2831 add_left_mono <-- {hypreal,hypnat}_add_left_mono
2832 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
2833 add_nonneg_nonneg <-- hypreal_le_add_order
2835 * Hyperreal: Separate theorems having to do with type-specific
2836 versions of constants have been merged into theorems that apply to the
2837 new polymorphic constants (INCOMPATIBILITY):
2839 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
2840 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
2841 STAR_Un <-- {STAR,NatStar,STARC}_Un
2842 STAR_Int <-- {STAR,NatStar,STARC}_Int
2843 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
2844 STAR_subset <-- {STAR,NatStar,STARC}_subset
2845 STAR_mem <-- {STAR,NatStar,STARC}_mem
2846 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
2847 STAR_diff <-- {STAR,STARC}_diff
2848 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
2849 STARC_hcomplex_of_complex}_image_subset
2850 starset_n_Un <-- starset{Nat,C}_n_Un
2851 starset_n_Int <-- starset{Nat,C}_n_Int
2852 starset_n_Compl <-- starset{Nat,C}_n_Compl
2853 starset_n_diff <-- starset{Nat,C}_n_diff
2854 InternalSets_Un <-- Internal{Nat,C}Sets_Un
2855 InternalSets_Int <-- Internal{Nat,C}Sets_Int
2856 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
2857 InternalSets_diff <-- Internal{Nat,C}Sets_diff
2858 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
2859 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
2860 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
2861 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
2862 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
2863 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2864 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
2865 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
2866 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
2867 starfun_diff <-- starfun{C,RC,CR}_diff
2868 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
2869 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
2870 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
2871 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
2872 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
2873 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
2874 starfun_Id <-- starfunC_Id
2875 starfun_approx <-- starfun{Nat,CR}_approx
2876 starfun_capprox <-- starfun{C,RC}_capprox
2877 starfun_abs <-- starfunNat_rabs
2878 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
2879 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
2880 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
2881 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
2882 starfun_add_capprox <-- starfun{C,RC}_add_capprox
2883 starfun_add_approx <-- starfunCR_add_approx
2884 starfun_inverse_inverse <-- starfunC_inverse_inverse
2885 starfun_divide <-- starfun{C,CR,RC}_divide
2886 starfun_n <-- starfun{Nat,C}_n
2887 starfun_n_mult <-- starfun{Nat,C}_n_mult
2888 starfun_n_add <-- starfun{Nat,C}_n_add
2889 starfun_n_add_minus <-- starfunNat_n_add_minus
2890 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
2891 starfun_n_minus <-- starfun{Nat,C}_n_minus
2892 starfun_n_eq <-- starfun{Nat,C}_n_eq
2894 star_n_add <-- {hypreal,hypnat,hcomplex}_add
2895 star_n_minus <-- {hypreal,hcomplex}_minus
2896 star_n_diff <-- {hypreal,hcomplex}_diff
2897 star_n_mult <-- {hypreal,hcomplex}_mult
2898 star_n_inverse <-- {hypreal,hcomplex}_inverse
2899 star_n_le <-- {hypreal,hypnat}_le
2900 star_n_less <-- {hypreal,hypnat}_less
2901 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
2902 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
2903 star_n_abs <-- hypreal_hrabs
2904 star_n_divide <-- hcomplex_divide
2906 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
2907 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
2908 star_of_diff <-- hypreal_of_real_diff
2909 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
2910 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
2911 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
2912 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
2913 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
2914 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
2915 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
2916 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
2917 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
2918 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
2919 star_of_number_of <-- {hypreal,hcomplex}_number_of
2920 star_of_number_less <-- number_of_less_hypreal_of_real_iff
2921 star_of_number_le <-- number_of_le_hypreal_of_real_iff
2922 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
2923 star_of_less_number <-- hypreal_of_real_less_number_of_iff
2924 star_of_le_number <-- hypreal_of_real_le_number_of_iff
2925 star_of_power <-- hypreal_of_real_power
2926 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
2928 * Hyperreal: new method "transfer" that implements the transfer
2929 principle of nonstandard analysis. With a subgoal that mentions
2930 nonstandard types like "'a star", the command "apply transfer"
2931 replaces it with an equivalent one that mentions only standard types.
2932 To be successful, all free variables must have standard types; non-
2933 standard variables must have explicit universal quantifiers.
2935 * Hyperreal: A theory of Taylor series.
2940 * Discontinued special version of 'constdefs' (which used to support
2941 continuous functions) in favor of the general Pure one with full
2944 * New simplification procedure for solving continuity conditions; it
2945 is much faster on terms with many nested lambda abstractions (cubic
2946 instead of exponential time).
2948 * New syntax for domain package: selector names are now optional.
2949 Parentheses should be omitted unless argument is lazy, for example:
2951 domain 'a stream = cons "'a" (lazy "'a stream")
2953 * New command 'fixrec' for defining recursive functions with pattern
2954 matching; defining multiple functions with mutual recursion is also
2955 supported. Patterns may include the constants cpair, spair, up, sinl,
2956 sinr, or any data constructor defined by the domain package. The given
2957 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
2958 syntax and examples.
2960 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
2961 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
2962 but the proof obligation additionally includes an admissibility
2963 requirement. The packages generate instances of class cpo or pcpo,
2964 with continuity and strictness theorems for Rep and Abs.
2966 * HOLCF: Many theorems have been renamed according to a more standard naming
2967 scheme (INCOMPATIBILITY):
2969 foo_inject: "foo$x = foo$y ==> x = y"
2970 foo_eq: "(foo$x = foo$y) = (x = y)"
2971 foo_less: "(foo$x << foo$y) = (x << y)"
2972 foo_strict: "foo$UU = UU"
2973 foo_defined: "... ==> foo$x ~= UU"
2974 foo_defined_iff: "(foo$x = UU) = (x = UU)"
2979 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
2980 including the First Isomorphism Theorem (on quotienting by the kernel
2983 * ZF/Simplifier: install second copy of type solver that actually
2984 makes use of TC rules declared to Isar proof contexts (or locales);
2985 the old version is still required for ML proof scripts.
2990 * Converted to Isar theory format; use locales instead of axiomatic
2996 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
2999 * Pure/library.ML no longer defines its own option datatype, but uses
3000 that of the SML basis, which has constructors NONE and SOME instead of
3001 None and Some, as well as exception Option.Option instead of OPTION.
3002 The functions the, if_none, is_some, is_none have been adapted
3003 accordingly, while Option.map replaces apsome.
3005 * Pure/library.ML: the exception LIST has been given up in favour of
3006 the standard exceptions Empty and Subscript, as well as
3007 Library.UnequalLengths. Function like Library.hd and Library.tl are
3008 superceded by the standard hd and tl functions etc.
3010 A number of basic list functions are no longer exported to the ML
3011 toplevel, as they are variants of predefined functions. The following
3012 suggests how one can translate existing code:
3014 rev_append xs ys = List.revAppend (xs, ys)
3015 nth_elem (i, xs) = List.nth (xs, i)
3016 last_elem xs = List.last xs
3017 flat xss = List.concat xss
3018 seq fs = List.app fs
3019 partition P xs = List.partition P xs
3020 mapfilter f xs = List.mapPartial f xs
3022 * Pure/library.ML: several combinators for linear functional
3023 transformations, notably reverse application and composition:
3026 (x, y) |-> f f #-> g
3028 * Pure/library.ML: introduced/changed precedence of infix operators:
3030 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
3032 infix 3 o oo ooo oooo;
3033 infix 4 ~~ upto downto;
3035 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
3038 * Pure/library.ML: natural list combinators fold, fold_rev, and
3039 fold_map support linear functional transformations and nesting. For
3042 fold f [x1, ..., xN] y =
3043 y |> f x1 |> ... |> f xN
3045 (fold o fold) f [xs1, ..., xsN] y =
3046 y |> fold f xs1 |> ... |> fold f xsN
3048 fold f [x1, ..., xN] =
3051 (fold o fold) f [xs1, ..., xsN] =
3052 fold f xs1 #> ... #> fold f xsN
3054 * Pure/library.ML: the following selectors on type 'a option are
3057 the: 'a option -> 'a (*partial*)
3058 these: 'a option -> 'a where 'a = 'b list
3059 the_default: 'a -> 'a option -> 'a
3060 the_list: 'a option -> 'a list
3062 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
3063 basic operations for association lists, following natural argument
3064 order; moreover the explicit equality predicate passed here avoids
3065 potentially expensive polymorphic runtime equality checks.
3066 The old functions may be expressed as follows:
3068 assoc = uncurry (AList.lookup (op =))
3069 assocs = these oo AList.lookup (op =)
3070 overwrite = uncurry (AList.update (op =)) o swap
3072 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
3074 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
3075 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
3077 replacing make_keylist and keyfilter (occassionally used)
3080 make_keylist = AList.make
3081 keyfilter = AList.find (op =)
3083 * eq_fst and eq_snd now take explicit equality parameter, thus
3084 avoiding eqtypes. Naive rewrites:
3086 eq_fst = eq_fst (op =)
3087 eq_snd = eq_snd (op =)
3089 * Removed deprecated apl and apr (rarely used).
3092 apl (n, op) =>>= curry op n
3093 apr (op, m) =>>= fn n => op (n, m)
3095 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
3096 provides a reasonably efficient light-weight implementation of sets as
3099 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
3100 few new operations; existing lookup and update are now curried to
3101 follow natural argument order (for use with fold etc.);
3102 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
3104 * Pure/General: output via the Isabelle channels of
3105 writeln/warning/error etc. is now passed through Output.output, with a
3106 hook for arbitrary transformations depending on the print_mode
3107 (cf. Output.add_mode -- the first active mode that provides a output
3108 function wins). Already formatted output may be embedded into further
3109 text via Output.raw; the result of Pretty.string_of/str_of and derived
3110 functions (string_of_term/cterm/thm etc.) is already marked raw to
3111 accommodate easy composition of diagnostic messages etc. Programmers
3112 rarely need to care about Output.output or Output.raw at all, with
3113 some notable exceptions: Output.output is required when bypassing the
3114 standard channels (writeln etc.), or in token translations to produce
3115 properly formatted results; Output.raw is required when capturing
3116 already output material that will eventually be presented to the user
3117 a second time. For the default print mode, both Output.output and
3118 Output.raw have no effect.
3120 * Pure/General: Output.time_accumulator NAME creates an operator ('a
3121 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
3122 cumulative results are displayed at the end of a batch session.
3124 * Pure/General: File.sysify_path and File.quote_sysify path have been
3125 replaced by File.platform_path and File.shell_path (with appropriate
3126 hooks). This provides a clean interface for unusual systems where the
3127 internal and external process view of file names are different.
3129 * Pure: more efficient orders for basic syntactic entities: added
3130 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
3131 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
3132 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
3133 orders now -- potential INCOMPATIBILITY for code that depends on a
3134 particular order for Symtab.keys, Symtab.dest, etc. (consider using
3135 Library.sort_strings on result).
3137 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
3138 fold_types traverse types/terms from left to right, observing natural
3139 argument order. Supercedes previous foldl_XXX versions, add_frees,
3140 add_vars etc. have been adapted as well: INCOMPATIBILITY.
3142 * Pure: name spaces have been refined, with significant changes of the
3143 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
3144 to extern(_table). The plain name entry path is superceded by a
3145 general 'naming' context, which also includes the 'policy' to produce
3146 a fully qualified name and external accesses of a fully qualified
3147 name; NameSpace.extend is superceded by context dependent
3148 Sign.declare_name. Several theory and proof context operations modify
3149 the naming context. Especially note Theory.restore_naming and
3150 ProofContext.restore_naming to get back to a sane state; note that
3151 Theory.add_path is no longer sufficient to recover from
3152 Theory.absolute_path in particular.
3154 * Pure: new flags short_names (default false) and unique_names
3155 (default true) for controlling output of qualified names. If
3156 short_names is set, names are printed unqualified. If unique_names is
3157 reset, the name prefix is reduced to the minimum required to achieve
3158 the original result when interning again, even if there is an overlap
3159 with earlier declarations.
3161 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
3162 now 'extend', and 'merge' gets an additional Pretty.pp argument
3163 (useful for printing error messages). INCOMPATIBILITY.
3165 * Pure: major reorganization of the theory context. Type Sign.sg and
3166 Theory.theory are now identified, referring to the universal
3167 Context.theory (see Pure/context.ML). Actual signature and theory
3168 content is managed as theory data. The old code and interfaces were
3169 spread over many files and structures; the new arrangement introduces
3170 considerable INCOMPATIBILITY to gain more clarity:
3172 Context -- theory management operations (name, identity, inclusion,
3173 parents, ancestors, merge, etc.), plus generic theory data;
3175 Sign -- logical signature and syntax operations (declaring consts,
3176 types, etc.), plus certify/read for common entities;
3178 Theory -- logical theory operations (stating axioms, definitions,
3179 oracles), plus a copy of logical signature operations (consts,
3180 types, etc.); also a few basic management operations (Theory.copy,
3183 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
3184 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
3185 for convenience -- they merely return the theory.
3187 * Pure: type Type.tsig is superceded by theory in most interfaces.
3189 * Pure: the Isar proof context type is already defined early in Pure
3190 as Context.proof (note that ProofContext.context and Proof.context are
3191 aliases, where the latter is the preferred name). This enables other
3192 Isabelle components to refer to that type even before Isar is present.
3194 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
3195 typeK, constK, axiomK, oracleK), but provide explicit operations for
3196 any of these kinds. For example, Sign.intern typeK is now
3197 Sign.intern_type, Theory.hide_space Sign.typeK is now
3198 Theory.hide_types. Also note that former
3199 Theory.hide_classes/types/consts are now
3200 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
3201 internalize their arguments! INCOMPATIBILITY.
3203 * Pure: get_thm interface (of PureThy and ProofContext) expects
3204 datatype thmref (with constructors Name and NameSelection) instead of
3205 plain string -- INCOMPATIBILITY;
3207 * Pure: cases produced by proof methods specify options, where NONE
3208 means to remove case bindings -- INCOMPATIBILITY in
3211 * Pure: the following operations retrieve axioms or theorems from a
3212 theory node or theory hierarchy, respectively:
3214 Theory.axioms_of: theory -> (string * term) list
3215 Theory.all_axioms_of: theory -> (string * term) list
3216 PureThy.thms_of: theory -> (string * thm) list
3217 PureThy.all_thms_of: theory -> (string * thm) list
3219 * Pure: print_tac now outputs the goal through the trace channel.
3221 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
3222 Reference Toplevel.debug (default false) controls detailed printing
3223 and tracing of low-level exceptions; Toplevel.profiling (default 0)
3224 controls execution profiling -- set to 1 for time and 2 for space
3225 (both increase the runtime).
3227 * Isar session: The initial use of ROOT.ML is now always timed,
3228 i.e. the log will show the actual process times, in contrast to the
3229 elapsed wall-clock time that the outer shell wrapper produces.
3231 * Simplifier: improved handling of bound variables (nameless
3232 representation, avoid allocating new strings). Simprocs that invoke
3233 the Simplifier recursively should use Simplifier.inherit_bounds to
3234 avoid local name clashes. Failure to do so produces warnings
3235 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
3236 for further details.
3238 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
3239 bindings for all theorems stored within a given theory; this may help
3240 in porting non-Isar theories to Isar ones, while keeping ML proof
3241 scripts for the time being.
3243 * ML operator HTML.with_charset specifies the charset begin used for
3244 generated HTML files. For example:
3246 HTML.with_charset "utf-8" use_thy "Hebrew";
3247 HTML.with_charset "utf-8" use_thy "Chinese";
3252 * Allow symlinks to all proper Isabelle executables (Isabelle,
3253 isabelle, isatool etc.).
3255 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
3256 isatool doc, isatool mkdir, display_drafts etc.).
3258 * isatool usedir: option -f allows specification of the ML file to be
3259 used by Isabelle; default is ROOT.ML.
3261 * New isatool version outputs the version identifier of the Isabelle
3262 distribution being used.
3264 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
3265 (containing Boolean satisfiability problems) into Isabelle/HOL
3270 New in Isabelle2004 (April 2004)
3271 --------------------------------
3275 * Provers/order.ML: new efficient reasoner for partial and linear orders.
3276 Replaces linorder.ML.
3278 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
3279 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
3280 (\<a>...\<z>), are now considered normal letters, and can therefore
3281 be used anywhere where an ASCII letter (a...zA...Z) has until
3282 now. COMPATIBILITY: This obviously changes the parsing of some
3283 terms, especially where a symbol has been used as a binder, say
3284 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
3285 as an identifier. Fix it by inserting a space around former
3286 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
3287 existing theory and ML files.
3289 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
3291 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
3292 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
3293 a normal (but invisible) letter. For multiple letter subscripts repeat
3294 \<^isub> like this: x\<^isub>1\<^isub>2.
3296 * Pure: There are now sub-/superscripts that can span more than one
3297 character. Text between \<^bsub> and \<^esub> is set in subscript in
3298 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
3299 superscript. The new control characters are not identifier parts.
3301 * Pure: Control-symbols of the form \<^raw:...> will literally print the
3302 content of "..." to the latex file instead of \isacntrl... . The "..."
3303 may consist of any printable characters excluding the end bracket >.
3305 * Pure: Using new Isar command "finalconsts" (or the ML functions
3306 Theory.add_finals or Theory.add_finals_i) it is now possible to
3307 declare constants "final", which prevents their being given a definition
3308 later. It is useful for constants whose behaviour is fixed axiomatically
3309 rather than definitionally, such as the meta-logic connectives.
3311 * Pure: 'instance' now handles general arities with general sorts
3312 (i.e. intersections of classes),
3314 * Presentation: generated HTML now uses a CSS style sheet to make layout
3315 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
3316 It can be changed to alter the colors/layout of generated pages.
3321 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
3322 cut_tac, subgoal_tac and thin_tac:
3323 - Now understand static (Isar) contexts. As a consequence, users of Isar
3324 locales are no longer forced to write Isar proof scripts.
3325 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
3327 - INCOMPATIBILITY: names of variables to be instantiated may no
3328 longer be enclosed in quotes. Instead, precede variable name with `?'.
3329 This is consistent with the instantiation attribute "where".
3331 * Attributes "where" and "of":
3332 - Now take type variables of instantiated theorem into account when reading
3333 the instantiation string. This fixes a bug that caused instantiated
3334 theorems to have too special types in some circumstances.
3335 - "where" permits explicit instantiations of type variables.
3337 * Calculation commands "moreover" and "also" no longer interfere with
3338 current facts ("this"), admitting arbitrary combinations with "then"
3342 - Goal statements involving the context element "includes" no longer
3343 generate theorems with internal delta predicates (those ending on
3344 "_axioms") in the premise.
3345 Resolve particular premise with <locale>.intro to obtain old form.
3346 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
3347 specification and "includes" elements in goal statement.
3348 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
3349 [intro?] and [elim?] (respectively) by default.
3350 - Experimental command for instantiation of locales in proof contexts:
3351 instantiate <label>[<attrs>]: <loc>
3352 Instantiates locale <loc> and adds all its theorems to the current context
3353 taking into account their attributes. Label and attrs are optional
3354 modifiers, like in theorem declarations. If present, names of
3355 instantiated theorems are qualified with <label>, and the attributes
3356 <attrs> are applied after any attributes these theorems might have already.
3357 If the locale has assumptions, a chained fact of the form
3358 "<loc> t1 ... tn" is expected from which instantiations of the parameters
3359 are derived. The command does not support old-style locales declared
3360 with "locale (open)".
3361 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
3363 * HOL: Tactic emulation methods induct_tac and case_tac understand static
3369 * Proof import: new image HOL4 contains the imported library from
3370 the HOL4 system with about 2500 theorems. It is imported by
3371 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
3372 can be used like any other Isabelle image. See
3373 HOL/Import/HOL/README for more information.
3376 - Much improved handling of linear and partial orders.
3377 Reasoners for linear and partial orders are set up for type classes
3378 "linorder" and "order" respectively, and are added to the default simpset
3379 as solvers. This means that the simplifier can build transitivity chains
3380 to solve goals from the assumptions.
3381 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
3382 of blast or auto after simplification become unnecessary because the goal
3383 is solved by simplification already.
3385 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
3386 all proved in axiomatic type classes for semirings, rings and fields.
3389 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
3390 now formalized using the Ring_and_Field theory mentioned above.
3391 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
3392 than before, because now they are set up once in a generic manner.
3393 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
3394 Look for the general versions in Ring_and_Field (and Power if they concern
3397 * Type "rat" of the rational numbers is now available in HOL-Complex.
3400 - Record types are now by default printed with their type abbreviation
3401 instead of the list of all field types. This can be configured via
3402 the reference "print_record_type_abbr".
3403 - Simproc "record_upd_simproc" for simplification of multiple updates added
3404 (not enabled by default).
3405 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
3406 EX x. x = sel r to True (not enabled by default).
3407 - Tactic "record_split_simp_tac" to split and simplify records added.
3409 * 'specification' command added, allowing for definition by
3410 specification. There is also an 'ax_specification' command that
3411 introduces the new constants axiomatically.
3413 * arith(_tac) is now able to generate counterexamples for reals as well.
3415 * HOL-Algebra: new locale "ring" for non-commutative rings.
3417 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
3418 definitions, thanks to Sava Krsti\'{c} and John Matthews.
3420 * HOL-Matrix: a first theory for matrices in HOL with an application of
3421 matrix theory to linear programming.
3423 * Unions and Intersections:
3424 The latex output syntax of UN and INT has been changed
3425 from "\Union x \in A. B" to "\Union_{x \in A} B"
3426 i.e. the index formulae has become a subscript.
3427 Similarly for "\Union x. B", and for \Inter instead of \Union.
3429 * Unions and Intersections over Intervals:
3430 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
3431 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
3432 like in normal math, and corresponding versions for < and for intersection.
3434 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
3435 lexicographic dictonary ordering has been added as "lexord".
3437 * ML: the legacy theory structures Int and List have been removed. They had
3438 conflicted with ML Basis Library structures having the same names.
3440 * 'refute' command added to search for (finite) countermodels. Only works
3441 for a fragment of HOL. The installation of an external SAT solver is
3442 highly recommended. See "HOL/Refute.thy" for details.
3444 * 'quickcheck' command: Allows to find counterexamples by evaluating
3445 formulae under an assignment of free variables to random values.
3446 In contrast to 'refute', it can deal with inductive datatypes,
3447 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
3453 * Streams now come with concatenation and are part of the HOLCF image
3457 New in Isabelle2003 (May 2003)
3458 ------------------------------
3462 * Provers/simplifier:
3464 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
3465 Assumptions are now subject to complete mutual simplification,
3466 not just from left to right. The simplifier now preserves
3467 the order of assumptions.
3469 Potential INCOMPATIBILITY:
3471 -- simp sometimes diverges where the old version did
3472 not, e.g. invoking simp on the goal
3474 [| P (f x); y = x; f x = f y |] ==> Q
3476 now gives rise to the infinite reduction sequence
3478 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
3480 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
3483 -- Tactics combining classical reasoner and simplification (such as auto)
3484 are also affected by this change, because many of them rely on
3485 simp. They may sometimes diverge as well or yield a different numbers
3486 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
3487 in case of problems. Sometimes subsequent calls to the classical
3488 reasoner will fail because a preceeding call to the simplifier too
3489 eagerly simplified the goal, e.g. deleted redundant premises.
3491 - The simplifier trace now shows the names of the applied rewrite rules
3493 - You can limit the number of recursive invocations of the simplifier
3494 during conditional rewriting (where the simplifie tries to solve the
3495 conditions before applying the rewrite rule):
3496 ML "simp_depth_limit := n"
3497 where n is an integer. Thus you can force termination where previously
3498 the simplifier would diverge.
3500 - Accepts free variables as head terms in congruence rules. Useful in Isar.
3502 - No longer aborts on failed congruence proof. Instead, the
3503 congruence is ignored.
3505 * Pure: New generic framework for extracting programs from constructive
3506 proofs. See HOL/Extraction.thy for an example instantiation, as well
3507 as HOL/Extraction for some case studies.
3509 * Pure: The main goal of the proof state is no longer shown by default, only
3510 the subgoals. This behaviour is controlled by a new flag.
3511 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
3512 (ML: Proof.show_main_goal).
3514 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
3515 rules whose conclusion matches subgoal 1:
3516 PG menu: Isabelle/Isar -> Show me -> matching rules
3517 The rules are ordered by how closely they match the subgoal.
3518 In particular, rules that solve a subgoal outright are displayed first
3519 (or rather last, the way they are printed).
3520 (ML: ProofGeneral.print_intros())
3522 * Pure: New flag trace_unify_fail causes unification to print
3523 diagnostic information (PG: in trace buffer) when it fails. This is
3524 useful for figuring out why single step proofs like rule, erule or
3527 * Pure: Locale specifications now produce predicate definitions
3528 according to the body of text (covering assumptions modulo local
3529 definitions); predicate "loc_axioms" covers newly introduced text,
3530 while "loc" is cumulative wrt. all included locale expressions; the
3531 latter view is presented only on export into the global theory
3532 context; potential INCOMPATIBILITY, use "(open)" option to fall back
3533 on the old view without predicates;
3535 * Pure: predefined locales "var" and "struct" are useful for sharing
3536 parameters (as in CASL, for example); just specify something like
3537 ``var x + var y + struct M'' as import;
3539 * Pure: improved thms_containing: proper indexing of facts instead of
3540 raw theorems; check validity of results wrt. current name space;
3541 include local facts of proof configuration (also covers active
3542 locales), cover fixed variables in index; may use "_" in term
3543 specification; an optional limit for the number of printed facts may
3544 be given (the default is 40);
3546 * Pure: disallow duplicate fact bindings within new-style theory files
3549 * Provers: improved induct method: assumptions introduced by case
3550 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
3551 the goal statement); "foo" still refers to all facts collectively;
3553 * Provers: the function blast.overloaded has been removed: all constants
3554 are regarded as potentially overloaded, which improves robustness in exchange
3555 for slight decrease in efficiency;
3557 * Provers/linorder: New generic prover for transitivity reasoning over
3558 linear orders. Note: this prover is not efficient!
3560 * Isar: preview of problems to finish 'show' now produce an error
3561 rather than just a warning (in interactive mode);
3568 - Produces a counter example if it cannot prove a goal.
3569 Note that the counter example may be spurious if the goal is not a formula
3570 of quantifier-free linear arithmetic.
3571 In ProofGeneral the counter example appears in the trace buffer.
3573 - Knows about div k and mod k where k is a numeral of type nat or int.
3575 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
3576 linear arithmetic fails. This takes account of quantifiers and divisibility.
3577 Presburger arithmetic can also be called explicitly via presburger(_tac).
3579 * simp's arithmetic capabilities have been enhanced a bit: it now
3580 takes ~= in premises into account (by performing a case split);
3582 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
3583 are distributed over a sum of terms;
3585 * New tactic "trans_tac" and method "trans" instantiate
3586 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
3589 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
3590 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
3592 * 'typedef' command has new option "open" to suppress the set
3595 * functions Min and Max on finite sets have been introduced (theory
3598 * attribute [symmetric] now works for relations as well; it turns
3599 (x,y) : R^-1 into (y,x) : R, and vice versa;
3601 * induct over a !!-quantified statement (say !!x1..xn):
3602 each "case" automatically performs "fix x1 .. xn" with exactly those names.
3604 * Map: `empty' is no longer a constant but a syntactic abbreviation for
3605 %x. None. Warning: empty_def now refers to the previously hidden definition
3608 * Algebra: formalization of classical algebra. Intended as base for
3609 any algebraic development in Isabelle. Currently covers group theory
3610 (up to Sylow's theorem) and ring theory (Universal Property of
3611 Univariate Polynomials). Contributions welcome;
3613 * GroupTheory: deleted, since its material has been moved to Algebra;
3615 * Complex: new directory of the complex numbers with numeric constants,
3616 nonstandard complex numbers, and some complex analysis, standard and
3617 nonstandard (Jacques Fleuriot);
3619 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
3621 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
3624 * Real/HahnBanach: updated and adapted to locales;
3626 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
3629 * UNITY: added the Meier-Sanders theory of progress sets;
3631 * MicroJava: bytecode verifier and lightweight bytecode verifier
3632 as abstract algorithms, instantiated to the JVM;
3634 * Bali: Java source language formalization. Type system, operational
3635 semantics, axiomatic semantics. Supported language features:
3636 classes, interfaces, objects,virtual methods, static methods,
3637 static/instance fields, arrays, access modifiers, definite
3638 assignment, exceptions.
3643 * ZF/Constructible: consistency proof for AC (Gdel's constructible
3646 * Main ZF: virtually all theories converted to new-style format;
3651 * Pure: Tactic.prove provides sane interface for internal proofs;
3652 omits the infamous "standard" operation, so this is more appropriate
3653 than prove_goalw_cterm in many situations (e.g. in simprocs);
3655 * Pure: improved error reporting of simprocs;
3657 * Provers: Simplifier.simproc(_i) provides sane interface for setting
3661 *** Document preparation ***
3663 * uses \par instead of \\ for line breaks in theory text. This may
3664 shift some page breaks in large documents. To get the old behaviour
3665 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
3667 * minimized dependencies of isabelle.sty and isabellesym.sty on
3670 * \<euro> now needs package babel/greek instead of marvosym (which
3673 * normal size for \<zero>...\<nine> (uses \mathbf instead of
3678 New in Isabelle2002 (March 2002)
3679 --------------------------------
3681 *** Document preparation ***
3683 * greatly simplified document preparation setup, including more
3684 graceful interpretation of isatool usedir -i/-d/-D options, and more
3685 instructive isatool mkdir; users should basically be able to get
3686 started with "isatool mkdir HOL Test && isatool make"; alternatively,
3687 users may run a separate document processing stage manually like this:
3688 "isatool usedir -D output HOL Test && isatool document Test/output";
3690 * theory dependency graph may now be incorporated into documents;
3691 isatool usedir -g true will produce session_graph.eps/.pdf for use
3692 with \includegraphics of LaTeX;
3694 * proper spacing of consecutive markup elements, especially text
3695 blocks after section headings;
3697 * support bold style (for single symbols only), input syntax is like
3698 this: "\<^bold>\<alpha>" or "\<^bold>A";
3700 * \<bullet> is now output as bold \cdot by default, which looks much
3701 better in printed text;
3703 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
3704 note that these symbols are currently unavailable in Proof General /
3705 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
3707 * isatool latex no longer depends on changed TEXINPUTS, instead
3708 isatool document copies the Isabelle style files to the target
3714 * Pure/Provers: improved proof by cases and induction;
3715 - 'case' command admits impromptu naming of parameters (such as
3717 - 'induct' method divinates rule instantiation from the inductive
3718 claim; no longer requires excessive ?P bindings for proper
3719 instantiation of cases;
3720 - 'induct' method properly enumerates all possibilities of set/type
3721 rules; as a consequence facts may be also passed through *type*
3722 rules without further ado;
3723 - 'induct' method now derives symbolic cases from the *rulified*
3724 rule (before it used to rulify cases stemming from the internal
3725 atomized version); this means that the context of a non-atomic
3726 statement becomes is included in the hypothesis, avoiding the
3727 slightly cumbersome show "PROP ?case" form;
3728 - 'induct' may now use elim-style induction rules without chaining
3729 facts, using ``missing'' premises from the goal state; this allows
3730 rules stemming from inductive sets to be applied in unstructured
3731 scripts, while still benefitting from proper handling of non-atomic
3732 statements; NB: major inductive premises need to be put first, all
3733 the rest of the goal is passed through the induction;
3734 - 'induct' proper support for mutual induction involving non-atomic
3735 rule statements (uses the new concept of simultaneous goals, see
3737 - append all possible rule selections, but only use the first
3738 success (no backtracking);
3739 - removed obsolete "(simplified)" and "(stripped)" options of methods;
3740 - undeclared rule case names default to numbers 1, 2, 3, ...;
3741 - added 'print_induct_rules' (covered by help item in recent Proof
3743 - moved induct/cases attributes to Pure, methods to Provers;
3744 - generic method setup instantiated for FOL and HOL;
3746 * Pure: support multiple simultaneous goal statements, for example
3747 "have a: A and b: B" (same for 'theorem' etc.); being a pure
3748 meta-level mechanism, this acts as if several individual goals had
3749 been stated separately; in particular common proof methods need to be
3750 repeated in order to cover all claims; note that a single elimination
3751 step is *not* sufficient to establish the two conjunctions, so this
3754 assume "A & B" then have A and B .. (*".." fails*)
3756 better use "obtain" in situations as above; alternative refer to
3757 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
3759 * Pure: proper integration with ``locales''; unlike the original
3760 version by Florian Kammller, Isar locales package high-level proof
3761 contexts rather than raw logical ones (e.g. we admit to include
3762 attributes everywhere); operations on locales include merge and
3763 rename; support for implicit arguments (``structures''); simultaneous
3764 type-inference over imports and text; see also HOL/ex/Locales.thy for
3767 * Pure: the following commands have been ``localized'', supporting a
3768 target locale specification "(in name)": 'lemma', 'theorem',
3769 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
3770 stored both within the locale and at the theory level (exported and
3771 qualified by the locale name);
3773 * Pure: theory goals may now be specified in ``long'' form, with
3774 ad-hoc contexts consisting of arbitrary locale elements. for example
3775 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
3776 definitions may be given, too); the result is a meta-level rule with
3777 the context elements being discharged in the obvious way;
3779 * Pure: new proof command 'using' allows to augment currently used
3780 facts after a goal statement ('using' is syntactically analogous to
3781 'apply', but acts on the goal's facts only); this allows chained facts
3782 to be separated into parts given before and after a claim, as in
3783 ``from a and b have C using d and e <proof>'';
3785 * Pure: renamed "antecedent" case to "rule_context";
3787 * Pure: new 'judgment' command records explicit information about the
3788 object-logic embedding (used by several tools internally); no longer
3789 use hard-wired "Trueprop";
3791 * Pure: added 'corollary' command;
3793 * Pure: fixed 'token_translation' command;
3795 * Pure: removed obsolete 'exported' attribute;
3797 * Pure: dummy pattern "_" in is/let is now automatically lifted over
3798 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
3799 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
3801 * Pure: method 'atomize' presents local goal premises as object-level
3802 statements (atomic meta-level propositions); setup controlled via
3803 rewrite rules declarations of 'atomize' attribute; example
3804 application: 'induct' method with proper rule statements in improper
3807 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
3808 now consider the syntactic context of assumptions, giving a better
3809 chance to get type-inference of the arguments right (this is
3810 especially important for locales);
3812 * Pure: "sorry" no longer requires quick_and_dirty in interactive
3815 * Pure/obtain: the formal conclusion "thesis", being marked as
3816 ``internal'', may no longer be reference directly in the text;
3817 potential INCOMPATIBILITY, may need to use "?thesis" in rare
3820 * Pure: generic 'sym' attribute which declares a rule both as pure
3821 'elim?' and for the 'symmetric' operation;
3823 * Pure: marginal comments ``--'' may now occur just anywhere in the
3824 text; the fixed correlation with particular command syntax has been
3827 * Pure: new method 'rules' is particularly well-suited for proof
3828 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
3829 but often produces more compact proof terms with less detours;
3831 * Pure/Provers/classical: simplified integration with pure rule
3832 attributes and methods; the classical "intro?/elim?/dest?"
3833 declarations coincide with the pure ones; the "rule" method no longer
3834 includes classically swapped intros; "intro" and "elim" methods no
3835 longer pick rules from the context; also got rid of ML declarations
3836 AddXIs/AddXEs/AddXDs; all of this has some potential for
3839 * Provers/classical: attribute 'swapped' produces classical inversions
3840 of introduction rules;
3842 * Provers/simplifier: 'simplified' attribute may refer to explicit
3843 rules instead of full simplifier context; 'iff' attribute handles
3846 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
3848 * HOL: 'recdef' now fails on unfinished automated proofs, use
3849 "(permissive)" option to recover old behavior;
3851 * HOL: 'inductive' no longer features separate (collective) attributes
3852 for 'intros' (was found too confusing);
3854 * HOL: properly declared induction rules less_induct and
3860 * HOL: moved over to sane numeral syntax; the new policy is as
3863 - 0 and 1 are polymorphic constants, which are defined on any
3864 numeric type (nat, int, real etc.);
3866 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
3867 binary representation internally;
3869 - type nat has special constructor Suc, and generally prefers Suc 0
3870 over 1::nat and Suc (Suc 0) over 2::nat;
3872 This change may cause significant problems of INCOMPATIBILITY; here
3873 are some hints on converting existing sources:
3875 - due to the new "num" token, "-0" and "-1" etc. are now atomic
3876 entities, so expressions involving "-" (unary or binary minus) need
3877 to be spaced properly;
3879 - existing occurrences of "1" may need to be constraint "1::nat" or
3880 even replaced by Suc 0; similar for old "2";
3882 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
3884 - remove all special provisions on numerals in proofs;
3886 * HOL: simp rules nat_number expand numerals on nat to Suc/0
3887 representation (depends on bin_arith_simps in the default context);
3889 * HOL: symbolic syntax for x^2 (numeral 2);
3891 * HOL: the class of all HOL types is now called "type" rather than
3892 "term"; INCOMPATIBILITY, need to adapt references to this type class
3893 in axclass/classes, instance/arities, and (usually rare) occurrences
3894 in typings (of consts etc.); internally the class is called
3895 "HOL.type", ML programs should refer to HOLogic.typeS;
3897 * HOL/record package improvements:
3898 - new derived operations "fields" to build a partial record section,
3899 "extend" to promote a fixed record to a record scheme, and
3900 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
3901 declared as simp by default;
3902 - shared operations ("more", "fields", etc.) now need to be always
3903 qualified) --- potential INCOMPATIBILITY;
3904 - removed "make_scheme" operations (use "make" with "extend") --
3906 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
3907 - provides cases/induct rules for use with corresponding Isar
3908 methods (for concrete records, record schemes, concrete more
3909 parts, and schematic more parts -- in that order);
3910 - internal definitions directly based on a light-weight abstract
3911 theory of product types over typedef rather than datatype;
3913 * HOL: generic code generator for generating executable ML code from
3914 specifications; specific support for HOL constructs such as inductive
3915 datatypes and sets, as well as recursive functions; can be invoked
3916 via 'generate_code' theory section;
3918 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
3920 * HOL: consolidated and renamed several theories. In particular:
3921 Ord.thy has been absorbed into HOL.thy
3922 String.thy has been absorbed into List.thy
3924 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
3925 (beware of argument permutation!);
3927 * HOL: linorder_less_split superseded by linorder_cases;
3929 * HOL/List: "nodups" renamed to "distinct";
3931 * HOL: added "The" definite description operator; move Hilbert's "Eps"
3932 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
3933 - Ex_def has changed, now need to use some_eq_ex
3935 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
3936 in this (rare) case use:
3938 delSWrapper "split_all_tac"
3939 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
3941 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
3944 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
3945 Isabelle's type classes, ^ on functions and relations has too general
3946 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
3947 necessary to attach explicit type constraints;
3949 * HOL/Relation: the prefix name of the infix "O" has been changed from
3950 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
3951 renamed accordingly (eg "compI" -> "rel_compI").
3953 * HOL: syntax translations now work properly with numerals and records
3956 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
3957 of "lam" -- INCOMPATIBILITY;
3959 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
3960 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
3961 renamed "Product_Type.unit";
3963 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
3965 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
3966 the "cases" method);
3968 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
3971 * HOL/IMP: updated and converted to new-style theory format; several
3972 parts turned into readable document, with proper Isar proof texts and
3973 some explanations (by Gerwin Klein);
3975 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
3977 * HOL-Hyperreal is now a logic image;
3982 * Isar: consts/constdefs supports mixfix syntax for continuous
3985 * Isar: domain package adapted to new-style theory format, e.g. see
3988 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
3989 potential INCOMPATIBILITY; now use plain induct_tac instead of former
3990 lift.induct_tac, always use UU instead of Undef;
3992 * HOLCF/IMP: updated and converted to new-style theory;
3997 * Isar: proper integration of logic-specific tools and packages,
3998 including theory commands '(co)inductive', '(co)datatype',
3999 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
4000 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
4002 * theory Main no longer includes AC; for the Axiom of Choice, base
4003 your theory on Main_ZFC;
4005 * the integer library now covers quotients and remainders, with many
4006 laws relating division to addition, multiplication, etc.;
4008 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
4009 typeless version of the formalism;
4011 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
4014 * ZF/Induct: new directory for examples of inductive definitions,
4015 including theory Multiset for multiset orderings; converted to
4016 new-style theory format;
4018 * ZF: many new theorems about lists, ordinals, etc.;
4023 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
4024 variable proof controls level of detail: 0 = no proofs (only oracle
4025 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
4026 also ref manual for further ML interfaces;
4028 * Pure/axclass: removed obsolete ML interface
4029 goal_subclass/goal_arity;
4031 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
4032 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
4033 separate tokens, so expressions involving minus need to be spaced
4036 * Pure/syntax: support non-oriented infixes, using keyword "infix"
4037 rather than "infixl" or "infixr";
4039 * Pure/syntax: concrete syntax for dummy type variables admits genuine
4040 sort constraint specifications in type inference; e.g. "x::_::foo"
4041 ensures that the type of "x" is of sort "foo" (but not necessarily a
4044 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
4045 control output of nested => (types); the default behavior is
4048 * Pure/syntax: builtin parse translation for "_constify" turns valued
4049 tokens into AST constants;
4051 * Pure/syntax: prefer later declarations of translations and print
4052 translation functions; potential INCOMPATIBILITY: need to reverse
4053 multiple declarations for same syntax element constant;
4055 * Pure/show_hyps reset by default (in accordance to existing Isar
4058 * Provers/classical: renamed addaltern to addafter, addSaltern to
4061 * Provers/clasimp: ``iff'' declarations now handle conditional rules
4064 * system: tested support for MacOS X; should be able to get Isabelle +
4065 Proof General to work in a plain Terminal after installing Poly/ML
4066 (e.g. from the Isabelle distribution area) and GNU bash alone
4067 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
4068 support requires further installations, e.g. from
4069 http://fink.sourceforge.net/);
4071 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
4073 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
4074 of 40 MB), cf. ML_OPTIONS;
4076 * system: Proof General keywords specification is now part of the
4077 Isabelle distribution (see etc/isar-keywords.el);
4079 * system: support for persistent Proof General sessions (refrain from
4080 outdating all loaded theories on startup); user may create writable
4081 logic images like this: ``isabelle -q HOL Test'';
4083 * system: smart selection of Isabelle process versus Isabelle
4084 interface, accommodates case-insensitive file systems (e.g. HFS+); may
4085 run both "isabelle" and "Isabelle" even if file names are badly
4086 damaged (executable inspects the case of the first letter of its own
4087 name); added separate "isabelle-process" and "isabelle-interface";
4089 * system: refrain from any attempt at filtering input streams; no
4090 longer support ``8bit'' encoding of old isabelle font, instead proper
4091 iso-latin characters may now be used; the related isatools
4092 "symbolinput" and "nonascii" have disappeared as well;
4094 * system: removed old "xterm" interface (the print modes "xterm" and
4095 "xterm_color" are still available for direct use in a suitable
4100 New in Isabelle99-2 (February 2001)
4101 -----------------------------------
4103 *** Overview of INCOMPATIBILITIES ***
4105 * HOL: please note that theories in the Library and elsewhere often use the
4106 new-style (Isar) format; to refer to their theorems in an ML script you must
4107 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
4109 * HOL: inductive package no longer splits induction rule aggressively,
4110 but only as far as specified by the introductions given; the old
4111 format may be recovered via ML function complete_split_rule or attribute
4112 'split_rule (complete)';
4114 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
4115 gfp_Tarski to gfp_unfold;
4117 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
4119 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
4120 relation); infix "^^" has been renamed "``"; infix "``" has been
4121 renamed "`"; "univalent" has been renamed "single_valued";
4123 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
4126 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
4128 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
4130 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
4131 consequence, it is no longer monotonic wrt. the local goal context
4132 (which is now passed through the inductive cases);
4134 * Document preparation: renamed standard symbols \<ll> to \<lless> and
4135 \<gg> to \<ggreater>;
4138 *** Document preparation ***
4140 * \isabellestyle{NAME} selects version of Isabelle output (currently
4141 available: are "it" for near math-mode best-style output, "sl" for
4142 slanted text style, and "tt" for plain type-writer; if no
4143 \isabellestyle command is given, output is according to slanted
4146 * support sub/super scripts (for single symbols only), input syntax is
4147 like this: "A\<^sup>*" or "A\<^sup>\<star>";
4149 * some more standard symbols; see Appendix A of the system manual for
4150 the complete list of symbols defined in isabellesym.sty;
4152 * improved isabelle style files; more abstract symbol implementation
4153 (should now use \isamath{...} and \isatext{...} in custom symbol
4156 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
4157 state; Note that presentation of goal states does not conform to
4158 actual human-readable proof documents. Please do not include goal
4159 states into document output unless you really know what you are doing!
4161 * proper indentation of antiquoted output with proportional LaTeX
4164 * no_document ML operator temporarily disables LaTeX document
4167 * isatool unsymbolize tunes sources for plain ASCII communication;
4172 * Pure: Isar now suffers initial goal statements to contain unbound
4173 schematic variables (this does not conform to actual readable proof
4174 documents, due to unpredictable outcome and non-compositional proof
4175 checking); users who know what they are doing may use schematic goals
4176 for Prolog-style synthesis of proven results;
4178 * Pure: assumption method (an implicit finishing) now handles actual
4181 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
4182 initial goal, declare "that" only as Pure intro (only for single
4183 steps); the "that" rule assumption may now be involved in implicit
4184 finishing, thus ".." becomes a feasible for trivial obtains;
4186 * Pure: default proof step now includes 'intro_classes'; thus trivial
4187 instance proofs may be performed by "..";
4189 * Pure: ?thesis / ?this / "..." now work for pure meta-level
4192 * Pure: more robust selection of calculational rules;
4194 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
4195 rule (as well as the assumption rule);
4197 * Pure: 'thm_deps' command visualizes dependencies of theorems and
4198 lemmas, using the graph browser tool;
4200 * Pure: predict failure of "show" in interactive mode;
4202 * Pure: 'thms_containing' now takes actual terms as arguments;
4204 * HOL: improved method 'induct' --- now handles non-atomic goals
4205 (potential INCOMPATIBILITY); tuned error handling;
4207 * HOL: cases and induct rules now provide explicit hints about the
4208 number of facts to be consumed (0 for "type" and 1 for "set" rules);
4209 any remaining facts are inserted into the goal verbatim;
4211 * HOL: local contexts (aka cases) may now contain term bindings as
4212 well; the 'cases' and 'induct' methods new provide a ?case binding for
4213 the result to be shown in each case;
4215 * HOL: added 'recdef_tc' command;
4217 * isatool convert assists in eliminating legacy ML scripts;
4222 * HOL/Library: a collection of generic theories to be used together
4223 with main HOL; the theory loader path already includes this directory
4224 by default; the following existing theories have been moved here:
4225 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
4226 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
4228 * HOL/Unix: "Some aspects of Unix file-system security", a typical
4229 modelling and verification task performed in Isabelle/HOL +
4230 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
4232 * HOL/Algebra: special summation operator SUM no longer exists, it has
4233 been replaced by setsum; infix 'assoc' now has priority 50 (like
4234 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
4235 'domain', this makes the theory consistent with mathematical
4238 * HOL basics: added overloaded operations "inverse" and "divide"
4239 (infix "/"), syntax for generic "abs" operation, generic summation
4242 * HOL/typedef: simplified package, provide more useful rules (see also
4245 * HOL/datatype: induction rule for arbitrarily branching datatypes is
4246 now expressed as a proper nested rule (old-style tactic scripts may
4247 require atomize_strip_tac to cope with non-atomic premises);
4249 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
4250 to "split_conv" (old name still available for compatibility);
4252 * HOL: improved concrete syntax for strings (e.g. allows translation
4253 rules with string literals);
4255 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
4256 and Fleuriot's mechanization of analysis, including the transcendental
4257 functions for the reals;
4259 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
4264 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
4265 "lam" is displayed as TWO lambda-symbols
4267 * CTT: theory Main now available, containing everything (that is, Bool
4273 * Pure: the Simplifier has been implemented properly as a derived rule
4274 outside of the actual kernel (at last!); the overall performance
4275 penalty in practical applications is about 50%, while reliability of
4276 the Isabelle inference kernel has been greatly improved;
4278 * print modes "brackets" and "no_brackets" control output of nested =>
4279 (types) and ==> (props); the default behaviour is "brackets";
4281 * Provers: fast_tac (and friends) now handle actual object-logic rules
4282 as assumptions as well;
4284 * system: support Poly/ML 4.0;
4286 * system: isatool install handles KDE version 1 or 2;
4290 New in Isabelle99-1 (October 2000)
4291 ----------------------------------
4293 *** Overview of INCOMPATIBILITIES ***
4295 * HOL: simplification of natural numbers is much changed; to partly
4296 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
4297 issue the following ML commands:
4299 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
4300 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
4302 * HOL: simplification no longer dives into case-expressions; this is
4303 controlled by "t.weak_case_cong" for each datatype t;
4305 * HOL: nat_less_induct renamed to less_induct;
4307 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
4308 fixsome to patch .thy and .ML sources automatically;
4310 select_equality -> some_equality
4311 select_eq_Ex -> some_eq_ex
4312 selectI2EX -> someI2_ex
4315 select1_equality -> some1_equality
4316 Eps_sym_eq -> some_sym_eq_trivial
4317 Eps_eq -> some_eq_trivial
4319 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
4321 * HOL: removed obsolete theorem binding expand_if (refer to split_if
4324 * HOL: the recursion equations generated by 'recdef' are now called
4325 f.simps instead of f.rules;
4327 * HOL: qed_spec_mp now also handles bounded ALL as well;
4329 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
4330 sometimes be needed;
4332 * HOL: the constant for "f``x" is now "image" rather than "op ``";
4334 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
4336 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
4337 product is now "<*>" instead of "Times"; the lexicographic product is
4338 now "<*lex*>" instead of "**";
4340 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
4341 of main HOL, but was unused); better use HOL's datatype package;
4343 * HOL: removed "symbols" syntax for constant "override" of theory Map;
4344 the old syntax may be recovered as follows:
4347 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
4348 (infixl "\\<oplus>" 100)
4350 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4352 * HOL/ML: even fewer consts are declared as global (see theories Ord,
4353 Lfp, Gfp, WF); this only affects ML packages that refer to const names
4356 * HOL and ZF: syntax for quotienting wrt an equivalence relation
4357 changed from A/r to A//r;
4359 * ZF: new treatment of arithmetic (nat & int) may break some old
4362 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
4363 rulify -> rule_format, elimify -> elim_format, ...);
4365 * Isar/Provers: intro/elim/dest attributes changed; renamed
4366 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
4367 should have to change intro!! to intro? only); replaced "delrule" by
4370 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
4372 * Provers: strengthened force_tac by using new first_best_tac;
4374 * LaTeX document preparation: several changes of isabelle.sty (see
4378 *** Document preparation ***
4380 * formal comments (text blocks etc.) in new-style theories may now
4381 contain antiquotations of thm/prop/term/typ/text to be presented
4382 according to latex print mode; concrete syntax is like this:
4383 @{term[show_types] "f(x) = a + x"};
4385 * isatool mkdir provides easy setup of Isabelle session directories,
4386 including proper document sources;
4388 * generated LaTeX sources are now deleted after successful run
4389 (isatool document -c); may retain a copy somewhere else via -D option
4392 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
4393 style files, achieving self-contained LaTeX sources and simplifying
4396 * old-style theories now produce (crude) LaTeX output as well;
4398 * browser info session directories are now self-contained (may be put
4399 on WWW server seperately); improved graphs of nested sessions; removed
4400 graph for 'all sessions';
4402 * several improvements in isabelle style files; \isabellestyle{it}
4403 produces fake math mode output; \isamarkupheader is now \section by
4404 default; see lib/texinputs/isabelle.sty etc.;
4409 * Isar/Pure: local results and corresponding term bindings are now
4410 subject to Hindley-Milner polymorphism (similar to ML); this
4411 accommodates incremental type-inference very nicely;
4413 * Isar/Pure: new derived language element 'obtain' supports
4414 generalized existence reasoning;
4416 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
4417 support accumulation of results, without applying any rules yet;
4418 useful to collect intermediate results without explicit name
4419 references, and for use with transitivity rules with more than 2
4422 * Isar/Pure: scalable support for case-analysis type proofs: new
4423 'case' language element refers to local contexts symbolically, as
4424 produced by certain proof methods; internally, case names are attached
4425 to theorems as "tags";
4427 * Isar/Pure: theory command 'hide' removes declarations from
4428 class/type/const name spaces;
4430 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
4431 indicate potential overloading;
4433 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
4435 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
4436 "{a,b,c}" instead of {a,b,c};
4438 * Isar/Pure now provides its own version of intro/elim/dest
4439 attributes; useful for building new logics, but beware of confusion
4440 with the version in Provers/classical;
4442 * Isar/Pure: the local context of (non-atomic) goals is provided via
4443 case name 'antecedent';
4445 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
4446 to the current context is now done automatically);
4448 * Isar/Pure: theory command 'method_setup' provides a simple interface
4449 for definining proof methods in ML;
4451 * Isar/Provers: intro/elim/dest attributes changed; renamed
4452 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
4453 most cases, one should have to change intro!! to intro? only);
4454 replaced "delrule" by "rule del";
4456 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
4457 'symmetric' attribute (the latter supercedes [RS sym]);
4459 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
4460 method modifier); 'simp' method: 'only:' modifier removes loopers as
4461 well (including splits);
4463 * Isar/Provers: Simplifier and Classical methods now support all kind
4464 of modifiers used in the past, including 'cong', 'iff', etc.
4466 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
4467 of Simplifier and Classical reasoner);
4469 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
4470 now support named cases; major packages (inductive, datatype, primrec,
4471 recdef) support case names and properly name parameters;
4473 * Isar/HOL: new transitivity rules for substitution in inequalities --
4474 monotonicity conditions are extracted to be proven at end of
4477 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
4480 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
4481 split_if split_if_asm; datatype package provides theorems foo.splits =
4482 foo.split foo.split_asm for each datatype;
4484 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
4485 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
4486 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
4487 use "(cases (simplified))" method in proper proof texts);
4489 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
4491 * Isar: names of theorems etc. may be natural numbers as well;
4493 * Isar: 'pr' command: optional arguments for goals_limit and
4494 ProofContext.prems_limit; no longer prints theory contexts, but only
4497 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
4498 additional print modes to be specified; e.g. "pr(latex)" will print
4499 proof state according to the Isabelle LaTeX style;
4501 * Isar: improved support for emulating tactic scripts, including proof
4502 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
4503 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
4504 (for HOL datatypes);
4506 * Isar: simplified (more robust) goal selection of proof methods: 1st
4507 goal, all goals, or explicit goal specifier (tactic emulation); thus
4508 'proof method scripts' have to be in depth-first order;
4510 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
4512 * Isar: removed 'help' command, which hasn't been too helpful anyway;
4513 should instead use individual commands for printing items
4514 (print_commands, print_methods etc.);
4516 * Isar: added 'nothing' --- the empty list of theorems;
4521 * HOL/MicroJava: formalization of a fragment of Java, together with a
4522 corresponding virtual machine and a specification of its bytecode
4523 verifier and a lightweight bytecode verifier, including proofs of
4524 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
4525 Cornelia Pusch (see also the homepage of project Bali at
4526 http://isabelle.in.tum.de/Bali/);
4528 * HOL/Algebra: new theory of rings and univariate polynomials, by
4531 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
4532 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
4535 * HOL/Lattice: fundamental concepts of lattice theory and order
4536 structures, including duals, properties of bounds versus algebraic
4537 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
4538 Theorem for complete lattices etc.; may also serve as a demonstration
4539 for abstract algebraic reasoning using axiomatic type classes, and
4540 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
4542 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
4545 * HOL/IMPP: extension of IMP with local variables and mutually
4546 recursive procedures, by David von Oheimb;
4548 * HOL/Lambda: converted into new-style theory and document;
4550 * HOL/ex/Multiquote: example of multiple nested quotations and
4551 anti-quotations -- basically a generalized version of de-Bruijn
4552 representation; very useful in avoiding lifting of operations;
4554 * HOL/record: added general record equality rule to simpset; fixed
4555 select-update simplification procedure to handle extended records as
4556 well; admit "r" as field name;
4558 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
4559 other numeric types and also as the identity of groups, rings, etc.;
4561 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
4562 Types nat and int belong to this axclass;
4564 * HOL: greatly improved simplification involving numerals of type nat, int, real:
4565 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
4566 i*j + k + j*#3*i simplifies to #4*(i*j) + k
4567 two terms #m*u and #n*u are replaced by #(m+n)*u
4568 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
4569 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
4570 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
4572 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
4573 powerful prover for predicate logic but knows nothing of clasets; see
4574 ex/mesontest.ML and ex/mesontest2.ML for example applications;
4576 * HOL: new version of "case_tac" subsumes both boolean case split and
4577 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
4578 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
4580 * HOL: simplification no longer dives into case-expressions: only the
4581 selector expression is simplified, but not the remaining arms; to
4582 enable full simplification of case-expressions for datatype t, you may
4583 remove t.weak_case_cong from the simpset, either globally (Delcongs
4584 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
4586 * HOL/recdef: the recursion equations generated by 'recdef' for
4587 function 'f' are now called f.simps instead of f.rules; if all
4588 termination conditions are proved automatically, these simplification
4589 rules are added to the simpset, as in primrec; rules may be named
4590 individually as well, resulting in a separate list of theorems for
4593 * HOL/While is a new theory that provides a while-combinator. It
4594 permits the definition of tail-recursive functions without the
4595 provision of a termination measure. The latter is necessary once the
4596 invariant proof rule for while is applied.
4598 * HOL: new (overloaded) notation for the set of elements below/above
4599 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
4601 * HOL: theorems impI, allI, ballI bound as "strip";
4603 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
4604 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
4605 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
4607 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4609 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
4610 main HOL, but was unused);
4612 * HOL: fewer consts declared as global (e.g. have to refer to
4613 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
4615 * HOL: tuned AST representation of nested pairs, avoiding bogus output
4616 in case of overlap with user translations (e.g. judgements over
4617 tuples); (note that the underlying logical represenation is still
4623 * ZF: simplification automatically cancels common terms in arithmetic
4624 expressions over nat and int;
4626 * ZF: new treatment of nat to minimize type-checking: all operators
4627 coerce their operands to a natural number using the function natify,
4628 making the algebraic laws unconditional;
4630 * ZF: as above, for int: operators coerce their operands to an integer
4631 using the function intify;
4633 * ZF: the integer library now contains many of the usual laws for the
4634 orderings, including $<=, and monotonicity laws for $+ and $*;
4636 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
4639 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
4640 to the simplifier and classical reasoner simultaneously;
4645 * Provers: blast_tac now handles actual object-logic rules as
4646 assumptions; note that auto_tac uses blast_tac internally as well;
4648 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
4649 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
4651 * Provers: delrules now handles destruct rules as well (no longer need
4652 explicit make_elim);
4654 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
4655 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4656 use instead the strong form,
4657 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4658 in HOL, FOL and ZF the function cla_make_elim will create such rules
4659 from destruct-rules;
4661 * Provers: Simplifier.easy_setup provides a fast path to basic
4662 Simplifier setup for new object-logics;
4664 * Pure: AST translation rules no longer require constant head on LHS;
4666 * Pure: improved name spaces: ambiguous output is qualified; support
4667 for hiding of names;
4669 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
4670 XSYMBOL_HOME; no longer need to do manual configuration in most
4673 * system: compression of ML heaps images may now be controlled via -c
4674 option of isabelle and isatool usedir (currently only observed by
4677 * system: isatool installfonts may handle X-Symbol fonts as well (very
4678 useful for remote X11);
4680 * system: provide TAGS file for Isabelle sources;
4682 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
4685 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
4686 timing flag supersedes proof_timing and Toplevel.trace;
4688 * ML: new combinators |>> and |>>> for incremental transformations
4689 with secondary results (e.g. certain theory extensions):
4691 * ML: PureThy.add_defs gets additional argument to indicate potential
4692 overloading (usually false);
4694 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
4699 New in Isabelle99 (October 1999)
4700 --------------------------------
4702 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4704 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
4705 are no longer simplified. (This allows the simplifier to unfold recursive
4706 functional programs.) To restore the old behaviour, declare
4708 Delcongs [if_weak_cong];
4710 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
4713 * HOL: the predicate "inj" is now defined by translation to "inj_on";
4715 * HOL/datatype: mutual_induct_tac no longer exists --
4716 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
4718 * HOL/typedef: fixed type inference for representing set; type
4719 arguments now have to occur explicitly on the rhs as type constraints;
4721 * ZF: The con_defs part of an inductive definition may no longer refer
4722 to constants declared in the same theory;
4724 * HOL, ZF: the function mk_cases, generated by the inductive
4725 definition package, has lost an argument. To simplify its result, it
4726 uses the default simpset instead of a supplied list of theorems.
4728 * HOL/List: the constructors of type list are now Nil and Cons;
4730 * Simplifier: the type of the infix ML functions
4731 setSSolver addSSolver setSolver addSolver
4732 is now simpset * solver -> simpset where `solver' is a new abstract type
4733 for packaging solvers. A solver is created via
4734 mk_solver: string -> (thm list -> int -> tactic) -> solver
4735 where the string argument is only a comment.
4740 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
4741 decision procedure for linear arithmetic. Currently it is used for
4742 types `nat', `int', and `real' in HOL (see below); it can, should and
4743 will be instantiated for other types and logics as well.
4745 * The simplifier now accepts rewrite rules with flexible heads, eg
4746 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
4747 They are applied like any rule with a non-pattern lhs, i.e. by first-order
4753 * New Isabelle/Isar subsystem provides an alternative to traditional
4754 tactical theorem proving; together with the ProofGeneral/isar user
4755 interface it offers an interactive environment for developing human
4756 readable proof documents (Isar == Intelligible semi-automated
4757 reasoning); for further information see isatool doc isar-ref,
4758 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
4760 * improved and simplified presentation of theories: better HTML markup
4761 (including colors), graph views in several sizes; isatool usedir now
4762 provides a proper interface for user theories (via -P option); actual
4763 document preparation based on (PDF)LaTeX is available as well (for
4764 new-style theories only); see isatool doc system for more information;
4766 * native support for Proof General, both for classic Isabelle and
4769 * ML function thm_deps visualizes dependencies of theorems and lemmas,
4770 using the graph browser tool;
4772 * Isabelle manuals now also available as PDF;
4774 * theory loader rewritten from scratch (may not be fully
4775 bug-compatible); old loadpath variable has been replaced by show_path,
4776 add_path, del_path, reset_path functions; new operations such as
4777 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
4780 * improved isatool install: option -k creates KDE application icon,
4781 option -p DIR installs standalone binaries;
4783 * added ML_PLATFORM setting (useful for cross-platform installations);
4784 more robust handling of platform specific ML images for SML/NJ;
4786 * the settings environment is now statically scoped, i.e. it is never
4787 created again in sub-processes invoked from isabelle, isatool, or
4790 * path element specification '~~' refers to '$ISABELLE_HOME';
4792 * in locales, the "assumes" and "defines" parts may be omitted if
4795 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
4798 * new print_mode "HTML";
4800 * new flag show_tags controls display of tags of theorems (which are
4801 basically just comments that may be attached by some tools);
4803 * Isamode 2.6 requires patch to accomodate change of Isabelle font
4804 mode and goal output format:
4806 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
4808 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
4810 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
4811 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
4813 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
4815 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
4817 * function bind_thms stores lists of theorems (cf. bind_thm);
4819 * new shorthand tactics ftac, eatac, datac, fatac;
4821 * qed (and friends) now accept "" as result name; in that case the
4822 theorem is not stored, but proper checks and presentation of the
4825 * theorem database now also indexes constants "Trueprop", "all",
4826 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
4831 ** HOL arithmetic **
4833 * There are now decision procedures for linear arithmetic over nat and
4836 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
4837 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
4838 are treated as atomic; subformulae not involving type `nat' or `int'
4839 are ignored; quantified subformulae are ignored unless they are
4840 positive universal or negative existential. The tactic has to be
4841 invoked by hand and can be a little bit slow. In particular, the
4842 running time is exponential in the number of occurrences of `min' and
4843 `max', and `-' on `nat'.
4845 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
4846 (negated) (in)equalities among the premises and the conclusion into
4847 account (i.e. no compound formulae) and does not know about `min' and
4848 `max', and `-' on `nat'. It is fast and is used automatically by the
4851 NB: At the moment, these decision procedures do not cope with mixed
4852 nat/int formulae where the two parts interact, such as `m < n ==>
4855 * HOL/Numeral provides a generic theory of numerals (encoded
4856 efficiently as bit strings); setup for types nat/int/real is in place;
4857 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
4858 int, existing theories and proof scripts may require a few additional
4861 * integer division and remainder can now be performed on constant
4864 * many properties of integer multiplication, division and remainder
4867 * An interface to the Stanford Validity Checker (SVC) is available through the
4868 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
4869 are proved automatically. SVC must be installed separately, and its results
4870 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
4871 invocation of the underlying oracle). For SVC see
4872 http://verify.stanford.edu/SVC
4874 * IsaMakefile: the HOL-Real target now builds an actual image;
4879 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
4880 (in Isabelle/Isar) -- by Gertrud Bauer;
4882 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
4883 analysis for assembly languages with subtypes;
4885 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
4886 -- avoids syntactic ambiguities and treats state, transition, and
4887 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
4888 changed syntax and (many) tactics;
4890 * HOL/inductive: Now also handles more general introduction rules such
4891 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
4892 theorems are now maintained within the theory (maintained via the
4895 * HOL/datatype: Now also handles arbitrarily branching datatypes
4896 (using function types) such as
4898 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
4900 * HOL/record: record_simproc (part of the default simpset) takes care
4901 of selectors applied to updated records; record_split_tac is no longer
4902 part of the default claset; update_defs may now be removed from the
4903 simpset in many cases; COMPATIBILITY: old behavior achieved by
4905 claset_ref () := claset() addSWrapper record_split_wrapper;
4906 Delsimprocs [record_simproc]
4908 * HOL/typedef: fixed type inference for representing set; type
4909 arguments now have to occur explicitly on the rhs as type constraints;
4911 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
4912 names rather than an ML expression;
4914 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
4915 supplied later. Program schemes can be defined, such as
4916 "While B C s = (if B s then While B C (C s) else s)"
4917 where the well-founded relation can be chosen after B and C have been given.
4919 * HOL/List: the constructors of type list are now Nil and Cons;
4920 INCOMPATIBILITY: while [] and infix # syntax is still there, of
4921 course, ML tools referring to List.list.op # etc. have to be adapted;
4923 * HOL_quantifiers flag superseded by "HOL" print mode, which is
4924 disabled by default; run isabelle with option -m HOL to get back to
4925 the original Gordon/HOL-style output;
4927 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
4928 ALL x<=y. P, EX x<y. P, EX x<=y. P;
4930 * HOL basic syntax simplified (more orthogonal): all variants of
4931 All/Ex now support plain / symbolic / HOL notation; plain syntax for
4932 Eps operator is provided as well: "SOME x. P[x]";
4934 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
4936 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
4937 thus available for user theories;
4939 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
4940 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
4943 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
4944 several times and then mp;
4949 * the notation <<...>> is now available as a notation for sequences of
4952 * the simplifier is now installed
4954 * the axiom system has been generalized (thanks to Soren Heilmann)
4956 * the classical reasoner now has a default rule database
4961 * new primrec section allows primitive recursive functions to be given
4962 directly (as in HOL) over datatypes and the natural numbers;
4964 * new tactics induct_tac and exhaust_tac for induction (or case
4965 analysis) over datatypes and the natural numbers;
4967 * the datatype declaration of type T now defines the recursor T_rec;
4969 * simplification automatically does freeness reasoning for datatype
4972 * automatic type-inference, with AddTCs command to insert new
4973 type-checking rules;
4975 * datatype introduction rules are now added as Safe Introduction rules
4978 * the syntax "if P then x else y" is now available in addition to
4982 *** Internal programming interfaces ***
4984 * tuned simplifier trace output; new flag debug_simp;
4986 * structures Vartab / Termtab (instances of TableFun) offer efficient
4987 tables indexed by indexname_ord / term_ord (compatible with aconv);
4989 * AxClass.axclass_tac lost the theory argument;
4991 * tuned current_goals_markers semantics: begin / end goal avoids
4992 printing empty lines;
4994 * removed prs and prs_fn hook, which was broken because it did not
4995 include \n in its semantics, forcing writeln to add one
4996 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
4997 string -> unit if you really want to output text without newline;
4999 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
5000 plain output, interface builders may have to enable 'isabelle_font'
5001 mode to get Isabelle font glyphs as before;
5003 * refined token_translation interface; INCOMPATIBILITY: output length
5004 now of type real instead of int;
5006 * theory loader actions may be traced via new ThyInfo.add_hook
5007 interface (see src/Pure/Thy/thy_info.ML); example application: keep
5008 your own database of information attached to *whole* theories -- as
5009 opposed to intra-theory data slots offered via TheoryDataFun;
5011 * proper handling of dangling sort hypotheses (at last!);
5012 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
5013 extra sort hypotheses that can be witnessed from the type signature;
5014 the force_strip_shyps flag is gone, any remaining shyps are simply
5015 left in the theorem (with a warning issued by strip_shyps_warning);
5019 New in Isabelle98-1 (October 1998)
5020 ----------------------------------
5022 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5024 * several changes of automated proof tools;
5026 * HOL: major changes to the inductive and datatype packages, including
5027 some minor incompatibilities of theory syntax;
5029 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
5032 * HOL: removed duplicate thms in Arith:
5033 less_imp_add_less should be replaced by trans_less_add1
5034 le_imp_add_le should be replaced by trans_le_add1
5036 * HOL: unary minus is now overloaded (new type constraints may be
5039 * HOL and ZF: unary minus for integers is now #- instead of #~. In
5040 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
5041 now taken as an integer constant.
5043 * Pure: ML function 'theory_of' renamed to 'theory';
5049 1. Asm_full_simp_tac is now more aggressive.
5050 1. It will sometimes reorient premises if that increases their power to
5052 2. It does no longer proceed strictly from left to right but may also
5053 rotate premises to achieve further simplification.
5054 For compatibility reasons there is now Asm_lr_simp_tac which is like the
5055 old Asm_full_simp_tac in that it does not rotate premises.
5056 2. The simplifier now knows a little bit about nat-arithmetic.
5058 * Classical reasoner: wrapper mechanism for the classical reasoner now
5059 allows for selected deletion of wrappers, by introduction of names for
5060 wrapper functionals. This implies that addbefore, addSbefore,
5061 addaltern, and addSaltern now take a pair (name, tactic) as argument,
5062 and that adding two tactics with the same name overwrites the first
5063 one (emitting a warning).
5064 type wrapper = (int -> tactic) -> (int -> tactic)
5065 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
5066 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
5067 delWrapper, delSWrapper: claset * string -> claset
5068 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
5070 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
5071 semantics; addbefore now affects only the unsafe part of step_tac
5072 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
5073 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
5076 * Classical reasoner: setwrapper to setWrapper and compwrapper to
5077 compWrapper; added safe wrapper (and access functions for it);
5079 * HOL/split_all_tac is now much faster and fails if there is nothing
5080 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
5081 and the names of the automatically generated variables have changed.
5082 split_all_tac has moved within claset() from unsafe wrappers to safe
5083 wrappers, which means that !!-bound variables are split much more
5084 aggressively, and safe_tac and clarify_tac now split such variables.
5085 If this splitting is not appropriate, use delSWrapper "split_all_tac".
5086 Note: the same holds for record_split_tac, which does the job of
5087 split_all_tac for record fields.
5089 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
5090 permanently to the default simpset using Addsplits just like
5091 Addsimps. They can be removed via Delsplits just like
5092 Delsimps. Lower-case versions are also available.
5094 * HOL/Simplifier: The rule split_if is now part of the default
5095 simpset. This means that the simplifier will eliminate all occurrences
5096 of if-then-else in the conclusion of a goal. To prevent this, you can
5097 either remove split_if completely from the default simpset by
5098 `Delsplits [split_if]' or remove it in a specific call of the
5099 simplifier using `... delsplits [split_if]'. You can also add/delete
5100 other case splitting rules to/from the default simpset: every datatype
5101 generates suitable rules `split_t_case' and `split_t_case_asm' (where
5102 t is the name of the datatype).
5104 * Classical reasoner / Simplifier combination: new force_tac (and
5105 derivatives Force_tac, force) combines rewriting and classical
5106 reasoning (and whatever other tools) similarly to auto_tac, but is
5107 aimed to solve the given subgoal completely.
5112 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
5113 and `goalw': the theory is no longer needed as an explicit argument -
5114 the current theory context is used; assumptions are no longer returned
5115 at the ML-level unless one of them starts with ==> or !!; it is
5116 recommended to convert to these new commands using isatool fixgoal
5117 (backup your sources first!);
5119 * new top-level commands 'thm' and 'thms' for retrieving theorems from
5120 the current theory context, and 'theory' to lookup stored theories;
5122 * new theory section 'locale' for declaring constants, assumptions and
5123 definitions that have local scope;
5125 * new theory section 'nonterminals' for purely syntactic types;
5127 * new theory section 'setup' for generic ML setup functions
5128 (e.g. package initialization);
5130 * the distribution now includes Isabelle icons: see
5131 lib/logo/isabelle-{small,tiny}.xpm;
5133 * isatool install - install binaries with absolute references to
5136 * isatool logo -- create instances of the Isabelle logo (as EPS);
5138 * print mode 'emacs' reserved for Isamode;
5140 * support multiple print (ast) translations per constant name;
5142 * theorems involving oracles are now printed with a suffixed [!];
5147 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
5149 * HOL/inductive package reorganized and improved: now supports mutual
5155 oddI "n : EVEN ==> Suc n : ODD"
5156 evenI "n : ODD ==> Suc n : EVEN"
5158 new theorem list "elims" contains an elimination rule for each of the
5159 recursive sets; inductive definitions now handle disjunctive premises
5160 correctly (also ZF);
5162 INCOMPATIBILITIES: requires Inductive as an ancestor; component
5163 "mutual_induct" no longer exists - the induction rule is always
5164 contained in "induct";
5167 * HOL/datatype package re-implemented and greatly improved: now
5168 supports mutually recursive datatypes such as
5171 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
5172 | SUM ('a aexp) ('a aexp)
5173 | DIFF ('a aexp) ('a aexp)
5176 'a bexp = LESS ('a aexp) ('a aexp)
5177 | AND ('a bexp) ('a bexp)
5178 | OR ('a bexp) ('a bexp)
5180 as well as indirectly recursive datatypes such as
5183 ('a, 'b) term = Var 'a
5184 | App 'b ((('a, 'b) term) list)
5186 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
5187 induction on mutually / indirectly recursive datatypes.
5189 Primrec equations are now stored in theory and can be accessed via
5190 <function_name>.simps.
5194 - Theories using datatypes must now have theory Datatype as an
5196 - The specific <typename>.induct_tac no longer exists - use the
5197 generic induct_tac instead.
5198 - natE has been renamed to nat.exhaust - use exhaust_tac
5199 instead of res_inst_tac ... natE. Note that the variable
5200 names in nat.exhaust differ from the names in natE, this
5201 may cause some "fragile" proofs to fail.
5202 - The theorems split_<typename>_case and split_<typename>_case_asm
5203 have been renamed to <typename>.split and <typename>.split_asm.
5204 - Since default sorts of type variables are now handled correctly,
5205 some datatype definitions may have to be annotated with explicit
5207 - Primrec definitions no longer require function name and type
5208 of recursive argument.
5210 Consider using isatool fixdatatype to adapt your theories and proof
5211 scripts to the new package (backup your sources first!).
5214 * HOL/record package: considerably improved implementation; now
5215 includes concrete syntax for record types, terms, updates; theorems
5216 for surjective pairing and splitting !!-bound record variables; proof
5217 support is as follows:
5219 1) standard conversions (selectors or updates applied to record
5220 constructor terms) are part of the standard simpset;
5222 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
5223 made part of standard simpset and claset via addIffs;
5225 3) a tactic for record field splitting (record_split_tac) is part of
5226 the standard claset (addSWrapper);
5228 To get a better idea about these rules you may retrieve them via
5229 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
5230 the name of your record type.
5232 The split tactic 3) conceptually simplifies by the following rule:
5234 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
5236 Thus any record variable that is bound by meta-all will automatically
5237 blow up into some record constructor term, consequently the
5238 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
5239 solve record problems automatically.
5242 * reorganized the main HOL image: HOL/Integ and String loaded by
5243 default; theory Main includes everything;
5245 * automatic simplification of integer sums and comparisons, using cancellation;
5247 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
5249 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
5251 * many new identities for unions, intersections, set difference, etc.;
5253 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
5254 called split_if, split_split, split_sum_case and split_nat_case (to go
5255 with add/delsplits);
5257 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
5258 (?x::unit) = (); this is made part of the default simpset, which COULD
5259 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
5260 'Delsimprocs [unit_eq_proc];' as last resort); also note that
5261 unit_abs_eta_conv is added in order to counter the effect of
5262 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
5265 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
5268 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5269 It and 'sym RS equals0D' are now in the default claset, giving automatic
5270 disjointness reasoning but breaking a few old proofs.
5272 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
5273 to 'converse' from 'inverse' (for compatibility with ZF and some
5276 * HOL/recdef can now declare non-recursive functions, with {} supplied as
5277 the well-founded relation;
5279 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
5280 Compl A. The "Compl" syntax remains available as input syntax for this
5283 * HOL/Update: new theory of function updates:
5284 f(a:=b) == %x. if x=a then b else f x
5285 may also be iterated as in f(a:=b,c:=d,...);
5287 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
5290 - new function list_update written xs[i:=v] that updates the i-th
5291 list position. May also be iterated as in xs[i:=a,j:=b,...].
5292 - new function `upt' written [i..j(] which generates the list
5293 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
5294 bound write [i..j], which is a shorthand for [i..j+1(].
5295 - new lexicographic orderings and corresponding wellfoundedness theorems.
5298 - removed 'pred' (predecessor) function;
5299 - generalized some theorems about n-1;
5300 - many new laws about "div" and "mod";
5301 - new laws about greatest common divisors (see theory ex/Primes);
5303 * HOL/Relation: renamed the relational operator r^-1 "converse"
5304 instead of "inverse";
5306 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
5307 of the multiset ordering;
5309 * directory HOL/Real: a construction of the reals using Dedekind cuts
5310 (not included by default);
5312 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
5314 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
5315 programs, i.e. different program variables may have different types.
5317 * calling (stac rew i) now fails if "rew" has no effect on the goal
5318 [previously, this check worked only if the rewrite rule was unconditional]
5319 Now rew can involve either definitions or equalities (either == or =).
5324 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
5325 only the theorems proved on ZF.ML;
5327 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5328 It and 'sym RS equals0D' are now in the default claset, giving automatic
5329 disjointness reasoning but breaking a few old proofs.
5331 * ZF/Update: new theory of function updates
5332 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
5333 may also be iterated as in f(a:=b,c:=d,...);
5335 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
5337 * calling (stac rew i) now fails if "rew" has no effect on the goal
5338 [previously, this check worked only if the rewrite rule was unconditional]
5339 Now rew can involve either definitions or equalities (either == or =).
5341 * case_tac provided for compatibility with HOL
5342 (like the old excluded_middle_tac, but with subgoals swapped)
5345 *** Internal programming interfaces ***
5347 * Pure: several new basic modules made available for general use, see
5348 also src/Pure/README;
5350 * improved the theory data mechanism to support encapsulation (data
5351 kind name replaced by private Object.kind, acting as authorization
5352 key); new type-safe user interface via functor TheoryDataFun; generic
5353 print_data function becomes basically useless;
5355 * removed global_names compatibility flag -- all theory declarations
5356 are qualified by default;
5358 * module Pure/Syntax now offers quote / antiquote translation
5359 functions (useful for Hoare logic etc. with implicit dependencies);
5360 see HOL/ex/Antiquote for an example use;
5362 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
5365 * new tactical CHANGED_GOAL for checking that a tactic modifies a
5368 * Display.print_goals function moved to Locale.print_goals;
5370 * standard print function for goals supports current_goals_markers
5371 variable for marking begin of proof, end of proof, start of goal; the
5372 default is ("", "", ""); setting current_goals_markers := ("<proof>",
5373 "</proof>", "<goal>") causes SGML like tagged proof state printing,
5378 New in Isabelle98 (January 1998)
5379 --------------------------------
5381 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5383 * changed lexical syntax of terms / types: dots made part of long
5384 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
5386 * simpset (and claset) reference variable replaced by functions
5387 simpset / simpset_ref;
5389 * no longer supports theory aliases (via merge) and non-trivial
5390 implicit merge of thms' signatures;
5392 * most internal names of constants changed due to qualified names;
5394 * changed Pure/Sequence interface (see Pure/seq.ML);
5397 *** General Changes ***
5399 * hierachically structured name spaces (for consts, types, axms, thms
5400 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
5401 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
5402 isatool fixdots ensures space after dots (e.g. "%x. x"); set
5403 long_names for fully qualified output names; NOTE: ML programs
5404 (special tactics, packages etc.) referring to internal names may have
5405 to be adapted to cope with fully qualified names; in case of severe
5406 backward campatibility problems try setting 'global_names' at compile
5407 time to have enrything declared within a flat name space; one may also
5408 fine tune name declarations in theories via the 'global' and 'local'
5411 * reimplemented the implicit simpset and claset using the new anytype
5412 data filed in signatures; references simpset:simpset ref etc. are
5413 replaced by functions simpset:unit->simpset and
5414 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
5415 to patch your ML files accordingly;
5417 * HTML output now includes theory graph data for display with Java
5418 applet or isatool browser; data generated automatically via isatool
5419 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
5421 * defs may now be conditional; improved rewrite_goals_tac to handle
5422 conditional equations;
5424 * defs now admits additional type arguments, using TYPE('a) syntax;
5426 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
5427 creates a new theory node; implicit merge of thms' signatures is
5428 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
5429 transfer:theory->thm->thm in (rare) cases;
5431 * improved handling of draft signatures / theories; draft thms (and
5432 ctyps, cterms) are automatically promoted to real ones;
5434 * slightly changed interfaces for oracles: admit many per theory, named
5435 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
5437 * print_goals: optional output of const types (set show_consts and
5440 * improved output of warnings (###) and errors (***);
5442 * subgoal_tac displays a warning if the new subgoal has type variables;
5444 * removed old README and Makefiles;
5446 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
5448 * removed obsolete init_pps and init_database;
5450 * deleted the obsolete tactical STATE, which was declared by
5451 fun STATE tacfun st = tacfun st st;
5453 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
5454 (which abbreviates $HOME);
5456 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
5457 use isatool fixseq to adapt your ML programs (this works for fully
5458 qualified references to the Sequence structure only!);
5460 * use_thy no longer requires writable current directory; it always
5461 reloads .ML *and* .thy file, if either one is out of date;
5464 *** Classical Reasoner ***
5466 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
5467 tactics that use classical reasoning to simplify a subgoal without
5468 splitting it into several subgoals;
5470 * Safe_tac: like safe_tac but uses the default claset;
5475 * added simplification meta rules:
5476 (asm_)(full_)simplify: simpset -> thm -> thm;
5478 * simplifier.ML no longer part of Pure -- has to be loaded by object
5481 * added prems argument to simplification procedures;
5483 * HOL, FOL, ZF: added infix function `addsplits':
5484 instead of `<simpset> setloop (split_tac <thms>)'
5485 you can simply write `<simpset> addsplits <thms>'
5490 * TYPE('a) syntax for type reflection terms;
5492 * no longer handles consts with name "" -- declare as 'syntax' instead;
5494 * pretty printer: changed order of mixfix annotation preference (again!);
5496 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
5501 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
5502 with `addloop' of the simplifier to faciliate case splitting in premises.
5504 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
5506 * HOL/Auth: new protocol proofs including some for the Internet
5509 * HOL/Map: new theory of `maps' a la VDM;
5511 * HOL/simplifier: simplification procedures nat_cancel_sums for
5512 cancelling out common nat summands from =, <, <= (in)equalities, or
5513 differences; simplification procedures nat_cancel_factor for
5514 cancelling common factor from =, <, <= (in)equalities over natural
5515 sums; nat_cancel contains both kinds of procedures, it is installed by
5516 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
5518 * HOL/simplifier: terms of the form
5519 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
5521 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
5522 and those of the form
5523 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
5525 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
5528 Each datatype `t' now comes with a theorem `split_t_case' of the form
5530 P(t_case f1 ... fn x) =
5531 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
5533 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
5536 and a theorem `split_t_case_asm' of the form
5538 P(t_case f1 ... fn x) =
5539 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
5541 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
5543 which can be added to a simpset via `addsplits'. The existing theorems
5544 expand_list_case and expand_option_case have been renamed to
5545 split_list_case and split_option_case.
5548 - `pred n' is automatically converted to `n-1'.
5549 Users are strongly encouraged not to use `pred' any longer,
5550 because it will disappear altogether at some point.
5551 - Users are strongly encouraged to write "0 < n" rather than
5552 "n ~= 0". Theorems and proof tools have been modified towards this
5556 the function "set_of_list" has been renamed "set" (and its theorems too);
5557 the function "nth" now takes its arguments in the reverse order and
5558 has acquired the infix notation "!" as in "xs!n".
5560 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
5562 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
5563 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
5565 * HOL/record: extensible records with schematic structural subtyping
5566 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
5567 still lacks various theorems and concrete record syntax;
5572 * removed "axioms" and "generated by" sections;
5574 * replaced "ops" section by extended "consts" section, which is capable of
5575 handling the continuous function space "->" directly;
5578 . proves theorems immediately and stores them in the theory,
5579 . creates hierachical name space,
5580 . now uses normal mixfix annotations (instead of cinfix...),
5581 . minor changes to some names and values (for consistency),
5582 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
5583 . separator between mutual domain defs: changed "," to "and",
5584 . improved handling of sort constraints; now they have to
5585 appear on the left-hand side of the equations only;
5587 * fixed LAM <x,y,zs>.b syntax;
5589 * added extended adm_tac to simplifier in HOLCF -- can now discharge
5590 adm (%x. P (t x)), where P is chainfinite and t continuous;
5595 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
5596 with `addloop' of the simplifier to faciliate case splitting in premises.
5598 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
5599 in HOL, they strip ALL and --> from proved theorems;
5603 New in Isabelle94-8 (May 1997)
5604 ------------------------------
5606 *** General Changes ***
5608 * new utilities to build / run / maintain Isabelle etc. (in parts
5609 still somewhat experimental); old Makefiles etc. still functional;
5611 * new 'Isabelle System Manual';
5613 * INSTALL text, together with ./configure and ./build scripts;
5615 * reimplemented type inference for greater efficiency, better error
5616 messages and clean internal interface;
5618 * prlim command for dealing with lots of subgoals (an easier way of
5619 setting goals_limit);
5624 * supports alternative (named) syntax tables (parser and pretty
5625 printer); internal interface is provided by add_modesyntax(_i);
5627 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
5628 be used in conjunction with the Isabelle symbol font; uses the
5629 "symbols" syntax table;
5631 * added token_translation interface (may translate name tokens in
5632 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
5633 the current print_mode); IMPORTANT: user print translation functions
5634 are responsible for marking newly introduced bounds
5635 (Syntax.mark_boundT);
5637 * token translations for modes "xterm" and "xterm_color" that display
5638 names in bold, underline etc. or colors (which requires a color
5641 * infixes may now be declared with names independent of their syntax;
5643 * added typed_print_translation (like print_translation, but may
5644 access type of constant);
5647 *** Classical Reasoner ***
5649 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
5650 some limitations. Blast_tac...
5651 + ignores addss, addbefore, addafter; this restriction is intrinsic
5652 + ignores elimination rules that don't have the correct format
5653 (the conclusion MUST be a formula variable)
5654 + ignores types, which can make HOL proofs fail
5655 + rules must not require higher-order unification, e.g. apply_type in ZF
5656 [message "Function Var's argument not a bound variable" relates to this]
5657 + its proof strategy is more general but can actually be slower
5659 * substitution with equality assumptions no longer permutes other
5662 * minor changes in semantics of addafter (now called addaltern); renamed
5663 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
5664 (and access functions for it);
5666 * improved combination of classical reasoner and simplifier:
5667 + functions for handling clasimpsets
5668 + improvement of addss: now the simplifier is called _after_ the
5670 + safe variant of addss called addSss: uses safe simplifications
5671 _during_ the safe steps. It is more complete as it allows multiple
5672 instantiations of unknowns (e.g. with slow_tac).
5676 * added interface for simplification procedures (functions that
5677 produce *proven* rewrite rules on the fly, depending on current
5680 * ordering on terms as parameter (used for ordered rewriting);
5682 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
5684 * the solver is now split into a safe and an unsafe part.
5685 This should be invisible for the normal user, except that the
5686 functions setsolver and addsolver have been renamed to setSolver and
5687 addSolver; added safe_asm_full_simp_tac;
5692 * a generic induction tactic `induct_tac' which works for all datatypes and
5693 also for type `nat';
5695 * a generic case distinction tactic `exhaust_tac' which works for all
5696 datatypes and also for type `nat';
5698 * each datatype comes with a function `size';
5700 * patterns in case expressions allow tuple patterns as arguments to
5701 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
5703 * primrec now also works with type nat;
5705 * recdef: a new declaration form, allows general recursive functions to be
5706 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
5708 * the constant for negation has been renamed from "not" to "Not" to
5709 harmonize with FOL, ZF, LK, etc.;
5711 * HOL/ex/LFilter theory of a corecursive "filter" functional for
5714 * HOL/Modelcheck demonstrates invocation of model checker oracle;
5716 * HOL/ex/Ring.thy declares cring_simp, which solves equational
5717 problems in commutative rings, using axiomatic type classes for + and *;
5719 * more examples in HOL/MiniML and HOL/Auth;
5721 * more default rewrite rules for quantifiers, union/intersection;
5723 * a new constant `arbitrary == @x.False';
5725 * HOLCF/IOA replaces old HOL/IOA;
5727 * HOLCF changes: derived all rules and arities
5728 + axiomatic type classes instead of classes
5729 + typedef instead of faking type definitions
5730 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
5731 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
5732 + eliminated the types void, one, tr
5733 + use unit lift and bool lift (with translations) instead of one and tr
5734 + eliminated blift from Lift3.thy (use Def instead of blift)
5735 all eliminated rules are derived as theorems --> no visible changes ;
5740 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
5741 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
5742 as ZF_cs addSIs [equalityI];
5746 New in Isabelle94-7 (November 96)
5747 ---------------------------------
5749 * allowing negative levels (as offsets) in prlev and choplev;
5751 * super-linear speedup for large simplifications;
5753 * FOL, ZF and HOL now use miniscoping: rewriting pushes
5754 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
5755 FAIL); can suppress it using the command Delsimps (ex_simps @
5756 all_simps); De Morgan laws are also now included, by default;
5758 * improved printing of ==> : ~:
5760 * new object-logic "Sequents" adds linear logic, while replacing LK
5761 and Modal (thanks to Sara Kalvala);
5763 * HOL/Auth: correctness proofs for authentication protocols;
5765 * HOL: new auto_tac combines rewriting and classical reasoning (many
5766 examples on HOL/Auth);
5768 * HOL: new command AddIffs for declaring theorems of the form P=Q to
5769 the rewriter and classical reasoner simultaneously;
5771 * function uresult no longer returns theorems in "standard" format;
5772 regain previous version by: val uresult = standard o uresult;
5779 * oracles -- these establish an interface between Isabelle and trusted
5780 external reasoners, which may deliver results as theorems;
5782 * proof objects (in particular record all uses of oracles);
5784 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
5786 * "constdefs" section in theory files;
5788 * "primrec" section (HOL) no longer requires names;
5790 * internal type "tactic" now simply "thm -> thm Sequence.seq";
5797 * reduced space requirements;
5799 * automatic HTML generation from theories;
5801 * theory files no longer require "..." (quotes) around most types;
5803 * new examples, including two proofs of the Church-Rosser theorem;
5805 * non-curried (1994) version of HOL is no longer distributed;
5812 * greatly reduced space requirements;
5814 * theory files (.thy) no longer require \...\ escapes at line breaks;
5816 * searchable theorem database (see the section "Retrieving theorems" on
5817 page 8 of the Reference Manual);
5819 * new examples, including Grabczewski's monumental case study of the
5822 * The previous version of HOL renamed to Old_HOL;
5824 * The new version of HOL (previously called CHOL) uses a curried syntax
5825 for functions. Application looks like f a b instead of f(a,b);
5827 * Mutually recursive inductive definitions finally work in HOL;
5829 * In ZF, pattern-matching on tuples is now available in all abstractions and
5830 translates to the operator "split";
5837 * new infix operator, addss, allowing the classical reasoner to
5838 perform simplification at each step of its search. Example:
5839 fast_tac (cs addss ss)
5841 * a new logic, CHOL, the same as HOL, but with a curried syntax
5842 for functions. Application looks like f a b instead of f(a,b). Also pairs
5843 look like (a,b) instead of <a,b>;
5845 * PLEASE NOTE: CHOL will eventually replace HOL!
5847 * In CHOL, pattern-matching on tuples is now available in all abstractions.
5848 It translates to the operator "split". A new theory of integers is available;
5850 * In ZF, integer numerals now denote two's-complement binary integers.
5851 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
5853 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
5854 of the Axiom of Choice;
5861 * Significantly faster resolution;
5863 * the different sections in a .thy file can now be mixed and repeated
5866 * Database of theorems for FOL, HOL and ZF. New
5867 commands including qed, qed_goal and bind_thm store theorems in the database.
5869 * Simple database queries: return a named theorem (get_thm) or all theorems of
5870 a given theory (thms_of), or find out what theory a theorem was proved in
5873 * Bugs fixed in the inductive definition and datatype packages;
5875 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
5876 and HOL_dup_cs obsolete;
5878 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
5881 * Simpler definition of function space in ZF;
5883 * new results about cardinal and ordinal arithmetic in ZF;
5885 * 'subtype' facility in HOL for introducing new types as subsets of existing
5888 :mode=text:wrap=hard:maxLineLen=72: