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 former "isabelle-interface" and its alias "Isabelle" have been
19 removed (interfaces are now regular Isabelle tools).
21 Within scripts and make files, the Isabelle environment variables
22 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
23 respectively. (The latter are still available as legacy feature.)
25 The old isabelle-interface wrapper could react in confusing ways if
26 the interface was uninstalled or changed otherwise. Individual
27 interface tool configuration is now more explicit, see also the
28 Isabelle system manual. In particular, Proof General is now available
31 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
32 purge installed copies of Isabelle executables and re-run "isabelle
33 install -p ...", or use symlinks.
35 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
36 old ~/isabelle, which was slightly non-standard and apt cause
37 surprises on case-insensitive file-systems.
39 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
40 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
41 care is required when using older releases of Isabelle. Note that
42 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
43 Isabelle distribution.
45 * The Isabelle System Manual (system) has been updated, with formally
46 checked references as hyperlinks.
48 * Generalized Isar history, with support for linear undo, direct state
51 * Recovered hiding of consts, which was accidentally broken in
52 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
53 makes c inaccessible; consider using ``hide (open) const c'' instead.
55 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
61 * Slightly more coherent Pure syntax, with updated documentation in
62 isar-ref manual. Removed locales meta_term_syntax and
63 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
64 INCOMPATIBILITY in rare situations.
66 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
67 hypotheses. Sorts required in the course of reasoning need to be
68 covered by the constraints in the initial statement, completed by the
69 type instance information of the background theory. Non-trivial sort
70 hypotheses, which rarely occur in practice, may be specified via
71 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
73 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
75 The result contains an implicit sort hypotheses as before --
76 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
79 * Changed defaults for unify configuration options:
81 unify_trace_bound = 50 (formerly 25)
82 unify_search_bound = 60 (formerly 30)
84 * Different bookkeeping for code equations:
85 a) On theory merge, the last set of code equations for a particular constant
86 is taken (in accordance with the policy applied by other parts of the
87 code generator framework).
88 b) Code equations stemming from explicit declarations (e.g. code attribute)
89 gain priority over default code equations stemming from definition, primrec,
93 * Global versions of theorems stemming from classes do not carry
94 a parameter prefix any longer. INCOMPATIBILITY.
96 * Dropped locale element "includes". This is a major INCOMPATIBILITY.
97 In existing theorem specifications replace the includes element by the
98 respective context elements of the included locale, omitting those that
99 are already present in the theorem specification. Multiple assume
100 elements of a locale should be replaced by a single one involving the
101 locale predicate. In the proof body, declarations (most notably
102 theorems) may be regained by interpreting the respective locales in the
103 proof context as required (command "interpret").
104 If using "includes" in replacement of a target solely because the
105 parameter types in the theorem are not as general as in the target,
106 consider declaring a new locale with additional type constraints on the
107 parameters (context element "constrains").
109 * Dropped "locale (open)". INCOMPATBILITY.
111 * Interpretation commands no longer attempt to simplify goal.
112 INCOMPATIBILITY: in rare situations the generated goal differs. Use
113 methods intro_locales and unfold_locales to clarify.
115 * Interpretation commands no longer accept interpretation attributes.
118 * Command 'instance': attached definitions no longer accepted.
119 INCOMPATIBILITY, use proper 'instantiation' target.
121 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
123 * The 'axiomatization' command now only works within a global theory
124 context. INCOMPATIBILITY.
127 *** Document preparation ***
129 * Antiquotation @{lemma} now imitates a regular terminal proof,
130 demanding keyword 'by' and supporting the full method expression
131 syntax just like the Isar command 'by'.
136 * If methods "eval" and "evaluation" encounter a structured proof state
137 with !!/==>, only the conclusion is evaluated to True (if possible),
138 avoiding strange error messages.
140 * Simplifier: simproc for let expressions now unfolds if bound variable
141 occurs at most one time in let expression body. INCOMPATIBILITY.
143 * New classes "top" and "bot" with corresponding operations "top" and "bot"
144 in theory Orderings; instantiation of class "complete_lattice" requires
145 instantiation of classes "top" and "bot". INCOMPATIBILITY.
147 * Changed definition lemma "less_fun_def" in order to provide an instance
148 for preorders on functions; use lemma "less_le" instead. INCOMPATIBILITY.
150 * Unified theorem tables for both code code generators. Thus
151 [code func] has disappeared and only [code] remains. INCOMPATIBILITY.
153 * Constants "undefined" and "default" replace "arbitrary". Usually
154 "undefined" is the right choice to replace "arbitrary", though logically
155 there is no difference. INCOMPATIBILITY.
157 * Generic ATP manager for Sledgehammer, based on ML threads instead of
158 Posix processes. Avoids potentially expensive forking of the ML
159 process. New thread-based implementation also works on non-Unix
160 platforms (Cygwin). Provers are no longer hardwired, but defined
161 within the theory via plain ML wrapper functions. Basic Sledgehammer
162 commands are covered in the isar-ref manual
164 * Wrapper scripts for remote SystemOnTPTP service allows to use
165 sledgehammer without local ATP installation (Vampire etc.). See also
166 ISABELLE_HOME/contrib/SystemOnTPTP and the VAMPIRE_HOME setting
167 variable. Other provers may be included via suitable ML wrappers, see
168 also src/HOL/ATP_Linkup.thy.
170 * Normalization by evaluation now allows non-leftlinear equations.
171 Declare with attribute [code nbe].
173 * Command "value" now integrates different evaluation
174 mechanisms. The result of the first successful evaluation mechanism
175 is printed. In square brackets a particular named evaluation
176 mechanisms may be specified (currently, [SML], [code] or [nbe]). See
177 further src/HOL/ex/Eval_Examples.thy.
179 * HOL/Orderings: class "wellorder" moved here, with explicit induction
180 rule "less_induct" as assumption. For instantiation of "wellorder" by
181 means of predicate "wf", use rule wf_wellorderI. INCOMPATIBILITY.
183 * HOL/Orderings: added class "preorder" as superclass of "order".
184 INCOMPATIBILITY: Instantiation proofs for order, linorder
185 etc. slightly changed. Some theorems named order_class.* now named
188 * HOL/Finite_Set: added a new fold combinator of type
189 ('a => 'b => 'b) => 'b => 'a set => 'b
190 Occasionally this is more convenient than the old fold combinator which is
191 now defined in terms of the new one and renamed to fold_image.
193 * HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been
194 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
195 dvd has been generalized to class comm_semiring_1. Likewise a bunch
196 of lemmas from Divides has been generalized from nat to class
197 semiring_div. INCOMPATIBILITY. This involves the following theorem
198 renames resulting from duplicate elimination:
200 dvd_def_mod ~> dvd_eq_mod_eq_0
201 zero_dvd_iff ~> dvd_0_left_iff
203 DIVISION_BY_ZERO_DIV ~> div_by_0
204 DIVISION_BY_ZERO_MOD ~> mod_by_0
205 mult_div ~> div_mult_self2_is_id
206 mult_mod ~> mod_mult_self2_is_0
208 * HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
209 zlcm (for int); carried together from various gcd/lcm developements in
210 the HOL Distribution. zgcd and zlcm replace former igcd and ilcm;
211 corresponding theorems renamed accordingly. INCOMPATIBILY. To
212 recover tupled syntax, use syntax declarations like:
214 hide (open) const gcd
215 abbreviation gcd where
216 "gcd == (%(a, b). GCD.gcd a b)"
218 GCD.gcd ("gcd '(_, _')")
220 (analogously for lcm, zgcd, zlcm).
222 * HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
224 * New ML antiquotation @{code}: takes constant as argument, generates
225 corresponding code in background and inserts name of the corresponding
226 resulting ML value/function/datatype constructor binding in place.
227 All occurrences of @{code} with a single ML block are generated
228 simultaneously. Provides a generic and safe interface for
229 instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy
230 example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious
231 application. In future you ought refrain from ad-hoc compiling
232 generated SML code on the ML toplevel. Note that (for technical
233 reasons) @{code} cannot refer to constants for which user-defined
234 serializations are set. Refer to the corresponding ML counterpart
235 directly in that cases.
237 * Integrated image HOL-Complex with HOL. Entry points Main.thy and
238 Complex_Main.thy remain as they are.
240 * New image HOL-Plain provides a minimal HOL with the most important
241 tools available (inductive, datatype, primrec, ...). By convention
242 the corresponding theory Plain should be ancestor of every further
243 (library) theory. Some library theories now have ancestor Plain
244 (instead of Main), thus theory Main occasionally has to be imported
247 * The metis method now fails in the usual manner, rather than raising
248 an exception, if it determines that it cannot prove the theorem.
250 * The metis method no longer fails because the theorem is too trivial
251 (contains the empty clause).
253 * Methods "case_tac" and "induct_tac" now refer to the very same rules
254 as the structured Isar versions "cases" and "induct", cf. the
255 corresponding "cases" and "induct" attributes. Mutual induction rules
256 are now presented as a list of individual projections
257 (e.g. foo_bar.inducts for types foo and bar); the old format with
258 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
259 rare situations a different rule is selected --- notably nested tuple
260 elimination instead of former prod.exhaust: use explicit (case_tac t
261 rule: prod.exhaust) here.
263 * Attributes "cases", "induct", "coinduct" support "del" option.
265 * Removed fact "case_split_thm", which duplicates "case_split".
267 * Command 'rep_datatype': instead of theorem names the command now
268 takes a list of terms denoting the constructors of the type to be
269 represented as datatype. The characteristic theorems have to be
270 proven. INCOMPATIBILITY. Also observe that the following theorems
271 have disappeared in favour of existing ones:
273 unit_induct ~> unit.induct
274 prod_induct ~> prod.induct
275 sum_induct ~> sum.induct
276 Suc_Suc_eq ~> nat.inject
277 Suc_not_Zero Zero_not_Suc ~> nat.distinct
279 * Library/Nat_Infinity: added addition, numeral syntax and more
280 instantiations for algebraic structures. Removed some duplicate
281 theorems. Changes in simp rules. INCOMPATIBILITY.
283 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
289 * New locales for orders and lattices where the equivalence relation
290 is not restricted to equality. INCOMPATIBILITY: all order and
291 lattice locales use a record structure with field eq for the
294 * New theory of factorial domains.
296 * Units_l_inv and Units_r_inv are now simprules by default.
297 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
298 and/or r_inv will now also require deletion of these lemmas.
300 * Renamed the following theorems. INCOMPATIBILITY.
303 least_carrier ~> least_closed
304 greatest_carrier ~> greatest_closed
305 greatest_Lower_above ~> greatest_Lower_below
306 one_zero ~> carrier_one_zero
307 one_not_zero ~> carrier_one_not_zero (collision with assumption)
312 * Created new image HOL-NSA, containing theories of nonstandard
313 analysis which were previously part of HOL-Complex. Entry point
314 Hyperreal.thy remains valid, but theories formerly using
315 Complex_Main.thy should now use new entry point Hypercomplex.thy.
320 * Proof of Zorn's Lemma for partial orders.
325 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
326 to 'a -> thm, while results are always tagged with an authentic oracle
327 name. The Isar command 'oracle' is now polymorphic, no argument type
328 is specified. INCOMPATIBILITY, need to simplify existing oracle code
329 accordingly. Note that extra performance may be gained by producing
330 the cterm carefully, avoiding slow Thm.cterm_of.
332 * ML bindings produced via Isar commands are stored within the Isar
333 context (theory or proof). Consequently, commands like 'use' and 'ML'
334 become thread-safe and work with undo as expected (concerning
335 top-level bindings, not side-effects on global references).
336 INCOMPATIBILITY, need to provide proper Isar context when invoking the
337 compiler at runtime; really global bindings need to be given outside a
338 theory. [Poly/ML 5.2 or later]
340 * Command 'ML_prf' is analogous to 'ML' but works within a proof
341 context. Top-level ML bindings are stored within the proof context in
342 a purely sequential fashion, disregarding the nested proof structure.
343 ML bindings introduced by 'ML_prf' are discarded at the end of the
344 proof. [Poly/ML 5.2 or later]
346 * Generic Toplevel.add_hook interface allows to analyze the result of
347 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
348 for theorem dependency output of transactions resulting in a new
351 * Name bindings in higher specification mechanisms (notably
352 LocalTheory.define, LocalTheory.note, and derived packages) are now
353 formalized as type Name.binding, replacing old bstring.
354 INCOMPATIBILITY, need to wrap strings via Name.binding function, see
355 also Name.name_of. Packages should pass name bindings given by the
356 user to underlying specification mechanisms; this enables precise
357 tracking of source positions, for example.
359 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
360 LocalTheory.note etc.) now refer to the *full* internal name, not the
361 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
363 * Rules and tactics that read instantiations (read_instantiate,
364 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
365 context, which is required for parsing and type-checking. Moreover,
366 the variables are specified as plain indexnames, not string encodings
367 thereof. INCOMPATIBILITY.
369 * Disposed old type and term read functions (Sign.read_def_typ,
370 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
371 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
372 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
373 Syntax.read_term_global etc.; see also OldGoals.read_term as last
374 resort for legacy applications.
376 * Antiquotations: block-structured compilation context indicated by
377 \<lbrace> ... \<rbrace>; additional antiquotation forms:
379 @{let ?pat = term} - term abbreviation (HO matching)
380 @{note name = fact} - fact abbreviation
381 @{thm fact} - singleton fact (with attributes)
382 @{thms fact} - general fact (with attributes)
383 @{lemma prop by method} - singleton goal
384 @{lemma prop by meth1 meth2} - singleton goal
385 @{lemma prop1 ... propN by method} - general goal
386 @{lemma prop1 ... propN by meth1 meth2} - general goal
387 @{lemma (open) ...} - open derivation
392 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
393 Poly/ML 5.2.1 or later.
395 * The Isabelle "emacs" tool provides a specific interface to invoke
396 Proof General / Emacs, with more explicit failure if that is not
397 installed (the old isabelle-interface script silently falls back on
398 isabelle-process). The PROOFGENERAL_HOME setting determines the
399 installation location of the Proof General distribution.
401 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
402 the Isabelle process into a JVM/Scala application. See
403 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
404 process wrapper has been discontinued.)
406 * Status messages (with exact source position information) are
407 emitted, if proper markup print mode is enabled. This allows
408 user-interface components to provide detailed feedback on internal
411 * Homegrown Isabelle font with unicode layout, see Isabelle/lib/fonts.
415 New in Isabelle2008 (June 2008)
416 -------------------------------
420 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
421 and updated, with formally checked references as hyperlinks.
423 * Theory loader: use_thy (and similar operations) no longer set the
424 implicit ML context, which was occasionally hard to predict and in
425 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
426 provides a proper context already.
428 * Theory loader: old-style ML proof scripts being *attached* to a thy
429 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
430 'use' within a theory file will do the job.
432 * Name space merge now observes canonical order, i.e. the second space
433 is inserted into the first one, while existing entries in the first
434 space take precedence. INCOMPATIBILITY in rare situations, may try to
437 * Syntax: symbol \<chi> is now considered a letter. Potential
438 INCOMPATIBILITY in identifier syntax etc.
440 * Outer syntax: string tokens no longer admit escaped white space,
441 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
442 white space without escapes.
444 * Outer syntax: string tokens may contain arbitrary character codes
445 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
451 * Context-dependent token translations. Default setup reverts locally
452 fixed variables, and adds hilite markup for undeclared frees.
454 * Unused theorems can be found using the new command 'unused_thms'.
455 There are three ways of invoking it:
458 Only finds unused theorems in the current theory.
460 (2) unused_thms thy_1 ... thy_n -
461 Finds unused theorems in the current theory and all of its ancestors,
462 excluding the theories thy_1 ... thy_n and all of their ancestors.
464 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
465 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
466 their ancestors, excluding the theories thy_1 ... thy_n and all of
469 In order to increase the readability of the list produced by
470 unused_thms, theorems that have been created by a particular instance
471 of a theory command such as 'inductive' or 'function' are considered
472 to belong to the same "group", meaning that if at least one theorem in
473 this group is used, the other theorems in the same group are no longer
474 reported as unused. Moreover, if all theorems in the group are
475 unused, only one theorem in the group is displayed.
477 Note that proof objects have to be switched on in order for
478 unused_thms to work properly (i.e. !proofs must be >= 1, which is
479 usually the case when using Proof General with the default settings).
481 * Authentic naming of facts disallows ad-hoc overwriting of previous
482 theorems within the same name space. INCOMPATIBILITY, need to remove
483 duplicate fact bindings, or even accidental fact duplications. Note
484 that tools may maintain dynamically scoped facts systematically, using
485 PureThy.add_thms_dynamic.
487 * Command 'hide' now allows to hide from "fact" name space as well.
489 * Eliminated destructive theorem database, simpset, claset, and
490 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
491 update of theories within ML code.
493 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
494 INCOMPATIBILITY, object-logics depending on former Pure require
495 additional setup PureThy.old_appl_syntax_setup; object-logics
496 depending on former CPure need to refer to Pure.
498 * Commands 'use' and 'ML' are now purely functional, operating on
499 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
500 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
503 * Command 'setup': discontinued implicit version with ML reference.
505 * Instantiation target allows for simultaneous specification of class
506 instance operations together with an instantiation proof.
507 Type-checking phase allows to refer to class operations uniformly.
508 See src/HOL/Complex/Complex.thy for an Isar example and
509 src/HOL/Library/Eval.thy for an ML example.
511 * Indexing of literal facts: be more serious about including only
512 facts from the visible specification/proof context, but not the
513 background context (locale etc.). Affects `prop` notation and method
514 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
517 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
518 "(open)" option, which used to expose internal bound variables to the
521 * Isar statements: removed obsolete case "rule_context".
522 INCOMPATIBILITY, better use explicit fixes/assumes.
524 * Locale proofs: default proof step now includes 'unfold_locales';
525 hence 'proof' without argument may be used to unfold locale
529 *** Document preparation ***
531 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
532 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
533 obsolete thumbpdf setup (contemporary PDF viewers do this on the
534 spot); renamed link color from "darkblue" to "linkcolor" (default
535 value unchanged, can be redefined via \definecolor); no longer sets
536 "a4paper" option (unnecessary or even intrusive).
538 * Antiquotation @{lemma A method} proves proposition A by the given
539 method (either a method name or a method name plus (optional) method
540 arguments in parentheses) and prints A just like @{prop A}.
545 * New primrec package. Specification syntax conforms in style to
546 definition/function/.... No separate induction rule is provided. The
547 "primrec" command distinguishes old-style and new-style specifications
548 by syntax. The former primrec package is now named OldPrimrecPackage.
549 When adjusting theories, beware: constants stemming from new-style
550 primrec specifications have authentic syntax.
552 * Metis prover is now an order of magnitude faster, and also works
555 * Metis: the maximum number of clauses that can be produced from a
556 theorem is now given by the attribute max_clauses. Theorems that
557 exceed this number are ignored, with a warning printed.
559 * Sledgehammer no longer produces structured proofs by default. To
560 enable, declare [[sledgehammer_full = true]]. Attributes
561 reconstruction_modulus, reconstruction_sorts renamed
562 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
564 * Method "induct_scheme" derives user-specified induction rules
565 from well-founded induction and completeness of patterns. This factors
566 out some operations that are done internally by the function package
567 and makes them available separately. See
568 src/HOL/ex/Induction_Scheme.thy for examples.
570 * More flexible generation of measure functions for termination
571 proofs: Measure functions can be declared by proving a rule of the
572 form "is_measure f" and giving it the [measure_function] attribute.
573 The "is_measure" predicate is logically meaningless (always true), and
574 just guides the heuristic. To find suitable measure functions, the
575 termination prover sets up the goal "is_measure ?f" of the appropriate
576 type and generates all solutions by prolog-style backwards proof using
579 This setup also deals with rules like
581 "is_measure f ==> is_measure (list_size f)"
583 which accommodates nested datatypes that recurse through lists.
584 Similar rules are predeclared for products and option types.
586 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
590 - Definitions of overloaded constants on sets have to be replaced by
591 definitions on => and bool.
593 - Some definitions of overloaded operators on sets can now be proved
594 using the definitions of the operators on => and bool. Therefore,
595 the following theorems have been renamed:
597 subset_def -> subset_eq
598 psubset_def -> psubset_eq
599 set_diff_def -> set_diff_eq
600 Compl_def -> Compl_eq
601 Sup_set_def -> Sup_set_eq
602 Inf_set_def -> Inf_set_eq
603 sup_set_def -> sup_set_eq
604 inf_set_def -> inf_set_eq
606 - Due to the incompleteness of the HO unification algorithm, some
607 rules such as subst may require manual instantiation, if some of
608 the unknowns in the rule is a set.
610 - Higher order unification and forward proofs:
613 have "P (S::'a set)" <...>
614 then have "EX S. P S" ..
616 no longer works (due to the incompleteness of the HO unification
617 algorithm) and must be replaced by the pattern
624 - Calculational reasoning with subst (or similar rules):
627 have "P (S::'a set)" <...>
628 also have "S = T" <...>
631 no longer works (for similar reasons as the previous example) and
632 must be replaced by something like
634 have "P (S::'a set)" <...>
635 moreover have "S = T" <...>
636 ultimately have "P T" by simp
638 - Tactics or packages written in ML code:
639 Code performing pattern matching on types via
641 Type ("set", [T]) => ...
643 must be rewritten. Moreover, functions like strip_type or
644 binder_types no longer return the right value when applied to a
647 T1 => ... => Tn => U => bool
651 T1 => ... => Tn => U set
653 * Merged theories Wellfounded_Recursion, Accessible_Part and
654 Wellfounded_Relations to theory Wellfounded.
656 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
658 * Class finite no longer treats UNIV as class parameter. Use class
659 enum from theory Library/Enum instead to achieve a similar effect.
662 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
663 and "Cons". INCOMPATIBILITY.
665 * HOL (and FOL): renamed variables in rules imp_elim and swap.
666 Potential INCOMPATIBILITY.
668 * Theory Product_Type: duplicated lemmas split_Pair_apply and
669 injective_fst_snd removed, use split_eta and prod_eqI instead.
670 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
672 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
673 the same name in theory Orderings:
683 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
684 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
685 and different variable names.
687 * Library/Option_ord.thy: Canonical order on option type.
689 * Library/RBT.thy: Red-black trees, an efficient implementation of
692 * Library/Countable.thy: Type class for countable types.
694 * Theory Int: The representation of numerals has changed. The infix
695 operator BIT and the bit datatype with constructors B0 and B1 have
696 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
697 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
698 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
701 * Theory Nat: definition of <= and < on natural numbers no longer
702 depend on well-founded relations. INCOMPATIBILITY. Definitions
703 le_def and less_def have disappeared. Consider lemmas not_less
704 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
706 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
707 (whose purpose mainly is for various fold_set functionals) have been
708 abandoned in favor of the existing algebraic classes
709 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
710 lower_semilattice (resp. upper_semilattice) and linorder.
713 * Theory Transitive_Closure: induct and cases rules now declare proper
714 case_names ("base" and "step"). INCOMPATIBILITY.
716 * Theorem Inductive.lfp_ordinal_induct generalized to complete
717 lattices. The form set-specific version is available as
718 Inductive.lfp_ordinal_induct_set.
720 * Renamed theorems "power.simps" to "power_int.simps".
723 * Class semiring_div provides basic abstract properties of semirings
724 with division and modulo operations. Subsumes former class dvd_mod.
726 * Merged theories IntDef, Numeral and IntArith into unified theory
727 Int. INCOMPATIBILITY.
729 * Theory Library/Code_Index: type "index" now represents natural
730 numbers rather than integers. INCOMPATIBILITY.
732 * New class "uminus" with operation "uminus" (split of from class
733 "minus" which now only has operation "minus", binary).
736 * Constants "card", "internal_split", "option_map" now with authentic
737 syntax. INCOMPATIBILITY.
739 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
740 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
741 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
742 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
743 Sup_set_def, le_def, less_def, option_map_def now with object
744 equality. INCOMPATIBILITY.
746 * Records. Removed K_record, and replaced it by pure lambda term
747 %x. c. The simplifier setup is now more robust against eta expansion.
748 INCOMPATIBILITY: in cases explicitly referring to K_record.
750 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
752 * Library/ListVector: new theory of arithmetic vector operations.
754 * Library/Order_Relation: new theory of various orderings as sets of
755 pairs. Defines preorders, partial orders, linear orders and
756 well-orders on sets and on types.
761 * Renamed some theories to allow to loading both ZF and HOL in the
764 Datatype -> Datatype_ZF
765 Inductive -> Inductive_ZF
772 INCOMPATIBILITY: ZF theories that import individual theories below
773 Main might need to be adapted. Regular theory Main is still
774 available, as trivial extension of Main_ZF.
779 * ML within Isar: antiquotation @{const name} or @{const
780 name(typargs)} produces statically-checked Const term.
782 * Functor NamedThmsFun: data is available to the user as dynamic fact
783 (of the same name). Removed obsolete print command.
785 * Removed obsolete "use_legacy_bindings" function.
787 * The ``print mode'' is now a thread-local value derived from a global
788 template (the former print_mode reference), thus access becomes
789 non-critical. The global print_mode reference is for session
790 management only; user-code should use print_mode_value,
791 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
793 * Functions system/system_out provide a robust way to invoke external
794 shell commands, with propagation of interrupts (requires Poly/ML 5.2).
795 Do not use OS.Process.system etc. from the basis library!
800 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
801 in accordance with Proof General 3.7, which prefers GNU emacs.
803 * isatool tty runs Isabelle process with plain tty interaction;
804 optional line editor may be specified via ISABELLE_LINE_EDITOR
805 setting, the default settings attempt to locate "ledit" and "rlwrap".
807 * isatool browser now works with Cygwin as well, using general
808 "javapath" function defined in Isabelle process environment.
810 * YXML notation provides a simple and efficient alternative to
811 standard XML transfer syntax. See src/Pure/General/yxml.ML and
812 isatool yxml as described in the Isabelle system manual.
814 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
815 provides general wrapper for managing an Isabelle process in a robust
816 fashion, with ``cooked'' output from stdin/stderr.
818 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
819 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
821 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
822 way of changing the user's settings is via
823 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
826 * Multithreading.max_threads := 0 refers to the number of actual CPU
827 cores of the underlying machine, which is a good starting point for
828 optimal performance tuning. The corresponding usedir option -M allows
829 "max" as an alias for "0". WARNING: does not work on certain versions
830 of Mac OS (with Poly/ML 5.1).
832 * isabelle-process: non-ML sessions are run with "nice", to reduce the
833 adverse effect of Isabelle flooding interactive front-ends (notably
834 ProofGeneral / XEmacs).
838 New in Isabelle2007 (November 2007)
839 -----------------------------------
843 * More uniform information about legacy features, notably a
844 warning/error of "Legacy feature: ...", depending on the state of the
845 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
846 legacy features will disappear eventually.
848 * Theory syntax: the header format ``theory A = B + C:'' has been
849 discontinued in favour of ``theory A imports B C begin''. Use isatool
850 fixheaders to convert existing theory files. INCOMPATIBILITY.
852 * Theory syntax: the old non-Isar theory file format has been
853 discontinued altogether. Note that ML proof scripts may still be used
854 with Isar theories; migration is usually quite simple with the ML
855 function use_legacy_bindings. INCOMPATIBILITY.
857 * Theory syntax: some popular names (e.g. 'class', 'declaration',
858 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
861 * Theory loader: be more serious about observing the static theory
862 header specifications (including optional directories), but not the
863 accidental file locations of previously successful loads. The strict
864 update policy of former update_thy is now already performed by
865 use_thy, so the former has been removed; use_thys updates several
866 theories simultaneously, just as 'imports' within a theory header
867 specification, but without merging the results. Potential
868 INCOMPATIBILITY: may need to refine theory headers and commands
869 ROOT.ML which depend on load order.
871 * Theory loader: optional support for content-based file
872 identification, instead of the traditional scheme of full physical
873 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
874 (cf. the system manual). The new scheme allows to work with
875 non-finished theories in persistent session images, such that source
876 files may be moved later on without requiring reloads.
878 * Theory loader: old-style ML proof scripts being *attached* to a thy
879 file (with the same base name as the theory) are considered a legacy
880 feature, which will disappear eventually. Even now, the theory loader
881 no longer maintains dependencies on such files.
883 * Syntax: the scope for resolving ambiguities via type-inference is
884 now limited to individual terms, instead of whole simultaneous
885 specifications as before. This greatly reduces the complexity of the
886 syntax module and improves flexibility by separating parsing and
887 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
888 'fixes' etc.) are required in rare situations.
890 * Syntax: constants introduced by new-style packages ('definition',
891 'abbreviation' etc.) are passed through the syntax module in
892 ``authentic mode''. This means that associated mixfix annotations
893 really stick to such constants, independently of potential name space
894 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
895 trees are represented slightly differently, may need to adapt syntax
896 translations accordingly. Use CONST marker in 'translations' and
897 @{const_syntax} antiquotation in 'parse_translation' etc.
899 * Legacy goal package: reduced interface to the bare minimum required
900 to keep existing proof scripts running. Most other user-level
901 functions are now part of the OldGoals structure, which is *not* open
902 by default (consider isatool expandshort before open OldGoals).
903 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
904 these tend to cause confusion about the actual goal (!) context being
905 used here, which is not necessarily the same as the_context().
907 * Command 'find_theorems': supports "*" wild-card in "name:"
908 criterion; "with_dups" option. Certain ProofGeneral versions might
909 support a specific search form (see ProofGeneral/CHANGES).
911 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
912 by default, which means that "prems" (and also "fixed variables") are
913 suppressed from proof state output. Note that the ProofGeneral
914 settings mechanism allows to change and save options persistently, but
915 older versions of Isabelle will fail to start up if a negative prems
918 * Local theory targets may be specified by non-nested blocks of
919 ``context/locale/class ... begin'' followed by ``end''. The body may
920 contain definitions, theorems etc., including any derived mechanism
921 that has been implemented on top of these primitives. This concept
922 generalizes the existing ``theorem (in ...)'' towards more versatility
925 * Proof General interface: proper undo of final 'end' command;
926 discontinued Isabelle/classic mode (ML proof scripts).
929 *** Document preparation ***
931 * Added antiquotation @{theory name} which prints the given name,
932 after checking that it refers to a valid ancestor theory in the
935 * Added antiquotations @{ML_type text} and @{ML_struct text} which
936 check the given source text as ML type/structure, printing verbatim.
938 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
939 "c args == rhs" given in the current context. (Any number of
940 arguments may be given on the LHS.)
945 * The 'class' package offers a combination of axclass and locale to
946 achieve Haskell-like type classes in Isabelle. Definitions and
947 theorems within a class context produce both relative results (with
948 implicit parameters according to the locale context), and polymorphic
949 constants with qualified polymorphism (according to the class
950 context). Within the body context of a 'class' target, a separate
951 syntax layer ("user space type system") takes care of converting
952 between global polymorphic consts and internal locale representation.
953 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
954 "isatool doc classes" provides a tutorial.
956 * Generic code generator framework allows to generate executable
957 code for ML and Haskell (including Isabelle classes). A short usage
960 internal compilation:
961 export_code <list of constants (term syntax)> in SML
962 writing SML code to a file:
963 export_code <list of constants (term syntax)> in SML <filename>
964 writing OCaml code to a file:
965 export_code <list of constants (term syntax)> in OCaml <filename>
966 writing Haskell code to a bunch of files:
967 export_code <list of constants (term syntax)> in Haskell <filename>
969 evaluating closed propositions to True/False using code generation:
972 Reasonable default setup of framework in HOL.
974 Theorem attributs for selecting and transforming function equations theorems:
976 [code fun]: select a theorem as function equation for a specific constant
977 [code fun del]: deselect a theorem as function equation for a specific constant
978 [code inline]: select an equation theorem for unfolding (inlining) in place
979 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
981 User-defined serializations (target in {SML, OCaml, Haskell}):
983 code_const <and-list of constants (term syntax)>
984 {(target) <and-list of const target syntax>}+
986 code_type <and-list of type constructors>
987 {(target) <and-list of type target syntax>}+
989 code_instance <and-list of instances>
991 where instance ::= <type constructor> :: <class>
993 code_class <and_list of classes>
994 {(target) <and-list of class target syntax>}+
995 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
997 code_instance and code_class only are effective to target Haskell.
999 For example usage see src/HOL/ex/Codegenerator.thy and
1000 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
1001 generation from Isabelle/HOL theories is available via "isatool doc
1004 * Code generator: consts in 'consts_code' Isar commands are now
1005 referred to by usual term syntax (including optional type
1008 * Command 'no_translations' removes translation rules from theory
1011 * Overloaded definitions are now actually checked for acyclic
1012 dependencies. The overloading scheme is slightly more general than
1013 that of Haskell98, although Isabelle does not demand an exact
1014 correspondence to type class and instance declarations.
1015 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
1016 exotic versions of overloading -- at the discretion of the user!
1018 Polymorphic constants are represented via type arguments, i.e. the
1019 instantiation that matches an instance against the most general
1020 declaration given in the signature. For example, with the declaration
1021 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
1022 as c(nat). Overloading is essentially simultaneous structural
1023 recursion over such type arguments. Incomplete specification patterns
1024 impose global constraints on all occurrences, e.g. c('a * 'a) on the
1025 LHS means that more general c('a * 'b) will be disallowed on any RHS.
1026 Command 'print_theory' outputs the normalized system of recursive
1027 equations, see section "definitions".
1029 * Configuration options are maintained within the theory or proof
1030 context (with name and type bool/int/string), providing a very simple
1031 interface to a poor-man's version of general context data. Tools may
1032 declare options in ML (e.g. using Attrib.config_int) and then refer to
1033 these values using Config.get etc. Users may change options via an
1034 associated attribute of the same name. This form of context
1035 declaration works particularly well with commands 'declare' or
1036 'using', for example ``declare [[foo = 42]]''. Thus it has become
1037 very easy to avoid global references, which would not observe Isar
1038 toplevel undo/redo and fail to work with multithreading.
1040 Various global ML references of Pure and HOL have been turned into
1041 configuration options:
1043 Unify.search_bound unify_search_bound
1044 Unify.trace_bound unify_trace_bound
1045 Unify.trace_simp unify_trace_simp
1046 Unify.trace_types unify_trace_types
1047 Simplifier.simp_depth_limit simp_depth_limit
1048 Blast.depth_limit blast_depth_limit
1049 DatatypeProp.dtK datatype_distinctness_limit
1050 fast_arith_neq_limit fast_arith_neq_limit
1051 fast_arith_split_limit fast_arith_split_limit
1053 * Named collections of theorems may be easily installed as context
1054 data using the functor NamedThmsFun (see also
1055 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
1056 attributes; there is also a toplevel print command. This facility is
1057 just a common case of general context data, which is the preferred way
1058 for anything more complex than just a list of facts in canonical
1061 * Isar: command 'declaration' augments a local theory by generic
1062 declaration functions written in ML. This enables arbitrary content
1063 being added to the context, depending on a morphism that tells the
1064 difference of the original declaration context wrt. the application
1065 context encountered later on.
1067 * Isar: proper interfaces for simplification procedures. Command
1068 'simproc_setup' declares named simprocs (with match patterns, and body
1069 text in ML). Attribute "simproc" adds/deletes simprocs in the current
1070 context. ML antiquotation @{simproc name} retrieves named simprocs.
1072 * Isar: an extra pair of brackets around attribute declarations
1073 abbreviates a theorem reference involving an internal dummy fact,
1074 which will be ignored later --- only the effect of the attribute on
1075 the background context will persist. This form of in-place
1076 declarations is particularly useful with commands like 'declare' and
1077 'using', for example ``have A using [[simproc a]] by simp''.
1079 * Isar: method "assumption" (and implicit closing of subproofs) now
1080 takes simple non-atomic goal assumptions into account: after applying
1081 an assumption as a rule the resulting subgoals are solved by atomic
1082 assumption steps. This is particularly useful to finish 'obtain'
1083 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
1084 without referring to the original premise "!!x. P x ==> thesis" in the
1085 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
1088 * Isar: implicit use of prems from the Isar proof context is
1089 considered a legacy feature. Common applications like ``have A .''
1090 may be replaced by ``have A by fact'' or ``note `A`''. In general,
1091 referencing facts explicitly here improves readability and
1092 maintainability of proof texts.
1094 * Isar: improper proof element 'guess' is like 'obtain', but derives
1095 the obtained context from the course of reasoning! For example:
1097 assume "EX x y. A x & B y" -- "any previous fact"
1098 then guess x and y by clarify
1100 This technique is potentially adventurous, depending on the facts and
1101 proof tools being involved here.
1103 * Isar: known facts from the proof context may be specified as literal
1104 propositions, using ASCII back-quote syntax. This works wherever
1105 named facts used to be allowed so far, in proof commands, proof
1106 methods, attributes etc. Literal facts are retrieved from the context
1107 according to unification of type and term parameters. For example,
1108 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
1109 theorems in the current context, then these are valid literal facts:
1110 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
1112 There is also a proof method "fact" which does the same composition
1113 for explicit goal states, e.g. the following proof texts coincide with
1114 certain special cases of literal facts:
1116 have "A" by fact == note `A`
1117 have "A ==> B" by fact == note `A ==> B`
1118 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
1119 have "P a ==> Q a" by fact == note `P a ==> Q a`
1121 * Isar: ":" (colon) is no longer a symbolic identifier character in
1122 outer syntax. Thus symbolic identifiers may be used without
1123 additional white space in declarations like this: ``assume *: A''.
1125 * Isar: 'print_facts' prints all local facts of the current context,
1126 both named and unnamed ones.
1128 * Isar: 'def' now admits simultaneous definitions, e.g.:
1130 def x == "t" and y == "u"
1132 * Isar: added command 'unfolding', which is structurally similar to
1133 'using', but affects both the goal state and facts by unfolding given
1134 rewrite rules. Thus many occurrences of the 'unfold' method or
1135 'unfolded' attribute may be replaced by first-class proof text.
1137 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
1138 and command 'unfolding' now all support object-level equalities
1139 (potentially conditional). The underlying notion of rewrite rule is
1140 analogous to the 'rule_format' attribute, but *not* that of the
1141 Simplifier (which is usually more generous).
1143 * Isar: the new attribute [rotated n] (default n = 1) rotates the
1144 premises of a theorem by n. Useful in conjunction with drule.
1146 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
1147 method expression within a sandbox consisting of the first N
1148 sub-goals, which need to exist. For example, ``simp_all [3]''
1149 simplifies the first three sub-goals, while (rule foo, simp_all)[]
1150 simplifies all new goals that emerge from applying rule foo to the
1151 originally first one.
1153 * Isar: schematic goals are no longer restricted to higher-order
1154 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
1157 * Isar: the conclusion of a long theorem statement is now either
1158 'shows' (a simultaneous conjunction, as before), or 'obtains'
1159 (essentially a disjunction of cases with local parameters and
1160 assumptions). The latter allows to express general elimination rules
1161 adequately; in this notation common elimination rules look like this:
1163 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
1165 obtains x where "P x"
1167 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
1171 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
1177 The subsequent classical rules even refer to the formal "thesis"
1180 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
1183 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
1184 obtains "thesis ==> something"
1186 The actual proof of an 'obtains' statement is analogous to that of the
1187 Isar proof element 'obtain', only that there may be several cases.
1188 Optional case names may be specified in parentheses; these will be
1189 available both in the present proof and as annotations in the
1190 resulting rule, for later use with the 'cases' method (cf. attribute
1193 * Isar: the assumptions of a long theorem statement are available as
1194 "assms" fact in the proof context. This is more appropriate than the
1195 (historical) "prems", which refers to all assumptions of the current
1196 context, including those from the target locale, proof body etc.
1198 * Isar: 'print_statement' prints theorems from the current theory or
1199 proof context in long statement form, according to the syntax of a
1202 * Isar: 'obtain' takes an optional case name for the local context
1203 introduction rule (default "that").
1205 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
1206 explicit (is "_ ==> ?foo") in the rare cases where this still happens
1209 * Pure: syntax "CONST name" produces a fully internalized constant
1210 according to the current context. This is particularly useful for
1211 syntax translations that should refer to internal constant
1212 representations independently of name spaces.
1214 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
1215 instead of "FOO ". This allows multiple binder declarations to coexist
1216 in the same context. INCOMPATIBILITY.
1218 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
1219 primitive that also works in a locale context (both for constants and
1220 fixed variables). Type declaration and internal syntactic representation
1221 of given constants retrieved from the context. Likewise, the
1222 'no_notation' command allows to remove given syntax annotations from the
1225 * Isar/locales: new derived specification elements 'axiomatization',
1226 'definition', 'abbreviation', which support type-inference, admit
1227 object-level specifications (equality, equivalence). See also the
1228 isar-ref manual. Examples:
1231 eq (infix "===" 50) where
1232 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
1234 definition "f x y = x + y + 1"
1235 definition g where "g x = f x x"
1238 neq (infix "=!=" 50) where
1239 "x =!= y == ~ (x === y)"
1241 These specifications may be also used in a locale context. Then the
1242 constants being introduced depend on certain fixed parameters, and the
1243 constant name is qualified by the locale base name. An internal
1244 abbreviation takes care for convenient input and output, making the
1245 parameters implicit and using the original short name. See also
1246 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
1247 entities from a monomorphic theory.
1249 Presently, abbreviations are only available 'in' a target locale, but
1250 not inherited by general import expressions. Also note that
1251 'abbreviation' may be used as a type-safe replacement for 'syntax' +
1252 'translations' in common applications. The "no_abbrevs" print mode
1253 prevents folding of abbreviations in term output.
1255 Concrete syntax is attached to specified constants in internal form,
1256 independently of name spaces. The parse tree representation is
1257 slightly different -- use 'notation' instead of raw 'syntax', and
1258 'translations' with explicit "CONST" markup to accommodate this.
1260 * Pure/Isar: unified syntax for new-style specification mechanisms
1261 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
1262 full type inference and dummy patterns ("_"). For example:
1264 definition "K x _ = x"
1266 inductive conj for A B
1267 where "A ==> B ==> conj A B"
1269 * Pure: command 'print_abbrevs' prints all constant abbreviations of
1270 the current context. Print mode "no_abbrevs" prevents inversion of
1271 abbreviations on output.
1273 * Isar/locales: improved parameter handling: use of locales "var" and
1274 "struct" no longer necessary; - parameter renamings are no longer
1275 required to be injective. For example, this allows to define
1276 endomorphisms as locale endom = homom mult mult h.
1278 * Isar/locales: changed the way locales with predicates are defined.
1279 Instead of accumulating the specification, the imported expression is
1280 now an interpretation. INCOMPATIBILITY: different normal form of
1281 locale expressions. In particular, in interpretations of locales with
1282 predicates, goals repesenting already interpreted fragments are not
1283 removed automatically. Use methods `intro_locales' and
1284 `unfold_locales'; see below.
1286 * Isar/locales: new methods `intro_locales' and `unfold_locales'
1287 provide backward reasoning on locales predicates. The methods are
1288 aware of interpretations and discharge corresponding goals.
1289 `intro_locales' is less aggressive then `unfold_locales' and does not
1290 unfold predicates to assumptions.
1292 * Isar/locales: the order in which locale fragments are accumulated
1293 has changed. This enables to override declarations from fragments due
1294 to interpretations -- for example, unwanted simp rules.
1296 * Isar/locales: interpretation in theories and proof contexts has been
1297 extended. One may now specify (and prove) equations, which are
1298 unfolded in interpreted theorems. This is useful for replacing
1299 defined concepts (constants depending on locale parameters) by
1300 concepts already existing in the target context. Example:
1302 interpretation partial_order ["op <= :: [int, int] => bool"]
1303 where "partial_order.less (op <=) (x::int) y = (x < y)"
1305 Typically, the constant `partial_order.less' is created by a
1306 definition specification element in the context of locale
1309 * Method "induct": improved internal context management to support
1310 local fixes and defines on-the-fly. Thus explicit meta-level
1311 connectives !! and ==> are rarely required anymore in inductive goals
1312 (using object-logic connectives for this purpose has been long
1313 obsolete anyway). Common proof patterns are explained in
1314 src/HOL/Induct/Common_Patterns.thy, see also
1315 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
1318 * Method "induct": improved handling of simultaneous goals. Instead of
1319 introducing object-level conjunction, the statement is now split into
1320 several conclusions, while the corresponding symbolic cases are nested
1321 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
1322 see src/HOL/Induct/Common_Patterns.thy, for example.
1324 * Method "induct": mutual induction rules are now specified as a list
1325 of rule sharing the same induction cases. HOL packages usually provide
1326 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
1327 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
1328 mutual induction rules differently, i.e. like this:
1330 (induct rule: foo_bar.inducts)
1331 (induct set: foo bar)
1332 (induct pred: foo bar)
1333 (induct type: foo bar)
1335 The ML function ProjectRule.projections turns old-style rules into the
1338 * Method "coinduct": dual of induction, see
1339 src/HOL/Library/Coinductive_List.thy for various examples.
1341 * Method "cases", "induct", "coinduct": the ``(open)'' option is
1342 considered a legacy feature.
1344 * Attribute "symmetric" produces result with standardized schematic
1345 variables (index 0). Potential INCOMPATIBILITY.
1347 * Simplifier: by default the simplifier trace only shows top level
1348 rewrites now. That is, trace_simp_depth_limit is set to 1 by
1349 default. Thus there is less danger of being flooded by the trace. The
1350 trace indicates where parts have been suppressed.
1352 * Provers/classical: removed obsolete classical version of elim_format
1353 attribute; classical elim/dest rules are now treated uniformly when
1354 manipulating the claset.
1356 * Provers/classical: stricter checks to ensure that supplied intro,
1357 dest and elim rules are well-formed; dest and elim rules must have at
1360 * Provers/classical: attributes dest/elim/intro take an optional
1361 weight argument for the rule (just as the Pure versions). Weights are
1362 ignored by automated tools, but determine the search order of single
1365 * Syntax: input syntax now supports dummy variable binding "%_. b",
1366 where the body does not mention the bound variable. Note that dummy
1367 patterns implicitly depend on their context of bounds, which makes
1368 "{_. _}" match any set comprehension as expected. Potential
1369 INCOMPATIBILITY -- parse translations need to cope with syntactic
1370 constant "_idtdummy" in the binding position.
1372 * Syntax: removed obsolete syntactic constant "_K" and its associated
1373 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
1374 for example "A -> B" => "Pi A (%_. B)".
1376 * Pure: 'class_deps' command visualizes the subclass relation, using
1377 the graph browser tool.
1379 * Pure: 'print_theory' now suppresses certain internal declarations by
1380 default; use '!' option for full details.
1385 * Method "metis" proves goals by applying the Metis general-purpose
1386 resolution prover (see also http://gilith.com/software/metis/).
1387 Examples are in the directory MetisExamples. WARNING: the
1388 Isabelle/HOL-Metis integration does not yet work properly with
1391 * Command 'sledgehammer' invokes external automatic theorem provers as
1392 background processes. It generates calls to the "metis" method if
1393 successful. These can be pasted into the proof. Users do not have to
1394 wait for the automatic provers to return. WARNING: does not really
1395 work with multi-threading.
1397 * New "auto_quickcheck" feature tests outermost goal statements for
1398 potential counter-examples. Controlled by ML references
1399 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
1400 5000 milliseconds). Fails silently if statements is outside of
1401 executable fragment, or any other codgenerator problem occurs.
1403 * New constant "undefined" with axiom "undefined x = undefined".
1405 * Added class "HOL.eq", allowing for code generation with polymorphic
1408 * Some renaming of class constants due to canonical name prefixing in
1409 the new 'class' package:
1411 HOL.abs ~> HOL.abs_class.abs
1412 HOL.divide ~> HOL.divide_class.divide
1413 0 ~> HOL.zero_class.zero
1414 1 ~> HOL.one_class.one
1415 op + ~> HOL.plus_class.plus
1416 op - ~> HOL.minus_class.minus
1417 uminus ~> HOL.minus_class.uminus
1418 op * ~> HOL.times_class.times
1419 op < ~> HOL.ord_class.less
1420 op <= > HOL.ord_class.less_eq
1421 Nat.power ~> Power.power_class.power
1422 Nat.size ~> Nat.size_class.size
1423 Numeral.number_of ~> Numeral.number_class.number_of
1424 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
1425 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
1426 Orderings.min ~> Orderings.ord_class.min
1427 Orderings.max ~> Orderings.ord_class.max
1428 Divides.op div ~> Divides.div_class.div
1429 Divides.op mod ~> Divides.div_class.mod
1430 Divides.op dvd ~> Divides.div_class.dvd
1432 INCOMPATIBILITY. Adaptions may be required in the following cases:
1434 a) User-defined constants using any of the names "plus", "minus",
1435 "times", "less" or "less_eq". The standard syntax translations for
1436 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
1439 b) Variables named "plus", "minus", "times", "less", "less_eq"
1440 INCOMPATIBILITY: use more specific names.
1442 c) Permutative equations (e.g. "a + b = b + a")
1443 Since the change of names also changes the order of terms, permutative
1444 rewrite rules may get applied in a different order. Experience shows
1445 that this is rarely the case (only two adaptions in the whole Isabelle
1446 distribution). INCOMPATIBILITY: rewrite proofs
1448 d) ML code directly refering to constant names
1449 This in general only affects hand-written proof tactics, simprocs and
1450 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
1451 Consider using @{const_name} antiquotation.
1453 * New class "default" with associated constant "default".
1455 * Function "sgn" is now overloaded and available on int, real, complex
1456 (and other numeric types), using class "sgn". Two possible defs of
1457 sgn are given as equational assumptions in the classes sgn_if and
1458 sgn_div_norm; ordered_idom now also inherits from sgn_if.
1461 * Locale "partial_order" now unified with class "order" (cf. theory
1462 Orderings), added parameter "less". INCOMPATIBILITY.
1464 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
1465 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
1466 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
1468 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
1469 changed order of proof goals in instance proofs.
1471 * The transitivity reasoner for partial and linear orders is set up
1472 for classes "order" and "linorder". Instances of the reasoner are available
1473 in all contexts importing or interpreting the corresponding locales.
1474 Method "order" invokes the reasoner separately; the reasoner
1475 is also integrated with the Simplifier as a solver. Diagnostic
1476 command 'print_orders' shows the available instances of the reasoner
1477 in the current context.
1479 * Localized monotonicity predicate in theory "Orderings"; integrated
1480 lemmas max_of_mono and min_of_mono with this predicate.
1483 * Formulation of theorem "dense" changed slightly due to integration
1484 with new class dense_linear_order.
1486 * Uniform lattice theory development in HOL.
1488 constants "meet" and "join" now named "inf" and "sup"
1489 constant "Meet" now named "Inf"
1491 classes "meet_semilorder" and "join_semilorder" now named
1492 "lower_semilattice" and "upper_semilattice"
1493 class "lorder" now named "lattice"
1494 class "comp_lat" now named "complete_lattice"
1496 Instantiation of lattice classes allows explicit definitions
1497 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
1499 INCOMPATIBILITY. Theorem renames:
1501 meet_left_le ~> inf_le1
1502 meet_right_le ~> inf_le2
1503 join_left_le ~> sup_ge1
1504 join_right_le ~> sup_ge2
1505 meet_join_le ~> inf_sup_ord
1508 le_meet ~> le_inf_iff
1509 le_join ~> ge_sup_conv
1510 meet_idempotent ~> inf_idem
1511 join_idempotent ~> sup_idem
1512 meet_comm ~> inf_commute
1513 join_comm ~> sup_commute
1514 meet_leI1 ~> le_infI1
1515 meet_leI2 ~> le_infI2
1516 le_joinI1 ~> le_supI1
1517 le_joinI2 ~> le_supI2
1518 meet_assoc ~> inf_assoc
1519 join_assoc ~> sup_assoc
1520 meet_left_comm ~> inf_left_commute
1521 meet_left_idempotent ~> inf_left_idem
1522 join_left_comm ~> sup_left_commute
1523 join_left_idempotent ~> sup_left_idem
1526 le_def_meet ~> le_iff_inf
1527 le_def_join ~> le_iff_sup
1528 join_absorp2 ~> sup_absorb2
1529 join_absorp1 ~> sup_absorb1
1530 meet_absorp1 ~> inf_absorb1
1531 meet_absorp2 ~> inf_absorb2
1532 meet_join_absorp ~> inf_sup_absorb
1533 join_meet_absorp ~> sup_inf_absorb
1534 distrib_join_le ~> distrib_sup_le
1535 distrib_meet_le ~> distrib_inf_le
1537 add_meet_distrib_left ~> add_inf_distrib_left
1538 add_join_distrib_left ~> add_sup_distrib_left
1539 is_join_neg_meet ~> is_join_neg_inf
1540 is_meet_neg_join ~> is_meet_neg_sup
1541 add_meet_distrib_right ~> add_inf_distrib_right
1542 add_join_distrib_right ~> add_sup_distrib_right
1543 add_meet_join_distribs ~> add_sup_inf_distribs
1544 join_eq_neg_meet ~> sup_eq_neg_inf
1545 meet_eq_neg_join ~> inf_eq_neg_sup
1546 add_eq_meet_join ~> add_eq_inf_sup
1547 meet_0_imp_0 ~> inf_0_imp_0
1548 join_0_imp_0 ~> sup_0_imp_0
1549 meet_0_eq_0 ~> inf_0_eq_0
1550 join_0_eq_0 ~> sup_0_eq_0
1551 neg_meet_eq_join ~> neg_inf_eq_sup
1552 neg_join_eq_meet ~> neg_sup_eq_inf
1553 join_eq_if ~> sup_eq_if
1555 mono_meet ~> mono_inf
1556 mono_join ~> mono_sup
1557 meet_bool_eq ~> inf_bool_eq
1558 join_bool_eq ~> sup_bool_eq
1559 meet_fun_eq ~> inf_fun_eq
1560 join_fun_eq ~> sup_fun_eq
1561 meet_set_eq ~> inf_set_eq
1562 join_set_eq ~> sup_set_eq
1563 meet1_iff ~> inf1_iff
1564 meet2_iff ~> inf2_iff
1573 join1_iff ~> sup1_iff
1574 join2_iff ~> sup2_iff
1584 is_meet_Meet ~> is_meet_Inf
1585 Meet_bool_def ~> Inf_bool_def
1586 Meet_fun_def ~> Inf_fun_def
1587 Meet_greatest ~> Inf_greatest
1588 Meet_lower ~> Inf_lower
1589 Meet_set_def ~> Inf_set_def
1592 Sup_bool_eq ~> Sup_bool_def
1593 Sup_fun_eq ~> Sup_fun_def
1594 Sup_set_eq ~> Sup_set_def
1596 listsp_meetI ~> listsp_infI
1597 listsp_meet_eq ~> listsp_inf_eq
1602 * Added syntactic class "size"; overloaded constant "size" now has
1603 type "'a::size ==> bool"
1605 * Internal reorganisation of `size' of datatypes: size theorems
1606 "foo.size" are no longer subsumed by "foo.simps" (but are still
1607 simplification rules by default!); theorems "prod.size" now named
1610 * Class "div" now inherits from class "times" rather than "type".
1613 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
1614 Linorder etc. have disappeared; operations defined in terms of
1615 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
1617 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
1619 * HOL-Word: New extensive library and type for generic, fixed size
1620 machine words, with arithemtic, bit-wise, shifting and rotating
1621 operations, reflection into int, nat, and bool lists, automation for
1622 linear arithmetic (by automatic reflection into nat or int), including
1623 lemmas on overflow and monotonicity. Instantiated to all appropriate
1624 arithmetic type classes, supporting automatic simplification of
1625 numerals on all operations.
1627 * Library/Boolean_Algebra: locales for abstract boolean algebras.
1629 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
1631 * Code generator library theories:
1632 - Code_Integer represents HOL integers by big integer literals in target
1634 - Code_Char represents HOL characters by character literals in target
1636 - Code_Char_chr like Code_Char, but also offers treatment of character
1637 codes; includes Code_Integer.
1638 - Executable_Set allows to generate code for finite sets using lists.
1639 - Executable_Rat implements rational numbers as triples (sign, enumerator,
1641 - Executable_Real implements a subset of real numbers, namly those
1642 representable by rational numbers.
1643 - Efficient_Nat implements natural numbers by integers, which in general will
1644 result in higher efficency; pattern matching with 0/Suc is eliminated;
1645 includes Code_Integer.
1646 - Code_Index provides an additional datatype index which is mapped to
1647 target-language built-in integers.
1648 - Code_Message provides an additional datatype message_string which is isomorphic to
1649 strings; messages are mapped to target-language strings.
1651 * New package for inductive predicates
1653 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
1656 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1657 for z_1 :: U_1 and ... and z_n :: U_m
1659 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1662 with full support for type-inference, rather than
1664 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1666 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1667 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1669 inductive "s z_1 ... z_m"
1671 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1674 For backward compatibility, there is a wrapper allowing inductive
1675 sets to be defined with the new package via
1678 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1679 for z_1 :: U_1 and ... and z_n :: U_m
1681 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1687 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1688 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1689 for z_1 :: U_1 and ... and z_n :: U_m
1691 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1692 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1695 if the additional syntax "p ..." is required.
1697 Numerous examples can be found in the subdirectories src/HOL/Auth,
1698 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
1702 - Since declaration and definition of inductive sets or predicates
1703 is no longer separated, abbreviations involving the newly
1704 introduced sets or predicates must be specified together with the
1705 introduction rules after the 'where' keyword (see above), rather
1706 than before the actual inductive definition.
1708 - The variables in induction and elimination rules are now
1709 quantified in the order of their occurrence in the introduction
1710 rules, rather than in alphabetical order. Since this may break
1711 some proofs, these proofs either have to be repaired, e.g. by
1712 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
1713 statements of the form
1715 case (rule_i a_i_1 ... a_i_{k_i})
1717 or the old order of quantification has to be restored by explicitly adding
1718 meta-level quantifiers in the introduction rules, i.e.
1720 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
1722 - The format of the elimination rules is now
1724 p z_1 ... z_m x_1 ... x_n ==>
1725 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1730 (x_1, ..., x_n) : s z_1 ... z_m ==>
1731 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1734 for sets rather than
1736 x : s z_1 ... z_m ==>
1737 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
1740 This may require terms in goals to be expanded to n-tuples
1741 (e.g. using case_tac or simplification with the split_paired_all
1742 rule) before the above elimination rule is applicable.
1744 - The elimination or case analysis rules for (mutually) inductive
1745 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
1746 list of rules "p_1_..._p_k.elims" is no longer available.
1748 * New package "function"/"fun" for general recursive functions,
1749 supporting mutual and nested recursion, definitions in local contexts,
1750 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
1751 for small examples, and the separate tutorial on the function
1752 package. The old recdef "package" is still available as before, but
1753 users are encouraged to use the new package.
1755 * Method "lexicographic_order" automatically synthesizes termination
1756 relations as lexicographic combinations of size measures.
1758 * Case-expressions allow arbitrary constructor-patterns (including
1759 "_") and take their order into account, like in functional
1760 programming. Internally, this is translated into nested
1761 case-expressions; missing cases are added and mapped to the predefined
1762 constant "undefined". In complicated cases printing may no longer show
1763 the original input but the internal form. Lambda-abstractions allow
1764 the same form of pattern matching: "% pat1 => e1 | ..." is an
1765 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
1768 * IntDef: The constant "int :: nat => int" has been removed; now "int"
1769 is an abbreviation for "of_nat :: nat => int". The simplification
1770 rules for "of_nat" have been changed to work like "int" did
1771 previously. Potential INCOMPATIBILITY:
1772 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
1773 - of_nat_diff and of_nat_mult are no longer default simp rules
1775 * Method "algebra" solves polynomial equations over (semi)rings using
1776 Groebner bases. The (semi)ring structure is defined by locales and the
1777 tool setup depends on that generic context. Installing the method for
1778 a specific type involves instantiating the locale and possibly adding
1779 declarations for computation on the coefficients. The method is
1780 already instantiated for natural numbers and for the axiomatic class
1781 of idoms with numerals. See also the paper by Chaieb and Wenzel at
1782 CALCULEMUS 2007 for the general principles underlying this
1783 architecture of context-aware proof-tools.
1785 * Method "ferrack" implements quantifier elimination over
1786 special-purpose dense linear orders using locales (analogous to
1787 "algebra"). The method is already installed for class
1788 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
1791 * Former constant "List.op @" now named "List.append". Use ML
1792 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
1793 circumvent possible incompatibilities when working on ML level.
1795 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
1797 * New function listsum :: 'a list => 'a for arbitrary monoids.
1798 Special syntax: "SUM x <- xs. f x" (and latex variants)
1800 * New syntax for Haskell-like list comprehension (input only), eg.
1801 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
1803 * The special syntax for function "filter" has changed from [x :
1804 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
1805 comprehension syntax, and for uniformity. INCOMPATIBILITY.
1807 * [a..b] is now defined for arbitrary linear orders. It used to be
1808 defined on nat only, as an abbreviation for [a..<Suc b]
1811 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
1813 * New functions "sorted" and "sort" in src/HOL/List.thy.
1815 * New lemma collection field_simps (an extension of ring_simps) for
1816 manipulating (in)equations involving division. Multiplies with all
1817 denominators that can be proved to be non-zero (in equations) or
1818 positive/negative (in inequations).
1820 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
1821 have been improved and renamed to ring_simps, group_simps and
1822 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
1823 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
1825 * Theory Library/Commutative_Ring: switched from recdef to function
1826 package; constants add, mul, pow now curried. Infix syntax for
1827 algebraic operations.
1829 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
1832 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
1835 * HOL/records: generalised field-update to take a function on the
1836 field rather than the new value: r(|A := x|) is translated to A_update
1837 (K x) r The K-combinator that is internally used is called K_record.
1838 INCOMPATIBILITY: Usage of the plain update functions has to be
1841 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
1842 * x = 0, which are required for a semiring. Richer structures do not
1843 inherit from semiring_0 anymore, because this property is a theorem
1844 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
1845 there is more to prove, but this is mostly trivial.
1847 * Class "recpower" is generalized to arbitrary monoids, not just
1848 commutative semirings. INCOMPATIBILITY: may need to incorporate
1849 commutativity or semiring properties additionally.
1851 * Constant "List.list_all2" in List.thy now uses authentic syntax.
1852 INCOMPATIBILITY: translations containing list_all2 may go wrong,
1853 better use 'abbreviation'.
1855 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
1857 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
1858 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
1859 significant changes for setting up numeral syntax for types:
1860 - New constants Numeral.pred and Numeral.succ instead
1861 of former Numeral.bin_pred and Numeral.bin_succ.
1862 - Use integer operations instead of bin_add, bin_mult and so on.
1863 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
1864 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
1866 See src/HOL/Integ/IntArith.thy for an example setup.
1868 * Command 'normal_form' computes the normal form of a term that may
1869 contain free variables. For example ``normal_form "rev [a, b, c]"''
1870 produces ``[b, c, a]'' (without proof). This command is suitable for
1871 heavy-duty computations because the functions are compiled to ML
1872 first. Correspondingly, a method "normalization" is provided. See
1873 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
1875 * Alternative iff syntax "A <-> B" for equality on bool (with priority
1876 25 like -->); output depends on the "iff" print_mode, the default is
1877 "A = B" (with priority 50).
1879 * Relations less (<) and less_eq (<=) are also available on type bool.
1880 Modified syntax to disallow nesting without explicit parentheses,
1881 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
1884 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
1886 * Relation composition operator "op O" now has precedence 75 and binds
1887 stronger than union and intersection. INCOMPATIBILITY.
1889 * The old set interval syntax "{m..n(}" (and relatives) has been
1890 removed. Use "{m..<n}" (and relatives) instead.
1892 * In the context of the assumption "~(s = t)" the Simplifier rewrites
1893 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
1894 ``declare [[simproc del: neq]]''.
1896 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
1899 * Theorem Cons_eq_map_conv no longer declared as "simp".
1901 * Theorem setsum_mult renamed to setsum_right_distrib.
1903 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
1906 * Reimplemented methods "sat" and "satx", with several improvements:
1907 goals no longer need to be stated as "<prems> ==> False", equivalences
1908 (i.e. "=" on type bool) are handled, variable names of the form
1909 "lit_<n>" are no longer reserved, significant speedup.
1911 * Methods "sat" and "satx" can now replay MiniSat proof traces.
1912 zChaff is still supported as well.
1914 * 'inductive' and 'datatype': provide projections of mutual rules,
1915 bundled as foo_bar.inducts;
1917 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
1920 * Library: moved theory Accessible_Part to main HOL.
1922 * Library: added theory Coinductive_List of potentially infinite lists
1923 as greatest fixed-point.
1925 * Library: added theory AssocList which implements (finite) maps as
1928 * Method "evaluation" solves goals (i.e. a boolean expression)
1929 efficiently by compiling it to ML. The goal is "proved" (via an
1930 oracle) if it evaluates to True.
1932 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
1933 also when invoked by the simplifier. This results in the Simplifier
1934 being more powerful on arithmetic goals. INCOMPATIBILITY.
1935 Configuration option fast_arith_split_limit=0 recovers the old
1938 * Support for hex (0x20) and binary (0b1001) numerals.
1940 * New method: reify eqs (t), where eqs are equations for an
1941 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
1942 parameter, computes a term s::'b and a list xs::'a list and proves the
1943 theorem I xs s = t. This is also known as reification or quoting. The
1944 resulting theorem is applied to the subgoal to substitute t with I xs
1945 s. If t is omitted, the subgoal itself is reified.
1947 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
1948 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
1949 where f is supposed to be a computable function (in the sense of code
1950 generattion). The method uses reify to compute s and xs as above then
1951 applies corr_thm and uses normalization by evaluation to "prove" f s =
1952 r and finally gets the theorem t = r, which is again applied to the
1953 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
1955 * Reflection: Automatic reification now handels binding, an example is
1956 available in src/HOL/ex/ReflectionEx.thy
1958 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
1959 command 'statespace' that is similar to 'record', but introduces an
1960 abstract specification based on the locale infrastructure instead of
1961 HOL types. This leads to extra flexibility in composing state spaces,
1962 in particular multiple inheritance and renaming of components.
1967 * Hyperreal: Functions root and sqrt are now defined on negative real
1968 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
1969 Nonnegativity side conditions have been removed from many lemmas, so
1970 that more subgoals may now be solved by simplification; potential
1973 * Real: new type classes formalize real normed vector spaces and
1974 algebras, using new overloaded constants scaleR :: real => 'a => 'a
1975 and norm :: 'a => real.
1977 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
1978 reals into other types. The overloaded constant Reals :: 'a set is now
1979 defined as range of_real; potential INCOMPATIBILITY.
1981 * Real: proper support for ML code generation, including 'quickcheck'.
1982 Reals are implemented as arbitrary precision rationals.
1984 * Hyperreal: Several constants that previously worked only for the
1985 reals have been generalized, so they now work over arbitrary vector
1986 spaces. Type annotations may need to be added in some cases; potential
1989 Infinitesimal :: ('a::real_normed_vector) star set
1990 HFinite :: ('a::real_normed_vector) star set
1991 HInfinite :: ('a::real_normed_vector) star set
1992 approx :: ('a::real_normed_vector) star => 'a star => bool
1993 monad :: ('a::real_normed_vector) star => 'a star set
1994 galaxy :: ('a::real_normed_vector) star => 'a star set
1995 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
1996 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
1997 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
1998 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
1999 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
2000 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
2001 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
2002 sgn :: 'a::real_normed_vector => 'a
2003 exp :: 'a::{recpower,real_normed_field,banach} => 'a
2005 * Complex: Some complex-specific constants are now abbreviations for
2006 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
2007 hnorm. Other constants have been entirely removed in favor of the
2008 polymorphic versions (INCOMPATIBILITY):
2012 HInfinite <-- CInfinite
2013 Infinitesimal <-- CInfinitesimal
2016 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
2017 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
2018 (ns)deriv <-- (ns)cderiv
2023 * Formalisation of ideals and the quotient construction over rings.
2025 * Order and lattice theory no longer based on records.
2028 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
2029 greatest_closed. INCOMPATIBILITY.
2031 * Method algebra is now set up via an attribute. For examples see
2032 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
2033 of algebraic structures.
2035 * Renamed theory CRing to Ring.
2040 * Substantial, yet incomplete support for nominal datatypes (binding
2041 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
2042 src/HOL/Nominal/Examples. Prospective users should consult
2043 http://isabelle.in.tum.de/nominal/
2048 * ML basics: just one true type int, which coincides with IntInf.int
2051 * ML within Isar: antiquotations allow to embed statically-checked
2052 formal entities in the source, referring to the context available at
2053 compile-time. For example:
2055 ML {* @{sort "{zero,one}"} *}
2056 ML {* @{typ "'a => 'b"} *}
2057 ML {* @{term "%x. x"} *}
2058 ML {* @{prop "x == y"} *}
2059 ML {* @{ctyp "'a => 'b"} *}
2060 ML {* @{cterm "%x. x"} *}
2061 ML {* @{cprop "x == y"} *}
2062 ML {* @{thm asm_rl} *}
2063 ML {* @{thms asm_rl} *}
2064 ML {* @{type_name c} *}
2065 ML {* @{type_syntax c} *}
2066 ML {* @{const_name c} *}
2067 ML {* @{const_syntax c} *}
2070 ML {* @{theory Pure} *}
2071 ML {* @{theory_ref} *}
2072 ML {* @{theory_ref Pure} *}
2075 ML {* @{clasimpset} *}
2077 The same works for sources being ``used'' within an Isar context.
2079 * ML in Isar: improved error reporting; extra verbosity with
2080 ML_Context.trace enabled.
2082 * Pure/General/table.ML: the join operations now works via exceptions
2083 DUP/SAME instead of type option. This is simpler in simple cases, and
2084 admits slightly more efficient complex applications.
2086 * Pure: 'advanced' translation functions (parse_translation etc.) now
2087 use Context.generic instead of just theory.
2089 * Pure: datatype Context.generic joins theory/Proof.context and
2090 provides some facilities for code that works in either kind of
2091 context, notably GenericDataFun for uniform theory and proof data.
2093 * Pure: simplified internal attribute type, which is now always
2094 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
2095 local (Proof.context) attributes have been discontinued, while
2096 minimizing code duplication. Thm.rule_attribute and
2097 Thm.declaration_attribute build canonical attributes; see also structure
2098 Context for further operations on Context.generic, notably
2099 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
2100 declarations and definitions.
2102 * Context data interfaces (Theory/Proof/GenericDataFun): removed
2103 name/print, uninitialized data defaults to ad-hoc copy of empty value,
2104 init only required for impure data. INCOMPATIBILITY: empty really need
2105 to be empty (no dependencies on theory content!)
2107 * Pure/kernel: consts certification ignores sort constraints given in
2108 signature declarations. (This information is not relevant to the
2109 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
2110 potential INCOMPATIBILITY.
2112 * Pure: axiomatic type classes are now purely definitional, with
2113 explicit proofs of class axioms and super class relations performed
2114 internally. See Pure/axclass.ML for the main internal interfaces --
2115 notably AxClass.define_class supercedes AxClass.add_axclass, and
2116 AxClass.axiomatize_class/classrel/arity supersede
2117 Sign.add_classes/classrel/arities.
2119 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
2120 global/local versions on theory vs. Proof.context have been
2121 discontinued; Attrib.syntax and Method.syntax have been adapted
2122 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
2123 attributes, methods, etc.
2125 * Pure: several functions of signature "... -> theory -> theory * ..."
2126 have been reoriented to "... -> theory -> ... * theory" in order to
2127 allow natural usage in combination with the ||>, ||>>, |-> and
2128 fold_map combinators.
2130 * Pure: official theorem names (closed derivations) and additional
2131 comments (tags) are now strictly separate. Name hints -- which are
2132 maintained as tags -- may be attached any time without affecting the
2135 * Pure: primitive rule lift_rule now takes goal cterm instead of an
2136 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
2137 achieve the old behaviour.
2139 * Pure: the "Goal" constant is now called "prop", supporting a
2140 slightly more general idea of ``protecting'' meta-level rule
2143 * Pure: Logic.(un)varify only works in a global context, which is now
2144 enforced instead of silently assumed. INCOMPATIBILITY, may use
2145 Logic.legacy_(un)varify as temporary workaround.
2147 * Pure: structure Name provides scalable operations for generating
2148 internal variable names, notably Name.variants etc. This replaces
2149 some popular functions from term.ML:
2151 Term.variant -> Name.variant
2152 Term.variantlist -> Name.variant_list
2153 Term.invent_names -> Name.invent_list
2155 Note that low-level renaming rarely occurs in new code -- operations
2156 from structure Variable are used instead (see below).
2158 * Pure: structure Variable provides fundamental operations for proper
2159 treatment of fixed/schematic variables in a context. For example,
2160 Variable.import introduces fixes for schematics of given facts and
2161 Variable.export reverses the effect (up to renaming) -- this replaces
2162 various freeze_thaw operations.
2164 * Pure: structure Goal provides simple interfaces for
2165 init/conclude/finish and tactical prove operations (replacing former
2166 Tactic.prove). Goal.prove is the canonical way to prove results
2167 within a given context; Goal.prove_global is a degraded version for
2168 theory level goals, including a global Drule.standard. Note that
2169 OldGoals.prove_goalw_cterm has long been obsolete, since it is
2170 ill-behaved in a local proof context (e.g. with local fixes/assumes or
2171 in a locale context).
2173 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
2174 and type checking (Syntax.check_term etc.), with common combinations
2175 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
2176 which are considered legacy and await removal.
2178 * Pure/Syntax: generic interfaces for type unchecking
2179 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
2180 with common combinations (Syntax.pretty_term, Syntax.string_of_term
2181 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
2182 available for convenience, but refer to the very same operations using
2183 a mere theory instead of a full context.
2185 * Isar: simplified treatment of user-level errors, using exception
2186 ERROR of string uniformly. Function error now merely raises ERROR,
2187 without any side effect on output channels. The Isar toplevel takes
2188 care of proper display of ERROR exceptions. ML code may use plain
2189 handle/can/try; cat_error may be used to concatenate errors like this:
2191 ... handle ERROR msg => cat_error msg "..."
2193 Toplevel ML code (run directly or through the Isar toplevel) may be
2194 embedded into the Isar toplevel with exception display/debug like
2197 Isar.toplevel (fn () => ...)
2199 INCOMPATIBILITY, removed special transform_error facilities, removed
2200 obsolete variants of user-level exceptions (ERROR_MESSAGE,
2201 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
2202 -- use plain ERROR instead.
2204 * Isar: theory setup now has type (theory -> theory), instead of a
2205 list. INCOMPATIBILITY, may use #> to compose setup functions.
2207 * Isar: ML toplevel pretty printer for type Proof.context, subject to
2208 ProofContext.debug/verbose flags.
2210 * Isar: Toplevel.theory_to_proof admits transactions that modify the
2211 theory before entering a proof state. Transactions now always see a
2212 quasi-functional intermediate checkpoint, both in interactive and
2215 * Isar: simplified interfaces for outer syntax. Renamed
2216 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
2217 OuterSyntax.add_parsers -- this functionality is now included in
2218 OuterSyntax.command etc. INCOMPATIBILITY.
2220 * Simplifier: the simpset of a running simplification process now
2221 contains a proof context (cf. Simplifier.the_context), which is the
2222 very context that the initial simpset has been retrieved from (by
2223 simpset_of/local_simpset_of). Consequently, all plug-in components
2224 (solver, looper etc.) may depend on arbitrary proof data.
2226 * Simplifier.inherit_context inherits the proof context (plus the
2227 local bounds) of the current simplification process; any simproc
2228 etc. that calls the Simplifier recursively should do this! Removed
2229 former Simplifier.inherit_bounds, which is already included here --
2230 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
2231 specify an explicit context using Simplifier.context/theory_context.
2233 * Simplifier/Classical Reasoner: more abstract interfaces
2234 change_simpset/claset for modifying the simpset/claset reference of a
2235 theory; raw versions simpset/claset_ref etc. have been discontinued --
2238 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
2244 * settings: the default heap location within ISABELLE_HOME_USER now
2245 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
2246 Isabelle installations.
2248 * isabelle-process: option -S (secure mode) disables some critical
2249 operations, notably runtime compilation and evaluation of ML source
2252 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
2254 * Support for parallel execution, using native multicore support of
2255 Poly/ML 5.1. The theory loader exploits parallelism when processing
2256 independent theories, according to the given theory header
2257 specifications. The maximum number of worker threads is specified via
2258 usedir option -M or the "max-threads" setting in Proof General. A
2259 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
2260 to 6 on a 8-core machine. User-code needs to observe certain
2261 guidelines for thread-safe programming, see appendix A in the Isar
2262 Implementation manual.
2266 New in Isabelle2005 (October 2005)
2267 ----------------------------------
2271 * Theory headers: the new header syntax for Isar theories is
2274 imports <theory1> ... <theoryN>
2275 uses <file1> ... <fileM>
2278 where the 'uses' part is optional. The previous syntax
2280 theory <name> = <theory1> + ... + <theoryN>:
2282 will disappear in the next release. Use isatool fixheaders to convert
2283 existing theory files. Note that there is no change in ancient
2284 non-Isar theories now, but these will disappear soon.
2286 * Theory loader: parent theories can now also be referred to via
2287 relative and absolute paths.
2289 * Command 'find_theorems' searches for a list of criteria instead of a
2290 list of constants. Known criteria are: intro, elim, dest, name:string,
2291 simp:term, and any term. Criteria can be preceded by '-' to select
2292 theorems that do not match. Intro, elim, dest select theorems that
2293 match the current goal, name:s selects theorems whose fully qualified
2294 name contain s, and simp:term selects all simplification rules whose
2295 lhs match term. Any other term is interpreted as pattern and selects
2296 all theorems matching the pattern. Available in ProofGeneral under
2297 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
2299 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
2301 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
2302 matching the current goal as introduction rule and not having "HOL."
2303 in their name (i.e. not being defined in theory HOL).
2305 * Command 'thms_containing' has been discontinued in favour of
2306 'find_theorems'; INCOMPATIBILITY.
2308 * Communication with Proof General is now 8bit clean, which means that
2309 Unicode text in UTF-8 encoding may be used within theory texts (both
2310 formal and informal parts). Cf. option -U of the Isabelle Proof
2311 General interface. Here are some simple examples (cf. src/HOL/ex):
2313 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
2314 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
2316 * Improved efficiency of the Simplifier and, to a lesser degree, the
2317 Classical Reasoner. Typical big applications run around 2 times
2321 *** Document preparation ***
2323 * Commands 'display_drafts' and 'print_drafts' perform simple output
2324 of raw sources. Only those symbols that do not require additional
2325 LaTeX packages (depending on comments in isabellesym.sty) are
2326 displayed properly, everything else is left verbatim. isatool display
2327 and isatool print are used as front ends (these are subject to the
2328 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
2330 * Command tags control specific markup of certain regions of text,
2331 notably folding and hiding. Predefined tags include "theory" (for
2332 theory begin and end), "proof" for proof commands, and "ML" for
2333 commands involving ML code; the additional tags "visible" and
2334 "invisible" are unused by default. Users may give explicit tag
2335 specifications in the text, e.g. ''by %invisible (auto)''. The
2336 interpretation of tags is determined by the LaTeX job during document
2337 preparation: see option -V of isatool usedir, or options -n and -t of
2338 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
2341 Several document versions may be produced at the same time via isatool
2342 usedir (the generated index.html will link all of them). Typical
2343 specifications include ''-V document=theory,proof,ML'' to present
2344 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
2345 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
2346 these parts without any formal replacement text. The Isabelle site
2347 default settings produce ''document'' and ''outline'' versions as
2350 * Several new antiquotations:
2352 @{term_type term} prints a term with its type annotated;
2354 @{typeof term} prints the type of a term;
2356 @{const const} is the same as @{term const}, but checks that the
2357 argument is a known logical constant;
2359 @{term_style style term} and @{thm_style style thm} print a term or
2360 theorem applying a "style" to it
2364 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
2365 definitions, equations, inequations etc., 'concl' printing only the
2366 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
2367 to print the specified premise. TermStyle.add_style provides an ML
2368 interface for introducing further styles. See also the "LaTeX Sugar"
2369 document practical applications. The ML antiquotation prints
2370 type-checked ML expressions verbatim.
2372 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
2373 and 'text' support optional locale specification '(in loc)', which
2374 specifies the default context for interpreting antiquotations. For
2375 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
2377 * Option 'locale=NAME' of antiquotations specifies an alternative
2378 context interpreting the subsequent argument. For example: @{thm
2379 [locale=lattice] inf_assoc}.
2381 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
2384 * Proper output of antiquotations for theory commands involving a
2385 proof context (such as 'locale' or 'theorem (in loc) ...').
2387 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
2388 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
2390 * isatool usedir: new option -C (default true) controls whether option
2391 -D should include a copy of the original document directory; -C false
2392 prevents unwanted effects such as copying of administrative CVS data.
2397 * Considerably improved version of 'constdefs' command. Now performs
2398 automatic type-inference of declared constants; additional support for
2399 local structure declarations (cf. locales and HOL records), see also
2400 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
2401 sequential dependencies of definitions within a single 'constdefs'
2402 section; moreover, the declared name needs to be an identifier. If
2403 all fails, consider to fall back on 'consts' and 'defs' separately.
2405 * Improved indexed syntax and implicit structures. First of all,
2406 indexed syntax provides a notational device for subscripted
2407 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
2408 expressions. Secondly, in a local context with structure
2409 declarations, number indexes \<^sub>n or the empty index (default
2410 number 1) refer to a certain fixed variable implicitly; option
2411 show_structs controls printing of implicit structures. Typical
2412 applications of these concepts involve record types and locales.
2414 * New command 'no_syntax' removes grammar declarations (and
2415 translations) resulting from the given syntax specification, which is
2416 interpreted in the same manner as for the 'syntax' command.
2418 * 'Advanced' translation functions (parse_translation etc.) may depend
2419 on the signature of the theory context being presently used for
2420 parsing/printing, see also isar-ref manual.
2422 * Improved 'oracle' command provides a type-safe interface to turn an
2423 ML expression of type theory -> T -> term into a primitive rule of
2424 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
2425 is already included here); see also FOL/ex/IffExample.thy;
2428 * axclass: name space prefix for class "c" is now "c_class" (was "c"
2429 before); "cI" is no longer bound, use "c.intro" instead.
2430 INCOMPATIBILITY. This change avoids clashes of fact bindings for
2431 axclasses vs. locales.
2433 * Improved internal renaming of symbolic identifiers -- attach primes
2434 instead of base 26 numbers.
2436 * New flag show_question_marks controls printing of leading question
2437 marks in schematic variable names.
2439 * In schematic variable names, *any* symbol following \<^isub> or
2440 \<^isup> is now treated as part of the base name. For example, the
2441 following works without printing of awkward ".0" indexes:
2443 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
2446 * Inner syntax includes (*(*nested*) comments*).
2448 * Pretty printer now supports unbreakable blocks, specified in mixfix
2449 annotations as "(00...)".
2451 * Clear separation of logical types and nonterminals, where the latter
2452 may only occur in 'syntax' specifications or type abbreviations.
2453 Before that distinction was only partially implemented via type class
2454 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
2455 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
2456 exotic syntax specifications may require further adaption
2457 (e.g. Cube/Cube.thy).
2459 * Removed obsolete type class "logic", use the top sort {} instead.
2460 Note that non-logical types should be declared as 'nonterminals'
2461 rather than 'types'. INCOMPATIBILITY for new object-logic
2464 * Attributes 'induct' and 'cases': type or set names may now be
2465 locally fixed variables as well.
2467 * Simplifier: can now control the depth to which conditional rewriting
2468 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
2471 * Simplifier: simplification procedures may now take the current
2472 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
2473 interface), which is very useful for calling the Simplifier
2474 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
2475 is gone -- use prems_of_ss on the simpset instead. Moreover, the
2476 low-level mk_simproc no longer applies Logic.varify internally, to
2477 allow for use in a context of fixed variables.
2479 * thin_tac now works even if the assumption being deleted contains !!
2480 or ==>. More generally, erule now works even if the major premise of
2481 the elimination rule contains !! or ==>.
2483 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
2485 * Reorganized bootstrapping of the Pure theories; CPure is now derived
2486 from Pure, which contains all common declarations already. Both
2487 theories are defined via plain Isabelle/Isar .thy files.
2488 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
2489 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
2490 use isatool fixcpure to adapt your theory and ML sources.
2492 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
2493 selections of theorems in named facts via index ranges.
2495 * 'print_theorems': in theory mode, really print the difference
2496 wrt. the last state (works for interactive theory development only),
2497 in proof mode print all local facts (cf. 'print_facts');
2499 * 'hide': option '(open)' hides only base names.
2501 * More efficient treatment of intermediate checkpoints in interactive
2504 * Code generator is now invoked via code_module (incremental code
2505 generation) and code_library (modular code generation, ML structures
2506 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
2507 must be quoted when used as identifiers.
2509 * New 'value' command for reading, evaluating and printing terms using
2510 the code generator. INCOMPATIBILITY: command keyword 'value' must be
2511 quoted when used as identifier.
2516 * New commands for the interpretation of locale expressions in
2517 theories (1), locales (2) and proof contexts (3). These generate
2518 proof obligations from the expression specification. After the
2519 obligations have been discharged, theorems of the expression are added
2520 to the theory, target locale or proof context. The synopsis of the
2521 commands is a follows:
2523 (1) interpretation expr inst
2524 (2) interpretation target < expr
2525 (3) interpret expr inst
2527 Interpretation in theories and proof contexts require a parameter
2528 instantiation of terms from the current context. This is applied to
2529 specifications and theorems of the interpreted expression.
2530 Interpretation in locales only permits parameter renaming through the
2531 locale expression. Interpretation is smart in that interpretations
2532 that are active already do not occur in proof obligations, neither are
2533 instantiated theorems stored in duplicate. Use 'print_interps' to
2534 inspect active interpretations of a particular locale. For details,
2535 see the Isar Reference manual. Examples can be found in
2536 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
2538 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
2539 'interpret' instead.
2541 * New context element 'constrains' for adding type constraints to
2544 * Context expressions: renaming of parameters with syntax
2547 * Locale declaration: 'includes' disallowed.
2549 * Proper static binding of attribute syntax -- i.e. types / terms /
2550 facts mentioned as arguments are always those of the locale definition
2551 context, independently of the context of later invocations. Moreover,
2552 locale operations (renaming and type / term instantiation) are applied
2553 to attribute arguments as expected.
2555 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
2556 actual attributes; rare situations may require Attrib.attribute to
2557 embed those attributes into Attrib.src that lack concrete syntax.
2558 Attribute implementations need to cooperate properly with the static
2559 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
2560 Attrib.XXX_thm etc. already do the right thing without further
2561 intervention. Only unusual applications -- such as "where" or "of"
2562 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
2563 on the context and the facts involved -- may have to assign parsed
2564 values to argument tokens explicitly.
2566 * Changed parameter management in theorem generation for long goal
2567 statements with 'includes'. INCOMPATIBILITY: produces a different
2568 theorem statement in rare situations.
2570 * Locale inspection command 'print_locale' omits notes elements. Use
2571 'print_locale!' to have them included in the output.
2576 * Provers/hypsubst.ML: improved version of the subst method, for
2577 single-step rewriting: it now works in bound variable contexts. New is
2578 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
2579 rewrite a different subterm than the original subst method, which is
2580 still available as 'simplesubst'.
2582 * Provers/quasi.ML: new transitivity reasoners for transitivity only
2585 * Provers/trancl.ML: new transitivity reasoner for transitive and
2586 reflexive-transitive closure of relations.
2588 * Provers/blast.ML: new reference depth_limit to make blast's depth
2589 limit (previously hard-coded with a value of 20) user-definable.
2591 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
2592 is peformed already. Object-logics merely need to finish their
2593 initial simpset configuration as before. INCOMPATIBILITY.
2598 * Symbolic syntax of Hilbert Choice Operator is now as follows:
2601 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
2603 The symbol \<some> is displayed as the alternative epsilon of LaTeX
2604 and x-symbol; use option '-m epsilon' to get it actually printed.
2605 Moreover, the mathematically important symbolic identifier \<epsilon>
2606 becomes available as variable, constant etc. INCOMPATIBILITY,
2608 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
2609 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
2610 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
2611 support corresponding Isar calculations.
2613 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
2616 * theory SetInterval: changed the syntax for open intervals:
2625 The old syntax is still supported but will disappear in the next
2626 release. For conversion use the following Emacs search and replace
2627 patterns (these are not perfect but work quite well):
2629 {)\([^\.]*\)\.\. -> {\1<\.\.}
2630 \.\.\([^(}]*\)(} -> \.\.<\1}
2632 * Theory Commutative_Ring (in Library): method comm_ring for proving
2633 equalities in commutative rings; method 'algebra' provides a generic
2636 * Theory Finite_Set: changed the syntax for 'setsum', summation over
2637 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
2638 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
2641 Some new syntax forms are available:
2643 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
2644 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
2645 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
2646 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
2648 The latter form "\<Sum>x < k. e" used to be based on a separate
2649 function "Summation", which has been discontinued.
2651 * theory Finite_Set: in structured induction proofs, the insert case
2652 is now 'case (insert x F)' instead of the old counterintuitive 'case
2655 * The 'refute' command has been extended to support a much larger
2656 fragment of HOL, including axiomatic type classes, constdefs and
2657 typedefs, inductive datatypes and recursion.
2659 * New tactics 'sat' and 'satx' to prove propositional tautologies.
2660 Requires zChaff with proof generation to be installed. See
2661 HOL/ex/SAT_Examples.thy for examples.
2663 * Datatype induction via method 'induct' now preserves the name of the
2664 induction variable. For example, when proving P(xs::'a list) by
2665 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
2666 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
2667 in unstructured proof scripts.
2669 * Reworked implementation of records. Improved scalability for
2670 records with many fields, avoiding performance problems for type
2671 inference. Records are no longer composed of nested field types, but
2672 of nested extension types. Therefore the record type only grows linear
2673 in the number of extensions and not in the number of fields. The
2674 top-level (users) view on records is preserved. Potential
2675 INCOMPATIBILITY only in strange cases, where the theory depends on the
2676 old record representation. The type generated for a record is called
2677 <record_name>_ext_type.
2679 Flag record_quick_and_dirty_sensitive can be enabled to skip the
2680 proofs triggered by a record definition or a simproc (if
2681 quick_and_dirty is enabled). Definitions of large records can take
2684 New simproc record_upd_simproc for simplification of multiple record
2685 updates enabled by default. Moreover, trivial updates are also
2686 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
2687 occasionally, since simplification is more powerful by default.
2689 * typedef: proper support for polymorphic sets, which contain extra
2690 type-variables in the term.
2692 * Simplifier: automatically reasons about transitivity chains
2693 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
2694 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
2695 old proofs break occasionally as simplification may now solve more
2696 goals than previously.
2698 * Simplifier: converts x <= y into x = y if assumption y <= x is
2699 present. Works for all partial orders (class "order"), in particular
2700 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
2703 * Simplifier: new simproc for "let x = a in f x". If a is a free or
2704 bound variable or a constant then the let is unfolded. Otherwise
2705 first a is simplified to b, and then f b is simplified to g. If
2706 possible we abstract b from g arriving at "let x = b in h x",
2707 otherwise we unfold the let and arrive at g. The simproc can be
2708 enabled/disabled by the reference use_let_simproc. Potential
2709 INCOMPATIBILITY since simplification is more powerful by default.
2711 * Classical reasoning: the meson method now accepts theorems as arguments.
2713 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
2714 jobs to provide advice on the provability of subgoals.
2716 * Theory OrderedGroup and Ring_and_Field: various additions and
2717 improvements to faciliate calculations involving equalities and
2720 The following theorems have been eliminated or modified
2723 abs_eq now named abs_of_nonneg
2724 abs_of_ge_0 now named abs_of_nonneg
2725 abs_minus_eq now named abs_of_nonpos
2726 imp_abs_id now named abs_of_nonneg
2727 imp_abs_neg_id now named abs_of_nonpos
2728 mult_pos now named mult_pos_pos
2729 mult_pos_le now named mult_nonneg_nonneg
2730 mult_pos_neg_le now named mult_nonneg_nonpos
2731 mult_pos_neg2_le now named mult_nonneg_nonpos2
2732 mult_neg now named mult_neg_neg
2733 mult_neg_le now named mult_nonpos_nonpos
2735 * The following lemmas in Ring_and_Field have been added to the simplifier:
2738 not_square_less_zero
2740 The following lemmas have been deleted from Real/RealPow:
2750 * Theory Parity: added rules for simplifying exponents.
2754 The following theorems have been eliminated or modified
2757 list_all_Nil now named list_all.simps(1)
2758 list_all_Cons now named list_all.simps(2)
2759 list_all_conv now named list_all_iff
2760 set_mem_eq now named mem_iff
2762 * Theories SetsAndFunctions and BigO (see HOL/Library) support
2763 asymptotic "big O" calculations. See the notes in BigO.thy.
2768 * Theory RealDef: better support for embedding natural numbers and
2769 integers in the reals.
2771 The following theorems have been eliminated or modified
2774 exp_ge_add_one_self now requires no hypotheses
2775 real_of_int_add reversed direction of equality (use [symmetric])
2776 real_of_int_minus reversed direction of equality (use [symmetric])
2777 real_of_int_diff reversed direction of equality (use [symmetric])
2778 real_of_int_mult reversed direction of equality (use [symmetric])
2780 * Theory RComplete: expanded support for floor and ceiling functions.
2782 * Theory Ln is new, with properties of the natural logarithm
2784 * Hyperreal: There is a new type constructor "star" for making
2785 nonstandard types. The old type names are now type synonyms:
2789 hcomplex = complex star
2791 * Hyperreal: Many groups of similarly-defined constants have been
2792 replaced by polymorphic versions (INCOMPATIBILITY):
2794 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
2796 starset <-- starsetNat, starsetC
2797 *s* <-- *sNat*, *sc*
2798 starset_n <-- starsetNat_n, starsetC_n
2799 *sn* <-- *sNatn*, *scn*
2800 InternalSets <-- InternalNatSets, InternalCSets
2802 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2803 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
2804 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
2805 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
2806 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
2808 * Hyperreal: Many type-specific theorems have been removed in favor of
2809 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
2811 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
2812 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
2813 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
2814 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
2815 right_minus <-- hypreal_add_minus
2816 left_minus <-- {hypreal,hcomplex}_add_minus_left
2817 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
2818 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
2819 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
2820 mult_1_right <-- hcomplex_mult_one_right
2821 mult_zero_left <-- hcomplex_mult_zero_left
2822 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
2823 right_distrib <-- hypnat_add_mult_distrib2
2824 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
2825 right_inverse <-- hypreal_mult_inverse
2826 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
2827 order_refl <-- {hypreal,hypnat}_le_refl
2828 order_trans <-- {hypreal,hypnat}_le_trans
2829 order_antisym <-- {hypreal,hypnat}_le_anti_sym
2830 order_less_le <-- {hypreal,hypnat}_less_le
2831 linorder_linear <-- {hypreal,hypnat}_le_linear
2832 add_left_mono <-- {hypreal,hypnat}_add_left_mono
2833 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
2834 add_nonneg_nonneg <-- hypreal_le_add_order
2836 * Hyperreal: Separate theorems having to do with type-specific
2837 versions of constants have been merged into theorems that apply to the
2838 new polymorphic constants (INCOMPATIBILITY):
2840 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
2841 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
2842 STAR_Un <-- {STAR,NatStar,STARC}_Un
2843 STAR_Int <-- {STAR,NatStar,STARC}_Int
2844 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
2845 STAR_subset <-- {STAR,NatStar,STARC}_subset
2846 STAR_mem <-- {STAR,NatStar,STARC}_mem
2847 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
2848 STAR_diff <-- {STAR,STARC}_diff
2849 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
2850 STARC_hcomplex_of_complex}_image_subset
2851 starset_n_Un <-- starset{Nat,C}_n_Un
2852 starset_n_Int <-- starset{Nat,C}_n_Int
2853 starset_n_Compl <-- starset{Nat,C}_n_Compl
2854 starset_n_diff <-- starset{Nat,C}_n_diff
2855 InternalSets_Un <-- Internal{Nat,C}Sets_Un
2856 InternalSets_Int <-- Internal{Nat,C}Sets_Int
2857 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
2858 InternalSets_diff <-- Internal{Nat,C}Sets_diff
2859 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
2860 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
2861 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
2862 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
2863 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
2864 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2865 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
2866 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
2867 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
2868 starfun_diff <-- starfun{C,RC,CR}_diff
2869 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
2870 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
2871 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
2872 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
2873 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
2874 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
2875 starfun_Id <-- starfunC_Id
2876 starfun_approx <-- starfun{Nat,CR}_approx
2877 starfun_capprox <-- starfun{C,RC}_capprox
2878 starfun_abs <-- starfunNat_rabs
2879 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
2880 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
2881 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
2882 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
2883 starfun_add_capprox <-- starfun{C,RC}_add_capprox
2884 starfun_add_approx <-- starfunCR_add_approx
2885 starfun_inverse_inverse <-- starfunC_inverse_inverse
2886 starfun_divide <-- starfun{C,CR,RC}_divide
2887 starfun_n <-- starfun{Nat,C}_n
2888 starfun_n_mult <-- starfun{Nat,C}_n_mult
2889 starfun_n_add <-- starfun{Nat,C}_n_add
2890 starfun_n_add_minus <-- starfunNat_n_add_minus
2891 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
2892 starfun_n_minus <-- starfun{Nat,C}_n_minus
2893 starfun_n_eq <-- starfun{Nat,C}_n_eq
2895 star_n_add <-- {hypreal,hypnat,hcomplex}_add
2896 star_n_minus <-- {hypreal,hcomplex}_minus
2897 star_n_diff <-- {hypreal,hcomplex}_diff
2898 star_n_mult <-- {hypreal,hcomplex}_mult
2899 star_n_inverse <-- {hypreal,hcomplex}_inverse
2900 star_n_le <-- {hypreal,hypnat}_le
2901 star_n_less <-- {hypreal,hypnat}_less
2902 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
2903 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
2904 star_n_abs <-- hypreal_hrabs
2905 star_n_divide <-- hcomplex_divide
2907 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
2908 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
2909 star_of_diff <-- hypreal_of_real_diff
2910 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
2911 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
2912 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
2913 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
2914 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
2915 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
2916 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
2917 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
2918 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
2919 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
2920 star_of_number_of <-- {hypreal,hcomplex}_number_of
2921 star_of_number_less <-- number_of_less_hypreal_of_real_iff
2922 star_of_number_le <-- number_of_le_hypreal_of_real_iff
2923 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
2924 star_of_less_number <-- hypreal_of_real_less_number_of_iff
2925 star_of_le_number <-- hypreal_of_real_le_number_of_iff
2926 star_of_power <-- hypreal_of_real_power
2927 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
2929 * Hyperreal: new method "transfer" that implements the transfer
2930 principle of nonstandard analysis. With a subgoal that mentions
2931 nonstandard types like "'a star", the command "apply transfer"
2932 replaces it with an equivalent one that mentions only standard types.
2933 To be successful, all free variables must have standard types; non-
2934 standard variables must have explicit universal quantifiers.
2936 * Hyperreal: A theory of Taylor series.
2941 * Discontinued special version of 'constdefs' (which used to support
2942 continuous functions) in favor of the general Pure one with full
2945 * New simplification procedure for solving continuity conditions; it
2946 is much faster on terms with many nested lambda abstractions (cubic
2947 instead of exponential time).
2949 * New syntax for domain package: selector names are now optional.
2950 Parentheses should be omitted unless argument is lazy, for example:
2952 domain 'a stream = cons "'a" (lazy "'a stream")
2954 * New command 'fixrec' for defining recursive functions with pattern
2955 matching; defining multiple functions with mutual recursion is also
2956 supported. Patterns may include the constants cpair, spair, up, sinl,
2957 sinr, or any data constructor defined by the domain package. The given
2958 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
2959 syntax and examples.
2961 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
2962 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
2963 but the proof obligation additionally includes an admissibility
2964 requirement. The packages generate instances of class cpo or pcpo,
2965 with continuity and strictness theorems for Rep and Abs.
2967 * HOLCF: Many theorems have been renamed according to a more standard naming
2968 scheme (INCOMPATIBILITY):
2970 foo_inject: "foo$x = foo$y ==> x = y"
2971 foo_eq: "(foo$x = foo$y) = (x = y)"
2972 foo_less: "(foo$x << foo$y) = (x << y)"
2973 foo_strict: "foo$UU = UU"
2974 foo_defined: "... ==> foo$x ~= UU"
2975 foo_defined_iff: "(foo$x = UU) = (x = UU)"
2980 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
2981 including the First Isomorphism Theorem (on quotienting by the kernel
2984 * ZF/Simplifier: install second copy of type solver that actually
2985 makes use of TC rules declared to Isar proof contexts (or locales);
2986 the old version is still required for ML proof scripts.
2991 * Converted to Isar theory format; use locales instead of axiomatic
2997 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
3000 * Pure/library.ML no longer defines its own option datatype, but uses
3001 that of the SML basis, which has constructors NONE and SOME instead of
3002 None and Some, as well as exception Option.Option instead of OPTION.
3003 The functions the, if_none, is_some, is_none have been adapted
3004 accordingly, while Option.map replaces apsome.
3006 * Pure/library.ML: the exception LIST has been given up in favour of
3007 the standard exceptions Empty and Subscript, as well as
3008 Library.UnequalLengths. Function like Library.hd and Library.tl are
3009 superceded by the standard hd and tl functions etc.
3011 A number of basic list functions are no longer exported to the ML
3012 toplevel, as they are variants of predefined functions. The following
3013 suggests how one can translate existing code:
3015 rev_append xs ys = List.revAppend (xs, ys)
3016 nth_elem (i, xs) = List.nth (xs, i)
3017 last_elem xs = List.last xs
3018 flat xss = List.concat xss
3019 seq fs = List.app fs
3020 partition P xs = List.partition P xs
3021 mapfilter f xs = List.mapPartial f xs
3023 * Pure/library.ML: several combinators for linear functional
3024 transformations, notably reverse application and composition:
3027 (x, y) |-> f f #-> g
3029 * Pure/library.ML: introduced/changed precedence of infix operators:
3031 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
3033 infix 3 o oo ooo oooo;
3034 infix 4 ~~ upto downto;
3036 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
3039 * Pure/library.ML: natural list combinators fold, fold_rev, and
3040 fold_map support linear functional transformations and nesting. For
3043 fold f [x1, ..., xN] y =
3044 y |> f x1 |> ... |> f xN
3046 (fold o fold) f [xs1, ..., xsN] y =
3047 y |> fold f xs1 |> ... |> fold f xsN
3049 fold f [x1, ..., xN] =
3052 (fold o fold) f [xs1, ..., xsN] =
3053 fold f xs1 #> ... #> fold f xsN
3055 * Pure/library.ML: the following selectors on type 'a option are
3058 the: 'a option -> 'a (*partial*)
3059 these: 'a option -> 'a where 'a = 'b list
3060 the_default: 'a -> 'a option -> 'a
3061 the_list: 'a option -> 'a list
3063 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
3064 basic operations for association lists, following natural argument
3065 order; moreover the explicit equality predicate passed here avoids
3066 potentially expensive polymorphic runtime equality checks.
3067 The old functions may be expressed as follows:
3069 assoc = uncurry (AList.lookup (op =))
3070 assocs = these oo AList.lookup (op =)
3071 overwrite = uncurry (AList.update (op =)) o swap
3073 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
3075 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
3076 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
3078 replacing make_keylist and keyfilter (occassionally used)
3081 make_keylist = AList.make
3082 keyfilter = AList.find (op =)
3084 * eq_fst and eq_snd now take explicit equality parameter, thus
3085 avoiding eqtypes. Naive rewrites:
3087 eq_fst = eq_fst (op =)
3088 eq_snd = eq_snd (op =)
3090 * Removed deprecated apl and apr (rarely used).
3093 apl (n, op) =>>= curry op n
3094 apr (op, m) =>>= fn n => op (n, m)
3096 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
3097 provides a reasonably efficient light-weight implementation of sets as
3100 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
3101 few new operations; existing lookup and update are now curried to
3102 follow natural argument order (for use with fold etc.);
3103 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
3105 * Pure/General: output via the Isabelle channels of
3106 writeln/warning/error etc. is now passed through Output.output, with a
3107 hook for arbitrary transformations depending on the print_mode
3108 (cf. Output.add_mode -- the first active mode that provides a output
3109 function wins). Already formatted output may be embedded into further
3110 text via Output.raw; the result of Pretty.string_of/str_of and derived
3111 functions (string_of_term/cterm/thm etc.) is already marked raw to
3112 accommodate easy composition of diagnostic messages etc. Programmers
3113 rarely need to care about Output.output or Output.raw at all, with
3114 some notable exceptions: Output.output is required when bypassing the
3115 standard channels (writeln etc.), or in token translations to produce
3116 properly formatted results; Output.raw is required when capturing
3117 already output material that will eventually be presented to the user
3118 a second time. For the default print mode, both Output.output and
3119 Output.raw have no effect.
3121 * Pure/General: Output.time_accumulator NAME creates an operator ('a
3122 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
3123 cumulative results are displayed at the end of a batch session.
3125 * Pure/General: File.sysify_path and File.quote_sysify path have been
3126 replaced by File.platform_path and File.shell_path (with appropriate
3127 hooks). This provides a clean interface for unusual systems where the
3128 internal and external process view of file names are different.
3130 * Pure: more efficient orders for basic syntactic entities: added
3131 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
3132 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
3133 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
3134 orders now -- potential INCOMPATIBILITY for code that depends on a
3135 particular order for Symtab.keys, Symtab.dest, etc. (consider using
3136 Library.sort_strings on result).
3138 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
3139 fold_types traverse types/terms from left to right, observing natural
3140 argument order. Supercedes previous foldl_XXX versions, add_frees,
3141 add_vars etc. have been adapted as well: INCOMPATIBILITY.
3143 * Pure: name spaces have been refined, with significant changes of the
3144 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
3145 to extern(_table). The plain name entry path is superceded by a
3146 general 'naming' context, which also includes the 'policy' to produce
3147 a fully qualified name and external accesses of a fully qualified
3148 name; NameSpace.extend is superceded by context dependent
3149 Sign.declare_name. Several theory and proof context operations modify
3150 the naming context. Especially note Theory.restore_naming and
3151 ProofContext.restore_naming to get back to a sane state; note that
3152 Theory.add_path is no longer sufficient to recover from
3153 Theory.absolute_path in particular.
3155 * Pure: new flags short_names (default false) and unique_names
3156 (default true) for controlling output of qualified names. If
3157 short_names is set, names are printed unqualified. If unique_names is
3158 reset, the name prefix is reduced to the minimum required to achieve
3159 the original result when interning again, even if there is an overlap
3160 with earlier declarations.
3162 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
3163 now 'extend', and 'merge' gets an additional Pretty.pp argument
3164 (useful for printing error messages). INCOMPATIBILITY.
3166 * Pure: major reorganization of the theory context. Type Sign.sg and
3167 Theory.theory are now identified, referring to the universal
3168 Context.theory (see Pure/context.ML). Actual signature and theory
3169 content is managed as theory data. The old code and interfaces were
3170 spread over many files and structures; the new arrangement introduces
3171 considerable INCOMPATIBILITY to gain more clarity:
3173 Context -- theory management operations (name, identity, inclusion,
3174 parents, ancestors, merge, etc.), plus generic theory data;
3176 Sign -- logical signature and syntax operations (declaring consts,
3177 types, etc.), plus certify/read for common entities;
3179 Theory -- logical theory operations (stating axioms, definitions,
3180 oracles), plus a copy of logical signature operations (consts,
3181 types, etc.); also a few basic management operations (Theory.copy,
3184 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
3185 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
3186 for convenience -- they merely return the theory.
3188 * Pure: type Type.tsig is superceded by theory in most interfaces.
3190 * Pure: the Isar proof context type is already defined early in Pure
3191 as Context.proof (note that ProofContext.context and Proof.context are
3192 aliases, where the latter is the preferred name). This enables other
3193 Isabelle components to refer to that type even before Isar is present.
3195 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
3196 typeK, constK, axiomK, oracleK), but provide explicit operations for
3197 any of these kinds. For example, Sign.intern typeK is now
3198 Sign.intern_type, Theory.hide_space Sign.typeK is now
3199 Theory.hide_types. Also note that former
3200 Theory.hide_classes/types/consts are now
3201 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
3202 internalize their arguments! INCOMPATIBILITY.
3204 * Pure: get_thm interface (of PureThy and ProofContext) expects
3205 datatype thmref (with constructors Name and NameSelection) instead of
3206 plain string -- INCOMPATIBILITY;
3208 * Pure: cases produced by proof methods specify options, where NONE
3209 means to remove case bindings -- INCOMPATIBILITY in
3212 * Pure: the following operations retrieve axioms or theorems from a
3213 theory node or theory hierarchy, respectively:
3215 Theory.axioms_of: theory -> (string * term) list
3216 Theory.all_axioms_of: theory -> (string * term) list
3217 PureThy.thms_of: theory -> (string * thm) list
3218 PureThy.all_thms_of: theory -> (string * thm) list
3220 * Pure: print_tac now outputs the goal through the trace channel.
3222 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
3223 Reference Toplevel.debug (default false) controls detailed printing
3224 and tracing of low-level exceptions; Toplevel.profiling (default 0)
3225 controls execution profiling -- set to 1 for time and 2 for space
3226 (both increase the runtime).
3228 * Isar session: The initial use of ROOT.ML is now always timed,
3229 i.e. the log will show the actual process times, in contrast to the
3230 elapsed wall-clock time that the outer shell wrapper produces.
3232 * Simplifier: improved handling of bound variables (nameless
3233 representation, avoid allocating new strings). Simprocs that invoke
3234 the Simplifier recursively should use Simplifier.inherit_bounds to
3235 avoid local name clashes. Failure to do so produces warnings
3236 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
3237 for further details.
3239 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
3240 bindings for all theorems stored within a given theory; this may help
3241 in porting non-Isar theories to Isar ones, while keeping ML proof
3242 scripts for the time being.
3244 * ML operator HTML.with_charset specifies the charset begin used for
3245 generated HTML files. For example:
3247 HTML.with_charset "utf-8" use_thy "Hebrew";
3248 HTML.with_charset "utf-8" use_thy "Chinese";
3253 * Allow symlinks to all proper Isabelle executables (Isabelle,
3254 isabelle, isatool etc.).
3256 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
3257 isatool doc, isatool mkdir, display_drafts etc.).
3259 * isatool usedir: option -f allows specification of the ML file to be
3260 used by Isabelle; default is ROOT.ML.
3262 * New isatool version outputs the version identifier of the Isabelle
3263 distribution being used.
3265 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
3266 (containing Boolean satisfiability problems) into Isabelle/HOL
3271 New in Isabelle2004 (April 2004)
3272 --------------------------------
3276 * Provers/order.ML: new efficient reasoner for partial and linear orders.
3277 Replaces linorder.ML.
3279 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
3280 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
3281 (\<a>...\<z>), are now considered normal letters, and can therefore
3282 be used anywhere where an ASCII letter (a...zA...Z) has until
3283 now. COMPATIBILITY: This obviously changes the parsing of some
3284 terms, especially where a symbol has been used as a binder, say
3285 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
3286 as an identifier. Fix it by inserting a space around former
3287 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
3288 existing theory and ML files.
3290 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
3292 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
3293 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
3294 a normal (but invisible) letter. For multiple letter subscripts repeat
3295 \<^isub> like this: x\<^isub>1\<^isub>2.
3297 * Pure: There are now sub-/superscripts that can span more than one
3298 character. Text between \<^bsub> and \<^esub> is set in subscript in
3299 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
3300 superscript. The new control characters are not identifier parts.
3302 * Pure: Control-symbols of the form \<^raw:...> will literally print the
3303 content of "..." to the latex file instead of \isacntrl... . The "..."
3304 may consist of any printable characters excluding the end bracket >.
3306 * Pure: Using new Isar command "finalconsts" (or the ML functions
3307 Theory.add_finals or Theory.add_finals_i) it is now possible to
3308 declare constants "final", which prevents their being given a definition
3309 later. It is useful for constants whose behaviour is fixed axiomatically
3310 rather than definitionally, such as the meta-logic connectives.
3312 * Pure: 'instance' now handles general arities with general sorts
3313 (i.e. intersections of classes),
3315 * Presentation: generated HTML now uses a CSS style sheet to make layout
3316 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
3317 It can be changed to alter the colors/layout of generated pages.
3322 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
3323 cut_tac, subgoal_tac and thin_tac:
3324 - Now understand static (Isar) contexts. As a consequence, users of Isar
3325 locales are no longer forced to write Isar proof scripts.
3326 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
3328 - INCOMPATIBILITY: names of variables to be instantiated may no
3329 longer be enclosed in quotes. Instead, precede variable name with `?'.
3330 This is consistent with the instantiation attribute "where".
3332 * Attributes "where" and "of":
3333 - Now take type variables of instantiated theorem into account when reading
3334 the instantiation string. This fixes a bug that caused instantiated
3335 theorems to have too special types in some circumstances.
3336 - "where" permits explicit instantiations of type variables.
3338 * Calculation commands "moreover" and "also" no longer interfere with
3339 current facts ("this"), admitting arbitrary combinations with "then"
3343 - Goal statements involving the context element "includes" no longer
3344 generate theorems with internal delta predicates (those ending on
3345 "_axioms") in the premise.
3346 Resolve particular premise with <locale>.intro to obtain old form.
3347 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
3348 specification and "includes" elements in goal statement.
3349 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
3350 [intro?] and [elim?] (respectively) by default.
3351 - Experimental command for instantiation of locales in proof contexts:
3352 instantiate <label>[<attrs>]: <loc>
3353 Instantiates locale <loc> and adds all its theorems to the current context
3354 taking into account their attributes. Label and attrs are optional
3355 modifiers, like in theorem declarations. If present, names of
3356 instantiated theorems are qualified with <label>, and the attributes
3357 <attrs> are applied after any attributes these theorems might have already.
3358 If the locale has assumptions, a chained fact of the form
3359 "<loc> t1 ... tn" is expected from which instantiations of the parameters
3360 are derived. The command does not support old-style locales declared
3361 with "locale (open)".
3362 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
3364 * HOL: Tactic emulation methods induct_tac and case_tac understand static
3370 * Proof import: new image HOL4 contains the imported library from
3371 the HOL4 system with about 2500 theorems. It is imported by
3372 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
3373 can be used like any other Isabelle image. See
3374 HOL/Import/HOL/README for more information.
3377 - Much improved handling of linear and partial orders.
3378 Reasoners for linear and partial orders are set up for type classes
3379 "linorder" and "order" respectively, and are added to the default simpset
3380 as solvers. This means that the simplifier can build transitivity chains
3381 to solve goals from the assumptions.
3382 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
3383 of blast or auto after simplification become unnecessary because the goal
3384 is solved by simplification already.
3386 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
3387 all proved in axiomatic type classes for semirings, rings and fields.
3390 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
3391 now formalized using the Ring_and_Field theory mentioned above.
3392 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
3393 than before, because now they are set up once in a generic manner.
3394 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
3395 Look for the general versions in Ring_and_Field (and Power if they concern
3398 * Type "rat" of the rational numbers is now available in HOL-Complex.
3401 - Record types are now by default printed with their type abbreviation
3402 instead of the list of all field types. This can be configured via
3403 the reference "print_record_type_abbr".
3404 - Simproc "record_upd_simproc" for simplification of multiple updates added
3405 (not enabled by default).
3406 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
3407 EX x. x = sel r to True (not enabled by default).
3408 - Tactic "record_split_simp_tac" to split and simplify records added.
3410 * 'specification' command added, allowing for definition by
3411 specification. There is also an 'ax_specification' command that
3412 introduces the new constants axiomatically.
3414 * arith(_tac) is now able to generate counterexamples for reals as well.
3416 * HOL-Algebra: new locale "ring" for non-commutative rings.
3418 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
3419 definitions, thanks to Sava Krsti\'{c} and John Matthews.
3421 * HOL-Matrix: a first theory for matrices in HOL with an application of
3422 matrix theory to linear programming.
3424 * Unions and Intersections:
3425 The latex output syntax of UN and INT has been changed
3426 from "\Union x \in A. B" to "\Union_{x \in A} B"
3427 i.e. the index formulae has become a subscript.
3428 Similarly for "\Union x. B", and for \Inter instead of \Union.
3430 * Unions and Intersections over Intervals:
3431 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
3432 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
3433 like in normal math, and corresponding versions for < and for intersection.
3435 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
3436 lexicographic dictonary ordering has been added as "lexord".
3438 * ML: the legacy theory structures Int and List have been removed. They had
3439 conflicted with ML Basis Library structures having the same names.
3441 * 'refute' command added to search for (finite) countermodels. Only works
3442 for a fragment of HOL. The installation of an external SAT solver is
3443 highly recommended. See "HOL/Refute.thy" for details.
3445 * 'quickcheck' command: Allows to find counterexamples by evaluating
3446 formulae under an assignment of free variables to random values.
3447 In contrast to 'refute', it can deal with inductive datatypes,
3448 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
3454 * Streams now come with concatenation and are part of the HOLCF image
3458 New in Isabelle2003 (May 2003)
3459 ------------------------------
3463 * Provers/simplifier:
3465 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
3466 Assumptions are now subject to complete mutual simplification,
3467 not just from left to right. The simplifier now preserves
3468 the order of assumptions.
3470 Potential INCOMPATIBILITY:
3472 -- simp sometimes diverges where the old version did
3473 not, e.g. invoking simp on the goal
3475 [| P (f x); y = x; f x = f y |] ==> Q
3477 now gives rise to the infinite reduction sequence
3479 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
3481 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
3484 -- Tactics combining classical reasoner and simplification (such as auto)
3485 are also affected by this change, because many of them rely on
3486 simp. They may sometimes diverge as well or yield a different numbers
3487 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
3488 in case of problems. Sometimes subsequent calls to the classical
3489 reasoner will fail because a preceeding call to the simplifier too
3490 eagerly simplified the goal, e.g. deleted redundant premises.
3492 - The simplifier trace now shows the names of the applied rewrite rules
3494 - You can limit the number of recursive invocations of the simplifier
3495 during conditional rewriting (where the simplifie tries to solve the
3496 conditions before applying the rewrite rule):
3497 ML "simp_depth_limit := n"
3498 where n is an integer. Thus you can force termination where previously
3499 the simplifier would diverge.
3501 - Accepts free variables as head terms in congruence rules. Useful in Isar.
3503 - No longer aborts on failed congruence proof. Instead, the
3504 congruence is ignored.
3506 * Pure: New generic framework for extracting programs from constructive
3507 proofs. See HOL/Extraction.thy for an example instantiation, as well
3508 as HOL/Extraction for some case studies.
3510 * Pure: The main goal of the proof state is no longer shown by default, only
3511 the subgoals. This behaviour is controlled by a new flag.
3512 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
3513 (ML: Proof.show_main_goal).
3515 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
3516 rules whose conclusion matches subgoal 1:
3517 PG menu: Isabelle/Isar -> Show me -> matching rules
3518 The rules are ordered by how closely they match the subgoal.
3519 In particular, rules that solve a subgoal outright are displayed first
3520 (or rather last, the way they are printed).
3521 (ML: ProofGeneral.print_intros())
3523 * Pure: New flag trace_unify_fail causes unification to print
3524 diagnostic information (PG: in trace buffer) when it fails. This is
3525 useful for figuring out why single step proofs like rule, erule or
3528 * Pure: Locale specifications now produce predicate definitions
3529 according to the body of text (covering assumptions modulo local
3530 definitions); predicate "loc_axioms" covers newly introduced text,
3531 while "loc" is cumulative wrt. all included locale expressions; the
3532 latter view is presented only on export into the global theory
3533 context; potential INCOMPATIBILITY, use "(open)" option to fall back
3534 on the old view without predicates;
3536 * Pure: predefined locales "var" and "struct" are useful for sharing
3537 parameters (as in CASL, for example); just specify something like
3538 ``var x + var y + struct M'' as import;
3540 * Pure: improved thms_containing: proper indexing of facts instead of
3541 raw theorems; check validity of results wrt. current name space;
3542 include local facts of proof configuration (also covers active
3543 locales), cover fixed variables in index; may use "_" in term
3544 specification; an optional limit for the number of printed facts may
3545 be given (the default is 40);
3547 * Pure: disallow duplicate fact bindings within new-style theory files
3550 * Provers: improved induct method: assumptions introduced by case
3551 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
3552 the goal statement); "foo" still refers to all facts collectively;
3554 * Provers: the function blast.overloaded has been removed: all constants
3555 are regarded as potentially overloaded, which improves robustness in exchange
3556 for slight decrease in efficiency;
3558 * Provers/linorder: New generic prover for transitivity reasoning over
3559 linear orders. Note: this prover is not efficient!
3561 * Isar: preview of problems to finish 'show' now produce an error
3562 rather than just a warning (in interactive mode);
3569 - Produces a counter example if it cannot prove a goal.
3570 Note that the counter example may be spurious if the goal is not a formula
3571 of quantifier-free linear arithmetic.
3572 In ProofGeneral the counter example appears in the trace buffer.
3574 - Knows about div k and mod k where k is a numeral of type nat or int.
3576 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
3577 linear arithmetic fails. This takes account of quantifiers and divisibility.
3578 Presburger arithmetic can also be called explicitly via presburger(_tac).
3580 * simp's arithmetic capabilities have been enhanced a bit: it now
3581 takes ~= in premises into account (by performing a case split);
3583 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
3584 are distributed over a sum of terms;
3586 * New tactic "trans_tac" and method "trans" instantiate
3587 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
3590 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
3591 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
3593 * 'typedef' command has new option "open" to suppress the set
3596 * functions Min and Max on finite sets have been introduced (theory
3599 * attribute [symmetric] now works for relations as well; it turns
3600 (x,y) : R^-1 into (y,x) : R, and vice versa;
3602 * induct over a !!-quantified statement (say !!x1..xn):
3603 each "case" automatically performs "fix x1 .. xn" with exactly those names.
3605 * Map: `empty' is no longer a constant but a syntactic abbreviation for
3606 %x. None. Warning: empty_def now refers to the previously hidden definition
3609 * Algebra: formalization of classical algebra. Intended as base for
3610 any algebraic development in Isabelle. Currently covers group theory
3611 (up to Sylow's theorem) and ring theory (Universal Property of
3612 Univariate Polynomials). Contributions welcome;
3614 * GroupTheory: deleted, since its material has been moved to Algebra;
3616 * Complex: new directory of the complex numbers with numeric constants,
3617 nonstandard complex numbers, and some complex analysis, standard and
3618 nonstandard (Jacques Fleuriot);
3620 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
3622 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
3625 * Real/HahnBanach: updated and adapted to locales;
3627 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
3630 * UNITY: added the Meier-Sanders theory of progress sets;
3632 * MicroJava: bytecode verifier and lightweight bytecode verifier
3633 as abstract algorithms, instantiated to the JVM;
3635 * Bali: Java source language formalization. Type system, operational
3636 semantics, axiomatic semantics. Supported language features:
3637 classes, interfaces, objects,virtual methods, static methods,
3638 static/instance fields, arrays, access modifiers, definite
3639 assignment, exceptions.
3644 * ZF/Constructible: consistency proof for AC (Gdel's constructible
3647 * Main ZF: virtually all theories converted to new-style format;
3652 * Pure: Tactic.prove provides sane interface for internal proofs;
3653 omits the infamous "standard" operation, so this is more appropriate
3654 than prove_goalw_cterm in many situations (e.g. in simprocs);
3656 * Pure: improved error reporting of simprocs;
3658 * Provers: Simplifier.simproc(_i) provides sane interface for setting
3662 *** Document preparation ***
3664 * uses \par instead of \\ for line breaks in theory text. This may
3665 shift some page breaks in large documents. To get the old behaviour
3666 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
3668 * minimized dependencies of isabelle.sty and isabellesym.sty on
3671 * \<euro> now needs package babel/greek instead of marvosym (which
3674 * normal size for \<zero>...\<nine> (uses \mathbf instead of
3679 New in Isabelle2002 (March 2002)
3680 --------------------------------
3682 *** Document preparation ***
3684 * greatly simplified document preparation setup, including more
3685 graceful interpretation of isatool usedir -i/-d/-D options, and more
3686 instructive isatool mkdir; users should basically be able to get
3687 started with "isatool mkdir HOL Test && isatool make"; alternatively,
3688 users may run a separate document processing stage manually like this:
3689 "isatool usedir -D output HOL Test && isatool document Test/output";
3691 * theory dependency graph may now be incorporated into documents;
3692 isatool usedir -g true will produce session_graph.eps/.pdf for use
3693 with \includegraphics of LaTeX;
3695 * proper spacing of consecutive markup elements, especially text
3696 blocks after section headings;
3698 * support bold style (for single symbols only), input syntax is like
3699 this: "\<^bold>\<alpha>" or "\<^bold>A";
3701 * \<bullet> is now output as bold \cdot by default, which looks much
3702 better in printed text;
3704 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
3705 note that these symbols are currently unavailable in Proof General /
3706 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
3708 * isatool latex no longer depends on changed TEXINPUTS, instead
3709 isatool document copies the Isabelle style files to the target
3715 * Pure/Provers: improved proof by cases and induction;
3716 - 'case' command admits impromptu naming of parameters (such as
3718 - 'induct' method divinates rule instantiation from the inductive
3719 claim; no longer requires excessive ?P bindings for proper
3720 instantiation of cases;
3721 - 'induct' method properly enumerates all possibilities of set/type
3722 rules; as a consequence facts may be also passed through *type*
3723 rules without further ado;
3724 - 'induct' method now derives symbolic cases from the *rulified*
3725 rule (before it used to rulify cases stemming from the internal
3726 atomized version); this means that the context of a non-atomic
3727 statement becomes is included in the hypothesis, avoiding the
3728 slightly cumbersome show "PROP ?case" form;
3729 - 'induct' may now use elim-style induction rules without chaining
3730 facts, using ``missing'' premises from the goal state; this allows
3731 rules stemming from inductive sets to be applied in unstructured
3732 scripts, while still benefitting from proper handling of non-atomic
3733 statements; NB: major inductive premises need to be put first, all
3734 the rest of the goal is passed through the induction;
3735 - 'induct' proper support for mutual induction involving non-atomic
3736 rule statements (uses the new concept of simultaneous goals, see
3738 - append all possible rule selections, but only use the first
3739 success (no backtracking);
3740 - removed obsolete "(simplified)" and "(stripped)" options of methods;
3741 - undeclared rule case names default to numbers 1, 2, 3, ...;
3742 - added 'print_induct_rules' (covered by help item in recent Proof
3744 - moved induct/cases attributes to Pure, methods to Provers;
3745 - generic method setup instantiated for FOL and HOL;
3747 * Pure: support multiple simultaneous goal statements, for example
3748 "have a: A and b: B" (same for 'theorem' etc.); being a pure
3749 meta-level mechanism, this acts as if several individual goals had
3750 been stated separately; in particular common proof methods need to be
3751 repeated in order to cover all claims; note that a single elimination
3752 step is *not* sufficient to establish the two conjunctions, so this
3755 assume "A & B" then have A and B .. (*".." fails*)
3757 better use "obtain" in situations as above; alternative refer to
3758 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
3760 * Pure: proper integration with ``locales''; unlike the original
3761 version by Florian Kammller, Isar locales package high-level proof
3762 contexts rather than raw logical ones (e.g. we admit to include
3763 attributes everywhere); operations on locales include merge and
3764 rename; support for implicit arguments (``structures''); simultaneous
3765 type-inference over imports and text; see also HOL/ex/Locales.thy for
3768 * Pure: the following commands have been ``localized'', supporting a
3769 target locale specification "(in name)": 'lemma', 'theorem',
3770 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
3771 stored both within the locale and at the theory level (exported and
3772 qualified by the locale name);
3774 * Pure: theory goals may now be specified in ``long'' form, with
3775 ad-hoc contexts consisting of arbitrary locale elements. for example
3776 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
3777 definitions may be given, too); the result is a meta-level rule with
3778 the context elements being discharged in the obvious way;
3780 * Pure: new proof command 'using' allows to augment currently used
3781 facts after a goal statement ('using' is syntactically analogous to
3782 'apply', but acts on the goal's facts only); this allows chained facts
3783 to be separated into parts given before and after a claim, as in
3784 ``from a and b have C using d and e <proof>'';
3786 * Pure: renamed "antecedent" case to "rule_context";
3788 * Pure: new 'judgment' command records explicit information about the
3789 object-logic embedding (used by several tools internally); no longer
3790 use hard-wired "Trueprop";
3792 * Pure: added 'corollary' command;
3794 * Pure: fixed 'token_translation' command;
3796 * Pure: removed obsolete 'exported' attribute;
3798 * Pure: dummy pattern "_" in is/let is now automatically lifted over
3799 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
3800 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
3802 * Pure: method 'atomize' presents local goal premises as object-level
3803 statements (atomic meta-level propositions); setup controlled via
3804 rewrite rules declarations of 'atomize' attribute; example
3805 application: 'induct' method with proper rule statements in improper
3808 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
3809 now consider the syntactic context of assumptions, giving a better
3810 chance to get type-inference of the arguments right (this is
3811 especially important for locales);
3813 * Pure: "sorry" no longer requires quick_and_dirty in interactive
3816 * Pure/obtain: the formal conclusion "thesis", being marked as
3817 ``internal'', may no longer be reference directly in the text;
3818 potential INCOMPATIBILITY, may need to use "?thesis" in rare
3821 * Pure: generic 'sym' attribute which declares a rule both as pure
3822 'elim?' and for the 'symmetric' operation;
3824 * Pure: marginal comments ``--'' may now occur just anywhere in the
3825 text; the fixed correlation with particular command syntax has been
3828 * Pure: new method 'rules' is particularly well-suited for proof
3829 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
3830 but often produces more compact proof terms with less detours;
3832 * Pure/Provers/classical: simplified integration with pure rule
3833 attributes and methods; the classical "intro?/elim?/dest?"
3834 declarations coincide with the pure ones; the "rule" method no longer
3835 includes classically swapped intros; "intro" and "elim" methods no
3836 longer pick rules from the context; also got rid of ML declarations
3837 AddXIs/AddXEs/AddXDs; all of this has some potential for
3840 * Provers/classical: attribute 'swapped' produces classical inversions
3841 of introduction rules;
3843 * Provers/simplifier: 'simplified' attribute may refer to explicit
3844 rules instead of full simplifier context; 'iff' attribute handles
3847 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
3849 * HOL: 'recdef' now fails on unfinished automated proofs, use
3850 "(permissive)" option to recover old behavior;
3852 * HOL: 'inductive' no longer features separate (collective) attributes
3853 for 'intros' (was found too confusing);
3855 * HOL: properly declared induction rules less_induct and
3861 * HOL: moved over to sane numeral syntax; the new policy is as
3864 - 0 and 1 are polymorphic constants, which are defined on any
3865 numeric type (nat, int, real etc.);
3867 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
3868 binary representation internally;
3870 - type nat has special constructor Suc, and generally prefers Suc 0
3871 over 1::nat and Suc (Suc 0) over 2::nat;
3873 This change may cause significant problems of INCOMPATIBILITY; here
3874 are some hints on converting existing sources:
3876 - due to the new "num" token, "-0" and "-1" etc. are now atomic
3877 entities, so expressions involving "-" (unary or binary minus) need
3878 to be spaced properly;
3880 - existing occurrences of "1" may need to be constraint "1::nat" or
3881 even replaced by Suc 0; similar for old "2";
3883 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
3885 - remove all special provisions on numerals in proofs;
3887 * HOL: simp rules nat_number expand numerals on nat to Suc/0
3888 representation (depends on bin_arith_simps in the default context);
3890 * HOL: symbolic syntax for x^2 (numeral 2);
3892 * HOL: the class of all HOL types is now called "type" rather than
3893 "term"; INCOMPATIBILITY, need to adapt references to this type class
3894 in axclass/classes, instance/arities, and (usually rare) occurrences
3895 in typings (of consts etc.); internally the class is called
3896 "HOL.type", ML programs should refer to HOLogic.typeS;
3898 * HOL/record package improvements:
3899 - new derived operations "fields" to build a partial record section,
3900 "extend" to promote a fixed record to a record scheme, and
3901 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
3902 declared as simp by default;
3903 - shared operations ("more", "fields", etc.) now need to be always
3904 qualified) --- potential INCOMPATIBILITY;
3905 - removed "make_scheme" operations (use "make" with "extend") --
3907 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
3908 - provides cases/induct rules for use with corresponding Isar
3909 methods (for concrete records, record schemes, concrete more
3910 parts, and schematic more parts -- in that order);
3911 - internal definitions directly based on a light-weight abstract
3912 theory of product types over typedef rather than datatype;
3914 * HOL: generic code generator for generating executable ML code from
3915 specifications; specific support for HOL constructs such as inductive
3916 datatypes and sets, as well as recursive functions; can be invoked
3917 via 'generate_code' theory section;
3919 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
3921 * HOL: consolidated and renamed several theories. In particular:
3922 Ord.thy has been absorbed into HOL.thy
3923 String.thy has been absorbed into List.thy
3925 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
3926 (beware of argument permutation!);
3928 * HOL: linorder_less_split superseded by linorder_cases;
3930 * HOL/List: "nodups" renamed to "distinct";
3932 * HOL: added "The" definite description operator; move Hilbert's "Eps"
3933 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
3934 - Ex_def has changed, now need to use some_eq_ex
3936 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
3937 in this (rare) case use:
3939 delSWrapper "split_all_tac"
3940 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
3942 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
3945 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
3946 Isabelle's type classes, ^ on functions and relations has too general
3947 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
3948 necessary to attach explicit type constraints;
3950 * HOL/Relation: the prefix name of the infix "O" has been changed from
3951 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
3952 renamed accordingly (eg "compI" -> "rel_compI").
3954 * HOL: syntax translations now work properly with numerals and records
3957 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
3958 of "lam" -- INCOMPATIBILITY;
3960 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
3961 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
3962 renamed "Product_Type.unit";
3964 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
3966 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
3967 the "cases" method);
3969 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
3972 * HOL/IMP: updated and converted to new-style theory format; several
3973 parts turned into readable document, with proper Isar proof texts and
3974 some explanations (by Gerwin Klein);
3976 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
3978 * HOL-Hyperreal is now a logic image;
3983 * Isar: consts/constdefs supports mixfix syntax for continuous
3986 * Isar: domain package adapted to new-style theory format, e.g. see
3989 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
3990 potential INCOMPATIBILITY; now use plain induct_tac instead of former
3991 lift.induct_tac, always use UU instead of Undef;
3993 * HOLCF/IMP: updated and converted to new-style theory;
3998 * Isar: proper integration of logic-specific tools and packages,
3999 including theory commands '(co)inductive', '(co)datatype',
4000 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
4001 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
4003 * theory Main no longer includes AC; for the Axiom of Choice, base
4004 your theory on Main_ZFC;
4006 * the integer library now covers quotients and remainders, with many
4007 laws relating division to addition, multiplication, etc.;
4009 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
4010 typeless version of the formalism;
4012 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
4015 * ZF/Induct: new directory for examples of inductive definitions,
4016 including theory Multiset for multiset orderings; converted to
4017 new-style theory format;
4019 * ZF: many new theorems about lists, ordinals, etc.;
4024 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
4025 variable proof controls level of detail: 0 = no proofs (only oracle
4026 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
4027 also ref manual for further ML interfaces;
4029 * Pure/axclass: removed obsolete ML interface
4030 goal_subclass/goal_arity;
4032 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
4033 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
4034 separate tokens, so expressions involving minus need to be spaced
4037 * Pure/syntax: support non-oriented infixes, using keyword "infix"
4038 rather than "infixl" or "infixr";
4040 * Pure/syntax: concrete syntax for dummy type variables admits genuine
4041 sort constraint specifications in type inference; e.g. "x::_::foo"
4042 ensures that the type of "x" is of sort "foo" (but not necessarily a
4045 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
4046 control output of nested => (types); the default behavior is
4049 * Pure/syntax: builtin parse translation for "_constify" turns valued
4050 tokens into AST constants;
4052 * Pure/syntax: prefer later declarations of translations and print
4053 translation functions; potential INCOMPATIBILITY: need to reverse
4054 multiple declarations for same syntax element constant;
4056 * Pure/show_hyps reset by default (in accordance to existing Isar
4059 * Provers/classical: renamed addaltern to addafter, addSaltern to
4062 * Provers/clasimp: ``iff'' declarations now handle conditional rules
4065 * system: tested support for MacOS X; should be able to get Isabelle +
4066 Proof General to work in a plain Terminal after installing Poly/ML
4067 (e.g. from the Isabelle distribution area) and GNU bash alone
4068 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
4069 support requires further installations, e.g. from
4070 http://fink.sourceforge.net/);
4072 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
4074 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
4075 of 40 MB), cf. ML_OPTIONS;
4077 * system: Proof General keywords specification is now part of the
4078 Isabelle distribution (see etc/isar-keywords.el);
4080 * system: support for persistent Proof General sessions (refrain from
4081 outdating all loaded theories on startup); user may create writable
4082 logic images like this: ``isabelle -q HOL Test'';
4084 * system: smart selection of Isabelle process versus Isabelle
4085 interface, accommodates case-insensitive file systems (e.g. HFS+); may
4086 run both "isabelle" and "Isabelle" even if file names are badly
4087 damaged (executable inspects the case of the first letter of its own
4088 name); added separate "isabelle-process" and "isabelle-interface";
4090 * system: refrain from any attempt at filtering input streams; no
4091 longer support ``8bit'' encoding of old isabelle font, instead proper
4092 iso-latin characters may now be used; the related isatools
4093 "symbolinput" and "nonascii" have disappeared as well;
4095 * system: removed old "xterm" interface (the print modes "xterm" and
4096 "xterm_color" are still available for direct use in a suitable
4101 New in Isabelle99-2 (February 2001)
4102 -----------------------------------
4104 *** Overview of INCOMPATIBILITIES ***
4106 * HOL: please note that theories in the Library and elsewhere often use the
4107 new-style (Isar) format; to refer to their theorems in an ML script you must
4108 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
4110 * HOL: inductive package no longer splits induction rule aggressively,
4111 but only as far as specified by the introductions given; the old
4112 format may be recovered via ML function complete_split_rule or attribute
4113 'split_rule (complete)';
4115 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
4116 gfp_Tarski to gfp_unfold;
4118 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
4120 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
4121 relation); infix "^^" has been renamed "``"; infix "``" has been
4122 renamed "`"; "univalent" has been renamed "single_valued";
4124 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
4127 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
4129 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
4131 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
4132 consequence, it is no longer monotonic wrt. the local goal context
4133 (which is now passed through the inductive cases);
4135 * Document preparation: renamed standard symbols \<ll> to \<lless> and
4136 \<gg> to \<ggreater>;
4139 *** Document preparation ***
4141 * \isabellestyle{NAME} selects version of Isabelle output (currently
4142 available: are "it" for near math-mode best-style output, "sl" for
4143 slanted text style, and "tt" for plain type-writer; if no
4144 \isabellestyle command is given, output is according to slanted
4147 * support sub/super scripts (for single symbols only), input syntax is
4148 like this: "A\<^sup>*" or "A\<^sup>\<star>";
4150 * some more standard symbols; see Appendix A of the system manual for
4151 the complete list of symbols defined in isabellesym.sty;
4153 * improved isabelle style files; more abstract symbol implementation
4154 (should now use \isamath{...} and \isatext{...} in custom symbol
4157 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
4158 state; Note that presentation of goal states does not conform to
4159 actual human-readable proof documents. Please do not include goal
4160 states into document output unless you really know what you are doing!
4162 * proper indentation of antiquoted output with proportional LaTeX
4165 * no_document ML operator temporarily disables LaTeX document
4168 * isatool unsymbolize tunes sources for plain ASCII communication;
4173 * Pure: Isar now suffers initial goal statements to contain unbound
4174 schematic variables (this does not conform to actual readable proof
4175 documents, due to unpredictable outcome and non-compositional proof
4176 checking); users who know what they are doing may use schematic goals
4177 for Prolog-style synthesis of proven results;
4179 * Pure: assumption method (an implicit finishing) now handles actual
4182 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
4183 initial goal, declare "that" only as Pure intro (only for single
4184 steps); the "that" rule assumption may now be involved in implicit
4185 finishing, thus ".." becomes a feasible for trivial obtains;
4187 * Pure: default proof step now includes 'intro_classes'; thus trivial
4188 instance proofs may be performed by "..";
4190 * Pure: ?thesis / ?this / "..." now work for pure meta-level
4193 * Pure: more robust selection of calculational rules;
4195 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
4196 rule (as well as the assumption rule);
4198 * Pure: 'thm_deps' command visualizes dependencies of theorems and
4199 lemmas, using the graph browser tool;
4201 * Pure: predict failure of "show" in interactive mode;
4203 * Pure: 'thms_containing' now takes actual terms as arguments;
4205 * HOL: improved method 'induct' --- now handles non-atomic goals
4206 (potential INCOMPATIBILITY); tuned error handling;
4208 * HOL: cases and induct rules now provide explicit hints about the
4209 number of facts to be consumed (0 for "type" and 1 for "set" rules);
4210 any remaining facts are inserted into the goal verbatim;
4212 * HOL: local contexts (aka cases) may now contain term bindings as
4213 well; the 'cases' and 'induct' methods new provide a ?case binding for
4214 the result to be shown in each case;
4216 * HOL: added 'recdef_tc' command;
4218 * isatool convert assists in eliminating legacy ML scripts;
4223 * HOL/Library: a collection of generic theories to be used together
4224 with main HOL; the theory loader path already includes this directory
4225 by default; the following existing theories have been moved here:
4226 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
4227 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
4229 * HOL/Unix: "Some aspects of Unix file-system security", a typical
4230 modelling and verification task performed in Isabelle/HOL +
4231 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
4233 * HOL/Algebra: special summation operator SUM no longer exists, it has
4234 been replaced by setsum; infix 'assoc' now has priority 50 (like
4235 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
4236 'domain', this makes the theory consistent with mathematical
4239 * HOL basics: added overloaded operations "inverse" and "divide"
4240 (infix "/"), syntax for generic "abs" operation, generic summation
4243 * HOL/typedef: simplified package, provide more useful rules (see also
4246 * HOL/datatype: induction rule for arbitrarily branching datatypes is
4247 now expressed as a proper nested rule (old-style tactic scripts may
4248 require atomize_strip_tac to cope with non-atomic premises);
4250 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
4251 to "split_conv" (old name still available for compatibility);
4253 * HOL: improved concrete syntax for strings (e.g. allows translation
4254 rules with string literals);
4256 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
4257 and Fleuriot's mechanization of analysis, including the transcendental
4258 functions for the reals;
4260 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
4265 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
4266 "lam" is displayed as TWO lambda-symbols
4268 * CTT: theory Main now available, containing everything (that is, Bool
4274 * Pure: the Simplifier has been implemented properly as a derived rule
4275 outside of the actual kernel (at last!); the overall performance
4276 penalty in practical applications is about 50%, while reliability of
4277 the Isabelle inference kernel has been greatly improved;
4279 * print modes "brackets" and "no_brackets" control output of nested =>
4280 (types) and ==> (props); the default behaviour is "brackets";
4282 * Provers: fast_tac (and friends) now handle actual object-logic rules
4283 as assumptions as well;
4285 * system: support Poly/ML 4.0;
4287 * system: isatool install handles KDE version 1 or 2;
4291 New in Isabelle99-1 (October 2000)
4292 ----------------------------------
4294 *** Overview of INCOMPATIBILITIES ***
4296 * HOL: simplification of natural numbers is much changed; to partly
4297 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
4298 issue the following ML commands:
4300 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
4301 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
4303 * HOL: simplification no longer dives into case-expressions; this is
4304 controlled by "t.weak_case_cong" for each datatype t;
4306 * HOL: nat_less_induct renamed to less_induct;
4308 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
4309 fixsome to patch .thy and .ML sources automatically;
4311 select_equality -> some_equality
4312 select_eq_Ex -> some_eq_ex
4313 selectI2EX -> someI2_ex
4316 select1_equality -> some1_equality
4317 Eps_sym_eq -> some_sym_eq_trivial
4318 Eps_eq -> some_eq_trivial
4320 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
4322 * HOL: removed obsolete theorem binding expand_if (refer to split_if
4325 * HOL: the recursion equations generated by 'recdef' are now called
4326 f.simps instead of f.rules;
4328 * HOL: qed_spec_mp now also handles bounded ALL as well;
4330 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
4331 sometimes be needed;
4333 * HOL: the constant for "f``x" is now "image" rather than "op ``";
4335 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
4337 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
4338 product is now "<*>" instead of "Times"; the lexicographic product is
4339 now "<*lex*>" instead of "**";
4341 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
4342 of main HOL, but was unused); better use HOL's datatype package;
4344 * HOL: removed "symbols" syntax for constant "override" of theory Map;
4345 the old syntax may be recovered as follows:
4348 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
4349 (infixl "\\<oplus>" 100)
4351 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4353 * HOL/ML: even fewer consts are declared as global (see theories Ord,
4354 Lfp, Gfp, WF); this only affects ML packages that refer to const names
4357 * HOL and ZF: syntax for quotienting wrt an equivalence relation
4358 changed from A/r to A//r;
4360 * ZF: new treatment of arithmetic (nat & int) may break some old
4363 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
4364 rulify -> rule_format, elimify -> elim_format, ...);
4366 * Isar/Provers: intro/elim/dest attributes changed; renamed
4367 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
4368 should have to change intro!! to intro? only); replaced "delrule" by
4371 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
4373 * Provers: strengthened force_tac by using new first_best_tac;
4375 * LaTeX document preparation: several changes of isabelle.sty (see
4379 *** Document preparation ***
4381 * formal comments (text blocks etc.) in new-style theories may now
4382 contain antiquotations of thm/prop/term/typ/text to be presented
4383 according to latex print mode; concrete syntax is like this:
4384 @{term[show_types] "f(x) = a + x"};
4386 * isatool mkdir provides easy setup of Isabelle session directories,
4387 including proper document sources;
4389 * generated LaTeX sources are now deleted after successful run
4390 (isatool document -c); may retain a copy somewhere else via -D option
4393 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
4394 style files, achieving self-contained LaTeX sources and simplifying
4397 * old-style theories now produce (crude) LaTeX output as well;
4399 * browser info session directories are now self-contained (may be put
4400 on WWW server seperately); improved graphs of nested sessions; removed
4401 graph for 'all sessions';
4403 * several improvements in isabelle style files; \isabellestyle{it}
4404 produces fake math mode output; \isamarkupheader is now \section by
4405 default; see lib/texinputs/isabelle.sty etc.;
4410 * Isar/Pure: local results and corresponding term bindings are now
4411 subject to Hindley-Milner polymorphism (similar to ML); this
4412 accommodates incremental type-inference very nicely;
4414 * Isar/Pure: new derived language element 'obtain' supports
4415 generalized existence reasoning;
4417 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
4418 support accumulation of results, without applying any rules yet;
4419 useful to collect intermediate results without explicit name
4420 references, and for use with transitivity rules with more than 2
4423 * Isar/Pure: scalable support for case-analysis type proofs: new
4424 'case' language element refers to local contexts symbolically, as
4425 produced by certain proof methods; internally, case names are attached
4426 to theorems as "tags";
4428 * Isar/Pure: theory command 'hide' removes declarations from
4429 class/type/const name spaces;
4431 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
4432 indicate potential overloading;
4434 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
4436 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
4437 "{a,b,c}" instead of {a,b,c};
4439 * Isar/Pure now provides its own version of intro/elim/dest
4440 attributes; useful for building new logics, but beware of confusion
4441 with the version in Provers/classical;
4443 * Isar/Pure: the local context of (non-atomic) goals is provided via
4444 case name 'antecedent';
4446 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
4447 to the current context is now done automatically);
4449 * Isar/Pure: theory command 'method_setup' provides a simple interface
4450 for definining proof methods in ML;
4452 * Isar/Provers: intro/elim/dest attributes changed; renamed
4453 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
4454 most cases, one should have to change intro!! to intro? only);
4455 replaced "delrule" by "rule del";
4457 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
4458 'symmetric' attribute (the latter supercedes [RS sym]);
4460 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
4461 method modifier); 'simp' method: 'only:' modifier removes loopers as
4462 well (including splits);
4464 * Isar/Provers: Simplifier and Classical methods now support all kind
4465 of modifiers used in the past, including 'cong', 'iff', etc.
4467 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
4468 of Simplifier and Classical reasoner);
4470 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
4471 now support named cases; major packages (inductive, datatype, primrec,
4472 recdef) support case names and properly name parameters;
4474 * Isar/HOL: new transitivity rules for substitution in inequalities --
4475 monotonicity conditions are extracted to be proven at end of
4478 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
4481 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
4482 split_if split_if_asm; datatype package provides theorems foo.splits =
4483 foo.split foo.split_asm for each datatype;
4485 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
4486 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
4487 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
4488 use "(cases (simplified))" method in proper proof texts);
4490 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
4492 * Isar: names of theorems etc. may be natural numbers as well;
4494 * Isar: 'pr' command: optional arguments for goals_limit and
4495 ProofContext.prems_limit; no longer prints theory contexts, but only
4498 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
4499 additional print modes to be specified; e.g. "pr(latex)" will print
4500 proof state according to the Isabelle LaTeX style;
4502 * Isar: improved support for emulating tactic scripts, including proof
4503 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
4504 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
4505 (for HOL datatypes);
4507 * Isar: simplified (more robust) goal selection of proof methods: 1st
4508 goal, all goals, or explicit goal specifier (tactic emulation); thus
4509 'proof method scripts' have to be in depth-first order;
4511 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
4513 * Isar: removed 'help' command, which hasn't been too helpful anyway;
4514 should instead use individual commands for printing items
4515 (print_commands, print_methods etc.);
4517 * Isar: added 'nothing' --- the empty list of theorems;
4522 * HOL/MicroJava: formalization of a fragment of Java, together with a
4523 corresponding virtual machine and a specification of its bytecode
4524 verifier and a lightweight bytecode verifier, including proofs of
4525 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
4526 Cornelia Pusch (see also the homepage of project Bali at
4527 http://isabelle.in.tum.de/Bali/);
4529 * HOL/Algebra: new theory of rings and univariate polynomials, by
4532 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
4533 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
4536 * HOL/Lattice: fundamental concepts of lattice theory and order
4537 structures, including duals, properties of bounds versus algebraic
4538 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
4539 Theorem for complete lattices etc.; may also serve as a demonstration
4540 for abstract algebraic reasoning using axiomatic type classes, and
4541 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
4543 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
4546 * HOL/IMPP: extension of IMP with local variables and mutually
4547 recursive procedures, by David von Oheimb;
4549 * HOL/Lambda: converted into new-style theory and document;
4551 * HOL/ex/Multiquote: example of multiple nested quotations and
4552 anti-quotations -- basically a generalized version of de-Bruijn
4553 representation; very useful in avoiding lifting of operations;
4555 * HOL/record: added general record equality rule to simpset; fixed
4556 select-update simplification procedure to handle extended records as
4557 well; admit "r" as field name;
4559 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
4560 other numeric types and also as the identity of groups, rings, etc.;
4562 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
4563 Types nat and int belong to this axclass;
4565 * HOL: greatly improved simplification involving numerals of type nat, int, real:
4566 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
4567 i*j + k + j*#3*i simplifies to #4*(i*j) + k
4568 two terms #m*u and #n*u are replaced by #(m+n)*u
4569 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
4570 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
4571 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
4573 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
4574 powerful prover for predicate logic but knows nothing of clasets; see
4575 ex/mesontest.ML and ex/mesontest2.ML for example applications;
4577 * HOL: new version of "case_tac" subsumes both boolean case split and
4578 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
4579 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
4581 * HOL: simplification no longer dives into case-expressions: only the
4582 selector expression is simplified, but not the remaining arms; to
4583 enable full simplification of case-expressions for datatype t, you may
4584 remove t.weak_case_cong from the simpset, either globally (Delcongs
4585 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
4587 * HOL/recdef: the recursion equations generated by 'recdef' for
4588 function 'f' are now called f.simps instead of f.rules; if all
4589 termination conditions are proved automatically, these simplification
4590 rules are added to the simpset, as in primrec; rules may be named
4591 individually as well, resulting in a separate list of theorems for
4594 * HOL/While is a new theory that provides a while-combinator. It
4595 permits the definition of tail-recursive functions without the
4596 provision of a termination measure. The latter is necessary once the
4597 invariant proof rule for while is applied.
4599 * HOL: new (overloaded) notation for the set of elements below/above
4600 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
4602 * HOL: theorems impI, allI, ballI bound as "strip";
4604 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
4605 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
4606 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
4608 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4610 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
4611 main HOL, but was unused);
4613 * HOL: fewer consts declared as global (e.g. have to refer to
4614 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
4616 * HOL: tuned AST representation of nested pairs, avoiding bogus output
4617 in case of overlap with user translations (e.g. judgements over
4618 tuples); (note that the underlying logical represenation is still
4624 * ZF: simplification automatically cancels common terms in arithmetic
4625 expressions over nat and int;
4627 * ZF: new treatment of nat to minimize type-checking: all operators
4628 coerce their operands to a natural number using the function natify,
4629 making the algebraic laws unconditional;
4631 * ZF: as above, for int: operators coerce their operands to an integer
4632 using the function intify;
4634 * ZF: the integer library now contains many of the usual laws for the
4635 orderings, including $<=, and monotonicity laws for $+ and $*;
4637 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
4640 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
4641 to the simplifier and classical reasoner simultaneously;
4646 * Provers: blast_tac now handles actual object-logic rules as
4647 assumptions; note that auto_tac uses blast_tac internally as well;
4649 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
4650 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
4652 * Provers: delrules now handles destruct rules as well (no longer need
4653 explicit make_elim);
4655 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
4656 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4657 use instead the strong form,
4658 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4659 in HOL, FOL and ZF the function cla_make_elim will create such rules
4660 from destruct-rules;
4662 * Provers: Simplifier.easy_setup provides a fast path to basic
4663 Simplifier setup for new object-logics;
4665 * Pure: AST translation rules no longer require constant head on LHS;
4667 * Pure: improved name spaces: ambiguous output is qualified; support
4668 for hiding of names;
4670 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
4671 XSYMBOL_HOME; no longer need to do manual configuration in most
4674 * system: compression of ML heaps images may now be controlled via -c
4675 option of isabelle and isatool usedir (currently only observed by
4678 * system: isatool installfonts may handle X-Symbol fonts as well (very
4679 useful for remote X11);
4681 * system: provide TAGS file for Isabelle sources;
4683 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
4686 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
4687 timing flag supersedes proof_timing and Toplevel.trace;
4689 * ML: new combinators |>> and |>>> for incremental transformations
4690 with secondary results (e.g. certain theory extensions):
4692 * ML: PureThy.add_defs gets additional argument to indicate potential
4693 overloading (usually false);
4695 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
4700 New in Isabelle99 (October 1999)
4701 --------------------------------
4703 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4705 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
4706 are no longer simplified. (This allows the simplifier to unfold recursive
4707 functional programs.) To restore the old behaviour, declare
4709 Delcongs [if_weak_cong];
4711 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
4714 * HOL: the predicate "inj" is now defined by translation to "inj_on";
4716 * HOL/datatype: mutual_induct_tac no longer exists --
4717 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
4719 * HOL/typedef: fixed type inference for representing set; type
4720 arguments now have to occur explicitly on the rhs as type constraints;
4722 * ZF: The con_defs part of an inductive definition may no longer refer
4723 to constants declared in the same theory;
4725 * HOL, ZF: the function mk_cases, generated by the inductive
4726 definition package, has lost an argument. To simplify its result, it
4727 uses the default simpset instead of a supplied list of theorems.
4729 * HOL/List: the constructors of type list are now Nil and Cons;
4731 * Simplifier: the type of the infix ML functions
4732 setSSolver addSSolver setSolver addSolver
4733 is now simpset * solver -> simpset where `solver' is a new abstract type
4734 for packaging solvers. A solver is created via
4735 mk_solver: string -> (thm list -> int -> tactic) -> solver
4736 where the string argument is only a comment.
4741 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
4742 decision procedure for linear arithmetic. Currently it is used for
4743 types `nat', `int', and `real' in HOL (see below); it can, should and
4744 will be instantiated for other types and logics as well.
4746 * The simplifier now accepts rewrite rules with flexible heads, eg
4747 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
4748 They are applied like any rule with a non-pattern lhs, i.e. by first-order
4754 * New Isabelle/Isar subsystem provides an alternative to traditional
4755 tactical theorem proving; together with the ProofGeneral/isar user
4756 interface it offers an interactive environment for developing human
4757 readable proof documents (Isar == Intelligible semi-automated
4758 reasoning); for further information see isatool doc isar-ref,
4759 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
4761 * improved and simplified presentation of theories: better HTML markup
4762 (including colors), graph views in several sizes; isatool usedir now
4763 provides a proper interface for user theories (via -P option); actual
4764 document preparation based on (PDF)LaTeX is available as well (for
4765 new-style theories only); see isatool doc system for more information;
4767 * native support for Proof General, both for classic Isabelle and
4770 * ML function thm_deps visualizes dependencies of theorems and lemmas,
4771 using the graph browser tool;
4773 * Isabelle manuals now also available as PDF;
4775 * theory loader rewritten from scratch (may not be fully
4776 bug-compatible); old loadpath variable has been replaced by show_path,
4777 add_path, del_path, reset_path functions; new operations such as
4778 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
4781 * improved isatool install: option -k creates KDE application icon,
4782 option -p DIR installs standalone binaries;
4784 * added ML_PLATFORM setting (useful for cross-platform installations);
4785 more robust handling of platform specific ML images for SML/NJ;
4787 * the settings environment is now statically scoped, i.e. it is never
4788 created again in sub-processes invoked from isabelle, isatool, or
4791 * path element specification '~~' refers to '$ISABELLE_HOME';
4793 * in locales, the "assumes" and "defines" parts may be omitted if
4796 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
4799 * new print_mode "HTML";
4801 * new flag show_tags controls display of tags of theorems (which are
4802 basically just comments that may be attached by some tools);
4804 * Isamode 2.6 requires patch to accomodate change of Isabelle font
4805 mode and goal output format:
4807 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
4809 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
4811 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
4812 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
4814 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
4816 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
4818 * function bind_thms stores lists of theorems (cf. bind_thm);
4820 * new shorthand tactics ftac, eatac, datac, fatac;
4822 * qed (and friends) now accept "" as result name; in that case the
4823 theorem is not stored, but proper checks and presentation of the
4826 * theorem database now also indexes constants "Trueprop", "all",
4827 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
4832 ** HOL arithmetic **
4834 * There are now decision procedures for linear arithmetic over nat and
4837 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
4838 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
4839 are treated as atomic; subformulae not involving type `nat' or `int'
4840 are ignored; quantified subformulae are ignored unless they are
4841 positive universal or negative existential. The tactic has to be
4842 invoked by hand and can be a little bit slow. In particular, the
4843 running time is exponential in the number of occurrences of `min' and
4844 `max', and `-' on `nat'.
4846 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
4847 (negated) (in)equalities among the premises and the conclusion into
4848 account (i.e. no compound formulae) and does not know about `min' and
4849 `max', and `-' on `nat'. It is fast and is used automatically by the
4852 NB: At the moment, these decision procedures do not cope with mixed
4853 nat/int formulae where the two parts interact, such as `m < n ==>
4856 * HOL/Numeral provides a generic theory of numerals (encoded
4857 efficiently as bit strings); setup for types nat/int/real is in place;
4858 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
4859 int, existing theories and proof scripts may require a few additional
4862 * integer division and remainder can now be performed on constant
4865 * many properties of integer multiplication, division and remainder
4868 * An interface to the Stanford Validity Checker (SVC) is available through the
4869 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
4870 are proved automatically. SVC must be installed separately, and its results
4871 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
4872 invocation of the underlying oracle). For SVC see
4873 http://verify.stanford.edu/SVC
4875 * IsaMakefile: the HOL-Real target now builds an actual image;
4880 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
4881 (in Isabelle/Isar) -- by Gertrud Bauer;
4883 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
4884 analysis for assembly languages with subtypes;
4886 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
4887 -- avoids syntactic ambiguities and treats state, transition, and
4888 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
4889 changed syntax and (many) tactics;
4891 * HOL/inductive: Now also handles more general introduction rules such
4892 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
4893 theorems are now maintained within the theory (maintained via the
4896 * HOL/datatype: Now also handles arbitrarily branching datatypes
4897 (using function types) such as
4899 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
4901 * HOL/record: record_simproc (part of the default simpset) takes care
4902 of selectors applied to updated records; record_split_tac is no longer
4903 part of the default claset; update_defs may now be removed from the
4904 simpset in many cases; COMPATIBILITY: old behavior achieved by
4906 claset_ref () := claset() addSWrapper record_split_wrapper;
4907 Delsimprocs [record_simproc]
4909 * HOL/typedef: fixed type inference for representing set; type
4910 arguments now have to occur explicitly on the rhs as type constraints;
4912 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
4913 names rather than an ML expression;
4915 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
4916 supplied later. Program schemes can be defined, such as
4917 "While B C s = (if B s then While B C (C s) else s)"
4918 where the well-founded relation can be chosen after B and C have been given.
4920 * HOL/List: the constructors of type list are now Nil and Cons;
4921 INCOMPATIBILITY: while [] and infix # syntax is still there, of
4922 course, ML tools referring to List.list.op # etc. have to be adapted;
4924 * HOL_quantifiers flag superseded by "HOL" print mode, which is
4925 disabled by default; run isabelle with option -m HOL to get back to
4926 the original Gordon/HOL-style output;
4928 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
4929 ALL x<=y. P, EX x<y. P, EX x<=y. P;
4931 * HOL basic syntax simplified (more orthogonal): all variants of
4932 All/Ex now support plain / symbolic / HOL notation; plain syntax for
4933 Eps operator is provided as well: "SOME x. P[x]";
4935 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
4937 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
4938 thus available for user theories;
4940 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
4941 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
4944 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
4945 several times and then mp;
4950 * the notation <<...>> is now available as a notation for sequences of
4953 * the simplifier is now installed
4955 * the axiom system has been generalized (thanks to Soren Heilmann)
4957 * the classical reasoner now has a default rule database
4962 * new primrec section allows primitive recursive functions to be given
4963 directly (as in HOL) over datatypes and the natural numbers;
4965 * new tactics induct_tac and exhaust_tac for induction (or case
4966 analysis) over datatypes and the natural numbers;
4968 * the datatype declaration of type T now defines the recursor T_rec;
4970 * simplification automatically does freeness reasoning for datatype
4973 * automatic type-inference, with AddTCs command to insert new
4974 type-checking rules;
4976 * datatype introduction rules are now added as Safe Introduction rules
4979 * the syntax "if P then x else y" is now available in addition to
4983 *** Internal programming interfaces ***
4985 * tuned simplifier trace output; new flag debug_simp;
4987 * structures Vartab / Termtab (instances of TableFun) offer efficient
4988 tables indexed by indexname_ord / term_ord (compatible with aconv);
4990 * AxClass.axclass_tac lost the theory argument;
4992 * tuned current_goals_markers semantics: begin / end goal avoids
4993 printing empty lines;
4995 * removed prs and prs_fn hook, which was broken because it did not
4996 include \n in its semantics, forcing writeln to add one
4997 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
4998 string -> unit if you really want to output text without newline;
5000 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
5001 plain output, interface builders may have to enable 'isabelle_font'
5002 mode to get Isabelle font glyphs as before;
5004 * refined token_translation interface; INCOMPATIBILITY: output length
5005 now of type real instead of int;
5007 * theory loader actions may be traced via new ThyInfo.add_hook
5008 interface (see src/Pure/Thy/thy_info.ML); example application: keep
5009 your own database of information attached to *whole* theories -- as
5010 opposed to intra-theory data slots offered via TheoryDataFun;
5012 * proper handling of dangling sort hypotheses (at last!);
5013 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
5014 extra sort hypotheses that can be witnessed from the type signature;
5015 the force_strip_shyps flag is gone, any remaining shyps are simply
5016 left in the theorem (with a warning issued by strip_shyps_warning);
5020 New in Isabelle98-1 (October 1998)
5021 ----------------------------------
5023 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5025 * several changes of automated proof tools;
5027 * HOL: major changes to the inductive and datatype packages, including
5028 some minor incompatibilities of theory syntax;
5030 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
5033 * HOL: removed duplicate thms in Arith:
5034 less_imp_add_less should be replaced by trans_less_add1
5035 le_imp_add_le should be replaced by trans_le_add1
5037 * HOL: unary minus is now overloaded (new type constraints may be
5040 * HOL and ZF: unary minus for integers is now #- instead of #~. In
5041 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
5042 now taken as an integer constant.
5044 * Pure: ML function 'theory_of' renamed to 'theory';
5050 1. Asm_full_simp_tac is now more aggressive.
5051 1. It will sometimes reorient premises if that increases their power to
5053 2. It does no longer proceed strictly from left to right but may also
5054 rotate premises to achieve further simplification.
5055 For compatibility reasons there is now Asm_lr_simp_tac which is like the
5056 old Asm_full_simp_tac in that it does not rotate premises.
5057 2. The simplifier now knows a little bit about nat-arithmetic.
5059 * Classical reasoner: wrapper mechanism for the classical reasoner now
5060 allows for selected deletion of wrappers, by introduction of names for
5061 wrapper functionals. This implies that addbefore, addSbefore,
5062 addaltern, and addSaltern now take a pair (name, tactic) as argument,
5063 and that adding two tactics with the same name overwrites the first
5064 one (emitting a warning).
5065 type wrapper = (int -> tactic) -> (int -> tactic)
5066 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
5067 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
5068 delWrapper, delSWrapper: claset * string -> claset
5069 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
5071 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
5072 semantics; addbefore now affects only the unsafe part of step_tac
5073 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
5074 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
5077 * Classical reasoner: setwrapper to setWrapper and compwrapper to
5078 compWrapper; added safe wrapper (and access functions for it);
5080 * HOL/split_all_tac is now much faster and fails if there is nothing
5081 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
5082 and the names of the automatically generated variables have changed.
5083 split_all_tac has moved within claset() from unsafe wrappers to safe
5084 wrappers, which means that !!-bound variables are split much more
5085 aggressively, and safe_tac and clarify_tac now split such variables.
5086 If this splitting is not appropriate, use delSWrapper "split_all_tac".
5087 Note: the same holds for record_split_tac, which does the job of
5088 split_all_tac for record fields.
5090 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
5091 permanently to the default simpset using Addsplits just like
5092 Addsimps. They can be removed via Delsplits just like
5093 Delsimps. Lower-case versions are also available.
5095 * HOL/Simplifier: The rule split_if is now part of the default
5096 simpset. This means that the simplifier will eliminate all occurrences
5097 of if-then-else in the conclusion of a goal. To prevent this, you can
5098 either remove split_if completely from the default simpset by
5099 `Delsplits [split_if]' or remove it in a specific call of the
5100 simplifier using `... delsplits [split_if]'. You can also add/delete
5101 other case splitting rules to/from the default simpset: every datatype
5102 generates suitable rules `split_t_case' and `split_t_case_asm' (where
5103 t is the name of the datatype).
5105 * Classical reasoner / Simplifier combination: new force_tac (and
5106 derivatives Force_tac, force) combines rewriting and classical
5107 reasoning (and whatever other tools) similarly to auto_tac, but is
5108 aimed to solve the given subgoal completely.
5113 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
5114 and `goalw': the theory is no longer needed as an explicit argument -
5115 the current theory context is used; assumptions are no longer returned
5116 at the ML-level unless one of them starts with ==> or !!; it is
5117 recommended to convert to these new commands using isatool fixgoal
5118 (backup your sources first!);
5120 * new top-level commands 'thm' and 'thms' for retrieving theorems from
5121 the current theory context, and 'theory' to lookup stored theories;
5123 * new theory section 'locale' for declaring constants, assumptions and
5124 definitions that have local scope;
5126 * new theory section 'nonterminals' for purely syntactic types;
5128 * new theory section 'setup' for generic ML setup functions
5129 (e.g. package initialization);
5131 * the distribution now includes Isabelle icons: see
5132 lib/logo/isabelle-{small,tiny}.xpm;
5134 * isatool install - install binaries with absolute references to
5137 * isatool logo -- create instances of the Isabelle logo (as EPS);
5139 * print mode 'emacs' reserved for Isamode;
5141 * support multiple print (ast) translations per constant name;
5143 * theorems involving oracles are now printed with a suffixed [!];
5148 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
5150 * HOL/inductive package reorganized and improved: now supports mutual
5156 oddI "n : EVEN ==> Suc n : ODD"
5157 evenI "n : ODD ==> Suc n : EVEN"
5159 new theorem list "elims" contains an elimination rule for each of the
5160 recursive sets; inductive definitions now handle disjunctive premises
5161 correctly (also ZF);
5163 INCOMPATIBILITIES: requires Inductive as an ancestor; component
5164 "mutual_induct" no longer exists - the induction rule is always
5165 contained in "induct";
5168 * HOL/datatype package re-implemented and greatly improved: now
5169 supports mutually recursive datatypes such as
5172 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
5173 | SUM ('a aexp) ('a aexp)
5174 | DIFF ('a aexp) ('a aexp)
5177 'a bexp = LESS ('a aexp) ('a aexp)
5178 | AND ('a bexp) ('a bexp)
5179 | OR ('a bexp) ('a bexp)
5181 as well as indirectly recursive datatypes such as
5184 ('a, 'b) term = Var 'a
5185 | App 'b ((('a, 'b) term) list)
5187 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
5188 induction on mutually / indirectly recursive datatypes.
5190 Primrec equations are now stored in theory and can be accessed via
5191 <function_name>.simps.
5195 - Theories using datatypes must now have theory Datatype as an
5197 - The specific <typename>.induct_tac no longer exists - use the
5198 generic induct_tac instead.
5199 - natE has been renamed to nat.exhaust - use exhaust_tac
5200 instead of res_inst_tac ... natE. Note that the variable
5201 names in nat.exhaust differ from the names in natE, this
5202 may cause some "fragile" proofs to fail.
5203 - The theorems split_<typename>_case and split_<typename>_case_asm
5204 have been renamed to <typename>.split and <typename>.split_asm.
5205 - Since default sorts of type variables are now handled correctly,
5206 some datatype definitions may have to be annotated with explicit
5208 - Primrec definitions no longer require function name and type
5209 of recursive argument.
5211 Consider using isatool fixdatatype to adapt your theories and proof
5212 scripts to the new package (backup your sources first!).
5215 * HOL/record package: considerably improved implementation; now
5216 includes concrete syntax for record types, terms, updates; theorems
5217 for surjective pairing and splitting !!-bound record variables; proof
5218 support is as follows:
5220 1) standard conversions (selectors or updates applied to record
5221 constructor terms) are part of the standard simpset;
5223 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
5224 made part of standard simpset and claset via addIffs;
5226 3) a tactic for record field splitting (record_split_tac) is part of
5227 the standard claset (addSWrapper);
5229 To get a better idea about these rules you may retrieve them via
5230 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
5231 the name of your record type.
5233 The split tactic 3) conceptually simplifies by the following rule:
5235 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
5237 Thus any record variable that is bound by meta-all will automatically
5238 blow up into some record constructor term, consequently the
5239 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
5240 solve record problems automatically.
5243 * reorganized the main HOL image: HOL/Integ and String loaded by
5244 default; theory Main includes everything;
5246 * automatic simplification of integer sums and comparisons, using cancellation;
5248 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
5250 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
5252 * many new identities for unions, intersections, set difference, etc.;
5254 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
5255 called split_if, split_split, split_sum_case and split_nat_case (to go
5256 with add/delsplits);
5258 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
5259 (?x::unit) = (); this is made part of the default simpset, which COULD
5260 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
5261 'Delsimprocs [unit_eq_proc];' as last resort); also note that
5262 unit_abs_eta_conv is added in order to counter the effect of
5263 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
5266 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
5269 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5270 It and 'sym RS equals0D' are now in the default claset, giving automatic
5271 disjointness reasoning but breaking a few old proofs.
5273 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
5274 to 'converse' from 'inverse' (for compatibility with ZF and some
5277 * HOL/recdef can now declare non-recursive functions, with {} supplied as
5278 the well-founded relation;
5280 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
5281 Compl A. The "Compl" syntax remains available as input syntax for this
5284 * HOL/Update: new theory of function updates:
5285 f(a:=b) == %x. if x=a then b else f x
5286 may also be iterated as in f(a:=b,c:=d,...);
5288 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
5291 - new function list_update written xs[i:=v] that updates the i-th
5292 list position. May also be iterated as in xs[i:=a,j:=b,...].
5293 - new function `upt' written [i..j(] which generates the list
5294 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
5295 bound write [i..j], which is a shorthand for [i..j+1(].
5296 - new lexicographic orderings and corresponding wellfoundedness theorems.
5299 - removed 'pred' (predecessor) function;
5300 - generalized some theorems about n-1;
5301 - many new laws about "div" and "mod";
5302 - new laws about greatest common divisors (see theory ex/Primes);
5304 * HOL/Relation: renamed the relational operator r^-1 "converse"
5305 instead of "inverse";
5307 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
5308 of the multiset ordering;
5310 * directory HOL/Real: a construction of the reals using Dedekind cuts
5311 (not included by default);
5313 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
5315 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
5316 programs, i.e. different program variables may have different types.
5318 * calling (stac rew i) now fails if "rew" has no effect on the goal
5319 [previously, this check worked only if the rewrite rule was unconditional]
5320 Now rew can involve either definitions or equalities (either == or =).
5325 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
5326 only the theorems proved on ZF.ML;
5328 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5329 It and 'sym RS equals0D' are now in the default claset, giving automatic
5330 disjointness reasoning but breaking a few old proofs.
5332 * ZF/Update: new theory of function updates
5333 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
5334 may also be iterated as in f(a:=b,c:=d,...);
5336 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
5338 * calling (stac rew i) now fails if "rew" has no effect on the goal
5339 [previously, this check worked only if the rewrite rule was unconditional]
5340 Now rew can involve either definitions or equalities (either == or =).
5342 * case_tac provided for compatibility with HOL
5343 (like the old excluded_middle_tac, but with subgoals swapped)
5346 *** Internal programming interfaces ***
5348 * Pure: several new basic modules made available for general use, see
5349 also src/Pure/README;
5351 * improved the theory data mechanism to support encapsulation (data
5352 kind name replaced by private Object.kind, acting as authorization
5353 key); new type-safe user interface via functor TheoryDataFun; generic
5354 print_data function becomes basically useless;
5356 * removed global_names compatibility flag -- all theory declarations
5357 are qualified by default;
5359 * module Pure/Syntax now offers quote / antiquote translation
5360 functions (useful for Hoare logic etc. with implicit dependencies);
5361 see HOL/ex/Antiquote for an example use;
5363 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
5366 * new tactical CHANGED_GOAL for checking that a tactic modifies a
5369 * Display.print_goals function moved to Locale.print_goals;
5371 * standard print function for goals supports current_goals_markers
5372 variable for marking begin of proof, end of proof, start of goal; the
5373 default is ("", "", ""); setting current_goals_markers := ("<proof>",
5374 "</proof>", "<goal>") causes SGML like tagged proof state printing,
5379 New in Isabelle98 (January 1998)
5380 --------------------------------
5382 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5384 * changed lexical syntax of terms / types: dots made part of long
5385 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
5387 * simpset (and claset) reference variable replaced by functions
5388 simpset / simpset_ref;
5390 * no longer supports theory aliases (via merge) and non-trivial
5391 implicit merge of thms' signatures;
5393 * most internal names of constants changed due to qualified names;
5395 * changed Pure/Sequence interface (see Pure/seq.ML);
5398 *** General Changes ***
5400 * hierachically structured name spaces (for consts, types, axms, thms
5401 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
5402 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
5403 isatool fixdots ensures space after dots (e.g. "%x. x"); set
5404 long_names for fully qualified output names; NOTE: ML programs
5405 (special tactics, packages etc.) referring to internal names may have
5406 to be adapted to cope with fully qualified names; in case of severe
5407 backward campatibility problems try setting 'global_names' at compile
5408 time to have enrything declared within a flat name space; one may also
5409 fine tune name declarations in theories via the 'global' and 'local'
5412 * reimplemented the implicit simpset and claset using the new anytype
5413 data filed in signatures; references simpset:simpset ref etc. are
5414 replaced by functions simpset:unit->simpset and
5415 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
5416 to patch your ML files accordingly;
5418 * HTML output now includes theory graph data for display with Java
5419 applet or isatool browser; data generated automatically via isatool
5420 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
5422 * defs may now be conditional; improved rewrite_goals_tac to handle
5423 conditional equations;
5425 * defs now admits additional type arguments, using TYPE('a) syntax;
5427 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
5428 creates a new theory node; implicit merge of thms' signatures is
5429 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
5430 transfer:theory->thm->thm in (rare) cases;
5432 * improved handling of draft signatures / theories; draft thms (and
5433 ctyps, cterms) are automatically promoted to real ones;
5435 * slightly changed interfaces for oracles: admit many per theory, named
5436 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
5438 * print_goals: optional output of const types (set show_consts and
5441 * improved output of warnings (###) and errors (***);
5443 * subgoal_tac displays a warning if the new subgoal has type variables;
5445 * removed old README and Makefiles;
5447 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
5449 * removed obsolete init_pps and init_database;
5451 * deleted the obsolete tactical STATE, which was declared by
5452 fun STATE tacfun st = tacfun st st;
5454 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
5455 (which abbreviates $HOME);
5457 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
5458 use isatool fixseq to adapt your ML programs (this works for fully
5459 qualified references to the Sequence structure only!);
5461 * use_thy no longer requires writable current directory; it always
5462 reloads .ML *and* .thy file, if either one is out of date;
5465 *** Classical Reasoner ***
5467 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
5468 tactics that use classical reasoning to simplify a subgoal without
5469 splitting it into several subgoals;
5471 * Safe_tac: like safe_tac but uses the default claset;
5476 * added simplification meta rules:
5477 (asm_)(full_)simplify: simpset -> thm -> thm;
5479 * simplifier.ML no longer part of Pure -- has to be loaded by object
5482 * added prems argument to simplification procedures;
5484 * HOL, FOL, ZF: added infix function `addsplits':
5485 instead of `<simpset> setloop (split_tac <thms>)'
5486 you can simply write `<simpset> addsplits <thms>'
5491 * TYPE('a) syntax for type reflection terms;
5493 * no longer handles consts with name "" -- declare as 'syntax' instead;
5495 * pretty printer: changed order of mixfix annotation preference (again!);
5497 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
5502 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
5503 with `addloop' of the simplifier to faciliate case splitting in premises.
5505 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
5507 * HOL/Auth: new protocol proofs including some for the Internet
5510 * HOL/Map: new theory of `maps' a la VDM;
5512 * HOL/simplifier: simplification procedures nat_cancel_sums for
5513 cancelling out common nat summands from =, <, <= (in)equalities, or
5514 differences; simplification procedures nat_cancel_factor for
5515 cancelling common factor from =, <, <= (in)equalities over natural
5516 sums; nat_cancel contains both kinds of procedures, it is installed by
5517 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
5519 * HOL/simplifier: terms of the form
5520 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
5522 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
5523 and those of the form
5524 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
5526 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
5529 Each datatype `t' now comes with a theorem `split_t_case' of the form
5531 P(t_case f1 ... fn x) =
5532 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
5534 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
5537 and a theorem `split_t_case_asm' of the form
5539 P(t_case f1 ... fn x) =
5540 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
5542 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
5544 which can be added to a simpset via `addsplits'. The existing theorems
5545 expand_list_case and expand_option_case have been renamed to
5546 split_list_case and split_option_case.
5549 - `pred n' is automatically converted to `n-1'.
5550 Users are strongly encouraged not to use `pred' any longer,
5551 because it will disappear altogether at some point.
5552 - Users are strongly encouraged to write "0 < n" rather than
5553 "n ~= 0". Theorems and proof tools have been modified towards this
5557 the function "set_of_list" has been renamed "set" (and its theorems too);
5558 the function "nth" now takes its arguments in the reverse order and
5559 has acquired the infix notation "!" as in "xs!n".
5561 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
5563 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
5564 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
5566 * HOL/record: extensible records with schematic structural subtyping
5567 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
5568 still lacks various theorems and concrete record syntax;
5573 * removed "axioms" and "generated by" sections;
5575 * replaced "ops" section by extended "consts" section, which is capable of
5576 handling the continuous function space "->" directly;
5579 . proves theorems immediately and stores them in the theory,
5580 . creates hierachical name space,
5581 . now uses normal mixfix annotations (instead of cinfix...),
5582 . minor changes to some names and values (for consistency),
5583 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
5584 . separator between mutual domain defs: changed "," to "and",
5585 . improved handling of sort constraints; now they have to
5586 appear on the left-hand side of the equations only;
5588 * fixed LAM <x,y,zs>.b syntax;
5590 * added extended adm_tac to simplifier in HOLCF -- can now discharge
5591 adm (%x. P (t x)), where P is chainfinite and t continuous;
5596 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
5597 with `addloop' of the simplifier to faciliate case splitting in premises.
5599 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
5600 in HOL, they strip ALL and --> from proved theorems;
5604 New in Isabelle94-8 (May 1997)
5605 ------------------------------
5607 *** General Changes ***
5609 * new utilities to build / run / maintain Isabelle etc. (in parts
5610 still somewhat experimental); old Makefiles etc. still functional;
5612 * new 'Isabelle System Manual';
5614 * INSTALL text, together with ./configure and ./build scripts;
5616 * reimplemented type inference for greater efficiency, better error
5617 messages and clean internal interface;
5619 * prlim command for dealing with lots of subgoals (an easier way of
5620 setting goals_limit);
5625 * supports alternative (named) syntax tables (parser and pretty
5626 printer); internal interface is provided by add_modesyntax(_i);
5628 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
5629 be used in conjunction with the Isabelle symbol font; uses the
5630 "symbols" syntax table;
5632 * added token_translation interface (may translate name tokens in
5633 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
5634 the current print_mode); IMPORTANT: user print translation functions
5635 are responsible for marking newly introduced bounds
5636 (Syntax.mark_boundT);
5638 * token translations for modes "xterm" and "xterm_color" that display
5639 names in bold, underline etc. or colors (which requires a color
5642 * infixes may now be declared with names independent of their syntax;
5644 * added typed_print_translation (like print_translation, but may
5645 access type of constant);
5648 *** Classical Reasoner ***
5650 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
5651 some limitations. Blast_tac...
5652 + ignores addss, addbefore, addafter; this restriction is intrinsic
5653 + ignores elimination rules that don't have the correct format
5654 (the conclusion MUST be a formula variable)
5655 + ignores types, which can make HOL proofs fail
5656 + rules must not require higher-order unification, e.g. apply_type in ZF
5657 [message "Function Var's argument not a bound variable" relates to this]
5658 + its proof strategy is more general but can actually be slower
5660 * substitution with equality assumptions no longer permutes other
5663 * minor changes in semantics of addafter (now called addaltern); renamed
5664 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
5665 (and access functions for it);
5667 * improved combination of classical reasoner and simplifier:
5668 + functions for handling clasimpsets
5669 + improvement of addss: now the simplifier is called _after_ the
5671 + safe variant of addss called addSss: uses safe simplifications
5672 _during_ the safe steps. It is more complete as it allows multiple
5673 instantiations of unknowns (e.g. with slow_tac).
5677 * added interface for simplification procedures (functions that
5678 produce *proven* rewrite rules on the fly, depending on current
5681 * ordering on terms as parameter (used for ordered rewriting);
5683 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
5685 * the solver is now split into a safe and an unsafe part.
5686 This should be invisible for the normal user, except that the
5687 functions setsolver and addsolver have been renamed to setSolver and
5688 addSolver; added safe_asm_full_simp_tac;
5693 * a generic induction tactic `induct_tac' which works for all datatypes and
5694 also for type `nat';
5696 * a generic case distinction tactic `exhaust_tac' which works for all
5697 datatypes and also for type `nat';
5699 * each datatype comes with a function `size';
5701 * patterns in case expressions allow tuple patterns as arguments to
5702 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
5704 * primrec now also works with type nat;
5706 * recdef: a new declaration form, allows general recursive functions to be
5707 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
5709 * the constant for negation has been renamed from "not" to "Not" to
5710 harmonize with FOL, ZF, LK, etc.;
5712 * HOL/ex/LFilter theory of a corecursive "filter" functional for
5715 * HOL/Modelcheck demonstrates invocation of model checker oracle;
5717 * HOL/ex/Ring.thy declares cring_simp, which solves equational
5718 problems in commutative rings, using axiomatic type classes for + and *;
5720 * more examples in HOL/MiniML and HOL/Auth;
5722 * more default rewrite rules for quantifiers, union/intersection;
5724 * a new constant `arbitrary == @x.False';
5726 * HOLCF/IOA replaces old HOL/IOA;
5728 * HOLCF changes: derived all rules and arities
5729 + axiomatic type classes instead of classes
5730 + typedef instead of faking type definitions
5731 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
5732 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
5733 + eliminated the types void, one, tr
5734 + use unit lift and bool lift (with translations) instead of one and tr
5735 + eliminated blift from Lift3.thy (use Def instead of blift)
5736 all eliminated rules are derived as theorems --> no visible changes ;
5741 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
5742 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
5743 as ZF_cs addSIs [equalityI];
5747 New in Isabelle94-7 (November 96)
5748 ---------------------------------
5750 * allowing negative levels (as offsets) in prlev and choplev;
5752 * super-linear speedup for large simplifications;
5754 * FOL, ZF and HOL now use miniscoping: rewriting pushes
5755 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
5756 FAIL); can suppress it using the command Delsimps (ex_simps @
5757 all_simps); De Morgan laws are also now included, by default;
5759 * improved printing of ==> : ~:
5761 * new object-logic "Sequents" adds linear logic, while replacing LK
5762 and Modal (thanks to Sara Kalvala);
5764 * HOL/Auth: correctness proofs for authentication protocols;
5766 * HOL: new auto_tac combines rewriting and classical reasoning (many
5767 examples on HOL/Auth);
5769 * HOL: new command AddIffs for declaring theorems of the form P=Q to
5770 the rewriter and classical reasoner simultaneously;
5772 * function uresult no longer returns theorems in "standard" format;
5773 regain previous version by: val uresult = standard o uresult;
5780 * oracles -- these establish an interface between Isabelle and trusted
5781 external reasoners, which may deliver results as theorems;
5783 * proof objects (in particular record all uses of oracles);
5785 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
5787 * "constdefs" section in theory files;
5789 * "primrec" section (HOL) no longer requires names;
5791 * internal type "tactic" now simply "thm -> thm Sequence.seq";
5798 * reduced space requirements;
5800 * automatic HTML generation from theories;
5802 * theory files no longer require "..." (quotes) around most types;
5804 * new examples, including two proofs of the Church-Rosser theorem;
5806 * non-curried (1994) version of HOL is no longer distributed;
5813 * greatly reduced space requirements;
5815 * theory files (.thy) no longer require \...\ escapes at line breaks;
5817 * searchable theorem database (see the section "Retrieving theorems" on
5818 page 8 of the Reference Manual);
5820 * new examples, including Grabczewski's monumental case study of the
5823 * The previous version of HOL renamed to Old_HOL;
5825 * The new version of HOL (previously called CHOL) uses a curried syntax
5826 for functions. Application looks like f a b instead of f(a,b);
5828 * Mutually recursive inductive definitions finally work in HOL;
5830 * In ZF, pattern-matching on tuples is now available in all abstractions and
5831 translates to the operator "split";
5838 * new infix operator, addss, allowing the classical reasoner to
5839 perform simplification at each step of its search. Example:
5840 fast_tac (cs addss ss)
5842 * a new logic, CHOL, the same as HOL, but with a curried syntax
5843 for functions. Application looks like f a b instead of f(a,b). Also pairs
5844 look like (a,b) instead of <a,b>;
5846 * PLEASE NOTE: CHOL will eventually replace HOL!
5848 * In CHOL, pattern-matching on tuples is now available in all abstractions.
5849 It translates to the operator "split". A new theory of integers is available;
5851 * In ZF, integer numerals now denote two's-complement binary integers.
5852 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
5854 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
5855 of the Axiom of Choice;
5862 * Significantly faster resolution;
5864 * the different sections in a .thy file can now be mixed and repeated
5867 * Database of theorems for FOL, HOL and ZF. New
5868 commands including qed, qed_goal and bind_thm store theorems in the database.
5870 * Simple database queries: return a named theorem (get_thm) or all theorems of
5871 a given theory (thms_of), or find out what theory a theorem was proved in
5874 * Bugs fixed in the inductive definition and datatype packages;
5876 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
5877 and HOL_dup_cs obsolete;
5879 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
5882 * Simpler definition of function space in ZF;
5884 * new results about cardinal and ordinal arithmetic in ZF;
5886 * 'subtype' facility in HOL for introducing new types as subsets of existing
5889 :mode=text:wrap=hard:maxLineLen=72: