The metis method now fails in the usual manner, rather than raising an exception,
if it determines that it cannot prove the theorem.
1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Generalized Isar history, with support for linear undo, direct state
12 * Recovered hiding of consts, which was accidentally broken in
13 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
14 makes c inaccessible; consider using ``hide (open) const c'' instead.
16 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
22 * Changed defaults for unify configuration options:
24 unify_trace_bound = 50 (formerly 25)
25 unify_search_bound = 60 (formerly 30)
27 * Different bookkeeping for code equations:
28 a) On theory merge, the last set of code equations for a particular constant
29 is taken (in accordance with the policy applied by other parts of the
30 code generator framework).
31 b) Code equations stemming from explicit declarations (e.g. code attribute)
32 gain priority over default code equations stemming from definition, primrec,
36 * Global versions of theorems stemming from classes do not carry
37 a parameter prefix any longer. INCOMPATIBILITY.
39 * Dropped "locale (open)". INCOMPATBILITY.
41 * Interpretation commands no longer attempt to simplify goal.
42 INCOMPATIBILITY: in rare situations the generated goal differs. Use
43 methods intro_locales and unfold_locales to clarify.
45 * Interpretation commands no longer accept interpretation attributes.
48 * Command 'instance': attached definitions no longer accepted.
49 INCOMPATIBILITY, use proper 'instantiation' target.
51 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
53 * The 'axiomatization' command now only works within a global theory
54 context. INCOMPATIBILITY.
57 *** Document preparation ***
59 * Antiquotation @{lemma} now imitates a regular terminal proof,
60 demanding keyword 'by' and supporting the full method expression
61 syntax just like the Isar command 'by'.
66 * HOL/Main: command "value" now integrates different evaluation mechanisms.
67 The result of the first successful evaluation mechanism is printed.
68 In square brackets a particular named evaluation mechanisms may be specified
69 (currently, [SML], [code] or [nbe]). See further HOL/ex/Eval_Examples.thy.
71 * HOL/Orderings: class "wellorder" moved here, with explicit induction
72 rule "less_induct" as assumption. For instantiation of "wellorder" by
73 means of predicate "wf", use rule wf_wellorderI. INCOMPATIBILITY.
75 * HOL/Orderings: added class "preorder" as superclass of "order".
76 INCOMPATIBILITY: Instantiation proofs for order, linorder
77 etc. slightly changed. Some theorems named order_class.* now named
80 * HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been
81 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
82 dvd has been generalized to class comm_semiring_1. Likewise a bunch
83 of lemmas from Divides has been generalized from nat to class
84 semiring_div. INCOMPATIBILITY. This involves the following theorem
85 renames resulting from duplicate elimination:
87 dvd_def_mod ~> dvd_eq_mod_eq_0
88 zero_dvd_iff ~> dvd_0_left_iff
89 DIVISION_BY_ZERO_DIV ~> div_by_0
90 DIVISION_BY_ZERO_MOD ~> mod_by_0
91 mult_div ~> div_mult_self2_is_id
92 mult_mod ~> mod_mult_self2_is_0
94 * HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
95 zlcm (for int); carried together from various gcd/lcm developements in
96 the HOL Distribution. zgcd and zlcm replace former igcd and ilcm;
97 corresponding theorems renamed accordingly. INCOMPATIBILY. To
98 recover tupled syntax, use syntax declarations like:
100 hide (open) const gcd
101 abbreviation gcd where
102 "gcd == (%(a, b). GCD.gcd a b)"
104 GCD.gcd ("gcd '(_, _')")
106 (analogously for lcm, zgcd, zlcm).
108 * HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
110 * New ML antiquotation @{code}: takes constant as argument, generates
111 corresponding code in background and inserts name of the corresponding
112 resulting ML value/function/datatype constructor binding in place.
113 All occurrences of @{code} with a single ML block are generated
114 simultaneously. Provides a generic and safe interface for
115 instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy
116 example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious
117 application. In future you ought refrain from ad-hoc compiling
118 generated SML code on the ML toplevel. Note that (for technical
119 reasons) @{code} cannot refer to constants for which user-defined
120 serializations are set. Refer to the corresponding ML counterpart
121 directly in that cases.
123 * Integrated image HOL-Complex with HOL. Entry points Main.thy and
124 Complex_Main.thy remain as they are.
126 * New image HOL-Plain provides a minimal HOL with the most important
127 tools available (inductive, datatype, primrec, ...). By convention
128 the corresponding theory Plain should be ancestor of every further
129 (library) theory. Some library theories now have ancestor Plain
130 (instead of Main), thus theory Main occasionally has to be imported
133 * The metis method now fails in the usual manner, rather than raising an exception,
134 if it determines that it cannot prove the theorem.
136 * Methods "case_tac" and "induct_tac" now refer to the very same rules
137 as the structured Isar versions "cases" and "induct", cf. the
138 corresponding "cases" and "induct" attributes. Mutual induction rules
139 are now presented as a list of individual projections
140 (e.g. foo_bar.inducts for types foo and bar); the old format with
141 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
142 rare situations a different rule is selected --- notably nested tuple
143 elimination instead of former prod.exhaust: use explicit (case_tac t
144 rule: prod.exhaust) here.
146 * Attributes "cases", "induct", "coinduct" support "del" option.
148 * Removed fact "case_split_thm", which duplicates "case_split".
150 * Command 'rep_datatype': instead of theorem names the command now
151 takes a list of terms denoting the constructors of the type to be
152 represented as datatype. The characteristic theorems have to be
153 proven. INCOMPATIBILITY. Also observe that the following theorems
154 have disappeared in favour of existing ones:
156 unit_induct ~> unit.induct
157 prod_induct ~> prod.induct
158 sum_induct ~> sum.induct
159 Suc_Suc_eq ~> nat.inject
160 Suc_not_Zero Zero_not_Suc ~> nat.distinct
162 * Library/Nat_Infinity: added addition, numeral syntax and more
163 instantiations for algebraic structures. Removed some duplicate
164 theorems. Changes in simp rules. INCOMPATIBILITY.
166 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
172 * New locales for orders and lattices where the equivalence relation
173 is not restricted to equality. INCOMPATIBILITY: all order and
174 lattice locales use a record structure with field eq for the
177 * New theory of factorial domains.
179 * Units_l_inv and Units_r_inv are now simprules by default.
180 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
181 and/or r_inv will now also require deletion of these lemmas.
183 * Renamed the following theorems. INCOMPATIBILITY.
186 least_carrier ~> least_closed
187 greatest_carrier ~> greatest_closed
188 greatest_Lower_above ~> greatest_Lower_below
189 one_zero ~> carrier_one_zero
190 one_not_zero ~> carrier_one_not_zero (collision with assumption)
195 * Created new image HOL-NSA, containing theories of nonstandard
196 analysis which were previously part of HOL-Complex. Entry point
197 Hyperreal.thy remains valid, but theories formerly using
198 Complex_Main.thy should now use new entry point Hypercomplex.thy.
203 * Proof of Zorn's Lemma for partial orders.
208 * Generic Toplevel.add_hook interface allows to analyze the result of
209 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
210 for theorem dependency output of transactions resulting in a new
213 * Name bindings in higher specification mechanisms (notably
214 LocalTheory.define, LocalTheory.note, and derived packages) are now
215 formalized as type Name.binding, replacing old bstring.
216 INCOMPATIBILITY, need to wrap strings via Name.binding function, see
217 also Name.name_of. Packages should pass name bindings given by the
218 user to underlying specification mechanisms; this enables precise
219 tracking of source positions, for example.
221 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
222 LocalTheory.note etc.) now refer to the *full* internal name, not the
223 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
225 * Rules and tactics that read instantiations (read_instantiate,
226 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
227 context, which is required for parsing and type-checking. Moreover,
228 the variables are specified as plain indexnames, not string encodings
229 thereof. INCOMPATIBILITY.
231 * Disposed old type and term read functions (Sign.read_def_typ,
232 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
233 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
234 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
235 Syntax.read_term_global etc.; see also OldGoals.read_term as last
236 resort for legacy applications.
238 * Antiquotations: block-structured compilation context indicated by
239 \<lbrace> ... \<rbrace>; additional antiquotation forms:
241 @{let ?pat = term} - term abbreviation (HO matching)
242 @{note name = fact} - fact abbreviation
243 @{thm fact} - singleton fact (with attributes)
244 @{thms fact} - general fact (with attributes)
245 @{lemma prop by method} - singleton goal
246 @{lemma prop by meth1 meth2} - singleton goal
247 @{lemma prop1 ... propN by method} - general goal
248 @{lemma prop1 ... propN by meth1 meth2} - general goal
249 @{lemma (open) ...} - open derivation
254 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
255 the Isabelle process into a JVM/Scala application. See
256 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
257 process wrapper has been discontinued.)
259 * Status messages (with exact source position information) are
260 emitted, if proper markup print mode is enabled. This allows
261 user-interface components to provide detailed feedback on internal
264 * Homegrown Isabelle font with unicode layout, see Isabelle/lib/fonts.
268 New in Isabelle2008 (June 2008)
269 -------------------------------
273 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
274 and updated, with formally checked references as hyperlinks.
276 * Theory loader: use_thy (and similar operations) no longer set the
277 implicit ML context, which was occasionally hard to predict and in
278 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
279 provides a proper context already.
281 * Theory loader: old-style ML proof scripts being *attached* to a thy
282 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
283 'use' within a theory file will do the job.
285 * Name space merge now observes canonical order, i.e. the second space
286 is inserted into the first one, while existing entries in the first
287 space take precedence. INCOMPATIBILITY in rare situations, may try to
290 * Syntax: symbol \<chi> is now considered a letter. Potential
291 INCOMPATIBILITY in identifier syntax etc.
293 * Outer syntax: string tokens no longer admit escaped white space,
294 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
295 white space without escapes.
297 * Outer syntax: string tokens may contain arbitrary character codes
298 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
304 * Context-dependent token translations. Default setup reverts locally
305 fixed variables, and adds hilite markup for undeclared frees.
307 * Unused theorems can be found using the new command 'unused_thms'.
308 There are three ways of invoking it:
311 Only finds unused theorems in the current theory.
313 (2) unused_thms thy_1 ... thy_n -
314 Finds unused theorems in the current theory and all of its ancestors,
315 excluding the theories thy_1 ... thy_n and all of their ancestors.
317 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
318 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
319 their ancestors, excluding the theories thy_1 ... thy_n and all of
322 In order to increase the readability of the list produced by
323 unused_thms, theorems that have been created by a particular instance
324 of a theory command such as 'inductive' or 'function' are considered
325 to belong to the same "group", meaning that if at least one theorem in
326 this group is used, the other theorems in the same group are no longer
327 reported as unused. Moreover, if all theorems in the group are
328 unused, only one theorem in the group is displayed.
330 Note that proof objects have to be switched on in order for
331 unused_thms to work properly (i.e. !proofs must be >= 1, which is
332 usually the case when using Proof General with the default settings).
334 * Authentic naming of facts disallows ad-hoc overwriting of previous
335 theorems within the same name space. INCOMPATIBILITY, need to remove
336 duplicate fact bindings, or even accidental fact duplications. Note
337 that tools may maintain dynamically scoped facts systematically, using
338 PureThy.add_thms_dynamic.
340 * Command 'hide' now allows to hide from "fact" name space as well.
342 * Eliminated destructive theorem database, simpset, claset, and
343 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
344 update of theories within ML code.
346 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
347 INCOMPATIBILITY, object-logics depending on former Pure require
348 additional setup PureThy.old_appl_syntax_setup; object-logics
349 depending on former CPure need to refer to Pure.
351 * Commands 'use' and 'ML' are now purely functional, operating on
352 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
353 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
356 * Command 'setup': discontinued implicit version with ML reference.
358 * Instantiation target allows for simultaneous specification of class
359 instance operations together with an instantiation proof.
360 Type-checking phase allows to refer to class operations uniformly.
361 See src/HOL/Complex/Complex.thy for an Isar example and
362 src/HOL/Library/Eval.thy for an ML example.
364 * Indexing of literal facts: be more serious about including only
365 facts from the visible specification/proof context, but not the
366 background context (locale etc.). Affects `prop` notation and method
367 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
370 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
371 "(open)" option, which used to expose internal bound variables to the
374 * Isar statements: removed obsolete case "rule_context".
375 INCOMPATIBILITY, better use explicit fixes/assumes.
377 * Locale proofs: default proof step now includes 'unfold_locales';
378 hence 'proof' without argument may be used to unfold locale
382 *** Document preparation ***
384 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
385 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
386 obsolete thumbpdf setup (contemporary PDF viewers do this on the
387 spot); renamed link color from "darkblue" to "linkcolor" (default
388 value unchanged, can be redefined via \definecolor); no longer sets
389 "a4paper" option (unnecessary or even intrusive).
391 * Antiquotation @{lemma A method} proves proposition A by the given
392 method (either a method name or a method name plus (optional) method
393 arguments in parentheses) and prints A just like @{prop A}.
398 * New primrec package. Specification syntax conforms in style to
399 definition/function/.... No separate induction rule is provided. The
400 "primrec" command distinguishes old-style and new-style specifications
401 by syntax. The former primrec package is now named OldPrimrecPackage.
402 When adjusting theories, beware: constants stemming from new-style
403 primrec specifications have authentic syntax.
405 * Metis prover is now an order of magnitude faster, and also works
408 * Metis: the maximum number of clauses that can be produced from a
409 theorem is now given by the attribute max_clauses. Theorems that
410 exceed this number are ignored, with a warning printed.
412 * Sledgehammer no longer produces structured proofs by default. To
413 enable, declare [[sledgehammer_full = true]]. Attributes
414 reconstruction_modulus, reconstruction_sorts renamed
415 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
417 * Method "induct_scheme" derives user-specified induction rules
418 from well-founded induction and completeness of patterns. This factors
419 out some operations that are done internally by the function package
420 and makes them available separately. See
421 src/HOL/ex/Induction_Scheme.thy for examples.
423 * More flexible generation of measure functions for termination
424 proofs: Measure functions can be declared by proving a rule of the
425 form "is_measure f" and giving it the [measure_function] attribute.
426 The "is_measure" predicate is logically meaningless (always true), and
427 just guides the heuristic. To find suitable measure functions, the
428 termination prover sets up the goal "is_measure ?f" of the appropriate
429 type and generates all solutions by prolog-style backwards proof using
432 This setup also deals with rules like
434 "is_measure f ==> is_measure (list_size f)"
436 which accommodates nested datatypes that recurse through lists.
437 Similar rules are predeclared for products and option types.
439 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
443 - Definitions of overloaded constants on sets have to be replaced by
444 definitions on => and bool.
446 - Some definitions of overloaded operators on sets can now be proved
447 using the definitions of the operators on => and bool. Therefore,
448 the following theorems have been renamed:
450 subset_def -> subset_eq
451 psubset_def -> psubset_eq
452 set_diff_def -> set_diff_eq
453 Compl_def -> Compl_eq
454 Sup_set_def -> Sup_set_eq
455 Inf_set_def -> Inf_set_eq
456 sup_set_def -> sup_set_eq
457 inf_set_def -> inf_set_eq
459 - Due to the incompleteness of the HO unification algorithm, some
460 rules such as subst may require manual instantiation, if some of
461 the unknowns in the rule is a set.
463 - Higher order unification and forward proofs:
466 have "P (S::'a set)" <...>
467 then have "EX S. P S" ..
469 no longer works (due to the incompleteness of the HO unification
470 algorithm) and must be replaced by the pattern
477 - Calculational reasoning with subst (or similar rules):
480 have "P (S::'a set)" <...>
481 also have "S = T" <...>
484 no longer works (for similar reasons as the previous example) and
485 must be replaced by something like
487 have "P (S::'a set)" <...>
488 moreover have "S = T" <...>
489 ultimately have "P T" by simp
491 - Tactics or packages written in ML code:
492 Code performing pattern matching on types via
494 Type ("set", [T]) => ...
496 must be rewritten. Moreover, functions like strip_type or
497 binder_types no longer return the right value when applied to a
500 T1 => ... => Tn => U => bool
504 T1 => ... => Tn => U set
506 * Merged theories Wellfounded_Recursion, Accessible_Part and
507 Wellfounded_Relations to theory Wellfounded.
509 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
511 * Class finite no longer treats UNIV as class parameter. Use class
512 enum from theory Library/Enum instead to achieve a similar effect.
515 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
516 and "Cons". INCOMPATIBILITY.
518 * HOL (and FOL): renamed variables in rules imp_elim and swap.
519 Potential INCOMPATIBILITY.
521 * Theory Product_Type: duplicated lemmas split_Pair_apply and
522 injective_fst_snd removed, use split_eta and prod_eqI instead.
523 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
525 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
526 the same name in theory Orderings:
536 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
537 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
538 and different variable names.
540 * Library/Option_ord.thy: Canonical order on option type.
542 * Library/RBT.thy: Red-black trees, an efficient implementation of
545 * Library/Countable.thy: Type class for countable types.
547 * Theory Int: The representation of numerals has changed. The infix
548 operator BIT and the bit datatype with constructors B0 and B1 have
549 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
550 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
551 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
554 * Theory Nat: definition of <= and < on natural numbers no longer
555 depend on well-founded relations. INCOMPATIBILITY. Definitions
556 le_def and less_def have disappeared. Consider lemmas not_less
557 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
559 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
560 (whose purpose mainly is for various fold_set functionals) have been
561 abandoned in favor of the existing algebraic classes
562 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
563 lower_semilattice (resp. upper_semilattice) and linorder.
566 * Theory Transitive_Closure: induct and cases rules now declare proper
567 case_names ("base" and "step"). INCOMPATIBILITY.
569 * Theorem Inductive.lfp_ordinal_induct generalized to complete
570 lattices. The form set-specific version is available as
571 Inductive.lfp_ordinal_induct_set.
573 * Renamed theorems "power.simps" to "power_int.simps".
576 * Class semiring_div provides basic abstract properties of semirings
577 with division and modulo operations. Subsumes former class dvd_mod.
579 * Merged theories IntDef, Numeral and IntArith into unified theory
580 Int. INCOMPATIBILITY.
582 * Theory Library/Code_Index: type "index" now represents natural
583 numbers rather than integers. INCOMPATIBILITY.
585 * New class "uminus" with operation "uminus" (split of from class
586 "minus" which now only has operation "minus", binary).
589 * Constants "card", "internal_split", "option_map" now with authentic
590 syntax. INCOMPATIBILITY.
592 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
593 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
594 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
595 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
596 Sup_set_def, le_def, less_def, option_map_def now with object
597 equality. INCOMPATIBILITY.
599 * Records. Removed K_record, and replaced it by pure lambda term
600 %x. c. The simplifier setup is now more robust against eta expansion.
601 INCOMPATIBILITY: in cases explicitly referring to K_record.
603 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
605 * Library/ListVector: new theory of arithmetic vector operations.
607 * Library/Order_Relation: new theory of various orderings as sets of
608 pairs. Defines preorders, partial orders, linear orders and
609 well-orders on sets and on types.
614 * Renamed some theories to allow to loading both ZF and HOL in the
617 Datatype -> Datatype_ZF
618 Inductive -> Inductive_ZF
625 INCOMPATIBILITY: ZF theories that import individual theories below
626 Main might need to be adapted. Regular theory Main is still
627 available, as trivial extension of Main_ZF.
632 * ML within Isar: antiquotation @{const name} or @{const
633 name(typargs)} produces statically-checked Const term.
635 * Functor NamedThmsFun: data is available to the user as dynamic fact
636 (of the same name). Removed obsolete print command.
638 * Removed obsolete "use_legacy_bindings" function.
640 * The ``print mode'' is now a thread-local value derived from a global
641 template (the former print_mode reference), thus access becomes
642 non-critical. The global print_mode reference is for session
643 management only; user-code should use print_mode_value,
644 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
646 * Functions system/system_out provide a robust way to invoke external
647 shell commands, with propagation of interrupts (requires Poly/ML 5.2).
648 Do not use OS.Process.system etc. from the basis library!
653 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
654 in accordance with Proof General 3.7, which prefers GNU emacs.
656 * isatool tty runs Isabelle process with plain tty interaction;
657 optional line editor may be specified via ISABELLE_LINE_EDITOR
658 setting, the default settings attempt to locate "ledit" and "rlwrap".
660 * isatool browser now works with Cygwin as well, using general
661 "javapath" function defined in Isabelle process environment.
663 * YXML notation provides a simple and efficient alternative to
664 standard XML transfer syntax. See src/Pure/General/yxml.ML and
665 isatool yxml as described in the Isabelle system manual.
667 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
668 provides general wrapper for managing an Isabelle process in a robust
669 fashion, with ``cooked'' output from stdin/stderr.
671 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
672 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
674 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
675 way of changing the user's settings is via
676 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
679 * Multithreading.max_threads := 0 refers to the number of actual CPU
680 cores of the underlying machine, which is a good starting point for
681 optimal performance tuning. The corresponding usedir option -M allows
682 "max" as an alias for "0". WARNING: does not work on certain versions
683 of Mac OS (with Poly/ML 5.1).
685 * isabelle-process: non-ML sessions are run with "nice", to reduce the
686 adverse effect of Isabelle flooding interactive front-ends (notably
687 ProofGeneral / XEmacs).
691 New in Isabelle2007 (November 2007)
692 -----------------------------------
696 * More uniform information about legacy features, notably a
697 warning/error of "Legacy feature: ...", depending on the state of the
698 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
699 legacy features will disappear eventually.
701 * Theory syntax: the header format ``theory A = B + C:'' has been
702 discontinued in favour of ``theory A imports B C begin''. Use isatool
703 fixheaders to convert existing theory files. INCOMPATIBILITY.
705 * Theory syntax: the old non-Isar theory file format has been
706 discontinued altogether. Note that ML proof scripts may still be used
707 with Isar theories; migration is usually quite simple with the ML
708 function use_legacy_bindings. INCOMPATIBILITY.
710 * Theory syntax: some popular names (e.g. 'class', 'declaration',
711 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
714 * Theory loader: be more serious about observing the static theory
715 header specifications (including optional directories), but not the
716 accidental file locations of previously successful loads. The strict
717 update policy of former update_thy is now already performed by
718 use_thy, so the former has been removed; use_thys updates several
719 theories simultaneously, just as 'imports' within a theory header
720 specification, but without merging the results. Potential
721 INCOMPATIBILITY: may need to refine theory headers and commands
722 ROOT.ML which depend on load order.
724 * Theory loader: optional support for content-based file
725 identification, instead of the traditional scheme of full physical
726 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
727 (cf. the system manual). The new scheme allows to work with
728 non-finished theories in persistent session images, such that source
729 files may be moved later on without requiring reloads.
731 * Theory loader: old-style ML proof scripts being *attached* to a thy
732 file (with the same base name as the theory) are considered a legacy
733 feature, which will disappear eventually. Even now, the theory loader
734 no longer maintains dependencies on such files.
736 * Syntax: the scope for resolving ambiguities via type-inference is
737 now limited to individual terms, instead of whole simultaneous
738 specifications as before. This greatly reduces the complexity of the
739 syntax module and improves flexibility by separating parsing and
740 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
741 'fixes' etc.) are required in rare situations.
743 * Syntax: constants introduced by new-style packages ('definition',
744 'abbreviation' etc.) are passed through the syntax module in
745 ``authentic mode''. This means that associated mixfix annotations
746 really stick to such constants, independently of potential name space
747 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
748 trees are represented slightly differently, may need to adapt syntax
749 translations accordingly. Use CONST marker in 'translations' and
750 @{const_syntax} antiquotation in 'parse_translation' etc.
752 * Legacy goal package: reduced interface to the bare minimum required
753 to keep existing proof scripts running. Most other user-level
754 functions are now part of the OldGoals structure, which is *not* open
755 by default (consider isatool expandshort before open OldGoals).
756 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
757 these tend to cause confusion about the actual goal (!) context being
758 used here, which is not necessarily the same as the_context().
760 * Command 'find_theorems': supports "*" wild-card in "name:"
761 criterion; "with_dups" option. Certain ProofGeneral versions might
762 support a specific search form (see ProofGeneral/CHANGES).
764 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
765 by default, which means that "prems" (and also "fixed variables") are
766 suppressed from proof state output. Note that the ProofGeneral
767 settings mechanism allows to change and save options persistently, but
768 older versions of Isabelle will fail to start up if a negative prems
771 * Local theory targets may be specified by non-nested blocks of
772 ``context/locale/class ... begin'' followed by ``end''. The body may
773 contain definitions, theorems etc., including any derived mechanism
774 that has been implemented on top of these primitives. This concept
775 generalizes the existing ``theorem (in ...)'' towards more versatility
778 * Proof General interface: proper undo of final 'end' command;
779 discontinued Isabelle/classic mode (ML proof scripts).
782 *** Document preparation ***
784 * Added antiquotation @{theory name} which prints the given name,
785 after checking that it refers to a valid ancestor theory in the
788 * Added antiquotations @{ML_type text} and @{ML_struct text} which
789 check the given source text as ML type/structure, printing verbatim.
791 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
792 "c args == rhs" given in the current context. (Any number of
793 arguments may be given on the LHS.)
798 * The 'class' package offers a combination of axclass and locale to
799 achieve Haskell-like type classes in Isabelle. Definitions and
800 theorems within a class context produce both relative results (with
801 implicit parameters according to the locale context), and polymorphic
802 constants with qualified polymorphism (according to the class
803 context). Within the body context of a 'class' target, a separate
804 syntax layer ("user space type system") takes care of converting
805 between global polymorphic consts and internal locale representation.
806 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
807 "isatool doc classes" provides a tutorial.
809 * Generic code generator framework allows to generate executable
810 code for ML and Haskell (including Isabelle classes). A short usage
813 internal compilation:
814 export_code <list of constants (term syntax)> in SML
815 writing SML code to a file:
816 export_code <list of constants (term syntax)> in SML <filename>
817 writing OCaml code to a file:
818 export_code <list of constants (term syntax)> in OCaml <filename>
819 writing Haskell code to a bunch of files:
820 export_code <list of constants (term syntax)> in Haskell <filename>
822 evaluating closed propositions to True/False using code generation:
825 Reasonable default setup of framework in HOL.
827 Theorem attributs for selecting and transforming function equations theorems:
829 [code fun]: select a theorem as function equation for a specific constant
830 [code fun del]: deselect a theorem as function equation for a specific constant
831 [code inline]: select an equation theorem for unfolding (inlining) in place
832 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
834 User-defined serializations (target in {SML, OCaml, Haskell}):
836 code_const <and-list of constants (term syntax)>
837 {(target) <and-list of const target syntax>}+
839 code_type <and-list of type constructors>
840 {(target) <and-list of type target syntax>}+
842 code_instance <and-list of instances>
844 where instance ::= <type constructor> :: <class>
846 code_class <and_list of classes>
847 {(target) <and-list of class target syntax>}+
848 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
850 code_instance and code_class only are effective to target Haskell.
852 For example usage see src/HOL/ex/Codegenerator.thy and
853 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
854 generation from Isabelle/HOL theories is available via "isatool doc
857 * Code generator: consts in 'consts_code' Isar commands are now
858 referred to by usual term syntax (including optional type
861 * Command 'no_translations' removes translation rules from theory
864 * Overloaded definitions are now actually checked for acyclic
865 dependencies. The overloading scheme is slightly more general than
866 that of Haskell98, although Isabelle does not demand an exact
867 correspondence to type class and instance declarations.
868 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
869 exotic versions of overloading -- at the discretion of the user!
871 Polymorphic constants are represented via type arguments, i.e. the
872 instantiation that matches an instance against the most general
873 declaration given in the signature. For example, with the declaration
874 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
875 as c(nat). Overloading is essentially simultaneous structural
876 recursion over such type arguments. Incomplete specification patterns
877 impose global constraints on all occurrences, e.g. c('a * 'a) on the
878 LHS means that more general c('a * 'b) will be disallowed on any RHS.
879 Command 'print_theory' outputs the normalized system of recursive
880 equations, see section "definitions".
882 * Configuration options are maintained within the theory or proof
883 context (with name and type bool/int/string), providing a very simple
884 interface to a poor-man's version of general context data. Tools may
885 declare options in ML (e.g. using Attrib.config_int) and then refer to
886 these values using Config.get etc. Users may change options via an
887 associated attribute of the same name. This form of context
888 declaration works particularly well with commands 'declare' or
889 'using', for example ``declare [[foo = 42]]''. Thus it has become
890 very easy to avoid global references, which would not observe Isar
891 toplevel undo/redo and fail to work with multithreading.
893 Various global ML references of Pure and HOL have been turned into
894 configuration options:
896 Unify.search_bound unify_search_bound
897 Unify.trace_bound unify_trace_bound
898 Unify.trace_simp unify_trace_simp
899 Unify.trace_types unify_trace_types
900 Simplifier.simp_depth_limit simp_depth_limit
901 Blast.depth_limit blast_depth_limit
902 DatatypeProp.dtK datatype_distinctness_limit
903 fast_arith_neq_limit fast_arith_neq_limit
904 fast_arith_split_limit fast_arith_split_limit
906 * Named collections of theorems may be easily installed as context
907 data using the functor NamedThmsFun (see also
908 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
909 attributes; there is also a toplevel print command. This facility is
910 just a common case of general context data, which is the preferred way
911 for anything more complex than just a list of facts in canonical
914 * Isar: command 'declaration' augments a local theory by generic
915 declaration functions written in ML. This enables arbitrary content
916 being added to the context, depending on a morphism that tells the
917 difference of the original declaration context wrt. the application
918 context encountered later on.
920 * Isar: proper interfaces for simplification procedures. Command
921 'simproc_setup' declares named simprocs (with match patterns, and body
922 text in ML). Attribute "simproc" adds/deletes simprocs in the current
923 context. ML antiquotation @{simproc name} retrieves named simprocs.
925 * Isar: an extra pair of brackets around attribute declarations
926 abbreviates a theorem reference involving an internal dummy fact,
927 which will be ignored later --- only the effect of the attribute on
928 the background context will persist. This form of in-place
929 declarations is particularly useful with commands like 'declare' and
930 'using', for example ``have A using [[simproc a]] by simp''.
932 * Isar: method "assumption" (and implicit closing of subproofs) now
933 takes simple non-atomic goal assumptions into account: after applying
934 an assumption as a rule the resulting subgoals are solved by atomic
935 assumption steps. This is particularly useful to finish 'obtain'
936 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
937 without referring to the original premise "!!x. P x ==> thesis" in the
938 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
941 * Isar: implicit use of prems from the Isar proof context is
942 considered a legacy feature. Common applications like ``have A .''
943 may be replaced by ``have A by fact'' or ``note `A`''. In general,
944 referencing facts explicitly here improves readability and
945 maintainability of proof texts.
947 * Isar: improper proof element 'guess' is like 'obtain', but derives
948 the obtained context from the course of reasoning! For example:
950 assume "EX x y. A x & B y" -- "any previous fact"
951 then guess x and y by clarify
953 This technique is potentially adventurous, depending on the facts and
954 proof tools being involved here.
956 * Isar: known facts from the proof context may be specified as literal
957 propositions, using ASCII back-quote syntax. This works wherever
958 named facts used to be allowed so far, in proof commands, proof
959 methods, attributes etc. Literal facts are retrieved from the context
960 according to unification of type and term parameters. For example,
961 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
962 theorems in the current context, then these are valid literal facts:
963 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
965 There is also a proof method "fact" which does the same composition
966 for explicit goal states, e.g. the following proof texts coincide with
967 certain special cases of literal facts:
969 have "A" by fact == note `A`
970 have "A ==> B" by fact == note `A ==> B`
971 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
972 have "P a ==> Q a" by fact == note `P a ==> Q a`
974 * Isar: ":" (colon) is no longer a symbolic identifier character in
975 outer syntax. Thus symbolic identifiers may be used without
976 additional white space in declarations like this: ``assume *: A''.
978 * Isar: 'print_facts' prints all local facts of the current context,
979 both named and unnamed ones.
981 * Isar: 'def' now admits simultaneous definitions, e.g.:
983 def x == "t" and y == "u"
985 * Isar: added command 'unfolding', which is structurally similar to
986 'using', but affects both the goal state and facts by unfolding given
987 rewrite rules. Thus many occurrences of the 'unfold' method or
988 'unfolded' attribute may be replaced by first-class proof text.
990 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
991 and command 'unfolding' now all support object-level equalities
992 (potentially conditional). The underlying notion of rewrite rule is
993 analogous to the 'rule_format' attribute, but *not* that of the
994 Simplifier (which is usually more generous).
996 * Isar: the new attribute [rotated n] (default n = 1) rotates the
997 premises of a theorem by n. Useful in conjunction with drule.
999 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
1000 method expression within a sandbox consisting of the first N
1001 sub-goals, which need to exist. For example, ``simp_all [3]''
1002 simplifies the first three sub-goals, while (rule foo, simp_all)[]
1003 simplifies all new goals that emerge from applying rule foo to the
1004 originally first one.
1006 * Isar: schematic goals are no longer restricted to higher-order
1007 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
1010 * Isar: the conclusion of a long theorem statement is now either
1011 'shows' (a simultaneous conjunction, as before), or 'obtains'
1012 (essentially a disjunction of cases with local parameters and
1013 assumptions). The latter allows to express general elimination rules
1014 adequately; in this notation common elimination rules look like this:
1016 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
1018 obtains x where "P x"
1020 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
1024 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
1030 The subsequent classical rules even refer to the formal "thesis"
1033 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
1036 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
1037 obtains "thesis ==> something"
1039 The actual proof of an 'obtains' statement is analogous to that of the
1040 Isar proof element 'obtain', only that there may be several cases.
1041 Optional case names may be specified in parentheses; these will be
1042 available both in the present proof and as annotations in the
1043 resulting rule, for later use with the 'cases' method (cf. attribute
1046 * Isar: the assumptions of a long theorem statement are available as
1047 "assms" fact in the proof context. This is more appropriate than the
1048 (historical) "prems", which refers to all assumptions of the current
1049 context, including those from the target locale, proof body etc.
1051 * Isar: 'print_statement' prints theorems from the current theory or
1052 proof context in long statement form, according to the syntax of a
1055 * Isar: 'obtain' takes an optional case name for the local context
1056 introduction rule (default "that").
1058 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
1059 explicit (is "_ ==> ?foo") in the rare cases where this still happens
1062 * Pure: syntax "CONST name" produces a fully internalized constant
1063 according to the current context. This is particularly useful for
1064 syntax translations that should refer to internal constant
1065 representations independently of name spaces.
1067 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
1068 instead of "FOO ". This allows multiple binder declarations to coexist
1069 in the same context. INCOMPATIBILITY.
1071 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
1072 primitive that also works in a locale context (both for constants and
1073 fixed variables). Type declaration and internal syntactic representation
1074 of given constants retrieved from the context. Likewise, the
1075 'no_notation' command allows to remove given syntax annotations from the
1078 * Isar/locales: new derived specification elements 'axiomatization',
1079 'definition', 'abbreviation', which support type-inference, admit
1080 object-level specifications (equality, equivalence). See also the
1081 isar-ref manual. Examples:
1084 eq (infix "===" 50) where
1085 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
1087 definition "f x y = x + y + 1"
1088 definition g where "g x = f x x"
1091 neq (infix "=!=" 50) where
1092 "x =!= y == ~ (x === y)"
1094 These specifications may be also used in a locale context. Then the
1095 constants being introduced depend on certain fixed parameters, and the
1096 constant name is qualified by the locale base name. An internal
1097 abbreviation takes care for convenient input and output, making the
1098 parameters implicit and using the original short name. See also
1099 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
1100 entities from a monomorphic theory.
1102 Presently, abbreviations are only available 'in' a target locale, but
1103 not inherited by general import expressions. Also note that
1104 'abbreviation' may be used as a type-safe replacement for 'syntax' +
1105 'translations' in common applications. The "no_abbrevs" print mode
1106 prevents folding of abbreviations in term output.
1108 Concrete syntax is attached to specified constants in internal form,
1109 independently of name spaces. The parse tree representation is
1110 slightly different -- use 'notation' instead of raw 'syntax', and
1111 'translations' with explicit "CONST" markup to accommodate this.
1113 * Pure/Isar: unified syntax for new-style specification mechanisms
1114 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
1115 full type inference and dummy patterns ("_"). For example:
1117 definition "K x _ = x"
1119 inductive conj for A B
1120 where "A ==> B ==> conj A B"
1122 * Pure: command 'print_abbrevs' prints all constant abbreviations of
1123 the current context. Print mode "no_abbrevs" prevents inversion of
1124 abbreviations on output.
1126 * Isar/locales: improved parameter handling: use of locales "var" and
1127 "struct" no longer necessary; - parameter renamings are no longer
1128 required to be injective. For example, this allows to define
1129 endomorphisms as locale endom = homom mult mult h.
1131 * Isar/locales: changed the way locales with predicates are defined.
1132 Instead of accumulating the specification, the imported expression is
1133 now an interpretation. INCOMPATIBILITY: different normal form of
1134 locale expressions. In particular, in interpretations of locales with
1135 predicates, goals repesenting already interpreted fragments are not
1136 removed automatically. Use methods `intro_locales' and
1137 `unfold_locales'; see below.
1139 * Isar/locales: new methods `intro_locales' and `unfold_locales'
1140 provide backward reasoning on locales predicates. The methods are
1141 aware of interpretations and discharge corresponding goals.
1142 `intro_locales' is less aggressive then `unfold_locales' and does not
1143 unfold predicates to assumptions.
1145 * Isar/locales: the order in which locale fragments are accumulated
1146 has changed. This enables to override declarations from fragments due
1147 to interpretations -- for example, unwanted simp rules.
1149 * Isar/locales: interpretation in theories and proof contexts has been
1150 extended. One may now specify (and prove) equations, which are
1151 unfolded in interpreted theorems. This is useful for replacing
1152 defined concepts (constants depending on locale parameters) by
1153 concepts already existing in the target context. Example:
1155 interpretation partial_order ["op <= :: [int, int] => bool"]
1156 where "partial_order.less (op <=) (x::int) y = (x < y)"
1158 Typically, the constant `partial_order.less' is created by a
1159 definition specification element in the context of locale
1162 * Method "induct": improved internal context management to support
1163 local fixes and defines on-the-fly. Thus explicit meta-level
1164 connectives !! and ==> are rarely required anymore in inductive goals
1165 (using object-logic connectives for this purpose has been long
1166 obsolete anyway). Common proof patterns are explained in
1167 src/HOL/Induct/Common_Patterns.thy, see also
1168 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
1171 * Method "induct": improved handling of simultaneous goals. Instead of
1172 introducing object-level conjunction, the statement is now split into
1173 several conclusions, while the corresponding symbolic cases are nested
1174 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
1175 see src/HOL/Induct/Common_Patterns.thy, for example.
1177 * Method "induct": mutual induction rules are now specified as a list
1178 of rule sharing the same induction cases. HOL packages usually provide
1179 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
1180 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
1181 mutual induction rules differently, i.e. like this:
1183 (induct rule: foo_bar.inducts)
1184 (induct set: foo bar)
1185 (induct pred: foo bar)
1186 (induct type: foo bar)
1188 The ML function ProjectRule.projections turns old-style rules into the
1191 * Method "coinduct": dual of induction, see
1192 src/HOL/Library/Coinductive_List.thy for various examples.
1194 * Method "cases", "induct", "coinduct": the ``(open)'' option is
1195 considered a legacy feature.
1197 * Attribute "symmetric" produces result with standardized schematic
1198 variables (index 0). Potential INCOMPATIBILITY.
1200 * Simplifier: by default the simplifier trace only shows top level
1201 rewrites now. That is, trace_simp_depth_limit is set to 1 by
1202 default. Thus there is less danger of being flooded by the trace. The
1203 trace indicates where parts have been suppressed.
1205 * Provers/classical: removed obsolete classical version of elim_format
1206 attribute; classical elim/dest rules are now treated uniformly when
1207 manipulating the claset.
1209 * Provers/classical: stricter checks to ensure that supplied intro,
1210 dest and elim rules are well-formed; dest and elim rules must have at
1213 * Provers/classical: attributes dest/elim/intro take an optional
1214 weight argument for the rule (just as the Pure versions). Weights are
1215 ignored by automated tools, but determine the search order of single
1218 * Syntax: input syntax now supports dummy variable binding "%_. b",
1219 where the body does not mention the bound variable. Note that dummy
1220 patterns implicitly depend on their context of bounds, which makes
1221 "{_. _}" match any set comprehension as expected. Potential
1222 INCOMPATIBILITY -- parse translations need to cope with syntactic
1223 constant "_idtdummy" in the binding position.
1225 * Syntax: removed obsolete syntactic constant "_K" and its associated
1226 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
1227 for example "A -> B" => "Pi A (%_. B)".
1229 * Pure: 'class_deps' command visualizes the subclass relation, using
1230 the graph browser tool.
1232 * Pure: 'print_theory' now suppresses certain internal declarations by
1233 default; use '!' option for full details.
1238 * Method "metis" proves goals by applying the Metis general-purpose
1239 resolution prover (see also http://gilith.com/software/metis/).
1240 Examples are in the directory MetisExamples. WARNING: the
1241 Isabelle/HOL-Metis integration does not yet work properly with
1244 * Command 'sledgehammer' invokes external automatic theorem provers as
1245 background processes. It generates calls to the "metis" method if
1246 successful. These can be pasted into the proof. Users do not have to
1247 wait for the automatic provers to return. WARNING: does not really
1248 work with multi-threading.
1250 * New "auto_quickcheck" feature tests outermost goal statements for
1251 potential counter-examples. Controlled by ML references
1252 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
1253 5000 milliseconds). Fails silently if statements is outside of
1254 executable fragment, or any other codgenerator problem occurs.
1256 * New constant "undefined" with axiom "undefined x = undefined".
1258 * Added class "HOL.eq", allowing for code generation with polymorphic
1261 * Some renaming of class constants due to canonical name prefixing in
1262 the new 'class' package:
1264 HOL.abs ~> HOL.abs_class.abs
1265 HOL.divide ~> HOL.divide_class.divide
1266 0 ~> HOL.zero_class.zero
1267 1 ~> HOL.one_class.one
1268 op + ~> HOL.plus_class.plus
1269 op - ~> HOL.minus_class.minus
1270 uminus ~> HOL.minus_class.uminus
1271 op * ~> HOL.times_class.times
1272 op < ~> HOL.ord_class.less
1273 op <= > HOL.ord_class.less_eq
1274 Nat.power ~> Power.power_class.power
1275 Nat.size ~> Nat.size_class.size
1276 Numeral.number_of ~> Numeral.number_class.number_of
1277 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
1278 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
1279 Orderings.min ~> Orderings.ord_class.min
1280 Orderings.max ~> Orderings.ord_class.max
1281 Divides.op div ~> Divides.div_class.div
1282 Divides.op mod ~> Divides.div_class.mod
1283 Divides.op dvd ~> Divides.div_class.dvd
1285 INCOMPATIBILITY. Adaptions may be required in the following cases:
1287 a) User-defined constants using any of the names "plus", "minus",
1288 "times", "less" or "less_eq". The standard syntax translations for
1289 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
1292 b) Variables named "plus", "minus", "times", "less", "less_eq"
1293 INCOMPATIBILITY: use more specific names.
1295 c) Permutative equations (e.g. "a + b = b + a")
1296 Since the change of names also changes the order of terms, permutative
1297 rewrite rules may get applied in a different order. Experience shows
1298 that this is rarely the case (only two adaptions in the whole Isabelle
1299 distribution). INCOMPATIBILITY: rewrite proofs
1301 d) ML code directly refering to constant names
1302 This in general only affects hand-written proof tactics, simprocs and
1303 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
1304 Consider using @{const_name} antiquotation.
1306 * New class "default" with associated constant "default".
1308 * Function "sgn" is now overloaded and available on int, real, complex
1309 (and other numeric types), using class "sgn". Two possible defs of
1310 sgn are given as equational assumptions in the classes sgn_if and
1311 sgn_div_norm; ordered_idom now also inherits from sgn_if.
1314 * Locale "partial_order" now unified with class "order" (cf. theory
1315 Orderings), added parameter "less". INCOMPATIBILITY.
1317 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
1318 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
1319 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
1321 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
1322 changed order of proof goals in instance proofs.
1324 * The transitivity reasoner for partial and linear orders is set up
1325 for classes "order" and "linorder". Instances of the reasoner are available
1326 in all contexts importing or interpreting the corresponding locales.
1327 Method "order" invokes the reasoner separately; the reasoner
1328 is also integrated with the Simplifier as a solver. Diagnostic
1329 command 'print_orders' shows the available instances of the reasoner
1330 in the current context.
1332 * Localized monotonicity predicate in theory "Orderings"; integrated
1333 lemmas max_of_mono and min_of_mono with this predicate.
1336 * Formulation of theorem "dense" changed slightly due to integration
1337 with new class dense_linear_order.
1339 * Uniform lattice theory development in HOL.
1341 constants "meet" and "join" now named "inf" and "sup"
1342 constant "Meet" now named "Inf"
1344 classes "meet_semilorder" and "join_semilorder" now named
1345 "lower_semilattice" and "upper_semilattice"
1346 class "lorder" now named "lattice"
1347 class "comp_lat" now named "complete_lattice"
1349 Instantiation of lattice classes allows explicit definitions
1350 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
1352 INCOMPATIBILITY. Theorem renames:
1354 meet_left_le ~> inf_le1
1355 meet_right_le ~> inf_le2
1356 join_left_le ~> sup_ge1
1357 join_right_le ~> sup_ge2
1358 meet_join_le ~> inf_sup_ord
1361 le_meet ~> le_inf_iff
1362 le_join ~> ge_sup_conv
1363 meet_idempotent ~> inf_idem
1364 join_idempotent ~> sup_idem
1365 meet_comm ~> inf_commute
1366 join_comm ~> sup_commute
1367 meet_leI1 ~> le_infI1
1368 meet_leI2 ~> le_infI2
1369 le_joinI1 ~> le_supI1
1370 le_joinI2 ~> le_supI2
1371 meet_assoc ~> inf_assoc
1372 join_assoc ~> sup_assoc
1373 meet_left_comm ~> inf_left_commute
1374 meet_left_idempotent ~> inf_left_idem
1375 join_left_comm ~> sup_left_commute
1376 join_left_idempotent ~> sup_left_idem
1379 le_def_meet ~> le_iff_inf
1380 le_def_join ~> le_iff_sup
1381 join_absorp2 ~> sup_absorb2
1382 join_absorp1 ~> sup_absorb1
1383 meet_absorp1 ~> inf_absorb1
1384 meet_absorp2 ~> inf_absorb2
1385 meet_join_absorp ~> inf_sup_absorb
1386 join_meet_absorp ~> sup_inf_absorb
1387 distrib_join_le ~> distrib_sup_le
1388 distrib_meet_le ~> distrib_inf_le
1390 add_meet_distrib_left ~> add_inf_distrib_left
1391 add_join_distrib_left ~> add_sup_distrib_left
1392 is_join_neg_meet ~> is_join_neg_inf
1393 is_meet_neg_join ~> is_meet_neg_sup
1394 add_meet_distrib_right ~> add_inf_distrib_right
1395 add_join_distrib_right ~> add_sup_distrib_right
1396 add_meet_join_distribs ~> add_sup_inf_distribs
1397 join_eq_neg_meet ~> sup_eq_neg_inf
1398 meet_eq_neg_join ~> inf_eq_neg_sup
1399 add_eq_meet_join ~> add_eq_inf_sup
1400 meet_0_imp_0 ~> inf_0_imp_0
1401 join_0_imp_0 ~> sup_0_imp_0
1402 meet_0_eq_0 ~> inf_0_eq_0
1403 join_0_eq_0 ~> sup_0_eq_0
1404 neg_meet_eq_join ~> neg_inf_eq_sup
1405 neg_join_eq_meet ~> neg_sup_eq_inf
1406 join_eq_if ~> sup_eq_if
1408 mono_meet ~> mono_inf
1409 mono_join ~> mono_sup
1410 meet_bool_eq ~> inf_bool_eq
1411 join_bool_eq ~> sup_bool_eq
1412 meet_fun_eq ~> inf_fun_eq
1413 join_fun_eq ~> sup_fun_eq
1414 meet_set_eq ~> inf_set_eq
1415 join_set_eq ~> sup_set_eq
1416 meet1_iff ~> inf1_iff
1417 meet2_iff ~> inf2_iff
1426 join1_iff ~> sup1_iff
1427 join2_iff ~> sup2_iff
1437 is_meet_Meet ~> is_meet_Inf
1438 Meet_bool_def ~> Inf_bool_def
1439 Meet_fun_def ~> Inf_fun_def
1440 Meet_greatest ~> Inf_greatest
1441 Meet_lower ~> Inf_lower
1442 Meet_set_def ~> Inf_set_def
1445 Sup_bool_eq ~> Sup_bool_def
1446 Sup_fun_eq ~> Sup_fun_def
1447 Sup_set_eq ~> Sup_set_def
1449 listsp_meetI ~> listsp_infI
1450 listsp_meet_eq ~> listsp_inf_eq
1455 * Added syntactic class "size"; overloaded constant "size" now has
1456 type "'a::size ==> bool"
1458 * Internal reorganisation of `size' of datatypes: size theorems
1459 "foo.size" are no longer subsumed by "foo.simps" (but are still
1460 simplification rules by default!); theorems "prod.size" now named
1463 * Class "div" now inherits from class "times" rather than "type".
1466 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
1467 Linorder etc. have disappeared; operations defined in terms of
1468 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
1470 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
1472 * HOL-Word: New extensive library and type for generic, fixed size
1473 machine words, with arithemtic, bit-wise, shifting and rotating
1474 operations, reflection into int, nat, and bool lists, automation for
1475 linear arithmetic (by automatic reflection into nat or int), including
1476 lemmas on overflow and monotonicity. Instantiated to all appropriate
1477 arithmetic type classes, supporting automatic simplification of
1478 numerals on all operations.
1480 * Library/Boolean_Algebra: locales for abstract boolean algebras.
1482 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
1484 * Code generator library theories:
1485 - Code_Integer represents HOL integers by big integer literals in target
1487 - Code_Char represents HOL characters by character literals in target
1489 - Code_Char_chr like Code_Char, but also offers treatment of character
1490 codes; includes Code_Integer.
1491 - Executable_Set allows to generate code for finite sets using lists.
1492 - Executable_Rat implements rational numbers as triples (sign, enumerator,
1494 - Executable_Real implements a subset of real numbers, namly those
1495 representable by rational numbers.
1496 - Efficient_Nat implements natural numbers by integers, which in general will
1497 result in higher efficency; pattern matching with 0/Suc is eliminated;
1498 includes Code_Integer.
1499 - Code_Index provides an additional datatype index which is mapped to
1500 target-language built-in integers.
1501 - Code_Message provides an additional datatype message_string which is isomorphic to
1502 strings; messages are mapped to target-language strings.
1504 * New package for inductive predicates
1506 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
1509 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1510 for z_1 :: U_1 and ... and z_n :: U_m
1512 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1515 with full support for type-inference, rather than
1517 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1519 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1520 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1522 inductive "s z_1 ... z_m"
1524 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1527 For backward compatibility, there is a wrapper allowing inductive
1528 sets to be defined with the new package via
1531 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1532 for z_1 :: U_1 and ... and z_n :: U_m
1534 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1540 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1541 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1542 for z_1 :: U_1 and ... and z_n :: U_m
1544 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1545 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1548 if the additional syntax "p ..." is required.
1550 Numerous examples can be found in the subdirectories src/HOL/Auth,
1551 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
1555 - Since declaration and definition of inductive sets or predicates
1556 is no longer separated, abbreviations involving the newly
1557 introduced sets or predicates must be specified together with the
1558 introduction rules after the 'where' keyword (see above), rather
1559 than before the actual inductive definition.
1561 - The variables in induction and elimination rules are now
1562 quantified in the order of their occurrence in the introduction
1563 rules, rather than in alphabetical order. Since this may break
1564 some proofs, these proofs either have to be repaired, e.g. by
1565 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
1566 statements of the form
1568 case (rule_i a_i_1 ... a_i_{k_i})
1570 or the old order of quantification has to be restored by explicitly adding
1571 meta-level quantifiers in the introduction rules, i.e.
1573 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
1575 - The format of the elimination rules is now
1577 p z_1 ... z_m x_1 ... x_n ==>
1578 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1583 (x_1, ..., x_n) : s z_1 ... z_m ==>
1584 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1587 for sets rather than
1589 x : s z_1 ... z_m ==>
1590 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
1593 This may require terms in goals to be expanded to n-tuples
1594 (e.g. using case_tac or simplification with the split_paired_all
1595 rule) before the above elimination rule is applicable.
1597 - The elimination or case analysis rules for (mutually) inductive
1598 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
1599 list of rules "p_1_..._p_k.elims" is no longer available.
1601 * New package "function"/"fun" for general recursive functions,
1602 supporting mutual and nested recursion, definitions in local contexts,
1603 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
1604 for small examples, and the separate tutorial on the function
1605 package. The old recdef "package" is still available as before, but
1606 users are encouraged to use the new package.
1608 * Method "lexicographic_order" automatically synthesizes termination
1609 relations as lexicographic combinations of size measures.
1611 * Case-expressions allow arbitrary constructor-patterns (including
1612 "_") and take their order into account, like in functional
1613 programming. Internally, this is translated into nested
1614 case-expressions; missing cases are added and mapped to the predefined
1615 constant "undefined". In complicated cases printing may no longer show
1616 the original input but the internal form. Lambda-abstractions allow
1617 the same form of pattern matching: "% pat1 => e1 | ..." is an
1618 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
1621 * IntDef: The constant "int :: nat => int" has been removed; now "int"
1622 is an abbreviation for "of_nat :: nat => int". The simplification
1623 rules for "of_nat" have been changed to work like "int" did
1624 previously. Potential INCOMPATIBILITY:
1625 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
1626 - of_nat_diff and of_nat_mult are no longer default simp rules
1628 * Method "algebra" solves polynomial equations over (semi)rings using
1629 Groebner bases. The (semi)ring structure is defined by locales and the
1630 tool setup depends on that generic context. Installing the method for
1631 a specific type involves instantiating the locale and possibly adding
1632 declarations for computation on the coefficients. The method is
1633 already instantiated for natural numbers and for the axiomatic class
1634 of idoms with numerals. See also the paper by Chaieb and Wenzel at
1635 CALCULEMUS 2007 for the general principles underlying this
1636 architecture of context-aware proof-tools.
1638 * Method "ferrack" implements quantifier elimination over
1639 special-purpose dense linear orders using locales (analogous to
1640 "algebra"). The method is already installed for class
1641 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
1644 * Former constant "List.op @" now named "List.append". Use ML
1645 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
1646 circumvent possible incompatibilities when working on ML level.
1648 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
1650 * New function listsum :: 'a list => 'a for arbitrary monoids.
1651 Special syntax: "SUM x <- xs. f x" (and latex variants)
1653 * New syntax for Haskell-like list comprehension (input only), eg.
1654 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
1656 * The special syntax for function "filter" has changed from [x :
1657 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
1658 comprehension syntax, and for uniformity. INCOMPATIBILITY.
1660 * [a..b] is now defined for arbitrary linear orders. It used to be
1661 defined on nat only, as an abbreviation for [a..<Suc b]
1664 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
1666 * New functions "sorted" and "sort" in src/HOL/List.thy.
1668 * New lemma collection field_simps (an extension of ring_simps) for
1669 manipulating (in)equations involving division. Multiplies with all
1670 denominators that can be proved to be non-zero (in equations) or
1671 positive/negative (in inequations).
1673 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
1674 have been improved and renamed to ring_simps, group_simps and
1675 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
1676 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
1678 * Theory Library/Commutative_Ring: switched from recdef to function
1679 package; constants add, mul, pow now curried. Infix syntax for
1680 algebraic operations.
1682 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
1685 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
1688 * HOL/records: generalised field-update to take a function on the
1689 field rather than the new value: r(|A := x|) is translated to A_update
1690 (K x) r The K-combinator that is internally used is called K_record.
1691 INCOMPATIBILITY: Usage of the plain update functions has to be
1694 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
1695 * x = 0, which are required for a semiring. Richer structures do not
1696 inherit from semiring_0 anymore, because this property is a theorem
1697 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
1698 there is more to prove, but this is mostly trivial.
1700 * Class "recpower" is generalized to arbitrary monoids, not just
1701 commutative semirings. INCOMPATIBILITY: may need to incorporate
1702 commutativity or semiring properties additionally.
1704 * Constant "List.list_all2" in List.thy now uses authentic syntax.
1705 INCOMPATIBILITY: translations containing list_all2 may go wrong,
1706 better use 'abbreviation'.
1708 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
1710 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
1711 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
1712 significant changes for setting up numeral syntax for types:
1713 - New constants Numeral.pred and Numeral.succ instead
1714 of former Numeral.bin_pred and Numeral.bin_succ.
1715 - Use integer operations instead of bin_add, bin_mult and so on.
1716 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
1717 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
1719 See src/HOL/Integ/IntArith.thy for an example setup.
1721 * Command 'normal_form' computes the normal form of a term that may
1722 contain free variables. For example ``normal_form "rev [a, b, c]"''
1723 produces ``[b, c, a]'' (without proof). This command is suitable for
1724 heavy-duty computations because the functions are compiled to ML
1725 first. Correspondingly, a method "normalization" is provided. See
1726 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
1728 * Alternative iff syntax "A <-> B" for equality on bool (with priority
1729 25 like -->); output depends on the "iff" print_mode, the default is
1730 "A = B" (with priority 50).
1732 * Relations less (<) and less_eq (<=) are also available on type bool.
1733 Modified syntax to disallow nesting without explicit parentheses,
1734 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
1737 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
1739 * Relation composition operator "op O" now has precedence 75 and binds
1740 stronger than union and intersection. INCOMPATIBILITY.
1742 * The old set interval syntax "{m..n(}" (and relatives) has been
1743 removed. Use "{m..<n}" (and relatives) instead.
1745 * In the context of the assumption "~(s = t)" the Simplifier rewrites
1746 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
1747 ``declare [[simproc del: neq]]''.
1749 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
1752 * Theorem Cons_eq_map_conv no longer declared as "simp".
1754 * Theorem setsum_mult renamed to setsum_right_distrib.
1756 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
1759 * Reimplemented methods "sat" and "satx", with several improvements:
1760 goals no longer need to be stated as "<prems> ==> False", equivalences
1761 (i.e. "=" on type bool) are handled, variable names of the form
1762 "lit_<n>" are no longer reserved, significant speedup.
1764 * Methods "sat" and "satx" can now replay MiniSat proof traces.
1765 zChaff is still supported as well.
1767 * 'inductive' and 'datatype': provide projections of mutual rules,
1768 bundled as foo_bar.inducts;
1770 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
1773 * Library: moved theory Accessible_Part to main HOL.
1775 * Library: added theory Coinductive_List of potentially infinite lists
1776 as greatest fixed-point.
1778 * Library: added theory AssocList which implements (finite) maps as
1781 * Method "evaluation" solves goals (i.e. a boolean expression)
1782 efficiently by compiling it to ML. The goal is "proved" (via an
1783 oracle) if it evaluates to True.
1785 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
1786 also when invoked by the simplifier. This results in the Simplifier
1787 being more powerful on arithmetic goals. INCOMPATIBILITY.
1788 Configuration option fast_arith_split_limit=0 recovers the old
1791 * Support for hex (0x20) and binary (0b1001) numerals.
1793 * New method: reify eqs (t), where eqs are equations for an
1794 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
1795 parameter, computes a term s::'b and a list xs::'a list and proves the
1796 theorem I xs s = t. This is also known as reification or quoting. The
1797 resulting theorem is applied to the subgoal to substitute t with I xs
1798 s. If t is omitted, the subgoal itself is reified.
1800 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
1801 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
1802 where f is supposed to be a computable function (in the sense of code
1803 generattion). The method uses reify to compute s and xs as above then
1804 applies corr_thm and uses normalization by evaluation to "prove" f s =
1805 r and finally gets the theorem t = r, which is again applied to the
1806 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
1808 * Reflection: Automatic reification now handels binding, an example is
1809 available in src/HOL/ex/ReflectionEx.thy
1811 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
1812 command 'statespace' that is similar to 'record', but introduces an
1813 abstract specification based on the locale infrastructure instead of
1814 HOL types. This leads to extra flexibility in composing state spaces,
1815 in particular multiple inheritance and renaming of components.
1820 * Hyperreal: Functions root and sqrt are now defined on negative real
1821 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
1822 Nonnegativity side conditions have been removed from many lemmas, so
1823 that more subgoals may now be solved by simplification; potential
1826 * Real: new type classes formalize real normed vector spaces and
1827 algebras, using new overloaded constants scaleR :: real => 'a => 'a
1828 and norm :: 'a => real.
1830 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
1831 reals into other types. The overloaded constant Reals :: 'a set is now
1832 defined as range of_real; potential INCOMPATIBILITY.
1834 * Real: proper support for ML code generation, including 'quickcheck'.
1835 Reals are implemented as arbitrary precision rationals.
1837 * Hyperreal: Several constants that previously worked only for the
1838 reals have been generalized, so they now work over arbitrary vector
1839 spaces. Type annotations may need to be added in some cases; potential
1842 Infinitesimal :: ('a::real_normed_vector) star set
1843 HFinite :: ('a::real_normed_vector) star set
1844 HInfinite :: ('a::real_normed_vector) star set
1845 approx :: ('a::real_normed_vector) star => 'a star => bool
1846 monad :: ('a::real_normed_vector) star => 'a star set
1847 galaxy :: ('a::real_normed_vector) star => 'a star set
1848 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
1849 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
1850 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
1851 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
1852 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
1853 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
1854 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
1855 sgn :: 'a::real_normed_vector => 'a
1856 exp :: 'a::{recpower,real_normed_field,banach} => 'a
1858 * Complex: Some complex-specific constants are now abbreviations for
1859 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
1860 hnorm. Other constants have been entirely removed in favor of the
1861 polymorphic versions (INCOMPATIBILITY):
1865 HInfinite <-- CInfinite
1866 Infinitesimal <-- CInfinitesimal
1869 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
1870 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
1871 (ns)deriv <-- (ns)cderiv
1876 * Formalisation of ideals and the quotient construction over rings.
1878 * Order and lattice theory no longer based on records.
1881 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
1882 greatest_closed. INCOMPATIBILITY.
1884 * Method algebra is now set up via an attribute. For examples see
1885 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
1886 of algebraic structures.
1888 * Renamed theory CRing to Ring.
1893 * Substantial, yet incomplete support for nominal datatypes (binding
1894 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
1895 src/HOL/Nominal/Examples. Prospective users should consult
1896 http://isabelle.in.tum.de/nominal/
1901 * ML basics: just one true type int, which coincides with IntInf.int
1904 * ML within Isar: antiquotations allow to embed statically-checked
1905 formal entities in the source, referring to the context available at
1906 compile-time. For example:
1908 ML {* @{sort "{zero,one}"} *}
1909 ML {* @{typ "'a => 'b"} *}
1910 ML {* @{term "%x. x"} *}
1911 ML {* @{prop "x == y"} *}
1912 ML {* @{ctyp "'a => 'b"} *}
1913 ML {* @{cterm "%x. x"} *}
1914 ML {* @{cprop "x == y"} *}
1915 ML {* @{thm asm_rl} *}
1916 ML {* @{thms asm_rl} *}
1917 ML {* @{type_name c} *}
1918 ML {* @{type_syntax c} *}
1919 ML {* @{const_name c} *}
1920 ML {* @{const_syntax c} *}
1923 ML {* @{theory Pure} *}
1924 ML {* @{theory_ref} *}
1925 ML {* @{theory_ref Pure} *}
1928 ML {* @{clasimpset} *}
1930 The same works for sources being ``used'' within an Isar context.
1932 * ML in Isar: improved error reporting; extra verbosity with
1933 ML_Context.trace enabled.
1935 * Pure/General/table.ML: the join operations now works via exceptions
1936 DUP/SAME instead of type option. This is simpler in simple cases, and
1937 admits slightly more efficient complex applications.
1939 * Pure: 'advanced' translation functions (parse_translation etc.) now
1940 use Context.generic instead of just theory.
1942 * Pure: datatype Context.generic joins theory/Proof.context and
1943 provides some facilities for code that works in either kind of
1944 context, notably GenericDataFun for uniform theory and proof data.
1946 * Pure: simplified internal attribute type, which is now always
1947 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
1948 local (Proof.context) attributes have been discontinued, while
1949 minimizing code duplication. Thm.rule_attribute and
1950 Thm.declaration_attribute build canonical attributes; see also structure
1951 Context for further operations on Context.generic, notably
1952 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
1953 declarations and definitions.
1955 * Context data interfaces (Theory/Proof/GenericDataFun): removed
1956 name/print, uninitialized data defaults to ad-hoc copy of empty value,
1957 init only required for impure data. INCOMPATIBILITY: empty really need
1958 to be empty (no dependencies on theory content!)
1960 * Pure/kernel: consts certification ignores sort constraints given in
1961 signature declarations. (This information is not relevant to the
1962 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
1963 potential INCOMPATIBILITY.
1965 * Pure: axiomatic type classes are now purely definitional, with
1966 explicit proofs of class axioms and super class relations performed
1967 internally. See Pure/axclass.ML for the main internal interfaces --
1968 notably AxClass.define_class supercedes AxClass.add_axclass, and
1969 AxClass.axiomatize_class/classrel/arity supersede
1970 Sign.add_classes/classrel/arities.
1972 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
1973 global/local versions on theory vs. Proof.context have been
1974 discontinued; Attrib.syntax and Method.syntax have been adapted
1975 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
1976 attributes, methods, etc.
1978 * Pure: several functions of signature "... -> theory -> theory * ..."
1979 have been reoriented to "... -> theory -> ... * theory" in order to
1980 allow natural usage in combination with the ||>, ||>>, |-> and
1981 fold_map combinators.
1983 * Pure: official theorem names (closed derivations) and additional
1984 comments (tags) are now strictly separate. Name hints -- which are
1985 maintained as tags -- may be attached any time without affecting the
1988 * Pure: primitive rule lift_rule now takes goal cterm instead of an
1989 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
1990 achieve the old behaviour.
1992 * Pure: the "Goal" constant is now called "prop", supporting a
1993 slightly more general idea of ``protecting'' meta-level rule
1996 * Pure: Logic.(un)varify only works in a global context, which is now
1997 enforced instead of silently assumed. INCOMPATIBILITY, may use
1998 Logic.legacy_(un)varify as temporary workaround.
2000 * Pure: structure Name provides scalable operations for generating
2001 internal variable names, notably Name.variants etc. This replaces
2002 some popular functions from term.ML:
2004 Term.variant -> Name.variant
2005 Term.variantlist -> Name.variant_list
2006 Term.invent_names -> Name.invent_list
2008 Note that low-level renaming rarely occurs in new code -- operations
2009 from structure Variable are used instead (see below).
2011 * Pure: structure Variable provides fundamental operations for proper
2012 treatment of fixed/schematic variables in a context. For example,
2013 Variable.import introduces fixes for schematics of given facts and
2014 Variable.export reverses the effect (up to renaming) -- this replaces
2015 various freeze_thaw operations.
2017 * Pure: structure Goal provides simple interfaces for
2018 init/conclude/finish and tactical prove operations (replacing former
2019 Tactic.prove). Goal.prove is the canonical way to prove results
2020 within a given context; Goal.prove_global is a degraded version for
2021 theory level goals, including a global Drule.standard. Note that
2022 OldGoals.prove_goalw_cterm has long been obsolete, since it is
2023 ill-behaved in a local proof context (e.g. with local fixes/assumes or
2024 in a locale context).
2026 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
2027 and type checking (Syntax.check_term etc.), with common combinations
2028 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
2029 which are considered legacy and await removal.
2031 * Pure/Syntax: generic interfaces for type unchecking
2032 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
2033 with common combinations (Syntax.pretty_term, Syntax.string_of_term
2034 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
2035 available for convenience, but refer to the very same operations using
2036 a mere theory instead of a full context.
2038 * Isar: simplified treatment of user-level errors, using exception
2039 ERROR of string uniformly. Function error now merely raises ERROR,
2040 without any side effect on output channels. The Isar toplevel takes
2041 care of proper display of ERROR exceptions. ML code may use plain
2042 handle/can/try; cat_error may be used to concatenate errors like this:
2044 ... handle ERROR msg => cat_error msg "..."
2046 Toplevel ML code (run directly or through the Isar toplevel) may be
2047 embedded into the Isar toplevel with exception display/debug like
2050 Isar.toplevel (fn () => ...)
2052 INCOMPATIBILITY, removed special transform_error facilities, removed
2053 obsolete variants of user-level exceptions (ERROR_MESSAGE,
2054 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
2055 -- use plain ERROR instead.
2057 * Isar: theory setup now has type (theory -> theory), instead of a
2058 list. INCOMPATIBILITY, may use #> to compose setup functions.
2060 * Isar: ML toplevel pretty printer for type Proof.context, subject to
2061 ProofContext.debug/verbose flags.
2063 * Isar: Toplevel.theory_to_proof admits transactions that modify the
2064 theory before entering a proof state. Transactions now always see a
2065 quasi-functional intermediate checkpoint, both in interactive and
2068 * Isar: simplified interfaces for outer syntax. Renamed
2069 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
2070 OuterSyntax.add_parsers -- this functionality is now included in
2071 OuterSyntax.command etc. INCOMPATIBILITY.
2073 * Simplifier: the simpset of a running simplification process now
2074 contains a proof context (cf. Simplifier.the_context), which is the
2075 very context that the initial simpset has been retrieved from (by
2076 simpset_of/local_simpset_of). Consequently, all plug-in components
2077 (solver, looper etc.) may depend on arbitrary proof data.
2079 * Simplifier.inherit_context inherits the proof context (plus the
2080 local bounds) of the current simplification process; any simproc
2081 etc. that calls the Simplifier recursively should do this! Removed
2082 former Simplifier.inherit_bounds, which is already included here --
2083 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
2084 specify an explicit context using Simplifier.context/theory_context.
2086 * Simplifier/Classical Reasoner: more abstract interfaces
2087 change_simpset/claset for modifying the simpset/claset reference of a
2088 theory; raw versions simpset/claset_ref etc. have been discontinued --
2091 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
2097 * settings: the default heap location within ISABELLE_HOME_USER now
2098 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
2099 Isabelle installations.
2101 * isabelle-process: option -S (secure mode) disables some critical
2102 operations, notably runtime compilation and evaluation of ML source
2105 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
2107 * Support for parallel execution, using native multicore support of
2108 Poly/ML 5.1. The theory loader exploits parallelism when processing
2109 independent theories, according to the given theory header
2110 specifications. The maximum number of worker threads is specified via
2111 usedir option -M or the "max-threads" setting in Proof General. A
2112 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
2113 to 6 on a 8-core machine. User-code needs to observe certain
2114 guidelines for thread-safe programming, see appendix A in the Isar
2115 Implementation manual.
2119 New in Isabelle2005 (October 2005)
2120 ----------------------------------
2124 * Theory headers: the new header syntax for Isar theories is
2127 imports <theory1> ... <theoryN>
2128 uses <file1> ... <fileM>
2131 where the 'uses' part is optional. The previous syntax
2133 theory <name> = <theory1> + ... + <theoryN>:
2135 will disappear in the next release. Use isatool fixheaders to convert
2136 existing theory files. Note that there is no change in ancient
2137 non-Isar theories now, but these will disappear soon.
2139 * Theory loader: parent theories can now also be referred to via
2140 relative and absolute paths.
2142 * Command 'find_theorems' searches for a list of criteria instead of a
2143 list of constants. Known criteria are: intro, elim, dest, name:string,
2144 simp:term, and any term. Criteria can be preceded by '-' to select
2145 theorems that do not match. Intro, elim, dest select theorems that
2146 match the current goal, name:s selects theorems whose fully qualified
2147 name contain s, and simp:term selects all simplification rules whose
2148 lhs match term. Any other term is interpreted as pattern and selects
2149 all theorems matching the pattern. Available in ProofGeneral under
2150 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
2152 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
2154 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
2155 matching the current goal as introduction rule and not having "HOL."
2156 in their name (i.e. not being defined in theory HOL).
2158 * Command 'thms_containing' has been discontinued in favour of
2159 'find_theorems'; INCOMPATIBILITY.
2161 * Communication with Proof General is now 8bit clean, which means that
2162 Unicode text in UTF-8 encoding may be used within theory texts (both
2163 formal and informal parts). Cf. option -U of the Isabelle Proof
2164 General interface. Here are some simple examples (cf. src/HOL/ex):
2166 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
2167 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
2169 * Improved efficiency of the Simplifier and, to a lesser degree, the
2170 Classical Reasoner. Typical big applications run around 2 times
2174 *** Document preparation ***
2176 * Commands 'display_drafts' and 'print_drafts' perform simple output
2177 of raw sources. Only those symbols that do not require additional
2178 LaTeX packages (depending on comments in isabellesym.sty) are
2179 displayed properly, everything else is left verbatim. isatool display
2180 and isatool print are used as front ends (these are subject to the
2181 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
2183 * Command tags control specific markup of certain regions of text,
2184 notably folding and hiding. Predefined tags include "theory" (for
2185 theory begin and end), "proof" for proof commands, and "ML" for
2186 commands involving ML code; the additional tags "visible" and
2187 "invisible" are unused by default. Users may give explicit tag
2188 specifications in the text, e.g. ''by %invisible (auto)''. The
2189 interpretation of tags is determined by the LaTeX job during document
2190 preparation: see option -V of isatool usedir, or options -n and -t of
2191 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
2194 Several document versions may be produced at the same time via isatool
2195 usedir (the generated index.html will link all of them). Typical
2196 specifications include ''-V document=theory,proof,ML'' to present
2197 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
2198 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
2199 these parts without any formal replacement text. The Isabelle site
2200 default settings produce ''document'' and ''outline'' versions as
2203 * Several new antiquotations:
2205 @{term_type term} prints a term with its type annotated;
2207 @{typeof term} prints the type of a term;
2209 @{const const} is the same as @{term const}, but checks that the
2210 argument is a known logical constant;
2212 @{term_style style term} and @{thm_style style thm} print a term or
2213 theorem applying a "style" to it
2217 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
2218 definitions, equations, inequations etc., 'concl' printing only the
2219 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
2220 to print the specified premise. TermStyle.add_style provides an ML
2221 interface for introducing further styles. See also the "LaTeX Sugar"
2222 document practical applications. The ML antiquotation prints
2223 type-checked ML expressions verbatim.
2225 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
2226 and 'text' support optional locale specification '(in loc)', which
2227 specifies the default context for interpreting antiquotations. For
2228 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
2230 * Option 'locale=NAME' of antiquotations specifies an alternative
2231 context interpreting the subsequent argument. For example: @{thm
2232 [locale=lattice] inf_assoc}.
2234 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
2237 * Proper output of antiquotations for theory commands involving a
2238 proof context (such as 'locale' or 'theorem (in loc) ...').
2240 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
2241 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
2243 * isatool usedir: new option -C (default true) controls whether option
2244 -D should include a copy of the original document directory; -C false
2245 prevents unwanted effects such as copying of administrative CVS data.
2250 * Considerably improved version of 'constdefs' command. Now performs
2251 automatic type-inference of declared constants; additional support for
2252 local structure declarations (cf. locales and HOL records), see also
2253 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
2254 sequential dependencies of definitions within a single 'constdefs'
2255 section; moreover, the declared name needs to be an identifier. If
2256 all fails, consider to fall back on 'consts' and 'defs' separately.
2258 * Improved indexed syntax and implicit structures. First of all,
2259 indexed syntax provides a notational device for subscripted
2260 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
2261 expressions. Secondly, in a local context with structure
2262 declarations, number indexes \<^sub>n or the empty index (default
2263 number 1) refer to a certain fixed variable implicitly; option
2264 show_structs controls printing of implicit structures. Typical
2265 applications of these concepts involve record types and locales.
2267 * New command 'no_syntax' removes grammar declarations (and
2268 translations) resulting from the given syntax specification, which is
2269 interpreted in the same manner as for the 'syntax' command.
2271 * 'Advanced' translation functions (parse_translation etc.) may depend
2272 on the signature of the theory context being presently used for
2273 parsing/printing, see also isar-ref manual.
2275 * Improved 'oracle' command provides a type-safe interface to turn an
2276 ML expression of type theory -> T -> term into a primitive rule of
2277 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
2278 is already included here); see also FOL/ex/IffExample.thy;
2281 * axclass: name space prefix for class "c" is now "c_class" (was "c"
2282 before); "cI" is no longer bound, use "c.intro" instead.
2283 INCOMPATIBILITY. This change avoids clashes of fact bindings for
2284 axclasses vs. locales.
2286 * Improved internal renaming of symbolic identifiers -- attach primes
2287 instead of base 26 numbers.
2289 * New flag show_question_marks controls printing of leading question
2290 marks in schematic variable names.
2292 * In schematic variable names, *any* symbol following \<^isub> or
2293 \<^isup> is now treated as part of the base name. For example, the
2294 following works without printing of awkward ".0" indexes:
2296 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
2299 * Inner syntax includes (*(*nested*) comments*).
2301 * Pretty printer now supports unbreakable blocks, specified in mixfix
2302 annotations as "(00...)".
2304 * Clear separation of logical types and nonterminals, where the latter
2305 may only occur in 'syntax' specifications or type abbreviations.
2306 Before that distinction was only partially implemented via type class
2307 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
2308 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
2309 exotic syntax specifications may require further adaption
2310 (e.g. Cube/Cube.thy).
2312 * Removed obsolete type class "logic", use the top sort {} instead.
2313 Note that non-logical types should be declared as 'nonterminals'
2314 rather than 'types'. INCOMPATIBILITY for new object-logic
2317 * Attributes 'induct' and 'cases': type or set names may now be
2318 locally fixed variables as well.
2320 * Simplifier: can now control the depth to which conditional rewriting
2321 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
2324 * Simplifier: simplification procedures may now take the current
2325 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
2326 interface), which is very useful for calling the Simplifier
2327 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
2328 is gone -- use prems_of_ss on the simpset instead. Moreover, the
2329 low-level mk_simproc no longer applies Logic.varify internally, to
2330 allow for use in a context of fixed variables.
2332 * thin_tac now works even if the assumption being deleted contains !!
2333 or ==>. More generally, erule now works even if the major premise of
2334 the elimination rule contains !! or ==>.
2336 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
2338 * Reorganized bootstrapping of the Pure theories; CPure is now derived
2339 from Pure, which contains all common declarations already. Both
2340 theories are defined via plain Isabelle/Isar .thy files.
2341 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
2342 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
2343 use isatool fixcpure to adapt your theory and ML sources.
2345 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
2346 selections of theorems in named facts via index ranges.
2348 * 'print_theorems': in theory mode, really print the difference
2349 wrt. the last state (works for interactive theory development only),
2350 in proof mode print all local facts (cf. 'print_facts');
2352 * 'hide': option '(open)' hides only base names.
2354 * More efficient treatment of intermediate checkpoints in interactive
2357 * Code generator is now invoked via code_module (incremental code
2358 generation) and code_library (modular code generation, ML structures
2359 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
2360 must be quoted when used as identifiers.
2362 * New 'value' command for reading, evaluating and printing terms using
2363 the code generator. INCOMPATIBILITY: command keyword 'value' must be
2364 quoted when used as identifier.
2369 * New commands for the interpretation of locale expressions in
2370 theories (1), locales (2) and proof contexts (3). These generate
2371 proof obligations from the expression specification. After the
2372 obligations have been discharged, theorems of the expression are added
2373 to the theory, target locale or proof context. The synopsis of the
2374 commands is a follows:
2376 (1) interpretation expr inst
2377 (2) interpretation target < expr
2378 (3) interpret expr inst
2380 Interpretation in theories and proof contexts require a parameter
2381 instantiation of terms from the current context. This is applied to
2382 specifications and theorems of the interpreted expression.
2383 Interpretation in locales only permits parameter renaming through the
2384 locale expression. Interpretation is smart in that interpretations
2385 that are active already do not occur in proof obligations, neither are
2386 instantiated theorems stored in duplicate. Use 'print_interps' to
2387 inspect active interpretations of a particular locale. For details,
2388 see the Isar Reference manual. Examples can be found in
2389 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
2391 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
2392 'interpret' instead.
2394 * New context element 'constrains' for adding type constraints to
2397 * Context expressions: renaming of parameters with syntax
2400 * Locale declaration: 'includes' disallowed.
2402 * Proper static binding of attribute syntax -- i.e. types / terms /
2403 facts mentioned as arguments are always those of the locale definition
2404 context, independently of the context of later invocations. Moreover,
2405 locale operations (renaming and type / term instantiation) are applied
2406 to attribute arguments as expected.
2408 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
2409 actual attributes; rare situations may require Attrib.attribute to
2410 embed those attributes into Attrib.src that lack concrete syntax.
2411 Attribute implementations need to cooperate properly with the static
2412 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
2413 Attrib.XXX_thm etc. already do the right thing without further
2414 intervention. Only unusual applications -- such as "where" or "of"
2415 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
2416 on the context and the facts involved -- may have to assign parsed
2417 values to argument tokens explicitly.
2419 * Changed parameter management in theorem generation for long goal
2420 statements with 'includes'. INCOMPATIBILITY: produces a different
2421 theorem statement in rare situations.
2423 * Locale inspection command 'print_locale' omits notes elements. Use
2424 'print_locale!' to have them included in the output.
2429 * Provers/hypsubst.ML: improved version of the subst method, for
2430 single-step rewriting: it now works in bound variable contexts. New is
2431 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
2432 rewrite a different subterm than the original subst method, which is
2433 still available as 'simplesubst'.
2435 * Provers/quasi.ML: new transitivity reasoners for transitivity only
2438 * Provers/trancl.ML: new transitivity reasoner for transitive and
2439 reflexive-transitive closure of relations.
2441 * Provers/blast.ML: new reference depth_limit to make blast's depth
2442 limit (previously hard-coded with a value of 20) user-definable.
2444 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
2445 is peformed already. Object-logics merely need to finish their
2446 initial simpset configuration as before. INCOMPATIBILITY.
2451 * Symbolic syntax of Hilbert Choice Operator is now as follows:
2454 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
2456 The symbol \<some> is displayed as the alternative epsilon of LaTeX
2457 and x-symbol; use option '-m epsilon' to get it actually printed.
2458 Moreover, the mathematically important symbolic identifier \<epsilon>
2459 becomes available as variable, constant etc. INCOMPATIBILITY,
2461 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
2462 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
2463 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
2464 support corresponding Isar calculations.
2466 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
2469 * theory SetInterval: changed the syntax for open intervals:
2478 The old syntax is still supported but will disappear in the next
2479 release. For conversion use the following Emacs search and replace
2480 patterns (these are not perfect but work quite well):
2482 {)\([^\.]*\)\.\. -> {\1<\.\.}
2483 \.\.\([^(}]*\)(} -> \.\.<\1}
2485 * Theory Commutative_Ring (in Library): method comm_ring for proving
2486 equalities in commutative rings; method 'algebra' provides a generic
2489 * Theory Finite_Set: changed the syntax for 'setsum', summation over
2490 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
2491 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
2494 Some new syntax forms are available:
2496 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
2497 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
2498 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
2499 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
2501 The latter form "\<Sum>x < k. e" used to be based on a separate
2502 function "Summation", which has been discontinued.
2504 * theory Finite_Set: in structured induction proofs, the insert case
2505 is now 'case (insert x F)' instead of the old counterintuitive 'case
2508 * The 'refute' command has been extended to support a much larger
2509 fragment of HOL, including axiomatic type classes, constdefs and
2510 typedefs, inductive datatypes and recursion.
2512 * New tactics 'sat' and 'satx' to prove propositional tautologies.
2513 Requires zChaff with proof generation to be installed. See
2514 HOL/ex/SAT_Examples.thy for examples.
2516 * Datatype induction via method 'induct' now preserves the name of the
2517 induction variable. For example, when proving P(xs::'a list) by
2518 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
2519 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
2520 in unstructured proof scripts.
2522 * Reworked implementation of records. Improved scalability for
2523 records with many fields, avoiding performance problems for type
2524 inference. Records are no longer composed of nested field types, but
2525 of nested extension types. Therefore the record type only grows linear
2526 in the number of extensions and not in the number of fields. The
2527 top-level (users) view on records is preserved. Potential
2528 INCOMPATIBILITY only in strange cases, where the theory depends on the
2529 old record representation. The type generated for a record is called
2530 <record_name>_ext_type.
2532 Flag record_quick_and_dirty_sensitive can be enabled to skip the
2533 proofs triggered by a record definition or a simproc (if
2534 quick_and_dirty is enabled). Definitions of large records can take
2537 New simproc record_upd_simproc for simplification of multiple record
2538 updates enabled by default. Moreover, trivial updates are also
2539 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
2540 occasionally, since simplification is more powerful by default.
2542 * typedef: proper support for polymorphic sets, which contain extra
2543 type-variables in the term.
2545 * Simplifier: automatically reasons about transitivity chains
2546 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
2547 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
2548 old proofs break occasionally as simplification may now solve more
2549 goals than previously.
2551 * Simplifier: converts x <= y into x = y if assumption y <= x is
2552 present. Works for all partial orders (class "order"), in particular
2553 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
2556 * Simplifier: new simproc for "let x = a in f x". If a is a free or
2557 bound variable or a constant then the let is unfolded. Otherwise
2558 first a is simplified to b, and then f b is simplified to g. If
2559 possible we abstract b from g arriving at "let x = b in h x",
2560 otherwise we unfold the let and arrive at g. The simproc can be
2561 enabled/disabled by the reference use_let_simproc. Potential
2562 INCOMPATIBILITY since simplification is more powerful by default.
2564 * Classical reasoning: the meson method now accepts theorems as arguments.
2566 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
2567 jobs to provide advice on the provability of subgoals.
2569 * Theory OrderedGroup and Ring_and_Field: various additions and
2570 improvements to faciliate calculations involving equalities and
2573 The following theorems have been eliminated or modified
2576 abs_eq now named abs_of_nonneg
2577 abs_of_ge_0 now named abs_of_nonneg
2578 abs_minus_eq now named abs_of_nonpos
2579 imp_abs_id now named abs_of_nonneg
2580 imp_abs_neg_id now named abs_of_nonpos
2581 mult_pos now named mult_pos_pos
2582 mult_pos_le now named mult_nonneg_nonneg
2583 mult_pos_neg_le now named mult_nonneg_nonpos
2584 mult_pos_neg2_le now named mult_nonneg_nonpos2
2585 mult_neg now named mult_neg_neg
2586 mult_neg_le now named mult_nonpos_nonpos
2588 * The following lemmas in Ring_and_Field have been added to the simplifier:
2591 not_square_less_zero
2593 The following lemmas have been deleted from Real/RealPow:
2603 * Theory Parity: added rules for simplifying exponents.
2607 The following theorems have been eliminated or modified
2610 list_all_Nil now named list_all.simps(1)
2611 list_all_Cons now named list_all.simps(2)
2612 list_all_conv now named list_all_iff
2613 set_mem_eq now named mem_iff
2615 * Theories SetsAndFunctions and BigO (see HOL/Library) support
2616 asymptotic "big O" calculations. See the notes in BigO.thy.
2621 * Theory RealDef: better support for embedding natural numbers and
2622 integers in the reals.
2624 The following theorems have been eliminated or modified
2627 exp_ge_add_one_self now requires no hypotheses
2628 real_of_int_add reversed direction of equality (use [symmetric])
2629 real_of_int_minus reversed direction of equality (use [symmetric])
2630 real_of_int_diff reversed direction of equality (use [symmetric])
2631 real_of_int_mult reversed direction of equality (use [symmetric])
2633 * Theory RComplete: expanded support for floor and ceiling functions.
2635 * Theory Ln is new, with properties of the natural logarithm
2637 * Hyperreal: There is a new type constructor "star" for making
2638 nonstandard types. The old type names are now type synonyms:
2642 hcomplex = complex star
2644 * Hyperreal: Many groups of similarly-defined constants have been
2645 replaced by polymorphic versions (INCOMPATIBILITY):
2647 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
2649 starset <-- starsetNat, starsetC
2650 *s* <-- *sNat*, *sc*
2651 starset_n <-- starsetNat_n, starsetC_n
2652 *sn* <-- *sNatn*, *scn*
2653 InternalSets <-- InternalNatSets, InternalCSets
2655 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2656 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
2657 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
2658 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
2659 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
2661 * Hyperreal: Many type-specific theorems have been removed in favor of
2662 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
2664 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
2665 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
2666 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
2667 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
2668 right_minus <-- hypreal_add_minus
2669 left_minus <-- {hypreal,hcomplex}_add_minus_left
2670 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
2671 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
2672 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
2673 mult_1_right <-- hcomplex_mult_one_right
2674 mult_zero_left <-- hcomplex_mult_zero_left
2675 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
2676 right_distrib <-- hypnat_add_mult_distrib2
2677 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
2678 right_inverse <-- hypreal_mult_inverse
2679 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
2680 order_refl <-- {hypreal,hypnat}_le_refl
2681 order_trans <-- {hypreal,hypnat}_le_trans
2682 order_antisym <-- {hypreal,hypnat}_le_anti_sym
2683 order_less_le <-- {hypreal,hypnat}_less_le
2684 linorder_linear <-- {hypreal,hypnat}_le_linear
2685 add_left_mono <-- {hypreal,hypnat}_add_left_mono
2686 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
2687 add_nonneg_nonneg <-- hypreal_le_add_order
2689 * Hyperreal: Separate theorems having to do with type-specific
2690 versions of constants have been merged into theorems that apply to the
2691 new polymorphic constants (INCOMPATIBILITY):
2693 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
2694 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
2695 STAR_Un <-- {STAR,NatStar,STARC}_Un
2696 STAR_Int <-- {STAR,NatStar,STARC}_Int
2697 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
2698 STAR_subset <-- {STAR,NatStar,STARC}_subset
2699 STAR_mem <-- {STAR,NatStar,STARC}_mem
2700 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
2701 STAR_diff <-- {STAR,STARC}_diff
2702 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
2703 STARC_hcomplex_of_complex}_image_subset
2704 starset_n_Un <-- starset{Nat,C}_n_Un
2705 starset_n_Int <-- starset{Nat,C}_n_Int
2706 starset_n_Compl <-- starset{Nat,C}_n_Compl
2707 starset_n_diff <-- starset{Nat,C}_n_diff
2708 InternalSets_Un <-- Internal{Nat,C}Sets_Un
2709 InternalSets_Int <-- Internal{Nat,C}Sets_Int
2710 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
2711 InternalSets_diff <-- Internal{Nat,C}Sets_diff
2712 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
2713 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
2714 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
2715 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
2716 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
2717 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2718 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
2719 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
2720 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
2721 starfun_diff <-- starfun{C,RC,CR}_diff
2722 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
2723 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
2724 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
2725 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
2726 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
2727 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
2728 starfun_Id <-- starfunC_Id
2729 starfun_approx <-- starfun{Nat,CR}_approx
2730 starfun_capprox <-- starfun{C,RC}_capprox
2731 starfun_abs <-- starfunNat_rabs
2732 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
2733 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
2734 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
2735 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
2736 starfun_add_capprox <-- starfun{C,RC}_add_capprox
2737 starfun_add_approx <-- starfunCR_add_approx
2738 starfun_inverse_inverse <-- starfunC_inverse_inverse
2739 starfun_divide <-- starfun{C,CR,RC}_divide
2740 starfun_n <-- starfun{Nat,C}_n
2741 starfun_n_mult <-- starfun{Nat,C}_n_mult
2742 starfun_n_add <-- starfun{Nat,C}_n_add
2743 starfun_n_add_minus <-- starfunNat_n_add_minus
2744 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
2745 starfun_n_minus <-- starfun{Nat,C}_n_minus
2746 starfun_n_eq <-- starfun{Nat,C}_n_eq
2748 star_n_add <-- {hypreal,hypnat,hcomplex}_add
2749 star_n_minus <-- {hypreal,hcomplex}_minus
2750 star_n_diff <-- {hypreal,hcomplex}_diff
2751 star_n_mult <-- {hypreal,hcomplex}_mult
2752 star_n_inverse <-- {hypreal,hcomplex}_inverse
2753 star_n_le <-- {hypreal,hypnat}_le
2754 star_n_less <-- {hypreal,hypnat}_less
2755 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
2756 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
2757 star_n_abs <-- hypreal_hrabs
2758 star_n_divide <-- hcomplex_divide
2760 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
2761 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
2762 star_of_diff <-- hypreal_of_real_diff
2763 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
2764 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
2765 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
2766 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
2767 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
2768 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
2769 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
2770 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
2771 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
2772 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
2773 star_of_number_of <-- {hypreal,hcomplex}_number_of
2774 star_of_number_less <-- number_of_less_hypreal_of_real_iff
2775 star_of_number_le <-- number_of_le_hypreal_of_real_iff
2776 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
2777 star_of_less_number <-- hypreal_of_real_less_number_of_iff
2778 star_of_le_number <-- hypreal_of_real_le_number_of_iff
2779 star_of_power <-- hypreal_of_real_power
2780 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
2782 * Hyperreal: new method "transfer" that implements the transfer
2783 principle of nonstandard analysis. With a subgoal that mentions
2784 nonstandard types like "'a star", the command "apply transfer"
2785 replaces it with an equivalent one that mentions only standard types.
2786 To be successful, all free variables must have standard types; non-
2787 standard variables must have explicit universal quantifiers.
2789 * Hyperreal: A theory of Taylor series.
2794 * Discontinued special version of 'constdefs' (which used to support
2795 continuous functions) in favor of the general Pure one with full
2798 * New simplification procedure for solving continuity conditions; it
2799 is much faster on terms with many nested lambda abstractions (cubic
2800 instead of exponential time).
2802 * New syntax for domain package: selector names are now optional.
2803 Parentheses should be omitted unless argument is lazy, for example:
2805 domain 'a stream = cons "'a" (lazy "'a stream")
2807 * New command 'fixrec' for defining recursive functions with pattern
2808 matching; defining multiple functions with mutual recursion is also
2809 supported. Patterns may include the constants cpair, spair, up, sinl,
2810 sinr, or any data constructor defined by the domain package. The given
2811 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
2812 syntax and examples.
2814 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
2815 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
2816 but the proof obligation additionally includes an admissibility
2817 requirement. The packages generate instances of class cpo or pcpo,
2818 with continuity and strictness theorems for Rep and Abs.
2820 * HOLCF: Many theorems have been renamed according to a more standard naming
2821 scheme (INCOMPATIBILITY):
2823 foo_inject: "foo$x = foo$y ==> x = y"
2824 foo_eq: "(foo$x = foo$y) = (x = y)"
2825 foo_less: "(foo$x << foo$y) = (x << y)"
2826 foo_strict: "foo$UU = UU"
2827 foo_defined: "... ==> foo$x ~= UU"
2828 foo_defined_iff: "(foo$x = UU) = (x = UU)"
2833 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
2834 including the First Isomorphism Theorem (on quotienting by the kernel
2837 * ZF/Simplifier: install second copy of type solver that actually
2838 makes use of TC rules declared to Isar proof contexts (or locales);
2839 the old version is still required for ML proof scripts.
2844 * Converted to Isar theory format; use locales instead of axiomatic
2850 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
2853 * Pure/library.ML no longer defines its own option datatype, but uses
2854 that of the SML basis, which has constructors NONE and SOME instead of
2855 None and Some, as well as exception Option.Option instead of OPTION.
2856 The functions the, if_none, is_some, is_none have been adapted
2857 accordingly, while Option.map replaces apsome.
2859 * Pure/library.ML: the exception LIST has been given up in favour of
2860 the standard exceptions Empty and Subscript, as well as
2861 Library.UnequalLengths. Function like Library.hd and Library.tl are
2862 superceded by the standard hd and tl functions etc.
2864 A number of basic list functions are no longer exported to the ML
2865 toplevel, as they are variants of predefined functions. The following
2866 suggests how one can translate existing code:
2868 rev_append xs ys = List.revAppend (xs, ys)
2869 nth_elem (i, xs) = List.nth (xs, i)
2870 last_elem xs = List.last xs
2871 flat xss = List.concat xss
2872 seq fs = List.app fs
2873 partition P xs = List.partition P xs
2874 mapfilter f xs = List.mapPartial f xs
2876 * Pure/library.ML: several combinators for linear functional
2877 transformations, notably reverse application and composition:
2880 (x, y) |-> f f #-> g
2882 * Pure/library.ML: introduced/changed precedence of infix operators:
2884 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
2886 infix 3 o oo ooo oooo;
2887 infix 4 ~~ upto downto;
2889 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
2892 * Pure/library.ML: natural list combinators fold, fold_rev, and
2893 fold_map support linear functional transformations and nesting. For
2896 fold f [x1, ..., xN] y =
2897 y |> f x1 |> ... |> f xN
2899 (fold o fold) f [xs1, ..., xsN] y =
2900 y |> fold f xs1 |> ... |> fold f xsN
2902 fold f [x1, ..., xN] =
2905 (fold o fold) f [xs1, ..., xsN] =
2906 fold f xs1 #> ... #> fold f xsN
2908 * Pure/library.ML: the following selectors on type 'a option are
2911 the: 'a option -> 'a (*partial*)
2912 these: 'a option -> 'a where 'a = 'b list
2913 the_default: 'a -> 'a option -> 'a
2914 the_list: 'a option -> 'a list
2916 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2917 basic operations for association lists, following natural argument
2918 order; moreover the explicit equality predicate passed here avoids
2919 potentially expensive polymorphic runtime equality checks.
2920 The old functions may be expressed as follows:
2922 assoc = uncurry (AList.lookup (op =))
2923 assocs = these oo AList.lookup (op =)
2924 overwrite = uncurry (AList.update (op =)) o swap
2926 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2928 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
2929 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
2931 replacing make_keylist and keyfilter (occassionally used)
2934 make_keylist = AList.make
2935 keyfilter = AList.find (op =)
2937 * eq_fst and eq_snd now take explicit equality parameter, thus
2938 avoiding eqtypes. Naive rewrites:
2940 eq_fst = eq_fst (op =)
2941 eq_snd = eq_snd (op =)
2943 * Removed deprecated apl and apr (rarely used).
2946 apl (n, op) =>>= curry op n
2947 apr (op, m) =>>= fn n => op (n, m)
2949 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
2950 provides a reasonably efficient light-weight implementation of sets as
2953 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
2954 few new operations; existing lookup and update are now curried to
2955 follow natural argument order (for use with fold etc.);
2956 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
2958 * Pure/General: output via the Isabelle channels of
2959 writeln/warning/error etc. is now passed through Output.output, with a
2960 hook for arbitrary transformations depending on the print_mode
2961 (cf. Output.add_mode -- the first active mode that provides a output
2962 function wins). Already formatted output may be embedded into further
2963 text via Output.raw; the result of Pretty.string_of/str_of and derived
2964 functions (string_of_term/cterm/thm etc.) is already marked raw to
2965 accommodate easy composition of diagnostic messages etc. Programmers
2966 rarely need to care about Output.output or Output.raw at all, with
2967 some notable exceptions: Output.output is required when bypassing the
2968 standard channels (writeln etc.), or in token translations to produce
2969 properly formatted results; Output.raw is required when capturing
2970 already output material that will eventually be presented to the user
2971 a second time. For the default print mode, both Output.output and
2972 Output.raw have no effect.
2974 * Pure/General: Output.time_accumulator NAME creates an operator ('a
2975 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
2976 cumulative results are displayed at the end of a batch session.
2978 * Pure/General: File.sysify_path and File.quote_sysify path have been
2979 replaced by File.platform_path and File.shell_path (with appropriate
2980 hooks). This provides a clean interface for unusual systems where the
2981 internal and external process view of file names are different.
2983 * Pure: more efficient orders for basic syntactic entities: added
2984 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
2985 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
2986 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
2987 orders now -- potential INCOMPATIBILITY for code that depends on a
2988 particular order for Symtab.keys, Symtab.dest, etc. (consider using
2989 Library.sort_strings on result).
2991 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
2992 fold_types traverse types/terms from left to right, observing natural
2993 argument order. Supercedes previous foldl_XXX versions, add_frees,
2994 add_vars etc. have been adapted as well: INCOMPATIBILITY.
2996 * Pure: name spaces have been refined, with significant changes of the
2997 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
2998 to extern(_table). The plain name entry path is superceded by a
2999 general 'naming' context, which also includes the 'policy' to produce
3000 a fully qualified name and external accesses of a fully qualified
3001 name; NameSpace.extend is superceded by context dependent
3002 Sign.declare_name. Several theory and proof context operations modify
3003 the naming context. Especially note Theory.restore_naming and
3004 ProofContext.restore_naming to get back to a sane state; note that
3005 Theory.add_path is no longer sufficient to recover from
3006 Theory.absolute_path in particular.
3008 * Pure: new flags short_names (default false) and unique_names
3009 (default true) for controlling output of qualified names. If
3010 short_names is set, names are printed unqualified. If unique_names is
3011 reset, the name prefix is reduced to the minimum required to achieve
3012 the original result when interning again, even if there is an overlap
3013 with earlier declarations.
3015 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
3016 now 'extend', and 'merge' gets an additional Pretty.pp argument
3017 (useful for printing error messages). INCOMPATIBILITY.
3019 * Pure: major reorganization of the theory context. Type Sign.sg and
3020 Theory.theory are now identified, referring to the universal
3021 Context.theory (see Pure/context.ML). Actual signature and theory
3022 content is managed as theory data. The old code and interfaces were
3023 spread over many files and structures; the new arrangement introduces
3024 considerable INCOMPATIBILITY to gain more clarity:
3026 Context -- theory management operations (name, identity, inclusion,
3027 parents, ancestors, merge, etc.), plus generic theory data;
3029 Sign -- logical signature and syntax operations (declaring consts,
3030 types, etc.), plus certify/read for common entities;
3032 Theory -- logical theory operations (stating axioms, definitions,
3033 oracles), plus a copy of logical signature operations (consts,
3034 types, etc.); also a few basic management operations (Theory.copy,
3037 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
3038 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
3039 for convenience -- they merely return the theory.
3041 * Pure: type Type.tsig is superceded by theory in most interfaces.
3043 * Pure: the Isar proof context type is already defined early in Pure
3044 as Context.proof (note that ProofContext.context and Proof.context are
3045 aliases, where the latter is the preferred name). This enables other
3046 Isabelle components to refer to that type even before Isar is present.
3048 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
3049 typeK, constK, axiomK, oracleK), but provide explicit operations for
3050 any of these kinds. For example, Sign.intern typeK is now
3051 Sign.intern_type, Theory.hide_space Sign.typeK is now
3052 Theory.hide_types. Also note that former
3053 Theory.hide_classes/types/consts are now
3054 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
3055 internalize their arguments! INCOMPATIBILITY.
3057 * Pure: get_thm interface (of PureThy and ProofContext) expects
3058 datatype thmref (with constructors Name and NameSelection) instead of
3059 plain string -- INCOMPATIBILITY;
3061 * Pure: cases produced by proof methods specify options, where NONE
3062 means to remove case bindings -- INCOMPATIBILITY in
3065 * Pure: the following operations retrieve axioms or theorems from a
3066 theory node or theory hierarchy, respectively:
3068 Theory.axioms_of: theory -> (string * term) list
3069 Theory.all_axioms_of: theory -> (string * term) list
3070 PureThy.thms_of: theory -> (string * thm) list
3071 PureThy.all_thms_of: theory -> (string * thm) list
3073 * Pure: print_tac now outputs the goal through the trace channel.
3075 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
3076 Reference Toplevel.debug (default false) controls detailed printing
3077 and tracing of low-level exceptions; Toplevel.profiling (default 0)
3078 controls execution profiling -- set to 1 for time and 2 for space
3079 (both increase the runtime).
3081 * Isar session: The initial use of ROOT.ML is now always timed,
3082 i.e. the log will show the actual process times, in contrast to the
3083 elapsed wall-clock time that the outer shell wrapper produces.
3085 * Simplifier: improved handling of bound variables (nameless
3086 representation, avoid allocating new strings). Simprocs that invoke
3087 the Simplifier recursively should use Simplifier.inherit_bounds to
3088 avoid local name clashes. Failure to do so produces warnings
3089 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
3090 for further details.
3092 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
3093 bindings for all theorems stored within a given theory; this may help
3094 in porting non-Isar theories to Isar ones, while keeping ML proof
3095 scripts for the time being.
3097 * ML operator HTML.with_charset specifies the charset begin used for
3098 generated HTML files. For example:
3100 HTML.with_charset "utf-8" use_thy "Hebrew";
3101 HTML.with_charset "utf-8" use_thy "Chinese";
3106 * Allow symlinks to all proper Isabelle executables (Isabelle,
3107 isabelle, isatool etc.).
3109 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
3110 isatool doc, isatool mkdir, display_drafts etc.).
3112 * isatool usedir: option -f allows specification of the ML file to be
3113 used by Isabelle; default is ROOT.ML.
3115 * New isatool version outputs the version identifier of the Isabelle
3116 distribution being used.
3118 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
3119 (containing Boolean satisfiability problems) into Isabelle/HOL
3124 New in Isabelle2004 (April 2004)
3125 --------------------------------
3129 * Provers/order.ML: new efficient reasoner for partial and linear orders.
3130 Replaces linorder.ML.
3132 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
3133 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
3134 (\<a>...\<z>), are now considered normal letters, and can therefore
3135 be used anywhere where an ASCII letter (a...zA...Z) has until
3136 now. COMPATIBILITY: This obviously changes the parsing of some
3137 terms, especially where a symbol has been used as a binder, say
3138 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
3139 as an identifier. Fix it by inserting a space around former
3140 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
3141 existing theory and ML files.
3143 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
3145 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
3146 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
3147 a normal (but invisible) letter. For multiple letter subscripts repeat
3148 \<^isub> like this: x\<^isub>1\<^isub>2.
3150 * Pure: There are now sub-/superscripts that can span more than one
3151 character. Text between \<^bsub> and \<^esub> is set in subscript in
3152 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
3153 superscript. The new control characters are not identifier parts.
3155 * Pure: Control-symbols of the form \<^raw:...> will literally print the
3156 content of "..." to the latex file instead of \isacntrl... . The "..."
3157 may consist of any printable characters excluding the end bracket >.
3159 * Pure: Using new Isar command "finalconsts" (or the ML functions
3160 Theory.add_finals or Theory.add_finals_i) it is now possible to
3161 declare constants "final", which prevents their being given a definition
3162 later. It is useful for constants whose behaviour is fixed axiomatically
3163 rather than definitionally, such as the meta-logic connectives.
3165 * Pure: 'instance' now handles general arities with general sorts
3166 (i.e. intersections of classes),
3168 * Presentation: generated HTML now uses a CSS style sheet to make layout
3169 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
3170 It can be changed to alter the colors/layout of generated pages.
3175 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
3176 cut_tac, subgoal_tac and thin_tac:
3177 - Now understand static (Isar) contexts. As a consequence, users of Isar
3178 locales are no longer forced to write Isar proof scripts.
3179 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
3181 - INCOMPATIBILITY: names of variables to be instantiated may no
3182 longer be enclosed in quotes. Instead, precede variable name with `?'.
3183 This is consistent with the instantiation attribute "where".
3185 * Attributes "where" and "of":
3186 - Now take type variables of instantiated theorem into account when reading
3187 the instantiation string. This fixes a bug that caused instantiated
3188 theorems to have too special types in some circumstances.
3189 - "where" permits explicit instantiations of type variables.
3191 * Calculation commands "moreover" and "also" no longer interfere with
3192 current facts ("this"), admitting arbitrary combinations with "then"
3196 - Goal statements involving the context element "includes" no longer
3197 generate theorems with internal delta predicates (those ending on
3198 "_axioms") in the premise.
3199 Resolve particular premise with <locale>.intro to obtain old form.
3200 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
3201 specification and "includes" elements in goal statement.
3202 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
3203 [intro?] and [elim?] (respectively) by default.
3204 - Experimental command for instantiation of locales in proof contexts:
3205 instantiate <label>[<attrs>]: <loc>
3206 Instantiates locale <loc> and adds all its theorems to the current context
3207 taking into account their attributes. Label and attrs are optional
3208 modifiers, like in theorem declarations. If present, names of
3209 instantiated theorems are qualified with <label>, and the attributes
3210 <attrs> are applied after any attributes these theorems might have already.
3211 If the locale has assumptions, a chained fact of the form
3212 "<loc> t1 ... tn" is expected from which instantiations of the parameters
3213 are derived. The command does not support old-style locales declared
3214 with "locale (open)".
3215 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
3217 * HOL: Tactic emulation methods induct_tac and case_tac understand static
3223 * Proof import: new image HOL4 contains the imported library from
3224 the HOL4 system with about 2500 theorems. It is imported by
3225 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
3226 can be used like any other Isabelle image. See
3227 HOL/Import/HOL/README for more information.
3230 - Much improved handling of linear and partial orders.
3231 Reasoners for linear and partial orders are set up for type classes
3232 "linorder" and "order" respectively, and are added to the default simpset
3233 as solvers. This means that the simplifier can build transitivity chains
3234 to solve goals from the assumptions.
3235 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
3236 of blast or auto after simplification become unnecessary because the goal
3237 is solved by simplification already.
3239 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
3240 all proved in axiomatic type classes for semirings, rings and fields.
3243 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
3244 now formalized using the Ring_and_Field theory mentioned above.
3245 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
3246 than before, because now they are set up once in a generic manner.
3247 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
3248 Look for the general versions in Ring_and_Field (and Power if they concern
3251 * Type "rat" of the rational numbers is now available in HOL-Complex.
3254 - Record types are now by default printed with their type abbreviation
3255 instead of the list of all field types. This can be configured via
3256 the reference "print_record_type_abbr".
3257 - Simproc "record_upd_simproc" for simplification of multiple updates added
3258 (not enabled by default).
3259 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
3260 EX x. x = sel r to True (not enabled by default).
3261 - Tactic "record_split_simp_tac" to split and simplify records added.
3263 * 'specification' command added, allowing for definition by
3264 specification. There is also an 'ax_specification' command that
3265 introduces the new constants axiomatically.
3267 * arith(_tac) is now able to generate counterexamples for reals as well.
3269 * HOL-Algebra: new locale "ring" for non-commutative rings.
3271 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
3272 definitions, thanks to Sava Krsti\'{c} and John Matthews.
3274 * HOL-Matrix: a first theory for matrices in HOL with an application of
3275 matrix theory to linear programming.
3277 * Unions and Intersections:
3278 The latex output syntax of UN and INT has been changed
3279 from "\Union x \in A. B" to "\Union_{x \in A} B"
3280 i.e. the index formulae has become a subscript.
3281 Similarly for "\Union x. B", and for \Inter instead of \Union.
3283 * Unions and Intersections over Intervals:
3284 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
3285 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
3286 like in normal math, and corresponding versions for < and for intersection.
3288 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
3289 lexicographic dictonary ordering has been added as "lexord".
3291 * ML: the legacy theory structures Int and List have been removed. They had
3292 conflicted with ML Basis Library structures having the same names.
3294 * 'refute' command added to search for (finite) countermodels. Only works
3295 for a fragment of HOL. The installation of an external SAT solver is
3296 highly recommended. See "HOL/Refute.thy" for details.
3298 * 'quickcheck' command: Allows to find counterexamples by evaluating
3299 formulae under an assignment of free variables to random values.
3300 In contrast to 'refute', it can deal with inductive datatypes,
3301 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
3307 * Streams now come with concatenation and are part of the HOLCF image
3311 New in Isabelle2003 (May 2003)
3312 ------------------------------
3316 * Provers/simplifier:
3318 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
3319 Assumptions are now subject to complete mutual simplification,
3320 not just from left to right. The simplifier now preserves
3321 the order of assumptions.
3323 Potential INCOMPATIBILITY:
3325 -- simp sometimes diverges where the old version did
3326 not, e.g. invoking simp on the goal
3328 [| P (f x); y = x; f x = f y |] ==> Q
3330 now gives rise to the infinite reduction sequence
3332 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
3334 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
3337 -- Tactics combining classical reasoner and simplification (such as auto)
3338 are also affected by this change, because many of them rely on
3339 simp. They may sometimes diverge as well or yield a different numbers
3340 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
3341 in case of problems. Sometimes subsequent calls to the classical
3342 reasoner will fail because a preceeding call to the simplifier too
3343 eagerly simplified the goal, e.g. deleted redundant premises.
3345 - The simplifier trace now shows the names of the applied rewrite rules
3347 - You can limit the number of recursive invocations of the simplifier
3348 during conditional rewriting (where the simplifie tries to solve the
3349 conditions before applying the rewrite rule):
3350 ML "simp_depth_limit := n"
3351 where n is an integer. Thus you can force termination where previously
3352 the simplifier would diverge.
3354 - Accepts free variables as head terms in congruence rules. Useful in Isar.
3356 - No longer aborts on failed congruence proof. Instead, the
3357 congruence is ignored.
3359 * Pure: New generic framework for extracting programs from constructive
3360 proofs. See HOL/Extraction.thy for an example instantiation, as well
3361 as HOL/Extraction for some case studies.
3363 * Pure: The main goal of the proof state is no longer shown by default, only
3364 the subgoals. This behaviour is controlled by a new flag.
3365 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
3366 (ML: Proof.show_main_goal).
3368 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
3369 rules whose conclusion matches subgoal 1:
3370 PG menu: Isabelle/Isar -> Show me -> matching rules
3371 The rules are ordered by how closely they match the subgoal.
3372 In particular, rules that solve a subgoal outright are displayed first
3373 (or rather last, the way they are printed).
3374 (ML: ProofGeneral.print_intros())
3376 * Pure: New flag trace_unify_fail causes unification to print
3377 diagnostic information (PG: in trace buffer) when it fails. This is
3378 useful for figuring out why single step proofs like rule, erule or
3381 * Pure: Locale specifications now produce predicate definitions
3382 according to the body of text (covering assumptions modulo local
3383 definitions); predicate "loc_axioms" covers newly introduced text,
3384 while "loc" is cumulative wrt. all included locale expressions; the
3385 latter view is presented only on export into the global theory
3386 context; potential INCOMPATIBILITY, use "(open)" option to fall back
3387 on the old view without predicates;
3389 * Pure: predefined locales "var" and "struct" are useful for sharing
3390 parameters (as in CASL, for example); just specify something like
3391 ``var x + var y + struct M'' as import;
3393 * Pure: improved thms_containing: proper indexing of facts instead of
3394 raw theorems; check validity of results wrt. current name space;
3395 include local facts of proof configuration (also covers active
3396 locales), cover fixed variables in index; may use "_" in term
3397 specification; an optional limit for the number of printed facts may
3398 be given (the default is 40);
3400 * Pure: disallow duplicate fact bindings within new-style theory files
3403 * Provers: improved induct method: assumptions introduced by case
3404 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
3405 the goal statement); "foo" still refers to all facts collectively;
3407 * Provers: the function blast.overloaded has been removed: all constants
3408 are regarded as potentially overloaded, which improves robustness in exchange
3409 for slight decrease in efficiency;
3411 * Provers/linorder: New generic prover for transitivity reasoning over
3412 linear orders. Note: this prover is not efficient!
3414 * Isar: preview of problems to finish 'show' now produce an error
3415 rather than just a warning (in interactive mode);
3422 - Produces a counter example if it cannot prove a goal.
3423 Note that the counter example may be spurious if the goal is not a formula
3424 of quantifier-free linear arithmetic.
3425 In ProofGeneral the counter example appears in the trace buffer.
3427 - Knows about div k and mod k where k is a numeral of type nat or int.
3429 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
3430 linear arithmetic fails. This takes account of quantifiers and divisibility.
3431 Presburger arithmetic can also be called explicitly via presburger(_tac).
3433 * simp's arithmetic capabilities have been enhanced a bit: it now
3434 takes ~= in premises into account (by performing a case split);
3436 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
3437 are distributed over a sum of terms;
3439 * New tactic "trans_tac" and method "trans" instantiate
3440 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
3443 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
3444 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
3446 * 'typedef' command has new option "open" to suppress the set
3449 * functions Min and Max on finite sets have been introduced (theory
3452 * attribute [symmetric] now works for relations as well; it turns
3453 (x,y) : R^-1 into (y,x) : R, and vice versa;
3455 * induct over a !!-quantified statement (say !!x1..xn):
3456 each "case" automatically performs "fix x1 .. xn" with exactly those names.
3458 * Map: `empty' is no longer a constant but a syntactic abbreviation for
3459 %x. None. Warning: empty_def now refers to the previously hidden definition
3462 * Algebra: formalization of classical algebra. Intended as base for
3463 any algebraic development in Isabelle. Currently covers group theory
3464 (up to Sylow's theorem) and ring theory (Universal Property of
3465 Univariate Polynomials). Contributions welcome;
3467 * GroupTheory: deleted, since its material has been moved to Algebra;
3469 * Complex: new directory of the complex numbers with numeric constants,
3470 nonstandard complex numbers, and some complex analysis, standard and
3471 nonstandard (Jacques Fleuriot);
3473 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
3475 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
3478 * Real/HahnBanach: updated and adapted to locales;
3480 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
3483 * UNITY: added the Meier-Sanders theory of progress sets;
3485 * MicroJava: bytecode verifier and lightweight bytecode verifier
3486 as abstract algorithms, instantiated to the JVM;
3488 * Bali: Java source language formalization. Type system, operational
3489 semantics, axiomatic semantics. Supported language features:
3490 classes, interfaces, objects,virtual methods, static methods,
3491 static/instance fields, arrays, access modifiers, definite
3492 assignment, exceptions.
3497 * ZF/Constructible: consistency proof for AC (Gdel's constructible
3500 * Main ZF: virtually all theories converted to new-style format;
3505 * Pure: Tactic.prove provides sane interface for internal proofs;
3506 omits the infamous "standard" operation, so this is more appropriate
3507 than prove_goalw_cterm in many situations (e.g. in simprocs);
3509 * Pure: improved error reporting of simprocs;
3511 * Provers: Simplifier.simproc(_i) provides sane interface for setting
3515 *** Document preparation ***
3517 * uses \par instead of \\ for line breaks in theory text. This may
3518 shift some page breaks in large documents. To get the old behaviour
3519 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
3521 * minimized dependencies of isabelle.sty and isabellesym.sty on
3524 * \<euro> now needs package babel/greek instead of marvosym (which
3527 * normal size for \<zero>...\<nine> (uses \mathbf instead of
3532 New in Isabelle2002 (March 2002)
3533 --------------------------------
3535 *** Document preparation ***
3537 * greatly simplified document preparation setup, including more
3538 graceful interpretation of isatool usedir -i/-d/-D options, and more
3539 instructive isatool mkdir; users should basically be able to get
3540 started with "isatool mkdir HOL Test && isatool make"; alternatively,
3541 users may run a separate document processing stage manually like this:
3542 "isatool usedir -D output HOL Test && isatool document Test/output";
3544 * theory dependency graph may now be incorporated into documents;
3545 isatool usedir -g true will produce session_graph.eps/.pdf for use
3546 with \includegraphics of LaTeX;
3548 * proper spacing of consecutive markup elements, especially text
3549 blocks after section headings;
3551 * support bold style (for single symbols only), input syntax is like
3552 this: "\<^bold>\<alpha>" or "\<^bold>A";
3554 * \<bullet> is now output as bold \cdot by default, which looks much
3555 better in printed text;
3557 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
3558 note that these symbols are currently unavailable in Proof General /
3559 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
3561 * isatool latex no longer depends on changed TEXINPUTS, instead
3562 isatool document copies the Isabelle style files to the target
3568 * Pure/Provers: improved proof by cases and induction;
3569 - 'case' command admits impromptu naming of parameters (such as
3571 - 'induct' method divinates rule instantiation from the inductive
3572 claim; no longer requires excessive ?P bindings for proper
3573 instantiation of cases;
3574 - 'induct' method properly enumerates all possibilities of set/type
3575 rules; as a consequence facts may be also passed through *type*
3576 rules without further ado;
3577 - 'induct' method now derives symbolic cases from the *rulified*
3578 rule (before it used to rulify cases stemming from the internal
3579 atomized version); this means that the context of a non-atomic
3580 statement becomes is included in the hypothesis, avoiding the
3581 slightly cumbersome show "PROP ?case" form;
3582 - 'induct' may now use elim-style induction rules without chaining
3583 facts, using ``missing'' premises from the goal state; this allows
3584 rules stemming from inductive sets to be applied in unstructured
3585 scripts, while still benefitting from proper handling of non-atomic
3586 statements; NB: major inductive premises need to be put first, all
3587 the rest of the goal is passed through the induction;
3588 - 'induct' proper support for mutual induction involving non-atomic
3589 rule statements (uses the new concept of simultaneous goals, see
3591 - append all possible rule selections, but only use the first
3592 success (no backtracking);
3593 - removed obsolete "(simplified)" and "(stripped)" options of methods;
3594 - undeclared rule case names default to numbers 1, 2, 3, ...;
3595 - added 'print_induct_rules' (covered by help item in recent Proof
3597 - moved induct/cases attributes to Pure, methods to Provers;
3598 - generic method setup instantiated for FOL and HOL;
3600 * Pure: support multiple simultaneous goal statements, for example
3601 "have a: A and b: B" (same for 'theorem' etc.); being a pure
3602 meta-level mechanism, this acts as if several individual goals had
3603 been stated separately; in particular common proof methods need to be
3604 repeated in order to cover all claims; note that a single elimination
3605 step is *not* sufficient to establish the two conjunctions, so this
3608 assume "A & B" then have A and B .. (*".." fails*)
3610 better use "obtain" in situations as above; alternative refer to
3611 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
3613 * Pure: proper integration with ``locales''; unlike the original
3614 version by Florian Kammller, Isar locales package high-level proof
3615 contexts rather than raw logical ones (e.g. we admit to include
3616 attributes everywhere); operations on locales include merge and
3617 rename; support for implicit arguments (``structures''); simultaneous
3618 type-inference over imports and text; see also HOL/ex/Locales.thy for
3621 * Pure: the following commands have been ``localized'', supporting a
3622 target locale specification "(in name)": 'lemma', 'theorem',
3623 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
3624 stored both within the locale and at the theory level (exported and
3625 qualified by the locale name);
3627 * Pure: theory goals may now be specified in ``long'' form, with
3628 ad-hoc contexts consisting of arbitrary locale elements. for example
3629 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
3630 definitions may be given, too); the result is a meta-level rule with
3631 the context elements being discharged in the obvious way;
3633 * Pure: new proof command 'using' allows to augment currently used
3634 facts after a goal statement ('using' is syntactically analogous to
3635 'apply', but acts on the goal's facts only); this allows chained facts
3636 to be separated into parts given before and after a claim, as in
3637 ``from a and b have C using d and e <proof>'';
3639 * Pure: renamed "antecedent" case to "rule_context";
3641 * Pure: new 'judgment' command records explicit information about the
3642 object-logic embedding (used by several tools internally); no longer
3643 use hard-wired "Trueprop";
3645 * Pure: added 'corollary' command;
3647 * Pure: fixed 'token_translation' command;
3649 * Pure: removed obsolete 'exported' attribute;
3651 * Pure: dummy pattern "_" in is/let is now automatically lifted over
3652 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
3653 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
3655 * Pure: method 'atomize' presents local goal premises as object-level
3656 statements (atomic meta-level propositions); setup controlled via
3657 rewrite rules declarations of 'atomize' attribute; example
3658 application: 'induct' method with proper rule statements in improper
3661 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
3662 now consider the syntactic context of assumptions, giving a better
3663 chance to get type-inference of the arguments right (this is
3664 especially important for locales);
3666 * Pure: "sorry" no longer requires quick_and_dirty in interactive
3669 * Pure/obtain: the formal conclusion "thesis", being marked as
3670 ``internal'', may no longer be reference directly in the text;
3671 potential INCOMPATIBILITY, may need to use "?thesis" in rare
3674 * Pure: generic 'sym' attribute which declares a rule both as pure
3675 'elim?' and for the 'symmetric' operation;
3677 * Pure: marginal comments ``--'' may now occur just anywhere in the
3678 text; the fixed correlation with particular command syntax has been
3681 * Pure: new method 'rules' is particularly well-suited for proof
3682 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
3683 but often produces more compact proof terms with less detours;
3685 * Pure/Provers/classical: simplified integration with pure rule
3686 attributes and methods; the classical "intro?/elim?/dest?"
3687 declarations coincide with the pure ones; the "rule" method no longer
3688 includes classically swapped intros; "intro" and "elim" methods no
3689 longer pick rules from the context; also got rid of ML declarations
3690 AddXIs/AddXEs/AddXDs; all of this has some potential for
3693 * Provers/classical: attribute 'swapped' produces classical inversions
3694 of introduction rules;
3696 * Provers/simplifier: 'simplified' attribute may refer to explicit
3697 rules instead of full simplifier context; 'iff' attribute handles
3700 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
3702 * HOL: 'recdef' now fails on unfinished automated proofs, use
3703 "(permissive)" option to recover old behavior;
3705 * HOL: 'inductive' no longer features separate (collective) attributes
3706 for 'intros' (was found too confusing);
3708 * HOL: properly declared induction rules less_induct and
3714 * HOL: moved over to sane numeral syntax; the new policy is as
3717 - 0 and 1 are polymorphic constants, which are defined on any
3718 numeric type (nat, int, real etc.);
3720 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
3721 binary representation internally;
3723 - type nat has special constructor Suc, and generally prefers Suc 0
3724 over 1::nat and Suc (Suc 0) over 2::nat;
3726 This change may cause significant problems of INCOMPATIBILITY; here
3727 are some hints on converting existing sources:
3729 - due to the new "num" token, "-0" and "-1" etc. are now atomic
3730 entities, so expressions involving "-" (unary or binary minus) need
3731 to be spaced properly;
3733 - existing occurrences of "1" may need to be constraint "1::nat" or
3734 even replaced by Suc 0; similar for old "2";
3736 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
3738 - remove all special provisions on numerals in proofs;
3740 * HOL: simp rules nat_number expand numerals on nat to Suc/0
3741 representation (depends on bin_arith_simps in the default context);
3743 * HOL: symbolic syntax for x^2 (numeral 2);
3745 * HOL: the class of all HOL types is now called "type" rather than
3746 "term"; INCOMPATIBILITY, need to adapt references to this type class
3747 in axclass/classes, instance/arities, and (usually rare) occurrences
3748 in typings (of consts etc.); internally the class is called
3749 "HOL.type", ML programs should refer to HOLogic.typeS;
3751 * HOL/record package improvements:
3752 - new derived operations "fields" to build a partial record section,
3753 "extend" to promote a fixed record to a record scheme, and
3754 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
3755 declared as simp by default;
3756 - shared operations ("more", "fields", etc.) now need to be always
3757 qualified) --- potential INCOMPATIBILITY;
3758 - removed "make_scheme" operations (use "make" with "extend") --
3760 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
3761 - provides cases/induct rules for use with corresponding Isar
3762 methods (for concrete records, record schemes, concrete more
3763 parts, and schematic more parts -- in that order);
3764 - internal definitions directly based on a light-weight abstract
3765 theory of product types over typedef rather than datatype;
3767 * HOL: generic code generator for generating executable ML code from
3768 specifications; specific support for HOL constructs such as inductive
3769 datatypes and sets, as well as recursive functions; can be invoked
3770 via 'generate_code' theory section;
3772 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
3774 * HOL: consolidated and renamed several theories. In particular:
3775 Ord.thy has been absorbed into HOL.thy
3776 String.thy has been absorbed into List.thy
3778 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
3779 (beware of argument permutation!);
3781 * HOL: linorder_less_split superseded by linorder_cases;
3783 * HOL/List: "nodups" renamed to "distinct";
3785 * HOL: added "The" definite description operator; move Hilbert's "Eps"
3786 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
3787 - Ex_def has changed, now need to use some_eq_ex
3789 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
3790 in this (rare) case use:
3792 delSWrapper "split_all_tac"
3793 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
3795 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
3798 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
3799 Isabelle's type classes, ^ on functions and relations has too general
3800 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
3801 necessary to attach explicit type constraints;
3803 * HOL/Relation: the prefix name of the infix "O" has been changed from
3804 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
3805 renamed accordingly (eg "compI" -> "rel_compI").
3807 * HOL: syntax translations now work properly with numerals and records
3810 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
3811 of "lam" -- INCOMPATIBILITY;
3813 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
3814 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
3815 renamed "Product_Type.unit";
3817 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
3819 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
3820 the "cases" method);
3822 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
3825 * HOL/IMP: updated and converted to new-style theory format; several
3826 parts turned into readable document, with proper Isar proof texts and
3827 some explanations (by Gerwin Klein);
3829 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
3831 * HOL-Hyperreal is now a logic image;
3836 * Isar: consts/constdefs supports mixfix syntax for continuous
3839 * Isar: domain package adapted to new-style theory format, e.g. see
3842 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
3843 potential INCOMPATIBILITY; now use plain induct_tac instead of former
3844 lift.induct_tac, always use UU instead of Undef;
3846 * HOLCF/IMP: updated and converted to new-style theory;
3851 * Isar: proper integration of logic-specific tools and packages,
3852 including theory commands '(co)inductive', '(co)datatype',
3853 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
3854 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
3856 * theory Main no longer includes AC; for the Axiom of Choice, base
3857 your theory on Main_ZFC;
3859 * the integer library now covers quotients and remainders, with many
3860 laws relating division to addition, multiplication, etc.;
3862 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
3863 typeless version of the formalism;
3865 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
3868 * ZF/Induct: new directory for examples of inductive definitions,
3869 including theory Multiset for multiset orderings; converted to
3870 new-style theory format;
3872 * ZF: many new theorems about lists, ordinals, etc.;
3877 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
3878 variable proof controls level of detail: 0 = no proofs (only oracle
3879 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
3880 also ref manual for further ML interfaces;
3882 * Pure/axclass: removed obsolete ML interface
3883 goal_subclass/goal_arity;
3885 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
3886 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
3887 separate tokens, so expressions involving minus need to be spaced
3890 * Pure/syntax: support non-oriented infixes, using keyword "infix"
3891 rather than "infixl" or "infixr";
3893 * Pure/syntax: concrete syntax for dummy type variables admits genuine
3894 sort constraint specifications in type inference; e.g. "x::_::foo"
3895 ensures that the type of "x" is of sort "foo" (but not necessarily a
3898 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
3899 control output of nested => (types); the default behavior is
3902 * Pure/syntax: builtin parse translation for "_constify" turns valued
3903 tokens into AST constants;
3905 * Pure/syntax: prefer later declarations of translations and print
3906 translation functions; potential INCOMPATIBILITY: need to reverse
3907 multiple declarations for same syntax element constant;
3909 * Pure/show_hyps reset by default (in accordance to existing Isar
3912 * Provers/classical: renamed addaltern to addafter, addSaltern to
3915 * Provers/clasimp: ``iff'' declarations now handle conditional rules
3918 * system: tested support for MacOS X; should be able to get Isabelle +
3919 Proof General to work in a plain Terminal after installing Poly/ML
3920 (e.g. from the Isabelle distribution area) and GNU bash alone
3921 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
3922 support requires further installations, e.g. from
3923 http://fink.sourceforge.net/);
3925 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
3927 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
3928 of 40 MB), cf. ML_OPTIONS;
3930 * system: Proof General keywords specification is now part of the
3931 Isabelle distribution (see etc/isar-keywords.el);
3933 * system: support for persistent Proof General sessions (refrain from
3934 outdating all loaded theories on startup); user may create writable
3935 logic images like this: ``isabelle -q HOL Test'';
3937 * system: smart selection of Isabelle process versus Isabelle
3938 interface, accommodates case-insensitive file systems (e.g. HFS+); may
3939 run both "isabelle" and "Isabelle" even if file names are badly
3940 damaged (executable inspects the case of the first letter of its own
3941 name); added separate "isabelle-process" and "isabelle-interface";
3943 * system: refrain from any attempt at filtering input streams; no
3944 longer support ``8bit'' encoding of old isabelle font, instead proper
3945 iso-latin characters may now be used; the related isatools
3946 "symbolinput" and "nonascii" have disappeared as well;
3948 * system: removed old "xterm" interface (the print modes "xterm" and
3949 "xterm_color" are still available for direct use in a suitable
3954 New in Isabelle99-2 (February 2001)
3955 -----------------------------------
3957 *** Overview of INCOMPATIBILITIES ***
3959 * HOL: please note that theories in the Library and elsewhere often use the
3960 new-style (Isar) format; to refer to their theorems in an ML script you must
3961 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
3963 * HOL: inductive package no longer splits induction rule aggressively,
3964 but only as far as specified by the introductions given; the old
3965 format may be recovered via ML function complete_split_rule or attribute
3966 'split_rule (complete)';
3968 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
3969 gfp_Tarski to gfp_unfold;
3971 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
3973 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
3974 relation); infix "^^" has been renamed "``"; infix "``" has been
3975 renamed "`"; "univalent" has been renamed "single_valued";
3977 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
3980 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
3982 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
3984 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
3985 consequence, it is no longer monotonic wrt. the local goal context
3986 (which is now passed through the inductive cases);
3988 * Document preparation: renamed standard symbols \<ll> to \<lless> and
3989 \<gg> to \<ggreater>;
3992 *** Document preparation ***
3994 * \isabellestyle{NAME} selects version of Isabelle output (currently
3995 available: are "it" for near math-mode best-style output, "sl" for
3996 slanted text style, and "tt" for plain type-writer; if no
3997 \isabellestyle command is given, output is according to slanted
4000 * support sub/super scripts (for single symbols only), input syntax is
4001 like this: "A\<^sup>*" or "A\<^sup>\<star>";
4003 * some more standard symbols; see Appendix A of the system manual for
4004 the complete list of symbols defined in isabellesym.sty;
4006 * improved isabelle style files; more abstract symbol implementation
4007 (should now use \isamath{...} and \isatext{...} in custom symbol
4010 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
4011 state; Note that presentation of goal states does not conform to
4012 actual human-readable proof documents. Please do not include goal
4013 states into document output unless you really know what you are doing!
4015 * proper indentation of antiquoted output with proportional LaTeX
4018 * no_document ML operator temporarily disables LaTeX document
4021 * isatool unsymbolize tunes sources for plain ASCII communication;
4026 * Pure: Isar now suffers initial goal statements to contain unbound
4027 schematic variables (this does not conform to actual readable proof
4028 documents, due to unpredictable outcome and non-compositional proof
4029 checking); users who know what they are doing may use schematic goals
4030 for Prolog-style synthesis of proven results;
4032 * Pure: assumption method (an implicit finishing) now handles actual
4035 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
4036 initial goal, declare "that" only as Pure intro (only for single
4037 steps); the "that" rule assumption may now be involved in implicit
4038 finishing, thus ".." becomes a feasible for trivial obtains;
4040 * Pure: default proof step now includes 'intro_classes'; thus trivial
4041 instance proofs may be performed by "..";
4043 * Pure: ?thesis / ?this / "..." now work for pure meta-level
4046 * Pure: more robust selection of calculational rules;
4048 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
4049 rule (as well as the assumption rule);
4051 * Pure: 'thm_deps' command visualizes dependencies of theorems and
4052 lemmas, using the graph browser tool;
4054 * Pure: predict failure of "show" in interactive mode;
4056 * Pure: 'thms_containing' now takes actual terms as arguments;
4058 * HOL: improved method 'induct' --- now handles non-atomic goals
4059 (potential INCOMPATIBILITY); tuned error handling;
4061 * HOL: cases and induct rules now provide explicit hints about the
4062 number of facts to be consumed (0 for "type" and 1 for "set" rules);
4063 any remaining facts are inserted into the goal verbatim;
4065 * HOL: local contexts (aka cases) may now contain term bindings as
4066 well; the 'cases' and 'induct' methods new provide a ?case binding for
4067 the result to be shown in each case;
4069 * HOL: added 'recdef_tc' command;
4071 * isatool convert assists in eliminating legacy ML scripts;
4076 * HOL/Library: a collection of generic theories to be used together
4077 with main HOL; the theory loader path already includes this directory
4078 by default; the following existing theories have been moved here:
4079 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
4080 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
4082 * HOL/Unix: "Some aspects of Unix file-system security", a typical
4083 modelling and verification task performed in Isabelle/HOL +
4084 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
4086 * HOL/Algebra: special summation operator SUM no longer exists, it has
4087 been replaced by setsum; infix 'assoc' now has priority 50 (like
4088 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
4089 'domain', this makes the theory consistent with mathematical
4092 * HOL basics: added overloaded operations "inverse" and "divide"
4093 (infix "/"), syntax for generic "abs" operation, generic summation
4096 * HOL/typedef: simplified package, provide more useful rules (see also
4099 * HOL/datatype: induction rule for arbitrarily branching datatypes is
4100 now expressed as a proper nested rule (old-style tactic scripts may
4101 require atomize_strip_tac to cope with non-atomic premises);
4103 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
4104 to "split_conv" (old name still available for compatibility);
4106 * HOL: improved concrete syntax for strings (e.g. allows translation
4107 rules with string literals);
4109 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
4110 and Fleuriot's mechanization of analysis, including the transcendental
4111 functions for the reals;
4113 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
4118 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
4119 "lam" is displayed as TWO lambda-symbols
4121 * CTT: theory Main now available, containing everything (that is, Bool
4127 * Pure: the Simplifier has been implemented properly as a derived rule
4128 outside of the actual kernel (at last!); the overall performance
4129 penalty in practical applications is about 50%, while reliability of
4130 the Isabelle inference kernel has been greatly improved;
4132 * print modes "brackets" and "no_brackets" control output of nested =>
4133 (types) and ==> (props); the default behaviour is "brackets";
4135 * Provers: fast_tac (and friends) now handle actual object-logic rules
4136 as assumptions as well;
4138 * system: support Poly/ML 4.0;
4140 * system: isatool install handles KDE version 1 or 2;
4144 New in Isabelle99-1 (October 2000)
4145 ----------------------------------
4147 *** Overview of INCOMPATIBILITIES ***
4149 * HOL: simplification of natural numbers is much changed; to partly
4150 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
4151 issue the following ML commands:
4153 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
4154 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
4156 * HOL: simplification no longer dives into case-expressions; this is
4157 controlled by "t.weak_case_cong" for each datatype t;
4159 * HOL: nat_less_induct renamed to less_induct;
4161 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
4162 fixsome to patch .thy and .ML sources automatically;
4164 select_equality -> some_equality
4165 select_eq_Ex -> some_eq_ex
4166 selectI2EX -> someI2_ex
4169 select1_equality -> some1_equality
4170 Eps_sym_eq -> some_sym_eq_trivial
4171 Eps_eq -> some_eq_trivial
4173 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
4175 * HOL: removed obsolete theorem binding expand_if (refer to split_if
4178 * HOL: the recursion equations generated by 'recdef' are now called
4179 f.simps instead of f.rules;
4181 * HOL: qed_spec_mp now also handles bounded ALL as well;
4183 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
4184 sometimes be needed;
4186 * HOL: the constant for "f``x" is now "image" rather than "op ``";
4188 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
4190 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
4191 product is now "<*>" instead of "Times"; the lexicographic product is
4192 now "<*lex*>" instead of "**";
4194 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
4195 of main HOL, but was unused); better use HOL's datatype package;
4197 * HOL: removed "symbols" syntax for constant "override" of theory Map;
4198 the old syntax may be recovered as follows:
4201 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
4202 (infixl "\\<oplus>" 100)
4204 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4206 * HOL/ML: even fewer consts are declared as global (see theories Ord,
4207 Lfp, Gfp, WF); this only affects ML packages that refer to const names
4210 * HOL and ZF: syntax for quotienting wrt an equivalence relation
4211 changed from A/r to A//r;
4213 * ZF: new treatment of arithmetic (nat & int) may break some old
4216 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
4217 rulify -> rule_format, elimify -> elim_format, ...);
4219 * Isar/Provers: intro/elim/dest attributes changed; renamed
4220 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
4221 should have to change intro!! to intro? only); replaced "delrule" by
4224 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
4226 * Provers: strengthened force_tac by using new first_best_tac;
4228 * LaTeX document preparation: several changes of isabelle.sty (see
4232 *** Document preparation ***
4234 * formal comments (text blocks etc.) in new-style theories may now
4235 contain antiquotations of thm/prop/term/typ/text to be presented
4236 according to latex print mode; concrete syntax is like this:
4237 @{term[show_types] "f(x) = a + x"};
4239 * isatool mkdir provides easy setup of Isabelle session directories,
4240 including proper document sources;
4242 * generated LaTeX sources are now deleted after successful run
4243 (isatool document -c); may retain a copy somewhere else via -D option
4246 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
4247 style files, achieving self-contained LaTeX sources and simplifying
4250 * old-style theories now produce (crude) LaTeX output as well;
4252 * browser info session directories are now self-contained (may be put
4253 on WWW server seperately); improved graphs of nested sessions; removed
4254 graph for 'all sessions';
4256 * several improvements in isabelle style files; \isabellestyle{it}
4257 produces fake math mode output; \isamarkupheader is now \section by
4258 default; see lib/texinputs/isabelle.sty etc.;
4263 * Isar/Pure: local results and corresponding term bindings are now
4264 subject to Hindley-Milner polymorphism (similar to ML); this
4265 accommodates incremental type-inference very nicely;
4267 * Isar/Pure: new derived language element 'obtain' supports
4268 generalized existence reasoning;
4270 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
4271 support accumulation of results, without applying any rules yet;
4272 useful to collect intermediate results without explicit name
4273 references, and for use with transitivity rules with more than 2
4276 * Isar/Pure: scalable support for case-analysis type proofs: new
4277 'case' language element refers to local contexts symbolically, as
4278 produced by certain proof methods; internally, case names are attached
4279 to theorems as "tags";
4281 * Isar/Pure: theory command 'hide' removes declarations from
4282 class/type/const name spaces;
4284 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
4285 indicate potential overloading;
4287 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
4289 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
4290 "{a,b,c}" instead of {a,b,c};
4292 * Isar/Pure now provides its own version of intro/elim/dest
4293 attributes; useful for building new logics, but beware of confusion
4294 with the version in Provers/classical;
4296 * Isar/Pure: the local context of (non-atomic) goals is provided via
4297 case name 'antecedent';
4299 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
4300 to the current context is now done automatically);
4302 * Isar/Pure: theory command 'method_setup' provides a simple interface
4303 for definining proof methods in ML;
4305 * Isar/Provers: intro/elim/dest attributes changed; renamed
4306 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
4307 most cases, one should have to change intro!! to intro? only);
4308 replaced "delrule" by "rule del";
4310 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
4311 'symmetric' attribute (the latter supercedes [RS sym]);
4313 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
4314 method modifier); 'simp' method: 'only:' modifier removes loopers as
4315 well (including splits);
4317 * Isar/Provers: Simplifier and Classical methods now support all kind
4318 of modifiers used in the past, including 'cong', 'iff', etc.
4320 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
4321 of Simplifier and Classical reasoner);
4323 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
4324 now support named cases; major packages (inductive, datatype, primrec,
4325 recdef) support case names and properly name parameters;
4327 * Isar/HOL: new transitivity rules for substitution in inequalities --
4328 monotonicity conditions are extracted to be proven at end of
4331 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
4334 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
4335 split_if split_if_asm; datatype package provides theorems foo.splits =
4336 foo.split foo.split_asm for each datatype;
4338 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
4339 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
4340 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
4341 use "(cases (simplified))" method in proper proof texts);
4343 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
4345 * Isar: names of theorems etc. may be natural numbers as well;
4347 * Isar: 'pr' command: optional arguments for goals_limit and
4348 ProofContext.prems_limit; no longer prints theory contexts, but only
4351 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
4352 additional print modes to be specified; e.g. "pr(latex)" will print
4353 proof state according to the Isabelle LaTeX style;
4355 * Isar: improved support for emulating tactic scripts, including proof
4356 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
4357 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
4358 (for HOL datatypes);
4360 * Isar: simplified (more robust) goal selection of proof methods: 1st
4361 goal, all goals, or explicit goal specifier (tactic emulation); thus
4362 'proof method scripts' have to be in depth-first order;
4364 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
4366 * Isar: removed 'help' command, which hasn't been too helpful anyway;
4367 should instead use individual commands for printing items
4368 (print_commands, print_methods etc.);
4370 * Isar: added 'nothing' --- the empty list of theorems;
4375 * HOL/MicroJava: formalization of a fragment of Java, together with a
4376 corresponding virtual machine and a specification of its bytecode
4377 verifier and a lightweight bytecode verifier, including proofs of
4378 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
4379 Cornelia Pusch (see also the homepage of project Bali at
4380 http://isabelle.in.tum.de/Bali/);
4382 * HOL/Algebra: new theory of rings and univariate polynomials, by
4385 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
4386 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
4389 * HOL/Lattice: fundamental concepts of lattice theory and order
4390 structures, including duals, properties of bounds versus algebraic
4391 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
4392 Theorem for complete lattices etc.; may also serve as a demonstration
4393 for abstract algebraic reasoning using axiomatic type classes, and
4394 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
4396 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
4399 * HOL/IMPP: extension of IMP with local variables and mutually
4400 recursive procedures, by David von Oheimb;
4402 * HOL/Lambda: converted into new-style theory and document;
4404 * HOL/ex/Multiquote: example of multiple nested quotations and
4405 anti-quotations -- basically a generalized version of de-Bruijn
4406 representation; very useful in avoiding lifting of operations;
4408 * HOL/record: added general record equality rule to simpset; fixed
4409 select-update simplification procedure to handle extended records as
4410 well; admit "r" as field name;
4412 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
4413 other numeric types and also as the identity of groups, rings, etc.;
4415 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
4416 Types nat and int belong to this axclass;
4418 * HOL: greatly improved simplification involving numerals of type nat, int, real:
4419 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
4420 i*j + k + j*#3*i simplifies to #4*(i*j) + k
4421 two terms #m*u and #n*u are replaced by #(m+n)*u
4422 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
4423 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
4424 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
4426 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
4427 powerful prover for predicate logic but knows nothing of clasets; see
4428 ex/mesontest.ML and ex/mesontest2.ML for example applications;
4430 * HOL: new version of "case_tac" subsumes both boolean case split and
4431 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
4432 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
4434 * HOL: simplification no longer dives into case-expressions: only the
4435 selector expression is simplified, but not the remaining arms; to
4436 enable full simplification of case-expressions for datatype t, you may
4437 remove t.weak_case_cong from the simpset, either globally (Delcongs
4438 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
4440 * HOL/recdef: the recursion equations generated by 'recdef' for
4441 function 'f' are now called f.simps instead of f.rules; if all
4442 termination conditions are proved automatically, these simplification
4443 rules are added to the simpset, as in primrec; rules may be named
4444 individually as well, resulting in a separate list of theorems for
4447 * HOL/While is a new theory that provides a while-combinator. It
4448 permits the definition of tail-recursive functions without the
4449 provision of a termination measure. The latter is necessary once the
4450 invariant proof rule for while is applied.
4452 * HOL: new (overloaded) notation for the set of elements below/above
4453 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
4455 * HOL: theorems impI, allI, ballI bound as "strip";
4457 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
4458 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
4459 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
4461 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4463 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
4464 main HOL, but was unused);
4466 * HOL: fewer consts declared as global (e.g. have to refer to
4467 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
4469 * HOL: tuned AST representation of nested pairs, avoiding bogus output
4470 in case of overlap with user translations (e.g. judgements over
4471 tuples); (note that the underlying logical represenation is still
4477 * ZF: simplification automatically cancels common terms in arithmetic
4478 expressions over nat and int;
4480 * ZF: new treatment of nat to minimize type-checking: all operators
4481 coerce their operands to a natural number using the function natify,
4482 making the algebraic laws unconditional;
4484 * ZF: as above, for int: operators coerce their operands to an integer
4485 using the function intify;
4487 * ZF: the integer library now contains many of the usual laws for the
4488 orderings, including $<=, and monotonicity laws for $+ and $*;
4490 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
4493 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
4494 to the simplifier and classical reasoner simultaneously;
4499 * Provers: blast_tac now handles actual object-logic rules as
4500 assumptions; note that auto_tac uses blast_tac internally as well;
4502 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
4503 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
4505 * Provers: delrules now handles destruct rules as well (no longer need
4506 explicit make_elim);
4508 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
4509 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4510 use instead the strong form,
4511 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4512 in HOL, FOL and ZF the function cla_make_elim will create such rules
4513 from destruct-rules;
4515 * Provers: Simplifier.easy_setup provides a fast path to basic
4516 Simplifier setup for new object-logics;
4518 * Pure: AST translation rules no longer require constant head on LHS;
4520 * Pure: improved name spaces: ambiguous output is qualified; support
4521 for hiding of names;
4523 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
4524 XSYMBOL_HOME; no longer need to do manual configuration in most
4527 * system: compression of ML heaps images may now be controlled via -c
4528 option of isabelle and isatool usedir (currently only observed by
4531 * system: isatool installfonts may handle X-Symbol fonts as well (very
4532 useful for remote X11);
4534 * system: provide TAGS file for Isabelle sources;
4536 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
4539 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
4540 timing flag supersedes proof_timing and Toplevel.trace;
4542 * ML: new combinators |>> and |>>> for incremental transformations
4543 with secondary results (e.g. certain theory extensions):
4545 * ML: PureThy.add_defs gets additional argument to indicate potential
4546 overloading (usually false);
4548 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
4553 New in Isabelle99 (October 1999)
4554 --------------------------------
4556 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4558 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
4559 are no longer simplified. (This allows the simplifier to unfold recursive
4560 functional programs.) To restore the old behaviour, declare
4562 Delcongs [if_weak_cong];
4564 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
4567 * HOL: the predicate "inj" is now defined by translation to "inj_on";
4569 * HOL/datatype: mutual_induct_tac no longer exists --
4570 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
4572 * HOL/typedef: fixed type inference for representing set; type
4573 arguments now have to occur explicitly on the rhs as type constraints;
4575 * ZF: The con_defs part of an inductive definition may no longer refer
4576 to constants declared in the same theory;
4578 * HOL, ZF: the function mk_cases, generated by the inductive
4579 definition package, has lost an argument. To simplify its result, it
4580 uses the default simpset instead of a supplied list of theorems.
4582 * HOL/List: the constructors of type list are now Nil and Cons;
4584 * Simplifier: the type of the infix ML functions
4585 setSSolver addSSolver setSolver addSolver
4586 is now simpset * solver -> simpset where `solver' is a new abstract type
4587 for packaging solvers. A solver is created via
4588 mk_solver: string -> (thm list -> int -> tactic) -> solver
4589 where the string argument is only a comment.
4594 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
4595 decision procedure for linear arithmetic. Currently it is used for
4596 types `nat', `int', and `real' in HOL (see below); it can, should and
4597 will be instantiated for other types and logics as well.
4599 * The simplifier now accepts rewrite rules with flexible heads, eg
4600 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
4601 They are applied like any rule with a non-pattern lhs, i.e. by first-order
4607 * New Isabelle/Isar subsystem provides an alternative to traditional
4608 tactical theorem proving; together with the ProofGeneral/isar user
4609 interface it offers an interactive environment for developing human
4610 readable proof documents (Isar == Intelligible semi-automated
4611 reasoning); for further information see isatool doc isar-ref,
4612 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
4614 * improved and simplified presentation of theories: better HTML markup
4615 (including colors), graph views in several sizes; isatool usedir now
4616 provides a proper interface for user theories (via -P option); actual
4617 document preparation based on (PDF)LaTeX is available as well (for
4618 new-style theories only); see isatool doc system for more information;
4620 * native support for Proof General, both for classic Isabelle and
4623 * ML function thm_deps visualizes dependencies of theorems and lemmas,
4624 using the graph browser tool;
4626 * Isabelle manuals now also available as PDF;
4628 * theory loader rewritten from scratch (may not be fully
4629 bug-compatible); old loadpath variable has been replaced by show_path,
4630 add_path, del_path, reset_path functions; new operations such as
4631 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
4634 * improved isatool install: option -k creates KDE application icon,
4635 option -p DIR installs standalone binaries;
4637 * added ML_PLATFORM setting (useful for cross-platform installations);
4638 more robust handling of platform specific ML images for SML/NJ;
4640 * the settings environment is now statically scoped, i.e. it is never
4641 created again in sub-processes invoked from isabelle, isatool, or
4644 * path element specification '~~' refers to '$ISABELLE_HOME';
4646 * in locales, the "assumes" and "defines" parts may be omitted if
4649 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
4652 * new print_mode "HTML";
4654 * new flag show_tags controls display of tags of theorems (which are
4655 basically just comments that may be attached by some tools);
4657 * Isamode 2.6 requires patch to accomodate change of Isabelle font
4658 mode and goal output format:
4660 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
4662 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
4664 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
4665 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
4667 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
4669 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
4671 * function bind_thms stores lists of theorems (cf. bind_thm);
4673 * new shorthand tactics ftac, eatac, datac, fatac;
4675 * qed (and friends) now accept "" as result name; in that case the
4676 theorem is not stored, but proper checks and presentation of the
4679 * theorem database now also indexes constants "Trueprop", "all",
4680 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
4685 ** HOL arithmetic **
4687 * There are now decision procedures for linear arithmetic over nat and
4690 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
4691 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
4692 are treated as atomic; subformulae not involving type `nat' or `int'
4693 are ignored; quantified subformulae are ignored unless they are
4694 positive universal or negative existential. The tactic has to be
4695 invoked by hand and can be a little bit slow. In particular, the
4696 running time is exponential in the number of occurrences of `min' and
4697 `max', and `-' on `nat'.
4699 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
4700 (negated) (in)equalities among the premises and the conclusion into
4701 account (i.e. no compound formulae) and does not know about `min' and
4702 `max', and `-' on `nat'. It is fast and is used automatically by the
4705 NB: At the moment, these decision procedures do not cope with mixed
4706 nat/int formulae where the two parts interact, such as `m < n ==>
4709 * HOL/Numeral provides a generic theory of numerals (encoded
4710 efficiently as bit strings); setup for types nat/int/real is in place;
4711 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
4712 int, existing theories and proof scripts may require a few additional
4715 * integer division and remainder can now be performed on constant
4718 * many properties of integer multiplication, division and remainder
4721 * An interface to the Stanford Validity Checker (SVC) is available through the
4722 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
4723 are proved automatically. SVC must be installed separately, and its results
4724 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
4725 invocation of the underlying oracle). For SVC see
4726 http://verify.stanford.edu/SVC
4728 * IsaMakefile: the HOL-Real target now builds an actual image;
4733 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
4734 (in Isabelle/Isar) -- by Gertrud Bauer;
4736 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
4737 analysis for assembly languages with subtypes;
4739 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
4740 -- avoids syntactic ambiguities and treats state, transition, and
4741 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
4742 changed syntax and (many) tactics;
4744 * HOL/inductive: Now also handles more general introduction rules such
4745 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
4746 theorems are now maintained within the theory (maintained via the
4749 * HOL/datatype: Now also handles arbitrarily branching datatypes
4750 (using function types) such as
4752 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
4754 * HOL/record: record_simproc (part of the default simpset) takes care
4755 of selectors applied to updated records; record_split_tac is no longer
4756 part of the default claset; update_defs may now be removed from the
4757 simpset in many cases; COMPATIBILITY: old behavior achieved by
4759 claset_ref () := claset() addSWrapper record_split_wrapper;
4760 Delsimprocs [record_simproc]
4762 * HOL/typedef: fixed type inference for representing set; type
4763 arguments now have to occur explicitly on the rhs as type constraints;
4765 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
4766 names rather than an ML expression;
4768 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
4769 supplied later. Program schemes can be defined, such as
4770 "While B C s = (if B s then While B C (C s) else s)"
4771 where the well-founded relation can be chosen after B and C have been given.
4773 * HOL/List: the constructors of type list are now Nil and Cons;
4774 INCOMPATIBILITY: while [] and infix # syntax is still there, of
4775 course, ML tools referring to List.list.op # etc. have to be adapted;
4777 * HOL_quantifiers flag superseded by "HOL" print mode, which is
4778 disabled by default; run isabelle with option -m HOL to get back to
4779 the original Gordon/HOL-style output;
4781 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
4782 ALL x<=y. P, EX x<y. P, EX x<=y. P;
4784 * HOL basic syntax simplified (more orthogonal): all variants of
4785 All/Ex now support plain / symbolic / HOL notation; plain syntax for
4786 Eps operator is provided as well: "SOME x. P[x]";
4788 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
4790 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
4791 thus available for user theories;
4793 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
4794 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
4797 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
4798 several times and then mp;
4803 * the notation <<...>> is now available as a notation for sequences of
4806 * the simplifier is now installed
4808 * the axiom system has been generalized (thanks to Soren Heilmann)
4810 * the classical reasoner now has a default rule database
4815 * new primrec section allows primitive recursive functions to be given
4816 directly (as in HOL) over datatypes and the natural numbers;
4818 * new tactics induct_tac and exhaust_tac for induction (or case
4819 analysis) over datatypes and the natural numbers;
4821 * the datatype declaration of type T now defines the recursor T_rec;
4823 * simplification automatically does freeness reasoning for datatype
4826 * automatic type-inference, with AddTCs command to insert new
4827 type-checking rules;
4829 * datatype introduction rules are now added as Safe Introduction rules
4832 * the syntax "if P then x else y" is now available in addition to
4836 *** Internal programming interfaces ***
4838 * tuned simplifier trace output; new flag debug_simp;
4840 * structures Vartab / Termtab (instances of TableFun) offer efficient
4841 tables indexed by indexname_ord / term_ord (compatible with aconv);
4843 * AxClass.axclass_tac lost the theory argument;
4845 * tuned current_goals_markers semantics: begin / end goal avoids
4846 printing empty lines;
4848 * removed prs and prs_fn hook, which was broken because it did not
4849 include \n in its semantics, forcing writeln to add one
4850 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
4851 string -> unit if you really want to output text without newline;
4853 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
4854 plain output, interface builders may have to enable 'isabelle_font'
4855 mode to get Isabelle font glyphs as before;
4857 * refined token_translation interface; INCOMPATIBILITY: output length
4858 now of type real instead of int;
4860 * theory loader actions may be traced via new ThyInfo.add_hook
4861 interface (see src/Pure/Thy/thy_info.ML); example application: keep
4862 your own database of information attached to *whole* theories -- as
4863 opposed to intra-theory data slots offered via TheoryDataFun;
4865 * proper handling of dangling sort hypotheses (at last!);
4866 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
4867 extra sort hypotheses that can be witnessed from the type signature;
4868 the force_strip_shyps flag is gone, any remaining shyps are simply
4869 left in the theorem (with a warning issued by strip_shyps_warning);
4873 New in Isabelle98-1 (October 1998)
4874 ----------------------------------
4876 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4878 * several changes of automated proof tools;
4880 * HOL: major changes to the inductive and datatype packages, including
4881 some minor incompatibilities of theory syntax;
4883 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
4886 * HOL: removed duplicate thms in Arith:
4887 less_imp_add_less should be replaced by trans_less_add1
4888 le_imp_add_le should be replaced by trans_le_add1
4890 * HOL: unary minus is now overloaded (new type constraints may be
4893 * HOL and ZF: unary minus for integers is now #- instead of #~. In
4894 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
4895 now taken as an integer constant.
4897 * Pure: ML function 'theory_of' renamed to 'theory';
4903 1. Asm_full_simp_tac is now more aggressive.
4904 1. It will sometimes reorient premises if that increases their power to
4906 2. It does no longer proceed strictly from left to right but may also
4907 rotate premises to achieve further simplification.
4908 For compatibility reasons there is now Asm_lr_simp_tac which is like the
4909 old Asm_full_simp_tac in that it does not rotate premises.
4910 2. The simplifier now knows a little bit about nat-arithmetic.
4912 * Classical reasoner: wrapper mechanism for the classical reasoner now
4913 allows for selected deletion of wrappers, by introduction of names for
4914 wrapper functionals. This implies that addbefore, addSbefore,
4915 addaltern, and addSaltern now take a pair (name, tactic) as argument,
4916 and that adding two tactics with the same name overwrites the first
4917 one (emitting a warning).
4918 type wrapper = (int -> tactic) -> (int -> tactic)
4919 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
4920 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
4921 delWrapper, delSWrapper: claset * string -> claset
4922 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
4924 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
4925 semantics; addbefore now affects only the unsafe part of step_tac
4926 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
4927 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
4930 * Classical reasoner: setwrapper to setWrapper and compwrapper to
4931 compWrapper; added safe wrapper (and access functions for it);
4933 * HOL/split_all_tac is now much faster and fails if there is nothing
4934 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
4935 and the names of the automatically generated variables have changed.
4936 split_all_tac has moved within claset() from unsafe wrappers to safe
4937 wrappers, which means that !!-bound variables are split much more
4938 aggressively, and safe_tac and clarify_tac now split such variables.
4939 If this splitting is not appropriate, use delSWrapper "split_all_tac".
4940 Note: the same holds for record_split_tac, which does the job of
4941 split_all_tac for record fields.
4943 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
4944 permanently to the default simpset using Addsplits just like
4945 Addsimps. They can be removed via Delsplits just like
4946 Delsimps. Lower-case versions are also available.
4948 * HOL/Simplifier: The rule split_if is now part of the default
4949 simpset. This means that the simplifier will eliminate all occurrences
4950 of if-then-else in the conclusion of a goal. To prevent this, you can
4951 either remove split_if completely from the default simpset by
4952 `Delsplits [split_if]' or remove it in a specific call of the
4953 simplifier using `... delsplits [split_if]'. You can also add/delete
4954 other case splitting rules to/from the default simpset: every datatype
4955 generates suitable rules `split_t_case' and `split_t_case_asm' (where
4956 t is the name of the datatype).
4958 * Classical reasoner / Simplifier combination: new force_tac (and
4959 derivatives Force_tac, force) combines rewriting and classical
4960 reasoning (and whatever other tools) similarly to auto_tac, but is
4961 aimed to solve the given subgoal completely.
4966 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
4967 and `goalw': the theory is no longer needed as an explicit argument -
4968 the current theory context is used; assumptions are no longer returned
4969 at the ML-level unless one of them starts with ==> or !!; it is
4970 recommended to convert to these new commands using isatool fixgoal
4971 (backup your sources first!);
4973 * new top-level commands 'thm' and 'thms' for retrieving theorems from
4974 the current theory context, and 'theory' to lookup stored theories;
4976 * new theory section 'locale' for declaring constants, assumptions and
4977 definitions that have local scope;
4979 * new theory section 'nonterminals' for purely syntactic types;
4981 * new theory section 'setup' for generic ML setup functions
4982 (e.g. package initialization);
4984 * the distribution now includes Isabelle icons: see
4985 lib/logo/isabelle-{small,tiny}.xpm;
4987 * isatool install - install binaries with absolute references to
4990 * isatool logo -- create instances of the Isabelle logo (as EPS);
4992 * print mode 'emacs' reserved for Isamode;
4994 * support multiple print (ast) translations per constant name;
4996 * theorems involving oracles are now printed with a suffixed [!];
5001 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
5003 * HOL/inductive package reorganized and improved: now supports mutual
5009 oddI "n : EVEN ==> Suc n : ODD"
5010 evenI "n : ODD ==> Suc n : EVEN"
5012 new theorem list "elims" contains an elimination rule for each of the
5013 recursive sets; inductive definitions now handle disjunctive premises
5014 correctly (also ZF);
5016 INCOMPATIBILITIES: requires Inductive as an ancestor; component
5017 "mutual_induct" no longer exists - the induction rule is always
5018 contained in "induct";
5021 * HOL/datatype package re-implemented and greatly improved: now
5022 supports mutually recursive datatypes such as
5025 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
5026 | SUM ('a aexp) ('a aexp)
5027 | DIFF ('a aexp) ('a aexp)
5030 'a bexp = LESS ('a aexp) ('a aexp)
5031 | AND ('a bexp) ('a bexp)
5032 | OR ('a bexp) ('a bexp)
5034 as well as indirectly recursive datatypes such as
5037 ('a, 'b) term = Var 'a
5038 | App 'b ((('a, 'b) term) list)
5040 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
5041 induction on mutually / indirectly recursive datatypes.
5043 Primrec equations are now stored in theory and can be accessed via
5044 <function_name>.simps.
5048 - Theories using datatypes must now have theory Datatype as an
5050 - The specific <typename>.induct_tac no longer exists - use the
5051 generic induct_tac instead.
5052 - natE has been renamed to nat.exhaust - use exhaust_tac
5053 instead of res_inst_tac ... natE. Note that the variable
5054 names in nat.exhaust differ from the names in natE, this
5055 may cause some "fragile" proofs to fail.
5056 - The theorems split_<typename>_case and split_<typename>_case_asm
5057 have been renamed to <typename>.split and <typename>.split_asm.
5058 - Since default sorts of type variables are now handled correctly,
5059 some datatype definitions may have to be annotated with explicit
5061 - Primrec definitions no longer require function name and type
5062 of recursive argument.
5064 Consider using isatool fixdatatype to adapt your theories and proof
5065 scripts to the new package (backup your sources first!).
5068 * HOL/record package: considerably improved implementation; now
5069 includes concrete syntax for record types, terms, updates; theorems
5070 for surjective pairing and splitting !!-bound record variables; proof
5071 support is as follows:
5073 1) standard conversions (selectors or updates applied to record
5074 constructor terms) are part of the standard simpset;
5076 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
5077 made part of standard simpset and claset via addIffs;
5079 3) a tactic for record field splitting (record_split_tac) is part of
5080 the standard claset (addSWrapper);
5082 To get a better idea about these rules you may retrieve them via
5083 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
5084 the name of your record type.
5086 The split tactic 3) conceptually simplifies by the following rule:
5088 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
5090 Thus any record variable that is bound by meta-all will automatically
5091 blow up into some record constructor term, consequently the
5092 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
5093 solve record problems automatically.
5096 * reorganized the main HOL image: HOL/Integ and String loaded by
5097 default; theory Main includes everything;
5099 * automatic simplification of integer sums and comparisons, using cancellation;
5101 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
5103 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
5105 * many new identities for unions, intersections, set difference, etc.;
5107 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
5108 called split_if, split_split, split_sum_case and split_nat_case (to go
5109 with add/delsplits);
5111 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
5112 (?x::unit) = (); this is made part of the default simpset, which COULD
5113 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
5114 'Delsimprocs [unit_eq_proc];' as last resort); also note that
5115 unit_abs_eta_conv is added in order to counter the effect of
5116 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
5119 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
5122 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5123 It and 'sym RS equals0D' are now in the default claset, giving automatic
5124 disjointness reasoning but breaking a few old proofs.
5126 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
5127 to 'converse' from 'inverse' (for compatibility with ZF and some
5130 * HOL/recdef can now declare non-recursive functions, with {} supplied as
5131 the well-founded relation;
5133 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
5134 Compl A. The "Compl" syntax remains available as input syntax for this
5137 * HOL/Update: new theory of function updates:
5138 f(a:=b) == %x. if x=a then b else f x
5139 may also be iterated as in f(a:=b,c:=d,...);
5141 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
5144 - new function list_update written xs[i:=v] that updates the i-th
5145 list position. May also be iterated as in xs[i:=a,j:=b,...].
5146 - new function `upt' written [i..j(] which generates the list
5147 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
5148 bound write [i..j], which is a shorthand for [i..j+1(].
5149 - new lexicographic orderings and corresponding wellfoundedness theorems.
5152 - removed 'pred' (predecessor) function;
5153 - generalized some theorems about n-1;
5154 - many new laws about "div" and "mod";
5155 - new laws about greatest common divisors (see theory ex/Primes);
5157 * HOL/Relation: renamed the relational operator r^-1 "converse"
5158 instead of "inverse";
5160 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
5161 of the multiset ordering;
5163 * directory HOL/Real: a construction of the reals using Dedekind cuts
5164 (not included by default);
5166 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
5168 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
5169 programs, i.e. different program variables may have different types.
5171 * calling (stac rew i) now fails if "rew" has no effect on the goal
5172 [previously, this check worked only if the rewrite rule was unconditional]
5173 Now rew can involve either definitions or equalities (either == or =).
5178 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
5179 only the theorems proved on ZF.ML;
5181 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5182 It and 'sym RS equals0D' are now in the default claset, giving automatic
5183 disjointness reasoning but breaking a few old proofs.
5185 * ZF/Update: new theory of function updates
5186 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
5187 may also be iterated as in f(a:=b,c:=d,...);
5189 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
5191 * calling (stac rew i) now fails if "rew" has no effect on the goal
5192 [previously, this check worked only if the rewrite rule was unconditional]
5193 Now rew can involve either definitions or equalities (either == or =).
5195 * case_tac provided for compatibility with HOL
5196 (like the old excluded_middle_tac, but with subgoals swapped)
5199 *** Internal programming interfaces ***
5201 * Pure: several new basic modules made available for general use, see
5202 also src/Pure/README;
5204 * improved the theory data mechanism to support encapsulation (data
5205 kind name replaced by private Object.kind, acting as authorization
5206 key); new type-safe user interface via functor TheoryDataFun; generic
5207 print_data function becomes basically useless;
5209 * removed global_names compatibility flag -- all theory declarations
5210 are qualified by default;
5212 * module Pure/Syntax now offers quote / antiquote translation
5213 functions (useful for Hoare logic etc. with implicit dependencies);
5214 see HOL/ex/Antiquote for an example use;
5216 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
5219 * new tactical CHANGED_GOAL for checking that a tactic modifies a
5222 * Display.print_goals function moved to Locale.print_goals;
5224 * standard print function for goals supports current_goals_markers
5225 variable for marking begin of proof, end of proof, start of goal; the
5226 default is ("", "", ""); setting current_goals_markers := ("<proof>",
5227 "</proof>", "<goal>") causes SGML like tagged proof state printing,
5232 New in Isabelle98 (January 1998)
5233 --------------------------------
5235 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5237 * changed lexical syntax of terms / types: dots made part of long
5238 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
5240 * simpset (and claset) reference variable replaced by functions
5241 simpset / simpset_ref;
5243 * no longer supports theory aliases (via merge) and non-trivial
5244 implicit merge of thms' signatures;
5246 * most internal names of constants changed due to qualified names;
5248 * changed Pure/Sequence interface (see Pure/seq.ML);
5251 *** General Changes ***
5253 * hierachically structured name spaces (for consts, types, axms, thms
5254 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
5255 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
5256 isatool fixdots ensures space after dots (e.g. "%x. x"); set
5257 long_names for fully qualified output names; NOTE: ML programs
5258 (special tactics, packages etc.) referring to internal names may have
5259 to be adapted to cope with fully qualified names; in case of severe
5260 backward campatibility problems try setting 'global_names' at compile
5261 time to have enrything declared within a flat name space; one may also
5262 fine tune name declarations in theories via the 'global' and 'local'
5265 * reimplemented the implicit simpset and claset using the new anytype
5266 data filed in signatures; references simpset:simpset ref etc. are
5267 replaced by functions simpset:unit->simpset and
5268 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
5269 to patch your ML files accordingly;
5271 * HTML output now includes theory graph data for display with Java
5272 applet or isatool browser; data generated automatically via isatool
5273 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
5275 * defs may now be conditional; improved rewrite_goals_tac to handle
5276 conditional equations;
5278 * defs now admits additional type arguments, using TYPE('a) syntax;
5280 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
5281 creates a new theory node; implicit merge of thms' signatures is
5282 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
5283 transfer:theory->thm->thm in (rare) cases;
5285 * improved handling of draft signatures / theories; draft thms (and
5286 ctyps, cterms) are automatically promoted to real ones;
5288 * slightly changed interfaces for oracles: admit many per theory, named
5289 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
5291 * print_goals: optional output of const types (set show_consts and
5294 * improved output of warnings (###) and errors (***);
5296 * subgoal_tac displays a warning if the new subgoal has type variables;
5298 * removed old README and Makefiles;
5300 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
5302 * removed obsolete init_pps and init_database;
5304 * deleted the obsolete tactical STATE, which was declared by
5305 fun STATE tacfun st = tacfun st st;
5307 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
5308 (which abbreviates $HOME);
5310 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
5311 use isatool fixseq to adapt your ML programs (this works for fully
5312 qualified references to the Sequence structure only!);
5314 * use_thy no longer requires writable current directory; it always
5315 reloads .ML *and* .thy file, if either one is out of date;
5318 *** Classical Reasoner ***
5320 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
5321 tactics that use classical reasoning to simplify a subgoal without
5322 splitting it into several subgoals;
5324 * Safe_tac: like safe_tac but uses the default claset;
5329 * added simplification meta rules:
5330 (asm_)(full_)simplify: simpset -> thm -> thm;
5332 * simplifier.ML no longer part of Pure -- has to be loaded by object
5335 * added prems argument to simplification procedures;
5337 * HOL, FOL, ZF: added infix function `addsplits':
5338 instead of `<simpset> setloop (split_tac <thms>)'
5339 you can simply write `<simpset> addsplits <thms>'
5344 * TYPE('a) syntax for type reflection terms;
5346 * no longer handles consts with name "" -- declare as 'syntax' instead;
5348 * pretty printer: changed order of mixfix annotation preference (again!);
5350 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
5355 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
5356 with `addloop' of the simplifier to faciliate case splitting in premises.
5358 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
5360 * HOL/Auth: new protocol proofs including some for the Internet
5363 * HOL/Map: new theory of `maps' a la VDM;
5365 * HOL/simplifier: simplification procedures nat_cancel_sums for
5366 cancelling out common nat summands from =, <, <= (in)equalities, or
5367 differences; simplification procedures nat_cancel_factor for
5368 cancelling common factor from =, <, <= (in)equalities over natural
5369 sums; nat_cancel contains both kinds of procedures, it is installed by
5370 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
5372 * HOL/simplifier: terms of the form
5373 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
5375 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
5376 and those of the form
5377 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
5379 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
5382 Each datatype `t' now comes with a theorem `split_t_case' of the form
5384 P(t_case f1 ... fn x) =
5385 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
5387 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
5390 and a theorem `split_t_case_asm' of the form
5392 P(t_case f1 ... fn x) =
5393 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
5395 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
5397 which can be added to a simpset via `addsplits'. The existing theorems
5398 expand_list_case and expand_option_case have been renamed to
5399 split_list_case and split_option_case.
5402 - `pred n' is automatically converted to `n-1'.
5403 Users are strongly encouraged not to use `pred' any longer,
5404 because it will disappear altogether at some point.
5405 - Users are strongly encouraged to write "0 < n" rather than
5406 "n ~= 0". Theorems and proof tools have been modified towards this
5410 the function "set_of_list" has been renamed "set" (and its theorems too);
5411 the function "nth" now takes its arguments in the reverse order and
5412 has acquired the infix notation "!" as in "xs!n".
5414 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
5416 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
5417 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
5419 * HOL/record: extensible records with schematic structural subtyping
5420 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
5421 still lacks various theorems and concrete record syntax;
5426 * removed "axioms" and "generated by" sections;
5428 * replaced "ops" section by extended "consts" section, which is capable of
5429 handling the continuous function space "->" directly;
5432 . proves theorems immediately and stores them in the theory,
5433 . creates hierachical name space,
5434 . now uses normal mixfix annotations (instead of cinfix...),
5435 . minor changes to some names and values (for consistency),
5436 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
5437 . separator between mutual domain defs: changed "," to "and",
5438 . improved handling of sort constraints; now they have to
5439 appear on the left-hand side of the equations only;
5441 * fixed LAM <x,y,zs>.b syntax;
5443 * added extended adm_tac to simplifier in HOLCF -- can now discharge
5444 adm (%x. P (t x)), where P is chainfinite and t continuous;
5449 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
5450 with `addloop' of the simplifier to faciliate case splitting in premises.
5452 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
5453 in HOL, they strip ALL and --> from proved theorems;
5457 New in Isabelle94-8 (May 1997)
5458 ------------------------------
5460 *** General Changes ***
5462 * new utilities to build / run / maintain Isabelle etc. (in parts
5463 still somewhat experimental); old Makefiles etc. still functional;
5465 * new 'Isabelle System Manual';
5467 * INSTALL text, together with ./configure and ./build scripts;
5469 * reimplemented type inference for greater efficiency, better error
5470 messages and clean internal interface;
5472 * prlim command for dealing with lots of subgoals (an easier way of
5473 setting goals_limit);
5478 * supports alternative (named) syntax tables (parser and pretty
5479 printer); internal interface is provided by add_modesyntax(_i);
5481 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
5482 be used in conjunction with the Isabelle symbol font; uses the
5483 "symbols" syntax table;
5485 * added token_translation interface (may translate name tokens in
5486 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
5487 the current print_mode); IMPORTANT: user print translation functions
5488 are responsible for marking newly introduced bounds
5489 (Syntax.mark_boundT);
5491 * token translations for modes "xterm" and "xterm_color" that display
5492 names in bold, underline etc. or colors (which requires a color
5495 * infixes may now be declared with names independent of their syntax;
5497 * added typed_print_translation (like print_translation, but may
5498 access type of constant);
5501 *** Classical Reasoner ***
5503 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
5504 some limitations. Blast_tac...
5505 + ignores addss, addbefore, addafter; this restriction is intrinsic
5506 + ignores elimination rules that don't have the correct format
5507 (the conclusion MUST be a formula variable)
5508 + ignores types, which can make HOL proofs fail
5509 + rules must not require higher-order unification, e.g. apply_type in ZF
5510 [message "Function Var's argument not a bound variable" relates to this]
5511 + its proof strategy is more general but can actually be slower
5513 * substitution with equality assumptions no longer permutes other
5516 * minor changes in semantics of addafter (now called addaltern); renamed
5517 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
5518 (and access functions for it);
5520 * improved combination of classical reasoner and simplifier:
5521 + functions for handling clasimpsets
5522 + improvement of addss: now the simplifier is called _after_ the
5524 + safe variant of addss called addSss: uses safe simplifications
5525 _during_ the safe steps. It is more complete as it allows multiple
5526 instantiations of unknowns (e.g. with slow_tac).
5530 * added interface for simplification procedures (functions that
5531 produce *proven* rewrite rules on the fly, depending on current
5534 * ordering on terms as parameter (used for ordered rewriting);
5536 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
5538 * the solver is now split into a safe and an unsafe part.
5539 This should be invisible for the normal user, except that the
5540 functions setsolver and addsolver have been renamed to setSolver and
5541 addSolver; added safe_asm_full_simp_tac;
5546 * a generic induction tactic `induct_tac' which works for all datatypes and
5547 also for type `nat';
5549 * a generic case distinction tactic `exhaust_tac' which works for all
5550 datatypes and also for type `nat';
5552 * each datatype comes with a function `size';
5554 * patterns in case expressions allow tuple patterns as arguments to
5555 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
5557 * primrec now also works with type nat;
5559 * recdef: a new declaration form, allows general recursive functions to be
5560 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
5562 * the constant for negation has been renamed from "not" to "Not" to
5563 harmonize with FOL, ZF, LK, etc.;
5565 * HOL/ex/LFilter theory of a corecursive "filter" functional for
5568 * HOL/Modelcheck demonstrates invocation of model checker oracle;
5570 * HOL/ex/Ring.thy declares cring_simp, which solves equational
5571 problems in commutative rings, using axiomatic type classes for + and *;
5573 * more examples in HOL/MiniML and HOL/Auth;
5575 * more default rewrite rules for quantifiers, union/intersection;
5577 * a new constant `arbitrary == @x.False';
5579 * HOLCF/IOA replaces old HOL/IOA;
5581 * HOLCF changes: derived all rules and arities
5582 + axiomatic type classes instead of classes
5583 + typedef instead of faking type definitions
5584 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
5585 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
5586 + eliminated the types void, one, tr
5587 + use unit lift and bool lift (with translations) instead of one and tr
5588 + eliminated blift from Lift3.thy (use Def instead of blift)
5589 all eliminated rules are derived as theorems --> no visible changes ;
5594 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
5595 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
5596 as ZF_cs addSIs [equalityI];
5600 New in Isabelle94-7 (November 96)
5601 ---------------------------------
5603 * allowing negative levels (as offsets) in prlev and choplev;
5605 * super-linear speedup for large simplifications;
5607 * FOL, ZF and HOL now use miniscoping: rewriting pushes
5608 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
5609 FAIL); can suppress it using the command Delsimps (ex_simps @
5610 all_simps); De Morgan laws are also now included, by default;
5612 * improved printing of ==> : ~:
5614 * new object-logic "Sequents" adds linear logic, while replacing LK
5615 and Modal (thanks to Sara Kalvala);
5617 * HOL/Auth: correctness proofs for authentication protocols;
5619 * HOL: new auto_tac combines rewriting and classical reasoning (many
5620 examples on HOL/Auth);
5622 * HOL: new command AddIffs for declaring theorems of the form P=Q to
5623 the rewriter and classical reasoner simultaneously;
5625 * function uresult no longer returns theorems in "standard" format;
5626 regain previous version by: val uresult = standard o uresult;
5633 * oracles -- these establish an interface between Isabelle and trusted
5634 external reasoners, which may deliver results as theorems;
5636 * proof objects (in particular record all uses of oracles);
5638 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
5640 * "constdefs" section in theory files;
5642 * "primrec" section (HOL) no longer requires names;
5644 * internal type "tactic" now simply "thm -> thm Sequence.seq";
5651 * reduced space requirements;
5653 * automatic HTML generation from theories;
5655 * theory files no longer require "..." (quotes) around most types;
5657 * new examples, including two proofs of the Church-Rosser theorem;
5659 * non-curried (1994) version of HOL is no longer distributed;
5666 * greatly reduced space requirements;
5668 * theory files (.thy) no longer require \...\ escapes at line breaks;
5670 * searchable theorem database (see the section "Retrieving theorems" on
5671 page 8 of the Reference Manual);
5673 * new examples, including Grabczewski's monumental case study of the
5676 * The previous version of HOL renamed to Old_HOL;
5678 * The new version of HOL (previously called CHOL) uses a curried syntax
5679 for functions. Application looks like f a b instead of f(a,b);
5681 * Mutually recursive inductive definitions finally work in HOL;
5683 * In ZF, pattern-matching on tuples is now available in all abstractions and
5684 translates to the operator "split";
5691 * new infix operator, addss, allowing the classical reasoner to
5692 perform simplification at each step of its search. Example:
5693 fast_tac (cs addss ss)
5695 * a new logic, CHOL, the same as HOL, but with a curried syntax
5696 for functions. Application looks like f a b instead of f(a,b). Also pairs
5697 look like (a,b) instead of <a,b>;
5699 * PLEASE NOTE: CHOL will eventually replace HOL!
5701 * In CHOL, pattern-matching on tuples is now available in all abstractions.
5702 It translates to the operator "split". A new theory of integers is available;
5704 * In ZF, integer numerals now denote two's-complement binary integers.
5705 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
5707 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
5708 of the Axiom of Choice;
5715 * Significantly faster resolution;
5717 * the different sections in a .thy file can now be mixed and repeated
5720 * Database of theorems for FOL, HOL and ZF. New
5721 commands including qed, qed_goal and bind_thm store theorems in the database.
5723 * Simple database queries: return a named theorem (get_thm) or all theorems of
5724 a given theory (thms_of), or find out what theory a theorem was proved in
5727 * Bugs fixed in the inductive definition and datatype packages;
5729 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
5730 and HOL_dup_cs obsolete;
5732 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
5735 * Simpler definition of function space in ZF;
5737 * new results about cardinal and ordinal arithmetic in ZF;
5739 * 'subtype' facility in HOL for introducing new types as subsets of existing
5742 :mode=text:wrap=hard:maxLineLen=72: