1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * The Isabelle System Manual (system) has been updated, with formally
10 checked references as hyperlinks.
12 * Generalized Isar history, with support for linear undo, direct state
15 * Recovered hiding of consts, which was accidentally broken in
16 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
17 makes c inaccessible; consider using ``hide (open) const c'' instead.
19 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
25 * Changed defaults for unify configuration options:
27 unify_trace_bound = 50 (formerly 25)
28 unify_search_bound = 60 (formerly 30)
30 * Different bookkeeping for code equations:
31 a) On theory merge, the last set of code equations for a particular constant
32 is taken (in accordance with the policy applied by other parts of the
33 code generator framework).
34 b) Code equations stemming from explicit declarations (e.g. code attribute)
35 gain priority over default code equations stemming from definition, primrec,
39 * Global versions of theorems stemming from classes do not carry
40 a parameter prefix any longer. INCOMPATIBILITY.
42 * Dropped "locale (open)". INCOMPATBILITY.
44 * Interpretation commands no longer attempt to simplify goal.
45 INCOMPATIBILITY: in rare situations the generated goal differs. Use
46 methods intro_locales and unfold_locales to clarify.
48 * Interpretation commands no longer accept interpretation attributes.
51 * Command 'instance': attached definitions no longer accepted.
52 INCOMPATIBILITY, use proper 'instantiation' target.
54 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
56 * The 'axiomatization' command now only works within a global theory
57 context. INCOMPATIBILITY.
60 *** Document preparation ***
62 * Antiquotation @{lemma} now imitates a regular terminal proof,
63 demanding keyword 'by' and supporting the full method expression
64 syntax just like the Isar command 'by'.
69 * HOL/Main: command "value" now integrates different evaluation
70 mechanisms. The result of the first successful evaluation mechanism
71 is printed. In square brackets a particular named evaluation
72 mechanisms may be specified (currently, [SML], [code] or [nbe]). See
73 further src/HOL/ex/Eval_Examples.thy.
75 * HOL/Orderings: class "wellorder" moved here, with explicit induction
76 rule "less_induct" as assumption. For instantiation of "wellorder" by
77 means of predicate "wf", use rule wf_wellorderI. INCOMPATIBILITY.
79 * HOL/Orderings: added class "preorder" as superclass of "order".
80 INCOMPATIBILITY: Instantiation proofs for order, linorder
81 etc. slightly changed. Some theorems named order_class.* now named
84 * HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been
85 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
86 dvd has been generalized to class comm_semiring_1. Likewise a bunch
87 of lemmas from Divides has been generalized from nat to class
88 semiring_div. INCOMPATIBILITY. This involves the following theorem
89 renames resulting from duplicate elimination:
91 dvd_def_mod ~> dvd_eq_mod_eq_0
92 zero_dvd_iff ~> dvd_0_left_iff
93 DIVISION_BY_ZERO_DIV ~> div_by_0
94 DIVISION_BY_ZERO_MOD ~> mod_by_0
95 mult_div ~> div_mult_self2_is_id
96 mult_mod ~> mod_mult_self2_is_0
98 * HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
99 zlcm (for int); carried together from various gcd/lcm developements in
100 the HOL Distribution. zgcd and zlcm replace former igcd and ilcm;
101 corresponding theorems renamed accordingly. INCOMPATIBILY. To
102 recover tupled syntax, use syntax declarations like:
104 hide (open) const gcd
105 abbreviation gcd where
106 "gcd == (%(a, b). GCD.gcd a b)"
108 GCD.gcd ("gcd '(_, _')")
110 (analogously for lcm, zgcd, zlcm).
112 * HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
114 * New ML antiquotation @{code}: takes constant as argument, generates
115 corresponding code in background and inserts name of the corresponding
116 resulting ML value/function/datatype constructor binding in place.
117 All occurrences of @{code} with a single ML block are generated
118 simultaneously. Provides a generic and safe interface for
119 instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy
120 example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious
121 application. In future you ought refrain from ad-hoc compiling
122 generated SML code on the ML toplevel. Note that (for technical
123 reasons) @{code} cannot refer to constants for which user-defined
124 serializations are set. Refer to the corresponding ML counterpart
125 directly in that cases.
127 * Integrated image HOL-Complex with HOL. Entry points Main.thy and
128 Complex_Main.thy remain as they are.
130 * New image HOL-Plain provides a minimal HOL with the most important
131 tools available (inductive, datatype, primrec, ...). By convention
132 the corresponding theory Plain should be ancestor of every further
133 (library) theory. Some library theories now have ancestor Plain
134 (instead of Main), thus theory Main occasionally has to be imported
137 * The metis method now fails in the usual manner, rather than raising
138 an exception, if it determines that it cannot prove the theorem.
140 * Methods "case_tac" and "induct_tac" now refer to the very same rules
141 as the structured Isar versions "cases" and "induct", cf. the
142 corresponding "cases" and "induct" attributes. Mutual induction rules
143 are now presented as a list of individual projections
144 (e.g. foo_bar.inducts for types foo and bar); the old format with
145 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
146 rare situations a different rule is selected --- notably nested tuple
147 elimination instead of former prod.exhaust: use explicit (case_tac t
148 rule: prod.exhaust) here.
150 * Attributes "cases", "induct", "coinduct" support "del" option.
152 * Removed fact "case_split_thm", which duplicates "case_split".
154 * Command 'rep_datatype': instead of theorem names the command now
155 takes a list of terms denoting the constructors of the type to be
156 represented as datatype. The characteristic theorems have to be
157 proven. INCOMPATIBILITY. Also observe that the following theorems
158 have disappeared in favour of existing ones:
160 unit_induct ~> unit.induct
161 prod_induct ~> prod.induct
162 sum_induct ~> sum.induct
163 Suc_Suc_eq ~> nat.inject
164 Suc_not_Zero Zero_not_Suc ~> nat.distinct
166 * Library/Nat_Infinity: added addition, numeral syntax and more
167 instantiations for algebraic structures. Removed some duplicate
168 theorems. Changes in simp rules. INCOMPATIBILITY.
170 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
176 * New locales for orders and lattices where the equivalence relation
177 is not restricted to equality. INCOMPATIBILITY: all order and
178 lattice locales use a record structure with field eq for the
181 * New theory of factorial domains.
183 * Units_l_inv and Units_r_inv are now simprules by default.
184 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
185 and/or r_inv will now also require deletion of these lemmas.
187 * Renamed the following theorems. INCOMPATIBILITY.
190 least_carrier ~> least_closed
191 greatest_carrier ~> greatest_closed
192 greatest_Lower_above ~> greatest_Lower_below
193 one_zero ~> carrier_one_zero
194 one_not_zero ~> carrier_one_not_zero (collision with assumption)
199 * Created new image HOL-NSA, containing theories of nonstandard
200 analysis which were previously part of HOL-Complex. Entry point
201 Hyperreal.thy remains valid, but theories formerly using
202 Complex_Main.thy should now use new entry point Hypercomplex.thy.
207 * Proof of Zorn's Lemma for partial orders.
212 * Generic Toplevel.add_hook interface allows to analyze the result of
213 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
214 for theorem dependency output of transactions resulting in a new
217 * Name bindings in higher specification mechanisms (notably
218 LocalTheory.define, LocalTheory.note, and derived packages) are now
219 formalized as type Name.binding, replacing old bstring.
220 INCOMPATIBILITY, need to wrap strings via Name.binding function, see
221 also Name.name_of. Packages should pass name bindings given by the
222 user to underlying specification mechanisms; this enables precise
223 tracking of source positions, for example.
225 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
226 LocalTheory.note etc.) now refer to the *full* internal name, not the
227 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
229 * Rules and tactics that read instantiations (read_instantiate,
230 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
231 context, which is required for parsing and type-checking. Moreover,
232 the variables are specified as plain indexnames, not string encodings
233 thereof. INCOMPATIBILITY.
235 * Disposed old type and term read functions (Sign.read_def_typ,
236 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
237 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
238 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
239 Syntax.read_term_global etc.; see also OldGoals.read_term as last
240 resort for legacy applications.
242 * Antiquotations: block-structured compilation context indicated by
243 \<lbrace> ... \<rbrace>; additional antiquotation forms:
245 @{let ?pat = term} - term abbreviation (HO matching)
246 @{note name = fact} - fact abbreviation
247 @{thm fact} - singleton fact (with attributes)
248 @{thms fact} - general fact (with attributes)
249 @{lemma prop by method} - singleton goal
250 @{lemma prop by meth1 meth2} - singleton goal
251 @{lemma prop1 ... propN by method} - general goal
252 @{lemma prop1 ... propN by meth1 meth2} - general goal
253 @{lemma (open) ...} - open derivation
258 * Multithreading for Poly/ML 5.1 is no longer supported, only for
259 Poly/ML 5.2 or later.
261 * The Isabelle "emacs" tool provides a specific interface to invoke
262 Proof General / Emacs, with more explicit failure if that is not
263 installed (the old isabelle-interface script silently falls back on
264 isabelle-process). The PROOFGENERAL_HOME setting determines the
265 installation location of the Proof General distribution.
267 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
268 the Isabelle process into a JVM/Scala application. See
269 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
270 process wrapper has been discontinued.)
272 * Status messages (with exact source position information) are
273 emitted, if proper markup print mode is enabled. This allows
274 user-interface components to provide detailed feedback on internal
277 * Homegrown Isabelle font with unicode layout, see Isabelle/lib/fonts.
281 New in Isabelle2008 (June 2008)
282 -------------------------------
286 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
287 and updated, with formally checked references as hyperlinks.
289 * Theory loader: use_thy (and similar operations) no longer set the
290 implicit ML context, which was occasionally hard to predict and in
291 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
292 provides a proper context already.
294 * Theory loader: old-style ML proof scripts being *attached* to a thy
295 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
296 'use' within a theory file will do the job.
298 * Name space merge now observes canonical order, i.e. the second space
299 is inserted into the first one, while existing entries in the first
300 space take precedence. INCOMPATIBILITY in rare situations, may try to
303 * Syntax: symbol \<chi> is now considered a letter. Potential
304 INCOMPATIBILITY in identifier syntax etc.
306 * Outer syntax: string tokens no longer admit escaped white space,
307 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
308 white space without escapes.
310 * Outer syntax: string tokens may contain arbitrary character codes
311 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
317 * Context-dependent token translations. Default setup reverts locally
318 fixed variables, and adds hilite markup for undeclared frees.
320 * Unused theorems can be found using the new command 'unused_thms'.
321 There are three ways of invoking it:
324 Only finds unused theorems in the current theory.
326 (2) unused_thms thy_1 ... thy_n -
327 Finds unused theorems in the current theory and all of its ancestors,
328 excluding the theories thy_1 ... thy_n and all of their ancestors.
330 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
331 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
332 their ancestors, excluding the theories thy_1 ... thy_n and all of
335 In order to increase the readability of the list produced by
336 unused_thms, theorems that have been created by a particular instance
337 of a theory command such as 'inductive' or 'function' are considered
338 to belong to the same "group", meaning that if at least one theorem in
339 this group is used, the other theorems in the same group are no longer
340 reported as unused. Moreover, if all theorems in the group are
341 unused, only one theorem in the group is displayed.
343 Note that proof objects have to be switched on in order for
344 unused_thms to work properly (i.e. !proofs must be >= 1, which is
345 usually the case when using Proof General with the default settings).
347 * Authentic naming of facts disallows ad-hoc overwriting of previous
348 theorems within the same name space. INCOMPATIBILITY, need to remove
349 duplicate fact bindings, or even accidental fact duplications. Note
350 that tools may maintain dynamically scoped facts systematically, using
351 PureThy.add_thms_dynamic.
353 * Command 'hide' now allows to hide from "fact" name space as well.
355 * Eliminated destructive theorem database, simpset, claset, and
356 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
357 update of theories within ML code.
359 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
360 INCOMPATIBILITY, object-logics depending on former Pure require
361 additional setup PureThy.old_appl_syntax_setup; object-logics
362 depending on former CPure need to refer to Pure.
364 * Commands 'use' and 'ML' are now purely functional, operating on
365 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
366 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
369 * Command 'setup': discontinued implicit version with ML reference.
371 * Instantiation target allows for simultaneous specification of class
372 instance operations together with an instantiation proof.
373 Type-checking phase allows to refer to class operations uniformly.
374 See src/HOL/Complex/Complex.thy for an Isar example and
375 src/HOL/Library/Eval.thy for an ML example.
377 * Indexing of literal facts: be more serious about including only
378 facts from the visible specification/proof context, but not the
379 background context (locale etc.). Affects `prop` notation and method
380 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
383 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
384 "(open)" option, which used to expose internal bound variables to the
387 * Isar statements: removed obsolete case "rule_context".
388 INCOMPATIBILITY, better use explicit fixes/assumes.
390 * Locale proofs: default proof step now includes 'unfold_locales';
391 hence 'proof' without argument may be used to unfold locale
395 *** Document preparation ***
397 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
398 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
399 obsolete thumbpdf setup (contemporary PDF viewers do this on the
400 spot); renamed link color from "darkblue" to "linkcolor" (default
401 value unchanged, can be redefined via \definecolor); no longer sets
402 "a4paper" option (unnecessary or even intrusive).
404 * Antiquotation @{lemma A method} proves proposition A by the given
405 method (either a method name or a method name plus (optional) method
406 arguments in parentheses) and prints A just like @{prop A}.
411 * New primrec package. Specification syntax conforms in style to
412 definition/function/.... No separate induction rule is provided. The
413 "primrec" command distinguishes old-style and new-style specifications
414 by syntax. The former primrec package is now named OldPrimrecPackage.
415 When adjusting theories, beware: constants stemming from new-style
416 primrec specifications have authentic syntax.
418 * Metis prover is now an order of magnitude faster, and also works
421 * Metis: the maximum number of clauses that can be produced from a
422 theorem is now given by the attribute max_clauses. Theorems that
423 exceed this number are ignored, with a warning printed.
425 * Sledgehammer no longer produces structured proofs by default. To
426 enable, declare [[sledgehammer_full = true]]. Attributes
427 reconstruction_modulus, reconstruction_sorts renamed
428 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
430 * Method "induct_scheme" derives user-specified induction rules
431 from well-founded induction and completeness of patterns. This factors
432 out some operations that are done internally by the function package
433 and makes them available separately. See
434 src/HOL/ex/Induction_Scheme.thy for examples.
436 * More flexible generation of measure functions for termination
437 proofs: Measure functions can be declared by proving a rule of the
438 form "is_measure f" and giving it the [measure_function] attribute.
439 The "is_measure" predicate is logically meaningless (always true), and
440 just guides the heuristic. To find suitable measure functions, the
441 termination prover sets up the goal "is_measure ?f" of the appropriate
442 type and generates all solutions by prolog-style backwards proof using
445 This setup also deals with rules like
447 "is_measure f ==> is_measure (list_size f)"
449 which accommodates nested datatypes that recurse through lists.
450 Similar rules are predeclared for products and option types.
452 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
456 - Definitions of overloaded constants on sets have to be replaced by
457 definitions on => and bool.
459 - Some definitions of overloaded operators on sets can now be proved
460 using the definitions of the operators on => and bool. Therefore,
461 the following theorems have been renamed:
463 subset_def -> subset_eq
464 psubset_def -> psubset_eq
465 set_diff_def -> set_diff_eq
466 Compl_def -> Compl_eq
467 Sup_set_def -> Sup_set_eq
468 Inf_set_def -> Inf_set_eq
469 sup_set_def -> sup_set_eq
470 inf_set_def -> inf_set_eq
472 - Due to the incompleteness of the HO unification algorithm, some
473 rules such as subst may require manual instantiation, if some of
474 the unknowns in the rule is a set.
476 - Higher order unification and forward proofs:
479 have "P (S::'a set)" <...>
480 then have "EX S. P S" ..
482 no longer works (due to the incompleteness of the HO unification
483 algorithm) and must be replaced by the pattern
490 - Calculational reasoning with subst (or similar rules):
493 have "P (S::'a set)" <...>
494 also have "S = T" <...>
497 no longer works (for similar reasons as the previous example) and
498 must be replaced by something like
500 have "P (S::'a set)" <...>
501 moreover have "S = T" <...>
502 ultimately have "P T" by simp
504 - Tactics or packages written in ML code:
505 Code performing pattern matching on types via
507 Type ("set", [T]) => ...
509 must be rewritten. Moreover, functions like strip_type or
510 binder_types no longer return the right value when applied to a
513 T1 => ... => Tn => U => bool
517 T1 => ... => Tn => U set
519 * Merged theories Wellfounded_Recursion, Accessible_Part and
520 Wellfounded_Relations to theory Wellfounded.
522 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
524 * Class finite no longer treats UNIV as class parameter. Use class
525 enum from theory Library/Enum instead to achieve a similar effect.
528 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
529 and "Cons". INCOMPATIBILITY.
531 * HOL (and FOL): renamed variables in rules imp_elim and swap.
532 Potential INCOMPATIBILITY.
534 * Theory Product_Type: duplicated lemmas split_Pair_apply and
535 injective_fst_snd removed, use split_eta and prod_eqI instead.
536 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
538 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
539 the same name in theory Orderings:
549 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
550 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
551 and different variable names.
553 * Library/Option_ord.thy: Canonical order on option type.
555 * Library/RBT.thy: Red-black trees, an efficient implementation of
558 * Library/Countable.thy: Type class for countable types.
560 * Theory Int: The representation of numerals has changed. The infix
561 operator BIT and the bit datatype with constructors B0 and B1 have
562 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
563 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
564 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
567 * Theory Nat: definition of <= and < on natural numbers no longer
568 depend on well-founded relations. INCOMPATIBILITY. Definitions
569 le_def and less_def have disappeared. Consider lemmas not_less
570 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
572 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
573 (whose purpose mainly is for various fold_set functionals) have been
574 abandoned in favor of the existing algebraic classes
575 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
576 lower_semilattice (resp. upper_semilattice) and linorder.
579 * Theory Transitive_Closure: induct and cases rules now declare proper
580 case_names ("base" and "step"). INCOMPATIBILITY.
582 * Theorem Inductive.lfp_ordinal_induct generalized to complete
583 lattices. The form set-specific version is available as
584 Inductive.lfp_ordinal_induct_set.
586 * Renamed theorems "power.simps" to "power_int.simps".
589 * Class semiring_div provides basic abstract properties of semirings
590 with division and modulo operations. Subsumes former class dvd_mod.
592 * Merged theories IntDef, Numeral and IntArith into unified theory
593 Int. INCOMPATIBILITY.
595 * Theory Library/Code_Index: type "index" now represents natural
596 numbers rather than integers. INCOMPATIBILITY.
598 * New class "uminus" with operation "uminus" (split of from class
599 "minus" which now only has operation "minus", binary).
602 * Constants "card", "internal_split", "option_map" now with authentic
603 syntax. INCOMPATIBILITY.
605 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
606 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
607 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
608 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
609 Sup_set_def, le_def, less_def, option_map_def now with object
610 equality. INCOMPATIBILITY.
612 * Records. Removed K_record, and replaced it by pure lambda term
613 %x. c. The simplifier setup is now more robust against eta expansion.
614 INCOMPATIBILITY: in cases explicitly referring to K_record.
616 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
618 * Library/ListVector: new theory of arithmetic vector operations.
620 * Library/Order_Relation: new theory of various orderings as sets of
621 pairs. Defines preorders, partial orders, linear orders and
622 well-orders on sets and on types.
627 * Renamed some theories to allow to loading both ZF and HOL in the
630 Datatype -> Datatype_ZF
631 Inductive -> Inductive_ZF
638 INCOMPATIBILITY: ZF theories that import individual theories below
639 Main might need to be adapted. Regular theory Main is still
640 available, as trivial extension of Main_ZF.
645 * ML within Isar: antiquotation @{const name} or @{const
646 name(typargs)} produces statically-checked Const term.
648 * Functor NamedThmsFun: data is available to the user as dynamic fact
649 (of the same name). Removed obsolete print command.
651 * Removed obsolete "use_legacy_bindings" function.
653 * The ``print mode'' is now a thread-local value derived from a global
654 template (the former print_mode reference), thus access becomes
655 non-critical. The global print_mode reference is for session
656 management only; user-code should use print_mode_value,
657 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
659 * Functions system/system_out provide a robust way to invoke external
660 shell commands, with propagation of interrupts (requires Poly/ML 5.2).
661 Do not use OS.Process.system etc. from the basis library!
666 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
667 in accordance with Proof General 3.7, which prefers GNU emacs.
669 * isatool tty runs Isabelle process with plain tty interaction;
670 optional line editor may be specified via ISABELLE_LINE_EDITOR
671 setting, the default settings attempt to locate "ledit" and "rlwrap".
673 * isatool browser now works with Cygwin as well, using general
674 "javapath" function defined in Isabelle process environment.
676 * YXML notation provides a simple and efficient alternative to
677 standard XML transfer syntax. See src/Pure/General/yxml.ML and
678 isatool yxml as described in the Isabelle system manual.
680 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
681 provides general wrapper for managing an Isabelle process in a robust
682 fashion, with ``cooked'' output from stdin/stderr.
684 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
685 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
687 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
688 way of changing the user's settings is via
689 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
692 * Multithreading.max_threads := 0 refers to the number of actual CPU
693 cores of the underlying machine, which is a good starting point for
694 optimal performance tuning. The corresponding usedir option -M allows
695 "max" as an alias for "0". WARNING: does not work on certain versions
696 of Mac OS (with Poly/ML 5.1).
698 * isabelle-process: non-ML sessions are run with "nice", to reduce the
699 adverse effect of Isabelle flooding interactive front-ends (notably
700 ProofGeneral / XEmacs).
704 New in Isabelle2007 (November 2007)
705 -----------------------------------
709 * More uniform information about legacy features, notably a
710 warning/error of "Legacy feature: ...", depending on the state of the
711 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
712 legacy features will disappear eventually.
714 * Theory syntax: the header format ``theory A = B + C:'' has been
715 discontinued in favour of ``theory A imports B C begin''. Use isatool
716 fixheaders to convert existing theory files. INCOMPATIBILITY.
718 * Theory syntax: the old non-Isar theory file format has been
719 discontinued altogether. Note that ML proof scripts may still be used
720 with Isar theories; migration is usually quite simple with the ML
721 function use_legacy_bindings. INCOMPATIBILITY.
723 * Theory syntax: some popular names (e.g. 'class', 'declaration',
724 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
727 * Theory loader: be more serious about observing the static theory
728 header specifications (including optional directories), but not the
729 accidental file locations of previously successful loads. The strict
730 update policy of former update_thy is now already performed by
731 use_thy, so the former has been removed; use_thys updates several
732 theories simultaneously, just as 'imports' within a theory header
733 specification, but without merging the results. Potential
734 INCOMPATIBILITY: may need to refine theory headers and commands
735 ROOT.ML which depend on load order.
737 * Theory loader: optional support for content-based file
738 identification, instead of the traditional scheme of full physical
739 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
740 (cf. the system manual). The new scheme allows to work with
741 non-finished theories in persistent session images, such that source
742 files may be moved later on without requiring reloads.
744 * Theory loader: old-style ML proof scripts being *attached* to a thy
745 file (with the same base name as the theory) are considered a legacy
746 feature, which will disappear eventually. Even now, the theory loader
747 no longer maintains dependencies on such files.
749 * Syntax: the scope for resolving ambiguities via type-inference is
750 now limited to individual terms, instead of whole simultaneous
751 specifications as before. This greatly reduces the complexity of the
752 syntax module and improves flexibility by separating parsing and
753 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
754 'fixes' etc.) are required in rare situations.
756 * Syntax: constants introduced by new-style packages ('definition',
757 'abbreviation' etc.) are passed through the syntax module in
758 ``authentic mode''. This means that associated mixfix annotations
759 really stick to such constants, independently of potential name space
760 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
761 trees are represented slightly differently, may need to adapt syntax
762 translations accordingly. Use CONST marker in 'translations' and
763 @{const_syntax} antiquotation in 'parse_translation' etc.
765 * Legacy goal package: reduced interface to the bare minimum required
766 to keep existing proof scripts running. Most other user-level
767 functions are now part of the OldGoals structure, which is *not* open
768 by default (consider isatool expandshort before open OldGoals).
769 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
770 these tend to cause confusion about the actual goal (!) context being
771 used here, which is not necessarily the same as the_context().
773 * Command 'find_theorems': supports "*" wild-card in "name:"
774 criterion; "with_dups" option. Certain ProofGeneral versions might
775 support a specific search form (see ProofGeneral/CHANGES).
777 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
778 by default, which means that "prems" (and also "fixed variables") are
779 suppressed from proof state output. Note that the ProofGeneral
780 settings mechanism allows to change and save options persistently, but
781 older versions of Isabelle will fail to start up if a negative prems
784 * Local theory targets may be specified by non-nested blocks of
785 ``context/locale/class ... begin'' followed by ``end''. The body may
786 contain definitions, theorems etc., including any derived mechanism
787 that has been implemented on top of these primitives. This concept
788 generalizes the existing ``theorem (in ...)'' towards more versatility
791 * Proof General interface: proper undo of final 'end' command;
792 discontinued Isabelle/classic mode (ML proof scripts).
795 *** Document preparation ***
797 * Added antiquotation @{theory name} which prints the given name,
798 after checking that it refers to a valid ancestor theory in the
801 * Added antiquotations @{ML_type text} and @{ML_struct text} which
802 check the given source text as ML type/structure, printing verbatim.
804 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
805 "c args == rhs" given in the current context. (Any number of
806 arguments may be given on the LHS.)
811 * The 'class' package offers a combination of axclass and locale to
812 achieve Haskell-like type classes in Isabelle. Definitions and
813 theorems within a class context produce both relative results (with
814 implicit parameters according to the locale context), and polymorphic
815 constants with qualified polymorphism (according to the class
816 context). Within the body context of a 'class' target, a separate
817 syntax layer ("user space type system") takes care of converting
818 between global polymorphic consts and internal locale representation.
819 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
820 "isatool doc classes" provides a tutorial.
822 * Generic code generator framework allows to generate executable
823 code for ML and Haskell (including Isabelle classes). A short usage
826 internal compilation:
827 export_code <list of constants (term syntax)> in SML
828 writing SML code to a file:
829 export_code <list of constants (term syntax)> in SML <filename>
830 writing OCaml code to a file:
831 export_code <list of constants (term syntax)> in OCaml <filename>
832 writing Haskell code to a bunch of files:
833 export_code <list of constants (term syntax)> in Haskell <filename>
835 evaluating closed propositions to True/False using code generation:
838 Reasonable default setup of framework in HOL.
840 Theorem attributs for selecting and transforming function equations theorems:
842 [code fun]: select a theorem as function equation for a specific constant
843 [code fun del]: deselect a theorem as function equation for a specific constant
844 [code inline]: select an equation theorem for unfolding (inlining) in place
845 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
847 User-defined serializations (target in {SML, OCaml, Haskell}):
849 code_const <and-list of constants (term syntax)>
850 {(target) <and-list of const target syntax>}+
852 code_type <and-list of type constructors>
853 {(target) <and-list of type target syntax>}+
855 code_instance <and-list of instances>
857 where instance ::= <type constructor> :: <class>
859 code_class <and_list of classes>
860 {(target) <and-list of class target syntax>}+
861 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
863 code_instance and code_class only are effective to target Haskell.
865 For example usage see src/HOL/ex/Codegenerator.thy and
866 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
867 generation from Isabelle/HOL theories is available via "isatool doc
870 * Code generator: consts in 'consts_code' Isar commands are now
871 referred to by usual term syntax (including optional type
874 * Command 'no_translations' removes translation rules from theory
877 * Overloaded definitions are now actually checked for acyclic
878 dependencies. The overloading scheme is slightly more general than
879 that of Haskell98, although Isabelle does not demand an exact
880 correspondence to type class and instance declarations.
881 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
882 exotic versions of overloading -- at the discretion of the user!
884 Polymorphic constants are represented via type arguments, i.e. the
885 instantiation that matches an instance against the most general
886 declaration given in the signature. For example, with the declaration
887 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
888 as c(nat). Overloading is essentially simultaneous structural
889 recursion over such type arguments. Incomplete specification patterns
890 impose global constraints on all occurrences, e.g. c('a * 'a) on the
891 LHS means that more general c('a * 'b) will be disallowed on any RHS.
892 Command 'print_theory' outputs the normalized system of recursive
893 equations, see section "definitions".
895 * Configuration options are maintained within the theory or proof
896 context (with name and type bool/int/string), providing a very simple
897 interface to a poor-man's version of general context data. Tools may
898 declare options in ML (e.g. using Attrib.config_int) and then refer to
899 these values using Config.get etc. Users may change options via an
900 associated attribute of the same name. This form of context
901 declaration works particularly well with commands 'declare' or
902 'using', for example ``declare [[foo = 42]]''. Thus it has become
903 very easy to avoid global references, which would not observe Isar
904 toplevel undo/redo and fail to work with multithreading.
906 Various global ML references of Pure and HOL have been turned into
907 configuration options:
909 Unify.search_bound unify_search_bound
910 Unify.trace_bound unify_trace_bound
911 Unify.trace_simp unify_trace_simp
912 Unify.trace_types unify_trace_types
913 Simplifier.simp_depth_limit simp_depth_limit
914 Blast.depth_limit blast_depth_limit
915 DatatypeProp.dtK datatype_distinctness_limit
916 fast_arith_neq_limit fast_arith_neq_limit
917 fast_arith_split_limit fast_arith_split_limit
919 * Named collections of theorems may be easily installed as context
920 data using the functor NamedThmsFun (see also
921 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
922 attributes; there is also a toplevel print command. This facility is
923 just a common case of general context data, which is the preferred way
924 for anything more complex than just a list of facts in canonical
927 * Isar: command 'declaration' augments a local theory by generic
928 declaration functions written in ML. This enables arbitrary content
929 being added to the context, depending on a morphism that tells the
930 difference of the original declaration context wrt. the application
931 context encountered later on.
933 * Isar: proper interfaces for simplification procedures. Command
934 'simproc_setup' declares named simprocs (with match patterns, and body
935 text in ML). Attribute "simproc" adds/deletes simprocs in the current
936 context. ML antiquotation @{simproc name} retrieves named simprocs.
938 * Isar: an extra pair of brackets around attribute declarations
939 abbreviates a theorem reference involving an internal dummy fact,
940 which will be ignored later --- only the effect of the attribute on
941 the background context will persist. This form of in-place
942 declarations is particularly useful with commands like 'declare' and
943 'using', for example ``have A using [[simproc a]] by simp''.
945 * Isar: method "assumption" (and implicit closing of subproofs) now
946 takes simple non-atomic goal assumptions into account: after applying
947 an assumption as a rule the resulting subgoals are solved by atomic
948 assumption steps. This is particularly useful to finish 'obtain'
949 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
950 without referring to the original premise "!!x. P x ==> thesis" in the
951 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
954 * Isar: implicit use of prems from the Isar proof context is
955 considered a legacy feature. Common applications like ``have A .''
956 may be replaced by ``have A by fact'' or ``note `A`''. In general,
957 referencing facts explicitly here improves readability and
958 maintainability of proof texts.
960 * Isar: improper proof element 'guess' is like 'obtain', but derives
961 the obtained context from the course of reasoning! For example:
963 assume "EX x y. A x & B y" -- "any previous fact"
964 then guess x and y by clarify
966 This technique is potentially adventurous, depending on the facts and
967 proof tools being involved here.
969 * Isar: known facts from the proof context may be specified as literal
970 propositions, using ASCII back-quote syntax. This works wherever
971 named facts used to be allowed so far, in proof commands, proof
972 methods, attributes etc. Literal facts are retrieved from the context
973 according to unification of type and term parameters. For example,
974 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
975 theorems in the current context, then these are valid literal facts:
976 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
978 There is also a proof method "fact" which does the same composition
979 for explicit goal states, e.g. the following proof texts coincide with
980 certain special cases of literal facts:
982 have "A" by fact == note `A`
983 have "A ==> B" by fact == note `A ==> B`
984 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
985 have "P a ==> Q a" by fact == note `P a ==> Q a`
987 * Isar: ":" (colon) is no longer a symbolic identifier character in
988 outer syntax. Thus symbolic identifiers may be used without
989 additional white space in declarations like this: ``assume *: A''.
991 * Isar: 'print_facts' prints all local facts of the current context,
992 both named and unnamed ones.
994 * Isar: 'def' now admits simultaneous definitions, e.g.:
996 def x == "t" and y == "u"
998 * Isar: added command 'unfolding', which is structurally similar to
999 'using', but affects both the goal state and facts by unfolding given
1000 rewrite rules. Thus many occurrences of the 'unfold' method or
1001 'unfolded' attribute may be replaced by first-class proof text.
1003 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
1004 and command 'unfolding' now all support object-level equalities
1005 (potentially conditional). The underlying notion of rewrite rule is
1006 analogous to the 'rule_format' attribute, but *not* that of the
1007 Simplifier (which is usually more generous).
1009 * Isar: the new attribute [rotated n] (default n = 1) rotates the
1010 premises of a theorem by n. Useful in conjunction with drule.
1012 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
1013 method expression within a sandbox consisting of the first N
1014 sub-goals, which need to exist. For example, ``simp_all [3]''
1015 simplifies the first three sub-goals, while (rule foo, simp_all)[]
1016 simplifies all new goals that emerge from applying rule foo to the
1017 originally first one.
1019 * Isar: schematic goals are no longer restricted to higher-order
1020 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
1023 * Isar: the conclusion of a long theorem statement is now either
1024 'shows' (a simultaneous conjunction, as before), or 'obtains'
1025 (essentially a disjunction of cases with local parameters and
1026 assumptions). The latter allows to express general elimination rules
1027 adequately; in this notation common elimination rules look like this:
1029 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
1031 obtains x where "P x"
1033 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
1037 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
1043 The subsequent classical rules even refer to the formal "thesis"
1046 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
1049 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
1050 obtains "thesis ==> something"
1052 The actual proof of an 'obtains' statement is analogous to that of the
1053 Isar proof element 'obtain', only that there may be several cases.
1054 Optional case names may be specified in parentheses; these will be
1055 available both in the present proof and as annotations in the
1056 resulting rule, for later use with the 'cases' method (cf. attribute
1059 * Isar: the assumptions of a long theorem statement are available as
1060 "assms" fact in the proof context. This is more appropriate than the
1061 (historical) "prems", which refers to all assumptions of the current
1062 context, including those from the target locale, proof body etc.
1064 * Isar: 'print_statement' prints theorems from the current theory or
1065 proof context in long statement form, according to the syntax of a
1068 * Isar: 'obtain' takes an optional case name for the local context
1069 introduction rule (default "that").
1071 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
1072 explicit (is "_ ==> ?foo") in the rare cases where this still happens
1075 * Pure: syntax "CONST name" produces a fully internalized constant
1076 according to the current context. This is particularly useful for
1077 syntax translations that should refer to internal constant
1078 representations independently of name spaces.
1080 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
1081 instead of "FOO ". This allows multiple binder declarations to coexist
1082 in the same context. INCOMPATIBILITY.
1084 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
1085 primitive that also works in a locale context (both for constants and
1086 fixed variables). Type declaration and internal syntactic representation
1087 of given constants retrieved from the context. Likewise, the
1088 'no_notation' command allows to remove given syntax annotations from the
1091 * Isar/locales: new derived specification elements 'axiomatization',
1092 'definition', 'abbreviation', which support type-inference, admit
1093 object-level specifications (equality, equivalence). See also the
1094 isar-ref manual. Examples:
1097 eq (infix "===" 50) where
1098 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
1100 definition "f x y = x + y + 1"
1101 definition g where "g x = f x x"
1104 neq (infix "=!=" 50) where
1105 "x =!= y == ~ (x === y)"
1107 These specifications may be also used in a locale context. Then the
1108 constants being introduced depend on certain fixed parameters, and the
1109 constant name is qualified by the locale base name. An internal
1110 abbreviation takes care for convenient input and output, making the
1111 parameters implicit and using the original short name. See also
1112 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
1113 entities from a monomorphic theory.
1115 Presently, abbreviations are only available 'in' a target locale, but
1116 not inherited by general import expressions. Also note that
1117 'abbreviation' may be used as a type-safe replacement for 'syntax' +
1118 'translations' in common applications. The "no_abbrevs" print mode
1119 prevents folding of abbreviations in term output.
1121 Concrete syntax is attached to specified constants in internal form,
1122 independently of name spaces. The parse tree representation is
1123 slightly different -- use 'notation' instead of raw 'syntax', and
1124 'translations' with explicit "CONST" markup to accommodate this.
1126 * Pure/Isar: unified syntax for new-style specification mechanisms
1127 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
1128 full type inference and dummy patterns ("_"). For example:
1130 definition "K x _ = x"
1132 inductive conj for A B
1133 where "A ==> B ==> conj A B"
1135 * Pure: command 'print_abbrevs' prints all constant abbreviations of
1136 the current context. Print mode "no_abbrevs" prevents inversion of
1137 abbreviations on output.
1139 * Isar/locales: improved parameter handling: use of locales "var" and
1140 "struct" no longer necessary; - parameter renamings are no longer
1141 required to be injective. For example, this allows to define
1142 endomorphisms as locale endom = homom mult mult h.
1144 * Isar/locales: changed the way locales with predicates are defined.
1145 Instead of accumulating the specification, the imported expression is
1146 now an interpretation. INCOMPATIBILITY: different normal form of
1147 locale expressions. In particular, in interpretations of locales with
1148 predicates, goals repesenting already interpreted fragments are not
1149 removed automatically. Use methods `intro_locales' and
1150 `unfold_locales'; see below.
1152 * Isar/locales: new methods `intro_locales' and `unfold_locales'
1153 provide backward reasoning on locales predicates. The methods are
1154 aware of interpretations and discharge corresponding goals.
1155 `intro_locales' is less aggressive then `unfold_locales' and does not
1156 unfold predicates to assumptions.
1158 * Isar/locales: the order in which locale fragments are accumulated
1159 has changed. This enables to override declarations from fragments due
1160 to interpretations -- for example, unwanted simp rules.
1162 * Isar/locales: interpretation in theories and proof contexts has been
1163 extended. One may now specify (and prove) equations, which are
1164 unfolded in interpreted theorems. This is useful for replacing
1165 defined concepts (constants depending on locale parameters) by
1166 concepts already existing in the target context. Example:
1168 interpretation partial_order ["op <= :: [int, int] => bool"]
1169 where "partial_order.less (op <=) (x::int) y = (x < y)"
1171 Typically, the constant `partial_order.less' is created by a
1172 definition specification element in the context of locale
1175 * Method "induct": improved internal context management to support
1176 local fixes and defines on-the-fly. Thus explicit meta-level
1177 connectives !! and ==> are rarely required anymore in inductive goals
1178 (using object-logic connectives for this purpose has been long
1179 obsolete anyway). Common proof patterns are explained in
1180 src/HOL/Induct/Common_Patterns.thy, see also
1181 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
1184 * Method "induct": improved handling of simultaneous goals. Instead of
1185 introducing object-level conjunction, the statement is now split into
1186 several conclusions, while the corresponding symbolic cases are nested
1187 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
1188 see src/HOL/Induct/Common_Patterns.thy, for example.
1190 * Method "induct": mutual induction rules are now specified as a list
1191 of rule sharing the same induction cases. HOL packages usually provide
1192 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
1193 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
1194 mutual induction rules differently, i.e. like this:
1196 (induct rule: foo_bar.inducts)
1197 (induct set: foo bar)
1198 (induct pred: foo bar)
1199 (induct type: foo bar)
1201 The ML function ProjectRule.projections turns old-style rules into the
1204 * Method "coinduct": dual of induction, see
1205 src/HOL/Library/Coinductive_List.thy for various examples.
1207 * Method "cases", "induct", "coinduct": the ``(open)'' option is
1208 considered a legacy feature.
1210 * Attribute "symmetric" produces result with standardized schematic
1211 variables (index 0). Potential INCOMPATIBILITY.
1213 * Simplifier: by default the simplifier trace only shows top level
1214 rewrites now. That is, trace_simp_depth_limit is set to 1 by
1215 default. Thus there is less danger of being flooded by the trace. The
1216 trace indicates where parts have been suppressed.
1218 * Provers/classical: removed obsolete classical version of elim_format
1219 attribute; classical elim/dest rules are now treated uniformly when
1220 manipulating the claset.
1222 * Provers/classical: stricter checks to ensure that supplied intro,
1223 dest and elim rules are well-formed; dest and elim rules must have at
1226 * Provers/classical: attributes dest/elim/intro take an optional
1227 weight argument for the rule (just as the Pure versions). Weights are
1228 ignored by automated tools, but determine the search order of single
1231 * Syntax: input syntax now supports dummy variable binding "%_. b",
1232 where the body does not mention the bound variable. Note that dummy
1233 patterns implicitly depend on their context of bounds, which makes
1234 "{_. _}" match any set comprehension as expected. Potential
1235 INCOMPATIBILITY -- parse translations need to cope with syntactic
1236 constant "_idtdummy" in the binding position.
1238 * Syntax: removed obsolete syntactic constant "_K" and its associated
1239 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
1240 for example "A -> B" => "Pi A (%_. B)".
1242 * Pure: 'class_deps' command visualizes the subclass relation, using
1243 the graph browser tool.
1245 * Pure: 'print_theory' now suppresses certain internal declarations by
1246 default; use '!' option for full details.
1251 * Method "metis" proves goals by applying the Metis general-purpose
1252 resolution prover (see also http://gilith.com/software/metis/).
1253 Examples are in the directory MetisExamples. WARNING: the
1254 Isabelle/HOL-Metis integration does not yet work properly with
1257 * Command 'sledgehammer' invokes external automatic theorem provers as
1258 background processes. It generates calls to the "metis" method if
1259 successful. These can be pasted into the proof. Users do not have to
1260 wait for the automatic provers to return. WARNING: does not really
1261 work with multi-threading.
1263 * New "auto_quickcheck" feature tests outermost goal statements for
1264 potential counter-examples. Controlled by ML references
1265 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
1266 5000 milliseconds). Fails silently if statements is outside of
1267 executable fragment, or any other codgenerator problem occurs.
1269 * New constant "undefined" with axiom "undefined x = undefined".
1271 * Added class "HOL.eq", allowing for code generation with polymorphic
1274 * Some renaming of class constants due to canonical name prefixing in
1275 the new 'class' package:
1277 HOL.abs ~> HOL.abs_class.abs
1278 HOL.divide ~> HOL.divide_class.divide
1279 0 ~> HOL.zero_class.zero
1280 1 ~> HOL.one_class.one
1281 op + ~> HOL.plus_class.plus
1282 op - ~> HOL.minus_class.minus
1283 uminus ~> HOL.minus_class.uminus
1284 op * ~> HOL.times_class.times
1285 op < ~> HOL.ord_class.less
1286 op <= > HOL.ord_class.less_eq
1287 Nat.power ~> Power.power_class.power
1288 Nat.size ~> Nat.size_class.size
1289 Numeral.number_of ~> Numeral.number_class.number_of
1290 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
1291 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
1292 Orderings.min ~> Orderings.ord_class.min
1293 Orderings.max ~> Orderings.ord_class.max
1294 Divides.op div ~> Divides.div_class.div
1295 Divides.op mod ~> Divides.div_class.mod
1296 Divides.op dvd ~> Divides.div_class.dvd
1298 INCOMPATIBILITY. Adaptions may be required in the following cases:
1300 a) User-defined constants using any of the names "plus", "minus",
1301 "times", "less" or "less_eq". The standard syntax translations for
1302 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
1305 b) Variables named "plus", "minus", "times", "less", "less_eq"
1306 INCOMPATIBILITY: use more specific names.
1308 c) Permutative equations (e.g. "a + b = b + a")
1309 Since the change of names also changes the order of terms, permutative
1310 rewrite rules may get applied in a different order. Experience shows
1311 that this is rarely the case (only two adaptions in the whole Isabelle
1312 distribution). INCOMPATIBILITY: rewrite proofs
1314 d) ML code directly refering to constant names
1315 This in general only affects hand-written proof tactics, simprocs and
1316 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
1317 Consider using @{const_name} antiquotation.
1319 * New class "default" with associated constant "default".
1321 * Function "sgn" is now overloaded and available on int, real, complex
1322 (and other numeric types), using class "sgn". Two possible defs of
1323 sgn are given as equational assumptions in the classes sgn_if and
1324 sgn_div_norm; ordered_idom now also inherits from sgn_if.
1327 * Locale "partial_order" now unified with class "order" (cf. theory
1328 Orderings), added parameter "less". INCOMPATIBILITY.
1330 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
1331 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
1332 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
1334 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
1335 changed order of proof goals in instance proofs.
1337 * The transitivity reasoner for partial and linear orders is set up
1338 for classes "order" and "linorder". Instances of the reasoner are available
1339 in all contexts importing or interpreting the corresponding locales.
1340 Method "order" invokes the reasoner separately; the reasoner
1341 is also integrated with the Simplifier as a solver. Diagnostic
1342 command 'print_orders' shows the available instances of the reasoner
1343 in the current context.
1345 * Localized monotonicity predicate in theory "Orderings"; integrated
1346 lemmas max_of_mono and min_of_mono with this predicate.
1349 * Formulation of theorem "dense" changed slightly due to integration
1350 with new class dense_linear_order.
1352 * Uniform lattice theory development in HOL.
1354 constants "meet" and "join" now named "inf" and "sup"
1355 constant "Meet" now named "Inf"
1357 classes "meet_semilorder" and "join_semilorder" now named
1358 "lower_semilattice" and "upper_semilattice"
1359 class "lorder" now named "lattice"
1360 class "comp_lat" now named "complete_lattice"
1362 Instantiation of lattice classes allows explicit definitions
1363 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
1365 INCOMPATIBILITY. Theorem renames:
1367 meet_left_le ~> inf_le1
1368 meet_right_le ~> inf_le2
1369 join_left_le ~> sup_ge1
1370 join_right_le ~> sup_ge2
1371 meet_join_le ~> inf_sup_ord
1374 le_meet ~> le_inf_iff
1375 le_join ~> ge_sup_conv
1376 meet_idempotent ~> inf_idem
1377 join_idempotent ~> sup_idem
1378 meet_comm ~> inf_commute
1379 join_comm ~> sup_commute
1380 meet_leI1 ~> le_infI1
1381 meet_leI2 ~> le_infI2
1382 le_joinI1 ~> le_supI1
1383 le_joinI2 ~> le_supI2
1384 meet_assoc ~> inf_assoc
1385 join_assoc ~> sup_assoc
1386 meet_left_comm ~> inf_left_commute
1387 meet_left_idempotent ~> inf_left_idem
1388 join_left_comm ~> sup_left_commute
1389 join_left_idempotent ~> sup_left_idem
1392 le_def_meet ~> le_iff_inf
1393 le_def_join ~> le_iff_sup
1394 join_absorp2 ~> sup_absorb2
1395 join_absorp1 ~> sup_absorb1
1396 meet_absorp1 ~> inf_absorb1
1397 meet_absorp2 ~> inf_absorb2
1398 meet_join_absorp ~> inf_sup_absorb
1399 join_meet_absorp ~> sup_inf_absorb
1400 distrib_join_le ~> distrib_sup_le
1401 distrib_meet_le ~> distrib_inf_le
1403 add_meet_distrib_left ~> add_inf_distrib_left
1404 add_join_distrib_left ~> add_sup_distrib_left
1405 is_join_neg_meet ~> is_join_neg_inf
1406 is_meet_neg_join ~> is_meet_neg_sup
1407 add_meet_distrib_right ~> add_inf_distrib_right
1408 add_join_distrib_right ~> add_sup_distrib_right
1409 add_meet_join_distribs ~> add_sup_inf_distribs
1410 join_eq_neg_meet ~> sup_eq_neg_inf
1411 meet_eq_neg_join ~> inf_eq_neg_sup
1412 add_eq_meet_join ~> add_eq_inf_sup
1413 meet_0_imp_0 ~> inf_0_imp_0
1414 join_0_imp_0 ~> sup_0_imp_0
1415 meet_0_eq_0 ~> inf_0_eq_0
1416 join_0_eq_0 ~> sup_0_eq_0
1417 neg_meet_eq_join ~> neg_inf_eq_sup
1418 neg_join_eq_meet ~> neg_sup_eq_inf
1419 join_eq_if ~> sup_eq_if
1421 mono_meet ~> mono_inf
1422 mono_join ~> mono_sup
1423 meet_bool_eq ~> inf_bool_eq
1424 join_bool_eq ~> sup_bool_eq
1425 meet_fun_eq ~> inf_fun_eq
1426 join_fun_eq ~> sup_fun_eq
1427 meet_set_eq ~> inf_set_eq
1428 join_set_eq ~> sup_set_eq
1429 meet1_iff ~> inf1_iff
1430 meet2_iff ~> inf2_iff
1439 join1_iff ~> sup1_iff
1440 join2_iff ~> sup2_iff
1450 is_meet_Meet ~> is_meet_Inf
1451 Meet_bool_def ~> Inf_bool_def
1452 Meet_fun_def ~> Inf_fun_def
1453 Meet_greatest ~> Inf_greatest
1454 Meet_lower ~> Inf_lower
1455 Meet_set_def ~> Inf_set_def
1458 Sup_bool_eq ~> Sup_bool_def
1459 Sup_fun_eq ~> Sup_fun_def
1460 Sup_set_eq ~> Sup_set_def
1462 listsp_meetI ~> listsp_infI
1463 listsp_meet_eq ~> listsp_inf_eq
1468 * Added syntactic class "size"; overloaded constant "size" now has
1469 type "'a::size ==> bool"
1471 * Internal reorganisation of `size' of datatypes: size theorems
1472 "foo.size" are no longer subsumed by "foo.simps" (but are still
1473 simplification rules by default!); theorems "prod.size" now named
1476 * Class "div" now inherits from class "times" rather than "type".
1479 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
1480 Linorder etc. have disappeared; operations defined in terms of
1481 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
1483 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
1485 * HOL-Word: New extensive library and type for generic, fixed size
1486 machine words, with arithemtic, bit-wise, shifting and rotating
1487 operations, reflection into int, nat, and bool lists, automation for
1488 linear arithmetic (by automatic reflection into nat or int), including
1489 lemmas on overflow and monotonicity. Instantiated to all appropriate
1490 arithmetic type classes, supporting automatic simplification of
1491 numerals on all operations.
1493 * Library/Boolean_Algebra: locales for abstract boolean algebras.
1495 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
1497 * Code generator library theories:
1498 - Code_Integer represents HOL integers by big integer literals in target
1500 - Code_Char represents HOL characters by character literals in target
1502 - Code_Char_chr like Code_Char, but also offers treatment of character
1503 codes; includes Code_Integer.
1504 - Executable_Set allows to generate code for finite sets using lists.
1505 - Executable_Rat implements rational numbers as triples (sign, enumerator,
1507 - Executable_Real implements a subset of real numbers, namly those
1508 representable by rational numbers.
1509 - Efficient_Nat implements natural numbers by integers, which in general will
1510 result in higher efficency; pattern matching with 0/Suc is eliminated;
1511 includes Code_Integer.
1512 - Code_Index provides an additional datatype index which is mapped to
1513 target-language built-in integers.
1514 - Code_Message provides an additional datatype message_string which is isomorphic to
1515 strings; messages are mapped to target-language strings.
1517 * New package for inductive predicates
1519 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
1522 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1523 for z_1 :: U_1 and ... and z_n :: U_m
1525 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1528 with full support for type-inference, rather than
1530 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1532 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1533 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1535 inductive "s z_1 ... z_m"
1537 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1540 For backward compatibility, there is a wrapper allowing inductive
1541 sets to be defined with the new package via
1544 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1545 for z_1 :: U_1 and ... and z_n :: U_m
1547 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1553 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1554 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1555 for z_1 :: U_1 and ... and z_n :: U_m
1557 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1558 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1561 if the additional syntax "p ..." is required.
1563 Numerous examples can be found in the subdirectories src/HOL/Auth,
1564 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
1568 - Since declaration and definition of inductive sets or predicates
1569 is no longer separated, abbreviations involving the newly
1570 introduced sets or predicates must be specified together with the
1571 introduction rules after the 'where' keyword (see above), rather
1572 than before the actual inductive definition.
1574 - The variables in induction and elimination rules are now
1575 quantified in the order of their occurrence in the introduction
1576 rules, rather than in alphabetical order. Since this may break
1577 some proofs, these proofs either have to be repaired, e.g. by
1578 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
1579 statements of the form
1581 case (rule_i a_i_1 ... a_i_{k_i})
1583 or the old order of quantification has to be restored by explicitly adding
1584 meta-level quantifiers in the introduction rules, i.e.
1586 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
1588 - The format of the elimination rules is now
1590 p z_1 ... z_m x_1 ... x_n ==>
1591 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1596 (x_1, ..., x_n) : s z_1 ... z_m ==>
1597 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1600 for sets rather than
1602 x : s z_1 ... z_m ==>
1603 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
1606 This may require terms in goals to be expanded to n-tuples
1607 (e.g. using case_tac or simplification with the split_paired_all
1608 rule) before the above elimination rule is applicable.
1610 - The elimination or case analysis rules for (mutually) inductive
1611 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
1612 list of rules "p_1_..._p_k.elims" is no longer available.
1614 * New package "function"/"fun" for general recursive functions,
1615 supporting mutual and nested recursion, definitions in local contexts,
1616 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
1617 for small examples, and the separate tutorial on the function
1618 package. The old recdef "package" is still available as before, but
1619 users are encouraged to use the new package.
1621 * Method "lexicographic_order" automatically synthesizes termination
1622 relations as lexicographic combinations of size measures.
1624 * Case-expressions allow arbitrary constructor-patterns (including
1625 "_") and take their order into account, like in functional
1626 programming. Internally, this is translated into nested
1627 case-expressions; missing cases are added and mapped to the predefined
1628 constant "undefined". In complicated cases printing may no longer show
1629 the original input but the internal form. Lambda-abstractions allow
1630 the same form of pattern matching: "% pat1 => e1 | ..." is an
1631 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
1634 * IntDef: The constant "int :: nat => int" has been removed; now "int"
1635 is an abbreviation for "of_nat :: nat => int". The simplification
1636 rules for "of_nat" have been changed to work like "int" did
1637 previously. Potential INCOMPATIBILITY:
1638 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
1639 - of_nat_diff and of_nat_mult are no longer default simp rules
1641 * Method "algebra" solves polynomial equations over (semi)rings using
1642 Groebner bases. The (semi)ring structure is defined by locales and the
1643 tool setup depends on that generic context. Installing the method for
1644 a specific type involves instantiating the locale and possibly adding
1645 declarations for computation on the coefficients. The method is
1646 already instantiated for natural numbers and for the axiomatic class
1647 of idoms with numerals. See also the paper by Chaieb and Wenzel at
1648 CALCULEMUS 2007 for the general principles underlying this
1649 architecture of context-aware proof-tools.
1651 * Method "ferrack" implements quantifier elimination over
1652 special-purpose dense linear orders using locales (analogous to
1653 "algebra"). The method is already installed for class
1654 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
1657 * Former constant "List.op @" now named "List.append". Use ML
1658 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
1659 circumvent possible incompatibilities when working on ML level.
1661 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
1663 * New function listsum :: 'a list => 'a for arbitrary monoids.
1664 Special syntax: "SUM x <- xs. f x" (and latex variants)
1666 * New syntax for Haskell-like list comprehension (input only), eg.
1667 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
1669 * The special syntax for function "filter" has changed from [x :
1670 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
1671 comprehension syntax, and for uniformity. INCOMPATIBILITY.
1673 * [a..b] is now defined for arbitrary linear orders. It used to be
1674 defined on nat only, as an abbreviation for [a..<Suc b]
1677 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
1679 * New functions "sorted" and "sort" in src/HOL/List.thy.
1681 * New lemma collection field_simps (an extension of ring_simps) for
1682 manipulating (in)equations involving division. Multiplies with all
1683 denominators that can be proved to be non-zero (in equations) or
1684 positive/negative (in inequations).
1686 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
1687 have been improved and renamed to ring_simps, group_simps and
1688 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
1689 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
1691 * Theory Library/Commutative_Ring: switched from recdef to function
1692 package; constants add, mul, pow now curried. Infix syntax for
1693 algebraic operations.
1695 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
1698 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
1701 * HOL/records: generalised field-update to take a function on the
1702 field rather than the new value: r(|A := x|) is translated to A_update
1703 (K x) r The K-combinator that is internally used is called K_record.
1704 INCOMPATIBILITY: Usage of the plain update functions has to be
1707 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
1708 * x = 0, which are required for a semiring. Richer structures do not
1709 inherit from semiring_0 anymore, because this property is a theorem
1710 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
1711 there is more to prove, but this is mostly trivial.
1713 * Class "recpower" is generalized to arbitrary monoids, not just
1714 commutative semirings. INCOMPATIBILITY: may need to incorporate
1715 commutativity or semiring properties additionally.
1717 * Constant "List.list_all2" in List.thy now uses authentic syntax.
1718 INCOMPATIBILITY: translations containing list_all2 may go wrong,
1719 better use 'abbreviation'.
1721 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
1723 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
1724 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
1725 significant changes for setting up numeral syntax for types:
1726 - New constants Numeral.pred and Numeral.succ instead
1727 of former Numeral.bin_pred and Numeral.bin_succ.
1728 - Use integer operations instead of bin_add, bin_mult and so on.
1729 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
1730 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
1732 See src/HOL/Integ/IntArith.thy for an example setup.
1734 * Command 'normal_form' computes the normal form of a term that may
1735 contain free variables. For example ``normal_form "rev [a, b, c]"''
1736 produces ``[b, c, a]'' (without proof). This command is suitable for
1737 heavy-duty computations because the functions are compiled to ML
1738 first. Correspondingly, a method "normalization" is provided. See
1739 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
1741 * Alternative iff syntax "A <-> B" for equality on bool (with priority
1742 25 like -->); output depends on the "iff" print_mode, the default is
1743 "A = B" (with priority 50).
1745 * Relations less (<) and less_eq (<=) are also available on type bool.
1746 Modified syntax to disallow nesting without explicit parentheses,
1747 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
1750 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
1752 * Relation composition operator "op O" now has precedence 75 and binds
1753 stronger than union and intersection. INCOMPATIBILITY.
1755 * The old set interval syntax "{m..n(}" (and relatives) has been
1756 removed. Use "{m..<n}" (and relatives) instead.
1758 * In the context of the assumption "~(s = t)" the Simplifier rewrites
1759 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
1760 ``declare [[simproc del: neq]]''.
1762 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
1765 * Theorem Cons_eq_map_conv no longer declared as "simp".
1767 * Theorem setsum_mult renamed to setsum_right_distrib.
1769 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
1772 * Reimplemented methods "sat" and "satx", with several improvements:
1773 goals no longer need to be stated as "<prems> ==> False", equivalences
1774 (i.e. "=" on type bool) are handled, variable names of the form
1775 "lit_<n>" are no longer reserved, significant speedup.
1777 * Methods "sat" and "satx" can now replay MiniSat proof traces.
1778 zChaff is still supported as well.
1780 * 'inductive' and 'datatype': provide projections of mutual rules,
1781 bundled as foo_bar.inducts;
1783 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
1786 * Library: moved theory Accessible_Part to main HOL.
1788 * Library: added theory Coinductive_List of potentially infinite lists
1789 as greatest fixed-point.
1791 * Library: added theory AssocList which implements (finite) maps as
1794 * Method "evaluation" solves goals (i.e. a boolean expression)
1795 efficiently by compiling it to ML. The goal is "proved" (via an
1796 oracle) if it evaluates to True.
1798 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
1799 also when invoked by the simplifier. This results in the Simplifier
1800 being more powerful on arithmetic goals. INCOMPATIBILITY.
1801 Configuration option fast_arith_split_limit=0 recovers the old
1804 * Support for hex (0x20) and binary (0b1001) numerals.
1806 * New method: reify eqs (t), where eqs are equations for an
1807 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
1808 parameter, computes a term s::'b and a list xs::'a list and proves the
1809 theorem I xs s = t. This is also known as reification or quoting. The
1810 resulting theorem is applied to the subgoal to substitute t with I xs
1811 s. If t is omitted, the subgoal itself is reified.
1813 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
1814 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
1815 where f is supposed to be a computable function (in the sense of code
1816 generattion). The method uses reify to compute s and xs as above then
1817 applies corr_thm and uses normalization by evaluation to "prove" f s =
1818 r and finally gets the theorem t = r, which is again applied to the
1819 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
1821 * Reflection: Automatic reification now handels binding, an example is
1822 available in src/HOL/ex/ReflectionEx.thy
1824 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
1825 command 'statespace' that is similar to 'record', but introduces an
1826 abstract specification based on the locale infrastructure instead of
1827 HOL types. This leads to extra flexibility in composing state spaces,
1828 in particular multiple inheritance and renaming of components.
1833 * Hyperreal: Functions root and sqrt are now defined on negative real
1834 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
1835 Nonnegativity side conditions have been removed from many lemmas, so
1836 that more subgoals may now be solved by simplification; potential
1839 * Real: new type classes formalize real normed vector spaces and
1840 algebras, using new overloaded constants scaleR :: real => 'a => 'a
1841 and norm :: 'a => real.
1843 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
1844 reals into other types. The overloaded constant Reals :: 'a set is now
1845 defined as range of_real; potential INCOMPATIBILITY.
1847 * Real: proper support for ML code generation, including 'quickcheck'.
1848 Reals are implemented as arbitrary precision rationals.
1850 * Hyperreal: Several constants that previously worked only for the
1851 reals have been generalized, so they now work over arbitrary vector
1852 spaces. Type annotations may need to be added in some cases; potential
1855 Infinitesimal :: ('a::real_normed_vector) star set
1856 HFinite :: ('a::real_normed_vector) star set
1857 HInfinite :: ('a::real_normed_vector) star set
1858 approx :: ('a::real_normed_vector) star => 'a star => bool
1859 monad :: ('a::real_normed_vector) star => 'a star set
1860 galaxy :: ('a::real_normed_vector) star => 'a star set
1861 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
1862 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
1863 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
1864 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
1865 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
1866 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
1867 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
1868 sgn :: 'a::real_normed_vector => 'a
1869 exp :: 'a::{recpower,real_normed_field,banach} => 'a
1871 * Complex: Some complex-specific constants are now abbreviations for
1872 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
1873 hnorm. Other constants have been entirely removed in favor of the
1874 polymorphic versions (INCOMPATIBILITY):
1878 HInfinite <-- CInfinite
1879 Infinitesimal <-- CInfinitesimal
1882 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
1883 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
1884 (ns)deriv <-- (ns)cderiv
1889 * Formalisation of ideals and the quotient construction over rings.
1891 * Order and lattice theory no longer based on records.
1894 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
1895 greatest_closed. INCOMPATIBILITY.
1897 * Method algebra is now set up via an attribute. For examples see
1898 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
1899 of algebraic structures.
1901 * Renamed theory CRing to Ring.
1906 * Substantial, yet incomplete support for nominal datatypes (binding
1907 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
1908 src/HOL/Nominal/Examples. Prospective users should consult
1909 http://isabelle.in.tum.de/nominal/
1914 * ML basics: just one true type int, which coincides with IntInf.int
1917 * ML within Isar: antiquotations allow to embed statically-checked
1918 formal entities in the source, referring to the context available at
1919 compile-time. For example:
1921 ML {* @{sort "{zero,one}"} *}
1922 ML {* @{typ "'a => 'b"} *}
1923 ML {* @{term "%x. x"} *}
1924 ML {* @{prop "x == y"} *}
1925 ML {* @{ctyp "'a => 'b"} *}
1926 ML {* @{cterm "%x. x"} *}
1927 ML {* @{cprop "x == y"} *}
1928 ML {* @{thm asm_rl} *}
1929 ML {* @{thms asm_rl} *}
1930 ML {* @{type_name c} *}
1931 ML {* @{type_syntax c} *}
1932 ML {* @{const_name c} *}
1933 ML {* @{const_syntax c} *}
1936 ML {* @{theory Pure} *}
1937 ML {* @{theory_ref} *}
1938 ML {* @{theory_ref Pure} *}
1941 ML {* @{clasimpset} *}
1943 The same works for sources being ``used'' within an Isar context.
1945 * ML in Isar: improved error reporting; extra verbosity with
1946 ML_Context.trace enabled.
1948 * Pure/General/table.ML: the join operations now works via exceptions
1949 DUP/SAME instead of type option. This is simpler in simple cases, and
1950 admits slightly more efficient complex applications.
1952 * Pure: 'advanced' translation functions (parse_translation etc.) now
1953 use Context.generic instead of just theory.
1955 * Pure: datatype Context.generic joins theory/Proof.context and
1956 provides some facilities for code that works in either kind of
1957 context, notably GenericDataFun for uniform theory and proof data.
1959 * Pure: simplified internal attribute type, which is now always
1960 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
1961 local (Proof.context) attributes have been discontinued, while
1962 minimizing code duplication. Thm.rule_attribute and
1963 Thm.declaration_attribute build canonical attributes; see also structure
1964 Context for further operations on Context.generic, notably
1965 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
1966 declarations and definitions.
1968 * Context data interfaces (Theory/Proof/GenericDataFun): removed
1969 name/print, uninitialized data defaults to ad-hoc copy of empty value,
1970 init only required for impure data. INCOMPATIBILITY: empty really need
1971 to be empty (no dependencies on theory content!)
1973 * Pure/kernel: consts certification ignores sort constraints given in
1974 signature declarations. (This information is not relevant to the
1975 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
1976 potential INCOMPATIBILITY.
1978 * Pure: axiomatic type classes are now purely definitional, with
1979 explicit proofs of class axioms and super class relations performed
1980 internally. See Pure/axclass.ML for the main internal interfaces --
1981 notably AxClass.define_class supercedes AxClass.add_axclass, and
1982 AxClass.axiomatize_class/classrel/arity supersede
1983 Sign.add_classes/classrel/arities.
1985 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
1986 global/local versions on theory vs. Proof.context have been
1987 discontinued; Attrib.syntax and Method.syntax have been adapted
1988 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
1989 attributes, methods, etc.
1991 * Pure: several functions of signature "... -> theory -> theory * ..."
1992 have been reoriented to "... -> theory -> ... * theory" in order to
1993 allow natural usage in combination with the ||>, ||>>, |-> and
1994 fold_map combinators.
1996 * Pure: official theorem names (closed derivations) and additional
1997 comments (tags) are now strictly separate. Name hints -- which are
1998 maintained as tags -- may be attached any time without affecting the
2001 * Pure: primitive rule lift_rule now takes goal cterm instead of an
2002 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
2003 achieve the old behaviour.
2005 * Pure: the "Goal" constant is now called "prop", supporting a
2006 slightly more general idea of ``protecting'' meta-level rule
2009 * Pure: Logic.(un)varify only works in a global context, which is now
2010 enforced instead of silently assumed. INCOMPATIBILITY, may use
2011 Logic.legacy_(un)varify as temporary workaround.
2013 * Pure: structure Name provides scalable operations for generating
2014 internal variable names, notably Name.variants etc. This replaces
2015 some popular functions from term.ML:
2017 Term.variant -> Name.variant
2018 Term.variantlist -> Name.variant_list
2019 Term.invent_names -> Name.invent_list
2021 Note that low-level renaming rarely occurs in new code -- operations
2022 from structure Variable are used instead (see below).
2024 * Pure: structure Variable provides fundamental operations for proper
2025 treatment of fixed/schematic variables in a context. For example,
2026 Variable.import introduces fixes for schematics of given facts and
2027 Variable.export reverses the effect (up to renaming) -- this replaces
2028 various freeze_thaw operations.
2030 * Pure: structure Goal provides simple interfaces for
2031 init/conclude/finish and tactical prove operations (replacing former
2032 Tactic.prove). Goal.prove is the canonical way to prove results
2033 within a given context; Goal.prove_global is a degraded version for
2034 theory level goals, including a global Drule.standard. Note that
2035 OldGoals.prove_goalw_cterm has long been obsolete, since it is
2036 ill-behaved in a local proof context (e.g. with local fixes/assumes or
2037 in a locale context).
2039 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
2040 and type checking (Syntax.check_term etc.), with common combinations
2041 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
2042 which are considered legacy and await removal.
2044 * Pure/Syntax: generic interfaces for type unchecking
2045 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
2046 with common combinations (Syntax.pretty_term, Syntax.string_of_term
2047 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
2048 available for convenience, but refer to the very same operations using
2049 a mere theory instead of a full context.
2051 * Isar: simplified treatment of user-level errors, using exception
2052 ERROR of string uniformly. Function error now merely raises ERROR,
2053 without any side effect on output channels. The Isar toplevel takes
2054 care of proper display of ERROR exceptions. ML code may use plain
2055 handle/can/try; cat_error may be used to concatenate errors like this:
2057 ... handle ERROR msg => cat_error msg "..."
2059 Toplevel ML code (run directly or through the Isar toplevel) may be
2060 embedded into the Isar toplevel with exception display/debug like
2063 Isar.toplevel (fn () => ...)
2065 INCOMPATIBILITY, removed special transform_error facilities, removed
2066 obsolete variants of user-level exceptions (ERROR_MESSAGE,
2067 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
2068 -- use plain ERROR instead.
2070 * Isar: theory setup now has type (theory -> theory), instead of a
2071 list. INCOMPATIBILITY, may use #> to compose setup functions.
2073 * Isar: ML toplevel pretty printer for type Proof.context, subject to
2074 ProofContext.debug/verbose flags.
2076 * Isar: Toplevel.theory_to_proof admits transactions that modify the
2077 theory before entering a proof state. Transactions now always see a
2078 quasi-functional intermediate checkpoint, both in interactive and
2081 * Isar: simplified interfaces for outer syntax. Renamed
2082 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
2083 OuterSyntax.add_parsers -- this functionality is now included in
2084 OuterSyntax.command etc. INCOMPATIBILITY.
2086 * Simplifier: the simpset of a running simplification process now
2087 contains a proof context (cf. Simplifier.the_context), which is the
2088 very context that the initial simpset has been retrieved from (by
2089 simpset_of/local_simpset_of). Consequently, all plug-in components
2090 (solver, looper etc.) may depend on arbitrary proof data.
2092 * Simplifier.inherit_context inherits the proof context (plus the
2093 local bounds) of the current simplification process; any simproc
2094 etc. that calls the Simplifier recursively should do this! Removed
2095 former Simplifier.inherit_bounds, which is already included here --
2096 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
2097 specify an explicit context using Simplifier.context/theory_context.
2099 * Simplifier/Classical Reasoner: more abstract interfaces
2100 change_simpset/claset for modifying the simpset/claset reference of a
2101 theory; raw versions simpset/claset_ref etc. have been discontinued --
2104 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
2110 * settings: the default heap location within ISABELLE_HOME_USER now
2111 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
2112 Isabelle installations.
2114 * isabelle-process: option -S (secure mode) disables some critical
2115 operations, notably runtime compilation and evaluation of ML source
2118 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
2120 * Support for parallel execution, using native multicore support of
2121 Poly/ML 5.1. The theory loader exploits parallelism when processing
2122 independent theories, according to the given theory header
2123 specifications. The maximum number of worker threads is specified via
2124 usedir option -M or the "max-threads" setting in Proof General. A
2125 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
2126 to 6 on a 8-core machine. User-code needs to observe certain
2127 guidelines for thread-safe programming, see appendix A in the Isar
2128 Implementation manual.
2132 New in Isabelle2005 (October 2005)
2133 ----------------------------------
2137 * Theory headers: the new header syntax for Isar theories is
2140 imports <theory1> ... <theoryN>
2141 uses <file1> ... <fileM>
2144 where the 'uses' part is optional. The previous syntax
2146 theory <name> = <theory1> + ... + <theoryN>:
2148 will disappear in the next release. Use isatool fixheaders to convert
2149 existing theory files. Note that there is no change in ancient
2150 non-Isar theories now, but these will disappear soon.
2152 * Theory loader: parent theories can now also be referred to via
2153 relative and absolute paths.
2155 * Command 'find_theorems' searches for a list of criteria instead of a
2156 list of constants. Known criteria are: intro, elim, dest, name:string,
2157 simp:term, and any term. Criteria can be preceded by '-' to select
2158 theorems that do not match. Intro, elim, dest select theorems that
2159 match the current goal, name:s selects theorems whose fully qualified
2160 name contain s, and simp:term selects all simplification rules whose
2161 lhs match term. Any other term is interpreted as pattern and selects
2162 all theorems matching the pattern. Available in ProofGeneral under
2163 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
2165 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
2167 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
2168 matching the current goal as introduction rule and not having "HOL."
2169 in their name (i.e. not being defined in theory HOL).
2171 * Command 'thms_containing' has been discontinued in favour of
2172 'find_theorems'; INCOMPATIBILITY.
2174 * Communication with Proof General is now 8bit clean, which means that
2175 Unicode text in UTF-8 encoding may be used within theory texts (both
2176 formal and informal parts). Cf. option -U of the Isabelle Proof
2177 General interface. Here are some simple examples (cf. src/HOL/ex):
2179 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
2180 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
2182 * Improved efficiency of the Simplifier and, to a lesser degree, the
2183 Classical Reasoner. Typical big applications run around 2 times
2187 *** Document preparation ***
2189 * Commands 'display_drafts' and 'print_drafts' perform simple output
2190 of raw sources. Only those symbols that do not require additional
2191 LaTeX packages (depending on comments in isabellesym.sty) are
2192 displayed properly, everything else is left verbatim. isatool display
2193 and isatool print are used as front ends (these are subject to the
2194 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
2196 * Command tags control specific markup of certain regions of text,
2197 notably folding and hiding. Predefined tags include "theory" (for
2198 theory begin and end), "proof" for proof commands, and "ML" for
2199 commands involving ML code; the additional tags "visible" and
2200 "invisible" are unused by default. Users may give explicit tag
2201 specifications in the text, e.g. ''by %invisible (auto)''. The
2202 interpretation of tags is determined by the LaTeX job during document
2203 preparation: see option -V of isatool usedir, or options -n and -t of
2204 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
2207 Several document versions may be produced at the same time via isatool
2208 usedir (the generated index.html will link all of them). Typical
2209 specifications include ''-V document=theory,proof,ML'' to present
2210 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
2211 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
2212 these parts without any formal replacement text. The Isabelle site
2213 default settings produce ''document'' and ''outline'' versions as
2216 * Several new antiquotations:
2218 @{term_type term} prints a term with its type annotated;
2220 @{typeof term} prints the type of a term;
2222 @{const const} is the same as @{term const}, but checks that the
2223 argument is a known logical constant;
2225 @{term_style style term} and @{thm_style style thm} print a term or
2226 theorem applying a "style" to it
2230 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
2231 definitions, equations, inequations etc., 'concl' printing only the
2232 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
2233 to print the specified premise. TermStyle.add_style provides an ML
2234 interface for introducing further styles. See also the "LaTeX Sugar"
2235 document practical applications. The ML antiquotation prints
2236 type-checked ML expressions verbatim.
2238 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
2239 and 'text' support optional locale specification '(in loc)', which
2240 specifies the default context for interpreting antiquotations. For
2241 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
2243 * Option 'locale=NAME' of antiquotations specifies an alternative
2244 context interpreting the subsequent argument. For example: @{thm
2245 [locale=lattice] inf_assoc}.
2247 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
2250 * Proper output of antiquotations for theory commands involving a
2251 proof context (such as 'locale' or 'theorem (in loc) ...').
2253 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
2254 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
2256 * isatool usedir: new option -C (default true) controls whether option
2257 -D should include a copy of the original document directory; -C false
2258 prevents unwanted effects such as copying of administrative CVS data.
2263 * Considerably improved version of 'constdefs' command. Now performs
2264 automatic type-inference of declared constants; additional support for
2265 local structure declarations (cf. locales and HOL records), see also
2266 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
2267 sequential dependencies of definitions within a single 'constdefs'
2268 section; moreover, the declared name needs to be an identifier. If
2269 all fails, consider to fall back on 'consts' and 'defs' separately.
2271 * Improved indexed syntax and implicit structures. First of all,
2272 indexed syntax provides a notational device for subscripted
2273 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
2274 expressions. Secondly, in a local context with structure
2275 declarations, number indexes \<^sub>n or the empty index (default
2276 number 1) refer to a certain fixed variable implicitly; option
2277 show_structs controls printing of implicit structures. Typical
2278 applications of these concepts involve record types and locales.
2280 * New command 'no_syntax' removes grammar declarations (and
2281 translations) resulting from the given syntax specification, which is
2282 interpreted in the same manner as for the 'syntax' command.
2284 * 'Advanced' translation functions (parse_translation etc.) may depend
2285 on the signature of the theory context being presently used for
2286 parsing/printing, see also isar-ref manual.
2288 * Improved 'oracle' command provides a type-safe interface to turn an
2289 ML expression of type theory -> T -> term into a primitive rule of
2290 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
2291 is already included here); see also FOL/ex/IffExample.thy;
2294 * axclass: name space prefix for class "c" is now "c_class" (was "c"
2295 before); "cI" is no longer bound, use "c.intro" instead.
2296 INCOMPATIBILITY. This change avoids clashes of fact bindings for
2297 axclasses vs. locales.
2299 * Improved internal renaming of symbolic identifiers -- attach primes
2300 instead of base 26 numbers.
2302 * New flag show_question_marks controls printing of leading question
2303 marks in schematic variable names.
2305 * In schematic variable names, *any* symbol following \<^isub> or
2306 \<^isup> is now treated as part of the base name. For example, the
2307 following works without printing of awkward ".0" indexes:
2309 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
2312 * Inner syntax includes (*(*nested*) comments*).
2314 * Pretty printer now supports unbreakable blocks, specified in mixfix
2315 annotations as "(00...)".
2317 * Clear separation of logical types and nonterminals, where the latter
2318 may only occur in 'syntax' specifications or type abbreviations.
2319 Before that distinction was only partially implemented via type class
2320 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
2321 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
2322 exotic syntax specifications may require further adaption
2323 (e.g. Cube/Cube.thy).
2325 * Removed obsolete type class "logic", use the top sort {} instead.
2326 Note that non-logical types should be declared as 'nonterminals'
2327 rather than 'types'. INCOMPATIBILITY for new object-logic
2330 * Attributes 'induct' and 'cases': type or set names may now be
2331 locally fixed variables as well.
2333 * Simplifier: can now control the depth to which conditional rewriting
2334 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
2337 * Simplifier: simplification procedures may now take the current
2338 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
2339 interface), which is very useful for calling the Simplifier
2340 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
2341 is gone -- use prems_of_ss on the simpset instead. Moreover, the
2342 low-level mk_simproc no longer applies Logic.varify internally, to
2343 allow for use in a context of fixed variables.
2345 * thin_tac now works even if the assumption being deleted contains !!
2346 or ==>. More generally, erule now works even if the major premise of
2347 the elimination rule contains !! or ==>.
2349 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
2351 * Reorganized bootstrapping of the Pure theories; CPure is now derived
2352 from Pure, which contains all common declarations already. Both
2353 theories are defined via plain Isabelle/Isar .thy files.
2354 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
2355 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
2356 use isatool fixcpure to adapt your theory and ML sources.
2358 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
2359 selections of theorems in named facts via index ranges.
2361 * 'print_theorems': in theory mode, really print the difference
2362 wrt. the last state (works for interactive theory development only),
2363 in proof mode print all local facts (cf. 'print_facts');
2365 * 'hide': option '(open)' hides only base names.
2367 * More efficient treatment of intermediate checkpoints in interactive
2370 * Code generator is now invoked via code_module (incremental code
2371 generation) and code_library (modular code generation, ML structures
2372 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
2373 must be quoted when used as identifiers.
2375 * New 'value' command for reading, evaluating and printing terms using
2376 the code generator. INCOMPATIBILITY: command keyword 'value' must be
2377 quoted when used as identifier.
2382 * New commands for the interpretation of locale expressions in
2383 theories (1), locales (2) and proof contexts (3). These generate
2384 proof obligations from the expression specification. After the
2385 obligations have been discharged, theorems of the expression are added
2386 to the theory, target locale or proof context. The synopsis of the
2387 commands is a follows:
2389 (1) interpretation expr inst
2390 (2) interpretation target < expr
2391 (3) interpret expr inst
2393 Interpretation in theories and proof contexts require a parameter
2394 instantiation of terms from the current context. This is applied to
2395 specifications and theorems of the interpreted expression.
2396 Interpretation in locales only permits parameter renaming through the
2397 locale expression. Interpretation is smart in that interpretations
2398 that are active already do not occur in proof obligations, neither are
2399 instantiated theorems stored in duplicate. Use 'print_interps' to
2400 inspect active interpretations of a particular locale. For details,
2401 see the Isar Reference manual. Examples can be found in
2402 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
2404 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
2405 'interpret' instead.
2407 * New context element 'constrains' for adding type constraints to
2410 * Context expressions: renaming of parameters with syntax
2413 * Locale declaration: 'includes' disallowed.
2415 * Proper static binding of attribute syntax -- i.e. types / terms /
2416 facts mentioned as arguments are always those of the locale definition
2417 context, independently of the context of later invocations. Moreover,
2418 locale operations (renaming and type / term instantiation) are applied
2419 to attribute arguments as expected.
2421 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
2422 actual attributes; rare situations may require Attrib.attribute to
2423 embed those attributes into Attrib.src that lack concrete syntax.
2424 Attribute implementations need to cooperate properly with the static
2425 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
2426 Attrib.XXX_thm etc. already do the right thing without further
2427 intervention. Only unusual applications -- such as "where" or "of"
2428 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
2429 on the context and the facts involved -- may have to assign parsed
2430 values to argument tokens explicitly.
2432 * Changed parameter management in theorem generation for long goal
2433 statements with 'includes'. INCOMPATIBILITY: produces a different
2434 theorem statement in rare situations.
2436 * Locale inspection command 'print_locale' omits notes elements. Use
2437 'print_locale!' to have them included in the output.
2442 * Provers/hypsubst.ML: improved version of the subst method, for
2443 single-step rewriting: it now works in bound variable contexts. New is
2444 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
2445 rewrite a different subterm than the original subst method, which is
2446 still available as 'simplesubst'.
2448 * Provers/quasi.ML: new transitivity reasoners for transitivity only
2451 * Provers/trancl.ML: new transitivity reasoner for transitive and
2452 reflexive-transitive closure of relations.
2454 * Provers/blast.ML: new reference depth_limit to make blast's depth
2455 limit (previously hard-coded with a value of 20) user-definable.
2457 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
2458 is peformed already. Object-logics merely need to finish their
2459 initial simpset configuration as before. INCOMPATIBILITY.
2464 * Symbolic syntax of Hilbert Choice Operator is now as follows:
2467 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
2469 The symbol \<some> is displayed as the alternative epsilon of LaTeX
2470 and x-symbol; use option '-m epsilon' to get it actually printed.
2471 Moreover, the mathematically important symbolic identifier \<epsilon>
2472 becomes available as variable, constant etc. INCOMPATIBILITY,
2474 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
2475 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
2476 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
2477 support corresponding Isar calculations.
2479 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
2482 * theory SetInterval: changed the syntax for open intervals:
2491 The old syntax is still supported but will disappear in the next
2492 release. For conversion use the following Emacs search and replace
2493 patterns (these are not perfect but work quite well):
2495 {)\([^\.]*\)\.\. -> {\1<\.\.}
2496 \.\.\([^(}]*\)(} -> \.\.<\1}
2498 * Theory Commutative_Ring (in Library): method comm_ring for proving
2499 equalities in commutative rings; method 'algebra' provides a generic
2502 * Theory Finite_Set: changed the syntax for 'setsum', summation over
2503 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
2504 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
2507 Some new syntax forms are available:
2509 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
2510 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
2511 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
2512 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
2514 The latter form "\<Sum>x < k. e" used to be based on a separate
2515 function "Summation", which has been discontinued.
2517 * theory Finite_Set: in structured induction proofs, the insert case
2518 is now 'case (insert x F)' instead of the old counterintuitive 'case
2521 * The 'refute' command has been extended to support a much larger
2522 fragment of HOL, including axiomatic type classes, constdefs and
2523 typedefs, inductive datatypes and recursion.
2525 * New tactics 'sat' and 'satx' to prove propositional tautologies.
2526 Requires zChaff with proof generation to be installed. See
2527 HOL/ex/SAT_Examples.thy for examples.
2529 * Datatype induction via method 'induct' now preserves the name of the
2530 induction variable. For example, when proving P(xs::'a list) by
2531 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
2532 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
2533 in unstructured proof scripts.
2535 * Reworked implementation of records. Improved scalability for
2536 records with many fields, avoiding performance problems for type
2537 inference. Records are no longer composed of nested field types, but
2538 of nested extension types. Therefore the record type only grows linear
2539 in the number of extensions and not in the number of fields. The
2540 top-level (users) view on records is preserved. Potential
2541 INCOMPATIBILITY only in strange cases, where the theory depends on the
2542 old record representation. The type generated for a record is called
2543 <record_name>_ext_type.
2545 Flag record_quick_and_dirty_sensitive can be enabled to skip the
2546 proofs triggered by a record definition or a simproc (if
2547 quick_and_dirty is enabled). Definitions of large records can take
2550 New simproc record_upd_simproc for simplification of multiple record
2551 updates enabled by default. Moreover, trivial updates are also
2552 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
2553 occasionally, since simplification is more powerful by default.
2555 * typedef: proper support for polymorphic sets, which contain extra
2556 type-variables in the term.
2558 * Simplifier: automatically reasons about transitivity chains
2559 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
2560 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
2561 old proofs break occasionally as simplification may now solve more
2562 goals than previously.
2564 * Simplifier: converts x <= y into x = y if assumption y <= x is
2565 present. Works for all partial orders (class "order"), in particular
2566 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
2569 * Simplifier: new simproc for "let x = a in f x". If a is a free or
2570 bound variable or a constant then the let is unfolded. Otherwise
2571 first a is simplified to b, and then f b is simplified to g. If
2572 possible we abstract b from g arriving at "let x = b in h x",
2573 otherwise we unfold the let and arrive at g. The simproc can be
2574 enabled/disabled by the reference use_let_simproc. Potential
2575 INCOMPATIBILITY since simplification is more powerful by default.
2577 * Classical reasoning: the meson method now accepts theorems as arguments.
2579 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
2580 jobs to provide advice on the provability of subgoals.
2582 * Theory OrderedGroup and Ring_and_Field: various additions and
2583 improvements to faciliate calculations involving equalities and
2586 The following theorems have been eliminated or modified
2589 abs_eq now named abs_of_nonneg
2590 abs_of_ge_0 now named abs_of_nonneg
2591 abs_minus_eq now named abs_of_nonpos
2592 imp_abs_id now named abs_of_nonneg
2593 imp_abs_neg_id now named abs_of_nonpos
2594 mult_pos now named mult_pos_pos
2595 mult_pos_le now named mult_nonneg_nonneg
2596 mult_pos_neg_le now named mult_nonneg_nonpos
2597 mult_pos_neg2_le now named mult_nonneg_nonpos2
2598 mult_neg now named mult_neg_neg
2599 mult_neg_le now named mult_nonpos_nonpos
2601 * The following lemmas in Ring_and_Field have been added to the simplifier:
2604 not_square_less_zero
2606 The following lemmas have been deleted from Real/RealPow:
2616 * Theory Parity: added rules for simplifying exponents.
2620 The following theorems have been eliminated or modified
2623 list_all_Nil now named list_all.simps(1)
2624 list_all_Cons now named list_all.simps(2)
2625 list_all_conv now named list_all_iff
2626 set_mem_eq now named mem_iff
2628 * Theories SetsAndFunctions and BigO (see HOL/Library) support
2629 asymptotic "big O" calculations. See the notes in BigO.thy.
2634 * Theory RealDef: better support for embedding natural numbers and
2635 integers in the reals.
2637 The following theorems have been eliminated or modified
2640 exp_ge_add_one_self now requires no hypotheses
2641 real_of_int_add reversed direction of equality (use [symmetric])
2642 real_of_int_minus reversed direction of equality (use [symmetric])
2643 real_of_int_diff reversed direction of equality (use [symmetric])
2644 real_of_int_mult reversed direction of equality (use [symmetric])
2646 * Theory RComplete: expanded support for floor and ceiling functions.
2648 * Theory Ln is new, with properties of the natural logarithm
2650 * Hyperreal: There is a new type constructor "star" for making
2651 nonstandard types. The old type names are now type synonyms:
2655 hcomplex = complex star
2657 * Hyperreal: Many groups of similarly-defined constants have been
2658 replaced by polymorphic versions (INCOMPATIBILITY):
2660 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
2662 starset <-- starsetNat, starsetC
2663 *s* <-- *sNat*, *sc*
2664 starset_n <-- starsetNat_n, starsetC_n
2665 *sn* <-- *sNatn*, *scn*
2666 InternalSets <-- InternalNatSets, InternalCSets
2668 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2669 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
2670 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
2671 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
2672 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
2674 * Hyperreal: Many type-specific theorems have been removed in favor of
2675 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
2677 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
2678 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
2679 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
2680 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
2681 right_minus <-- hypreal_add_minus
2682 left_minus <-- {hypreal,hcomplex}_add_minus_left
2683 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
2684 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
2685 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
2686 mult_1_right <-- hcomplex_mult_one_right
2687 mult_zero_left <-- hcomplex_mult_zero_left
2688 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
2689 right_distrib <-- hypnat_add_mult_distrib2
2690 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
2691 right_inverse <-- hypreal_mult_inverse
2692 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
2693 order_refl <-- {hypreal,hypnat}_le_refl
2694 order_trans <-- {hypreal,hypnat}_le_trans
2695 order_antisym <-- {hypreal,hypnat}_le_anti_sym
2696 order_less_le <-- {hypreal,hypnat}_less_le
2697 linorder_linear <-- {hypreal,hypnat}_le_linear
2698 add_left_mono <-- {hypreal,hypnat}_add_left_mono
2699 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
2700 add_nonneg_nonneg <-- hypreal_le_add_order
2702 * Hyperreal: Separate theorems having to do with type-specific
2703 versions of constants have been merged into theorems that apply to the
2704 new polymorphic constants (INCOMPATIBILITY):
2706 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
2707 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
2708 STAR_Un <-- {STAR,NatStar,STARC}_Un
2709 STAR_Int <-- {STAR,NatStar,STARC}_Int
2710 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
2711 STAR_subset <-- {STAR,NatStar,STARC}_subset
2712 STAR_mem <-- {STAR,NatStar,STARC}_mem
2713 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
2714 STAR_diff <-- {STAR,STARC}_diff
2715 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
2716 STARC_hcomplex_of_complex}_image_subset
2717 starset_n_Un <-- starset{Nat,C}_n_Un
2718 starset_n_Int <-- starset{Nat,C}_n_Int
2719 starset_n_Compl <-- starset{Nat,C}_n_Compl
2720 starset_n_diff <-- starset{Nat,C}_n_diff
2721 InternalSets_Un <-- Internal{Nat,C}Sets_Un
2722 InternalSets_Int <-- Internal{Nat,C}Sets_Int
2723 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
2724 InternalSets_diff <-- Internal{Nat,C}Sets_diff
2725 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
2726 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
2727 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
2728 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
2729 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
2730 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2731 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
2732 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
2733 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
2734 starfun_diff <-- starfun{C,RC,CR}_diff
2735 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
2736 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
2737 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
2738 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
2739 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
2740 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
2741 starfun_Id <-- starfunC_Id
2742 starfun_approx <-- starfun{Nat,CR}_approx
2743 starfun_capprox <-- starfun{C,RC}_capprox
2744 starfun_abs <-- starfunNat_rabs
2745 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
2746 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
2747 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
2748 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
2749 starfun_add_capprox <-- starfun{C,RC}_add_capprox
2750 starfun_add_approx <-- starfunCR_add_approx
2751 starfun_inverse_inverse <-- starfunC_inverse_inverse
2752 starfun_divide <-- starfun{C,CR,RC}_divide
2753 starfun_n <-- starfun{Nat,C}_n
2754 starfun_n_mult <-- starfun{Nat,C}_n_mult
2755 starfun_n_add <-- starfun{Nat,C}_n_add
2756 starfun_n_add_minus <-- starfunNat_n_add_minus
2757 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
2758 starfun_n_minus <-- starfun{Nat,C}_n_minus
2759 starfun_n_eq <-- starfun{Nat,C}_n_eq
2761 star_n_add <-- {hypreal,hypnat,hcomplex}_add
2762 star_n_minus <-- {hypreal,hcomplex}_minus
2763 star_n_diff <-- {hypreal,hcomplex}_diff
2764 star_n_mult <-- {hypreal,hcomplex}_mult
2765 star_n_inverse <-- {hypreal,hcomplex}_inverse
2766 star_n_le <-- {hypreal,hypnat}_le
2767 star_n_less <-- {hypreal,hypnat}_less
2768 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
2769 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
2770 star_n_abs <-- hypreal_hrabs
2771 star_n_divide <-- hcomplex_divide
2773 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
2774 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
2775 star_of_diff <-- hypreal_of_real_diff
2776 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
2777 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
2778 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
2779 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
2780 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
2781 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
2782 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
2783 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
2784 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
2785 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
2786 star_of_number_of <-- {hypreal,hcomplex}_number_of
2787 star_of_number_less <-- number_of_less_hypreal_of_real_iff
2788 star_of_number_le <-- number_of_le_hypreal_of_real_iff
2789 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
2790 star_of_less_number <-- hypreal_of_real_less_number_of_iff
2791 star_of_le_number <-- hypreal_of_real_le_number_of_iff
2792 star_of_power <-- hypreal_of_real_power
2793 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
2795 * Hyperreal: new method "transfer" that implements the transfer
2796 principle of nonstandard analysis. With a subgoal that mentions
2797 nonstandard types like "'a star", the command "apply transfer"
2798 replaces it with an equivalent one that mentions only standard types.
2799 To be successful, all free variables must have standard types; non-
2800 standard variables must have explicit universal quantifiers.
2802 * Hyperreal: A theory of Taylor series.
2807 * Discontinued special version of 'constdefs' (which used to support
2808 continuous functions) in favor of the general Pure one with full
2811 * New simplification procedure for solving continuity conditions; it
2812 is much faster on terms with many nested lambda abstractions (cubic
2813 instead of exponential time).
2815 * New syntax for domain package: selector names are now optional.
2816 Parentheses should be omitted unless argument is lazy, for example:
2818 domain 'a stream = cons "'a" (lazy "'a stream")
2820 * New command 'fixrec' for defining recursive functions with pattern
2821 matching; defining multiple functions with mutual recursion is also
2822 supported. Patterns may include the constants cpair, spair, up, sinl,
2823 sinr, or any data constructor defined by the domain package. The given
2824 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
2825 syntax and examples.
2827 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
2828 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
2829 but the proof obligation additionally includes an admissibility
2830 requirement. The packages generate instances of class cpo or pcpo,
2831 with continuity and strictness theorems for Rep and Abs.
2833 * HOLCF: Many theorems have been renamed according to a more standard naming
2834 scheme (INCOMPATIBILITY):
2836 foo_inject: "foo$x = foo$y ==> x = y"
2837 foo_eq: "(foo$x = foo$y) = (x = y)"
2838 foo_less: "(foo$x << foo$y) = (x << y)"
2839 foo_strict: "foo$UU = UU"
2840 foo_defined: "... ==> foo$x ~= UU"
2841 foo_defined_iff: "(foo$x = UU) = (x = UU)"
2846 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
2847 including the First Isomorphism Theorem (on quotienting by the kernel
2850 * ZF/Simplifier: install second copy of type solver that actually
2851 makes use of TC rules declared to Isar proof contexts (or locales);
2852 the old version is still required for ML proof scripts.
2857 * Converted to Isar theory format; use locales instead of axiomatic
2863 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
2866 * Pure/library.ML no longer defines its own option datatype, but uses
2867 that of the SML basis, which has constructors NONE and SOME instead of
2868 None and Some, as well as exception Option.Option instead of OPTION.
2869 The functions the, if_none, is_some, is_none have been adapted
2870 accordingly, while Option.map replaces apsome.
2872 * Pure/library.ML: the exception LIST has been given up in favour of
2873 the standard exceptions Empty and Subscript, as well as
2874 Library.UnequalLengths. Function like Library.hd and Library.tl are
2875 superceded by the standard hd and tl functions etc.
2877 A number of basic list functions are no longer exported to the ML
2878 toplevel, as they are variants of predefined functions. The following
2879 suggests how one can translate existing code:
2881 rev_append xs ys = List.revAppend (xs, ys)
2882 nth_elem (i, xs) = List.nth (xs, i)
2883 last_elem xs = List.last xs
2884 flat xss = List.concat xss
2885 seq fs = List.app fs
2886 partition P xs = List.partition P xs
2887 mapfilter f xs = List.mapPartial f xs
2889 * Pure/library.ML: several combinators for linear functional
2890 transformations, notably reverse application and composition:
2893 (x, y) |-> f f #-> g
2895 * Pure/library.ML: introduced/changed precedence of infix operators:
2897 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
2899 infix 3 o oo ooo oooo;
2900 infix 4 ~~ upto downto;
2902 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
2905 * Pure/library.ML: natural list combinators fold, fold_rev, and
2906 fold_map support linear functional transformations and nesting. For
2909 fold f [x1, ..., xN] y =
2910 y |> f x1 |> ... |> f xN
2912 (fold o fold) f [xs1, ..., xsN] y =
2913 y |> fold f xs1 |> ... |> fold f xsN
2915 fold f [x1, ..., xN] =
2918 (fold o fold) f [xs1, ..., xsN] =
2919 fold f xs1 #> ... #> fold f xsN
2921 * Pure/library.ML: the following selectors on type 'a option are
2924 the: 'a option -> 'a (*partial*)
2925 these: 'a option -> 'a where 'a = 'b list
2926 the_default: 'a -> 'a option -> 'a
2927 the_list: 'a option -> 'a list
2929 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2930 basic operations for association lists, following natural argument
2931 order; moreover the explicit equality predicate passed here avoids
2932 potentially expensive polymorphic runtime equality checks.
2933 The old functions may be expressed as follows:
2935 assoc = uncurry (AList.lookup (op =))
2936 assocs = these oo AList.lookup (op =)
2937 overwrite = uncurry (AList.update (op =)) o swap
2939 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2941 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
2942 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
2944 replacing make_keylist and keyfilter (occassionally used)
2947 make_keylist = AList.make
2948 keyfilter = AList.find (op =)
2950 * eq_fst and eq_snd now take explicit equality parameter, thus
2951 avoiding eqtypes. Naive rewrites:
2953 eq_fst = eq_fst (op =)
2954 eq_snd = eq_snd (op =)
2956 * Removed deprecated apl and apr (rarely used).
2959 apl (n, op) =>>= curry op n
2960 apr (op, m) =>>= fn n => op (n, m)
2962 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
2963 provides a reasonably efficient light-weight implementation of sets as
2966 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
2967 few new operations; existing lookup and update are now curried to
2968 follow natural argument order (for use with fold etc.);
2969 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
2971 * Pure/General: output via the Isabelle channels of
2972 writeln/warning/error etc. is now passed through Output.output, with a
2973 hook for arbitrary transformations depending on the print_mode
2974 (cf. Output.add_mode -- the first active mode that provides a output
2975 function wins). Already formatted output may be embedded into further
2976 text via Output.raw; the result of Pretty.string_of/str_of and derived
2977 functions (string_of_term/cterm/thm etc.) is already marked raw to
2978 accommodate easy composition of diagnostic messages etc. Programmers
2979 rarely need to care about Output.output or Output.raw at all, with
2980 some notable exceptions: Output.output is required when bypassing the
2981 standard channels (writeln etc.), or in token translations to produce
2982 properly formatted results; Output.raw is required when capturing
2983 already output material that will eventually be presented to the user
2984 a second time. For the default print mode, both Output.output and
2985 Output.raw have no effect.
2987 * Pure/General: Output.time_accumulator NAME creates an operator ('a
2988 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
2989 cumulative results are displayed at the end of a batch session.
2991 * Pure/General: File.sysify_path and File.quote_sysify path have been
2992 replaced by File.platform_path and File.shell_path (with appropriate
2993 hooks). This provides a clean interface for unusual systems where the
2994 internal and external process view of file names are different.
2996 * Pure: more efficient orders for basic syntactic entities: added
2997 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
2998 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
2999 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
3000 orders now -- potential INCOMPATIBILITY for code that depends on a
3001 particular order for Symtab.keys, Symtab.dest, etc. (consider using
3002 Library.sort_strings on result).
3004 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
3005 fold_types traverse types/terms from left to right, observing natural
3006 argument order. Supercedes previous foldl_XXX versions, add_frees,
3007 add_vars etc. have been adapted as well: INCOMPATIBILITY.
3009 * Pure: name spaces have been refined, with significant changes of the
3010 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
3011 to extern(_table). The plain name entry path is superceded by a
3012 general 'naming' context, which also includes the 'policy' to produce
3013 a fully qualified name and external accesses of a fully qualified
3014 name; NameSpace.extend is superceded by context dependent
3015 Sign.declare_name. Several theory and proof context operations modify
3016 the naming context. Especially note Theory.restore_naming and
3017 ProofContext.restore_naming to get back to a sane state; note that
3018 Theory.add_path is no longer sufficient to recover from
3019 Theory.absolute_path in particular.
3021 * Pure: new flags short_names (default false) and unique_names
3022 (default true) for controlling output of qualified names. If
3023 short_names is set, names are printed unqualified. If unique_names is
3024 reset, the name prefix is reduced to the minimum required to achieve
3025 the original result when interning again, even if there is an overlap
3026 with earlier declarations.
3028 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
3029 now 'extend', and 'merge' gets an additional Pretty.pp argument
3030 (useful for printing error messages). INCOMPATIBILITY.
3032 * Pure: major reorganization of the theory context. Type Sign.sg and
3033 Theory.theory are now identified, referring to the universal
3034 Context.theory (see Pure/context.ML). Actual signature and theory
3035 content is managed as theory data. The old code and interfaces were
3036 spread over many files and structures; the new arrangement introduces
3037 considerable INCOMPATIBILITY to gain more clarity:
3039 Context -- theory management operations (name, identity, inclusion,
3040 parents, ancestors, merge, etc.), plus generic theory data;
3042 Sign -- logical signature and syntax operations (declaring consts,
3043 types, etc.), plus certify/read for common entities;
3045 Theory -- logical theory operations (stating axioms, definitions,
3046 oracles), plus a copy of logical signature operations (consts,
3047 types, etc.); also a few basic management operations (Theory.copy,
3050 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
3051 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
3052 for convenience -- they merely return the theory.
3054 * Pure: type Type.tsig is superceded by theory in most interfaces.
3056 * Pure: the Isar proof context type is already defined early in Pure
3057 as Context.proof (note that ProofContext.context and Proof.context are
3058 aliases, where the latter is the preferred name). This enables other
3059 Isabelle components to refer to that type even before Isar is present.
3061 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
3062 typeK, constK, axiomK, oracleK), but provide explicit operations for
3063 any of these kinds. For example, Sign.intern typeK is now
3064 Sign.intern_type, Theory.hide_space Sign.typeK is now
3065 Theory.hide_types. Also note that former
3066 Theory.hide_classes/types/consts are now
3067 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
3068 internalize their arguments! INCOMPATIBILITY.
3070 * Pure: get_thm interface (of PureThy and ProofContext) expects
3071 datatype thmref (with constructors Name and NameSelection) instead of
3072 plain string -- INCOMPATIBILITY;
3074 * Pure: cases produced by proof methods specify options, where NONE
3075 means to remove case bindings -- INCOMPATIBILITY in
3078 * Pure: the following operations retrieve axioms or theorems from a
3079 theory node or theory hierarchy, respectively:
3081 Theory.axioms_of: theory -> (string * term) list
3082 Theory.all_axioms_of: theory -> (string * term) list
3083 PureThy.thms_of: theory -> (string * thm) list
3084 PureThy.all_thms_of: theory -> (string * thm) list
3086 * Pure: print_tac now outputs the goal through the trace channel.
3088 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
3089 Reference Toplevel.debug (default false) controls detailed printing
3090 and tracing of low-level exceptions; Toplevel.profiling (default 0)
3091 controls execution profiling -- set to 1 for time and 2 for space
3092 (both increase the runtime).
3094 * Isar session: The initial use of ROOT.ML is now always timed,
3095 i.e. the log will show the actual process times, in contrast to the
3096 elapsed wall-clock time that the outer shell wrapper produces.
3098 * Simplifier: improved handling of bound variables (nameless
3099 representation, avoid allocating new strings). Simprocs that invoke
3100 the Simplifier recursively should use Simplifier.inherit_bounds to
3101 avoid local name clashes. Failure to do so produces warnings
3102 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
3103 for further details.
3105 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
3106 bindings for all theorems stored within a given theory; this may help
3107 in porting non-Isar theories to Isar ones, while keeping ML proof
3108 scripts for the time being.
3110 * ML operator HTML.with_charset specifies the charset begin used for
3111 generated HTML files. For example:
3113 HTML.with_charset "utf-8" use_thy "Hebrew";
3114 HTML.with_charset "utf-8" use_thy "Chinese";
3119 * Allow symlinks to all proper Isabelle executables (Isabelle,
3120 isabelle, isatool etc.).
3122 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
3123 isatool doc, isatool mkdir, display_drafts etc.).
3125 * isatool usedir: option -f allows specification of the ML file to be
3126 used by Isabelle; default is ROOT.ML.
3128 * New isatool version outputs the version identifier of the Isabelle
3129 distribution being used.
3131 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
3132 (containing Boolean satisfiability problems) into Isabelle/HOL
3137 New in Isabelle2004 (April 2004)
3138 --------------------------------
3142 * Provers/order.ML: new efficient reasoner for partial and linear orders.
3143 Replaces linorder.ML.
3145 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
3146 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
3147 (\<a>...\<z>), are now considered normal letters, and can therefore
3148 be used anywhere where an ASCII letter (a...zA...Z) has until
3149 now. COMPATIBILITY: This obviously changes the parsing of some
3150 terms, especially where a symbol has been used as a binder, say
3151 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
3152 as an identifier. Fix it by inserting a space around former
3153 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
3154 existing theory and ML files.
3156 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
3158 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
3159 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
3160 a normal (but invisible) letter. For multiple letter subscripts repeat
3161 \<^isub> like this: x\<^isub>1\<^isub>2.
3163 * Pure: There are now sub-/superscripts that can span more than one
3164 character. Text between \<^bsub> and \<^esub> is set in subscript in
3165 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
3166 superscript. The new control characters are not identifier parts.
3168 * Pure: Control-symbols of the form \<^raw:...> will literally print the
3169 content of "..." to the latex file instead of \isacntrl... . The "..."
3170 may consist of any printable characters excluding the end bracket >.
3172 * Pure: Using new Isar command "finalconsts" (or the ML functions
3173 Theory.add_finals or Theory.add_finals_i) it is now possible to
3174 declare constants "final", which prevents their being given a definition
3175 later. It is useful for constants whose behaviour is fixed axiomatically
3176 rather than definitionally, such as the meta-logic connectives.
3178 * Pure: 'instance' now handles general arities with general sorts
3179 (i.e. intersections of classes),
3181 * Presentation: generated HTML now uses a CSS style sheet to make layout
3182 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
3183 It can be changed to alter the colors/layout of generated pages.
3188 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
3189 cut_tac, subgoal_tac and thin_tac:
3190 - Now understand static (Isar) contexts. As a consequence, users of Isar
3191 locales are no longer forced to write Isar proof scripts.
3192 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
3194 - INCOMPATIBILITY: names of variables to be instantiated may no
3195 longer be enclosed in quotes. Instead, precede variable name with `?'.
3196 This is consistent with the instantiation attribute "where".
3198 * Attributes "where" and "of":
3199 - Now take type variables of instantiated theorem into account when reading
3200 the instantiation string. This fixes a bug that caused instantiated
3201 theorems to have too special types in some circumstances.
3202 - "where" permits explicit instantiations of type variables.
3204 * Calculation commands "moreover" and "also" no longer interfere with
3205 current facts ("this"), admitting arbitrary combinations with "then"
3209 - Goal statements involving the context element "includes" no longer
3210 generate theorems with internal delta predicates (those ending on
3211 "_axioms") in the premise.
3212 Resolve particular premise with <locale>.intro to obtain old form.
3213 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
3214 specification and "includes" elements in goal statement.
3215 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
3216 [intro?] and [elim?] (respectively) by default.
3217 - Experimental command for instantiation of locales in proof contexts:
3218 instantiate <label>[<attrs>]: <loc>
3219 Instantiates locale <loc> and adds all its theorems to the current context
3220 taking into account their attributes. Label and attrs are optional
3221 modifiers, like in theorem declarations. If present, names of
3222 instantiated theorems are qualified with <label>, and the attributes
3223 <attrs> are applied after any attributes these theorems might have already.
3224 If the locale has assumptions, a chained fact of the form
3225 "<loc> t1 ... tn" is expected from which instantiations of the parameters
3226 are derived. The command does not support old-style locales declared
3227 with "locale (open)".
3228 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
3230 * HOL: Tactic emulation methods induct_tac and case_tac understand static
3236 * Proof import: new image HOL4 contains the imported library from
3237 the HOL4 system with about 2500 theorems. It is imported by
3238 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
3239 can be used like any other Isabelle image. See
3240 HOL/Import/HOL/README for more information.
3243 - Much improved handling of linear and partial orders.
3244 Reasoners for linear and partial orders are set up for type classes
3245 "linorder" and "order" respectively, and are added to the default simpset
3246 as solvers. This means that the simplifier can build transitivity chains
3247 to solve goals from the assumptions.
3248 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
3249 of blast or auto after simplification become unnecessary because the goal
3250 is solved by simplification already.
3252 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
3253 all proved in axiomatic type classes for semirings, rings and fields.
3256 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
3257 now formalized using the Ring_and_Field theory mentioned above.
3258 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
3259 than before, because now they are set up once in a generic manner.
3260 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
3261 Look for the general versions in Ring_and_Field (and Power if they concern
3264 * Type "rat" of the rational numbers is now available in HOL-Complex.
3267 - Record types are now by default printed with their type abbreviation
3268 instead of the list of all field types. This can be configured via
3269 the reference "print_record_type_abbr".
3270 - Simproc "record_upd_simproc" for simplification of multiple updates added
3271 (not enabled by default).
3272 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
3273 EX x. x = sel r to True (not enabled by default).
3274 - Tactic "record_split_simp_tac" to split and simplify records added.
3276 * 'specification' command added, allowing for definition by
3277 specification. There is also an 'ax_specification' command that
3278 introduces the new constants axiomatically.
3280 * arith(_tac) is now able to generate counterexamples for reals as well.
3282 * HOL-Algebra: new locale "ring" for non-commutative rings.
3284 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
3285 definitions, thanks to Sava Krsti\'{c} and John Matthews.
3287 * HOL-Matrix: a first theory for matrices in HOL with an application of
3288 matrix theory to linear programming.
3290 * Unions and Intersections:
3291 The latex output syntax of UN and INT has been changed
3292 from "\Union x \in A. B" to "\Union_{x \in A} B"
3293 i.e. the index formulae has become a subscript.
3294 Similarly for "\Union x. B", and for \Inter instead of \Union.
3296 * Unions and Intersections over Intervals:
3297 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
3298 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
3299 like in normal math, and corresponding versions for < and for intersection.
3301 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
3302 lexicographic dictonary ordering has been added as "lexord".
3304 * ML: the legacy theory structures Int and List have been removed. They had
3305 conflicted with ML Basis Library structures having the same names.
3307 * 'refute' command added to search for (finite) countermodels. Only works
3308 for a fragment of HOL. The installation of an external SAT solver is
3309 highly recommended. See "HOL/Refute.thy" for details.
3311 * 'quickcheck' command: Allows to find counterexamples by evaluating
3312 formulae under an assignment of free variables to random values.
3313 In contrast to 'refute', it can deal with inductive datatypes,
3314 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
3320 * Streams now come with concatenation and are part of the HOLCF image
3324 New in Isabelle2003 (May 2003)
3325 ------------------------------
3329 * Provers/simplifier:
3331 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
3332 Assumptions are now subject to complete mutual simplification,
3333 not just from left to right. The simplifier now preserves
3334 the order of assumptions.
3336 Potential INCOMPATIBILITY:
3338 -- simp sometimes diverges where the old version did
3339 not, e.g. invoking simp on the goal
3341 [| P (f x); y = x; f x = f y |] ==> Q
3343 now gives rise to the infinite reduction sequence
3345 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
3347 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
3350 -- Tactics combining classical reasoner and simplification (such as auto)
3351 are also affected by this change, because many of them rely on
3352 simp. They may sometimes diverge as well or yield a different numbers
3353 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
3354 in case of problems. Sometimes subsequent calls to the classical
3355 reasoner will fail because a preceeding call to the simplifier too
3356 eagerly simplified the goal, e.g. deleted redundant premises.
3358 - The simplifier trace now shows the names of the applied rewrite rules
3360 - You can limit the number of recursive invocations of the simplifier
3361 during conditional rewriting (where the simplifie tries to solve the
3362 conditions before applying the rewrite rule):
3363 ML "simp_depth_limit := n"
3364 where n is an integer. Thus you can force termination where previously
3365 the simplifier would diverge.
3367 - Accepts free variables as head terms in congruence rules. Useful in Isar.
3369 - No longer aborts on failed congruence proof. Instead, the
3370 congruence is ignored.
3372 * Pure: New generic framework for extracting programs from constructive
3373 proofs. See HOL/Extraction.thy for an example instantiation, as well
3374 as HOL/Extraction for some case studies.
3376 * Pure: The main goal of the proof state is no longer shown by default, only
3377 the subgoals. This behaviour is controlled by a new flag.
3378 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
3379 (ML: Proof.show_main_goal).
3381 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
3382 rules whose conclusion matches subgoal 1:
3383 PG menu: Isabelle/Isar -> Show me -> matching rules
3384 The rules are ordered by how closely they match the subgoal.
3385 In particular, rules that solve a subgoal outright are displayed first
3386 (or rather last, the way they are printed).
3387 (ML: ProofGeneral.print_intros())
3389 * Pure: New flag trace_unify_fail causes unification to print
3390 diagnostic information (PG: in trace buffer) when it fails. This is
3391 useful for figuring out why single step proofs like rule, erule or
3394 * Pure: Locale specifications now produce predicate definitions
3395 according to the body of text (covering assumptions modulo local
3396 definitions); predicate "loc_axioms" covers newly introduced text,
3397 while "loc" is cumulative wrt. all included locale expressions; the
3398 latter view is presented only on export into the global theory
3399 context; potential INCOMPATIBILITY, use "(open)" option to fall back
3400 on the old view without predicates;
3402 * Pure: predefined locales "var" and "struct" are useful for sharing
3403 parameters (as in CASL, for example); just specify something like
3404 ``var x + var y + struct M'' as import;
3406 * Pure: improved thms_containing: proper indexing of facts instead of
3407 raw theorems; check validity of results wrt. current name space;
3408 include local facts of proof configuration (also covers active
3409 locales), cover fixed variables in index; may use "_" in term
3410 specification; an optional limit for the number of printed facts may
3411 be given (the default is 40);
3413 * Pure: disallow duplicate fact bindings within new-style theory files
3416 * Provers: improved induct method: assumptions introduced by case
3417 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
3418 the goal statement); "foo" still refers to all facts collectively;
3420 * Provers: the function blast.overloaded has been removed: all constants
3421 are regarded as potentially overloaded, which improves robustness in exchange
3422 for slight decrease in efficiency;
3424 * Provers/linorder: New generic prover for transitivity reasoning over
3425 linear orders. Note: this prover is not efficient!
3427 * Isar: preview of problems to finish 'show' now produce an error
3428 rather than just a warning (in interactive mode);
3435 - Produces a counter example if it cannot prove a goal.
3436 Note that the counter example may be spurious if the goal is not a formula
3437 of quantifier-free linear arithmetic.
3438 In ProofGeneral the counter example appears in the trace buffer.
3440 - Knows about div k and mod k where k is a numeral of type nat or int.
3442 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
3443 linear arithmetic fails. This takes account of quantifiers and divisibility.
3444 Presburger arithmetic can also be called explicitly via presburger(_tac).
3446 * simp's arithmetic capabilities have been enhanced a bit: it now
3447 takes ~= in premises into account (by performing a case split);
3449 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
3450 are distributed over a sum of terms;
3452 * New tactic "trans_tac" and method "trans" instantiate
3453 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
3456 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
3457 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
3459 * 'typedef' command has new option "open" to suppress the set
3462 * functions Min and Max on finite sets have been introduced (theory
3465 * attribute [symmetric] now works for relations as well; it turns
3466 (x,y) : R^-1 into (y,x) : R, and vice versa;
3468 * induct over a !!-quantified statement (say !!x1..xn):
3469 each "case" automatically performs "fix x1 .. xn" with exactly those names.
3471 * Map: `empty' is no longer a constant but a syntactic abbreviation for
3472 %x. None. Warning: empty_def now refers to the previously hidden definition
3475 * Algebra: formalization of classical algebra. Intended as base for
3476 any algebraic development in Isabelle. Currently covers group theory
3477 (up to Sylow's theorem) and ring theory (Universal Property of
3478 Univariate Polynomials). Contributions welcome;
3480 * GroupTheory: deleted, since its material has been moved to Algebra;
3482 * Complex: new directory of the complex numbers with numeric constants,
3483 nonstandard complex numbers, and some complex analysis, standard and
3484 nonstandard (Jacques Fleuriot);
3486 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
3488 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
3491 * Real/HahnBanach: updated and adapted to locales;
3493 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
3496 * UNITY: added the Meier-Sanders theory of progress sets;
3498 * MicroJava: bytecode verifier and lightweight bytecode verifier
3499 as abstract algorithms, instantiated to the JVM;
3501 * Bali: Java source language formalization. Type system, operational
3502 semantics, axiomatic semantics. Supported language features:
3503 classes, interfaces, objects,virtual methods, static methods,
3504 static/instance fields, arrays, access modifiers, definite
3505 assignment, exceptions.
3510 * ZF/Constructible: consistency proof for AC (Gdel's constructible
3513 * Main ZF: virtually all theories converted to new-style format;
3518 * Pure: Tactic.prove provides sane interface for internal proofs;
3519 omits the infamous "standard" operation, so this is more appropriate
3520 than prove_goalw_cterm in many situations (e.g. in simprocs);
3522 * Pure: improved error reporting of simprocs;
3524 * Provers: Simplifier.simproc(_i) provides sane interface for setting
3528 *** Document preparation ***
3530 * uses \par instead of \\ for line breaks in theory text. This may
3531 shift some page breaks in large documents. To get the old behaviour
3532 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
3534 * minimized dependencies of isabelle.sty and isabellesym.sty on
3537 * \<euro> now needs package babel/greek instead of marvosym (which
3540 * normal size for \<zero>...\<nine> (uses \mathbf instead of
3545 New in Isabelle2002 (March 2002)
3546 --------------------------------
3548 *** Document preparation ***
3550 * greatly simplified document preparation setup, including more
3551 graceful interpretation of isatool usedir -i/-d/-D options, and more
3552 instructive isatool mkdir; users should basically be able to get
3553 started with "isatool mkdir HOL Test && isatool make"; alternatively,
3554 users may run a separate document processing stage manually like this:
3555 "isatool usedir -D output HOL Test && isatool document Test/output";
3557 * theory dependency graph may now be incorporated into documents;
3558 isatool usedir -g true will produce session_graph.eps/.pdf for use
3559 with \includegraphics of LaTeX;
3561 * proper spacing of consecutive markup elements, especially text
3562 blocks after section headings;
3564 * support bold style (for single symbols only), input syntax is like
3565 this: "\<^bold>\<alpha>" or "\<^bold>A";
3567 * \<bullet> is now output as bold \cdot by default, which looks much
3568 better in printed text;
3570 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
3571 note that these symbols are currently unavailable in Proof General /
3572 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
3574 * isatool latex no longer depends on changed TEXINPUTS, instead
3575 isatool document copies the Isabelle style files to the target
3581 * Pure/Provers: improved proof by cases and induction;
3582 - 'case' command admits impromptu naming of parameters (such as
3584 - 'induct' method divinates rule instantiation from the inductive
3585 claim; no longer requires excessive ?P bindings for proper
3586 instantiation of cases;
3587 - 'induct' method properly enumerates all possibilities of set/type
3588 rules; as a consequence facts may be also passed through *type*
3589 rules without further ado;
3590 - 'induct' method now derives symbolic cases from the *rulified*
3591 rule (before it used to rulify cases stemming from the internal
3592 atomized version); this means that the context of a non-atomic
3593 statement becomes is included in the hypothesis, avoiding the
3594 slightly cumbersome show "PROP ?case" form;
3595 - 'induct' may now use elim-style induction rules without chaining
3596 facts, using ``missing'' premises from the goal state; this allows
3597 rules stemming from inductive sets to be applied in unstructured
3598 scripts, while still benefitting from proper handling of non-atomic
3599 statements; NB: major inductive premises need to be put first, all
3600 the rest of the goal is passed through the induction;
3601 - 'induct' proper support for mutual induction involving non-atomic
3602 rule statements (uses the new concept of simultaneous goals, see
3604 - append all possible rule selections, but only use the first
3605 success (no backtracking);
3606 - removed obsolete "(simplified)" and "(stripped)" options of methods;
3607 - undeclared rule case names default to numbers 1, 2, 3, ...;
3608 - added 'print_induct_rules' (covered by help item in recent Proof
3610 - moved induct/cases attributes to Pure, methods to Provers;
3611 - generic method setup instantiated for FOL and HOL;
3613 * Pure: support multiple simultaneous goal statements, for example
3614 "have a: A and b: B" (same for 'theorem' etc.); being a pure
3615 meta-level mechanism, this acts as if several individual goals had
3616 been stated separately; in particular common proof methods need to be
3617 repeated in order to cover all claims; note that a single elimination
3618 step is *not* sufficient to establish the two conjunctions, so this
3621 assume "A & B" then have A and B .. (*".." fails*)
3623 better use "obtain" in situations as above; alternative refer to
3624 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
3626 * Pure: proper integration with ``locales''; unlike the original
3627 version by Florian Kammller, Isar locales package high-level proof
3628 contexts rather than raw logical ones (e.g. we admit to include
3629 attributes everywhere); operations on locales include merge and
3630 rename; support for implicit arguments (``structures''); simultaneous
3631 type-inference over imports and text; see also HOL/ex/Locales.thy for
3634 * Pure: the following commands have been ``localized'', supporting a
3635 target locale specification "(in name)": 'lemma', 'theorem',
3636 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
3637 stored both within the locale and at the theory level (exported and
3638 qualified by the locale name);
3640 * Pure: theory goals may now be specified in ``long'' form, with
3641 ad-hoc contexts consisting of arbitrary locale elements. for example
3642 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
3643 definitions may be given, too); the result is a meta-level rule with
3644 the context elements being discharged in the obvious way;
3646 * Pure: new proof command 'using' allows to augment currently used
3647 facts after a goal statement ('using' is syntactically analogous to
3648 'apply', but acts on the goal's facts only); this allows chained facts
3649 to be separated into parts given before and after a claim, as in
3650 ``from a and b have C using d and e <proof>'';
3652 * Pure: renamed "antecedent" case to "rule_context";
3654 * Pure: new 'judgment' command records explicit information about the
3655 object-logic embedding (used by several tools internally); no longer
3656 use hard-wired "Trueprop";
3658 * Pure: added 'corollary' command;
3660 * Pure: fixed 'token_translation' command;
3662 * Pure: removed obsolete 'exported' attribute;
3664 * Pure: dummy pattern "_" in is/let is now automatically lifted over
3665 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
3666 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
3668 * Pure: method 'atomize' presents local goal premises as object-level
3669 statements (atomic meta-level propositions); setup controlled via
3670 rewrite rules declarations of 'atomize' attribute; example
3671 application: 'induct' method with proper rule statements in improper
3674 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
3675 now consider the syntactic context of assumptions, giving a better
3676 chance to get type-inference of the arguments right (this is
3677 especially important for locales);
3679 * Pure: "sorry" no longer requires quick_and_dirty in interactive
3682 * Pure/obtain: the formal conclusion "thesis", being marked as
3683 ``internal'', may no longer be reference directly in the text;
3684 potential INCOMPATIBILITY, may need to use "?thesis" in rare
3687 * Pure: generic 'sym' attribute which declares a rule both as pure
3688 'elim?' and for the 'symmetric' operation;
3690 * Pure: marginal comments ``--'' may now occur just anywhere in the
3691 text; the fixed correlation with particular command syntax has been
3694 * Pure: new method 'rules' is particularly well-suited for proof
3695 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
3696 but often produces more compact proof terms with less detours;
3698 * Pure/Provers/classical: simplified integration with pure rule
3699 attributes and methods; the classical "intro?/elim?/dest?"
3700 declarations coincide with the pure ones; the "rule" method no longer
3701 includes classically swapped intros; "intro" and "elim" methods no
3702 longer pick rules from the context; also got rid of ML declarations
3703 AddXIs/AddXEs/AddXDs; all of this has some potential for
3706 * Provers/classical: attribute 'swapped' produces classical inversions
3707 of introduction rules;
3709 * Provers/simplifier: 'simplified' attribute may refer to explicit
3710 rules instead of full simplifier context; 'iff' attribute handles
3713 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
3715 * HOL: 'recdef' now fails on unfinished automated proofs, use
3716 "(permissive)" option to recover old behavior;
3718 * HOL: 'inductive' no longer features separate (collective) attributes
3719 for 'intros' (was found too confusing);
3721 * HOL: properly declared induction rules less_induct and
3727 * HOL: moved over to sane numeral syntax; the new policy is as
3730 - 0 and 1 are polymorphic constants, which are defined on any
3731 numeric type (nat, int, real etc.);
3733 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
3734 binary representation internally;
3736 - type nat has special constructor Suc, and generally prefers Suc 0
3737 over 1::nat and Suc (Suc 0) over 2::nat;
3739 This change may cause significant problems of INCOMPATIBILITY; here
3740 are some hints on converting existing sources:
3742 - due to the new "num" token, "-0" and "-1" etc. are now atomic
3743 entities, so expressions involving "-" (unary or binary minus) need
3744 to be spaced properly;
3746 - existing occurrences of "1" may need to be constraint "1::nat" or
3747 even replaced by Suc 0; similar for old "2";
3749 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
3751 - remove all special provisions on numerals in proofs;
3753 * HOL: simp rules nat_number expand numerals on nat to Suc/0
3754 representation (depends on bin_arith_simps in the default context);
3756 * HOL: symbolic syntax for x^2 (numeral 2);
3758 * HOL: the class of all HOL types is now called "type" rather than
3759 "term"; INCOMPATIBILITY, need to adapt references to this type class
3760 in axclass/classes, instance/arities, and (usually rare) occurrences
3761 in typings (of consts etc.); internally the class is called
3762 "HOL.type", ML programs should refer to HOLogic.typeS;
3764 * HOL/record package improvements:
3765 - new derived operations "fields" to build a partial record section,
3766 "extend" to promote a fixed record to a record scheme, and
3767 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
3768 declared as simp by default;
3769 - shared operations ("more", "fields", etc.) now need to be always
3770 qualified) --- potential INCOMPATIBILITY;
3771 - removed "make_scheme" operations (use "make" with "extend") --
3773 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
3774 - provides cases/induct rules for use with corresponding Isar
3775 methods (for concrete records, record schemes, concrete more
3776 parts, and schematic more parts -- in that order);
3777 - internal definitions directly based on a light-weight abstract
3778 theory of product types over typedef rather than datatype;
3780 * HOL: generic code generator for generating executable ML code from
3781 specifications; specific support for HOL constructs such as inductive
3782 datatypes and sets, as well as recursive functions; can be invoked
3783 via 'generate_code' theory section;
3785 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
3787 * HOL: consolidated and renamed several theories. In particular:
3788 Ord.thy has been absorbed into HOL.thy
3789 String.thy has been absorbed into List.thy
3791 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
3792 (beware of argument permutation!);
3794 * HOL: linorder_less_split superseded by linorder_cases;
3796 * HOL/List: "nodups" renamed to "distinct";
3798 * HOL: added "The" definite description operator; move Hilbert's "Eps"
3799 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
3800 - Ex_def has changed, now need to use some_eq_ex
3802 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
3803 in this (rare) case use:
3805 delSWrapper "split_all_tac"
3806 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
3808 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
3811 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
3812 Isabelle's type classes, ^ on functions and relations has too general
3813 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
3814 necessary to attach explicit type constraints;
3816 * HOL/Relation: the prefix name of the infix "O" has been changed from
3817 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
3818 renamed accordingly (eg "compI" -> "rel_compI").
3820 * HOL: syntax translations now work properly with numerals and records
3823 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
3824 of "lam" -- INCOMPATIBILITY;
3826 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
3827 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
3828 renamed "Product_Type.unit";
3830 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
3832 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
3833 the "cases" method);
3835 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
3838 * HOL/IMP: updated and converted to new-style theory format; several
3839 parts turned into readable document, with proper Isar proof texts and
3840 some explanations (by Gerwin Klein);
3842 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
3844 * HOL-Hyperreal is now a logic image;
3849 * Isar: consts/constdefs supports mixfix syntax for continuous
3852 * Isar: domain package adapted to new-style theory format, e.g. see
3855 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
3856 potential INCOMPATIBILITY; now use plain induct_tac instead of former
3857 lift.induct_tac, always use UU instead of Undef;
3859 * HOLCF/IMP: updated and converted to new-style theory;
3864 * Isar: proper integration of logic-specific tools and packages,
3865 including theory commands '(co)inductive', '(co)datatype',
3866 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
3867 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
3869 * theory Main no longer includes AC; for the Axiom of Choice, base
3870 your theory on Main_ZFC;
3872 * the integer library now covers quotients and remainders, with many
3873 laws relating division to addition, multiplication, etc.;
3875 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
3876 typeless version of the formalism;
3878 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
3881 * ZF/Induct: new directory for examples of inductive definitions,
3882 including theory Multiset for multiset orderings; converted to
3883 new-style theory format;
3885 * ZF: many new theorems about lists, ordinals, etc.;
3890 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
3891 variable proof controls level of detail: 0 = no proofs (only oracle
3892 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
3893 also ref manual for further ML interfaces;
3895 * Pure/axclass: removed obsolete ML interface
3896 goal_subclass/goal_arity;
3898 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
3899 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
3900 separate tokens, so expressions involving minus need to be spaced
3903 * Pure/syntax: support non-oriented infixes, using keyword "infix"
3904 rather than "infixl" or "infixr";
3906 * Pure/syntax: concrete syntax for dummy type variables admits genuine
3907 sort constraint specifications in type inference; e.g. "x::_::foo"
3908 ensures that the type of "x" is of sort "foo" (but not necessarily a
3911 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
3912 control output of nested => (types); the default behavior is
3915 * Pure/syntax: builtin parse translation for "_constify" turns valued
3916 tokens into AST constants;
3918 * Pure/syntax: prefer later declarations of translations and print
3919 translation functions; potential INCOMPATIBILITY: need to reverse
3920 multiple declarations for same syntax element constant;
3922 * Pure/show_hyps reset by default (in accordance to existing Isar
3925 * Provers/classical: renamed addaltern to addafter, addSaltern to
3928 * Provers/clasimp: ``iff'' declarations now handle conditional rules
3931 * system: tested support for MacOS X; should be able to get Isabelle +
3932 Proof General to work in a plain Terminal after installing Poly/ML
3933 (e.g. from the Isabelle distribution area) and GNU bash alone
3934 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
3935 support requires further installations, e.g. from
3936 http://fink.sourceforge.net/);
3938 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
3940 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
3941 of 40 MB), cf. ML_OPTIONS;
3943 * system: Proof General keywords specification is now part of the
3944 Isabelle distribution (see etc/isar-keywords.el);
3946 * system: support for persistent Proof General sessions (refrain from
3947 outdating all loaded theories on startup); user may create writable
3948 logic images like this: ``isabelle -q HOL Test'';
3950 * system: smart selection of Isabelle process versus Isabelle
3951 interface, accommodates case-insensitive file systems (e.g. HFS+); may
3952 run both "isabelle" and "Isabelle" even if file names are badly
3953 damaged (executable inspects the case of the first letter of its own
3954 name); added separate "isabelle-process" and "isabelle-interface";
3956 * system: refrain from any attempt at filtering input streams; no
3957 longer support ``8bit'' encoding of old isabelle font, instead proper
3958 iso-latin characters may now be used; the related isatools
3959 "symbolinput" and "nonascii" have disappeared as well;
3961 * system: removed old "xterm" interface (the print modes "xterm" and
3962 "xterm_color" are still available for direct use in a suitable
3967 New in Isabelle99-2 (February 2001)
3968 -----------------------------------
3970 *** Overview of INCOMPATIBILITIES ***
3972 * HOL: please note that theories in the Library and elsewhere often use the
3973 new-style (Isar) format; to refer to their theorems in an ML script you must
3974 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
3976 * HOL: inductive package no longer splits induction rule aggressively,
3977 but only as far as specified by the introductions given; the old
3978 format may be recovered via ML function complete_split_rule or attribute
3979 'split_rule (complete)';
3981 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
3982 gfp_Tarski to gfp_unfold;
3984 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
3986 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
3987 relation); infix "^^" has been renamed "``"; infix "``" has been
3988 renamed "`"; "univalent" has been renamed "single_valued";
3990 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
3993 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
3995 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
3997 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
3998 consequence, it is no longer monotonic wrt. the local goal context
3999 (which is now passed through the inductive cases);
4001 * Document preparation: renamed standard symbols \<ll> to \<lless> and
4002 \<gg> to \<ggreater>;
4005 *** Document preparation ***
4007 * \isabellestyle{NAME} selects version of Isabelle output (currently
4008 available: are "it" for near math-mode best-style output, "sl" for
4009 slanted text style, and "tt" for plain type-writer; if no
4010 \isabellestyle command is given, output is according to slanted
4013 * support sub/super scripts (for single symbols only), input syntax is
4014 like this: "A\<^sup>*" or "A\<^sup>\<star>";
4016 * some more standard symbols; see Appendix A of the system manual for
4017 the complete list of symbols defined in isabellesym.sty;
4019 * improved isabelle style files; more abstract symbol implementation
4020 (should now use \isamath{...} and \isatext{...} in custom symbol
4023 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
4024 state; Note that presentation of goal states does not conform to
4025 actual human-readable proof documents. Please do not include goal
4026 states into document output unless you really know what you are doing!
4028 * proper indentation of antiquoted output with proportional LaTeX
4031 * no_document ML operator temporarily disables LaTeX document
4034 * isatool unsymbolize tunes sources for plain ASCII communication;
4039 * Pure: Isar now suffers initial goal statements to contain unbound
4040 schematic variables (this does not conform to actual readable proof
4041 documents, due to unpredictable outcome and non-compositional proof
4042 checking); users who know what they are doing may use schematic goals
4043 for Prolog-style synthesis of proven results;
4045 * Pure: assumption method (an implicit finishing) now handles actual
4048 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
4049 initial goal, declare "that" only as Pure intro (only for single
4050 steps); the "that" rule assumption may now be involved in implicit
4051 finishing, thus ".." becomes a feasible for trivial obtains;
4053 * Pure: default proof step now includes 'intro_classes'; thus trivial
4054 instance proofs may be performed by "..";
4056 * Pure: ?thesis / ?this / "..." now work for pure meta-level
4059 * Pure: more robust selection of calculational rules;
4061 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
4062 rule (as well as the assumption rule);
4064 * Pure: 'thm_deps' command visualizes dependencies of theorems and
4065 lemmas, using the graph browser tool;
4067 * Pure: predict failure of "show" in interactive mode;
4069 * Pure: 'thms_containing' now takes actual terms as arguments;
4071 * HOL: improved method 'induct' --- now handles non-atomic goals
4072 (potential INCOMPATIBILITY); tuned error handling;
4074 * HOL: cases and induct rules now provide explicit hints about the
4075 number of facts to be consumed (0 for "type" and 1 for "set" rules);
4076 any remaining facts are inserted into the goal verbatim;
4078 * HOL: local contexts (aka cases) may now contain term bindings as
4079 well; the 'cases' and 'induct' methods new provide a ?case binding for
4080 the result to be shown in each case;
4082 * HOL: added 'recdef_tc' command;
4084 * isatool convert assists in eliminating legacy ML scripts;
4089 * HOL/Library: a collection of generic theories to be used together
4090 with main HOL; the theory loader path already includes this directory
4091 by default; the following existing theories have been moved here:
4092 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
4093 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
4095 * HOL/Unix: "Some aspects of Unix file-system security", a typical
4096 modelling and verification task performed in Isabelle/HOL +
4097 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
4099 * HOL/Algebra: special summation operator SUM no longer exists, it has
4100 been replaced by setsum; infix 'assoc' now has priority 50 (like
4101 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
4102 'domain', this makes the theory consistent with mathematical
4105 * HOL basics: added overloaded operations "inverse" and "divide"
4106 (infix "/"), syntax for generic "abs" operation, generic summation
4109 * HOL/typedef: simplified package, provide more useful rules (see also
4112 * HOL/datatype: induction rule for arbitrarily branching datatypes is
4113 now expressed as a proper nested rule (old-style tactic scripts may
4114 require atomize_strip_tac to cope with non-atomic premises);
4116 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
4117 to "split_conv" (old name still available for compatibility);
4119 * HOL: improved concrete syntax for strings (e.g. allows translation
4120 rules with string literals);
4122 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
4123 and Fleuriot's mechanization of analysis, including the transcendental
4124 functions for the reals;
4126 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
4131 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
4132 "lam" is displayed as TWO lambda-symbols
4134 * CTT: theory Main now available, containing everything (that is, Bool
4140 * Pure: the Simplifier has been implemented properly as a derived rule
4141 outside of the actual kernel (at last!); the overall performance
4142 penalty in practical applications is about 50%, while reliability of
4143 the Isabelle inference kernel has been greatly improved;
4145 * print modes "brackets" and "no_brackets" control output of nested =>
4146 (types) and ==> (props); the default behaviour is "brackets";
4148 * Provers: fast_tac (and friends) now handle actual object-logic rules
4149 as assumptions as well;
4151 * system: support Poly/ML 4.0;
4153 * system: isatool install handles KDE version 1 or 2;
4157 New in Isabelle99-1 (October 2000)
4158 ----------------------------------
4160 *** Overview of INCOMPATIBILITIES ***
4162 * HOL: simplification of natural numbers is much changed; to partly
4163 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
4164 issue the following ML commands:
4166 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
4167 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
4169 * HOL: simplification no longer dives into case-expressions; this is
4170 controlled by "t.weak_case_cong" for each datatype t;
4172 * HOL: nat_less_induct renamed to less_induct;
4174 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
4175 fixsome to patch .thy and .ML sources automatically;
4177 select_equality -> some_equality
4178 select_eq_Ex -> some_eq_ex
4179 selectI2EX -> someI2_ex
4182 select1_equality -> some1_equality
4183 Eps_sym_eq -> some_sym_eq_trivial
4184 Eps_eq -> some_eq_trivial
4186 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
4188 * HOL: removed obsolete theorem binding expand_if (refer to split_if
4191 * HOL: the recursion equations generated by 'recdef' are now called
4192 f.simps instead of f.rules;
4194 * HOL: qed_spec_mp now also handles bounded ALL as well;
4196 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
4197 sometimes be needed;
4199 * HOL: the constant for "f``x" is now "image" rather than "op ``";
4201 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
4203 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
4204 product is now "<*>" instead of "Times"; the lexicographic product is
4205 now "<*lex*>" instead of "**";
4207 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
4208 of main HOL, but was unused); better use HOL's datatype package;
4210 * HOL: removed "symbols" syntax for constant "override" of theory Map;
4211 the old syntax may be recovered as follows:
4214 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
4215 (infixl "\\<oplus>" 100)
4217 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4219 * HOL/ML: even fewer consts are declared as global (see theories Ord,
4220 Lfp, Gfp, WF); this only affects ML packages that refer to const names
4223 * HOL and ZF: syntax for quotienting wrt an equivalence relation
4224 changed from A/r to A//r;
4226 * ZF: new treatment of arithmetic (nat & int) may break some old
4229 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
4230 rulify -> rule_format, elimify -> elim_format, ...);
4232 * Isar/Provers: intro/elim/dest attributes changed; renamed
4233 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
4234 should have to change intro!! to intro? only); replaced "delrule" by
4237 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
4239 * Provers: strengthened force_tac by using new first_best_tac;
4241 * LaTeX document preparation: several changes of isabelle.sty (see
4245 *** Document preparation ***
4247 * formal comments (text blocks etc.) in new-style theories may now
4248 contain antiquotations of thm/prop/term/typ/text to be presented
4249 according to latex print mode; concrete syntax is like this:
4250 @{term[show_types] "f(x) = a + x"};
4252 * isatool mkdir provides easy setup of Isabelle session directories,
4253 including proper document sources;
4255 * generated LaTeX sources are now deleted after successful run
4256 (isatool document -c); may retain a copy somewhere else via -D option
4259 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
4260 style files, achieving self-contained LaTeX sources and simplifying
4263 * old-style theories now produce (crude) LaTeX output as well;
4265 * browser info session directories are now self-contained (may be put
4266 on WWW server seperately); improved graphs of nested sessions; removed
4267 graph for 'all sessions';
4269 * several improvements in isabelle style files; \isabellestyle{it}
4270 produces fake math mode output; \isamarkupheader is now \section by
4271 default; see lib/texinputs/isabelle.sty etc.;
4276 * Isar/Pure: local results and corresponding term bindings are now
4277 subject to Hindley-Milner polymorphism (similar to ML); this
4278 accommodates incremental type-inference very nicely;
4280 * Isar/Pure: new derived language element 'obtain' supports
4281 generalized existence reasoning;
4283 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
4284 support accumulation of results, without applying any rules yet;
4285 useful to collect intermediate results without explicit name
4286 references, and for use with transitivity rules with more than 2
4289 * Isar/Pure: scalable support for case-analysis type proofs: new
4290 'case' language element refers to local contexts symbolically, as
4291 produced by certain proof methods; internally, case names are attached
4292 to theorems as "tags";
4294 * Isar/Pure: theory command 'hide' removes declarations from
4295 class/type/const name spaces;
4297 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
4298 indicate potential overloading;
4300 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
4302 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
4303 "{a,b,c}" instead of {a,b,c};
4305 * Isar/Pure now provides its own version of intro/elim/dest
4306 attributes; useful for building new logics, but beware of confusion
4307 with the version in Provers/classical;
4309 * Isar/Pure: the local context of (non-atomic) goals is provided via
4310 case name 'antecedent';
4312 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
4313 to the current context is now done automatically);
4315 * Isar/Pure: theory command 'method_setup' provides a simple interface
4316 for definining proof methods in ML;
4318 * Isar/Provers: intro/elim/dest attributes changed; renamed
4319 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
4320 most cases, one should have to change intro!! to intro? only);
4321 replaced "delrule" by "rule del";
4323 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
4324 'symmetric' attribute (the latter supercedes [RS sym]);
4326 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
4327 method modifier); 'simp' method: 'only:' modifier removes loopers as
4328 well (including splits);
4330 * Isar/Provers: Simplifier and Classical methods now support all kind
4331 of modifiers used in the past, including 'cong', 'iff', etc.
4333 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
4334 of Simplifier and Classical reasoner);
4336 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
4337 now support named cases; major packages (inductive, datatype, primrec,
4338 recdef) support case names and properly name parameters;
4340 * Isar/HOL: new transitivity rules for substitution in inequalities --
4341 monotonicity conditions are extracted to be proven at end of
4344 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
4347 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
4348 split_if split_if_asm; datatype package provides theorems foo.splits =
4349 foo.split foo.split_asm for each datatype;
4351 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
4352 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
4353 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
4354 use "(cases (simplified))" method in proper proof texts);
4356 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
4358 * Isar: names of theorems etc. may be natural numbers as well;
4360 * Isar: 'pr' command: optional arguments for goals_limit and
4361 ProofContext.prems_limit; no longer prints theory contexts, but only
4364 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
4365 additional print modes to be specified; e.g. "pr(latex)" will print
4366 proof state according to the Isabelle LaTeX style;
4368 * Isar: improved support for emulating tactic scripts, including proof
4369 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
4370 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
4371 (for HOL datatypes);
4373 * Isar: simplified (more robust) goal selection of proof methods: 1st
4374 goal, all goals, or explicit goal specifier (tactic emulation); thus
4375 'proof method scripts' have to be in depth-first order;
4377 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
4379 * Isar: removed 'help' command, which hasn't been too helpful anyway;
4380 should instead use individual commands for printing items
4381 (print_commands, print_methods etc.);
4383 * Isar: added 'nothing' --- the empty list of theorems;
4388 * HOL/MicroJava: formalization of a fragment of Java, together with a
4389 corresponding virtual machine and a specification of its bytecode
4390 verifier and a lightweight bytecode verifier, including proofs of
4391 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
4392 Cornelia Pusch (see also the homepage of project Bali at
4393 http://isabelle.in.tum.de/Bali/);
4395 * HOL/Algebra: new theory of rings and univariate polynomials, by
4398 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
4399 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
4402 * HOL/Lattice: fundamental concepts of lattice theory and order
4403 structures, including duals, properties of bounds versus algebraic
4404 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
4405 Theorem for complete lattices etc.; may also serve as a demonstration
4406 for abstract algebraic reasoning using axiomatic type classes, and
4407 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
4409 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
4412 * HOL/IMPP: extension of IMP with local variables and mutually
4413 recursive procedures, by David von Oheimb;
4415 * HOL/Lambda: converted into new-style theory and document;
4417 * HOL/ex/Multiquote: example of multiple nested quotations and
4418 anti-quotations -- basically a generalized version of de-Bruijn
4419 representation; very useful in avoiding lifting of operations;
4421 * HOL/record: added general record equality rule to simpset; fixed
4422 select-update simplification procedure to handle extended records as
4423 well; admit "r" as field name;
4425 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
4426 other numeric types and also as the identity of groups, rings, etc.;
4428 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
4429 Types nat and int belong to this axclass;
4431 * HOL: greatly improved simplification involving numerals of type nat, int, real:
4432 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
4433 i*j + k + j*#3*i simplifies to #4*(i*j) + k
4434 two terms #m*u and #n*u are replaced by #(m+n)*u
4435 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
4436 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
4437 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
4439 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
4440 powerful prover for predicate logic but knows nothing of clasets; see
4441 ex/mesontest.ML and ex/mesontest2.ML for example applications;
4443 * HOL: new version of "case_tac" subsumes both boolean case split and
4444 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
4445 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
4447 * HOL: simplification no longer dives into case-expressions: only the
4448 selector expression is simplified, but not the remaining arms; to
4449 enable full simplification of case-expressions for datatype t, you may
4450 remove t.weak_case_cong from the simpset, either globally (Delcongs
4451 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
4453 * HOL/recdef: the recursion equations generated by 'recdef' for
4454 function 'f' are now called f.simps instead of f.rules; if all
4455 termination conditions are proved automatically, these simplification
4456 rules are added to the simpset, as in primrec; rules may be named
4457 individually as well, resulting in a separate list of theorems for
4460 * HOL/While is a new theory that provides a while-combinator. It
4461 permits the definition of tail-recursive functions without the
4462 provision of a termination measure. The latter is necessary once the
4463 invariant proof rule for while is applied.
4465 * HOL: new (overloaded) notation for the set of elements below/above
4466 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
4468 * HOL: theorems impI, allI, ballI bound as "strip";
4470 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
4471 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
4472 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
4474 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4476 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
4477 main HOL, but was unused);
4479 * HOL: fewer consts declared as global (e.g. have to refer to
4480 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
4482 * HOL: tuned AST representation of nested pairs, avoiding bogus output
4483 in case of overlap with user translations (e.g. judgements over
4484 tuples); (note that the underlying logical represenation is still
4490 * ZF: simplification automatically cancels common terms in arithmetic
4491 expressions over nat and int;
4493 * ZF: new treatment of nat to minimize type-checking: all operators
4494 coerce their operands to a natural number using the function natify,
4495 making the algebraic laws unconditional;
4497 * ZF: as above, for int: operators coerce their operands to an integer
4498 using the function intify;
4500 * ZF: the integer library now contains many of the usual laws for the
4501 orderings, including $<=, and monotonicity laws for $+ and $*;
4503 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
4506 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
4507 to the simplifier and classical reasoner simultaneously;
4512 * Provers: blast_tac now handles actual object-logic rules as
4513 assumptions; note that auto_tac uses blast_tac internally as well;
4515 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
4516 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
4518 * Provers: delrules now handles destruct rules as well (no longer need
4519 explicit make_elim);
4521 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
4522 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4523 use instead the strong form,
4524 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4525 in HOL, FOL and ZF the function cla_make_elim will create such rules
4526 from destruct-rules;
4528 * Provers: Simplifier.easy_setup provides a fast path to basic
4529 Simplifier setup for new object-logics;
4531 * Pure: AST translation rules no longer require constant head on LHS;
4533 * Pure: improved name spaces: ambiguous output is qualified; support
4534 for hiding of names;
4536 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
4537 XSYMBOL_HOME; no longer need to do manual configuration in most
4540 * system: compression of ML heaps images may now be controlled via -c
4541 option of isabelle and isatool usedir (currently only observed by
4544 * system: isatool installfonts may handle X-Symbol fonts as well (very
4545 useful for remote X11);
4547 * system: provide TAGS file for Isabelle sources;
4549 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
4552 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
4553 timing flag supersedes proof_timing and Toplevel.trace;
4555 * ML: new combinators |>> and |>>> for incremental transformations
4556 with secondary results (e.g. certain theory extensions):
4558 * ML: PureThy.add_defs gets additional argument to indicate potential
4559 overloading (usually false);
4561 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
4566 New in Isabelle99 (October 1999)
4567 --------------------------------
4569 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4571 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
4572 are no longer simplified. (This allows the simplifier to unfold recursive
4573 functional programs.) To restore the old behaviour, declare
4575 Delcongs [if_weak_cong];
4577 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
4580 * HOL: the predicate "inj" is now defined by translation to "inj_on";
4582 * HOL/datatype: mutual_induct_tac no longer exists --
4583 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
4585 * HOL/typedef: fixed type inference for representing set; type
4586 arguments now have to occur explicitly on the rhs as type constraints;
4588 * ZF: The con_defs part of an inductive definition may no longer refer
4589 to constants declared in the same theory;
4591 * HOL, ZF: the function mk_cases, generated by the inductive
4592 definition package, has lost an argument. To simplify its result, it
4593 uses the default simpset instead of a supplied list of theorems.
4595 * HOL/List: the constructors of type list are now Nil and Cons;
4597 * Simplifier: the type of the infix ML functions
4598 setSSolver addSSolver setSolver addSolver
4599 is now simpset * solver -> simpset where `solver' is a new abstract type
4600 for packaging solvers. A solver is created via
4601 mk_solver: string -> (thm list -> int -> tactic) -> solver
4602 where the string argument is only a comment.
4607 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
4608 decision procedure for linear arithmetic. Currently it is used for
4609 types `nat', `int', and `real' in HOL (see below); it can, should and
4610 will be instantiated for other types and logics as well.
4612 * The simplifier now accepts rewrite rules with flexible heads, eg
4613 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
4614 They are applied like any rule with a non-pattern lhs, i.e. by first-order
4620 * New Isabelle/Isar subsystem provides an alternative to traditional
4621 tactical theorem proving; together with the ProofGeneral/isar user
4622 interface it offers an interactive environment for developing human
4623 readable proof documents (Isar == Intelligible semi-automated
4624 reasoning); for further information see isatool doc isar-ref,
4625 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
4627 * improved and simplified presentation of theories: better HTML markup
4628 (including colors), graph views in several sizes; isatool usedir now
4629 provides a proper interface for user theories (via -P option); actual
4630 document preparation based on (PDF)LaTeX is available as well (for
4631 new-style theories only); see isatool doc system for more information;
4633 * native support for Proof General, both for classic Isabelle and
4636 * ML function thm_deps visualizes dependencies of theorems and lemmas,
4637 using the graph browser tool;
4639 * Isabelle manuals now also available as PDF;
4641 * theory loader rewritten from scratch (may not be fully
4642 bug-compatible); old loadpath variable has been replaced by show_path,
4643 add_path, del_path, reset_path functions; new operations such as
4644 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
4647 * improved isatool install: option -k creates KDE application icon,
4648 option -p DIR installs standalone binaries;
4650 * added ML_PLATFORM setting (useful for cross-platform installations);
4651 more robust handling of platform specific ML images for SML/NJ;
4653 * the settings environment is now statically scoped, i.e. it is never
4654 created again in sub-processes invoked from isabelle, isatool, or
4657 * path element specification '~~' refers to '$ISABELLE_HOME';
4659 * in locales, the "assumes" and "defines" parts may be omitted if
4662 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
4665 * new print_mode "HTML";
4667 * new flag show_tags controls display of tags of theorems (which are
4668 basically just comments that may be attached by some tools);
4670 * Isamode 2.6 requires patch to accomodate change of Isabelle font
4671 mode and goal output format:
4673 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
4675 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
4677 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
4678 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
4680 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
4682 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
4684 * function bind_thms stores lists of theorems (cf. bind_thm);
4686 * new shorthand tactics ftac, eatac, datac, fatac;
4688 * qed (and friends) now accept "" as result name; in that case the
4689 theorem is not stored, but proper checks and presentation of the
4692 * theorem database now also indexes constants "Trueprop", "all",
4693 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
4698 ** HOL arithmetic **
4700 * There are now decision procedures for linear arithmetic over nat and
4703 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
4704 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
4705 are treated as atomic; subformulae not involving type `nat' or `int'
4706 are ignored; quantified subformulae are ignored unless they are
4707 positive universal or negative existential. The tactic has to be
4708 invoked by hand and can be a little bit slow. In particular, the
4709 running time is exponential in the number of occurrences of `min' and
4710 `max', and `-' on `nat'.
4712 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
4713 (negated) (in)equalities among the premises and the conclusion into
4714 account (i.e. no compound formulae) and does not know about `min' and
4715 `max', and `-' on `nat'. It is fast and is used automatically by the
4718 NB: At the moment, these decision procedures do not cope with mixed
4719 nat/int formulae where the two parts interact, such as `m < n ==>
4722 * HOL/Numeral provides a generic theory of numerals (encoded
4723 efficiently as bit strings); setup for types nat/int/real is in place;
4724 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
4725 int, existing theories and proof scripts may require a few additional
4728 * integer division and remainder can now be performed on constant
4731 * many properties of integer multiplication, division and remainder
4734 * An interface to the Stanford Validity Checker (SVC) is available through the
4735 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
4736 are proved automatically. SVC must be installed separately, and its results
4737 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
4738 invocation of the underlying oracle). For SVC see
4739 http://verify.stanford.edu/SVC
4741 * IsaMakefile: the HOL-Real target now builds an actual image;
4746 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
4747 (in Isabelle/Isar) -- by Gertrud Bauer;
4749 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
4750 analysis for assembly languages with subtypes;
4752 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
4753 -- avoids syntactic ambiguities and treats state, transition, and
4754 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
4755 changed syntax and (many) tactics;
4757 * HOL/inductive: Now also handles more general introduction rules such
4758 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
4759 theorems are now maintained within the theory (maintained via the
4762 * HOL/datatype: Now also handles arbitrarily branching datatypes
4763 (using function types) such as
4765 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
4767 * HOL/record: record_simproc (part of the default simpset) takes care
4768 of selectors applied to updated records; record_split_tac is no longer
4769 part of the default claset; update_defs may now be removed from the
4770 simpset in many cases; COMPATIBILITY: old behavior achieved by
4772 claset_ref () := claset() addSWrapper record_split_wrapper;
4773 Delsimprocs [record_simproc]
4775 * HOL/typedef: fixed type inference for representing set; type
4776 arguments now have to occur explicitly on the rhs as type constraints;
4778 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
4779 names rather than an ML expression;
4781 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
4782 supplied later. Program schemes can be defined, such as
4783 "While B C s = (if B s then While B C (C s) else s)"
4784 where the well-founded relation can be chosen after B and C have been given.
4786 * HOL/List: the constructors of type list are now Nil and Cons;
4787 INCOMPATIBILITY: while [] and infix # syntax is still there, of
4788 course, ML tools referring to List.list.op # etc. have to be adapted;
4790 * HOL_quantifiers flag superseded by "HOL" print mode, which is
4791 disabled by default; run isabelle with option -m HOL to get back to
4792 the original Gordon/HOL-style output;
4794 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
4795 ALL x<=y. P, EX x<y. P, EX x<=y. P;
4797 * HOL basic syntax simplified (more orthogonal): all variants of
4798 All/Ex now support plain / symbolic / HOL notation; plain syntax for
4799 Eps operator is provided as well: "SOME x. P[x]";
4801 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
4803 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
4804 thus available for user theories;
4806 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
4807 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
4810 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
4811 several times and then mp;
4816 * the notation <<...>> is now available as a notation for sequences of
4819 * the simplifier is now installed
4821 * the axiom system has been generalized (thanks to Soren Heilmann)
4823 * the classical reasoner now has a default rule database
4828 * new primrec section allows primitive recursive functions to be given
4829 directly (as in HOL) over datatypes and the natural numbers;
4831 * new tactics induct_tac and exhaust_tac for induction (or case
4832 analysis) over datatypes and the natural numbers;
4834 * the datatype declaration of type T now defines the recursor T_rec;
4836 * simplification automatically does freeness reasoning for datatype
4839 * automatic type-inference, with AddTCs command to insert new
4840 type-checking rules;
4842 * datatype introduction rules are now added as Safe Introduction rules
4845 * the syntax "if P then x else y" is now available in addition to
4849 *** Internal programming interfaces ***
4851 * tuned simplifier trace output; new flag debug_simp;
4853 * structures Vartab / Termtab (instances of TableFun) offer efficient
4854 tables indexed by indexname_ord / term_ord (compatible with aconv);
4856 * AxClass.axclass_tac lost the theory argument;
4858 * tuned current_goals_markers semantics: begin / end goal avoids
4859 printing empty lines;
4861 * removed prs and prs_fn hook, which was broken because it did not
4862 include \n in its semantics, forcing writeln to add one
4863 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
4864 string -> unit if you really want to output text without newline;
4866 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
4867 plain output, interface builders may have to enable 'isabelle_font'
4868 mode to get Isabelle font glyphs as before;
4870 * refined token_translation interface; INCOMPATIBILITY: output length
4871 now of type real instead of int;
4873 * theory loader actions may be traced via new ThyInfo.add_hook
4874 interface (see src/Pure/Thy/thy_info.ML); example application: keep
4875 your own database of information attached to *whole* theories -- as
4876 opposed to intra-theory data slots offered via TheoryDataFun;
4878 * proper handling of dangling sort hypotheses (at last!);
4879 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
4880 extra sort hypotheses that can be witnessed from the type signature;
4881 the force_strip_shyps flag is gone, any remaining shyps are simply
4882 left in the theorem (with a warning issued by strip_shyps_warning);
4886 New in Isabelle98-1 (October 1998)
4887 ----------------------------------
4889 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4891 * several changes of automated proof tools;
4893 * HOL: major changes to the inductive and datatype packages, including
4894 some minor incompatibilities of theory syntax;
4896 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
4899 * HOL: removed duplicate thms in Arith:
4900 less_imp_add_less should be replaced by trans_less_add1
4901 le_imp_add_le should be replaced by trans_le_add1
4903 * HOL: unary minus is now overloaded (new type constraints may be
4906 * HOL and ZF: unary minus for integers is now #- instead of #~. In
4907 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
4908 now taken as an integer constant.
4910 * Pure: ML function 'theory_of' renamed to 'theory';
4916 1. Asm_full_simp_tac is now more aggressive.
4917 1. It will sometimes reorient premises if that increases their power to
4919 2. It does no longer proceed strictly from left to right but may also
4920 rotate premises to achieve further simplification.
4921 For compatibility reasons there is now Asm_lr_simp_tac which is like the
4922 old Asm_full_simp_tac in that it does not rotate premises.
4923 2. The simplifier now knows a little bit about nat-arithmetic.
4925 * Classical reasoner: wrapper mechanism for the classical reasoner now
4926 allows for selected deletion of wrappers, by introduction of names for
4927 wrapper functionals. This implies that addbefore, addSbefore,
4928 addaltern, and addSaltern now take a pair (name, tactic) as argument,
4929 and that adding two tactics with the same name overwrites the first
4930 one (emitting a warning).
4931 type wrapper = (int -> tactic) -> (int -> tactic)
4932 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
4933 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
4934 delWrapper, delSWrapper: claset * string -> claset
4935 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
4937 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
4938 semantics; addbefore now affects only the unsafe part of step_tac
4939 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
4940 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
4943 * Classical reasoner: setwrapper to setWrapper and compwrapper to
4944 compWrapper; added safe wrapper (and access functions for it);
4946 * HOL/split_all_tac is now much faster and fails if there is nothing
4947 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
4948 and the names of the automatically generated variables have changed.
4949 split_all_tac has moved within claset() from unsafe wrappers to safe
4950 wrappers, which means that !!-bound variables are split much more
4951 aggressively, and safe_tac and clarify_tac now split such variables.
4952 If this splitting is not appropriate, use delSWrapper "split_all_tac".
4953 Note: the same holds for record_split_tac, which does the job of
4954 split_all_tac for record fields.
4956 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
4957 permanently to the default simpset using Addsplits just like
4958 Addsimps. They can be removed via Delsplits just like
4959 Delsimps. Lower-case versions are also available.
4961 * HOL/Simplifier: The rule split_if is now part of the default
4962 simpset. This means that the simplifier will eliminate all occurrences
4963 of if-then-else in the conclusion of a goal. To prevent this, you can
4964 either remove split_if completely from the default simpset by
4965 `Delsplits [split_if]' or remove it in a specific call of the
4966 simplifier using `... delsplits [split_if]'. You can also add/delete
4967 other case splitting rules to/from the default simpset: every datatype
4968 generates suitable rules `split_t_case' and `split_t_case_asm' (where
4969 t is the name of the datatype).
4971 * Classical reasoner / Simplifier combination: new force_tac (and
4972 derivatives Force_tac, force) combines rewriting and classical
4973 reasoning (and whatever other tools) similarly to auto_tac, but is
4974 aimed to solve the given subgoal completely.
4979 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
4980 and `goalw': the theory is no longer needed as an explicit argument -
4981 the current theory context is used; assumptions are no longer returned
4982 at the ML-level unless one of them starts with ==> or !!; it is
4983 recommended to convert to these new commands using isatool fixgoal
4984 (backup your sources first!);
4986 * new top-level commands 'thm' and 'thms' for retrieving theorems from
4987 the current theory context, and 'theory' to lookup stored theories;
4989 * new theory section 'locale' for declaring constants, assumptions and
4990 definitions that have local scope;
4992 * new theory section 'nonterminals' for purely syntactic types;
4994 * new theory section 'setup' for generic ML setup functions
4995 (e.g. package initialization);
4997 * the distribution now includes Isabelle icons: see
4998 lib/logo/isabelle-{small,tiny}.xpm;
5000 * isatool install - install binaries with absolute references to
5003 * isatool logo -- create instances of the Isabelle logo (as EPS);
5005 * print mode 'emacs' reserved for Isamode;
5007 * support multiple print (ast) translations per constant name;
5009 * theorems involving oracles are now printed with a suffixed [!];
5014 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
5016 * HOL/inductive package reorganized and improved: now supports mutual
5022 oddI "n : EVEN ==> Suc n : ODD"
5023 evenI "n : ODD ==> Suc n : EVEN"
5025 new theorem list "elims" contains an elimination rule for each of the
5026 recursive sets; inductive definitions now handle disjunctive premises
5027 correctly (also ZF);
5029 INCOMPATIBILITIES: requires Inductive as an ancestor; component
5030 "mutual_induct" no longer exists - the induction rule is always
5031 contained in "induct";
5034 * HOL/datatype package re-implemented and greatly improved: now
5035 supports mutually recursive datatypes such as
5038 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
5039 | SUM ('a aexp) ('a aexp)
5040 | DIFF ('a aexp) ('a aexp)
5043 'a bexp = LESS ('a aexp) ('a aexp)
5044 | AND ('a bexp) ('a bexp)
5045 | OR ('a bexp) ('a bexp)
5047 as well as indirectly recursive datatypes such as
5050 ('a, 'b) term = Var 'a
5051 | App 'b ((('a, 'b) term) list)
5053 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
5054 induction on mutually / indirectly recursive datatypes.
5056 Primrec equations are now stored in theory and can be accessed via
5057 <function_name>.simps.
5061 - Theories using datatypes must now have theory Datatype as an
5063 - The specific <typename>.induct_tac no longer exists - use the
5064 generic induct_tac instead.
5065 - natE has been renamed to nat.exhaust - use exhaust_tac
5066 instead of res_inst_tac ... natE. Note that the variable
5067 names in nat.exhaust differ from the names in natE, this
5068 may cause some "fragile" proofs to fail.
5069 - The theorems split_<typename>_case and split_<typename>_case_asm
5070 have been renamed to <typename>.split and <typename>.split_asm.
5071 - Since default sorts of type variables are now handled correctly,
5072 some datatype definitions may have to be annotated with explicit
5074 - Primrec definitions no longer require function name and type
5075 of recursive argument.
5077 Consider using isatool fixdatatype to adapt your theories and proof
5078 scripts to the new package (backup your sources first!).
5081 * HOL/record package: considerably improved implementation; now
5082 includes concrete syntax for record types, terms, updates; theorems
5083 for surjective pairing and splitting !!-bound record variables; proof
5084 support is as follows:
5086 1) standard conversions (selectors or updates applied to record
5087 constructor terms) are part of the standard simpset;
5089 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
5090 made part of standard simpset and claset via addIffs;
5092 3) a tactic for record field splitting (record_split_tac) is part of
5093 the standard claset (addSWrapper);
5095 To get a better idea about these rules you may retrieve them via
5096 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
5097 the name of your record type.
5099 The split tactic 3) conceptually simplifies by the following rule:
5101 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
5103 Thus any record variable that is bound by meta-all will automatically
5104 blow up into some record constructor term, consequently the
5105 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
5106 solve record problems automatically.
5109 * reorganized the main HOL image: HOL/Integ and String loaded by
5110 default; theory Main includes everything;
5112 * automatic simplification of integer sums and comparisons, using cancellation;
5114 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
5116 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
5118 * many new identities for unions, intersections, set difference, etc.;
5120 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
5121 called split_if, split_split, split_sum_case and split_nat_case (to go
5122 with add/delsplits);
5124 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
5125 (?x::unit) = (); this is made part of the default simpset, which COULD
5126 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
5127 'Delsimprocs [unit_eq_proc];' as last resort); also note that
5128 unit_abs_eta_conv is added in order to counter the effect of
5129 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
5132 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
5135 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5136 It and 'sym RS equals0D' are now in the default claset, giving automatic
5137 disjointness reasoning but breaking a few old proofs.
5139 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
5140 to 'converse' from 'inverse' (for compatibility with ZF and some
5143 * HOL/recdef can now declare non-recursive functions, with {} supplied as
5144 the well-founded relation;
5146 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
5147 Compl A. The "Compl" syntax remains available as input syntax for this
5150 * HOL/Update: new theory of function updates:
5151 f(a:=b) == %x. if x=a then b else f x
5152 may also be iterated as in f(a:=b,c:=d,...);
5154 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
5157 - new function list_update written xs[i:=v] that updates the i-th
5158 list position. May also be iterated as in xs[i:=a,j:=b,...].
5159 - new function `upt' written [i..j(] which generates the list
5160 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
5161 bound write [i..j], which is a shorthand for [i..j+1(].
5162 - new lexicographic orderings and corresponding wellfoundedness theorems.
5165 - removed 'pred' (predecessor) function;
5166 - generalized some theorems about n-1;
5167 - many new laws about "div" and "mod";
5168 - new laws about greatest common divisors (see theory ex/Primes);
5170 * HOL/Relation: renamed the relational operator r^-1 "converse"
5171 instead of "inverse";
5173 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
5174 of the multiset ordering;
5176 * directory HOL/Real: a construction of the reals using Dedekind cuts
5177 (not included by default);
5179 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
5181 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
5182 programs, i.e. different program variables may have different types.
5184 * calling (stac rew i) now fails if "rew" has no effect on the goal
5185 [previously, this check worked only if the rewrite rule was unconditional]
5186 Now rew can involve either definitions or equalities (either == or =).
5191 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
5192 only the theorems proved on ZF.ML;
5194 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5195 It and 'sym RS equals0D' are now in the default claset, giving automatic
5196 disjointness reasoning but breaking a few old proofs.
5198 * ZF/Update: new theory of function updates
5199 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
5200 may also be iterated as in f(a:=b,c:=d,...);
5202 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
5204 * calling (stac rew i) now fails if "rew" has no effect on the goal
5205 [previously, this check worked only if the rewrite rule was unconditional]
5206 Now rew can involve either definitions or equalities (either == or =).
5208 * case_tac provided for compatibility with HOL
5209 (like the old excluded_middle_tac, but with subgoals swapped)
5212 *** Internal programming interfaces ***
5214 * Pure: several new basic modules made available for general use, see
5215 also src/Pure/README;
5217 * improved the theory data mechanism to support encapsulation (data
5218 kind name replaced by private Object.kind, acting as authorization
5219 key); new type-safe user interface via functor TheoryDataFun; generic
5220 print_data function becomes basically useless;
5222 * removed global_names compatibility flag -- all theory declarations
5223 are qualified by default;
5225 * module Pure/Syntax now offers quote / antiquote translation
5226 functions (useful for Hoare logic etc. with implicit dependencies);
5227 see HOL/ex/Antiquote for an example use;
5229 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
5232 * new tactical CHANGED_GOAL for checking that a tactic modifies a
5235 * Display.print_goals function moved to Locale.print_goals;
5237 * standard print function for goals supports current_goals_markers
5238 variable for marking begin of proof, end of proof, start of goal; the
5239 default is ("", "", ""); setting current_goals_markers := ("<proof>",
5240 "</proof>", "<goal>") causes SGML like tagged proof state printing,
5245 New in Isabelle98 (January 1998)
5246 --------------------------------
5248 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5250 * changed lexical syntax of terms / types: dots made part of long
5251 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
5253 * simpset (and claset) reference variable replaced by functions
5254 simpset / simpset_ref;
5256 * no longer supports theory aliases (via merge) and non-trivial
5257 implicit merge of thms' signatures;
5259 * most internal names of constants changed due to qualified names;
5261 * changed Pure/Sequence interface (see Pure/seq.ML);
5264 *** General Changes ***
5266 * hierachically structured name spaces (for consts, types, axms, thms
5267 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
5268 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
5269 isatool fixdots ensures space after dots (e.g. "%x. x"); set
5270 long_names for fully qualified output names; NOTE: ML programs
5271 (special tactics, packages etc.) referring to internal names may have
5272 to be adapted to cope with fully qualified names; in case of severe
5273 backward campatibility problems try setting 'global_names' at compile
5274 time to have enrything declared within a flat name space; one may also
5275 fine tune name declarations in theories via the 'global' and 'local'
5278 * reimplemented the implicit simpset and claset using the new anytype
5279 data filed in signatures; references simpset:simpset ref etc. are
5280 replaced by functions simpset:unit->simpset and
5281 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
5282 to patch your ML files accordingly;
5284 * HTML output now includes theory graph data for display with Java
5285 applet or isatool browser; data generated automatically via isatool
5286 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
5288 * defs may now be conditional; improved rewrite_goals_tac to handle
5289 conditional equations;
5291 * defs now admits additional type arguments, using TYPE('a) syntax;
5293 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
5294 creates a new theory node; implicit merge of thms' signatures is
5295 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
5296 transfer:theory->thm->thm in (rare) cases;
5298 * improved handling of draft signatures / theories; draft thms (and
5299 ctyps, cterms) are automatically promoted to real ones;
5301 * slightly changed interfaces for oracles: admit many per theory, named
5302 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
5304 * print_goals: optional output of const types (set show_consts and
5307 * improved output of warnings (###) and errors (***);
5309 * subgoal_tac displays a warning if the new subgoal has type variables;
5311 * removed old README and Makefiles;
5313 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
5315 * removed obsolete init_pps and init_database;
5317 * deleted the obsolete tactical STATE, which was declared by
5318 fun STATE tacfun st = tacfun st st;
5320 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
5321 (which abbreviates $HOME);
5323 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
5324 use isatool fixseq to adapt your ML programs (this works for fully
5325 qualified references to the Sequence structure only!);
5327 * use_thy no longer requires writable current directory; it always
5328 reloads .ML *and* .thy file, if either one is out of date;
5331 *** Classical Reasoner ***
5333 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
5334 tactics that use classical reasoning to simplify a subgoal without
5335 splitting it into several subgoals;
5337 * Safe_tac: like safe_tac but uses the default claset;
5342 * added simplification meta rules:
5343 (asm_)(full_)simplify: simpset -> thm -> thm;
5345 * simplifier.ML no longer part of Pure -- has to be loaded by object
5348 * added prems argument to simplification procedures;
5350 * HOL, FOL, ZF: added infix function `addsplits':
5351 instead of `<simpset> setloop (split_tac <thms>)'
5352 you can simply write `<simpset> addsplits <thms>'
5357 * TYPE('a) syntax for type reflection terms;
5359 * no longer handles consts with name "" -- declare as 'syntax' instead;
5361 * pretty printer: changed order of mixfix annotation preference (again!);
5363 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
5368 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
5369 with `addloop' of the simplifier to faciliate case splitting in premises.
5371 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
5373 * HOL/Auth: new protocol proofs including some for the Internet
5376 * HOL/Map: new theory of `maps' a la VDM;
5378 * HOL/simplifier: simplification procedures nat_cancel_sums for
5379 cancelling out common nat summands from =, <, <= (in)equalities, or
5380 differences; simplification procedures nat_cancel_factor for
5381 cancelling common factor from =, <, <= (in)equalities over natural
5382 sums; nat_cancel contains both kinds of procedures, it is installed by
5383 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
5385 * HOL/simplifier: terms of the form
5386 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
5388 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
5389 and those of the form
5390 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
5392 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
5395 Each datatype `t' now comes with a theorem `split_t_case' of the form
5397 P(t_case f1 ... fn x) =
5398 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
5400 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
5403 and a theorem `split_t_case_asm' of the form
5405 P(t_case f1 ... fn x) =
5406 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
5408 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
5410 which can be added to a simpset via `addsplits'. The existing theorems
5411 expand_list_case and expand_option_case have been renamed to
5412 split_list_case and split_option_case.
5415 - `pred n' is automatically converted to `n-1'.
5416 Users are strongly encouraged not to use `pred' any longer,
5417 because it will disappear altogether at some point.
5418 - Users are strongly encouraged to write "0 < n" rather than
5419 "n ~= 0". Theorems and proof tools have been modified towards this
5423 the function "set_of_list" has been renamed "set" (and its theorems too);
5424 the function "nth" now takes its arguments in the reverse order and
5425 has acquired the infix notation "!" as in "xs!n".
5427 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
5429 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
5430 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
5432 * HOL/record: extensible records with schematic structural subtyping
5433 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
5434 still lacks various theorems and concrete record syntax;
5439 * removed "axioms" and "generated by" sections;
5441 * replaced "ops" section by extended "consts" section, which is capable of
5442 handling the continuous function space "->" directly;
5445 . proves theorems immediately and stores them in the theory,
5446 . creates hierachical name space,
5447 . now uses normal mixfix annotations (instead of cinfix...),
5448 . minor changes to some names and values (for consistency),
5449 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
5450 . separator between mutual domain defs: changed "," to "and",
5451 . improved handling of sort constraints; now they have to
5452 appear on the left-hand side of the equations only;
5454 * fixed LAM <x,y,zs>.b syntax;
5456 * added extended adm_tac to simplifier in HOLCF -- can now discharge
5457 adm (%x. P (t x)), where P is chainfinite and t continuous;
5462 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
5463 with `addloop' of the simplifier to faciliate case splitting in premises.
5465 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
5466 in HOL, they strip ALL and --> from proved theorems;
5470 New in Isabelle94-8 (May 1997)
5471 ------------------------------
5473 *** General Changes ***
5475 * new utilities to build / run / maintain Isabelle etc. (in parts
5476 still somewhat experimental); old Makefiles etc. still functional;
5478 * new 'Isabelle System Manual';
5480 * INSTALL text, together with ./configure and ./build scripts;
5482 * reimplemented type inference for greater efficiency, better error
5483 messages and clean internal interface;
5485 * prlim command for dealing with lots of subgoals (an easier way of
5486 setting goals_limit);
5491 * supports alternative (named) syntax tables (parser and pretty
5492 printer); internal interface is provided by add_modesyntax(_i);
5494 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
5495 be used in conjunction with the Isabelle symbol font; uses the
5496 "symbols" syntax table;
5498 * added token_translation interface (may translate name tokens in
5499 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
5500 the current print_mode); IMPORTANT: user print translation functions
5501 are responsible for marking newly introduced bounds
5502 (Syntax.mark_boundT);
5504 * token translations for modes "xterm" and "xterm_color" that display
5505 names in bold, underline etc. or colors (which requires a color
5508 * infixes may now be declared with names independent of their syntax;
5510 * added typed_print_translation (like print_translation, but may
5511 access type of constant);
5514 *** Classical Reasoner ***
5516 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
5517 some limitations. Blast_tac...
5518 + ignores addss, addbefore, addafter; this restriction is intrinsic
5519 + ignores elimination rules that don't have the correct format
5520 (the conclusion MUST be a formula variable)
5521 + ignores types, which can make HOL proofs fail
5522 + rules must not require higher-order unification, e.g. apply_type in ZF
5523 [message "Function Var's argument not a bound variable" relates to this]
5524 + its proof strategy is more general but can actually be slower
5526 * substitution with equality assumptions no longer permutes other
5529 * minor changes in semantics of addafter (now called addaltern); renamed
5530 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
5531 (and access functions for it);
5533 * improved combination of classical reasoner and simplifier:
5534 + functions for handling clasimpsets
5535 + improvement of addss: now the simplifier is called _after_ the
5537 + safe variant of addss called addSss: uses safe simplifications
5538 _during_ the safe steps. It is more complete as it allows multiple
5539 instantiations of unknowns (e.g. with slow_tac).
5543 * added interface for simplification procedures (functions that
5544 produce *proven* rewrite rules on the fly, depending on current
5547 * ordering on terms as parameter (used for ordered rewriting);
5549 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
5551 * the solver is now split into a safe and an unsafe part.
5552 This should be invisible for the normal user, except that the
5553 functions setsolver and addsolver have been renamed to setSolver and
5554 addSolver; added safe_asm_full_simp_tac;
5559 * a generic induction tactic `induct_tac' which works for all datatypes and
5560 also for type `nat';
5562 * a generic case distinction tactic `exhaust_tac' which works for all
5563 datatypes and also for type `nat';
5565 * each datatype comes with a function `size';
5567 * patterns in case expressions allow tuple patterns as arguments to
5568 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
5570 * primrec now also works with type nat;
5572 * recdef: a new declaration form, allows general recursive functions to be
5573 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
5575 * the constant for negation has been renamed from "not" to "Not" to
5576 harmonize with FOL, ZF, LK, etc.;
5578 * HOL/ex/LFilter theory of a corecursive "filter" functional for
5581 * HOL/Modelcheck demonstrates invocation of model checker oracle;
5583 * HOL/ex/Ring.thy declares cring_simp, which solves equational
5584 problems in commutative rings, using axiomatic type classes for + and *;
5586 * more examples in HOL/MiniML and HOL/Auth;
5588 * more default rewrite rules for quantifiers, union/intersection;
5590 * a new constant `arbitrary == @x.False';
5592 * HOLCF/IOA replaces old HOL/IOA;
5594 * HOLCF changes: derived all rules and arities
5595 + axiomatic type classes instead of classes
5596 + typedef instead of faking type definitions
5597 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
5598 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
5599 + eliminated the types void, one, tr
5600 + use unit lift and bool lift (with translations) instead of one and tr
5601 + eliminated blift from Lift3.thy (use Def instead of blift)
5602 all eliminated rules are derived as theorems --> no visible changes ;
5607 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
5608 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
5609 as ZF_cs addSIs [equalityI];
5613 New in Isabelle94-7 (November 96)
5614 ---------------------------------
5616 * allowing negative levels (as offsets) in prlev and choplev;
5618 * super-linear speedup for large simplifications;
5620 * FOL, ZF and HOL now use miniscoping: rewriting pushes
5621 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
5622 FAIL); can suppress it using the command Delsimps (ex_simps @
5623 all_simps); De Morgan laws are also now included, by default;
5625 * improved printing of ==> : ~:
5627 * new object-logic "Sequents" adds linear logic, while replacing LK
5628 and Modal (thanks to Sara Kalvala);
5630 * HOL/Auth: correctness proofs for authentication protocols;
5632 * HOL: new auto_tac combines rewriting and classical reasoning (many
5633 examples on HOL/Auth);
5635 * HOL: new command AddIffs for declaring theorems of the form P=Q to
5636 the rewriter and classical reasoner simultaneously;
5638 * function uresult no longer returns theorems in "standard" format;
5639 regain previous version by: val uresult = standard o uresult;
5646 * oracles -- these establish an interface between Isabelle and trusted
5647 external reasoners, which may deliver results as theorems;
5649 * proof objects (in particular record all uses of oracles);
5651 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
5653 * "constdefs" section in theory files;
5655 * "primrec" section (HOL) no longer requires names;
5657 * internal type "tactic" now simply "thm -> thm Sequence.seq";
5664 * reduced space requirements;
5666 * automatic HTML generation from theories;
5668 * theory files no longer require "..." (quotes) around most types;
5670 * new examples, including two proofs of the Church-Rosser theorem;
5672 * non-curried (1994) version of HOL is no longer distributed;
5679 * greatly reduced space requirements;
5681 * theory files (.thy) no longer require \...\ escapes at line breaks;
5683 * searchable theorem database (see the section "Retrieving theorems" on
5684 page 8 of the Reference Manual);
5686 * new examples, including Grabczewski's monumental case study of the
5689 * The previous version of HOL renamed to Old_HOL;
5691 * The new version of HOL (previously called CHOL) uses a curried syntax
5692 for functions. Application looks like f a b instead of f(a,b);
5694 * Mutually recursive inductive definitions finally work in HOL;
5696 * In ZF, pattern-matching on tuples is now available in all abstractions and
5697 translates to the operator "split";
5704 * new infix operator, addss, allowing the classical reasoner to
5705 perform simplification at each step of its search. Example:
5706 fast_tac (cs addss ss)
5708 * a new logic, CHOL, the same as HOL, but with a curried syntax
5709 for functions. Application looks like f a b instead of f(a,b). Also pairs
5710 look like (a,b) instead of <a,b>;
5712 * PLEASE NOTE: CHOL will eventually replace HOL!
5714 * In CHOL, pattern-matching on tuples is now available in all abstractions.
5715 It translates to the operator "split". A new theory of integers is available;
5717 * In ZF, integer numerals now denote two's-complement binary integers.
5718 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
5720 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
5721 of the Axiom of Choice;
5728 * Significantly faster resolution;
5730 * the different sections in a .thy file can now be mixed and repeated
5733 * Database of theorems for FOL, HOL and ZF. New
5734 commands including qed, qed_goal and bind_thm store theorems in the database.
5736 * Simple database queries: return a named theorem (get_thm) or all theorems of
5737 a given theory (thms_of), or find out what theory a theorem was proved in
5740 * Bugs fixed in the inductive definition and datatype packages;
5742 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
5743 and HOL_dup_cs obsolete;
5745 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
5748 * Simpler definition of function space in ZF;
5750 * new results about cardinal and ordinal arithmetic in ZF;
5752 * 'subtype' facility in HOL for introducing new types as subsets of existing
5755 :mode=text:wrap=hard:maxLineLen=72: