1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * The Isabelle System Manual (system) has been updated, with formally
10 checked references as hyperlinks.
12 * Generalized Isar history, with support for linear undo, direct state
15 * Recovered hiding of consts, which was accidentally broken in
16 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
17 makes c inaccessible; consider using ``hide (open) const c'' instead.
19 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
25 * Changed defaults for unify configuration options:
27 unify_trace_bound = 50 (formerly 25)
28 unify_search_bound = 60 (formerly 30)
30 * Different bookkeeping for code equations:
31 a) On theory merge, the last set of code equations for a particular constant
32 is taken (in accordance with the policy applied by other parts of the
33 code generator framework).
34 b) Code equations stemming from explicit declarations (e.g. code attribute)
35 gain priority over default code equations stemming from definition, primrec,
39 * Global versions of theorems stemming from classes do not carry
40 a parameter prefix any longer. INCOMPATIBILITY.
42 * Dropped "locale (open)". INCOMPATBILITY.
44 * Interpretation commands no longer attempt to simplify goal.
45 INCOMPATIBILITY: in rare situations the generated goal differs. Use
46 methods intro_locales and unfold_locales to clarify.
48 * Interpretation commands no longer accept interpretation attributes.
51 * Command 'instance': attached definitions no longer accepted.
52 INCOMPATIBILITY, use proper 'instantiation' target.
54 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
56 * The 'axiomatization' command now only works within a global theory
57 context. INCOMPATIBILITY.
60 *** Document preparation ***
62 * Antiquotation @{lemma} now imitates a regular terminal proof,
63 demanding keyword 'by' and supporting the full method expression
64 syntax just like the Isar command 'by'.
69 * Wrapper script for remote SystemOnTPTP service allows to use
70 sledghammer without local ATP installation (Vampire etc.); see
71 ISABELLE_HOME/contrib/SystemOnTPTP/.
73 * Normalization by evaluation now allows non-leftlinear equations.
74 Declare with attribute [code nbe].
76 * Command "value" now integrates different evaluation
77 mechanisms. The result of the first successful evaluation mechanism
78 is printed. In square brackets a particular named evaluation
79 mechanisms may be specified (currently, [SML], [code] or [nbe]). See
80 further src/HOL/ex/Eval_Examples.thy.
82 * HOL/Orderings: class "wellorder" moved here, with explicit induction
83 rule "less_induct" as assumption. For instantiation of "wellorder" by
84 means of predicate "wf", use rule wf_wellorderI. INCOMPATIBILITY.
86 * HOL/Orderings: added class "preorder" as superclass of "order".
87 INCOMPATIBILITY: Instantiation proofs for order, linorder
88 etc. slightly changed. Some theorems named order_class.* now named
91 * HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been
92 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
93 dvd has been generalized to class comm_semiring_1. Likewise a bunch
94 of lemmas from Divides has been generalized from nat to class
95 semiring_div. INCOMPATIBILITY. This involves the following theorem
96 renames resulting from duplicate elimination:
98 dvd_def_mod ~> dvd_eq_mod_eq_0
99 zero_dvd_iff ~> dvd_0_left_iff
100 DIVISION_BY_ZERO_DIV ~> div_by_0
101 DIVISION_BY_ZERO_MOD ~> mod_by_0
102 mult_div ~> div_mult_self2_is_id
103 mult_mod ~> mod_mult_self2_is_0
105 * HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
106 zlcm (for int); carried together from various gcd/lcm developements in
107 the HOL Distribution. zgcd and zlcm replace former igcd and ilcm;
108 corresponding theorems renamed accordingly. INCOMPATIBILY. To
109 recover tupled syntax, use syntax declarations like:
111 hide (open) const gcd
112 abbreviation gcd where
113 "gcd == (%(a, b). GCD.gcd a b)"
115 GCD.gcd ("gcd '(_, _')")
117 (analogously for lcm, zgcd, zlcm).
119 * HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
121 * New ML antiquotation @{code}: takes constant as argument, generates
122 corresponding code in background and inserts name of the corresponding
123 resulting ML value/function/datatype constructor binding in place.
124 All occurrences of @{code} with a single ML block are generated
125 simultaneously. Provides a generic and safe interface for
126 instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy
127 example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious
128 application. In future you ought refrain from ad-hoc compiling
129 generated SML code on the ML toplevel. Note that (for technical
130 reasons) @{code} cannot refer to constants for which user-defined
131 serializations are set. Refer to the corresponding ML counterpart
132 directly in that cases.
134 * Integrated image HOL-Complex with HOL. Entry points Main.thy and
135 Complex_Main.thy remain as they are.
137 * New image HOL-Plain provides a minimal HOL with the most important
138 tools available (inductive, datatype, primrec, ...). By convention
139 the corresponding theory Plain should be ancestor of every further
140 (library) theory. Some library theories now have ancestor Plain
141 (instead of Main), thus theory Main occasionally has to be imported
144 * The metis method now fails in the usual manner, rather than raising
145 an exception, if it determines that it cannot prove the theorem.
147 * Methods "case_tac" and "induct_tac" now refer to the very same rules
148 as the structured Isar versions "cases" and "induct", cf. the
149 corresponding "cases" and "induct" attributes. Mutual induction rules
150 are now presented as a list of individual projections
151 (e.g. foo_bar.inducts for types foo and bar); the old format with
152 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
153 rare situations a different rule is selected --- notably nested tuple
154 elimination instead of former prod.exhaust: use explicit (case_tac t
155 rule: prod.exhaust) here.
157 * Attributes "cases", "induct", "coinduct" support "del" option.
159 * Removed fact "case_split_thm", which duplicates "case_split".
161 * Command 'rep_datatype': instead of theorem names the command now
162 takes a list of terms denoting the constructors of the type to be
163 represented as datatype. The characteristic theorems have to be
164 proven. INCOMPATIBILITY. Also observe that the following theorems
165 have disappeared in favour of existing ones:
167 unit_induct ~> unit.induct
168 prod_induct ~> prod.induct
169 sum_induct ~> sum.induct
170 Suc_Suc_eq ~> nat.inject
171 Suc_not_Zero Zero_not_Suc ~> nat.distinct
173 * Library/Nat_Infinity: added addition, numeral syntax and more
174 instantiations for algebraic structures. Removed some duplicate
175 theorems. Changes in simp rules. INCOMPATIBILITY.
177 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
183 * New locales for orders and lattices where the equivalence relation
184 is not restricted to equality. INCOMPATIBILITY: all order and
185 lattice locales use a record structure with field eq for the
188 * New theory of factorial domains.
190 * Units_l_inv and Units_r_inv are now simprules by default.
191 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
192 and/or r_inv will now also require deletion of these lemmas.
194 * Renamed the following theorems. INCOMPATIBILITY.
197 least_carrier ~> least_closed
198 greatest_carrier ~> greatest_closed
199 greatest_Lower_above ~> greatest_Lower_below
200 one_zero ~> carrier_one_zero
201 one_not_zero ~> carrier_one_not_zero (collision with assumption)
206 * Created new image HOL-NSA, containing theories of nonstandard
207 analysis which were previously part of HOL-Complex. Entry point
208 Hyperreal.thy remains valid, but theories formerly using
209 Complex_Main.thy should now use new entry point Hypercomplex.thy.
214 * Proof of Zorn's Lemma for partial orders.
219 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
220 to 'a -> thm, while results are always tagged with an authentic oracle
221 name. The Isar command 'oracle' is now polymorphic, no argument type
222 is specified. INCOMPATIBILITY, need to simplify existing oracle code
223 accordingly. Note that extra performance may be gained by producing
224 the cterm carefully, avoiding slow Thm.cterm_of.
226 * ML bindings produced via Isar commands are stored within the Isar
227 context (theory or proof). Consequently, commands like 'use' and 'ML'
228 become thread-safe and work with undo as expected (concerning
229 top-level bindings, not side-effects on global references).
230 INCOMPATIBILITY, need to provide proper Isar context when invoking the
231 compiler at runtime; really global bindings need to be given outside a
232 theory. [Poly/ML 5.2 or later]
234 * Command 'ML_prf' is analogous to 'ML' but works within a proof
235 context. Top-level ML bindings are stored within the proof context in
236 a purely sequential fashion, disregarding the nested proof structure.
237 ML bindings introduced by 'ML_prf' are discarded at the end of the
238 proof. [Poly/ML 5.2 or later]
240 * Generic Toplevel.add_hook interface allows to analyze the result of
241 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
242 for theorem dependency output of transactions resulting in a new
245 * Name bindings in higher specification mechanisms (notably
246 LocalTheory.define, LocalTheory.note, and derived packages) are now
247 formalized as type Name.binding, replacing old bstring.
248 INCOMPATIBILITY, need to wrap strings via Name.binding function, see
249 also Name.name_of. Packages should pass name bindings given by the
250 user to underlying specification mechanisms; this enables precise
251 tracking of source positions, for example.
253 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
254 LocalTheory.note etc.) now refer to the *full* internal name, not the
255 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
257 * Rules and tactics that read instantiations (read_instantiate,
258 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
259 context, which is required for parsing and type-checking. Moreover,
260 the variables are specified as plain indexnames, not string encodings
261 thereof. INCOMPATIBILITY.
263 * Disposed old type and term read functions (Sign.read_def_typ,
264 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
265 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
266 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
267 Syntax.read_term_global etc.; see also OldGoals.read_term as last
268 resort for legacy applications.
270 * Antiquotations: block-structured compilation context indicated by
271 \<lbrace> ... \<rbrace>; additional antiquotation forms:
273 @{let ?pat = term} - term abbreviation (HO matching)
274 @{note name = fact} - fact abbreviation
275 @{thm fact} - singleton fact (with attributes)
276 @{thms fact} - general fact (with attributes)
277 @{lemma prop by method} - singleton goal
278 @{lemma prop by meth1 meth2} - singleton goal
279 @{lemma prop1 ... propN by method} - general goal
280 @{lemma prop1 ... propN by meth1 meth2} - general goal
281 @{lemma (open) ...} - open derivation
286 * Multithreading for Poly/ML 5.1 is no longer supported, only for
287 Poly/ML 5.2 or later.
289 * The Isabelle "emacs" tool provides a specific interface to invoke
290 Proof General / Emacs, with more explicit failure if that is not
291 installed (the old isabelle-interface script silently falls back on
292 isabelle-process). The PROOFGENERAL_HOME setting determines the
293 installation location of the Proof General distribution.
295 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
296 the Isabelle process into a JVM/Scala application. See
297 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
298 process wrapper has been discontinued.)
300 * Status messages (with exact source position information) are
301 emitted, if proper markup print mode is enabled. This allows
302 user-interface components to provide detailed feedback on internal
305 * Homegrown Isabelle font with unicode layout, see Isabelle/lib/fonts.
309 New in Isabelle2008 (June 2008)
310 -------------------------------
314 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
315 and updated, with formally checked references as hyperlinks.
317 * Theory loader: use_thy (and similar operations) no longer set the
318 implicit ML context, which was occasionally hard to predict and in
319 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
320 provides a proper context already.
322 * Theory loader: old-style ML proof scripts being *attached* to a thy
323 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
324 'use' within a theory file will do the job.
326 * Name space merge now observes canonical order, i.e. the second space
327 is inserted into the first one, while existing entries in the first
328 space take precedence. INCOMPATIBILITY in rare situations, may try to
331 * Syntax: symbol \<chi> is now considered a letter. Potential
332 INCOMPATIBILITY in identifier syntax etc.
334 * Outer syntax: string tokens no longer admit escaped white space,
335 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
336 white space without escapes.
338 * Outer syntax: string tokens may contain arbitrary character codes
339 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
345 * Context-dependent token translations. Default setup reverts locally
346 fixed variables, and adds hilite markup for undeclared frees.
348 * Unused theorems can be found using the new command 'unused_thms'.
349 There are three ways of invoking it:
352 Only finds unused theorems in the current theory.
354 (2) unused_thms thy_1 ... thy_n -
355 Finds unused theorems in the current theory and all of its ancestors,
356 excluding the theories thy_1 ... thy_n and all of their ancestors.
358 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
359 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
360 their ancestors, excluding the theories thy_1 ... thy_n and all of
363 In order to increase the readability of the list produced by
364 unused_thms, theorems that have been created by a particular instance
365 of a theory command such as 'inductive' or 'function' are considered
366 to belong to the same "group", meaning that if at least one theorem in
367 this group is used, the other theorems in the same group are no longer
368 reported as unused. Moreover, if all theorems in the group are
369 unused, only one theorem in the group is displayed.
371 Note that proof objects have to be switched on in order for
372 unused_thms to work properly (i.e. !proofs must be >= 1, which is
373 usually the case when using Proof General with the default settings).
375 * Authentic naming of facts disallows ad-hoc overwriting of previous
376 theorems within the same name space. INCOMPATIBILITY, need to remove
377 duplicate fact bindings, or even accidental fact duplications. Note
378 that tools may maintain dynamically scoped facts systematically, using
379 PureThy.add_thms_dynamic.
381 * Command 'hide' now allows to hide from "fact" name space as well.
383 * Eliminated destructive theorem database, simpset, claset, and
384 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
385 update of theories within ML code.
387 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
388 INCOMPATIBILITY, object-logics depending on former Pure require
389 additional setup PureThy.old_appl_syntax_setup; object-logics
390 depending on former CPure need to refer to Pure.
392 * Commands 'use' and 'ML' are now purely functional, operating on
393 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
394 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
397 * Command 'setup': discontinued implicit version with ML reference.
399 * Instantiation target allows for simultaneous specification of class
400 instance operations together with an instantiation proof.
401 Type-checking phase allows to refer to class operations uniformly.
402 See src/HOL/Complex/Complex.thy for an Isar example and
403 src/HOL/Library/Eval.thy for an ML example.
405 * Indexing of literal facts: be more serious about including only
406 facts from the visible specification/proof context, but not the
407 background context (locale etc.). Affects `prop` notation and method
408 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
411 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
412 "(open)" option, which used to expose internal bound variables to the
415 * Isar statements: removed obsolete case "rule_context".
416 INCOMPATIBILITY, better use explicit fixes/assumes.
418 * Locale proofs: default proof step now includes 'unfold_locales';
419 hence 'proof' without argument may be used to unfold locale
423 *** Document preparation ***
425 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
426 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
427 obsolete thumbpdf setup (contemporary PDF viewers do this on the
428 spot); renamed link color from "darkblue" to "linkcolor" (default
429 value unchanged, can be redefined via \definecolor); no longer sets
430 "a4paper" option (unnecessary or even intrusive).
432 * Antiquotation @{lemma A method} proves proposition A by the given
433 method (either a method name or a method name plus (optional) method
434 arguments in parentheses) and prints A just like @{prop A}.
439 * New primrec package. Specification syntax conforms in style to
440 definition/function/.... No separate induction rule is provided. The
441 "primrec" command distinguishes old-style and new-style specifications
442 by syntax. The former primrec package is now named OldPrimrecPackage.
443 When adjusting theories, beware: constants stemming from new-style
444 primrec specifications have authentic syntax.
446 * Metis prover is now an order of magnitude faster, and also works
449 * Metis: the maximum number of clauses that can be produced from a
450 theorem is now given by the attribute max_clauses. Theorems that
451 exceed this number are ignored, with a warning printed.
453 * Sledgehammer no longer produces structured proofs by default. To
454 enable, declare [[sledgehammer_full = true]]. Attributes
455 reconstruction_modulus, reconstruction_sorts renamed
456 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
458 * Method "induct_scheme" derives user-specified induction rules
459 from well-founded induction and completeness of patterns. This factors
460 out some operations that are done internally by the function package
461 and makes them available separately. See
462 src/HOL/ex/Induction_Scheme.thy for examples.
464 * More flexible generation of measure functions for termination
465 proofs: Measure functions can be declared by proving a rule of the
466 form "is_measure f" and giving it the [measure_function] attribute.
467 The "is_measure" predicate is logically meaningless (always true), and
468 just guides the heuristic. To find suitable measure functions, the
469 termination prover sets up the goal "is_measure ?f" of the appropriate
470 type and generates all solutions by prolog-style backwards proof using
473 This setup also deals with rules like
475 "is_measure f ==> is_measure (list_size f)"
477 which accommodates nested datatypes that recurse through lists.
478 Similar rules are predeclared for products and option types.
480 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
484 - Definitions of overloaded constants on sets have to be replaced by
485 definitions on => and bool.
487 - Some definitions of overloaded operators on sets can now be proved
488 using the definitions of the operators on => and bool. Therefore,
489 the following theorems have been renamed:
491 subset_def -> subset_eq
492 psubset_def -> psubset_eq
493 set_diff_def -> set_diff_eq
494 Compl_def -> Compl_eq
495 Sup_set_def -> Sup_set_eq
496 Inf_set_def -> Inf_set_eq
497 sup_set_def -> sup_set_eq
498 inf_set_def -> inf_set_eq
500 - Due to the incompleteness of the HO unification algorithm, some
501 rules such as subst may require manual instantiation, if some of
502 the unknowns in the rule is a set.
504 - Higher order unification and forward proofs:
507 have "P (S::'a set)" <...>
508 then have "EX S. P S" ..
510 no longer works (due to the incompleteness of the HO unification
511 algorithm) and must be replaced by the pattern
518 - Calculational reasoning with subst (or similar rules):
521 have "P (S::'a set)" <...>
522 also have "S = T" <...>
525 no longer works (for similar reasons as the previous example) and
526 must be replaced by something like
528 have "P (S::'a set)" <...>
529 moreover have "S = T" <...>
530 ultimately have "P T" by simp
532 - Tactics or packages written in ML code:
533 Code performing pattern matching on types via
535 Type ("set", [T]) => ...
537 must be rewritten. Moreover, functions like strip_type or
538 binder_types no longer return the right value when applied to a
541 T1 => ... => Tn => U => bool
545 T1 => ... => Tn => U set
547 * Merged theories Wellfounded_Recursion, Accessible_Part and
548 Wellfounded_Relations to theory Wellfounded.
550 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
552 * Class finite no longer treats UNIV as class parameter. Use class
553 enum from theory Library/Enum instead to achieve a similar effect.
556 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
557 and "Cons". INCOMPATIBILITY.
559 * HOL (and FOL): renamed variables in rules imp_elim and swap.
560 Potential INCOMPATIBILITY.
562 * Theory Product_Type: duplicated lemmas split_Pair_apply and
563 injective_fst_snd removed, use split_eta and prod_eqI instead.
564 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
566 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
567 the same name in theory Orderings:
577 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
578 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
579 and different variable names.
581 * Library/Option_ord.thy: Canonical order on option type.
583 * Library/RBT.thy: Red-black trees, an efficient implementation of
586 * Library/Countable.thy: Type class for countable types.
588 * Theory Int: The representation of numerals has changed. The infix
589 operator BIT and the bit datatype with constructors B0 and B1 have
590 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
591 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
592 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
595 * Theory Nat: definition of <= and < on natural numbers no longer
596 depend on well-founded relations. INCOMPATIBILITY. Definitions
597 le_def and less_def have disappeared. Consider lemmas not_less
598 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
600 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
601 (whose purpose mainly is for various fold_set functionals) have been
602 abandoned in favor of the existing algebraic classes
603 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
604 lower_semilattice (resp. upper_semilattice) and linorder.
607 * Theory Transitive_Closure: induct and cases rules now declare proper
608 case_names ("base" and "step"). INCOMPATIBILITY.
610 * Theorem Inductive.lfp_ordinal_induct generalized to complete
611 lattices. The form set-specific version is available as
612 Inductive.lfp_ordinal_induct_set.
614 * Renamed theorems "power.simps" to "power_int.simps".
617 * Class semiring_div provides basic abstract properties of semirings
618 with division and modulo operations. Subsumes former class dvd_mod.
620 * Merged theories IntDef, Numeral and IntArith into unified theory
621 Int. INCOMPATIBILITY.
623 * Theory Library/Code_Index: type "index" now represents natural
624 numbers rather than integers. INCOMPATIBILITY.
626 * New class "uminus" with operation "uminus" (split of from class
627 "minus" which now only has operation "minus", binary).
630 * Constants "card", "internal_split", "option_map" now with authentic
631 syntax. INCOMPATIBILITY.
633 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
634 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
635 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
636 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
637 Sup_set_def, le_def, less_def, option_map_def now with object
638 equality. INCOMPATIBILITY.
640 * Records. Removed K_record, and replaced it by pure lambda term
641 %x. c. The simplifier setup is now more robust against eta expansion.
642 INCOMPATIBILITY: in cases explicitly referring to K_record.
644 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
646 * Library/ListVector: new theory of arithmetic vector operations.
648 * Library/Order_Relation: new theory of various orderings as sets of
649 pairs. Defines preorders, partial orders, linear orders and
650 well-orders on sets and on types.
655 * Renamed some theories to allow to loading both ZF and HOL in the
658 Datatype -> Datatype_ZF
659 Inductive -> Inductive_ZF
666 INCOMPATIBILITY: ZF theories that import individual theories below
667 Main might need to be adapted. Regular theory Main is still
668 available, as trivial extension of Main_ZF.
673 * ML within Isar: antiquotation @{const name} or @{const
674 name(typargs)} produces statically-checked Const term.
676 * Functor NamedThmsFun: data is available to the user as dynamic fact
677 (of the same name). Removed obsolete print command.
679 * Removed obsolete "use_legacy_bindings" function.
681 * The ``print mode'' is now a thread-local value derived from a global
682 template (the former print_mode reference), thus access becomes
683 non-critical. The global print_mode reference is for session
684 management only; user-code should use print_mode_value,
685 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
687 * Functions system/system_out provide a robust way to invoke external
688 shell commands, with propagation of interrupts (requires Poly/ML 5.2).
689 Do not use OS.Process.system etc. from the basis library!
694 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
695 in accordance with Proof General 3.7, which prefers GNU emacs.
697 * isatool tty runs Isabelle process with plain tty interaction;
698 optional line editor may be specified via ISABELLE_LINE_EDITOR
699 setting, the default settings attempt to locate "ledit" and "rlwrap".
701 * isatool browser now works with Cygwin as well, using general
702 "javapath" function defined in Isabelle process environment.
704 * YXML notation provides a simple and efficient alternative to
705 standard XML transfer syntax. See src/Pure/General/yxml.ML and
706 isatool yxml as described in the Isabelle system manual.
708 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
709 provides general wrapper for managing an Isabelle process in a robust
710 fashion, with ``cooked'' output from stdin/stderr.
712 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
713 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
715 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
716 way of changing the user's settings is via
717 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
720 * Multithreading.max_threads := 0 refers to the number of actual CPU
721 cores of the underlying machine, which is a good starting point for
722 optimal performance tuning. The corresponding usedir option -M allows
723 "max" as an alias for "0". WARNING: does not work on certain versions
724 of Mac OS (with Poly/ML 5.1).
726 * isabelle-process: non-ML sessions are run with "nice", to reduce the
727 adverse effect of Isabelle flooding interactive front-ends (notably
728 ProofGeneral / XEmacs).
732 New in Isabelle2007 (November 2007)
733 -----------------------------------
737 * More uniform information about legacy features, notably a
738 warning/error of "Legacy feature: ...", depending on the state of the
739 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
740 legacy features will disappear eventually.
742 * Theory syntax: the header format ``theory A = B + C:'' has been
743 discontinued in favour of ``theory A imports B C begin''. Use isatool
744 fixheaders to convert existing theory files. INCOMPATIBILITY.
746 * Theory syntax: the old non-Isar theory file format has been
747 discontinued altogether. Note that ML proof scripts may still be used
748 with Isar theories; migration is usually quite simple with the ML
749 function use_legacy_bindings. INCOMPATIBILITY.
751 * Theory syntax: some popular names (e.g. 'class', 'declaration',
752 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
755 * Theory loader: be more serious about observing the static theory
756 header specifications (including optional directories), but not the
757 accidental file locations of previously successful loads. The strict
758 update policy of former update_thy is now already performed by
759 use_thy, so the former has been removed; use_thys updates several
760 theories simultaneously, just as 'imports' within a theory header
761 specification, but without merging the results. Potential
762 INCOMPATIBILITY: may need to refine theory headers and commands
763 ROOT.ML which depend on load order.
765 * Theory loader: optional support for content-based file
766 identification, instead of the traditional scheme of full physical
767 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
768 (cf. the system manual). The new scheme allows to work with
769 non-finished theories in persistent session images, such that source
770 files may be moved later on without requiring reloads.
772 * Theory loader: old-style ML proof scripts being *attached* to a thy
773 file (with the same base name as the theory) are considered a legacy
774 feature, which will disappear eventually. Even now, the theory loader
775 no longer maintains dependencies on such files.
777 * Syntax: the scope for resolving ambiguities via type-inference is
778 now limited to individual terms, instead of whole simultaneous
779 specifications as before. This greatly reduces the complexity of the
780 syntax module and improves flexibility by separating parsing and
781 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
782 'fixes' etc.) are required in rare situations.
784 * Syntax: constants introduced by new-style packages ('definition',
785 'abbreviation' etc.) are passed through the syntax module in
786 ``authentic mode''. This means that associated mixfix annotations
787 really stick to such constants, independently of potential name space
788 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
789 trees are represented slightly differently, may need to adapt syntax
790 translations accordingly. Use CONST marker in 'translations' and
791 @{const_syntax} antiquotation in 'parse_translation' etc.
793 * Legacy goal package: reduced interface to the bare minimum required
794 to keep existing proof scripts running. Most other user-level
795 functions are now part of the OldGoals structure, which is *not* open
796 by default (consider isatool expandshort before open OldGoals).
797 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
798 these tend to cause confusion about the actual goal (!) context being
799 used here, which is not necessarily the same as the_context().
801 * Command 'find_theorems': supports "*" wild-card in "name:"
802 criterion; "with_dups" option. Certain ProofGeneral versions might
803 support a specific search form (see ProofGeneral/CHANGES).
805 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
806 by default, which means that "prems" (and also "fixed variables") are
807 suppressed from proof state output. Note that the ProofGeneral
808 settings mechanism allows to change and save options persistently, but
809 older versions of Isabelle will fail to start up if a negative prems
812 * Local theory targets may be specified by non-nested blocks of
813 ``context/locale/class ... begin'' followed by ``end''. The body may
814 contain definitions, theorems etc., including any derived mechanism
815 that has been implemented on top of these primitives. This concept
816 generalizes the existing ``theorem (in ...)'' towards more versatility
819 * Proof General interface: proper undo of final 'end' command;
820 discontinued Isabelle/classic mode (ML proof scripts).
823 *** Document preparation ***
825 * Added antiquotation @{theory name} which prints the given name,
826 after checking that it refers to a valid ancestor theory in the
829 * Added antiquotations @{ML_type text} and @{ML_struct text} which
830 check the given source text as ML type/structure, printing verbatim.
832 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
833 "c args == rhs" given in the current context. (Any number of
834 arguments may be given on the LHS.)
839 * The 'class' package offers a combination of axclass and locale to
840 achieve Haskell-like type classes in Isabelle. Definitions and
841 theorems within a class context produce both relative results (with
842 implicit parameters according to the locale context), and polymorphic
843 constants with qualified polymorphism (according to the class
844 context). Within the body context of a 'class' target, a separate
845 syntax layer ("user space type system") takes care of converting
846 between global polymorphic consts and internal locale representation.
847 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
848 "isatool doc classes" provides a tutorial.
850 * Generic code generator framework allows to generate executable
851 code for ML and Haskell (including Isabelle classes). A short usage
854 internal compilation:
855 export_code <list of constants (term syntax)> in SML
856 writing SML code to a file:
857 export_code <list of constants (term syntax)> in SML <filename>
858 writing OCaml code to a file:
859 export_code <list of constants (term syntax)> in OCaml <filename>
860 writing Haskell code to a bunch of files:
861 export_code <list of constants (term syntax)> in Haskell <filename>
863 evaluating closed propositions to True/False using code generation:
866 Reasonable default setup of framework in HOL.
868 Theorem attributs for selecting and transforming function equations theorems:
870 [code fun]: select a theorem as function equation for a specific constant
871 [code fun del]: deselect a theorem as function equation for a specific constant
872 [code inline]: select an equation theorem for unfolding (inlining) in place
873 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
875 User-defined serializations (target in {SML, OCaml, Haskell}):
877 code_const <and-list of constants (term syntax)>
878 {(target) <and-list of const target syntax>}+
880 code_type <and-list of type constructors>
881 {(target) <and-list of type target syntax>}+
883 code_instance <and-list of instances>
885 where instance ::= <type constructor> :: <class>
887 code_class <and_list of classes>
888 {(target) <and-list of class target syntax>}+
889 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
891 code_instance and code_class only are effective to target Haskell.
893 For example usage see src/HOL/ex/Codegenerator.thy and
894 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
895 generation from Isabelle/HOL theories is available via "isatool doc
898 * Code generator: consts in 'consts_code' Isar commands are now
899 referred to by usual term syntax (including optional type
902 * Command 'no_translations' removes translation rules from theory
905 * Overloaded definitions are now actually checked for acyclic
906 dependencies. The overloading scheme is slightly more general than
907 that of Haskell98, although Isabelle does not demand an exact
908 correspondence to type class and instance declarations.
909 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
910 exotic versions of overloading -- at the discretion of the user!
912 Polymorphic constants are represented via type arguments, i.e. the
913 instantiation that matches an instance against the most general
914 declaration given in the signature. For example, with the declaration
915 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
916 as c(nat). Overloading is essentially simultaneous structural
917 recursion over such type arguments. Incomplete specification patterns
918 impose global constraints on all occurrences, e.g. c('a * 'a) on the
919 LHS means that more general c('a * 'b) will be disallowed on any RHS.
920 Command 'print_theory' outputs the normalized system of recursive
921 equations, see section "definitions".
923 * Configuration options are maintained within the theory or proof
924 context (with name and type bool/int/string), providing a very simple
925 interface to a poor-man's version of general context data. Tools may
926 declare options in ML (e.g. using Attrib.config_int) and then refer to
927 these values using Config.get etc. Users may change options via an
928 associated attribute of the same name. This form of context
929 declaration works particularly well with commands 'declare' or
930 'using', for example ``declare [[foo = 42]]''. Thus it has become
931 very easy to avoid global references, which would not observe Isar
932 toplevel undo/redo and fail to work with multithreading.
934 Various global ML references of Pure and HOL have been turned into
935 configuration options:
937 Unify.search_bound unify_search_bound
938 Unify.trace_bound unify_trace_bound
939 Unify.trace_simp unify_trace_simp
940 Unify.trace_types unify_trace_types
941 Simplifier.simp_depth_limit simp_depth_limit
942 Blast.depth_limit blast_depth_limit
943 DatatypeProp.dtK datatype_distinctness_limit
944 fast_arith_neq_limit fast_arith_neq_limit
945 fast_arith_split_limit fast_arith_split_limit
947 * Named collections of theorems may be easily installed as context
948 data using the functor NamedThmsFun (see also
949 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
950 attributes; there is also a toplevel print command. This facility is
951 just a common case of general context data, which is the preferred way
952 for anything more complex than just a list of facts in canonical
955 * Isar: command 'declaration' augments a local theory by generic
956 declaration functions written in ML. This enables arbitrary content
957 being added to the context, depending on a morphism that tells the
958 difference of the original declaration context wrt. the application
959 context encountered later on.
961 * Isar: proper interfaces for simplification procedures. Command
962 'simproc_setup' declares named simprocs (with match patterns, and body
963 text in ML). Attribute "simproc" adds/deletes simprocs in the current
964 context. ML antiquotation @{simproc name} retrieves named simprocs.
966 * Isar: an extra pair of brackets around attribute declarations
967 abbreviates a theorem reference involving an internal dummy fact,
968 which will be ignored later --- only the effect of the attribute on
969 the background context will persist. This form of in-place
970 declarations is particularly useful with commands like 'declare' and
971 'using', for example ``have A using [[simproc a]] by simp''.
973 * Isar: method "assumption" (and implicit closing of subproofs) now
974 takes simple non-atomic goal assumptions into account: after applying
975 an assumption as a rule the resulting subgoals are solved by atomic
976 assumption steps. This is particularly useful to finish 'obtain'
977 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
978 without referring to the original premise "!!x. P x ==> thesis" in the
979 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
982 * Isar: implicit use of prems from the Isar proof context is
983 considered a legacy feature. Common applications like ``have A .''
984 may be replaced by ``have A by fact'' or ``note `A`''. In general,
985 referencing facts explicitly here improves readability and
986 maintainability of proof texts.
988 * Isar: improper proof element 'guess' is like 'obtain', but derives
989 the obtained context from the course of reasoning! For example:
991 assume "EX x y. A x & B y" -- "any previous fact"
992 then guess x and y by clarify
994 This technique is potentially adventurous, depending on the facts and
995 proof tools being involved here.
997 * Isar: known facts from the proof context may be specified as literal
998 propositions, using ASCII back-quote syntax. This works wherever
999 named facts used to be allowed so far, in proof commands, proof
1000 methods, attributes etc. Literal facts are retrieved from the context
1001 according to unification of type and term parameters. For example,
1002 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
1003 theorems in the current context, then these are valid literal facts:
1004 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
1006 There is also a proof method "fact" which does the same composition
1007 for explicit goal states, e.g. the following proof texts coincide with
1008 certain special cases of literal facts:
1010 have "A" by fact == note `A`
1011 have "A ==> B" by fact == note `A ==> B`
1012 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
1013 have "P a ==> Q a" by fact == note `P a ==> Q a`
1015 * Isar: ":" (colon) is no longer a symbolic identifier character in
1016 outer syntax. Thus symbolic identifiers may be used without
1017 additional white space in declarations like this: ``assume *: A''.
1019 * Isar: 'print_facts' prints all local facts of the current context,
1020 both named and unnamed ones.
1022 * Isar: 'def' now admits simultaneous definitions, e.g.:
1024 def x == "t" and y == "u"
1026 * Isar: added command 'unfolding', which is structurally similar to
1027 'using', but affects both the goal state and facts by unfolding given
1028 rewrite rules. Thus many occurrences of the 'unfold' method or
1029 'unfolded' attribute may be replaced by first-class proof text.
1031 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
1032 and command 'unfolding' now all support object-level equalities
1033 (potentially conditional). The underlying notion of rewrite rule is
1034 analogous to the 'rule_format' attribute, but *not* that of the
1035 Simplifier (which is usually more generous).
1037 * Isar: the new attribute [rotated n] (default n = 1) rotates the
1038 premises of a theorem by n. Useful in conjunction with drule.
1040 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
1041 method expression within a sandbox consisting of the first N
1042 sub-goals, which need to exist. For example, ``simp_all [3]''
1043 simplifies the first three sub-goals, while (rule foo, simp_all)[]
1044 simplifies all new goals that emerge from applying rule foo to the
1045 originally first one.
1047 * Isar: schematic goals are no longer restricted to higher-order
1048 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
1051 * Isar: the conclusion of a long theorem statement is now either
1052 'shows' (a simultaneous conjunction, as before), or 'obtains'
1053 (essentially a disjunction of cases with local parameters and
1054 assumptions). The latter allows to express general elimination rules
1055 adequately; in this notation common elimination rules look like this:
1057 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
1059 obtains x where "P x"
1061 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
1065 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
1071 The subsequent classical rules even refer to the formal "thesis"
1074 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
1077 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
1078 obtains "thesis ==> something"
1080 The actual proof of an 'obtains' statement is analogous to that of the
1081 Isar proof element 'obtain', only that there may be several cases.
1082 Optional case names may be specified in parentheses; these will be
1083 available both in the present proof and as annotations in the
1084 resulting rule, for later use with the 'cases' method (cf. attribute
1087 * Isar: the assumptions of a long theorem statement are available as
1088 "assms" fact in the proof context. This is more appropriate than the
1089 (historical) "prems", which refers to all assumptions of the current
1090 context, including those from the target locale, proof body etc.
1092 * Isar: 'print_statement' prints theorems from the current theory or
1093 proof context in long statement form, according to the syntax of a
1096 * Isar: 'obtain' takes an optional case name for the local context
1097 introduction rule (default "that").
1099 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
1100 explicit (is "_ ==> ?foo") in the rare cases where this still happens
1103 * Pure: syntax "CONST name" produces a fully internalized constant
1104 according to the current context. This is particularly useful for
1105 syntax translations that should refer to internal constant
1106 representations independently of name spaces.
1108 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
1109 instead of "FOO ". This allows multiple binder declarations to coexist
1110 in the same context. INCOMPATIBILITY.
1112 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
1113 primitive that also works in a locale context (both for constants and
1114 fixed variables). Type declaration and internal syntactic representation
1115 of given constants retrieved from the context. Likewise, the
1116 'no_notation' command allows to remove given syntax annotations from the
1119 * Isar/locales: new derived specification elements 'axiomatization',
1120 'definition', 'abbreviation', which support type-inference, admit
1121 object-level specifications (equality, equivalence). See also the
1122 isar-ref manual. Examples:
1125 eq (infix "===" 50) where
1126 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
1128 definition "f x y = x + y + 1"
1129 definition g where "g x = f x x"
1132 neq (infix "=!=" 50) where
1133 "x =!= y == ~ (x === y)"
1135 These specifications may be also used in a locale context. Then the
1136 constants being introduced depend on certain fixed parameters, and the
1137 constant name is qualified by the locale base name. An internal
1138 abbreviation takes care for convenient input and output, making the
1139 parameters implicit and using the original short name. See also
1140 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
1141 entities from a monomorphic theory.
1143 Presently, abbreviations are only available 'in' a target locale, but
1144 not inherited by general import expressions. Also note that
1145 'abbreviation' may be used as a type-safe replacement for 'syntax' +
1146 'translations' in common applications. The "no_abbrevs" print mode
1147 prevents folding of abbreviations in term output.
1149 Concrete syntax is attached to specified constants in internal form,
1150 independently of name spaces. The parse tree representation is
1151 slightly different -- use 'notation' instead of raw 'syntax', and
1152 'translations' with explicit "CONST" markup to accommodate this.
1154 * Pure/Isar: unified syntax for new-style specification mechanisms
1155 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
1156 full type inference and dummy patterns ("_"). For example:
1158 definition "K x _ = x"
1160 inductive conj for A B
1161 where "A ==> B ==> conj A B"
1163 * Pure: command 'print_abbrevs' prints all constant abbreviations of
1164 the current context. Print mode "no_abbrevs" prevents inversion of
1165 abbreviations on output.
1167 * Isar/locales: improved parameter handling: use of locales "var" and
1168 "struct" no longer necessary; - parameter renamings are no longer
1169 required to be injective. For example, this allows to define
1170 endomorphisms as locale endom = homom mult mult h.
1172 * Isar/locales: changed the way locales with predicates are defined.
1173 Instead of accumulating the specification, the imported expression is
1174 now an interpretation. INCOMPATIBILITY: different normal form of
1175 locale expressions. In particular, in interpretations of locales with
1176 predicates, goals repesenting already interpreted fragments are not
1177 removed automatically. Use methods `intro_locales' and
1178 `unfold_locales'; see below.
1180 * Isar/locales: new methods `intro_locales' and `unfold_locales'
1181 provide backward reasoning on locales predicates. The methods are
1182 aware of interpretations and discharge corresponding goals.
1183 `intro_locales' is less aggressive then `unfold_locales' and does not
1184 unfold predicates to assumptions.
1186 * Isar/locales: the order in which locale fragments are accumulated
1187 has changed. This enables to override declarations from fragments due
1188 to interpretations -- for example, unwanted simp rules.
1190 * Isar/locales: interpretation in theories and proof contexts has been
1191 extended. One may now specify (and prove) equations, which are
1192 unfolded in interpreted theorems. This is useful for replacing
1193 defined concepts (constants depending on locale parameters) by
1194 concepts already existing in the target context. Example:
1196 interpretation partial_order ["op <= :: [int, int] => bool"]
1197 where "partial_order.less (op <=) (x::int) y = (x < y)"
1199 Typically, the constant `partial_order.less' is created by a
1200 definition specification element in the context of locale
1203 * Method "induct": improved internal context management to support
1204 local fixes and defines on-the-fly. Thus explicit meta-level
1205 connectives !! and ==> are rarely required anymore in inductive goals
1206 (using object-logic connectives for this purpose has been long
1207 obsolete anyway). Common proof patterns are explained in
1208 src/HOL/Induct/Common_Patterns.thy, see also
1209 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
1212 * Method "induct": improved handling of simultaneous goals. Instead of
1213 introducing object-level conjunction, the statement is now split into
1214 several conclusions, while the corresponding symbolic cases are nested
1215 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
1216 see src/HOL/Induct/Common_Patterns.thy, for example.
1218 * Method "induct": mutual induction rules are now specified as a list
1219 of rule sharing the same induction cases. HOL packages usually provide
1220 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
1221 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
1222 mutual induction rules differently, i.e. like this:
1224 (induct rule: foo_bar.inducts)
1225 (induct set: foo bar)
1226 (induct pred: foo bar)
1227 (induct type: foo bar)
1229 The ML function ProjectRule.projections turns old-style rules into the
1232 * Method "coinduct": dual of induction, see
1233 src/HOL/Library/Coinductive_List.thy for various examples.
1235 * Method "cases", "induct", "coinduct": the ``(open)'' option is
1236 considered a legacy feature.
1238 * Attribute "symmetric" produces result with standardized schematic
1239 variables (index 0). Potential INCOMPATIBILITY.
1241 * Simplifier: by default the simplifier trace only shows top level
1242 rewrites now. That is, trace_simp_depth_limit is set to 1 by
1243 default. Thus there is less danger of being flooded by the trace. The
1244 trace indicates where parts have been suppressed.
1246 * Provers/classical: removed obsolete classical version of elim_format
1247 attribute; classical elim/dest rules are now treated uniformly when
1248 manipulating the claset.
1250 * Provers/classical: stricter checks to ensure that supplied intro,
1251 dest and elim rules are well-formed; dest and elim rules must have at
1254 * Provers/classical: attributes dest/elim/intro take an optional
1255 weight argument for the rule (just as the Pure versions). Weights are
1256 ignored by automated tools, but determine the search order of single
1259 * Syntax: input syntax now supports dummy variable binding "%_. b",
1260 where the body does not mention the bound variable. Note that dummy
1261 patterns implicitly depend on their context of bounds, which makes
1262 "{_. _}" match any set comprehension as expected. Potential
1263 INCOMPATIBILITY -- parse translations need to cope with syntactic
1264 constant "_idtdummy" in the binding position.
1266 * Syntax: removed obsolete syntactic constant "_K" and its associated
1267 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
1268 for example "A -> B" => "Pi A (%_. B)".
1270 * Pure: 'class_deps' command visualizes the subclass relation, using
1271 the graph browser tool.
1273 * Pure: 'print_theory' now suppresses certain internal declarations by
1274 default; use '!' option for full details.
1279 * Method "metis" proves goals by applying the Metis general-purpose
1280 resolution prover (see also http://gilith.com/software/metis/).
1281 Examples are in the directory MetisExamples. WARNING: the
1282 Isabelle/HOL-Metis integration does not yet work properly with
1285 * Command 'sledgehammer' invokes external automatic theorem provers as
1286 background processes. It generates calls to the "metis" method if
1287 successful. These can be pasted into the proof. Users do not have to
1288 wait for the automatic provers to return. WARNING: does not really
1289 work with multi-threading.
1291 * New "auto_quickcheck" feature tests outermost goal statements for
1292 potential counter-examples. Controlled by ML references
1293 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
1294 5000 milliseconds). Fails silently if statements is outside of
1295 executable fragment, or any other codgenerator problem occurs.
1297 * New constant "undefined" with axiom "undefined x = undefined".
1299 * Added class "HOL.eq", allowing for code generation with polymorphic
1302 * Some renaming of class constants due to canonical name prefixing in
1303 the new 'class' package:
1305 HOL.abs ~> HOL.abs_class.abs
1306 HOL.divide ~> HOL.divide_class.divide
1307 0 ~> HOL.zero_class.zero
1308 1 ~> HOL.one_class.one
1309 op + ~> HOL.plus_class.plus
1310 op - ~> HOL.minus_class.minus
1311 uminus ~> HOL.minus_class.uminus
1312 op * ~> HOL.times_class.times
1313 op < ~> HOL.ord_class.less
1314 op <= > HOL.ord_class.less_eq
1315 Nat.power ~> Power.power_class.power
1316 Nat.size ~> Nat.size_class.size
1317 Numeral.number_of ~> Numeral.number_class.number_of
1318 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
1319 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
1320 Orderings.min ~> Orderings.ord_class.min
1321 Orderings.max ~> Orderings.ord_class.max
1322 Divides.op div ~> Divides.div_class.div
1323 Divides.op mod ~> Divides.div_class.mod
1324 Divides.op dvd ~> Divides.div_class.dvd
1326 INCOMPATIBILITY. Adaptions may be required in the following cases:
1328 a) User-defined constants using any of the names "plus", "minus",
1329 "times", "less" or "less_eq". The standard syntax translations for
1330 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
1333 b) Variables named "plus", "minus", "times", "less", "less_eq"
1334 INCOMPATIBILITY: use more specific names.
1336 c) Permutative equations (e.g. "a + b = b + a")
1337 Since the change of names also changes the order of terms, permutative
1338 rewrite rules may get applied in a different order. Experience shows
1339 that this is rarely the case (only two adaptions in the whole Isabelle
1340 distribution). INCOMPATIBILITY: rewrite proofs
1342 d) ML code directly refering to constant names
1343 This in general only affects hand-written proof tactics, simprocs and
1344 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
1345 Consider using @{const_name} antiquotation.
1347 * New class "default" with associated constant "default".
1349 * Function "sgn" is now overloaded and available on int, real, complex
1350 (and other numeric types), using class "sgn". Two possible defs of
1351 sgn are given as equational assumptions in the classes sgn_if and
1352 sgn_div_norm; ordered_idom now also inherits from sgn_if.
1355 * Locale "partial_order" now unified with class "order" (cf. theory
1356 Orderings), added parameter "less". INCOMPATIBILITY.
1358 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
1359 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
1360 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
1362 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
1363 changed order of proof goals in instance proofs.
1365 * The transitivity reasoner for partial and linear orders is set up
1366 for classes "order" and "linorder". Instances of the reasoner are available
1367 in all contexts importing or interpreting the corresponding locales.
1368 Method "order" invokes the reasoner separately; the reasoner
1369 is also integrated with the Simplifier as a solver. Diagnostic
1370 command 'print_orders' shows the available instances of the reasoner
1371 in the current context.
1373 * Localized monotonicity predicate in theory "Orderings"; integrated
1374 lemmas max_of_mono and min_of_mono with this predicate.
1377 * Formulation of theorem "dense" changed slightly due to integration
1378 with new class dense_linear_order.
1380 * Uniform lattice theory development in HOL.
1382 constants "meet" and "join" now named "inf" and "sup"
1383 constant "Meet" now named "Inf"
1385 classes "meet_semilorder" and "join_semilorder" now named
1386 "lower_semilattice" and "upper_semilattice"
1387 class "lorder" now named "lattice"
1388 class "comp_lat" now named "complete_lattice"
1390 Instantiation of lattice classes allows explicit definitions
1391 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
1393 INCOMPATIBILITY. Theorem renames:
1395 meet_left_le ~> inf_le1
1396 meet_right_le ~> inf_le2
1397 join_left_le ~> sup_ge1
1398 join_right_le ~> sup_ge2
1399 meet_join_le ~> inf_sup_ord
1402 le_meet ~> le_inf_iff
1403 le_join ~> ge_sup_conv
1404 meet_idempotent ~> inf_idem
1405 join_idempotent ~> sup_idem
1406 meet_comm ~> inf_commute
1407 join_comm ~> sup_commute
1408 meet_leI1 ~> le_infI1
1409 meet_leI2 ~> le_infI2
1410 le_joinI1 ~> le_supI1
1411 le_joinI2 ~> le_supI2
1412 meet_assoc ~> inf_assoc
1413 join_assoc ~> sup_assoc
1414 meet_left_comm ~> inf_left_commute
1415 meet_left_idempotent ~> inf_left_idem
1416 join_left_comm ~> sup_left_commute
1417 join_left_idempotent ~> sup_left_idem
1420 le_def_meet ~> le_iff_inf
1421 le_def_join ~> le_iff_sup
1422 join_absorp2 ~> sup_absorb2
1423 join_absorp1 ~> sup_absorb1
1424 meet_absorp1 ~> inf_absorb1
1425 meet_absorp2 ~> inf_absorb2
1426 meet_join_absorp ~> inf_sup_absorb
1427 join_meet_absorp ~> sup_inf_absorb
1428 distrib_join_le ~> distrib_sup_le
1429 distrib_meet_le ~> distrib_inf_le
1431 add_meet_distrib_left ~> add_inf_distrib_left
1432 add_join_distrib_left ~> add_sup_distrib_left
1433 is_join_neg_meet ~> is_join_neg_inf
1434 is_meet_neg_join ~> is_meet_neg_sup
1435 add_meet_distrib_right ~> add_inf_distrib_right
1436 add_join_distrib_right ~> add_sup_distrib_right
1437 add_meet_join_distribs ~> add_sup_inf_distribs
1438 join_eq_neg_meet ~> sup_eq_neg_inf
1439 meet_eq_neg_join ~> inf_eq_neg_sup
1440 add_eq_meet_join ~> add_eq_inf_sup
1441 meet_0_imp_0 ~> inf_0_imp_0
1442 join_0_imp_0 ~> sup_0_imp_0
1443 meet_0_eq_0 ~> inf_0_eq_0
1444 join_0_eq_0 ~> sup_0_eq_0
1445 neg_meet_eq_join ~> neg_inf_eq_sup
1446 neg_join_eq_meet ~> neg_sup_eq_inf
1447 join_eq_if ~> sup_eq_if
1449 mono_meet ~> mono_inf
1450 mono_join ~> mono_sup
1451 meet_bool_eq ~> inf_bool_eq
1452 join_bool_eq ~> sup_bool_eq
1453 meet_fun_eq ~> inf_fun_eq
1454 join_fun_eq ~> sup_fun_eq
1455 meet_set_eq ~> inf_set_eq
1456 join_set_eq ~> sup_set_eq
1457 meet1_iff ~> inf1_iff
1458 meet2_iff ~> inf2_iff
1467 join1_iff ~> sup1_iff
1468 join2_iff ~> sup2_iff
1478 is_meet_Meet ~> is_meet_Inf
1479 Meet_bool_def ~> Inf_bool_def
1480 Meet_fun_def ~> Inf_fun_def
1481 Meet_greatest ~> Inf_greatest
1482 Meet_lower ~> Inf_lower
1483 Meet_set_def ~> Inf_set_def
1486 Sup_bool_eq ~> Sup_bool_def
1487 Sup_fun_eq ~> Sup_fun_def
1488 Sup_set_eq ~> Sup_set_def
1490 listsp_meetI ~> listsp_infI
1491 listsp_meet_eq ~> listsp_inf_eq
1496 * Added syntactic class "size"; overloaded constant "size" now has
1497 type "'a::size ==> bool"
1499 * Internal reorganisation of `size' of datatypes: size theorems
1500 "foo.size" are no longer subsumed by "foo.simps" (but are still
1501 simplification rules by default!); theorems "prod.size" now named
1504 * Class "div" now inherits from class "times" rather than "type".
1507 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
1508 Linorder etc. have disappeared; operations defined in terms of
1509 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
1511 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
1513 * HOL-Word: New extensive library and type for generic, fixed size
1514 machine words, with arithemtic, bit-wise, shifting and rotating
1515 operations, reflection into int, nat, and bool lists, automation for
1516 linear arithmetic (by automatic reflection into nat or int), including
1517 lemmas on overflow and monotonicity. Instantiated to all appropriate
1518 arithmetic type classes, supporting automatic simplification of
1519 numerals on all operations.
1521 * Library/Boolean_Algebra: locales for abstract boolean algebras.
1523 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
1525 * Code generator library theories:
1526 - Code_Integer represents HOL integers by big integer literals in target
1528 - Code_Char represents HOL characters by character literals in target
1530 - Code_Char_chr like Code_Char, but also offers treatment of character
1531 codes; includes Code_Integer.
1532 - Executable_Set allows to generate code for finite sets using lists.
1533 - Executable_Rat implements rational numbers as triples (sign, enumerator,
1535 - Executable_Real implements a subset of real numbers, namly those
1536 representable by rational numbers.
1537 - Efficient_Nat implements natural numbers by integers, which in general will
1538 result in higher efficency; pattern matching with 0/Suc is eliminated;
1539 includes Code_Integer.
1540 - Code_Index provides an additional datatype index which is mapped to
1541 target-language built-in integers.
1542 - Code_Message provides an additional datatype message_string which is isomorphic to
1543 strings; messages are mapped to target-language strings.
1545 * New package for inductive predicates
1547 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
1550 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1551 for z_1 :: U_1 and ... and z_n :: U_m
1553 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1556 with full support for type-inference, rather than
1558 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1560 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1561 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1563 inductive "s z_1 ... z_m"
1565 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1568 For backward compatibility, there is a wrapper allowing inductive
1569 sets to be defined with the new package via
1572 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1573 for z_1 :: U_1 and ... and z_n :: U_m
1575 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1581 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1582 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1583 for z_1 :: U_1 and ... and z_n :: U_m
1585 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1586 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1589 if the additional syntax "p ..." is required.
1591 Numerous examples can be found in the subdirectories src/HOL/Auth,
1592 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
1596 - Since declaration and definition of inductive sets or predicates
1597 is no longer separated, abbreviations involving the newly
1598 introduced sets or predicates must be specified together with the
1599 introduction rules after the 'where' keyword (see above), rather
1600 than before the actual inductive definition.
1602 - The variables in induction and elimination rules are now
1603 quantified in the order of their occurrence in the introduction
1604 rules, rather than in alphabetical order. Since this may break
1605 some proofs, these proofs either have to be repaired, e.g. by
1606 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
1607 statements of the form
1609 case (rule_i a_i_1 ... a_i_{k_i})
1611 or the old order of quantification has to be restored by explicitly adding
1612 meta-level quantifiers in the introduction rules, i.e.
1614 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
1616 - The format of the elimination rules is now
1618 p z_1 ... z_m x_1 ... x_n ==>
1619 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1624 (x_1, ..., x_n) : s z_1 ... z_m ==>
1625 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1628 for sets rather than
1630 x : s z_1 ... z_m ==>
1631 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
1634 This may require terms in goals to be expanded to n-tuples
1635 (e.g. using case_tac or simplification with the split_paired_all
1636 rule) before the above elimination rule is applicable.
1638 - The elimination or case analysis rules for (mutually) inductive
1639 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
1640 list of rules "p_1_..._p_k.elims" is no longer available.
1642 * New package "function"/"fun" for general recursive functions,
1643 supporting mutual and nested recursion, definitions in local contexts,
1644 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
1645 for small examples, and the separate tutorial on the function
1646 package. The old recdef "package" is still available as before, but
1647 users are encouraged to use the new package.
1649 * Method "lexicographic_order" automatically synthesizes termination
1650 relations as lexicographic combinations of size measures.
1652 * Case-expressions allow arbitrary constructor-patterns (including
1653 "_") and take their order into account, like in functional
1654 programming. Internally, this is translated into nested
1655 case-expressions; missing cases are added and mapped to the predefined
1656 constant "undefined". In complicated cases printing may no longer show
1657 the original input but the internal form. Lambda-abstractions allow
1658 the same form of pattern matching: "% pat1 => e1 | ..." is an
1659 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
1662 * IntDef: The constant "int :: nat => int" has been removed; now "int"
1663 is an abbreviation for "of_nat :: nat => int". The simplification
1664 rules for "of_nat" have been changed to work like "int" did
1665 previously. Potential INCOMPATIBILITY:
1666 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
1667 - of_nat_diff and of_nat_mult are no longer default simp rules
1669 * Method "algebra" solves polynomial equations over (semi)rings using
1670 Groebner bases. The (semi)ring structure is defined by locales and the
1671 tool setup depends on that generic context. Installing the method for
1672 a specific type involves instantiating the locale and possibly adding
1673 declarations for computation on the coefficients. The method is
1674 already instantiated for natural numbers and for the axiomatic class
1675 of idoms with numerals. See also the paper by Chaieb and Wenzel at
1676 CALCULEMUS 2007 for the general principles underlying this
1677 architecture of context-aware proof-tools.
1679 * Method "ferrack" implements quantifier elimination over
1680 special-purpose dense linear orders using locales (analogous to
1681 "algebra"). The method is already installed for class
1682 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
1685 * Former constant "List.op @" now named "List.append". Use ML
1686 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
1687 circumvent possible incompatibilities when working on ML level.
1689 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
1691 * New function listsum :: 'a list => 'a for arbitrary monoids.
1692 Special syntax: "SUM x <- xs. f x" (and latex variants)
1694 * New syntax for Haskell-like list comprehension (input only), eg.
1695 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
1697 * The special syntax for function "filter" has changed from [x :
1698 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
1699 comprehension syntax, and for uniformity. INCOMPATIBILITY.
1701 * [a..b] is now defined for arbitrary linear orders. It used to be
1702 defined on nat only, as an abbreviation for [a..<Suc b]
1705 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
1707 * New functions "sorted" and "sort" in src/HOL/List.thy.
1709 * New lemma collection field_simps (an extension of ring_simps) for
1710 manipulating (in)equations involving division. Multiplies with all
1711 denominators that can be proved to be non-zero (in equations) or
1712 positive/negative (in inequations).
1714 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
1715 have been improved and renamed to ring_simps, group_simps and
1716 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
1717 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
1719 * Theory Library/Commutative_Ring: switched from recdef to function
1720 package; constants add, mul, pow now curried. Infix syntax for
1721 algebraic operations.
1723 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
1726 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
1729 * HOL/records: generalised field-update to take a function on the
1730 field rather than the new value: r(|A := x|) is translated to A_update
1731 (K x) r The K-combinator that is internally used is called K_record.
1732 INCOMPATIBILITY: Usage of the plain update functions has to be
1735 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
1736 * x = 0, which are required for a semiring. Richer structures do not
1737 inherit from semiring_0 anymore, because this property is a theorem
1738 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
1739 there is more to prove, but this is mostly trivial.
1741 * Class "recpower" is generalized to arbitrary monoids, not just
1742 commutative semirings. INCOMPATIBILITY: may need to incorporate
1743 commutativity or semiring properties additionally.
1745 * Constant "List.list_all2" in List.thy now uses authentic syntax.
1746 INCOMPATIBILITY: translations containing list_all2 may go wrong,
1747 better use 'abbreviation'.
1749 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
1751 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
1752 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
1753 significant changes for setting up numeral syntax for types:
1754 - New constants Numeral.pred and Numeral.succ instead
1755 of former Numeral.bin_pred and Numeral.bin_succ.
1756 - Use integer operations instead of bin_add, bin_mult and so on.
1757 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
1758 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
1760 See src/HOL/Integ/IntArith.thy for an example setup.
1762 * Command 'normal_form' computes the normal form of a term that may
1763 contain free variables. For example ``normal_form "rev [a, b, c]"''
1764 produces ``[b, c, a]'' (without proof). This command is suitable for
1765 heavy-duty computations because the functions are compiled to ML
1766 first. Correspondingly, a method "normalization" is provided. See
1767 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
1769 * Alternative iff syntax "A <-> B" for equality on bool (with priority
1770 25 like -->); output depends on the "iff" print_mode, the default is
1771 "A = B" (with priority 50).
1773 * Relations less (<) and less_eq (<=) are also available on type bool.
1774 Modified syntax to disallow nesting without explicit parentheses,
1775 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
1778 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
1780 * Relation composition operator "op O" now has precedence 75 and binds
1781 stronger than union and intersection. INCOMPATIBILITY.
1783 * The old set interval syntax "{m..n(}" (and relatives) has been
1784 removed. Use "{m..<n}" (and relatives) instead.
1786 * In the context of the assumption "~(s = t)" the Simplifier rewrites
1787 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
1788 ``declare [[simproc del: neq]]''.
1790 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
1793 * Theorem Cons_eq_map_conv no longer declared as "simp".
1795 * Theorem setsum_mult renamed to setsum_right_distrib.
1797 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
1800 * Reimplemented methods "sat" and "satx", with several improvements:
1801 goals no longer need to be stated as "<prems> ==> False", equivalences
1802 (i.e. "=" on type bool) are handled, variable names of the form
1803 "lit_<n>" are no longer reserved, significant speedup.
1805 * Methods "sat" and "satx" can now replay MiniSat proof traces.
1806 zChaff is still supported as well.
1808 * 'inductive' and 'datatype': provide projections of mutual rules,
1809 bundled as foo_bar.inducts;
1811 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
1814 * Library: moved theory Accessible_Part to main HOL.
1816 * Library: added theory Coinductive_List of potentially infinite lists
1817 as greatest fixed-point.
1819 * Library: added theory AssocList which implements (finite) maps as
1822 * Method "evaluation" solves goals (i.e. a boolean expression)
1823 efficiently by compiling it to ML. The goal is "proved" (via an
1824 oracle) if it evaluates to True.
1826 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
1827 also when invoked by the simplifier. This results in the Simplifier
1828 being more powerful on arithmetic goals. INCOMPATIBILITY.
1829 Configuration option fast_arith_split_limit=0 recovers the old
1832 * Support for hex (0x20) and binary (0b1001) numerals.
1834 * New method: reify eqs (t), where eqs are equations for an
1835 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
1836 parameter, computes a term s::'b and a list xs::'a list and proves the
1837 theorem I xs s = t. This is also known as reification or quoting. The
1838 resulting theorem is applied to the subgoal to substitute t with I xs
1839 s. If t is omitted, the subgoal itself is reified.
1841 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
1842 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
1843 where f is supposed to be a computable function (in the sense of code
1844 generattion). The method uses reify to compute s and xs as above then
1845 applies corr_thm and uses normalization by evaluation to "prove" f s =
1846 r and finally gets the theorem t = r, which is again applied to the
1847 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
1849 * Reflection: Automatic reification now handels binding, an example is
1850 available in src/HOL/ex/ReflectionEx.thy
1852 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
1853 command 'statespace' that is similar to 'record', but introduces an
1854 abstract specification based on the locale infrastructure instead of
1855 HOL types. This leads to extra flexibility in composing state spaces,
1856 in particular multiple inheritance and renaming of components.
1861 * Hyperreal: Functions root and sqrt are now defined on negative real
1862 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
1863 Nonnegativity side conditions have been removed from many lemmas, so
1864 that more subgoals may now be solved by simplification; potential
1867 * Real: new type classes formalize real normed vector spaces and
1868 algebras, using new overloaded constants scaleR :: real => 'a => 'a
1869 and norm :: 'a => real.
1871 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
1872 reals into other types. The overloaded constant Reals :: 'a set is now
1873 defined as range of_real; potential INCOMPATIBILITY.
1875 * Real: proper support for ML code generation, including 'quickcheck'.
1876 Reals are implemented as arbitrary precision rationals.
1878 * Hyperreal: Several constants that previously worked only for the
1879 reals have been generalized, so they now work over arbitrary vector
1880 spaces. Type annotations may need to be added in some cases; potential
1883 Infinitesimal :: ('a::real_normed_vector) star set
1884 HFinite :: ('a::real_normed_vector) star set
1885 HInfinite :: ('a::real_normed_vector) star set
1886 approx :: ('a::real_normed_vector) star => 'a star => bool
1887 monad :: ('a::real_normed_vector) star => 'a star set
1888 galaxy :: ('a::real_normed_vector) star => 'a star set
1889 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
1890 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
1891 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
1892 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
1893 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
1894 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
1895 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
1896 sgn :: 'a::real_normed_vector => 'a
1897 exp :: 'a::{recpower,real_normed_field,banach} => 'a
1899 * Complex: Some complex-specific constants are now abbreviations for
1900 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
1901 hnorm. Other constants have been entirely removed in favor of the
1902 polymorphic versions (INCOMPATIBILITY):
1906 HInfinite <-- CInfinite
1907 Infinitesimal <-- CInfinitesimal
1910 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
1911 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
1912 (ns)deriv <-- (ns)cderiv
1917 * Formalisation of ideals and the quotient construction over rings.
1919 * Order and lattice theory no longer based on records.
1922 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
1923 greatest_closed. INCOMPATIBILITY.
1925 * Method algebra is now set up via an attribute. For examples see
1926 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
1927 of algebraic structures.
1929 * Renamed theory CRing to Ring.
1934 * Substantial, yet incomplete support for nominal datatypes (binding
1935 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
1936 src/HOL/Nominal/Examples. Prospective users should consult
1937 http://isabelle.in.tum.de/nominal/
1942 * ML basics: just one true type int, which coincides with IntInf.int
1945 * ML within Isar: antiquotations allow to embed statically-checked
1946 formal entities in the source, referring to the context available at
1947 compile-time. For example:
1949 ML {* @{sort "{zero,one}"} *}
1950 ML {* @{typ "'a => 'b"} *}
1951 ML {* @{term "%x. x"} *}
1952 ML {* @{prop "x == y"} *}
1953 ML {* @{ctyp "'a => 'b"} *}
1954 ML {* @{cterm "%x. x"} *}
1955 ML {* @{cprop "x == y"} *}
1956 ML {* @{thm asm_rl} *}
1957 ML {* @{thms asm_rl} *}
1958 ML {* @{type_name c} *}
1959 ML {* @{type_syntax c} *}
1960 ML {* @{const_name c} *}
1961 ML {* @{const_syntax c} *}
1964 ML {* @{theory Pure} *}
1965 ML {* @{theory_ref} *}
1966 ML {* @{theory_ref Pure} *}
1969 ML {* @{clasimpset} *}
1971 The same works for sources being ``used'' within an Isar context.
1973 * ML in Isar: improved error reporting; extra verbosity with
1974 ML_Context.trace enabled.
1976 * Pure/General/table.ML: the join operations now works via exceptions
1977 DUP/SAME instead of type option. This is simpler in simple cases, and
1978 admits slightly more efficient complex applications.
1980 * Pure: 'advanced' translation functions (parse_translation etc.) now
1981 use Context.generic instead of just theory.
1983 * Pure: datatype Context.generic joins theory/Proof.context and
1984 provides some facilities for code that works in either kind of
1985 context, notably GenericDataFun for uniform theory and proof data.
1987 * Pure: simplified internal attribute type, which is now always
1988 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
1989 local (Proof.context) attributes have been discontinued, while
1990 minimizing code duplication. Thm.rule_attribute and
1991 Thm.declaration_attribute build canonical attributes; see also structure
1992 Context for further operations on Context.generic, notably
1993 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
1994 declarations and definitions.
1996 * Context data interfaces (Theory/Proof/GenericDataFun): removed
1997 name/print, uninitialized data defaults to ad-hoc copy of empty value,
1998 init only required for impure data. INCOMPATIBILITY: empty really need
1999 to be empty (no dependencies on theory content!)
2001 * Pure/kernel: consts certification ignores sort constraints given in
2002 signature declarations. (This information is not relevant to the
2003 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
2004 potential INCOMPATIBILITY.
2006 * Pure: axiomatic type classes are now purely definitional, with
2007 explicit proofs of class axioms and super class relations performed
2008 internally. See Pure/axclass.ML for the main internal interfaces --
2009 notably AxClass.define_class supercedes AxClass.add_axclass, and
2010 AxClass.axiomatize_class/classrel/arity supersede
2011 Sign.add_classes/classrel/arities.
2013 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
2014 global/local versions on theory vs. Proof.context have been
2015 discontinued; Attrib.syntax and Method.syntax have been adapted
2016 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
2017 attributes, methods, etc.
2019 * Pure: several functions of signature "... -> theory -> theory * ..."
2020 have been reoriented to "... -> theory -> ... * theory" in order to
2021 allow natural usage in combination with the ||>, ||>>, |-> and
2022 fold_map combinators.
2024 * Pure: official theorem names (closed derivations) and additional
2025 comments (tags) are now strictly separate. Name hints -- which are
2026 maintained as tags -- may be attached any time without affecting the
2029 * Pure: primitive rule lift_rule now takes goal cterm instead of an
2030 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
2031 achieve the old behaviour.
2033 * Pure: the "Goal" constant is now called "prop", supporting a
2034 slightly more general idea of ``protecting'' meta-level rule
2037 * Pure: Logic.(un)varify only works in a global context, which is now
2038 enforced instead of silently assumed. INCOMPATIBILITY, may use
2039 Logic.legacy_(un)varify as temporary workaround.
2041 * Pure: structure Name provides scalable operations for generating
2042 internal variable names, notably Name.variants etc. This replaces
2043 some popular functions from term.ML:
2045 Term.variant -> Name.variant
2046 Term.variantlist -> Name.variant_list
2047 Term.invent_names -> Name.invent_list
2049 Note that low-level renaming rarely occurs in new code -- operations
2050 from structure Variable are used instead (see below).
2052 * Pure: structure Variable provides fundamental operations for proper
2053 treatment of fixed/schematic variables in a context. For example,
2054 Variable.import introduces fixes for schematics of given facts and
2055 Variable.export reverses the effect (up to renaming) -- this replaces
2056 various freeze_thaw operations.
2058 * Pure: structure Goal provides simple interfaces for
2059 init/conclude/finish and tactical prove operations (replacing former
2060 Tactic.prove). Goal.prove is the canonical way to prove results
2061 within a given context; Goal.prove_global is a degraded version for
2062 theory level goals, including a global Drule.standard. Note that
2063 OldGoals.prove_goalw_cterm has long been obsolete, since it is
2064 ill-behaved in a local proof context (e.g. with local fixes/assumes or
2065 in a locale context).
2067 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
2068 and type checking (Syntax.check_term etc.), with common combinations
2069 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
2070 which are considered legacy and await removal.
2072 * Pure/Syntax: generic interfaces for type unchecking
2073 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
2074 with common combinations (Syntax.pretty_term, Syntax.string_of_term
2075 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
2076 available for convenience, but refer to the very same operations using
2077 a mere theory instead of a full context.
2079 * Isar: simplified treatment of user-level errors, using exception
2080 ERROR of string uniformly. Function error now merely raises ERROR,
2081 without any side effect on output channels. The Isar toplevel takes
2082 care of proper display of ERROR exceptions. ML code may use plain
2083 handle/can/try; cat_error may be used to concatenate errors like this:
2085 ... handle ERROR msg => cat_error msg "..."
2087 Toplevel ML code (run directly or through the Isar toplevel) may be
2088 embedded into the Isar toplevel with exception display/debug like
2091 Isar.toplevel (fn () => ...)
2093 INCOMPATIBILITY, removed special transform_error facilities, removed
2094 obsolete variants of user-level exceptions (ERROR_MESSAGE,
2095 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
2096 -- use plain ERROR instead.
2098 * Isar: theory setup now has type (theory -> theory), instead of a
2099 list. INCOMPATIBILITY, may use #> to compose setup functions.
2101 * Isar: ML toplevel pretty printer for type Proof.context, subject to
2102 ProofContext.debug/verbose flags.
2104 * Isar: Toplevel.theory_to_proof admits transactions that modify the
2105 theory before entering a proof state. Transactions now always see a
2106 quasi-functional intermediate checkpoint, both in interactive and
2109 * Isar: simplified interfaces for outer syntax. Renamed
2110 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
2111 OuterSyntax.add_parsers -- this functionality is now included in
2112 OuterSyntax.command etc. INCOMPATIBILITY.
2114 * Simplifier: the simpset of a running simplification process now
2115 contains a proof context (cf. Simplifier.the_context), which is the
2116 very context that the initial simpset has been retrieved from (by
2117 simpset_of/local_simpset_of). Consequently, all plug-in components
2118 (solver, looper etc.) may depend on arbitrary proof data.
2120 * Simplifier.inherit_context inherits the proof context (plus the
2121 local bounds) of the current simplification process; any simproc
2122 etc. that calls the Simplifier recursively should do this! Removed
2123 former Simplifier.inherit_bounds, which is already included here --
2124 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
2125 specify an explicit context using Simplifier.context/theory_context.
2127 * Simplifier/Classical Reasoner: more abstract interfaces
2128 change_simpset/claset for modifying the simpset/claset reference of a
2129 theory; raw versions simpset/claset_ref etc. have been discontinued --
2132 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
2138 * settings: the default heap location within ISABELLE_HOME_USER now
2139 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
2140 Isabelle installations.
2142 * isabelle-process: option -S (secure mode) disables some critical
2143 operations, notably runtime compilation and evaluation of ML source
2146 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
2148 * Support for parallel execution, using native multicore support of
2149 Poly/ML 5.1. The theory loader exploits parallelism when processing
2150 independent theories, according to the given theory header
2151 specifications. The maximum number of worker threads is specified via
2152 usedir option -M or the "max-threads" setting in Proof General. A
2153 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
2154 to 6 on a 8-core machine. User-code needs to observe certain
2155 guidelines for thread-safe programming, see appendix A in the Isar
2156 Implementation manual.
2160 New in Isabelle2005 (October 2005)
2161 ----------------------------------
2165 * Theory headers: the new header syntax for Isar theories is
2168 imports <theory1> ... <theoryN>
2169 uses <file1> ... <fileM>
2172 where the 'uses' part is optional. The previous syntax
2174 theory <name> = <theory1> + ... + <theoryN>:
2176 will disappear in the next release. Use isatool fixheaders to convert
2177 existing theory files. Note that there is no change in ancient
2178 non-Isar theories now, but these will disappear soon.
2180 * Theory loader: parent theories can now also be referred to via
2181 relative and absolute paths.
2183 * Command 'find_theorems' searches for a list of criteria instead of a
2184 list of constants. Known criteria are: intro, elim, dest, name:string,
2185 simp:term, and any term. Criteria can be preceded by '-' to select
2186 theorems that do not match. Intro, elim, dest select theorems that
2187 match the current goal, name:s selects theorems whose fully qualified
2188 name contain s, and simp:term selects all simplification rules whose
2189 lhs match term. Any other term is interpreted as pattern and selects
2190 all theorems matching the pattern. Available in ProofGeneral under
2191 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
2193 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
2195 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
2196 matching the current goal as introduction rule and not having "HOL."
2197 in their name (i.e. not being defined in theory HOL).
2199 * Command 'thms_containing' has been discontinued in favour of
2200 'find_theorems'; INCOMPATIBILITY.
2202 * Communication with Proof General is now 8bit clean, which means that
2203 Unicode text in UTF-8 encoding may be used within theory texts (both
2204 formal and informal parts). Cf. option -U of the Isabelle Proof
2205 General interface. Here are some simple examples (cf. src/HOL/ex):
2207 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
2208 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
2210 * Improved efficiency of the Simplifier and, to a lesser degree, the
2211 Classical Reasoner. Typical big applications run around 2 times
2215 *** Document preparation ***
2217 * Commands 'display_drafts' and 'print_drafts' perform simple output
2218 of raw sources. Only those symbols that do not require additional
2219 LaTeX packages (depending on comments in isabellesym.sty) are
2220 displayed properly, everything else is left verbatim. isatool display
2221 and isatool print are used as front ends (these are subject to the
2222 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
2224 * Command tags control specific markup of certain regions of text,
2225 notably folding and hiding. Predefined tags include "theory" (for
2226 theory begin and end), "proof" for proof commands, and "ML" for
2227 commands involving ML code; the additional tags "visible" and
2228 "invisible" are unused by default. Users may give explicit tag
2229 specifications in the text, e.g. ''by %invisible (auto)''. The
2230 interpretation of tags is determined by the LaTeX job during document
2231 preparation: see option -V of isatool usedir, or options -n and -t of
2232 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
2235 Several document versions may be produced at the same time via isatool
2236 usedir (the generated index.html will link all of them). Typical
2237 specifications include ''-V document=theory,proof,ML'' to present
2238 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
2239 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
2240 these parts without any formal replacement text. The Isabelle site
2241 default settings produce ''document'' and ''outline'' versions as
2244 * Several new antiquotations:
2246 @{term_type term} prints a term with its type annotated;
2248 @{typeof term} prints the type of a term;
2250 @{const const} is the same as @{term const}, but checks that the
2251 argument is a known logical constant;
2253 @{term_style style term} and @{thm_style style thm} print a term or
2254 theorem applying a "style" to it
2258 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
2259 definitions, equations, inequations etc., 'concl' printing only the
2260 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
2261 to print the specified premise. TermStyle.add_style provides an ML
2262 interface for introducing further styles. See also the "LaTeX Sugar"
2263 document practical applications. The ML antiquotation prints
2264 type-checked ML expressions verbatim.
2266 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
2267 and 'text' support optional locale specification '(in loc)', which
2268 specifies the default context for interpreting antiquotations. For
2269 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
2271 * Option 'locale=NAME' of antiquotations specifies an alternative
2272 context interpreting the subsequent argument. For example: @{thm
2273 [locale=lattice] inf_assoc}.
2275 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
2278 * Proper output of antiquotations for theory commands involving a
2279 proof context (such as 'locale' or 'theorem (in loc) ...').
2281 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
2282 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
2284 * isatool usedir: new option -C (default true) controls whether option
2285 -D should include a copy of the original document directory; -C false
2286 prevents unwanted effects such as copying of administrative CVS data.
2291 * Considerably improved version of 'constdefs' command. Now performs
2292 automatic type-inference of declared constants; additional support for
2293 local structure declarations (cf. locales and HOL records), see also
2294 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
2295 sequential dependencies of definitions within a single 'constdefs'
2296 section; moreover, the declared name needs to be an identifier. If
2297 all fails, consider to fall back on 'consts' and 'defs' separately.
2299 * Improved indexed syntax and implicit structures. First of all,
2300 indexed syntax provides a notational device for subscripted
2301 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
2302 expressions. Secondly, in a local context with structure
2303 declarations, number indexes \<^sub>n or the empty index (default
2304 number 1) refer to a certain fixed variable implicitly; option
2305 show_structs controls printing of implicit structures. Typical
2306 applications of these concepts involve record types and locales.
2308 * New command 'no_syntax' removes grammar declarations (and
2309 translations) resulting from the given syntax specification, which is
2310 interpreted in the same manner as for the 'syntax' command.
2312 * 'Advanced' translation functions (parse_translation etc.) may depend
2313 on the signature of the theory context being presently used for
2314 parsing/printing, see also isar-ref manual.
2316 * Improved 'oracle' command provides a type-safe interface to turn an
2317 ML expression of type theory -> T -> term into a primitive rule of
2318 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
2319 is already included here); see also FOL/ex/IffExample.thy;
2322 * axclass: name space prefix for class "c" is now "c_class" (was "c"
2323 before); "cI" is no longer bound, use "c.intro" instead.
2324 INCOMPATIBILITY. This change avoids clashes of fact bindings for
2325 axclasses vs. locales.
2327 * Improved internal renaming of symbolic identifiers -- attach primes
2328 instead of base 26 numbers.
2330 * New flag show_question_marks controls printing of leading question
2331 marks in schematic variable names.
2333 * In schematic variable names, *any* symbol following \<^isub> or
2334 \<^isup> is now treated as part of the base name. For example, the
2335 following works without printing of awkward ".0" indexes:
2337 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
2340 * Inner syntax includes (*(*nested*) comments*).
2342 * Pretty printer now supports unbreakable blocks, specified in mixfix
2343 annotations as "(00...)".
2345 * Clear separation of logical types and nonterminals, where the latter
2346 may only occur in 'syntax' specifications or type abbreviations.
2347 Before that distinction was only partially implemented via type class
2348 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
2349 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
2350 exotic syntax specifications may require further adaption
2351 (e.g. Cube/Cube.thy).
2353 * Removed obsolete type class "logic", use the top sort {} instead.
2354 Note that non-logical types should be declared as 'nonterminals'
2355 rather than 'types'. INCOMPATIBILITY for new object-logic
2358 * Attributes 'induct' and 'cases': type or set names may now be
2359 locally fixed variables as well.
2361 * Simplifier: can now control the depth to which conditional rewriting
2362 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
2365 * Simplifier: simplification procedures may now take the current
2366 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
2367 interface), which is very useful for calling the Simplifier
2368 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
2369 is gone -- use prems_of_ss on the simpset instead. Moreover, the
2370 low-level mk_simproc no longer applies Logic.varify internally, to
2371 allow for use in a context of fixed variables.
2373 * thin_tac now works even if the assumption being deleted contains !!
2374 or ==>. More generally, erule now works even if the major premise of
2375 the elimination rule contains !! or ==>.
2377 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
2379 * Reorganized bootstrapping of the Pure theories; CPure is now derived
2380 from Pure, which contains all common declarations already. Both
2381 theories are defined via plain Isabelle/Isar .thy files.
2382 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
2383 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
2384 use isatool fixcpure to adapt your theory and ML sources.
2386 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
2387 selections of theorems in named facts via index ranges.
2389 * 'print_theorems': in theory mode, really print the difference
2390 wrt. the last state (works for interactive theory development only),
2391 in proof mode print all local facts (cf. 'print_facts');
2393 * 'hide': option '(open)' hides only base names.
2395 * More efficient treatment of intermediate checkpoints in interactive
2398 * Code generator is now invoked via code_module (incremental code
2399 generation) and code_library (modular code generation, ML structures
2400 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
2401 must be quoted when used as identifiers.
2403 * New 'value' command for reading, evaluating and printing terms using
2404 the code generator. INCOMPATIBILITY: command keyword 'value' must be
2405 quoted when used as identifier.
2410 * New commands for the interpretation of locale expressions in
2411 theories (1), locales (2) and proof contexts (3). These generate
2412 proof obligations from the expression specification. After the
2413 obligations have been discharged, theorems of the expression are added
2414 to the theory, target locale or proof context. The synopsis of the
2415 commands is a follows:
2417 (1) interpretation expr inst
2418 (2) interpretation target < expr
2419 (3) interpret expr inst
2421 Interpretation in theories and proof contexts require a parameter
2422 instantiation of terms from the current context. This is applied to
2423 specifications and theorems of the interpreted expression.
2424 Interpretation in locales only permits parameter renaming through the
2425 locale expression. Interpretation is smart in that interpretations
2426 that are active already do not occur in proof obligations, neither are
2427 instantiated theorems stored in duplicate. Use 'print_interps' to
2428 inspect active interpretations of a particular locale. For details,
2429 see the Isar Reference manual. Examples can be found in
2430 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
2432 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
2433 'interpret' instead.
2435 * New context element 'constrains' for adding type constraints to
2438 * Context expressions: renaming of parameters with syntax
2441 * Locale declaration: 'includes' disallowed.
2443 * Proper static binding of attribute syntax -- i.e. types / terms /
2444 facts mentioned as arguments are always those of the locale definition
2445 context, independently of the context of later invocations. Moreover,
2446 locale operations (renaming and type / term instantiation) are applied
2447 to attribute arguments as expected.
2449 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
2450 actual attributes; rare situations may require Attrib.attribute to
2451 embed those attributes into Attrib.src that lack concrete syntax.
2452 Attribute implementations need to cooperate properly with the static
2453 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
2454 Attrib.XXX_thm etc. already do the right thing without further
2455 intervention. Only unusual applications -- such as "where" or "of"
2456 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
2457 on the context and the facts involved -- may have to assign parsed
2458 values to argument tokens explicitly.
2460 * Changed parameter management in theorem generation for long goal
2461 statements with 'includes'. INCOMPATIBILITY: produces a different
2462 theorem statement in rare situations.
2464 * Locale inspection command 'print_locale' omits notes elements. Use
2465 'print_locale!' to have them included in the output.
2470 * Provers/hypsubst.ML: improved version of the subst method, for
2471 single-step rewriting: it now works in bound variable contexts. New is
2472 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
2473 rewrite a different subterm than the original subst method, which is
2474 still available as 'simplesubst'.
2476 * Provers/quasi.ML: new transitivity reasoners for transitivity only
2479 * Provers/trancl.ML: new transitivity reasoner for transitive and
2480 reflexive-transitive closure of relations.
2482 * Provers/blast.ML: new reference depth_limit to make blast's depth
2483 limit (previously hard-coded with a value of 20) user-definable.
2485 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
2486 is peformed already. Object-logics merely need to finish their
2487 initial simpset configuration as before. INCOMPATIBILITY.
2492 * Symbolic syntax of Hilbert Choice Operator is now as follows:
2495 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
2497 The symbol \<some> is displayed as the alternative epsilon of LaTeX
2498 and x-symbol; use option '-m epsilon' to get it actually printed.
2499 Moreover, the mathematically important symbolic identifier \<epsilon>
2500 becomes available as variable, constant etc. INCOMPATIBILITY,
2502 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
2503 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
2504 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
2505 support corresponding Isar calculations.
2507 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
2510 * theory SetInterval: changed the syntax for open intervals:
2519 The old syntax is still supported but will disappear in the next
2520 release. For conversion use the following Emacs search and replace
2521 patterns (these are not perfect but work quite well):
2523 {)\([^\.]*\)\.\. -> {\1<\.\.}
2524 \.\.\([^(}]*\)(} -> \.\.<\1}
2526 * Theory Commutative_Ring (in Library): method comm_ring for proving
2527 equalities in commutative rings; method 'algebra' provides a generic
2530 * Theory Finite_Set: changed the syntax for 'setsum', summation over
2531 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
2532 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
2535 Some new syntax forms are available:
2537 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
2538 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
2539 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
2540 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
2542 The latter form "\<Sum>x < k. e" used to be based on a separate
2543 function "Summation", which has been discontinued.
2545 * theory Finite_Set: in structured induction proofs, the insert case
2546 is now 'case (insert x F)' instead of the old counterintuitive 'case
2549 * The 'refute' command has been extended to support a much larger
2550 fragment of HOL, including axiomatic type classes, constdefs and
2551 typedefs, inductive datatypes and recursion.
2553 * New tactics 'sat' and 'satx' to prove propositional tautologies.
2554 Requires zChaff with proof generation to be installed. See
2555 HOL/ex/SAT_Examples.thy for examples.
2557 * Datatype induction via method 'induct' now preserves the name of the
2558 induction variable. For example, when proving P(xs::'a list) by
2559 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
2560 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
2561 in unstructured proof scripts.
2563 * Reworked implementation of records. Improved scalability for
2564 records with many fields, avoiding performance problems for type
2565 inference. Records are no longer composed of nested field types, but
2566 of nested extension types. Therefore the record type only grows linear
2567 in the number of extensions and not in the number of fields. The
2568 top-level (users) view on records is preserved. Potential
2569 INCOMPATIBILITY only in strange cases, where the theory depends on the
2570 old record representation. The type generated for a record is called
2571 <record_name>_ext_type.
2573 Flag record_quick_and_dirty_sensitive can be enabled to skip the
2574 proofs triggered by a record definition or a simproc (if
2575 quick_and_dirty is enabled). Definitions of large records can take
2578 New simproc record_upd_simproc for simplification of multiple record
2579 updates enabled by default. Moreover, trivial updates are also
2580 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
2581 occasionally, since simplification is more powerful by default.
2583 * typedef: proper support for polymorphic sets, which contain extra
2584 type-variables in the term.
2586 * Simplifier: automatically reasons about transitivity chains
2587 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
2588 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
2589 old proofs break occasionally as simplification may now solve more
2590 goals than previously.
2592 * Simplifier: converts x <= y into x = y if assumption y <= x is
2593 present. Works for all partial orders (class "order"), in particular
2594 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
2597 * Simplifier: new simproc for "let x = a in f x". If a is a free or
2598 bound variable or a constant then the let is unfolded. Otherwise
2599 first a is simplified to b, and then f b is simplified to g. If
2600 possible we abstract b from g arriving at "let x = b in h x",
2601 otherwise we unfold the let and arrive at g. The simproc can be
2602 enabled/disabled by the reference use_let_simproc. Potential
2603 INCOMPATIBILITY since simplification is more powerful by default.
2605 * Classical reasoning: the meson method now accepts theorems as arguments.
2607 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
2608 jobs to provide advice on the provability of subgoals.
2610 * Theory OrderedGroup and Ring_and_Field: various additions and
2611 improvements to faciliate calculations involving equalities and
2614 The following theorems have been eliminated or modified
2617 abs_eq now named abs_of_nonneg
2618 abs_of_ge_0 now named abs_of_nonneg
2619 abs_minus_eq now named abs_of_nonpos
2620 imp_abs_id now named abs_of_nonneg
2621 imp_abs_neg_id now named abs_of_nonpos
2622 mult_pos now named mult_pos_pos
2623 mult_pos_le now named mult_nonneg_nonneg
2624 mult_pos_neg_le now named mult_nonneg_nonpos
2625 mult_pos_neg2_le now named mult_nonneg_nonpos2
2626 mult_neg now named mult_neg_neg
2627 mult_neg_le now named mult_nonpos_nonpos
2629 * The following lemmas in Ring_and_Field have been added to the simplifier:
2632 not_square_less_zero
2634 The following lemmas have been deleted from Real/RealPow:
2644 * Theory Parity: added rules for simplifying exponents.
2648 The following theorems have been eliminated or modified
2651 list_all_Nil now named list_all.simps(1)
2652 list_all_Cons now named list_all.simps(2)
2653 list_all_conv now named list_all_iff
2654 set_mem_eq now named mem_iff
2656 * Theories SetsAndFunctions and BigO (see HOL/Library) support
2657 asymptotic "big O" calculations. See the notes in BigO.thy.
2662 * Theory RealDef: better support for embedding natural numbers and
2663 integers in the reals.
2665 The following theorems have been eliminated or modified
2668 exp_ge_add_one_self now requires no hypotheses
2669 real_of_int_add reversed direction of equality (use [symmetric])
2670 real_of_int_minus reversed direction of equality (use [symmetric])
2671 real_of_int_diff reversed direction of equality (use [symmetric])
2672 real_of_int_mult reversed direction of equality (use [symmetric])
2674 * Theory RComplete: expanded support for floor and ceiling functions.
2676 * Theory Ln is new, with properties of the natural logarithm
2678 * Hyperreal: There is a new type constructor "star" for making
2679 nonstandard types. The old type names are now type synonyms:
2683 hcomplex = complex star
2685 * Hyperreal: Many groups of similarly-defined constants have been
2686 replaced by polymorphic versions (INCOMPATIBILITY):
2688 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
2690 starset <-- starsetNat, starsetC
2691 *s* <-- *sNat*, *sc*
2692 starset_n <-- starsetNat_n, starsetC_n
2693 *sn* <-- *sNatn*, *scn*
2694 InternalSets <-- InternalNatSets, InternalCSets
2696 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2697 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
2698 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
2699 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
2700 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
2702 * Hyperreal: Many type-specific theorems have been removed in favor of
2703 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
2705 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
2706 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
2707 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
2708 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
2709 right_minus <-- hypreal_add_minus
2710 left_minus <-- {hypreal,hcomplex}_add_minus_left
2711 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
2712 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
2713 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
2714 mult_1_right <-- hcomplex_mult_one_right
2715 mult_zero_left <-- hcomplex_mult_zero_left
2716 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
2717 right_distrib <-- hypnat_add_mult_distrib2
2718 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
2719 right_inverse <-- hypreal_mult_inverse
2720 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
2721 order_refl <-- {hypreal,hypnat}_le_refl
2722 order_trans <-- {hypreal,hypnat}_le_trans
2723 order_antisym <-- {hypreal,hypnat}_le_anti_sym
2724 order_less_le <-- {hypreal,hypnat}_less_le
2725 linorder_linear <-- {hypreal,hypnat}_le_linear
2726 add_left_mono <-- {hypreal,hypnat}_add_left_mono
2727 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
2728 add_nonneg_nonneg <-- hypreal_le_add_order
2730 * Hyperreal: Separate theorems having to do with type-specific
2731 versions of constants have been merged into theorems that apply to the
2732 new polymorphic constants (INCOMPATIBILITY):
2734 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
2735 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
2736 STAR_Un <-- {STAR,NatStar,STARC}_Un
2737 STAR_Int <-- {STAR,NatStar,STARC}_Int
2738 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
2739 STAR_subset <-- {STAR,NatStar,STARC}_subset
2740 STAR_mem <-- {STAR,NatStar,STARC}_mem
2741 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
2742 STAR_diff <-- {STAR,STARC}_diff
2743 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
2744 STARC_hcomplex_of_complex}_image_subset
2745 starset_n_Un <-- starset{Nat,C}_n_Un
2746 starset_n_Int <-- starset{Nat,C}_n_Int
2747 starset_n_Compl <-- starset{Nat,C}_n_Compl
2748 starset_n_diff <-- starset{Nat,C}_n_diff
2749 InternalSets_Un <-- Internal{Nat,C}Sets_Un
2750 InternalSets_Int <-- Internal{Nat,C}Sets_Int
2751 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
2752 InternalSets_diff <-- Internal{Nat,C}Sets_diff
2753 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
2754 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
2755 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
2756 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
2757 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
2758 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2759 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
2760 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
2761 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
2762 starfun_diff <-- starfun{C,RC,CR}_diff
2763 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
2764 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
2765 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
2766 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
2767 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
2768 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
2769 starfun_Id <-- starfunC_Id
2770 starfun_approx <-- starfun{Nat,CR}_approx
2771 starfun_capprox <-- starfun{C,RC}_capprox
2772 starfun_abs <-- starfunNat_rabs
2773 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
2774 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
2775 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
2776 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
2777 starfun_add_capprox <-- starfun{C,RC}_add_capprox
2778 starfun_add_approx <-- starfunCR_add_approx
2779 starfun_inverse_inverse <-- starfunC_inverse_inverse
2780 starfun_divide <-- starfun{C,CR,RC}_divide
2781 starfun_n <-- starfun{Nat,C}_n
2782 starfun_n_mult <-- starfun{Nat,C}_n_mult
2783 starfun_n_add <-- starfun{Nat,C}_n_add
2784 starfun_n_add_minus <-- starfunNat_n_add_minus
2785 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
2786 starfun_n_minus <-- starfun{Nat,C}_n_minus
2787 starfun_n_eq <-- starfun{Nat,C}_n_eq
2789 star_n_add <-- {hypreal,hypnat,hcomplex}_add
2790 star_n_minus <-- {hypreal,hcomplex}_minus
2791 star_n_diff <-- {hypreal,hcomplex}_diff
2792 star_n_mult <-- {hypreal,hcomplex}_mult
2793 star_n_inverse <-- {hypreal,hcomplex}_inverse
2794 star_n_le <-- {hypreal,hypnat}_le
2795 star_n_less <-- {hypreal,hypnat}_less
2796 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
2797 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
2798 star_n_abs <-- hypreal_hrabs
2799 star_n_divide <-- hcomplex_divide
2801 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
2802 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
2803 star_of_diff <-- hypreal_of_real_diff
2804 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
2805 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
2806 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
2807 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
2808 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
2809 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
2810 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
2811 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
2812 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
2813 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
2814 star_of_number_of <-- {hypreal,hcomplex}_number_of
2815 star_of_number_less <-- number_of_less_hypreal_of_real_iff
2816 star_of_number_le <-- number_of_le_hypreal_of_real_iff
2817 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
2818 star_of_less_number <-- hypreal_of_real_less_number_of_iff
2819 star_of_le_number <-- hypreal_of_real_le_number_of_iff
2820 star_of_power <-- hypreal_of_real_power
2821 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
2823 * Hyperreal: new method "transfer" that implements the transfer
2824 principle of nonstandard analysis. With a subgoal that mentions
2825 nonstandard types like "'a star", the command "apply transfer"
2826 replaces it with an equivalent one that mentions only standard types.
2827 To be successful, all free variables must have standard types; non-
2828 standard variables must have explicit universal quantifiers.
2830 * Hyperreal: A theory of Taylor series.
2835 * Discontinued special version of 'constdefs' (which used to support
2836 continuous functions) in favor of the general Pure one with full
2839 * New simplification procedure for solving continuity conditions; it
2840 is much faster on terms with many nested lambda abstractions (cubic
2841 instead of exponential time).
2843 * New syntax for domain package: selector names are now optional.
2844 Parentheses should be omitted unless argument is lazy, for example:
2846 domain 'a stream = cons "'a" (lazy "'a stream")
2848 * New command 'fixrec' for defining recursive functions with pattern
2849 matching; defining multiple functions with mutual recursion is also
2850 supported. Patterns may include the constants cpair, spair, up, sinl,
2851 sinr, or any data constructor defined by the domain package. The given
2852 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
2853 syntax and examples.
2855 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
2856 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
2857 but the proof obligation additionally includes an admissibility
2858 requirement. The packages generate instances of class cpo or pcpo,
2859 with continuity and strictness theorems for Rep and Abs.
2861 * HOLCF: Many theorems have been renamed according to a more standard naming
2862 scheme (INCOMPATIBILITY):
2864 foo_inject: "foo$x = foo$y ==> x = y"
2865 foo_eq: "(foo$x = foo$y) = (x = y)"
2866 foo_less: "(foo$x << foo$y) = (x << y)"
2867 foo_strict: "foo$UU = UU"
2868 foo_defined: "... ==> foo$x ~= UU"
2869 foo_defined_iff: "(foo$x = UU) = (x = UU)"
2874 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
2875 including the First Isomorphism Theorem (on quotienting by the kernel
2878 * ZF/Simplifier: install second copy of type solver that actually
2879 makes use of TC rules declared to Isar proof contexts (or locales);
2880 the old version is still required for ML proof scripts.
2885 * Converted to Isar theory format; use locales instead of axiomatic
2891 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
2894 * Pure/library.ML no longer defines its own option datatype, but uses
2895 that of the SML basis, which has constructors NONE and SOME instead of
2896 None and Some, as well as exception Option.Option instead of OPTION.
2897 The functions the, if_none, is_some, is_none have been adapted
2898 accordingly, while Option.map replaces apsome.
2900 * Pure/library.ML: the exception LIST has been given up in favour of
2901 the standard exceptions Empty and Subscript, as well as
2902 Library.UnequalLengths. Function like Library.hd and Library.tl are
2903 superceded by the standard hd and tl functions etc.
2905 A number of basic list functions are no longer exported to the ML
2906 toplevel, as they are variants of predefined functions. The following
2907 suggests how one can translate existing code:
2909 rev_append xs ys = List.revAppend (xs, ys)
2910 nth_elem (i, xs) = List.nth (xs, i)
2911 last_elem xs = List.last xs
2912 flat xss = List.concat xss
2913 seq fs = List.app fs
2914 partition P xs = List.partition P xs
2915 mapfilter f xs = List.mapPartial f xs
2917 * Pure/library.ML: several combinators for linear functional
2918 transformations, notably reverse application and composition:
2921 (x, y) |-> f f #-> g
2923 * Pure/library.ML: introduced/changed precedence of infix operators:
2925 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
2927 infix 3 o oo ooo oooo;
2928 infix 4 ~~ upto downto;
2930 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
2933 * Pure/library.ML: natural list combinators fold, fold_rev, and
2934 fold_map support linear functional transformations and nesting. For
2937 fold f [x1, ..., xN] y =
2938 y |> f x1 |> ... |> f xN
2940 (fold o fold) f [xs1, ..., xsN] y =
2941 y |> fold f xs1 |> ... |> fold f xsN
2943 fold f [x1, ..., xN] =
2946 (fold o fold) f [xs1, ..., xsN] =
2947 fold f xs1 #> ... #> fold f xsN
2949 * Pure/library.ML: the following selectors on type 'a option are
2952 the: 'a option -> 'a (*partial*)
2953 these: 'a option -> 'a where 'a = 'b list
2954 the_default: 'a -> 'a option -> 'a
2955 the_list: 'a option -> 'a list
2957 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2958 basic operations for association lists, following natural argument
2959 order; moreover the explicit equality predicate passed here avoids
2960 potentially expensive polymorphic runtime equality checks.
2961 The old functions may be expressed as follows:
2963 assoc = uncurry (AList.lookup (op =))
2964 assocs = these oo AList.lookup (op =)
2965 overwrite = uncurry (AList.update (op =)) o swap
2967 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2969 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
2970 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
2972 replacing make_keylist and keyfilter (occassionally used)
2975 make_keylist = AList.make
2976 keyfilter = AList.find (op =)
2978 * eq_fst and eq_snd now take explicit equality parameter, thus
2979 avoiding eqtypes. Naive rewrites:
2981 eq_fst = eq_fst (op =)
2982 eq_snd = eq_snd (op =)
2984 * Removed deprecated apl and apr (rarely used).
2987 apl (n, op) =>>= curry op n
2988 apr (op, m) =>>= fn n => op (n, m)
2990 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
2991 provides a reasonably efficient light-weight implementation of sets as
2994 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
2995 few new operations; existing lookup and update are now curried to
2996 follow natural argument order (for use with fold etc.);
2997 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
2999 * Pure/General: output via the Isabelle channels of
3000 writeln/warning/error etc. is now passed through Output.output, with a
3001 hook for arbitrary transformations depending on the print_mode
3002 (cf. Output.add_mode -- the first active mode that provides a output
3003 function wins). Already formatted output may be embedded into further
3004 text via Output.raw; the result of Pretty.string_of/str_of and derived
3005 functions (string_of_term/cterm/thm etc.) is already marked raw to
3006 accommodate easy composition of diagnostic messages etc. Programmers
3007 rarely need to care about Output.output or Output.raw at all, with
3008 some notable exceptions: Output.output is required when bypassing the
3009 standard channels (writeln etc.), or in token translations to produce
3010 properly formatted results; Output.raw is required when capturing
3011 already output material that will eventually be presented to the user
3012 a second time. For the default print mode, both Output.output and
3013 Output.raw have no effect.
3015 * Pure/General: Output.time_accumulator NAME creates an operator ('a
3016 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
3017 cumulative results are displayed at the end of a batch session.
3019 * Pure/General: File.sysify_path and File.quote_sysify path have been
3020 replaced by File.platform_path and File.shell_path (with appropriate
3021 hooks). This provides a clean interface for unusual systems where the
3022 internal and external process view of file names are different.
3024 * Pure: more efficient orders for basic syntactic entities: added
3025 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
3026 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
3027 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
3028 orders now -- potential INCOMPATIBILITY for code that depends on a
3029 particular order for Symtab.keys, Symtab.dest, etc. (consider using
3030 Library.sort_strings on result).
3032 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
3033 fold_types traverse types/terms from left to right, observing natural
3034 argument order. Supercedes previous foldl_XXX versions, add_frees,
3035 add_vars etc. have been adapted as well: INCOMPATIBILITY.
3037 * Pure: name spaces have been refined, with significant changes of the
3038 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
3039 to extern(_table). The plain name entry path is superceded by a
3040 general 'naming' context, which also includes the 'policy' to produce
3041 a fully qualified name and external accesses of a fully qualified
3042 name; NameSpace.extend is superceded by context dependent
3043 Sign.declare_name. Several theory and proof context operations modify
3044 the naming context. Especially note Theory.restore_naming and
3045 ProofContext.restore_naming to get back to a sane state; note that
3046 Theory.add_path is no longer sufficient to recover from
3047 Theory.absolute_path in particular.
3049 * Pure: new flags short_names (default false) and unique_names
3050 (default true) for controlling output of qualified names. If
3051 short_names is set, names are printed unqualified. If unique_names is
3052 reset, the name prefix is reduced to the minimum required to achieve
3053 the original result when interning again, even if there is an overlap
3054 with earlier declarations.
3056 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
3057 now 'extend', and 'merge' gets an additional Pretty.pp argument
3058 (useful for printing error messages). INCOMPATIBILITY.
3060 * Pure: major reorganization of the theory context. Type Sign.sg and
3061 Theory.theory are now identified, referring to the universal
3062 Context.theory (see Pure/context.ML). Actual signature and theory
3063 content is managed as theory data. The old code and interfaces were
3064 spread over many files and structures; the new arrangement introduces
3065 considerable INCOMPATIBILITY to gain more clarity:
3067 Context -- theory management operations (name, identity, inclusion,
3068 parents, ancestors, merge, etc.), plus generic theory data;
3070 Sign -- logical signature and syntax operations (declaring consts,
3071 types, etc.), plus certify/read for common entities;
3073 Theory -- logical theory operations (stating axioms, definitions,
3074 oracles), plus a copy of logical signature operations (consts,
3075 types, etc.); also a few basic management operations (Theory.copy,
3078 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
3079 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
3080 for convenience -- they merely return the theory.
3082 * Pure: type Type.tsig is superceded by theory in most interfaces.
3084 * Pure: the Isar proof context type is already defined early in Pure
3085 as Context.proof (note that ProofContext.context and Proof.context are
3086 aliases, where the latter is the preferred name). This enables other
3087 Isabelle components to refer to that type even before Isar is present.
3089 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
3090 typeK, constK, axiomK, oracleK), but provide explicit operations for
3091 any of these kinds. For example, Sign.intern typeK is now
3092 Sign.intern_type, Theory.hide_space Sign.typeK is now
3093 Theory.hide_types. Also note that former
3094 Theory.hide_classes/types/consts are now
3095 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
3096 internalize their arguments! INCOMPATIBILITY.
3098 * Pure: get_thm interface (of PureThy and ProofContext) expects
3099 datatype thmref (with constructors Name and NameSelection) instead of
3100 plain string -- INCOMPATIBILITY;
3102 * Pure: cases produced by proof methods specify options, where NONE
3103 means to remove case bindings -- INCOMPATIBILITY in
3106 * Pure: the following operations retrieve axioms or theorems from a
3107 theory node or theory hierarchy, respectively:
3109 Theory.axioms_of: theory -> (string * term) list
3110 Theory.all_axioms_of: theory -> (string * term) list
3111 PureThy.thms_of: theory -> (string * thm) list
3112 PureThy.all_thms_of: theory -> (string * thm) list
3114 * Pure: print_tac now outputs the goal through the trace channel.
3116 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
3117 Reference Toplevel.debug (default false) controls detailed printing
3118 and tracing of low-level exceptions; Toplevel.profiling (default 0)
3119 controls execution profiling -- set to 1 for time and 2 for space
3120 (both increase the runtime).
3122 * Isar session: The initial use of ROOT.ML is now always timed,
3123 i.e. the log will show the actual process times, in contrast to the
3124 elapsed wall-clock time that the outer shell wrapper produces.
3126 * Simplifier: improved handling of bound variables (nameless
3127 representation, avoid allocating new strings). Simprocs that invoke
3128 the Simplifier recursively should use Simplifier.inherit_bounds to
3129 avoid local name clashes. Failure to do so produces warnings
3130 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
3131 for further details.
3133 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
3134 bindings for all theorems stored within a given theory; this may help
3135 in porting non-Isar theories to Isar ones, while keeping ML proof
3136 scripts for the time being.
3138 * ML operator HTML.with_charset specifies the charset begin used for
3139 generated HTML files. For example:
3141 HTML.with_charset "utf-8" use_thy "Hebrew";
3142 HTML.with_charset "utf-8" use_thy "Chinese";
3147 * Allow symlinks to all proper Isabelle executables (Isabelle,
3148 isabelle, isatool etc.).
3150 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
3151 isatool doc, isatool mkdir, display_drafts etc.).
3153 * isatool usedir: option -f allows specification of the ML file to be
3154 used by Isabelle; default is ROOT.ML.
3156 * New isatool version outputs the version identifier of the Isabelle
3157 distribution being used.
3159 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
3160 (containing Boolean satisfiability problems) into Isabelle/HOL
3165 New in Isabelle2004 (April 2004)
3166 --------------------------------
3170 * Provers/order.ML: new efficient reasoner for partial and linear orders.
3171 Replaces linorder.ML.
3173 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
3174 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
3175 (\<a>...\<z>), are now considered normal letters, and can therefore
3176 be used anywhere where an ASCII letter (a...zA...Z) has until
3177 now. COMPATIBILITY: This obviously changes the parsing of some
3178 terms, especially where a symbol has been used as a binder, say
3179 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
3180 as an identifier. Fix it by inserting a space around former
3181 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
3182 existing theory and ML files.
3184 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
3186 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
3187 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
3188 a normal (but invisible) letter. For multiple letter subscripts repeat
3189 \<^isub> like this: x\<^isub>1\<^isub>2.
3191 * Pure: There are now sub-/superscripts that can span more than one
3192 character. Text between \<^bsub> and \<^esub> is set in subscript in
3193 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
3194 superscript. The new control characters are not identifier parts.
3196 * Pure: Control-symbols of the form \<^raw:...> will literally print the
3197 content of "..." to the latex file instead of \isacntrl... . The "..."
3198 may consist of any printable characters excluding the end bracket >.
3200 * Pure: Using new Isar command "finalconsts" (or the ML functions
3201 Theory.add_finals or Theory.add_finals_i) it is now possible to
3202 declare constants "final", which prevents their being given a definition
3203 later. It is useful for constants whose behaviour is fixed axiomatically
3204 rather than definitionally, such as the meta-logic connectives.
3206 * Pure: 'instance' now handles general arities with general sorts
3207 (i.e. intersections of classes),
3209 * Presentation: generated HTML now uses a CSS style sheet to make layout
3210 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
3211 It can be changed to alter the colors/layout of generated pages.
3216 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
3217 cut_tac, subgoal_tac and thin_tac:
3218 - Now understand static (Isar) contexts. As a consequence, users of Isar
3219 locales are no longer forced to write Isar proof scripts.
3220 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
3222 - INCOMPATIBILITY: names of variables to be instantiated may no
3223 longer be enclosed in quotes. Instead, precede variable name with `?'.
3224 This is consistent with the instantiation attribute "where".
3226 * Attributes "where" and "of":
3227 - Now take type variables of instantiated theorem into account when reading
3228 the instantiation string. This fixes a bug that caused instantiated
3229 theorems to have too special types in some circumstances.
3230 - "where" permits explicit instantiations of type variables.
3232 * Calculation commands "moreover" and "also" no longer interfere with
3233 current facts ("this"), admitting arbitrary combinations with "then"
3237 - Goal statements involving the context element "includes" no longer
3238 generate theorems with internal delta predicates (those ending on
3239 "_axioms") in the premise.
3240 Resolve particular premise with <locale>.intro to obtain old form.
3241 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
3242 specification and "includes" elements in goal statement.
3243 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
3244 [intro?] and [elim?] (respectively) by default.
3245 - Experimental command for instantiation of locales in proof contexts:
3246 instantiate <label>[<attrs>]: <loc>
3247 Instantiates locale <loc> and adds all its theorems to the current context
3248 taking into account their attributes. Label and attrs are optional
3249 modifiers, like in theorem declarations. If present, names of
3250 instantiated theorems are qualified with <label>, and the attributes
3251 <attrs> are applied after any attributes these theorems might have already.
3252 If the locale has assumptions, a chained fact of the form
3253 "<loc> t1 ... tn" is expected from which instantiations of the parameters
3254 are derived. The command does not support old-style locales declared
3255 with "locale (open)".
3256 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
3258 * HOL: Tactic emulation methods induct_tac and case_tac understand static
3264 * Proof import: new image HOL4 contains the imported library from
3265 the HOL4 system with about 2500 theorems. It is imported by
3266 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
3267 can be used like any other Isabelle image. See
3268 HOL/Import/HOL/README for more information.
3271 - Much improved handling of linear and partial orders.
3272 Reasoners for linear and partial orders are set up for type classes
3273 "linorder" and "order" respectively, and are added to the default simpset
3274 as solvers. This means that the simplifier can build transitivity chains
3275 to solve goals from the assumptions.
3276 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
3277 of blast or auto after simplification become unnecessary because the goal
3278 is solved by simplification already.
3280 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
3281 all proved in axiomatic type classes for semirings, rings and fields.
3284 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
3285 now formalized using the Ring_and_Field theory mentioned above.
3286 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
3287 than before, because now they are set up once in a generic manner.
3288 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
3289 Look for the general versions in Ring_and_Field (and Power if they concern
3292 * Type "rat" of the rational numbers is now available in HOL-Complex.
3295 - Record types are now by default printed with their type abbreviation
3296 instead of the list of all field types. This can be configured via
3297 the reference "print_record_type_abbr".
3298 - Simproc "record_upd_simproc" for simplification of multiple updates added
3299 (not enabled by default).
3300 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
3301 EX x. x = sel r to True (not enabled by default).
3302 - Tactic "record_split_simp_tac" to split and simplify records added.
3304 * 'specification' command added, allowing for definition by
3305 specification. There is also an 'ax_specification' command that
3306 introduces the new constants axiomatically.
3308 * arith(_tac) is now able to generate counterexamples for reals as well.
3310 * HOL-Algebra: new locale "ring" for non-commutative rings.
3312 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
3313 definitions, thanks to Sava Krsti\'{c} and John Matthews.
3315 * HOL-Matrix: a first theory for matrices in HOL with an application of
3316 matrix theory to linear programming.
3318 * Unions and Intersections:
3319 The latex output syntax of UN and INT has been changed
3320 from "\Union x \in A. B" to "\Union_{x \in A} B"
3321 i.e. the index formulae has become a subscript.
3322 Similarly for "\Union x. B", and for \Inter instead of \Union.
3324 * Unions and Intersections over Intervals:
3325 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
3326 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
3327 like in normal math, and corresponding versions for < and for intersection.
3329 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
3330 lexicographic dictonary ordering has been added as "lexord".
3332 * ML: the legacy theory structures Int and List have been removed. They had
3333 conflicted with ML Basis Library structures having the same names.
3335 * 'refute' command added to search for (finite) countermodels. Only works
3336 for a fragment of HOL. The installation of an external SAT solver is
3337 highly recommended. See "HOL/Refute.thy" for details.
3339 * 'quickcheck' command: Allows to find counterexamples by evaluating
3340 formulae under an assignment of free variables to random values.
3341 In contrast to 'refute', it can deal with inductive datatypes,
3342 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
3348 * Streams now come with concatenation and are part of the HOLCF image
3352 New in Isabelle2003 (May 2003)
3353 ------------------------------
3357 * Provers/simplifier:
3359 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
3360 Assumptions are now subject to complete mutual simplification,
3361 not just from left to right. The simplifier now preserves
3362 the order of assumptions.
3364 Potential INCOMPATIBILITY:
3366 -- simp sometimes diverges where the old version did
3367 not, e.g. invoking simp on the goal
3369 [| P (f x); y = x; f x = f y |] ==> Q
3371 now gives rise to the infinite reduction sequence
3373 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
3375 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
3378 -- Tactics combining classical reasoner and simplification (such as auto)
3379 are also affected by this change, because many of them rely on
3380 simp. They may sometimes diverge as well or yield a different numbers
3381 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
3382 in case of problems. Sometimes subsequent calls to the classical
3383 reasoner will fail because a preceeding call to the simplifier too
3384 eagerly simplified the goal, e.g. deleted redundant premises.
3386 - The simplifier trace now shows the names of the applied rewrite rules
3388 - You can limit the number of recursive invocations of the simplifier
3389 during conditional rewriting (where the simplifie tries to solve the
3390 conditions before applying the rewrite rule):
3391 ML "simp_depth_limit := n"
3392 where n is an integer. Thus you can force termination where previously
3393 the simplifier would diverge.
3395 - Accepts free variables as head terms in congruence rules. Useful in Isar.
3397 - No longer aborts on failed congruence proof. Instead, the
3398 congruence is ignored.
3400 * Pure: New generic framework for extracting programs from constructive
3401 proofs. See HOL/Extraction.thy for an example instantiation, as well
3402 as HOL/Extraction for some case studies.
3404 * Pure: The main goal of the proof state is no longer shown by default, only
3405 the subgoals. This behaviour is controlled by a new flag.
3406 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
3407 (ML: Proof.show_main_goal).
3409 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
3410 rules whose conclusion matches subgoal 1:
3411 PG menu: Isabelle/Isar -> Show me -> matching rules
3412 The rules are ordered by how closely they match the subgoal.
3413 In particular, rules that solve a subgoal outright are displayed first
3414 (or rather last, the way they are printed).
3415 (ML: ProofGeneral.print_intros())
3417 * Pure: New flag trace_unify_fail causes unification to print
3418 diagnostic information (PG: in trace buffer) when it fails. This is
3419 useful for figuring out why single step proofs like rule, erule or
3422 * Pure: Locale specifications now produce predicate definitions
3423 according to the body of text (covering assumptions modulo local
3424 definitions); predicate "loc_axioms" covers newly introduced text,
3425 while "loc" is cumulative wrt. all included locale expressions; the
3426 latter view is presented only on export into the global theory
3427 context; potential INCOMPATIBILITY, use "(open)" option to fall back
3428 on the old view without predicates;
3430 * Pure: predefined locales "var" and "struct" are useful for sharing
3431 parameters (as in CASL, for example); just specify something like
3432 ``var x + var y + struct M'' as import;
3434 * Pure: improved thms_containing: proper indexing of facts instead of
3435 raw theorems; check validity of results wrt. current name space;
3436 include local facts of proof configuration (also covers active
3437 locales), cover fixed variables in index; may use "_" in term
3438 specification; an optional limit for the number of printed facts may
3439 be given (the default is 40);
3441 * Pure: disallow duplicate fact bindings within new-style theory files
3444 * Provers: improved induct method: assumptions introduced by case
3445 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
3446 the goal statement); "foo" still refers to all facts collectively;
3448 * Provers: the function blast.overloaded has been removed: all constants
3449 are regarded as potentially overloaded, which improves robustness in exchange
3450 for slight decrease in efficiency;
3452 * Provers/linorder: New generic prover for transitivity reasoning over
3453 linear orders. Note: this prover is not efficient!
3455 * Isar: preview of problems to finish 'show' now produce an error
3456 rather than just a warning (in interactive mode);
3463 - Produces a counter example if it cannot prove a goal.
3464 Note that the counter example may be spurious if the goal is not a formula
3465 of quantifier-free linear arithmetic.
3466 In ProofGeneral the counter example appears in the trace buffer.
3468 - Knows about div k and mod k where k is a numeral of type nat or int.
3470 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
3471 linear arithmetic fails. This takes account of quantifiers and divisibility.
3472 Presburger arithmetic can also be called explicitly via presburger(_tac).
3474 * simp's arithmetic capabilities have been enhanced a bit: it now
3475 takes ~= in premises into account (by performing a case split);
3477 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
3478 are distributed over a sum of terms;
3480 * New tactic "trans_tac" and method "trans" instantiate
3481 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
3484 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
3485 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
3487 * 'typedef' command has new option "open" to suppress the set
3490 * functions Min and Max on finite sets have been introduced (theory
3493 * attribute [symmetric] now works for relations as well; it turns
3494 (x,y) : R^-1 into (y,x) : R, and vice versa;
3496 * induct over a !!-quantified statement (say !!x1..xn):
3497 each "case" automatically performs "fix x1 .. xn" with exactly those names.
3499 * Map: `empty' is no longer a constant but a syntactic abbreviation for
3500 %x. None. Warning: empty_def now refers to the previously hidden definition
3503 * Algebra: formalization of classical algebra. Intended as base for
3504 any algebraic development in Isabelle. Currently covers group theory
3505 (up to Sylow's theorem) and ring theory (Universal Property of
3506 Univariate Polynomials). Contributions welcome;
3508 * GroupTheory: deleted, since its material has been moved to Algebra;
3510 * Complex: new directory of the complex numbers with numeric constants,
3511 nonstandard complex numbers, and some complex analysis, standard and
3512 nonstandard (Jacques Fleuriot);
3514 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
3516 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
3519 * Real/HahnBanach: updated and adapted to locales;
3521 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
3524 * UNITY: added the Meier-Sanders theory of progress sets;
3526 * MicroJava: bytecode verifier and lightweight bytecode verifier
3527 as abstract algorithms, instantiated to the JVM;
3529 * Bali: Java source language formalization. Type system, operational
3530 semantics, axiomatic semantics. Supported language features:
3531 classes, interfaces, objects,virtual methods, static methods,
3532 static/instance fields, arrays, access modifiers, definite
3533 assignment, exceptions.
3538 * ZF/Constructible: consistency proof for AC (Gdel's constructible
3541 * Main ZF: virtually all theories converted to new-style format;
3546 * Pure: Tactic.prove provides sane interface for internal proofs;
3547 omits the infamous "standard" operation, so this is more appropriate
3548 than prove_goalw_cterm in many situations (e.g. in simprocs);
3550 * Pure: improved error reporting of simprocs;
3552 * Provers: Simplifier.simproc(_i) provides sane interface for setting
3556 *** Document preparation ***
3558 * uses \par instead of \\ for line breaks in theory text. This may
3559 shift some page breaks in large documents. To get the old behaviour
3560 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
3562 * minimized dependencies of isabelle.sty and isabellesym.sty on
3565 * \<euro> now needs package babel/greek instead of marvosym (which
3568 * normal size for \<zero>...\<nine> (uses \mathbf instead of
3573 New in Isabelle2002 (March 2002)
3574 --------------------------------
3576 *** Document preparation ***
3578 * greatly simplified document preparation setup, including more
3579 graceful interpretation of isatool usedir -i/-d/-D options, and more
3580 instructive isatool mkdir; users should basically be able to get
3581 started with "isatool mkdir HOL Test && isatool make"; alternatively,
3582 users may run a separate document processing stage manually like this:
3583 "isatool usedir -D output HOL Test && isatool document Test/output";
3585 * theory dependency graph may now be incorporated into documents;
3586 isatool usedir -g true will produce session_graph.eps/.pdf for use
3587 with \includegraphics of LaTeX;
3589 * proper spacing of consecutive markup elements, especially text
3590 blocks after section headings;
3592 * support bold style (for single symbols only), input syntax is like
3593 this: "\<^bold>\<alpha>" or "\<^bold>A";
3595 * \<bullet> is now output as bold \cdot by default, which looks much
3596 better in printed text;
3598 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
3599 note that these symbols are currently unavailable in Proof General /
3600 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
3602 * isatool latex no longer depends on changed TEXINPUTS, instead
3603 isatool document copies the Isabelle style files to the target
3609 * Pure/Provers: improved proof by cases and induction;
3610 - 'case' command admits impromptu naming of parameters (such as
3612 - 'induct' method divinates rule instantiation from the inductive
3613 claim; no longer requires excessive ?P bindings for proper
3614 instantiation of cases;
3615 - 'induct' method properly enumerates all possibilities of set/type
3616 rules; as a consequence facts may be also passed through *type*
3617 rules without further ado;
3618 - 'induct' method now derives symbolic cases from the *rulified*
3619 rule (before it used to rulify cases stemming from the internal
3620 atomized version); this means that the context of a non-atomic
3621 statement becomes is included in the hypothesis, avoiding the
3622 slightly cumbersome show "PROP ?case" form;
3623 - 'induct' may now use elim-style induction rules without chaining
3624 facts, using ``missing'' premises from the goal state; this allows
3625 rules stemming from inductive sets to be applied in unstructured
3626 scripts, while still benefitting from proper handling of non-atomic
3627 statements; NB: major inductive premises need to be put first, all
3628 the rest of the goal is passed through the induction;
3629 - 'induct' proper support for mutual induction involving non-atomic
3630 rule statements (uses the new concept of simultaneous goals, see
3632 - append all possible rule selections, but only use the first
3633 success (no backtracking);
3634 - removed obsolete "(simplified)" and "(stripped)" options of methods;
3635 - undeclared rule case names default to numbers 1, 2, 3, ...;
3636 - added 'print_induct_rules' (covered by help item in recent Proof
3638 - moved induct/cases attributes to Pure, methods to Provers;
3639 - generic method setup instantiated for FOL and HOL;
3641 * Pure: support multiple simultaneous goal statements, for example
3642 "have a: A and b: B" (same for 'theorem' etc.); being a pure
3643 meta-level mechanism, this acts as if several individual goals had
3644 been stated separately; in particular common proof methods need to be
3645 repeated in order to cover all claims; note that a single elimination
3646 step is *not* sufficient to establish the two conjunctions, so this
3649 assume "A & B" then have A and B .. (*".." fails*)
3651 better use "obtain" in situations as above; alternative refer to
3652 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
3654 * Pure: proper integration with ``locales''; unlike the original
3655 version by Florian Kammller, Isar locales package high-level proof
3656 contexts rather than raw logical ones (e.g. we admit to include
3657 attributes everywhere); operations on locales include merge and
3658 rename; support for implicit arguments (``structures''); simultaneous
3659 type-inference over imports and text; see also HOL/ex/Locales.thy for
3662 * Pure: the following commands have been ``localized'', supporting a
3663 target locale specification "(in name)": 'lemma', 'theorem',
3664 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
3665 stored both within the locale and at the theory level (exported and
3666 qualified by the locale name);
3668 * Pure: theory goals may now be specified in ``long'' form, with
3669 ad-hoc contexts consisting of arbitrary locale elements. for example
3670 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
3671 definitions may be given, too); the result is a meta-level rule with
3672 the context elements being discharged in the obvious way;
3674 * Pure: new proof command 'using' allows to augment currently used
3675 facts after a goal statement ('using' is syntactically analogous to
3676 'apply', but acts on the goal's facts only); this allows chained facts
3677 to be separated into parts given before and after a claim, as in
3678 ``from a and b have C using d and e <proof>'';
3680 * Pure: renamed "antecedent" case to "rule_context";
3682 * Pure: new 'judgment' command records explicit information about the
3683 object-logic embedding (used by several tools internally); no longer
3684 use hard-wired "Trueprop";
3686 * Pure: added 'corollary' command;
3688 * Pure: fixed 'token_translation' command;
3690 * Pure: removed obsolete 'exported' attribute;
3692 * Pure: dummy pattern "_" in is/let is now automatically lifted over
3693 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
3694 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
3696 * Pure: method 'atomize' presents local goal premises as object-level
3697 statements (atomic meta-level propositions); setup controlled via
3698 rewrite rules declarations of 'atomize' attribute; example
3699 application: 'induct' method with proper rule statements in improper
3702 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
3703 now consider the syntactic context of assumptions, giving a better
3704 chance to get type-inference of the arguments right (this is
3705 especially important for locales);
3707 * Pure: "sorry" no longer requires quick_and_dirty in interactive
3710 * Pure/obtain: the formal conclusion "thesis", being marked as
3711 ``internal'', may no longer be reference directly in the text;
3712 potential INCOMPATIBILITY, may need to use "?thesis" in rare
3715 * Pure: generic 'sym' attribute which declares a rule both as pure
3716 'elim?' and for the 'symmetric' operation;
3718 * Pure: marginal comments ``--'' may now occur just anywhere in the
3719 text; the fixed correlation with particular command syntax has been
3722 * Pure: new method 'rules' is particularly well-suited for proof
3723 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
3724 but often produces more compact proof terms with less detours;
3726 * Pure/Provers/classical: simplified integration with pure rule
3727 attributes and methods; the classical "intro?/elim?/dest?"
3728 declarations coincide with the pure ones; the "rule" method no longer
3729 includes classically swapped intros; "intro" and "elim" methods no
3730 longer pick rules from the context; also got rid of ML declarations
3731 AddXIs/AddXEs/AddXDs; all of this has some potential for
3734 * Provers/classical: attribute 'swapped' produces classical inversions
3735 of introduction rules;
3737 * Provers/simplifier: 'simplified' attribute may refer to explicit
3738 rules instead of full simplifier context; 'iff' attribute handles
3741 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
3743 * HOL: 'recdef' now fails on unfinished automated proofs, use
3744 "(permissive)" option to recover old behavior;
3746 * HOL: 'inductive' no longer features separate (collective) attributes
3747 for 'intros' (was found too confusing);
3749 * HOL: properly declared induction rules less_induct and
3755 * HOL: moved over to sane numeral syntax; the new policy is as
3758 - 0 and 1 are polymorphic constants, which are defined on any
3759 numeric type (nat, int, real etc.);
3761 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
3762 binary representation internally;
3764 - type nat has special constructor Suc, and generally prefers Suc 0
3765 over 1::nat and Suc (Suc 0) over 2::nat;
3767 This change may cause significant problems of INCOMPATIBILITY; here
3768 are some hints on converting existing sources:
3770 - due to the new "num" token, "-0" and "-1" etc. are now atomic
3771 entities, so expressions involving "-" (unary or binary minus) need
3772 to be spaced properly;
3774 - existing occurrences of "1" may need to be constraint "1::nat" or
3775 even replaced by Suc 0; similar for old "2";
3777 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
3779 - remove all special provisions on numerals in proofs;
3781 * HOL: simp rules nat_number expand numerals on nat to Suc/0
3782 representation (depends on bin_arith_simps in the default context);
3784 * HOL: symbolic syntax for x^2 (numeral 2);
3786 * HOL: the class of all HOL types is now called "type" rather than
3787 "term"; INCOMPATIBILITY, need to adapt references to this type class
3788 in axclass/classes, instance/arities, and (usually rare) occurrences
3789 in typings (of consts etc.); internally the class is called
3790 "HOL.type", ML programs should refer to HOLogic.typeS;
3792 * HOL/record package improvements:
3793 - new derived operations "fields" to build a partial record section,
3794 "extend" to promote a fixed record to a record scheme, and
3795 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
3796 declared as simp by default;
3797 - shared operations ("more", "fields", etc.) now need to be always
3798 qualified) --- potential INCOMPATIBILITY;
3799 - removed "make_scheme" operations (use "make" with "extend") --
3801 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
3802 - provides cases/induct rules for use with corresponding Isar
3803 methods (for concrete records, record schemes, concrete more
3804 parts, and schematic more parts -- in that order);
3805 - internal definitions directly based on a light-weight abstract
3806 theory of product types over typedef rather than datatype;
3808 * HOL: generic code generator for generating executable ML code from
3809 specifications; specific support for HOL constructs such as inductive
3810 datatypes and sets, as well as recursive functions; can be invoked
3811 via 'generate_code' theory section;
3813 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
3815 * HOL: consolidated and renamed several theories. In particular:
3816 Ord.thy has been absorbed into HOL.thy
3817 String.thy has been absorbed into List.thy
3819 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
3820 (beware of argument permutation!);
3822 * HOL: linorder_less_split superseded by linorder_cases;
3824 * HOL/List: "nodups" renamed to "distinct";
3826 * HOL: added "The" definite description operator; move Hilbert's "Eps"
3827 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
3828 - Ex_def has changed, now need to use some_eq_ex
3830 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
3831 in this (rare) case use:
3833 delSWrapper "split_all_tac"
3834 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
3836 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
3839 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
3840 Isabelle's type classes, ^ on functions and relations has too general
3841 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
3842 necessary to attach explicit type constraints;
3844 * HOL/Relation: the prefix name of the infix "O" has been changed from
3845 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
3846 renamed accordingly (eg "compI" -> "rel_compI").
3848 * HOL: syntax translations now work properly with numerals and records
3851 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
3852 of "lam" -- INCOMPATIBILITY;
3854 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
3855 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
3856 renamed "Product_Type.unit";
3858 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
3860 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
3861 the "cases" method);
3863 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
3866 * HOL/IMP: updated and converted to new-style theory format; several
3867 parts turned into readable document, with proper Isar proof texts and
3868 some explanations (by Gerwin Klein);
3870 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
3872 * HOL-Hyperreal is now a logic image;
3877 * Isar: consts/constdefs supports mixfix syntax for continuous
3880 * Isar: domain package adapted to new-style theory format, e.g. see
3883 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
3884 potential INCOMPATIBILITY; now use plain induct_tac instead of former
3885 lift.induct_tac, always use UU instead of Undef;
3887 * HOLCF/IMP: updated and converted to new-style theory;
3892 * Isar: proper integration of logic-specific tools and packages,
3893 including theory commands '(co)inductive', '(co)datatype',
3894 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
3895 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
3897 * theory Main no longer includes AC; for the Axiom of Choice, base
3898 your theory on Main_ZFC;
3900 * the integer library now covers quotients and remainders, with many
3901 laws relating division to addition, multiplication, etc.;
3903 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
3904 typeless version of the formalism;
3906 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
3909 * ZF/Induct: new directory for examples of inductive definitions,
3910 including theory Multiset for multiset orderings; converted to
3911 new-style theory format;
3913 * ZF: many new theorems about lists, ordinals, etc.;
3918 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
3919 variable proof controls level of detail: 0 = no proofs (only oracle
3920 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
3921 also ref manual for further ML interfaces;
3923 * Pure/axclass: removed obsolete ML interface
3924 goal_subclass/goal_arity;
3926 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
3927 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
3928 separate tokens, so expressions involving minus need to be spaced
3931 * Pure/syntax: support non-oriented infixes, using keyword "infix"
3932 rather than "infixl" or "infixr";
3934 * Pure/syntax: concrete syntax for dummy type variables admits genuine
3935 sort constraint specifications in type inference; e.g. "x::_::foo"
3936 ensures that the type of "x" is of sort "foo" (but not necessarily a
3939 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
3940 control output of nested => (types); the default behavior is
3943 * Pure/syntax: builtin parse translation for "_constify" turns valued
3944 tokens into AST constants;
3946 * Pure/syntax: prefer later declarations of translations and print
3947 translation functions; potential INCOMPATIBILITY: need to reverse
3948 multiple declarations for same syntax element constant;
3950 * Pure/show_hyps reset by default (in accordance to existing Isar
3953 * Provers/classical: renamed addaltern to addafter, addSaltern to
3956 * Provers/clasimp: ``iff'' declarations now handle conditional rules
3959 * system: tested support for MacOS X; should be able to get Isabelle +
3960 Proof General to work in a plain Terminal after installing Poly/ML
3961 (e.g. from the Isabelle distribution area) and GNU bash alone
3962 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
3963 support requires further installations, e.g. from
3964 http://fink.sourceforge.net/);
3966 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
3968 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
3969 of 40 MB), cf. ML_OPTIONS;
3971 * system: Proof General keywords specification is now part of the
3972 Isabelle distribution (see etc/isar-keywords.el);
3974 * system: support for persistent Proof General sessions (refrain from
3975 outdating all loaded theories on startup); user may create writable
3976 logic images like this: ``isabelle -q HOL Test'';
3978 * system: smart selection of Isabelle process versus Isabelle
3979 interface, accommodates case-insensitive file systems (e.g. HFS+); may
3980 run both "isabelle" and "Isabelle" even if file names are badly
3981 damaged (executable inspects the case of the first letter of its own
3982 name); added separate "isabelle-process" and "isabelle-interface";
3984 * system: refrain from any attempt at filtering input streams; no
3985 longer support ``8bit'' encoding of old isabelle font, instead proper
3986 iso-latin characters may now be used; the related isatools
3987 "symbolinput" and "nonascii" have disappeared as well;
3989 * system: removed old "xterm" interface (the print modes "xterm" and
3990 "xterm_color" are still available for direct use in a suitable
3995 New in Isabelle99-2 (February 2001)
3996 -----------------------------------
3998 *** Overview of INCOMPATIBILITIES ***
4000 * HOL: please note that theories in the Library and elsewhere often use the
4001 new-style (Isar) format; to refer to their theorems in an ML script you must
4002 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
4004 * HOL: inductive package no longer splits induction rule aggressively,
4005 but only as far as specified by the introductions given; the old
4006 format may be recovered via ML function complete_split_rule or attribute
4007 'split_rule (complete)';
4009 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
4010 gfp_Tarski to gfp_unfold;
4012 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
4014 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
4015 relation); infix "^^" has been renamed "``"; infix "``" has been
4016 renamed "`"; "univalent" has been renamed "single_valued";
4018 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
4021 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
4023 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
4025 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
4026 consequence, it is no longer monotonic wrt. the local goal context
4027 (which is now passed through the inductive cases);
4029 * Document preparation: renamed standard symbols \<ll> to \<lless> and
4030 \<gg> to \<ggreater>;
4033 *** Document preparation ***
4035 * \isabellestyle{NAME} selects version of Isabelle output (currently
4036 available: are "it" for near math-mode best-style output, "sl" for
4037 slanted text style, and "tt" for plain type-writer; if no
4038 \isabellestyle command is given, output is according to slanted
4041 * support sub/super scripts (for single symbols only), input syntax is
4042 like this: "A\<^sup>*" or "A\<^sup>\<star>";
4044 * some more standard symbols; see Appendix A of the system manual for
4045 the complete list of symbols defined in isabellesym.sty;
4047 * improved isabelle style files; more abstract symbol implementation
4048 (should now use \isamath{...} and \isatext{...} in custom symbol
4051 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
4052 state; Note that presentation of goal states does not conform to
4053 actual human-readable proof documents. Please do not include goal
4054 states into document output unless you really know what you are doing!
4056 * proper indentation of antiquoted output with proportional LaTeX
4059 * no_document ML operator temporarily disables LaTeX document
4062 * isatool unsymbolize tunes sources for plain ASCII communication;
4067 * Pure: Isar now suffers initial goal statements to contain unbound
4068 schematic variables (this does not conform to actual readable proof
4069 documents, due to unpredictable outcome and non-compositional proof
4070 checking); users who know what they are doing may use schematic goals
4071 for Prolog-style synthesis of proven results;
4073 * Pure: assumption method (an implicit finishing) now handles actual
4076 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
4077 initial goal, declare "that" only as Pure intro (only for single
4078 steps); the "that" rule assumption may now be involved in implicit
4079 finishing, thus ".." becomes a feasible for trivial obtains;
4081 * Pure: default proof step now includes 'intro_classes'; thus trivial
4082 instance proofs may be performed by "..";
4084 * Pure: ?thesis / ?this / "..." now work for pure meta-level
4087 * Pure: more robust selection of calculational rules;
4089 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
4090 rule (as well as the assumption rule);
4092 * Pure: 'thm_deps' command visualizes dependencies of theorems and
4093 lemmas, using the graph browser tool;
4095 * Pure: predict failure of "show" in interactive mode;
4097 * Pure: 'thms_containing' now takes actual terms as arguments;
4099 * HOL: improved method 'induct' --- now handles non-atomic goals
4100 (potential INCOMPATIBILITY); tuned error handling;
4102 * HOL: cases and induct rules now provide explicit hints about the
4103 number of facts to be consumed (0 for "type" and 1 for "set" rules);
4104 any remaining facts are inserted into the goal verbatim;
4106 * HOL: local contexts (aka cases) may now contain term bindings as
4107 well; the 'cases' and 'induct' methods new provide a ?case binding for
4108 the result to be shown in each case;
4110 * HOL: added 'recdef_tc' command;
4112 * isatool convert assists in eliminating legacy ML scripts;
4117 * HOL/Library: a collection of generic theories to be used together
4118 with main HOL; the theory loader path already includes this directory
4119 by default; the following existing theories have been moved here:
4120 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
4121 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
4123 * HOL/Unix: "Some aspects of Unix file-system security", a typical
4124 modelling and verification task performed in Isabelle/HOL +
4125 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
4127 * HOL/Algebra: special summation operator SUM no longer exists, it has
4128 been replaced by setsum; infix 'assoc' now has priority 50 (like
4129 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
4130 'domain', this makes the theory consistent with mathematical
4133 * HOL basics: added overloaded operations "inverse" and "divide"
4134 (infix "/"), syntax for generic "abs" operation, generic summation
4137 * HOL/typedef: simplified package, provide more useful rules (see also
4140 * HOL/datatype: induction rule for arbitrarily branching datatypes is
4141 now expressed as a proper nested rule (old-style tactic scripts may
4142 require atomize_strip_tac to cope with non-atomic premises);
4144 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
4145 to "split_conv" (old name still available for compatibility);
4147 * HOL: improved concrete syntax for strings (e.g. allows translation
4148 rules with string literals);
4150 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
4151 and Fleuriot's mechanization of analysis, including the transcendental
4152 functions for the reals;
4154 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
4159 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
4160 "lam" is displayed as TWO lambda-symbols
4162 * CTT: theory Main now available, containing everything (that is, Bool
4168 * Pure: the Simplifier has been implemented properly as a derived rule
4169 outside of the actual kernel (at last!); the overall performance
4170 penalty in practical applications is about 50%, while reliability of
4171 the Isabelle inference kernel has been greatly improved;
4173 * print modes "brackets" and "no_brackets" control output of nested =>
4174 (types) and ==> (props); the default behaviour is "brackets";
4176 * Provers: fast_tac (and friends) now handle actual object-logic rules
4177 as assumptions as well;
4179 * system: support Poly/ML 4.0;
4181 * system: isatool install handles KDE version 1 or 2;
4185 New in Isabelle99-1 (October 2000)
4186 ----------------------------------
4188 *** Overview of INCOMPATIBILITIES ***
4190 * HOL: simplification of natural numbers is much changed; to partly
4191 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
4192 issue the following ML commands:
4194 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
4195 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
4197 * HOL: simplification no longer dives into case-expressions; this is
4198 controlled by "t.weak_case_cong" for each datatype t;
4200 * HOL: nat_less_induct renamed to less_induct;
4202 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
4203 fixsome to patch .thy and .ML sources automatically;
4205 select_equality -> some_equality
4206 select_eq_Ex -> some_eq_ex
4207 selectI2EX -> someI2_ex
4210 select1_equality -> some1_equality
4211 Eps_sym_eq -> some_sym_eq_trivial
4212 Eps_eq -> some_eq_trivial
4214 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
4216 * HOL: removed obsolete theorem binding expand_if (refer to split_if
4219 * HOL: the recursion equations generated by 'recdef' are now called
4220 f.simps instead of f.rules;
4222 * HOL: qed_spec_mp now also handles bounded ALL as well;
4224 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
4225 sometimes be needed;
4227 * HOL: the constant for "f``x" is now "image" rather than "op ``";
4229 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
4231 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
4232 product is now "<*>" instead of "Times"; the lexicographic product is
4233 now "<*lex*>" instead of "**";
4235 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
4236 of main HOL, but was unused); better use HOL's datatype package;
4238 * HOL: removed "symbols" syntax for constant "override" of theory Map;
4239 the old syntax may be recovered as follows:
4242 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
4243 (infixl "\\<oplus>" 100)
4245 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4247 * HOL/ML: even fewer consts are declared as global (see theories Ord,
4248 Lfp, Gfp, WF); this only affects ML packages that refer to const names
4251 * HOL and ZF: syntax for quotienting wrt an equivalence relation
4252 changed from A/r to A//r;
4254 * ZF: new treatment of arithmetic (nat & int) may break some old
4257 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
4258 rulify -> rule_format, elimify -> elim_format, ...);
4260 * Isar/Provers: intro/elim/dest attributes changed; renamed
4261 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
4262 should have to change intro!! to intro? only); replaced "delrule" by
4265 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
4267 * Provers: strengthened force_tac by using new first_best_tac;
4269 * LaTeX document preparation: several changes of isabelle.sty (see
4273 *** Document preparation ***
4275 * formal comments (text blocks etc.) in new-style theories may now
4276 contain antiquotations of thm/prop/term/typ/text to be presented
4277 according to latex print mode; concrete syntax is like this:
4278 @{term[show_types] "f(x) = a + x"};
4280 * isatool mkdir provides easy setup of Isabelle session directories,
4281 including proper document sources;
4283 * generated LaTeX sources are now deleted after successful run
4284 (isatool document -c); may retain a copy somewhere else via -D option
4287 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
4288 style files, achieving self-contained LaTeX sources and simplifying
4291 * old-style theories now produce (crude) LaTeX output as well;
4293 * browser info session directories are now self-contained (may be put
4294 on WWW server seperately); improved graphs of nested sessions; removed
4295 graph for 'all sessions';
4297 * several improvements in isabelle style files; \isabellestyle{it}
4298 produces fake math mode output; \isamarkupheader is now \section by
4299 default; see lib/texinputs/isabelle.sty etc.;
4304 * Isar/Pure: local results and corresponding term bindings are now
4305 subject to Hindley-Milner polymorphism (similar to ML); this
4306 accommodates incremental type-inference very nicely;
4308 * Isar/Pure: new derived language element 'obtain' supports
4309 generalized existence reasoning;
4311 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
4312 support accumulation of results, without applying any rules yet;
4313 useful to collect intermediate results without explicit name
4314 references, and for use with transitivity rules with more than 2
4317 * Isar/Pure: scalable support for case-analysis type proofs: new
4318 'case' language element refers to local contexts symbolically, as
4319 produced by certain proof methods; internally, case names are attached
4320 to theorems as "tags";
4322 * Isar/Pure: theory command 'hide' removes declarations from
4323 class/type/const name spaces;
4325 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
4326 indicate potential overloading;
4328 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
4330 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
4331 "{a,b,c}" instead of {a,b,c};
4333 * Isar/Pure now provides its own version of intro/elim/dest
4334 attributes; useful for building new logics, but beware of confusion
4335 with the version in Provers/classical;
4337 * Isar/Pure: the local context of (non-atomic) goals is provided via
4338 case name 'antecedent';
4340 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
4341 to the current context is now done automatically);
4343 * Isar/Pure: theory command 'method_setup' provides a simple interface
4344 for definining proof methods in ML;
4346 * Isar/Provers: intro/elim/dest attributes changed; renamed
4347 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
4348 most cases, one should have to change intro!! to intro? only);
4349 replaced "delrule" by "rule del";
4351 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
4352 'symmetric' attribute (the latter supercedes [RS sym]);
4354 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
4355 method modifier); 'simp' method: 'only:' modifier removes loopers as
4356 well (including splits);
4358 * Isar/Provers: Simplifier and Classical methods now support all kind
4359 of modifiers used in the past, including 'cong', 'iff', etc.
4361 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
4362 of Simplifier and Classical reasoner);
4364 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
4365 now support named cases; major packages (inductive, datatype, primrec,
4366 recdef) support case names and properly name parameters;
4368 * Isar/HOL: new transitivity rules for substitution in inequalities --
4369 monotonicity conditions are extracted to be proven at end of
4372 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
4375 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
4376 split_if split_if_asm; datatype package provides theorems foo.splits =
4377 foo.split foo.split_asm for each datatype;
4379 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
4380 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
4381 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
4382 use "(cases (simplified))" method in proper proof texts);
4384 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
4386 * Isar: names of theorems etc. may be natural numbers as well;
4388 * Isar: 'pr' command: optional arguments for goals_limit and
4389 ProofContext.prems_limit; no longer prints theory contexts, but only
4392 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
4393 additional print modes to be specified; e.g. "pr(latex)" will print
4394 proof state according to the Isabelle LaTeX style;
4396 * Isar: improved support for emulating tactic scripts, including proof
4397 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
4398 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
4399 (for HOL datatypes);
4401 * Isar: simplified (more robust) goal selection of proof methods: 1st
4402 goal, all goals, or explicit goal specifier (tactic emulation); thus
4403 'proof method scripts' have to be in depth-first order;
4405 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
4407 * Isar: removed 'help' command, which hasn't been too helpful anyway;
4408 should instead use individual commands for printing items
4409 (print_commands, print_methods etc.);
4411 * Isar: added 'nothing' --- the empty list of theorems;
4416 * HOL/MicroJava: formalization of a fragment of Java, together with a
4417 corresponding virtual machine and a specification of its bytecode
4418 verifier and a lightweight bytecode verifier, including proofs of
4419 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
4420 Cornelia Pusch (see also the homepage of project Bali at
4421 http://isabelle.in.tum.de/Bali/);
4423 * HOL/Algebra: new theory of rings and univariate polynomials, by
4426 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
4427 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
4430 * HOL/Lattice: fundamental concepts of lattice theory and order
4431 structures, including duals, properties of bounds versus algebraic
4432 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
4433 Theorem for complete lattices etc.; may also serve as a demonstration
4434 for abstract algebraic reasoning using axiomatic type classes, and
4435 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
4437 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
4440 * HOL/IMPP: extension of IMP with local variables and mutually
4441 recursive procedures, by David von Oheimb;
4443 * HOL/Lambda: converted into new-style theory and document;
4445 * HOL/ex/Multiquote: example of multiple nested quotations and
4446 anti-quotations -- basically a generalized version of de-Bruijn
4447 representation; very useful in avoiding lifting of operations;
4449 * HOL/record: added general record equality rule to simpset; fixed
4450 select-update simplification procedure to handle extended records as
4451 well; admit "r" as field name;
4453 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
4454 other numeric types and also as the identity of groups, rings, etc.;
4456 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
4457 Types nat and int belong to this axclass;
4459 * HOL: greatly improved simplification involving numerals of type nat, int, real:
4460 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
4461 i*j + k + j*#3*i simplifies to #4*(i*j) + k
4462 two terms #m*u and #n*u are replaced by #(m+n)*u
4463 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
4464 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
4465 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
4467 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
4468 powerful prover for predicate logic but knows nothing of clasets; see
4469 ex/mesontest.ML and ex/mesontest2.ML for example applications;
4471 * HOL: new version of "case_tac" subsumes both boolean case split and
4472 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
4473 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
4475 * HOL: simplification no longer dives into case-expressions: only the
4476 selector expression is simplified, but not the remaining arms; to
4477 enable full simplification of case-expressions for datatype t, you may
4478 remove t.weak_case_cong from the simpset, either globally (Delcongs
4479 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
4481 * HOL/recdef: the recursion equations generated by 'recdef' for
4482 function 'f' are now called f.simps instead of f.rules; if all
4483 termination conditions are proved automatically, these simplification
4484 rules are added to the simpset, as in primrec; rules may be named
4485 individually as well, resulting in a separate list of theorems for
4488 * HOL/While is a new theory that provides a while-combinator. It
4489 permits the definition of tail-recursive functions without the
4490 provision of a termination measure. The latter is necessary once the
4491 invariant proof rule for while is applied.
4493 * HOL: new (overloaded) notation for the set of elements below/above
4494 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
4496 * HOL: theorems impI, allI, ballI bound as "strip";
4498 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
4499 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
4500 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
4502 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4504 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
4505 main HOL, but was unused);
4507 * HOL: fewer consts declared as global (e.g. have to refer to
4508 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
4510 * HOL: tuned AST representation of nested pairs, avoiding bogus output
4511 in case of overlap with user translations (e.g. judgements over
4512 tuples); (note that the underlying logical represenation is still
4518 * ZF: simplification automatically cancels common terms in arithmetic
4519 expressions over nat and int;
4521 * ZF: new treatment of nat to minimize type-checking: all operators
4522 coerce their operands to a natural number using the function natify,
4523 making the algebraic laws unconditional;
4525 * ZF: as above, for int: operators coerce their operands to an integer
4526 using the function intify;
4528 * ZF: the integer library now contains many of the usual laws for the
4529 orderings, including $<=, and monotonicity laws for $+ and $*;
4531 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
4534 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
4535 to the simplifier and classical reasoner simultaneously;
4540 * Provers: blast_tac now handles actual object-logic rules as
4541 assumptions; note that auto_tac uses blast_tac internally as well;
4543 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
4544 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
4546 * Provers: delrules now handles destruct rules as well (no longer need
4547 explicit make_elim);
4549 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
4550 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4551 use instead the strong form,
4552 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4553 in HOL, FOL and ZF the function cla_make_elim will create such rules
4554 from destruct-rules;
4556 * Provers: Simplifier.easy_setup provides a fast path to basic
4557 Simplifier setup for new object-logics;
4559 * Pure: AST translation rules no longer require constant head on LHS;
4561 * Pure: improved name spaces: ambiguous output is qualified; support
4562 for hiding of names;
4564 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
4565 XSYMBOL_HOME; no longer need to do manual configuration in most
4568 * system: compression of ML heaps images may now be controlled via -c
4569 option of isabelle and isatool usedir (currently only observed by
4572 * system: isatool installfonts may handle X-Symbol fonts as well (very
4573 useful for remote X11);
4575 * system: provide TAGS file for Isabelle sources;
4577 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
4580 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
4581 timing flag supersedes proof_timing and Toplevel.trace;
4583 * ML: new combinators |>> and |>>> for incremental transformations
4584 with secondary results (e.g. certain theory extensions):
4586 * ML: PureThy.add_defs gets additional argument to indicate potential
4587 overloading (usually false);
4589 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
4594 New in Isabelle99 (October 1999)
4595 --------------------------------
4597 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4599 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
4600 are no longer simplified. (This allows the simplifier to unfold recursive
4601 functional programs.) To restore the old behaviour, declare
4603 Delcongs [if_weak_cong];
4605 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
4608 * HOL: the predicate "inj" is now defined by translation to "inj_on";
4610 * HOL/datatype: mutual_induct_tac no longer exists --
4611 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
4613 * HOL/typedef: fixed type inference for representing set; type
4614 arguments now have to occur explicitly on the rhs as type constraints;
4616 * ZF: The con_defs part of an inductive definition may no longer refer
4617 to constants declared in the same theory;
4619 * HOL, ZF: the function mk_cases, generated by the inductive
4620 definition package, has lost an argument. To simplify its result, it
4621 uses the default simpset instead of a supplied list of theorems.
4623 * HOL/List: the constructors of type list are now Nil and Cons;
4625 * Simplifier: the type of the infix ML functions
4626 setSSolver addSSolver setSolver addSolver
4627 is now simpset * solver -> simpset where `solver' is a new abstract type
4628 for packaging solvers. A solver is created via
4629 mk_solver: string -> (thm list -> int -> tactic) -> solver
4630 where the string argument is only a comment.
4635 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
4636 decision procedure for linear arithmetic. Currently it is used for
4637 types `nat', `int', and `real' in HOL (see below); it can, should and
4638 will be instantiated for other types and logics as well.
4640 * The simplifier now accepts rewrite rules with flexible heads, eg
4641 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
4642 They are applied like any rule with a non-pattern lhs, i.e. by first-order
4648 * New Isabelle/Isar subsystem provides an alternative to traditional
4649 tactical theorem proving; together with the ProofGeneral/isar user
4650 interface it offers an interactive environment for developing human
4651 readable proof documents (Isar == Intelligible semi-automated
4652 reasoning); for further information see isatool doc isar-ref,
4653 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
4655 * improved and simplified presentation of theories: better HTML markup
4656 (including colors), graph views in several sizes; isatool usedir now
4657 provides a proper interface for user theories (via -P option); actual
4658 document preparation based on (PDF)LaTeX is available as well (for
4659 new-style theories only); see isatool doc system for more information;
4661 * native support for Proof General, both for classic Isabelle and
4664 * ML function thm_deps visualizes dependencies of theorems and lemmas,
4665 using the graph browser tool;
4667 * Isabelle manuals now also available as PDF;
4669 * theory loader rewritten from scratch (may not be fully
4670 bug-compatible); old loadpath variable has been replaced by show_path,
4671 add_path, del_path, reset_path functions; new operations such as
4672 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
4675 * improved isatool install: option -k creates KDE application icon,
4676 option -p DIR installs standalone binaries;
4678 * added ML_PLATFORM setting (useful for cross-platform installations);
4679 more robust handling of platform specific ML images for SML/NJ;
4681 * the settings environment is now statically scoped, i.e. it is never
4682 created again in sub-processes invoked from isabelle, isatool, or
4685 * path element specification '~~' refers to '$ISABELLE_HOME';
4687 * in locales, the "assumes" and "defines" parts may be omitted if
4690 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
4693 * new print_mode "HTML";
4695 * new flag show_tags controls display of tags of theorems (which are
4696 basically just comments that may be attached by some tools);
4698 * Isamode 2.6 requires patch to accomodate change of Isabelle font
4699 mode and goal output format:
4701 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
4703 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
4705 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
4706 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
4708 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
4710 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
4712 * function bind_thms stores lists of theorems (cf. bind_thm);
4714 * new shorthand tactics ftac, eatac, datac, fatac;
4716 * qed (and friends) now accept "" as result name; in that case the
4717 theorem is not stored, but proper checks and presentation of the
4720 * theorem database now also indexes constants "Trueprop", "all",
4721 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
4726 ** HOL arithmetic **
4728 * There are now decision procedures for linear arithmetic over nat and
4731 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
4732 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
4733 are treated as atomic; subformulae not involving type `nat' or `int'
4734 are ignored; quantified subformulae are ignored unless they are
4735 positive universal or negative existential. The tactic has to be
4736 invoked by hand and can be a little bit slow. In particular, the
4737 running time is exponential in the number of occurrences of `min' and
4738 `max', and `-' on `nat'.
4740 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
4741 (negated) (in)equalities among the premises and the conclusion into
4742 account (i.e. no compound formulae) and does not know about `min' and
4743 `max', and `-' on `nat'. It is fast and is used automatically by the
4746 NB: At the moment, these decision procedures do not cope with mixed
4747 nat/int formulae where the two parts interact, such as `m < n ==>
4750 * HOL/Numeral provides a generic theory of numerals (encoded
4751 efficiently as bit strings); setup for types nat/int/real is in place;
4752 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
4753 int, existing theories and proof scripts may require a few additional
4756 * integer division and remainder can now be performed on constant
4759 * many properties of integer multiplication, division and remainder
4762 * An interface to the Stanford Validity Checker (SVC) is available through the
4763 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
4764 are proved automatically. SVC must be installed separately, and its results
4765 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
4766 invocation of the underlying oracle). For SVC see
4767 http://verify.stanford.edu/SVC
4769 * IsaMakefile: the HOL-Real target now builds an actual image;
4774 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
4775 (in Isabelle/Isar) -- by Gertrud Bauer;
4777 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
4778 analysis for assembly languages with subtypes;
4780 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
4781 -- avoids syntactic ambiguities and treats state, transition, and
4782 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
4783 changed syntax and (many) tactics;
4785 * HOL/inductive: Now also handles more general introduction rules such
4786 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
4787 theorems are now maintained within the theory (maintained via the
4790 * HOL/datatype: Now also handles arbitrarily branching datatypes
4791 (using function types) such as
4793 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
4795 * HOL/record: record_simproc (part of the default simpset) takes care
4796 of selectors applied to updated records; record_split_tac is no longer
4797 part of the default claset; update_defs may now be removed from the
4798 simpset in many cases; COMPATIBILITY: old behavior achieved by
4800 claset_ref () := claset() addSWrapper record_split_wrapper;
4801 Delsimprocs [record_simproc]
4803 * HOL/typedef: fixed type inference for representing set; type
4804 arguments now have to occur explicitly on the rhs as type constraints;
4806 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
4807 names rather than an ML expression;
4809 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
4810 supplied later. Program schemes can be defined, such as
4811 "While B C s = (if B s then While B C (C s) else s)"
4812 where the well-founded relation can be chosen after B and C have been given.
4814 * HOL/List: the constructors of type list are now Nil and Cons;
4815 INCOMPATIBILITY: while [] and infix # syntax is still there, of
4816 course, ML tools referring to List.list.op # etc. have to be adapted;
4818 * HOL_quantifiers flag superseded by "HOL" print mode, which is
4819 disabled by default; run isabelle with option -m HOL to get back to
4820 the original Gordon/HOL-style output;
4822 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
4823 ALL x<=y. P, EX x<y. P, EX x<=y. P;
4825 * HOL basic syntax simplified (more orthogonal): all variants of
4826 All/Ex now support plain / symbolic / HOL notation; plain syntax for
4827 Eps operator is provided as well: "SOME x. P[x]";
4829 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
4831 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
4832 thus available for user theories;
4834 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
4835 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
4838 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
4839 several times and then mp;
4844 * the notation <<...>> is now available as a notation for sequences of
4847 * the simplifier is now installed
4849 * the axiom system has been generalized (thanks to Soren Heilmann)
4851 * the classical reasoner now has a default rule database
4856 * new primrec section allows primitive recursive functions to be given
4857 directly (as in HOL) over datatypes and the natural numbers;
4859 * new tactics induct_tac and exhaust_tac for induction (or case
4860 analysis) over datatypes and the natural numbers;
4862 * the datatype declaration of type T now defines the recursor T_rec;
4864 * simplification automatically does freeness reasoning for datatype
4867 * automatic type-inference, with AddTCs command to insert new
4868 type-checking rules;
4870 * datatype introduction rules are now added as Safe Introduction rules
4873 * the syntax "if P then x else y" is now available in addition to
4877 *** Internal programming interfaces ***
4879 * tuned simplifier trace output; new flag debug_simp;
4881 * structures Vartab / Termtab (instances of TableFun) offer efficient
4882 tables indexed by indexname_ord / term_ord (compatible with aconv);
4884 * AxClass.axclass_tac lost the theory argument;
4886 * tuned current_goals_markers semantics: begin / end goal avoids
4887 printing empty lines;
4889 * removed prs and prs_fn hook, which was broken because it did not
4890 include \n in its semantics, forcing writeln to add one
4891 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
4892 string -> unit if you really want to output text without newline;
4894 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
4895 plain output, interface builders may have to enable 'isabelle_font'
4896 mode to get Isabelle font glyphs as before;
4898 * refined token_translation interface; INCOMPATIBILITY: output length
4899 now of type real instead of int;
4901 * theory loader actions may be traced via new ThyInfo.add_hook
4902 interface (see src/Pure/Thy/thy_info.ML); example application: keep
4903 your own database of information attached to *whole* theories -- as
4904 opposed to intra-theory data slots offered via TheoryDataFun;
4906 * proper handling of dangling sort hypotheses (at last!);
4907 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
4908 extra sort hypotheses that can be witnessed from the type signature;
4909 the force_strip_shyps flag is gone, any remaining shyps are simply
4910 left in the theorem (with a warning issued by strip_shyps_warning);
4914 New in Isabelle98-1 (October 1998)
4915 ----------------------------------
4917 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4919 * several changes of automated proof tools;
4921 * HOL: major changes to the inductive and datatype packages, including
4922 some minor incompatibilities of theory syntax;
4924 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
4927 * HOL: removed duplicate thms in Arith:
4928 less_imp_add_less should be replaced by trans_less_add1
4929 le_imp_add_le should be replaced by trans_le_add1
4931 * HOL: unary minus is now overloaded (new type constraints may be
4934 * HOL and ZF: unary minus for integers is now #- instead of #~. In
4935 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
4936 now taken as an integer constant.
4938 * Pure: ML function 'theory_of' renamed to 'theory';
4944 1. Asm_full_simp_tac is now more aggressive.
4945 1. It will sometimes reorient premises if that increases their power to
4947 2. It does no longer proceed strictly from left to right but may also
4948 rotate premises to achieve further simplification.
4949 For compatibility reasons there is now Asm_lr_simp_tac which is like the
4950 old Asm_full_simp_tac in that it does not rotate premises.
4951 2. The simplifier now knows a little bit about nat-arithmetic.
4953 * Classical reasoner: wrapper mechanism for the classical reasoner now
4954 allows for selected deletion of wrappers, by introduction of names for
4955 wrapper functionals. This implies that addbefore, addSbefore,
4956 addaltern, and addSaltern now take a pair (name, tactic) as argument,
4957 and that adding two tactics with the same name overwrites the first
4958 one (emitting a warning).
4959 type wrapper = (int -> tactic) -> (int -> tactic)
4960 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
4961 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
4962 delWrapper, delSWrapper: claset * string -> claset
4963 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
4965 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
4966 semantics; addbefore now affects only the unsafe part of step_tac
4967 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
4968 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
4971 * Classical reasoner: setwrapper to setWrapper and compwrapper to
4972 compWrapper; added safe wrapper (and access functions for it);
4974 * HOL/split_all_tac is now much faster and fails if there is nothing
4975 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
4976 and the names of the automatically generated variables have changed.
4977 split_all_tac has moved within claset() from unsafe wrappers to safe
4978 wrappers, which means that !!-bound variables are split much more
4979 aggressively, and safe_tac and clarify_tac now split such variables.
4980 If this splitting is not appropriate, use delSWrapper "split_all_tac".
4981 Note: the same holds for record_split_tac, which does the job of
4982 split_all_tac for record fields.
4984 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
4985 permanently to the default simpset using Addsplits just like
4986 Addsimps. They can be removed via Delsplits just like
4987 Delsimps. Lower-case versions are also available.
4989 * HOL/Simplifier: The rule split_if is now part of the default
4990 simpset. This means that the simplifier will eliminate all occurrences
4991 of if-then-else in the conclusion of a goal. To prevent this, you can
4992 either remove split_if completely from the default simpset by
4993 `Delsplits [split_if]' or remove it in a specific call of the
4994 simplifier using `... delsplits [split_if]'. You can also add/delete
4995 other case splitting rules to/from the default simpset: every datatype
4996 generates suitable rules `split_t_case' and `split_t_case_asm' (where
4997 t is the name of the datatype).
4999 * Classical reasoner / Simplifier combination: new force_tac (and
5000 derivatives Force_tac, force) combines rewriting and classical
5001 reasoning (and whatever other tools) similarly to auto_tac, but is
5002 aimed to solve the given subgoal completely.
5007 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
5008 and `goalw': the theory is no longer needed as an explicit argument -
5009 the current theory context is used; assumptions are no longer returned
5010 at the ML-level unless one of them starts with ==> or !!; it is
5011 recommended to convert to these new commands using isatool fixgoal
5012 (backup your sources first!);
5014 * new top-level commands 'thm' and 'thms' for retrieving theorems from
5015 the current theory context, and 'theory' to lookup stored theories;
5017 * new theory section 'locale' for declaring constants, assumptions and
5018 definitions that have local scope;
5020 * new theory section 'nonterminals' for purely syntactic types;
5022 * new theory section 'setup' for generic ML setup functions
5023 (e.g. package initialization);
5025 * the distribution now includes Isabelle icons: see
5026 lib/logo/isabelle-{small,tiny}.xpm;
5028 * isatool install - install binaries with absolute references to
5031 * isatool logo -- create instances of the Isabelle logo (as EPS);
5033 * print mode 'emacs' reserved for Isamode;
5035 * support multiple print (ast) translations per constant name;
5037 * theorems involving oracles are now printed with a suffixed [!];
5042 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
5044 * HOL/inductive package reorganized and improved: now supports mutual
5050 oddI "n : EVEN ==> Suc n : ODD"
5051 evenI "n : ODD ==> Suc n : EVEN"
5053 new theorem list "elims" contains an elimination rule for each of the
5054 recursive sets; inductive definitions now handle disjunctive premises
5055 correctly (also ZF);
5057 INCOMPATIBILITIES: requires Inductive as an ancestor; component
5058 "mutual_induct" no longer exists - the induction rule is always
5059 contained in "induct";
5062 * HOL/datatype package re-implemented and greatly improved: now
5063 supports mutually recursive datatypes such as
5066 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
5067 | SUM ('a aexp) ('a aexp)
5068 | DIFF ('a aexp) ('a aexp)
5071 'a bexp = LESS ('a aexp) ('a aexp)
5072 | AND ('a bexp) ('a bexp)
5073 | OR ('a bexp) ('a bexp)
5075 as well as indirectly recursive datatypes such as
5078 ('a, 'b) term = Var 'a
5079 | App 'b ((('a, 'b) term) list)
5081 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
5082 induction on mutually / indirectly recursive datatypes.
5084 Primrec equations are now stored in theory and can be accessed via
5085 <function_name>.simps.
5089 - Theories using datatypes must now have theory Datatype as an
5091 - The specific <typename>.induct_tac no longer exists - use the
5092 generic induct_tac instead.
5093 - natE has been renamed to nat.exhaust - use exhaust_tac
5094 instead of res_inst_tac ... natE. Note that the variable
5095 names in nat.exhaust differ from the names in natE, this
5096 may cause some "fragile" proofs to fail.
5097 - The theorems split_<typename>_case and split_<typename>_case_asm
5098 have been renamed to <typename>.split and <typename>.split_asm.
5099 - Since default sorts of type variables are now handled correctly,
5100 some datatype definitions may have to be annotated with explicit
5102 - Primrec definitions no longer require function name and type
5103 of recursive argument.
5105 Consider using isatool fixdatatype to adapt your theories and proof
5106 scripts to the new package (backup your sources first!).
5109 * HOL/record package: considerably improved implementation; now
5110 includes concrete syntax for record types, terms, updates; theorems
5111 for surjective pairing and splitting !!-bound record variables; proof
5112 support is as follows:
5114 1) standard conversions (selectors or updates applied to record
5115 constructor terms) are part of the standard simpset;
5117 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
5118 made part of standard simpset and claset via addIffs;
5120 3) a tactic for record field splitting (record_split_tac) is part of
5121 the standard claset (addSWrapper);
5123 To get a better idea about these rules you may retrieve them via
5124 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
5125 the name of your record type.
5127 The split tactic 3) conceptually simplifies by the following rule:
5129 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
5131 Thus any record variable that is bound by meta-all will automatically
5132 blow up into some record constructor term, consequently the
5133 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
5134 solve record problems automatically.
5137 * reorganized the main HOL image: HOL/Integ and String loaded by
5138 default; theory Main includes everything;
5140 * automatic simplification of integer sums and comparisons, using cancellation;
5142 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
5144 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
5146 * many new identities for unions, intersections, set difference, etc.;
5148 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
5149 called split_if, split_split, split_sum_case and split_nat_case (to go
5150 with add/delsplits);
5152 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
5153 (?x::unit) = (); this is made part of the default simpset, which COULD
5154 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
5155 'Delsimprocs [unit_eq_proc];' as last resort); also note that
5156 unit_abs_eta_conv is added in order to counter the effect of
5157 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
5160 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
5163 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5164 It and 'sym RS equals0D' are now in the default claset, giving automatic
5165 disjointness reasoning but breaking a few old proofs.
5167 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
5168 to 'converse' from 'inverse' (for compatibility with ZF and some
5171 * HOL/recdef can now declare non-recursive functions, with {} supplied as
5172 the well-founded relation;
5174 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
5175 Compl A. The "Compl" syntax remains available as input syntax for this
5178 * HOL/Update: new theory of function updates:
5179 f(a:=b) == %x. if x=a then b else f x
5180 may also be iterated as in f(a:=b,c:=d,...);
5182 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
5185 - new function list_update written xs[i:=v] that updates the i-th
5186 list position. May also be iterated as in xs[i:=a,j:=b,...].
5187 - new function `upt' written [i..j(] which generates the list
5188 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
5189 bound write [i..j], which is a shorthand for [i..j+1(].
5190 - new lexicographic orderings and corresponding wellfoundedness theorems.
5193 - removed 'pred' (predecessor) function;
5194 - generalized some theorems about n-1;
5195 - many new laws about "div" and "mod";
5196 - new laws about greatest common divisors (see theory ex/Primes);
5198 * HOL/Relation: renamed the relational operator r^-1 "converse"
5199 instead of "inverse";
5201 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
5202 of the multiset ordering;
5204 * directory HOL/Real: a construction of the reals using Dedekind cuts
5205 (not included by default);
5207 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
5209 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
5210 programs, i.e. different program variables may have different types.
5212 * calling (stac rew i) now fails if "rew" has no effect on the goal
5213 [previously, this check worked only if the rewrite rule was unconditional]
5214 Now rew can involve either definitions or equalities (either == or =).
5219 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
5220 only the theorems proved on ZF.ML;
5222 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5223 It and 'sym RS equals0D' are now in the default claset, giving automatic
5224 disjointness reasoning but breaking a few old proofs.
5226 * ZF/Update: new theory of function updates
5227 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
5228 may also be iterated as in f(a:=b,c:=d,...);
5230 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
5232 * calling (stac rew i) now fails if "rew" has no effect on the goal
5233 [previously, this check worked only if the rewrite rule was unconditional]
5234 Now rew can involve either definitions or equalities (either == or =).
5236 * case_tac provided for compatibility with HOL
5237 (like the old excluded_middle_tac, but with subgoals swapped)
5240 *** Internal programming interfaces ***
5242 * Pure: several new basic modules made available for general use, see
5243 also src/Pure/README;
5245 * improved the theory data mechanism to support encapsulation (data
5246 kind name replaced by private Object.kind, acting as authorization
5247 key); new type-safe user interface via functor TheoryDataFun; generic
5248 print_data function becomes basically useless;
5250 * removed global_names compatibility flag -- all theory declarations
5251 are qualified by default;
5253 * module Pure/Syntax now offers quote / antiquote translation
5254 functions (useful for Hoare logic etc. with implicit dependencies);
5255 see HOL/ex/Antiquote for an example use;
5257 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
5260 * new tactical CHANGED_GOAL for checking that a tactic modifies a
5263 * Display.print_goals function moved to Locale.print_goals;
5265 * standard print function for goals supports current_goals_markers
5266 variable for marking begin of proof, end of proof, start of goal; the
5267 default is ("", "", ""); setting current_goals_markers := ("<proof>",
5268 "</proof>", "<goal>") causes SGML like tagged proof state printing,
5273 New in Isabelle98 (January 1998)
5274 --------------------------------
5276 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5278 * changed lexical syntax of terms / types: dots made part of long
5279 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
5281 * simpset (and claset) reference variable replaced by functions
5282 simpset / simpset_ref;
5284 * no longer supports theory aliases (via merge) and non-trivial
5285 implicit merge of thms' signatures;
5287 * most internal names of constants changed due to qualified names;
5289 * changed Pure/Sequence interface (see Pure/seq.ML);
5292 *** General Changes ***
5294 * hierachically structured name spaces (for consts, types, axms, thms
5295 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
5296 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
5297 isatool fixdots ensures space after dots (e.g. "%x. x"); set
5298 long_names for fully qualified output names; NOTE: ML programs
5299 (special tactics, packages etc.) referring to internal names may have
5300 to be adapted to cope with fully qualified names; in case of severe
5301 backward campatibility problems try setting 'global_names' at compile
5302 time to have enrything declared within a flat name space; one may also
5303 fine tune name declarations in theories via the 'global' and 'local'
5306 * reimplemented the implicit simpset and claset using the new anytype
5307 data filed in signatures; references simpset:simpset ref etc. are
5308 replaced by functions simpset:unit->simpset and
5309 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
5310 to patch your ML files accordingly;
5312 * HTML output now includes theory graph data for display with Java
5313 applet or isatool browser; data generated automatically via isatool
5314 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
5316 * defs may now be conditional; improved rewrite_goals_tac to handle
5317 conditional equations;
5319 * defs now admits additional type arguments, using TYPE('a) syntax;
5321 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
5322 creates a new theory node; implicit merge of thms' signatures is
5323 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
5324 transfer:theory->thm->thm in (rare) cases;
5326 * improved handling of draft signatures / theories; draft thms (and
5327 ctyps, cterms) are automatically promoted to real ones;
5329 * slightly changed interfaces for oracles: admit many per theory, named
5330 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
5332 * print_goals: optional output of const types (set show_consts and
5335 * improved output of warnings (###) and errors (***);
5337 * subgoal_tac displays a warning if the new subgoal has type variables;
5339 * removed old README and Makefiles;
5341 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
5343 * removed obsolete init_pps and init_database;
5345 * deleted the obsolete tactical STATE, which was declared by
5346 fun STATE tacfun st = tacfun st st;
5348 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
5349 (which abbreviates $HOME);
5351 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
5352 use isatool fixseq to adapt your ML programs (this works for fully
5353 qualified references to the Sequence structure only!);
5355 * use_thy no longer requires writable current directory; it always
5356 reloads .ML *and* .thy file, if either one is out of date;
5359 *** Classical Reasoner ***
5361 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
5362 tactics that use classical reasoning to simplify a subgoal without
5363 splitting it into several subgoals;
5365 * Safe_tac: like safe_tac but uses the default claset;
5370 * added simplification meta rules:
5371 (asm_)(full_)simplify: simpset -> thm -> thm;
5373 * simplifier.ML no longer part of Pure -- has to be loaded by object
5376 * added prems argument to simplification procedures;
5378 * HOL, FOL, ZF: added infix function `addsplits':
5379 instead of `<simpset> setloop (split_tac <thms>)'
5380 you can simply write `<simpset> addsplits <thms>'
5385 * TYPE('a) syntax for type reflection terms;
5387 * no longer handles consts with name "" -- declare as 'syntax' instead;
5389 * pretty printer: changed order of mixfix annotation preference (again!);
5391 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
5396 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
5397 with `addloop' of the simplifier to faciliate case splitting in premises.
5399 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
5401 * HOL/Auth: new protocol proofs including some for the Internet
5404 * HOL/Map: new theory of `maps' a la VDM;
5406 * HOL/simplifier: simplification procedures nat_cancel_sums for
5407 cancelling out common nat summands from =, <, <= (in)equalities, or
5408 differences; simplification procedures nat_cancel_factor for
5409 cancelling common factor from =, <, <= (in)equalities over natural
5410 sums; nat_cancel contains both kinds of procedures, it is installed by
5411 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
5413 * HOL/simplifier: terms of the form
5414 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
5416 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
5417 and those of the form
5418 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
5420 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
5423 Each datatype `t' now comes with a theorem `split_t_case' of the form
5425 P(t_case f1 ... fn x) =
5426 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
5428 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
5431 and a theorem `split_t_case_asm' of the form
5433 P(t_case f1 ... fn x) =
5434 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
5436 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
5438 which can be added to a simpset via `addsplits'. The existing theorems
5439 expand_list_case and expand_option_case have been renamed to
5440 split_list_case and split_option_case.
5443 - `pred n' is automatically converted to `n-1'.
5444 Users are strongly encouraged not to use `pred' any longer,
5445 because it will disappear altogether at some point.
5446 - Users are strongly encouraged to write "0 < n" rather than
5447 "n ~= 0". Theorems and proof tools have been modified towards this
5451 the function "set_of_list" has been renamed "set" (and its theorems too);
5452 the function "nth" now takes its arguments in the reverse order and
5453 has acquired the infix notation "!" as in "xs!n".
5455 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
5457 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
5458 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
5460 * HOL/record: extensible records with schematic structural subtyping
5461 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
5462 still lacks various theorems and concrete record syntax;
5467 * removed "axioms" and "generated by" sections;
5469 * replaced "ops" section by extended "consts" section, which is capable of
5470 handling the continuous function space "->" directly;
5473 . proves theorems immediately and stores them in the theory,
5474 . creates hierachical name space,
5475 . now uses normal mixfix annotations (instead of cinfix...),
5476 . minor changes to some names and values (for consistency),
5477 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
5478 . separator between mutual domain defs: changed "," to "and",
5479 . improved handling of sort constraints; now they have to
5480 appear on the left-hand side of the equations only;
5482 * fixed LAM <x,y,zs>.b syntax;
5484 * added extended adm_tac to simplifier in HOLCF -- can now discharge
5485 adm (%x. P (t x)), where P is chainfinite and t continuous;
5490 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
5491 with `addloop' of the simplifier to faciliate case splitting in premises.
5493 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
5494 in HOL, they strip ALL and --> from proved theorems;
5498 New in Isabelle94-8 (May 1997)
5499 ------------------------------
5501 *** General Changes ***
5503 * new utilities to build / run / maintain Isabelle etc. (in parts
5504 still somewhat experimental); old Makefiles etc. still functional;
5506 * new 'Isabelle System Manual';
5508 * INSTALL text, together with ./configure and ./build scripts;
5510 * reimplemented type inference for greater efficiency, better error
5511 messages and clean internal interface;
5513 * prlim command for dealing with lots of subgoals (an easier way of
5514 setting goals_limit);
5519 * supports alternative (named) syntax tables (parser and pretty
5520 printer); internal interface is provided by add_modesyntax(_i);
5522 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
5523 be used in conjunction with the Isabelle symbol font; uses the
5524 "symbols" syntax table;
5526 * added token_translation interface (may translate name tokens in
5527 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
5528 the current print_mode); IMPORTANT: user print translation functions
5529 are responsible for marking newly introduced bounds
5530 (Syntax.mark_boundT);
5532 * token translations for modes "xterm" and "xterm_color" that display
5533 names in bold, underline etc. or colors (which requires a color
5536 * infixes may now be declared with names independent of their syntax;
5538 * added typed_print_translation (like print_translation, but may
5539 access type of constant);
5542 *** Classical Reasoner ***
5544 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
5545 some limitations. Blast_tac...
5546 + ignores addss, addbefore, addafter; this restriction is intrinsic
5547 + ignores elimination rules that don't have the correct format
5548 (the conclusion MUST be a formula variable)
5549 + ignores types, which can make HOL proofs fail
5550 + rules must not require higher-order unification, e.g. apply_type in ZF
5551 [message "Function Var's argument not a bound variable" relates to this]
5552 + its proof strategy is more general but can actually be slower
5554 * substitution with equality assumptions no longer permutes other
5557 * minor changes in semantics of addafter (now called addaltern); renamed
5558 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
5559 (and access functions for it);
5561 * improved combination of classical reasoner and simplifier:
5562 + functions for handling clasimpsets
5563 + improvement of addss: now the simplifier is called _after_ the
5565 + safe variant of addss called addSss: uses safe simplifications
5566 _during_ the safe steps. It is more complete as it allows multiple
5567 instantiations of unknowns (e.g. with slow_tac).
5571 * added interface for simplification procedures (functions that
5572 produce *proven* rewrite rules on the fly, depending on current
5575 * ordering on terms as parameter (used for ordered rewriting);
5577 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
5579 * the solver is now split into a safe and an unsafe part.
5580 This should be invisible for the normal user, except that the
5581 functions setsolver and addsolver have been renamed to setSolver and
5582 addSolver; added safe_asm_full_simp_tac;
5587 * a generic induction tactic `induct_tac' which works for all datatypes and
5588 also for type `nat';
5590 * a generic case distinction tactic `exhaust_tac' which works for all
5591 datatypes and also for type `nat';
5593 * each datatype comes with a function `size';
5595 * patterns in case expressions allow tuple patterns as arguments to
5596 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
5598 * primrec now also works with type nat;
5600 * recdef: a new declaration form, allows general recursive functions to be
5601 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
5603 * the constant for negation has been renamed from "not" to "Not" to
5604 harmonize with FOL, ZF, LK, etc.;
5606 * HOL/ex/LFilter theory of a corecursive "filter" functional for
5609 * HOL/Modelcheck demonstrates invocation of model checker oracle;
5611 * HOL/ex/Ring.thy declares cring_simp, which solves equational
5612 problems in commutative rings, using axiomatic type classes for + and *;
5614 * more examples in HOL/MiniML and HOL/Auth;
5616 * more default rewrite rules for quantifiers, union/intersection;
5618 * a new constant `arbitrary == @x.False';
5620 * HOLCF/IOA replaces old HOL/IOA;
5622 * HOLCF changes: derived all rules and arities
5623 + axiomatic type classes instead of classes
5624 + typedef instead of faking type definitions
5625 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
5626 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
5627 + eliminated the types void, one, tr
5628 + use unit lift and bool lift (with translations) instead of one and tr
5629 + eliminated blift from Lift3.thy (use Def instead of blift)
5630 all eliminated rules are derived as theorems --> no visible changes ;
5635 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
5636 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
5637 as ZF_cs addSIs [equalityI];
5641 New in Isabelle94-7 (November 96)
5642 ---------------------------------
5644 * allowing negative levels (as offsets) in prlev and choplev;
5646 * super-linear speedup for large simplifications;
5648 * FOL, ZF and HOL now use miniscoping: rewriting pushes
5649 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
5650 FAIL); can suppress it using the command Delsimps (ex_simps @
5651 all_simps); De Morgan laws are also now included, by default;
5653 * improved printing of ==> : ~:
5655 * new object-logic "Sequents" adds linear logic, while replacing LK
5656 and Modal (thanks to Sara Kalvala);
5658 * HOL/Auth: correctness proofs for authentication protocols;
5660 * HOL: new auto_tac combines rewriting and classical reasoning (many
5661 examples on HOL/Auth);
5663 * HOL: new command AddIffs for declaring theorems of the form P=Q to
5664 the rewriter and classical reasoner simultaneously;
5666 * function uresult no longer returns theorems in "standard" format;
5667 regain previous version by: val uresult = standard o uresult;
5674 * oracles -- these establish an interface between Isabelle and trusted
5675 external reasoners, which may deliver results as theorems;
5677 * proof objects (in particular record all uses of oracles);
5679 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
5681 * "constdefs" section in theory files;
5683 * "primrec" section (HOL) no longer requires names;
5685 * internal type "tactic" now simply "thm -> thm Sequence.seq";
5692 * reduced space requirements;
5694 * automatic HTML generation from theories;
5696 * theory files no longer require "..." (quotes) around most types;
5698 * new examples, including two proofs of the Church-Rosser theorem;
5700 * non-curried (1994) version of HOL is no longer distributed;
5707 * greatly reduced space requirements;
5709 * theory files (.thy) no longer require \...\ escapes at line breaks;
5711 * searchable theorem database (see the section "Retrieving theorems" on
5712 page 8 of the Reference Manual);
5714 * new examples, including Grabczewski's monumental case study of the
5717 * The previous version of HOL renamed to Old_HOL;
5719 * The new version of HOL (previously called CHOL) uses a curried syntax
5720 for functions. Application looks like f a b instead of f(a,b);
5722 * Mutually recursive inductive definitions finally work in HOL;
5724 * In ZF, pattern-matching on tuples is now available in all abstractions and
5725 translates to the operator "split";
5732 * new infix operator, addss, allowing the classical reasoner to
5733 perform simplification at each step of its search. Example:
5734 fast_tac (cs addss ss)
5736 * a new logic, CHOL, the same as HOL, but with a curried syntax
5737 for functions. Application looks like f a b instead of f(a,b). Also pairs
5738 look like (a,b) instead of <a,b>;
5740 * PLEASE NOTE: CHOL will eventually replace HOL!
5742 * In CHOL, pattern-matching on tuples is now available in all abstractions.
5743 It translates to the operator "split". A new theory of integers is available;
5745 * In ZF, integer numerals now denote two's-complement binary integers.
5746 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
5748 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
5749 of the Axiom of Choice;
5756 * Significantly faster resolution;
5758 * the different sections in a .thy file can now be mixed and repeated
5761 * Database of theorems for FOL, HOL and ZF. New
5762 commands including qed, qed_goal and bind_thm store theorems in the database.
5764 * Simple database queries: return a named theorem (get_thm) or all theorems of
5765 a given theory (thms_of), or find out what theory a theorem was proved in
5768 * Bugs fixed in the inductive definition and datatype packages;
5770 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
5771 and HOL_dup_cs obsolete;
5773 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
5776 * Simpler definition of function space in ZF;
5778 * new results about cardinal and ordinal arithmetic in ZF;
5780 * 'subtype' facility in HOL for introducing new types as subsets of existing
5783 :mode=text:wrap=hard:maxLineLen=72: