1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Generalized Isar history, with support for linear undo, direct state
12 * Recovered hiding of consts, which was accidentally broken in
13 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
14 makes c inaccessible; consider using ``hide (open) const c'' instead.
16 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
22 * dropped "locale (open)". INCOMPATBILITY.
24 * Command 'instance': attached definitions no longer accepted.
25 INCOMPATIBILITY, use proper 'instantiation' target.
27 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
30 *** Document preparation ***
32 * Antiquotation @{lemma} now imitates a regular terminal proof,
33 demanding keyword 'by' and supporting the full method expression
34 syntax just like the Isar command 'by'.
39 * HOL/Orderings: added class "preorder" as superclass of "order". INCOMPATIBILITY:
40 Instantiation proofs for order, linorder etc. slightly changed. Some theorems
41 named order_class.* now named preorder_class.*.
43 * HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been moved
44 to separate class dvd in Ring_and_Field; a couple of lemmas on dvd has been
45 generalized to class comm_semiring_1. Likewise a bunch of lemmas from Divides
46 has been generalized from nat to class semiring_div. INCOMPATIBILITY.
47 This involves the following theorem renames resulting from duplicate elimination:
49 dvd_def_mod ~> dvd_eq_mod_eq_0
50 zero_dvd_iff ~> dvd_0_left_iff
51 DIVISION_BY_ZERO_DIV ~> div_by_0
52 DIVISION_BY_ZERO_MOD ~> mod_by_0
53 mult_div ~> div_mult_self2_is_id
54 mult_mod ~> mod_mult_self2_is_0
56 * HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
57 zlcm (for int); carried together from various gcd/lcm developements in
58 the HOL Distribution. zgcd and zlcm replace former igcd and ilcm;
59 corresponding theorems renamed accordingly. INCOMPATIBILY. To
60 recover tupled syntax, use syntax declarations like:
63 abbreviation gcd where
64 "gcd == (%(a, b). GCD.gcd a b)"
66 GCD.gcd ("gcd '(_, _')")
68 (analogously for lcm, zgcd, zlcm).
70 * HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
72 * New ML antiquotation @{code}: takes constant as argument, generates
73 corresponding code in background and inserts name of the corresponding
74 resulting ML value/function/datatype constructor binding in place.
75 All occurrences of @{code} with a single ML block are generated
76 simultaneously. Provides a generic and safe interface for
77 instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy
78 example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious
79 application. In future you ought refrain from ad-hoc compiling
80 generated SML code on the ML toplevel. Note that (for technical
81 reasons) @{code} cannot refer to constants for which user-defined
82 serializations are set. Refer to the corresponding ML counterpart
83 directly in that cases.
85 * Integrated image HOL-Complex with HOL. Entry points Main.thy and
86 Complex_Main.thy remain as they are.
88 * New image HOL-Plain provides a minimal HOL with the most important
89 tools available (inductive, datatype, primrec, ...). By convention
90 the corresponding theory Plain should be ancestor of every further
91 (library) theory. Some library theories now have ancestor Plain
92 (instead of Main), thus theory Main occasionally has to be imported
95 * Methods "case_tac" and "induct_tac" now refer to the very same rules
96 as the structured Isar versions "cases" and "induct", cf. the
97 corresponding "cases" and "induct" attributes. Mutual induction rules
98 are now presented as a list of individual projections
99 (e.g. foo_bar.inducts for types foo and bar); the old format with
100 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
101 rare situations a different rule is selected --- notably nested tuple
102 elimination instead of former prod.exhaust: use explicit (case_tac t
103 rule: prod.exhaust) here.
105 * Attributes "cases", "induct", "coinduct" support "del" option.
107 * Removed fact "case_split_thm", which duplicates "case_split".
109 * Command 'rep_datatype': instead of theorem names the command now
110 takes a list of terms denoting the constructors of the type to be
111 represented as datatype. The characteristic theorems have to be
112 proven. INCOMPATIBILITY. Also observe that the following theorems
113 have disappeared in favour of existing ones:
115 unit_induct ~> unit.induct
116 prod_induct ~> prod.induct
117 sum_induct ~> sum.induct
118 Suc_Suc_eq ~> nat.inject
119 Suc_not_Zero Zero_not_Suc ~> nat.distinct
121 * Library/Nat_Infinity: added addition, numeral syntax and more
122 instantiations for algebraic structures. Removed some duplicate
123 theorems. Changes in simp rules. INCOMPATIBILITY.
128 * Units_l_inv and Units_r_inv are now simprules by default.
129 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
130 and/or r_inv will now also require deletion of these lemmas.
132 * Renamed the following theorems. INCOMPATIBILITY.
135 least_carrier ~> least_closed
136 greatest_carrier ~> greatest_closed
137 greatest_Lower_above ~> greatest_Lower_below
139 * New theory of factorial domains.
144 * Created new image HOL-NSA, containing theories of nonstandard
145 analysis which were previously part of HOL-Complex. Entry point
146 Hyperreal.thy remains valid, but theories formerly using
147 Complex_Main.thy should now use new entry point Hypercomplex.thy.
152 * Rules and tactics that read instantiations (read_instantiate,
153 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
154 context, which is required for parsing and type-checking. Moreover,
155 the variables are specified as plain indexnames, not string encodings
156 thereof. INCOMPATIBILITY.
158 * Disposed old type and term read functions (Sign.read_def_typ,
159 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
160 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
161 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
162 Syntax.read_term_global etc.; see also OldGoals.read_term as last
163 resort for legacy applications.
165 * Antiquotations: block-structured compilation context indicated by
166 \<lbrace> ... \<rbrace>; additional antiquotation forms:
168 @{let ?pat = term} - term abbreviation (HO matching)
169 @{note name = fact} - fact abbreviation
170 @{thm fact} - singleton fact (with attributes)
171 @{thms fact} - general fact (with attributes)
172 @{lemma prop by method} - singleton goal
173 @{lemma prop by meth1 meth2} - singleton goal
174 @{lemma prop1 ... propN by method} - general goal
175 @{lemma prop1 ... propN by meth1 meth2} - general goal
176 @{lemma (open) ...} - open derivation
180 New in Isabelle2008 (June 2008)
181 -------------------------------
185 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
186 and updated, with formally checked references as hyperlinks.
188 * Theory loader: use_thy (and similar operations) no longer set the
189 implicit ML context, which was occasionally hard to predict and in
190 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
191 provides a proper context already.
193 * Theory loader: old-style ML proof scripts being *attached* to a thy
194 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
195 'use' within a theory file will do the job.
197 * Name space merge now observes canonical order, i.e. the second space
198 is inserted into the first one, while existing entries in the first
199 space take precedence. INCOMPATIBILITY in rare situations, may try to
202 * Syntax: symbol \<chi> is now considered a letter. Potential
203 INCOMPATIBILITY in identifier syntax etc.
205 * Outer syntax: string tokens no longer admit escaped white space,
206 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
207 white space without escapes.
209 * Outer syntax: string tokens may contain arbitrary character codes
210 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
216 * Context-dependent token translations. Default setup reverts locally
217 fixed variables, and adds hilite markup for undeclared frees.
219 * Unused theorems can be found using the new command 'unused_thms'.
220 There are three ways of invoking it:
223 Only finds unused theorems in the current theory.
225 (2) unused_thms thy_1 ... thy_n -
226 Finds unused theorems in the current theory and all of its ancestors,
227 excluding the theories thy_1 ... thy_n and all of their ancestors.
229 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
230 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
231 their ancestors, excluding the theories thy_1 ... thy_n and all of
234 In order to increase the readability of the list produced by
235 unused_thms, theorems that have been created by a particular instance
236 of a theory command such as 'inductive' or 'function' are considered
237 to belong to the same "group", meaning that if at least one theorem in
238 this group is used, the other theorems in the same group are no longer
239 reported as unused. Moreover, if all theorems in the group are
240 unused, only one theorem in the group is displayed.
242 Note that proof objects have to be switched on in order for
243 unused_thms to work properly (i.e. !proofs must be >= 1, which is
244 usually the case when using Proof General with the default settings).
246 * Authentic naming of facts disallows ad-hoc overwriting of previous
247 theorems within the same name space. INCOMPATIBILITY, need to remove
248 duplicate fact bindings, or even accidental fact duplications. Note
249 that tools may maintain dynamically scoped facts systematically, using
250 PureThy.add_thms_dynamic.
252 * Command 'hide' now allows to hide from "fact" name space as well.
254 * Eliminated destructive theorem database, simpset, claset, and
255 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
256 update of theories within ML code.
258 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
259 INCOMPATIBILITY, object-logics depending on former Pure require
260 additional setup PureThy.old_appl_syntax_setup; object-logics
261 depending on former CPure need to refer to Pure.
263 * Commands 'use' and 'ML' are now purely functional, operating on
264 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
265 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
268 * Command 'setup': discontinued implicit version with ML reference.
270 * Instantiation target allows for simultaneous specification of class
271 instance operations together with an instantiation proof.
272 Type-checking phase allows to refer to class operations uniformly.
273 See src/HOL/Complex/Complex.thy for an Isar example and
274 src/HOL/Library/Eval.thy for an ML example.
276 * Indexing of literal facts: be more serious about including only
277 facts from the visible specification/proof context, but not the
278 background context (locale etc.). Affects `prop` notation and method
279 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
282 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
283 "(open)" option, which used to expose internal bound variables to the
286 * Isar statements: removed obsolete case "rule_context".
287 INCOMPATIBILITY, better use explicit fixes/assumes.
289 * Locale proofs: default proof step now includes 'unfold_locales';
290 hence 'proof' without argument may be used to unfold locale
294 *** Document preparation ***
296 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
297 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
298 obsolete thumbpdf setup (contemporary PDF viewers do this on the
299 spot); renamed link color from "darkblue" to "linkcolor" (default
300 value unchanged, can be redefined via \definecolor); no longer sets
301 "a4paper" option (unnecessary or even intrusive).
303 * Antiquotation @{lemma A method} proves proposition A by the given
304 method (either a method name or a method name plus (optional) method
305 arguments in parentheses) and prints A just like @{prop A}.
310 * New primrec package. Specification syntax conforms in style to
311 definition/function/.... No separate induction rule is provided. The
312 "primrec" command distinguishes old-style and new-style specifications
313 by syntax. The former primrec package is now named OldPrimrecPackage.
314 When adjusting theories, beware: constants stemming from new-style
315 primrec specifications have authentic syntax.
317 * Metis prover is now an order of magnitude faster, and also works
320 * Metis: the maximum number of clauses that can be produced from a
321 theorem is now given by the attribute max_clauses. Theorems that
322 exceed this number are ignored, with a warning printed.
324 * Sledgehammer no longer produces structured proofs by default. To
325 enable, declare [[sledgehammer_full = true]]. Attributes
326 reconstruction_modulus, reconstruction_sorts renamed
327 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
329 * Method "induct_scheme" derives user-specified induction rules
330 from well-founded induction and completeness of patterns. This factors
331 out some operations that are done internally by the function package
332 and makes them available separately. See
333 src/HOL/ex/Induction_Scheme.thy for examples.
335 * More flexible generation of measure functions for termination
336 proofs: Measure functions can be declared by proving a rule of the
337 form "is_measure f" and giving it the [measure_function] attribute.
338 The "is_measure" predicate is logically meaningless (always true), and
339 just guides the heuristic. To find suitable measure functions, the
340 termination prover sets up the goal "is_measure ?f" of the appropriate
341 type and generates all solutions by prolog-style backwards proof using
344 This setup also deals with rules like
346 "is_measure f ==> is_measure (list_size f)"
348 which accommodates nested datatypes that recurse through lists.
349 Similar rules are predeclared for products and option types.
351 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
355 - Definitions of overloaded constants on sets have to be replaced by
356 definitions on => and bool.
358 - Some definitions of overloaded operators on sets can now be proved
359 using the definitions of the operators on => and bool. Therefore,
360 the following theorems have been renamed:
362 subset_def -> subset_eq
363 psubset_def -> psubset_eq
364 set_diff_def -> set_diff_eq
365 Compl_def -> Compl_eq
366 Sup_set_def -> Sup_set_eq
367 Inf_set_def -> Inf_set_eq
368 sup_set_def -> sup_set_eq
369 inf_set_def -> inf_set_eq
371 - Due to the incompleteness of the HO unification algorithm, some
372 rules such as subst may require manual instantiation, if some of
373 the unknowns in the rule is a set.
375 - Higher order unification and forward proofs:
378 have "P (S::'a set)" <...>
379 then have "EX S. P S" ..
381 no longer works (due to the incompleteness of the HO unification
382 algorithm) and must be replaced by the pattern
389 - Calculational reasoning with subst (or similar rules):
392 have "P (S::'a set)" <...>
393 also have "S = T" <...>
396 no longer works (for similar reasons as the previous example) and
397 must be replaced by something like
399 have "P (S::'a set)" <...>
400 moreover have "S = T" <...>
401 ultimately have "P T" by simp
403 - Tactics or packages written in ML code:
404 Code performing pattern matching on types via
406 Type ("set", [T]) => ...
408 must be rewritten. Moreover, functions like strip_type or
409 binder_types no longer return the right value when applied to a
412 T1 => ... => Tn => U => bool
416 T1 => ... => Tn => U set
418 * Merged theories Wellfounded_Recursion, Accessible_Part and
419 Wellfounded_Relations to theory Wellfounded.
421 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
423 * Class finite no longer treats UNIV as class parameter. Use class
424 enum from theory Library/Enum instead to achieve a similar effect.
427 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
428 and "Cons". INCOMPATIBILITY.
430 * HOL (and FOL): renamed variables in rules imp_elim and swap.
431 Potential INCOMPATIBILITY.
433 * Theory Product_Type: duplicated lemmas split_Pair_apply and
434 injective_fst_snd removed, use split_eta and prod_eqI instead.
435 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
437 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
438 the same name in theory Orderings:
448 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
449 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
450 and different variable names.
452 * Library/Option_ord.thy: Canonical order on option type.
454 * Library/RBT.thy: Red-black trees, an efficient implementation of
457 * Library/Countable.thy: Type class for countable types.
459 * Theory Int: The representation of numerals has changed. The infix
460 operator BIT and the bit datatype with constructors B0 and B1 have
461 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
462 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
463 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
466 * Theory Nat: definition of <= and < on natural numbers no longer
467 depend on well-founded relations. INCOMPATIBILITY. Definitions
468 le_def and less_def have disappeared. Consider lemmas not_less
469 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
471 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
472 (whose purpose mainly is for various fold_set functionals) have been
473 abandoned in favor of the existing algebraic classes
474 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
475 lower_semilattice (resp. upper_semilattice) and linorder.
478 * Theory Transitive_Closure: induct and cases rules now declare proper
479 case_names ("base" and "step"). INCOMPATIBILITY.
481 * Theorem Inductive.lfp_ordinal_induct generalized to complete
482 lattices. The form set-specific version is available as
483 Inductive.lfp_ordinal_induct_set.
485 * Renamed theorems "power.simps" to "power_int.simps".
488 * Class semiring_div provides basic abstract properties of semirings
489 with division and modulo operations. Subsumes former class dvd_mod.
491 * Merged theories IntDef, Numeral and IntArith into unified theory
492 Int. INCOMPATIBILITY.
494 * Theory Library/Code_Index: type "index" now represents natural
495 numbers rather than integers. INCOMPATIBILITY.
497 * New class "uminus" with operation "uminus" (split of from class
498 "minus" which now only has operation "minus", binary).
501 * Constants "card", "internal_split", "option_map" now with authentic
502 syntax. INCOMPATIBILITY.
504 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
505 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
506 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
507 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
508 Sup_set_def, le_def, less_def, option_map_def now with object
509 equality. INCOMPATIBILITY.
511 * Records. Removed K_record, and replaced it by pure lambda term
512 %x. c. The simplifier setup is now more robust against eta expansion.
513 INCOMPATIBILITY: in cases explicitly referring to K_record.
515 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
517 * Library/ListVector: new theory of arithmetic vector operations.
519 * Library/Order_Relation: new theory of various orderings as sets of
520 pairs. Defines preorders, partial orders, linear orders and
521 well-orders on sets and on types.
526 * Renamed some theories to allow to loading both ZF and HOL in the
529 Datatype -> Datatype_ZF
530 Inductive -> Inductive_ZF
537 INCOMPATIBILITY: ZF theories that import individual theories below
538 Main might need to be adapted. Regular theory Main is still
539 available, as trivial extension of Main_ZF.
544 * ML within Isar: antiquotation @{const name} or @{const
545 name(typargs)} produces statically-checked Const term.
547 * Functor NamedThmsFun: data is available to the user as dynamic fact
548 (of the same name). Removed obsolete print command.
550 * Removed obsolete "use_legacy_bindings" function.
552 * The ``print mode'' is now a thread-local value derived from a global
553 template (the former print_mode reference), thus access becomes
554 non-critical. The global print_mode reference is for session
555 management only; user-code should use print_mode_value,
556 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
558 * Functions system/system_out provide a robust way to invoke external
559 shell commands, with propagation of interrupts (requires Poly/ML 5.2).
560 Do not use OS.Process.system etc. from the basis library!
565 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
566 in accordance with Proof General 3.7, which prefers GNU emacs.
568 * isatool tty runs Isabelle process with plain tty interaction;
569 optional line editor may be specified via ISABELLE_LINE_EDITOR
570 setting, the default settings attempt to locate "ledit" and "rlwrap".
572 * isatool browser now works with Cygwin as well, using general
573 "javapath" function defined in Isabelle process environment.
575 * YXML notation provides a simple and efficient alternative to
576 standard XML transfer syntax. See src/Pure/General/yxml.ML and
577 isatool yxml as described in the Isabelle system manual.
579 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
580 provides general wrapper for managing an Isabelle process in a robust
581 fashion, with ``cooked'' output from stdin/stderr.
583 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
584 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
586 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
587 way of changing the user's settings is via
588 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
591 * Multithreading.max_threads := 0 refers to the number of actual CPU
592 cores of the underlying machine, which is a good starting point for
593 optimal performance tuning. The corresponding usedir option -M allows
594 "max" as an alias for "0". WARNING: does not work on certain versions
595 of Mac OS (with Poly/ML 5.1).
597 * isabelle-process: non-ML sessions are run with "nice", to reduce the
598 adverse effect of Isabelle flooding interactive front-ends (notably
599 ProofGeneral / XEmacs).
603 New in Isabelle2007 (November 2007)
604 -----------------------------------
608 * More uniform information about legacy features, notably a
609 warning/error of "Legacy feature: ...", depending on the state of the
610 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
611 legacy features will disappear eventually.
613 * Theory syntax: the header format ``theory A = B + C:'' has been
614 discontinued in favour of ``theory A imports B C begin''. Use isatool
615 fixheaders to convert existing theory files. INCOMPATIBILITY.
617 * Theory syntax: the old non-Isar theory file format has been
618 discontinued altogether. Note that ML proof scripts may still be used
619 with Isar theories; migration is usually quite simple with the ML
620 function use_legacy_bindings. INCOMPATIBILITY.
622 * Theory syntax: some popular names (e.g. 'class', 'declaration',
623 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
626 * Theory loader: be more serious about observing the static theory
627 header specifications (including optional directories), but not the
628 accidental file locations of previously successful loads. The strict
629 update policy of former update_thy is now already performed by
630 use_thy, so the former has been removed; use_thys updates several
631 theories simultaneously, just as 'imports' within a theory header
632 specification, but without merging the results. Potential
633 INCOMPATIBILITY: may need to refine theory headers and commands
634 ROOT.ML which depend on load order.
636 * Theory loader: optional support for content-based file
637 identification, instead of the traditional scheme of full physical
638 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
639 (cf. the system manual). The new scheme allows to work with
640 non-finished theories in persistent session images, such that source
641 files may be moved later on without requiring reloads.
643 * Theory loader: old-style ML proof scripts being *attached* to a thy
644 file (with the same base name as the theory) are considered a legacy
645 feature, which will disappear eventually. Even now, the theory loader
646 no longer maintains dependencies on such files.
648 * Syntax: the scope for resolving ambiguities via type-inference is
649 now limited to individual terms, instead of whole simultaneous
650 specifications as before. This greatly reduces the complexity of the
651 syntax module and improves flexibility by separating parsing and
652 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
653 'fixes' etc.) are required in rare situations.
655 * Syntax: constants introduced by new-style packages ('definition',
656 'abbreviation' etc.) are passed through the syntax module in
657 ``authentic mode''. This means that associated mixfix annotations
658 really stick to such constants, independently of potential name space
659 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
660 trees are represented slightly differently, may need to adapt syntax
661 translations accordingly. Use CONST marker in 'translations' and
662 @{const_syntax} antiquotation in 'parse_translation' etc.
664 * Legacy goal package: reduced interface to the bare minimum required
665 to keep existing proof scripts running. Most other user-level
666 functions are now part of the OldGoals structure, which is *not* open
667 by default (consider isatool expandshort before open OldGoals).
668 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
669 these tend to cause confusion about the actual goal (!) context being
670 used here, which is not necessarily the same as the_context().
672 * Command 'find_theorems': supports "*" wild-card in "name:"
673 criterion; "with_dups" option. Certain ProofGeneral versions might
674 support a specific search form (see ProofGeneral/CHANGES).
676 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
677 by default, which means that "prems" (and also "fixed variables") are
678 suppressed from proof state output. Note that the ProofGeneral
679 settings mechanism allows to change and save options persistently, but
680 older versions of Isabelle will fail to start up if a negative prems
683 * Local theory targets may be specified by non-nested blocks of
684 ``context/locale/class ... begin'' followed by ``end''. The body may
685 contain definitions, theorems etc., including any derived mechanism
686 that has been implemented on top of these primitives. This concept
687 generalizes the existing ``theorem (in ...)'' towards more versatility
690 * Proof General interface: proper undo of final 'end' command;
691 discontinued Isabelle/classic mode (ML proof scripts).
694 *** Document preparation ***
696 * Added antiquotation @{theory name} which prints the given name,
697 after checking that it refers to a valid ancestor theory in the
700 * Added antiquotations @{ML_type text} and @{ML_struct text} which
701 check the given source text as ML type/structure, printing verbatim.
703 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
704 "c args == rhs" given in the current context. (Any number of
705 arguments may be given on the LHS.)
710 * The 'class' package offers a combination of axclass and locale to
711 achieve Haskell-like type classes in Isabelle. Definitions and
712 theorems within a class context produce both relative results (with
713 implicit parameters according to the locale context), and polymorphic
714 constants with qualified polymorphism (according to the class
715 context). Within the body context of a 'class' target, a separate
716 syntax layer ("user space type system") takes care of converting
717 between global polymorphic consts and internal locale representation.
718 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
719 "isatool doc classes" provides a tutorial.
721 * Generic code generator framework allows to generate executable
722 code for ML and Haskell (including Isabelle classes). A short usage
725 internal compilation:
726 export_code <list of constants (term syntax)> in SML
727 writing SML code to a file:
728 export_code <list of constants (term syntax)> in SML <filename>
729 writing OCaml code to a file:
730 export_code <list of constants (term syntax)> in OCaml <filename>
731 writing Haskell code to a bunch of files:
732 export_code <list of constants (term syntax)> in Haskell <filename>
734 evaluating closed propositions to True/False using code generation:
737 Reasonable default setup of framework in HOL.
739 Theorem attributs for selecting and transforming function equations theorems:
741 [code fun]: select a theorem as function equation for a specific constant
742 [code fun del]: deselect a theorem as function equation for a specific constant
743 [code inline]: select an equation theorem for unfolding (inlining) in place
744 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
746 User-defined serializations (target in {SML, OCaml, Haskell}):
748 code_const <and-list of constants (term syntax)>
749 {(target) <and-list of const target syntax>}+
751 code_type <and-list of type constructors>
752 {(target) <and-list of type target syntax>}+
754 code_instance <and-list of instances>
756 where instance ::= <type constructor> :: <class>
758 code_class <and_list of classes>
759 {(target) <and-list of class target syntax>}+
760 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
762 code_instance and code_class only are effective to target Haskell.
764 For example usage see src/HOL/ex/Codegenerator.thy and
765 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
766 generation from Isabelle/HOL theories is available via "isatool doc
769 * Code generator: consts in 'consts_code' Isar commands are now
770 referred to by usual term syntax (including optional type
773 * Command 'no_translations' removes translation rules from theory
776 * Overloaded definitions are now actually checked for acyclic
777 dependencies. The overloading scheme is slightly more general than
778 that of Haskell98, although Isabelle does not demand an exact
779 correspondence to type class and instance declarations.
780 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
781 exotic versions of overloading -- at the discretion of the user!
783 Polymorphic constants are represented via type arguments, i.e. the
784 instantiation that matches an instance against the most general
785 declaration given in the signature. For example, with the declaration
786 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
787 as c(nat). Overloading is essentially simultaneous structural
788 recursion over such type arguments. Incomplete specification patterns
789 impose global constraints on all occurrences, e.g. c('a * 'a) on the
790 LHS means that more general c('a * 'b) will be disallowed on any RHS.
791 Command 'print_theory' outputs the normalized system of recursive
792 equations, see section "definitions".
794 * Configuration options are maintained within the theory or proof
795 context (with name and type bool/int/string), providing a very simple
796 interface to a poor-man's version of general context data. Tools may
797 declare options in ML (e.g. using Attrib.config_int) and then refer to
798 these values using Config.get etc. Users may change options via an
799 associated attribute of the same name. This form of context
800 declaration works particularly well with commands 'declare' or
801 'using', for example ``declare [[foo = 42]]''. Thus it has become
802 very easy to avoid global references, which would not observe Isar
803 toplevel undo/redo and fail to work with multithreading.
805 Various global ML references of Pure and HOL have been turned into
806 configuration options:
808 Unify.search_bound unify_search_bound
809 Unify.trace_bound unify_trace_bound
810 Unify.trace_simp unify_trace_simp
811 Unify.trace_types unify_trace_types
812 Simplifier.simp_depth_limit simp_depth_limit
813 Blast.depth_limit blast_depth_limit
814 DatatypeProp.dtK datatype_distinctness_limit
815 fast_arith_neq_limit fast_arith_neq_limit
816 fast_arith_split_limit fast_arith_split_limit
818 * Named collections of theorems may be easily installed as context
819 data using the functor NamedThmsFun (see also
820 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
821 attributes; there is also a toplevel print command. This facility is
822 just a common case of general context data, which is the preferred way
823 for anything more complex than just a list of facts in canonical
826 * Isar: command 'declaration' augments a local theory by generic
827 declaration functions written in ML. This enables arbitrary content
828 being added to the context, depending on a morphism that tells the
829 difference of the original declaration context wrt. the application
830 context encountered later on.
832 * Isar: proper interfaces for simplification procedures. Command
833 'simproc_setup' declares named simprocs (with match patterns, and body
834 text in ML). Attribute "simproc" adds/deletes simprocs in the current
835 context. ML antiquotation @{simproc name} retrieves named simprocs.
837 * Isar: an extra pair of brackets around attribute declarations
838 abbreviates a theorem reference involving an internal dummy fact,
839 which will be ignored later --- only the effect of the attribute on
840 the background context will persist. This form of in-place
841 declarations is particularly useful with commands like 'declare' and
842 'using', for example ``have A using [[simproc a]] by simp''.
844 * Isar: method "assumption" (and implicit closing of subproofs) now
845 takes simple non-atomic goal assumptions into account: after applying
846 an assumption as a rule the resulting subgoals are solved by atomic
847 assumption steps. This is particularly useful to finish 'obtain'
848 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
849 without referring to the original premise "!!x. P x ==> thesis" in the
850 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
853 * Isar: implicit use of prems from the Isar proof context is
854 considered a legacy feature. Common applications like ``have A .''
855 may be replaced by ``have A by fact'' or ``note `A`''. In general,
856 referencing facts explicitly here improves readability and
857 maintainability of proof texts.
859 * Isar: improper proof element 'guess' is like 'obtain', but derives
860 the obtained context from the course of reasoning! For example:
862 assume "EX x y. A x & B y" -- "any previous fact"
863 then guess x and y by clarify
865 This technique is potentially adventurous, depending on the facts and
866 proof tools being involved here.
868 * Isar: known facts from the proof context may be specified as literal
869 propositions, using ASCII back-quote syntax. This works wherever
870 named facts used to be allowed so far, in proof commands, proof
871 methods, attributes etc. Literal facts are retrieved from the context
872 according to unification of type and term parameters. For example,
873 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
874 theorems in the current context, then these are valid literal facts:
875 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
877 There is also a proof method "fact" which does the same composition
878 for explicit goal states, e.g. the following proof texts coincide with
879 certain special cases of literal facts:
881 have "A" by fact == note `A`
882 have "A ==> B" by fact == note `A ==> B`
883 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
884 have "P a ==> Q a" by fact == note `P a ==> Q a`
886 * Isar: ":" (colon) is no longer a symbolic identifier character in
887 outer syntax. Thus symbolic identifiers may be used without
888 additional white space in declarations like this: ``assume *: A''.
890 * Isar: 'print_facts' prints all local facts of the current context,
891 both named and unnamed ones.
893 * Isar: 'def' now admits simultaneous definitions, e.g.:
895 def x == "t" and y == "u"
897 * Isar: added command 'unfolding', which is structurally similar to
898 'using', but affects both the goal state and facts by unfolding given
899 rewrite rules. Thus many occurrences of the 'unfold' method or
900 'unfolded' attribute may be replaced by first-class proof text.
902 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
903 and command 'unfolding' now all support object-level equalities
904 (potentially conditional). The underlying notion of rewrite rule is
905 analogous to the 'rule_format' attribute, but *not* that of the
906 Simplifier (which is usually more generous).
908 * Isar: the new attribute [rotated n] (default n = 1) rotates the
909 premises of a theorem by n. Useful in conjunction with drule.
911 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
912 method expression within a sandbox consisting of the first N
913 sub-goals, which need to exist. For example, ``simp_all [3]''
914 simplifies the first three sub-goals, while (rule foo, simp_all)[]
915 simplifies all new goals that emerge from applying rule foo to the
916 originally first one.
918 * Isar: schematic goals are no longer restricted to higher-order
919 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
922 * Isar: the conclusion of a long theorem statement is now either
923 'shows' (a simultaneous conjunction, as before), or 'obtains'
924 (essentially a disjunction of cases with local parameters and
925 assumptions). The latter allows to express general elimination rules
926 adequately; in this notation common elimination rules look like this:
928 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
930 obtains x where "P x"
932 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
936 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
942 The subsequent classical rules even refer to the formal "thesis"
945 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
948 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
949 obtains "thesis ==> something"
951 The actual proof of an 'obtains' statement is analogous to that of the
952 Isar proof element 'obtain', only that there may be several cases.
953 Optional case names may be specified in parentheses; these will be
954 available both in the present proof and as annotations in the
955 resulting rule, for later use with the 'cases' method (cf. attribute
958 * Isar: the assumptions of a long theorem statement are available as
959 "assms" fact in the proof context. This is more appropriate than the
960 (historical) "prems", which refers to all assumptions of the current
961 context, including those from the target locale, proof body etc.
963 * Isar: 'print_statement' prints theorems from the current theory or
964 proof context in long statement form, according to the syntax of a
967 * Isar: 'obtain' takes an optional case name for the local context
968 introduction rule (default "that").
970 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
971 explicit (is "_ ==> ?foo") in the rare cases where this still happens
974 * Pure: syntax "CONST name" produces a fully internalized constant
975 according to the current context. This is particularly useful for
976 syntax translations that should refer to internal constant
977 representations independently of name spaces.
979 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
980 instead of "FOO ". This allows multiple binder declarations to coexist
981 in the same context. INCOMPATIBILITY.
983 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
984 primitive that also works in a locale context (both for constants and
985 fixed variables). Type declaration and internal syntactic representation
986 of given constants retrieved from the context. Likewise, the
987 'no_notation' command allows to remove given syntax annotations from the
990 * Isar/locales: new derived specification elements 'axiomatization',
991 'definition', 'abbreviation', which support type-inference, admit
992 object-level specifications (equality, equivalence). See also the
993 isar-ref manual. Examples:
996 eq (infix "===" 50) where
997 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
999 definition "f x y = x + y + 1"
1000 definition g where "g x = f x x"
1003 neq (infix "=!=" 50) where
1004 "x =!= y == ~ (x === y)"
1006 These specifications may be also used in a locale context. Then the
1007 constants being introduced depend on certain fixed parameters, and the
1008 constant name is qualified by the locale base name. An internal
1009 abbreviation takes care for convenient input and output, making the
1010 parameters implicit and using the original short name. See also
1011 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
1012 entities from a monomorphic theory.
1014 Presently, abbreviations are only available 'in' a target locale, but
1015 not inherited by general import expressions. Also note that
1016 'abbreviation' may be used as a type-safe replacement for 'syntax' +
1017 'translations' in common applications. The "no_abbrevs" print mode
1018 prevents folding of abbreviations in term output.
1020 Concrete syntax is attached to specified constants in internal form,
1021 independently of name spaces. The parse tree representation is
1022 slightly different -- use 'notation' instead of raw 'syntax', and
1023 'translations' with explicit "CONST" markup to accommodate this.
1025 * Pure/Isar: unified syntax for new-style specification mechanisms
1026 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
1027 full type inference and dummy patterns ("_"). For example:
1029 definition "K x _ = x"
1031 inductive conj for A B
1032 where "A ==> B ==> conj A B"
1034 * Pure: command 'print_abbrevs' prints all constant abbreviations of
1035 the current context. Print mode "no_abbrevs" prevents inversion of
1036 abbreviations on output.
1038 * Isar/locales: improved parameter handling: use of locales "var" and
1039 "struct" no longer necessary; - parameter renamings are no longer
1040 required to be injective. For example, this allows to define
1041 endomorphisms as locale endom = homom mult mult h.
1043 * Isar/locales: changed the way locales with predicates are defined.
1044 Instead of accumulating the specification, the imported expression is
1045 now an interpretation. INCOMPATIBILITY: different normal form of
1046 locale expressions. In particular, in interpretations of locales with
1047 predicates, goals repesenting already interpreted fragments are not
1048 removed automatically. Use methods `intro_locales' and
1049 `unfold_locales'; see below.
1051 * Isar/locales: new methods `intro_locales' and `unfold_locales'
1052 provide backward reasoning on locales predicates. The methods are
1053 aware of interpretations and discharge corresponding goals.
1054 `intro_locales' is less aggressive then `unfold_locales' and does not
1055 unfold predicates to assumptions.
1057 * Isar/locales: the order in which locale fragments are accumulated
1058 has changed. This enables to override declarations from fragments due
1059 to interpretations -- for example, unwanted simp rules.
1061 * Isar/locales: interpretation in theories and proof contexts has been
1062 extended. One may now specify (and prove) equations, which are
1063 unfolded in interpreted theorems. This is useful for replacing
1064 defined concepts (constants depending on locale parameters) by
1065 concepts already existing in the target context. Example:
1067 interpretation partial_order ["op <= :: [int, int] => bool"]
1068 where "partial_order.less (op <=) (x::int) y = (x < y)"
1070 Typically, the constant `partial_order.less' is created by a
1071 definition specification element in the context of locale
1074 * Method "induct": improved internal context management to support
1075 local fixes and defines on-the-fly. Thus explicit meta-level
1076 connectives !! and ==> are rarely required anymore in inductive goals
1077 (using object-logic connectives for this purpose has been long
1078 obsolete anyway). Common proof patterns are explained in
1079 src/HOL/Induct/Common_Patterns.thy, see also
1080 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
1083 * Method "induct": improved handling of simultaneous goals. Instead of
1084 introducing object-level conjunction, the statement is now split into
1085 several conclusions, while the corresponding symbolic cases are nested
1086 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
1087 see src/HOL/Induct/Common_Patterns.thy, for example.
1089 * Method "induct": mutual induction rules are now specified as a list
1090 of rule sharing the same induction cases. HOL packages usually provide
1091 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
1092 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
1093 mutual induction rules differently, i.e. like this:
1095 (induct rule: foo_bar.inducts)
1096 (induct set: foo bar)
1097 (induct pred: foo bar)
1098 (induct type: foo bar)
1100 The ML function ProjectRule.projections turns old-style rules into the
1103 * Method "coinduct": dual of induction, see
1104 src/HOL/Library/Coinductive_List.thy for various examples.
1106 * Method "cases", "induct", "coinduct": the ``(open)'' option is
1107 considered a legacy feature.
1109 * Attribute "symmetric" produces result with standardized schematic
1110 variables (index 0). Potential INCOMPATIBILITY.
1112 * Simplifier: by default the simplifier trace only shows top level
1113 rewrites now. That is, trace_simp_depth_limit is set to 1 by
1114 default. Thus there is less danger of being flooded by the trace. The
1115 trace indicates where parts have been suppressed.
1117 * Provers/classical: removed obsolete classical version of elim_format
1118 attribute; classical elim/dest rules are now treated uniformly when
1119 manipulating the claset.
1121 * Provers/classical: stricter checks to ensure that supplied intro,
1122 dest and elim rules are well-formed; dest and elim rules must have at
1125 * Provers/classical: attributes dest/elim/intro take an optional
1126 weight argument for the rule (just as the Pure versions). Weights are
1127 ignored by automated tools, but determine the search order of single
1130 * Syntax: input syntax now supports dummy variable binding "%_. b",
1131 where the body does not mention the bound variable. Note that dummy
1132 patterns implicitly depend on their context of bounds, which makes
1133 "{_. _}" match any set comprehension as expected. Potential
1134 INCOMPATIBILITY -- parse translations need to cope with syntactic
1135 constant "_idtdummy" in the binding position.
1137 * Syntax: removed obsolete syntactic constant "_K" and its associated
1138 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
1139 for example "A -> B" => "Pi A (%_. B)".
1141 * Pure: 'class_deps' command visualizes the subclass relation, using
1142 the graph browser tool.
1144 * Pure: 'print_theory' now suppresses certain internal declarations by
1145 default; use '!' option for full details.
1150 * Method "metis" proves goals by applying the Metis general-purpose
1151 resolution prover (see also http://gilith.com/software/metis/).
1152 Examples are in the directory MetisExamples. WARNING: the
1153 Isabelle/HOL-Metis integration does not yet work properly with
1156 * Command 'sledgehammer' invokes external automatic theorem provers as
1157 background processes. It generates calls to the "metis" method if
1158 successful. These can be pasted into the proof. Users do not have to
1159 wait for the automatic provers to return. WARNING: does not really
1160 work with multi-threading.
1162 * New "auto_quickcheck" feature tests outermost goal statements for
1163 potential counter-examples. Controlled by ML references
1164 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
1165 5000 milliseconds). Fails silently if statements is outside of
1166 executable fragment, or any other codgenerator problem occurs.
1168 * New constant "undefined" with axiom "undefined x = undefined".
1170 * Added class "HOL.eq", allowing for code generation with polymorphic
1173 * Some renaming of class constants due to canonical name prefixing in
1174 the new 'class' package:
1176 HOL.abs ~> HOL.abs_class.abs
1177 HOL.divide ~> HOL.divide_class.divide
1178 0 ~> HOL.zero_class.zero
1179 1 ~> HOL.one_class.one
1180 op + ~> HOL.plus_class.plus
1181 op - ~> HOL.minus_class.minus
1182 uminus ~> HOL.minus_class.uminus
1183 op * ~> HOL.times_class.times
1184 op < ~> HOL.ord_class.less
1185 op <= > HOL.ord_class.less_eq
1186 Nat.power ~> Power.power_class.power
1187 Nat.size ~> Nat.size_class.size
1188 Numeral.number_of ~> Numeral.number_class.number_of
1189 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
1190 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
1191 Orderings.min ~> Orderings.ord_class.min
1192 Orderings.max ~> Orderings.ord_class.max
1193 Divides.op div ~> Divides.div_class.div
1194 Divides.op mod ~> Divides.div_class.mod
1195 Divides.op dvd ~> Divides.div_class.dvd
1197 INCOMPATIBILITY. Adaptions may be required in the following cases:
1199 a) User-defined constants using any of the names "plus", "minus",
1200 "times", "less" or "less_eq". The standard syntax translations for
1201 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
1204 b) Variables named "plus", "minus", "times", "less", "less_eq"
1205 INCOMPATIBILITY: use more specific names.
1207 c) Permutative equations (e.g. "a + b = b + a")
1208 Since the change of names also changes the order of terms, permutative
1209 rewrite rules may get applied in a different order. Experience shows
1210 that this is rarely the case (only two adaptions in the whole Isabelle
1211 distribution). INCOMPATIBILITY: rewrite proofs
1213 d) ML code directly refering to constant names
1214 This in general only affects hand-written proof tactics, simprocs and
1215 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
1216 Consider using @{const_name} antiquotation.
1218 * New class "default" with associated constant "default".
1220 * Function "sgn" is now overloaded and available on int, real, complex
1221 (and other numeric types), using class "sgn". Two possible defs of
1222 sgn are given as equational assumptions in the classes sgn_if and
1223 sgn_div_norm; ordered_idom now also inherits from sgn_if.
1226 * Locale "partial_order" now unified with class "order" (cf. theory
1227 Orderings), added parameter "less". INCOMPATIBILITY.
1229 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
1230 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
1231 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
1233 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
1234 changed order of proof goals in instance proofs.
1236 * The transitivity reasoner for partial and linear orders is set up
1237 for classes "order" and "linorder". Instances of the reasoner are available
1238 in all contexts importing or interpreting the corresponding locales.
1239 Method "order" invokes the reasoner separately; the reasoner
1240 is also integrated with the Simplifier as a solver. Diagnostic
1241 command 'print_orders' shows the available instances of the reasoner
1242 in the current context.
1244 * Localized monotonicity predicate in theory "Orderings"; integrated
1245 lemmas max_of_mono and min_of_mono with this predicate.
1248 * Formulation of theorem "dense" changed slightly due to integration
1249 with new class dense_linear_order.
1251 * Uniform lattice theory development in HOL.
1253 constants "meet" and "join" now named "inf" and "sup"
1254 constant "Meet" now named "Inf"
1256 classes "meet_semilorder" and "join_semilorder" now named
1257 "lower_semilattice" and "upper_semilattice"
1258 class "lorder" now named "lattice"
1259 class "comp_lat" now named "complete_lattice"
1261 Instantiation of lattice classes allows explicit definitions
1262 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
1264 INCOMPATIBILITY. Theorem renames:
1266 meet_left_le ~> inf_le1
1267 meet_right_le ~> inf_le2
1268 join_left_le ~> sup_ge1
1269 join_right_le ~> sup_ge2
1270 meet_join_le ~> inf_sup_ord
1273 le_meet ~> le_inf_iff
1274 le_join ~> ge_sup_conv
1275 meet_idempotent ~> inf_idem
1276 join_idempotent ~> sup_idem
1277 meet_comm ~> inf_commute
1278 join_comm ~> sup_commute
1279 meet_leI1 ~> le_infI1
1280 meet_leI2 ~> le_infI2
1281 le_joinI1 ~> le_supI1
1282 le_joinI2 ~> le_supI2
1283 meet_assoc ~> inf_assoc
1284 join_assoc ~> sup_assoc
1285 meet_left_comm ~> inf_left_commute
1286 meet_left_idempotent ~> inf_left_idem
1287 join_left_comm ~> sup_left_commute
1288 join_left_idempotent ~> sup_left_idem
1291 le_def_meet ~> le_iff_inf
1292 le_def_join ~> le_iff_sup
1293 join_absorp2 ~> sup_absorb2
1294 join_absorp1 ~> sup_absorb1
1295 meet_absorp1 ~> inf_absorb1
1296 meet_absorp2 ~> inf_absorb2
1297 meet_join_absorp ~> inf_sup_absorb
1298 join_meet_absorp ~> sup_inf_absorb
1299 distrib_join_le ~> distrib_sup_le
1300 distrib_meet_le ~> distrib_inf_le
1302 add_meet_distrib_left ~> add_inf_distrib_left
1303 add_join_distrib_left ~> add_sup_distrib_left
1304 is_join_neg_meet ~> is_join_neg_inf
1305 is_meet_neg_join ~> is_meet_neg_sup
1306 add_meet_distrib_right ~> add_inf_distrib_right
1307 add_join_distrib_right ~> add_sup_distrib_right
1308 add_meet_join_distribs ~> add_sup_inf_distribs
1309 join_eq_neg_meet ~> sup_eq_neg_inf
1310 meet_eq_neg_join ~> inf_eq_neg_sup
1311 add_eq_meet_join ~> add_eq_inf_sup
1312 meet_0_imp_0 ~> inf_0_imp_0
1313 join_0_imp_0 ~> sup_0_imp_0
1314 meet_0_eq_0 ~> inf_0_eq_0
1315 join_0_eq_0 ~> sup_0_eq_0
1316 neg_meet_eq_join ~> neg_inf_eq_sup
1317 neg_join_eq_meet ~> neg_sup_eq_inf
1318 join_eq_if ~> sup_eq_if
1320 mono_meet ~> mono_inf
1321 mono_join ~> mono_sup
1322 meet_bool_eq ~> inf_bool_eq
1323 join_bool_eq ~> sup_bool_eq
1324 meet_fun_eq ~> inf_fun_eq
1325 join_fun_eq ~> sup_fun_eq
1326 meet_set_eq ~> inf_set_eq
1327 join_set_eq ~> sup_set_eq
1328 meet1_iff ~> inf1_iff
1329 meet2_iff ~> inf2_iff
1338 join1_iff ~> sup1_iff
1339 join2_iff ~> sup2_iff
1349 is_meet_Meet ~> is_meet_Inf
1350 Meet_bool_def ~> Inf_bool_def
1351 Meet_fun_def ~> Inf_fun_def
1352 Meet_greatest ~> Inf_greatest
1353 Meet_lower ~> Inf_lower
1354 Meet_set_def ~> Inf_set_def
1357 Sup_bool_eq ~> Sup_bool_def
1358 Sup_fun_eq ~> Sup_fun_def
1359 Sup_set_eq ~> Sup_set_def
1361 listsp_meetI ~> listsp_infI
1362 listsp_meet_eq ~> listsp_inf_eq
1367 * Added syntactic class "size"; overloaded constant "size" now has
1368 type "'a::size ==> bool"
1370 * Internal reorganisation of `size' of datatypes: size theorems
1371 "foo.size" are no longer subsumed by "foo.simps" (but are still
1372 simplification rules by default!); theorems "prod.size" now named
1375 * Class "div" now inherits from class "times" rather than "type".
1378 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
1379 Linorder etc. have disappeared; operations defined in terms of
1380 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
1382 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
1384 * HOL-Word: New extensive library and type for generic, fixed size
1385 machine words, with arithemtic, bit-wise, shifting and rotating
1386 operations, reflection into int, nat, and bool lists, automation for
1387 linear arithmetic (by automatic reflection into nat or int), including
1388 lemmas on overflow and monotonicity. Instantiated to all appropriate
1389 arithmetic type classes, supporting automatic simplification of
1390 numerals on all operations.
1392 * Library/Boolean_Algebra: locales for abstract boolean algebras.
1394 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
1396 * Code generator library theories:
1397 - Code_Integer represents HOL integers by big integer literals in target
1399 - Code_Char represents HOL characters by character literals in target
1401 - Code_Char_chr like Code_Char, but also offers treatment of character
1402 codes; includes Code_Integer.
1403 - Executable_Set allows to generate code for finite sets using lists.
1404 - Executable_Rat implements rational numbers as triples (sign, enumerator,
1406 - Executable_Real implements a subset of real numbers, namly those
1407 representable by rational numbers.
1408 - Efficient_Nat implements natural numbers by integers, which in general will
1409 result in higher efficency; pattern matching with 0/Suc is eliminated;
1410 includes Code_Integer.
1411 - Code_Index provides an additional datatype index which is mapped to
1412 target-language built-in integers.
1413 - Code_Message provides an additional datatype message_string which is isomorphic to
1414 strings; messages are mapped to target-language strings.
1416 * New package for inductive predicates
1418 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
1421 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1422 for z_1 :: U_1 and ... and z_n :: U_m
1424 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1427 with full support for type-inference, rather than
1429 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1431 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1432 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1434 inductive "s z_1 ... z_m"
1436 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1439 For backward compatibility, there is a wrapper allowing inductive
1440 sets to be defined with the new package via
1443 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1444 for z_1 :: U_1 and ... and z_n :: U_m
1446 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1452 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1453 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1454 for z_1 :: U_1 and ... and z_n :: U_m
1456 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1457 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1460 if the additional syntax "p ..." is required.
1462 Numerous examples can be found in the subdirectories src/HOL/Auth,
1463 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
1467 - Since declaration and definition of inductive sets or predicates
1468 is no longer separated, abbreviations involving the newly
1469 introduced sets or predicates must be specified together with the
1470 introduction rules after the 'where' keyword (see above), rather
1471 than before the actual inductive definition.
1473 - The variables in induction and elimination rules are now
1474 quantified in the order of their occurrence in the introduction
1475 rules, rather than in alphabetical order. Since this may break
1476 some proofs, these proofs either have to be repaired, e.g. by
1477 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
1478 statements of the form
1480 case (rule_i a_i_1 ... a_i_{k_i})
1482 or the old order of quantification has to be restored by explicitly adding
1483 meta-level quantifiers in the introduction rules, i.e.
1485 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
1487 - The format of the elimination rules is now
1489 p z_1 ... z_m x_1 ... x_n ==>
1490 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1495 (x_1, ..., x_n) : s z_1 ... z_m ==>
1496 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1499 for sets rather than
1501 x : s z_1 ... z_m ==>
1502 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
1505 This may require terms in goals to be expanded to n-tuples
1506 (e.g. using case_tac or simplification with the split_paired_all
1507 rule) before the above elimination rule is applicable.
1509 - The elimination or case analysis rules for (mutually) inductive
1510 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
1511 list of rules "p_1_..._p_k.elims" is no longer available.
1513 * New package "function"/"fun" for general recursive functions,
1514 supporting mutual and nested recursion, definitions in local contexts,
1515 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
1516 for small examples, and the separate tutorial on the function
1517 package. The old recdef "package" is still available as before, but
1518 users are encouraged to use the new package.
1520 * Method "lexicographic_order" automatically synthesizes termination
1521 relations as lexicographic combinations of size measures.
1523 * Case-expressions allow arbitrary constructor-patterns (including
1524 "_") and take their order into account, like in functional
1525 programming. Internally, this is translated into nested
1526 case-expressions; missing cases are added and mapped to the predefined
1527 constant "undefined". In complicated cases printing may no longer show
1528 the original input but the internal form. Lambda-abstractions allow
1529 the same form of pattern matching: "% pat1 => e1 | ..." is an
1530 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
1533 * IntDef: The constant "int :: nat => int" has been removed; now "int"
1534 is an abbreviation for "of_nat :: nat => int". The simplification
1535 rules for "of_nat" have been changed to work like "int" did
1536 previously. Potential INCOMPATIBILITY:
1537 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
1538 - of_nat_diff and of_nat_mult are no longer default simp rules
1540 * Method "algebra" solves polynomial equations over (semi)rings using
1541 Groebner bases. The (semi)ring structure is defined by locales and the
1542 tool setup depends on that generic context. Installing the method for
1543 a specific type involves instantiating the locale and possibly adding
1544 declarations for computation on the coefficients. The method is
1545 already instantiated for natural numbers and for the axiomatic class
1546 of idoms with numerals. See also the paper by Chaieb and Wenzel at
1547 CALCULEMUS 2007 for the general principles underlying this
1548 architecture of context-aware proof-tools.
1550 * Method "ferrack" implements quantifier elimination over
1551 special-purpose dense linear orders using locales (analogous to
1552 "algebra"). The method is already installed for class
1553 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
1556 * Former constant "List.op @" now named "List.append". Use ML
1557 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
1558 circumvent possible incompatibilities when working on ML level.
1560 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
1562 * New function listsum :: 'a list => 'a for arbitrary monoids.
1563 Special syntax: "SUM x <- xs. f x" (and latex variants)
1565 * New syntax for Haskell-like list comprehension (input only), eg.
1566 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
1568 * The special syntax for function "filter" has changed from [x :
1569 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
1570 comprehension syntax, and for uniformity. INCOMPATIBILITY.
1572 * [a..b] is now defined for arbitrary linear orders. It used to be
1573 defined on nat only, as an abbreviation for [a..<Suc b]
1576 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
1578 * New functions "sorted" and "sort" in src/HOL/List.thy.
1580 * New lemma collection field_simps (an extension of ring_simps) for
1581 manipulating (in)equations involving division. Multiplies with all
1582 denominators that can be proved to be non-zero (in equations) or
1583 positive/negative (in inequations).
1585 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
1586 have been improved and renamed to ring_simps, group_simps and
1587 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
1588 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
1590 * Theory Library/Commutative_Ring: switched from recdef to function
1591 package; constants add, mul, pow now curried. Infix syntax for
1592 algebraic operations.
1594 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
1597 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
1600 * HOL/records: generalised field-update to take a function on the
1601 field rather than the new value: r(|A := x|) is translated to A_update
1602 (K x) r The K-combinator that is internally used is called K_record.
1603 INCOMPATIBILITY: Usage of the plain update functions has to be
1606 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
1607 * x = 0, which are required for a semiring. Richer structures do not
1608 inherit from semiring_0 anymore, because this property is a theorem
1609 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
1610 there is more to prove, but this is mostly trivial.
1612 * Class "recpower" is generalized to arbitrary monoids, not just
1613 commutative semirings. INCOMPATIBILITY: may need to incorporate
1614 commutativity or semiring properties additionally.
1616 * Constant "List.list_all2" in List.thy now uses authentic syntax.
1617 INCOMPATIBILITY: translations containing list_all2 may go wrong,
1618 better use 'abbreviation'.
1620 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
1622 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
1623 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
1624 significant changes for setting up numeral syntax for types:
1625 - New constants Numeral.pred and Numeral.succ instead
1626 of former Numeral.bin_pred and Numeral.bin_succ.
1627 - Use integer operations instead of bin_add, bin_mult and so on.
1628 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
1629 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
1631 See src/HOL/Integ/IntArith.thy for an example setup.
1633 * Command 'normal_form' computes the normal form of a term that may
1634 contain free variables. For example ``normal_form "rev [a, b, c]"''
1635 produces ``[b, c, a]'' (without proof). This command is suitable for
1636 heavy-duty computations because the functions are compiled to ML
1637 first. Correspondingly, a method "normalization" is provided. See
1638 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
1640 * Alternative iff syntax "A <-> B" for equality on bool (with priority
1641 25 like -->); output depends on the "iff" print_mode, the default is
1642 "A = B" (with priority 50).
1644 * Relations less (<) and less_eq (<=) are also available on type bool.
1645 Modified syntax to disallow nesting without explicit parentheses,
1646 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
1649 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
1651 * Relation composition operator "op O" now has precedence 75 and binds
1652 stronger than union and intersection. INCOMPATIBILITY.
1654 * The old set interval syntax "{m..n(}" (and relatives) has been
1655 removed. Use "{m..<n}" (and relatives) instead.
1657 * In the context of the assumption "~(s = t)" the Simplifier rewrites
1658 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
1659 ``declare [[simproc del: neq]]''.
1661 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
1664 * Theorem Cons_eq_map_conv no longer declared as "simp".
1666 * Theorem setsum_mult renamed to setsum_right_distrib.
1668 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
1671 * Reimplemented methods "sat" and "satx", with several improvements:
1672 goals no longer need to be stated as "<prems> ==> False", equivalences
1673 (i.e. "=" on type bool) are handled, variable names of the form
1674 "lit_<n>" are no longer reserved, significant speedup.
1676 * Methods "sat" and "satx" can now replay MiniSat proof traces.
1677 zChaff is still supported as well.
1679 * 'inductive' and 'datatype': provide projections of mutual rules,
1680 bundled as foo_bar.inducts;
1682 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
1685 * Library: moved theory Accessible_Part to main HOL.
1687 * Library: added theory Coinductive_List of potentially infinite lists
1688 as greatest fixed-point.
1690 * Library: added theory AssocList which implements (finite) maps as
1693 * Method "evaluation" solves goals (i.e. a boolean expression)
1694 efficiently by compiling it to ML. The goal is "proved" (via an
1695 oracle) if it evaluates to True.
1697 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
1698 also when invoked by the simplifier. This results in the Simplifier
1699 being more powerful on arithmetic goals. INCOMPATIBILITY.
1700 Configuration option fast_arith_split_limit=0 recovers the old
1703 * Support for hex (0x20) and binary (0b1001) numerals.
1705 * New method: reify eqs (t), where eqs are equations for an
1706 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
1707 parameter, computes a term s::'b and a list xs::'a list and proves the
1708 theorem I xs s = t. This is also known as reification or quoting. The
1709 resulting theorem is applied to the subgoal to substitute t with I xs
1710 s. If t is omitted, the subgoal itself is reified.
1712 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
1713 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
1714 where f is supposed to be a computable function (in the sense of code
1715 generattion). The method uses reify to compute s and xs as above then
1716 applies corr_thm and uses normalization by evaluation to "prove" f s =
1717 r and finally gets the theorem t = r, which is again applied to the
1718 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
1720 * Reflection: Automatic reification now handels binding, an example is
1721 available in src/HOL/ex/ReflectionEx.thy
1723 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
1724 command 'statespace' that is similar to 'record', but introduces an
1725 abstract specification based on the locale infrastructure instead of
1726 HOL types. This leads to extra flexibility in composing state spaces,
1727 in particular multiple inheritance and renaming of components.
1732 * Hyperreal: Functions root and sqrt are now defined on negative real
1733 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
1734 Nonnegativity side conditions have been removed from many lemmas, so
1735 that more subgoals may now be solved by simplification; potential
1738 * Real: new type classes formalize real normed vector spaces and
1739 algebras, using new overloaded constants scaleR :: real => 'a => 'a
1740 and norm :: 'a => real.
1742 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
1743 reals into other types. The overloaded constant Reals :: 'a set is now
1744 defined as range of_real; potential INCOMPATIBILITY.
1746 * Real: proper support for ML code generation, including 'quickcheck'.
1747 Reals are implemented as arbitrary precision rationals.
1749 * Hyperreal: Several constants that previously worked only for the
1750 reals have been generalized, so they now work over arbitrary vector
1751 spaces. Type annotations may need to be added in some cases; potential
1754 Infinitesimal :: ('a::real_normed_vector) star set
1755 HFinite :: ('a::real_normed_vector) star set
1756 HInfinite :: ('a::real_normed_vector) star set
1757 approx :: ('a::real_normed_vector) star => 'a star => bool
1758 monad :: ('a::real_normed_vector) star => 'a star set
1759 galaxy :: ('a::real_normed_vector) star => 'a star set
1760 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
1761 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
1762 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
1763 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
1764 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
1765 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
1766 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
1767 sgn :: 'a::real_normed_vector => 'a
1768 exp :: 'a::{recpower,real_normed_field,banach} => 'a
1770 * Complex: Some complex-specific constants are now abbreviations for
1771 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
1772 hnorm. Other constants have been entirely removed in favor of the
1773 polymorphic versions (INCOMPATIBILITY):
1777 HInfinite <-- CInfinite
1778 Infinitesimal <-- CInfinitesimal
1781 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
1782 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
1783 (ns)deriv <-- (ns)cderiv
1788 * Formalisation of ideals and the quotient construction over rings.
1790 * Order and lattice theory no longer based on records.
1793 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
1794 greatest_closed. INCOMPATIBILITY.
1796 * Method algebra is now set up via an attribute. For examples see
1797 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
1798 of algebraic structures.
1800 * Renamed theory CRing to Ring.
1805 * Substantial, yet incomplete support for nominal datatypes (binding
1806 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
1807 src/HOL/Nominal/Examples. Prospective users should consult
1808 http://isabelle.in.tum.de/nominal/
1813 * ML basics: just one true type int, which coincides with IntInf.int
1816 * ML within Isar: antiquotations allow to embed statically-checked
1817 formal entities in the source, referring to the context available at
1818 compile-time. For example:
1820 ML {* @{sort "{zero,one}"} *}
1821 ML {* @{typ "'a => 'b"} *}
1822 ML {* @{term "%x. x"} *}
1823 ML {* @{prop "x == y"} *}
1824 ML {* @{ctyp "'a => 'b"} *}
1825 ML {* @{cterm "%x. x"} *}
1826 ML {* @{cprop "x == y"} *}
1827 ML {* @{thm asm_rl} *}
1828 ML {* @{thms asm_rl} *}
1829 ML {* @{type_name c} *}
1830 ML {* @{type_syntax c} *}
1831 ML {* @{const_name c} *}
1832 ML {* @{const_syntax c} *}
1835 ML {* @{theory Pure} *}
1836 ML {* @{theory_ref} *}
1837 ML {* @{theory_ref Pure} *}
1840 ML {* @{clasimpset} *}
1842 The same works for sources being ``used'' within an Isar context.
1844 * ML in Isar: improved error reporting; extra verbosity with
1845 ML_Context.trace enabled.
1847 * Pure/General/table.ML: the join operations now works via exceptions
1848 DUP/SAME instead of type option. This is simpler in simple cases, and
1849 admits slightly more efficient complex applications.
1851 * Pure: 'advanced' translation functions (parse_translation etc.) now
1852 use Context.generic instead of just theory.
1854 * Pure: datatype Context.generic joins theory/Proof.context and
1855 provides some facilities for code that works in either kind of
1856 context, notably GenericDataFun for uniform theory and proof data.
1858 * Pure: simplified internal attribute type, which is now always
1859 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
1860 local (Proof.context) attributes have been discontinued, while
1861 minimizing code duplication. Thm.rule_attribute and
1862 Thm.declaration_attribute build canonical attributes; see also structure
1863 Context for further operations on Context.generic, notably
1864 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
1865 declarations and definitions.
1867 * Context data interfaces (Theory/Proof/GenericDataFun): removed
1868 name/print, uninitialized data defaults to ad-hoc copy of empty value,
1869 init only required for impure data. INCOMPATIBILITY: empty really need
1870 to be empty (no dependencies on theory content!)
1872 * Pure/kernel: consts certification ignores sort constraints given in
1873 signature declarations. (This information is not relevant to the
1874 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
1875 potential INCOMPATIBILITY.
1877 * Pure: axiomatic type classes are now purely definitional, with
1878 explicit proofs of class axioms and super class relations performed
1879 internally. See Pure/axclass.ML for the main internal interfaces --
1880 notably AxClass.define_class supercedes AxClass.add_axclass, and
1881 AxClass.axiomatize_class/classrel/arity supersede
1882 Sign.add_classes/classrel/arities.
1884 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
1885 global/local versions on theory vs. Proof.context have been
1886 discontinued; Attrib.syntax and Method.syntax have been adapted
1887 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
1888 attributes, methods, etc.
1890 * Pure: several functions of signature "... -> theory -> theory * ..."
1891 have been reoriented to "... -> theory -> ... * theory" in order to
1892 allow natural usage in combination with the ||>, ||>>, |-> and
1893 fold_map combinators.
1895 * Pure: official theorem names (closed derivations) and additional
1896 comments (tags) are now strictly separate. Name hints -- which are
1897 maintained as tags -- may be attached any time without affecting the
1900 * Pure: primitive rule lift_rule now takes goal cterm instead of an
1901 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
1902 achieve the old behaviour.
1904 * Pure: the "Goal" constant is now called "prop", supporting a
1905 slightly more general idea of ``protecting'' meta-level rule
1908 * Pure: Logic.(un)varify only works in a global context, which is now
1909 enforced instead of silently assumed. INCOMPATIBILITY, may use
1910 Logic.legacy_(un)varify as temporary workaround.
1912 * Pure: structure Name provides scalable operations for generating
1913 internal variable names, notably Name.variants etc. This replaces
1914 some popular functions from term.ML:
1916 Term.variant -> Name.variant
1917 Term.variantlist -> Name.variant_list
1918 Term.invent_names -> Name.invent_list
1920 Note that low-level renaming rarely occurs in new code -- operations
1921 from structure Variable are used instead (see below).
1923 * Pure: structure Variable provides fundamental operations for proper
1924 treatment of fixed/schematic variables in a context. For example,
1925 Variable.import introduces fixes for schematics of given facts and
1926 Variable.export reverses the effect (up to renaming) -- this replaces
1927 various freeze_thaw operations.
1929 * Pure: structure Goal provides simple interfaces for
1930 init/conclude/finish and tactical prove operations (replacing former
1931 Tactic.prove). Goal.prove is the canonical way to prove results
1932 within a given context; Goal.prove_global is a degraded version for
1933 theory level goals, including a global Drule.standard. Note that
1934 OldGoals.prove_goalw_cterm has long been obsolete, since it is
1935 ill-behaved in a local proof context (e.g. with local fixes/assumes or
1936 in a locale context).
1938 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
1939 and type checking (Syntax.check_term etc.), with common combinations
1940 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
1941 which are considered legacy and await removal.
1943 * Pure/Syntax: generic interfaces for type unchecking
1944 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
1945 with common combinations (Syntax.pretty_term, Syntax.string_of_term
1946 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
1947 available for convenience, but refer to the very same operations using
1948 a mere theory instead of a full context.
1950 * Isar: simplified treatment of user-level errors, using exception
1951 ERROR of string uniformly. Function error now merely raises ERROR,
1952 without any side effect on output channels. The Isar toplevel takes
1953 care of proper display of ERROR exceptions. ML code may use plain
1954 handle/can/try; cat_error may be used to concatenate errors like this:
1956 ... handle ERROR msg => cat_error msg "..."
1958 Toplevel ML code (run directly or through the Isar toplevel) may be
1959 embedded into the Isar toplevel with exception display/debug like
1962 Isar.toplevel (fn () => ...)
1964 INCOMPATIBILITY, removed special transform_error facilities, removed
1965 obsolete variants of user-level exceptions (ERROR_MESSAGE,
1966 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
1967 -- use plain ERROR instead.
1969 * Isar: theory setup now has type (theory -> theory), instead of a
1970 list. INCOMPATIBILITY, may use #> to compose setup functions.
1972 * Isar: ML toplevel pretty printer for type Proof.context, subject to
1973 ProofContext.debug/verbose flags.
1975 * Isar: Toplevel.theory_to_proof admits transactions that modify the
1976 theory before entering a proof state. Transactions now always see a
1977 quasi-functional intermediate checkpoint, both in interactive and
1980 * Isar: simplified interfaces for outer syntax. Renamed
1981 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
1982 OuterSyntax.add_parsers -- this functionality is now included in
1983 OuterSyntax.command etc. INCOMPATIBILITY.
1985 * Simplifier: the simpset of a running simplification process now
1986 contains a proof context (cf. Simplifier.the_context), which is the
1987 very context that the initial simpset has been retrieved from (by
1988 simpset_of/local_simpset_of). Consequently, all plug-in components
1989 (solver, looper etc.) may depend on arbitrary proof data.
1991 * Simplifier.inherit_context inherits the proof context (plus the
1992 local bounds) of the current simplification process; any simproc
1993 etc. that calls the Simplifier recursively should do this! Removed
1994 former Simplifier.inherit_bounds, which is already included here --
1995 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
1996 specify an explicit context using Simplifier.context/theory_context.
1998 * Simplifier/Classical Reasoner: more abstract interfaces
1999 change_simpset/claset for modifying the simpset/claset reference of a
2000 theory; raw versions simpset/claset_ref etc. have been discontinued --
2003 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
2009 * settings: the default heap location within ISABELLE_HOME_USER now
2010 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
2011 Isabelle installations.
2013 * isabelle-process: option -S (secure mode) disables some critical
2014 operations, notably runtime compilation and evaluation of ML source
2017 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
2019 * Support for parallel execution, using native multicore support of
2020 Poly/ML 5.1. The theory loader exploits parallelism when processing
2021 independent theories, according to the given theory header
2022 specifications. The maximum number of worker threads is specified via
2023 usedir option -M or the "max-threads" setting in Proof General. A
2024 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
2025 to 6 on a 8-core machine. User-code needs to observe certain
2026 guidelines for thread-safe programming, see appendix A in the Isar
2027 Implementation manual.
2031 New in Isabelle2005 (October 2005)
2032 ----------------------------------
2036 * Theory headers: the new header syntax for Isar theories is
2039 imports <theory1> ... <theoryN>
2040 uses <file1> ... <fileM>
2043 where the 'uses' part is optional. The previous syntax
2045 theory <name> = <theory1> + ... + <theoryN>:
2047 will disappear in the next release. Use isatool fixheaders to convert
2048 existing theory files. Note that there is no change in ancient
2049 non-Isar theories now, but these will disappear soon.
2051 * Theory loader: parent theories can now also be referred to via
2052 relative and absolute paths.
2054 * Command 'find_theorems' searches for a list of criteria instead of a
2055 list of constants. Known criteria are: intro, elim, dest, name:string,
2056 simp:term, and any term. Criteria can be preceded by '-' to select
2057 theorems that do not match. Intro, elim, dest select theorems that
2058 match the current goal, name:s selects theorems whose fully qualified
2059 name contain s, and simp:term selects all simplification rules whose
2060 lhs match term. Any other term is interpreted as pattern and selects
2061 all theorems matching the pattern. Available in ProofGeneral under
2062 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
2064 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
2066 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
2067 matching the current goal as introduction rule and not having "HOL."
2068 in their name (i.e. not being defined in theory HOL).
2070 * Command 'thms_containing' has been discontinued in favour of
2071 'find_theorems'; INCOMPATIBILITY.
2073 * Communication with Proof General is now 8bit clean, which means that
2074 Unicode text in UTF-8 encoding may be used within theory texts (both
2075 formal and informal parts). Cf. option -U of the Isabelle Proof
2076 General interface. Here are some simple examples (cf. src/HOL/ex):
2078 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
2079 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
2081 * Improved efficiency of the Simplifier and, to a lesser degree, the
2082 Classical Reasoner. Typical big applications run around 2 times
2086 *** Document preparation ***
2088 * Commands 'display_drafts' and 'print_drafts' perform simple output
2089 of raw sources. Only those symbols that do not require additional
2090 LaTeX packages (depending on comments in isabellesym.sty) are
2091 displayed properly, everything else is left verbatim. isatool display
2092 and isatool print are used as front ends (these are subject to the
2093 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
2095 * Command tags control specific markup of certain regions of text,
2096 notably folding and hiding. Predefined tags include "theory" (for
2097 theory begin and end), "proof" for proof commands, and "ML" for
2098 commands involving ML code; the additional tags "visible" and
2099 "invisible" are unused by default. Users may give explicit tag
2100 specifications in the text, e.g. ''by %invisible (auto)''. The
2101 interpretation of tags is determined by the LaTeX job during document
2102 preparation: see option -V of isatool usedir, or options -n and -t of
2103 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
2106 Several document versions may be produced at the same time via isatool
2107 usedir (the generated index.html will link all of them). Typical
2108 specifications include ''-V document=theory,proof,ML'' to present
2109 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
2110 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
2111 these parts without any formal replacement text. The Isabelle site
2112 default settings produce ''document'' and ''outline'' versions as
2115 * Several new antiquotations:
2117 @{term_type term} prints a term with its type annotated;
2119 @{typeof term} prints the type of a term;
2121 @{const const} is the same as @{term const}, but checks that the
2122 argument is a known logical constant;
2124 @{term_style style term} and @{thm_style style thm} print a term or
2125 theorem applying a "style" to it
2129 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
2130 definitions, equations, inequations etc., 'concl' printing only the
2131 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
2132 to print the specified premise. TermStyle.add_style provides an ML
2133 interface for introducing further styles. See also the "LaTeX Sugar"
2134 document practical applications. The ML antiquotation prints
2135 type-checked ML expressions verbatim.
2137 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
2138 and 'text' support optional locale specification '(in loc)', which
2139 specifies the default context for interpreting antiquotations. For
2140 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
2142 * Option 'locale=NAME' of antiquotations specifies an alternative
2143 context interpreting the subsequent argument. For example: @{thm
2144 [locale=lattice] inf_assoc}.
2146 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
2149 * Proper output of antiquotations for theory commands involving a
2150 proof context (such as 'locale' or 'theorem (in loc) ...').
2152 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
2153 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
2155 * isatool usedir: new option -C (default true) controls whether option
2156 -D should include a copy of the original document directory; -C false
2157 prevents unwanted effects such as copying of administrative CVS data.
2162 * Considerably improved version of 'constdefs' command. Now performs
2163 automatic type-inference of declared constants; additional support for
2164 local structure declarations (cf. locales and HOL records), see also
2165 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
2166 sequential dependencies of definitions within a single 'constdefs'
2167 section; moreover, the declared name needs to be an identifier. If
2168 all fails, consider to fall back on 'consts' and 'defs' separately.
2170 * Improved indexed syntax and implicit structures. First of all,
2171 indexed syntax provides a notational device for subscripted
2172 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
2173 expressions. Secondly, in a local context with structure
2174 declarations, number indexes \<^sub>n or the empty index (default
2175 number 1) refer to a certain fixed variable implicitly; option
2176 show_structs controls printing of implicit structures. Typical
2177 applications of these concepts involve record types and locales.
2179 * New command 'no_syntax' removes grammar declarations (and
2180 translations) resulting from the given syntax specification, which is
2181 interpreted in the same manner as for the 'syntax' command.
2183 * 'Advanced' translation functions (parse_translation etc.) may depend
2184 on the signature of the theory context being presently used for
2185 parsing/printing, see also isar-ref manual.
2187 * Improved 'oracle' command provides a type-safe interface to turn an
2188 ML expression of type theory -> T -> term into a primitive rule of
2189 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
2190 is already included here); see also FOL/ex/IffExample.thy;
2193 * axclass: name space prefix for class "c" is now "c_class" (was "c"
2194 before); "cI" is no longer bound, use "c.intro" instead.
2195 INCOMPATIBILITY. This change avoids clashes of fact bindings for
2196 axclasses vs. locales.
2198 * Improved internal renaming of symbolic identifiers -- attach primes
2199 instead of base 26 numbers.
2201 * New flag show_question_marks controls printing of leading question
2202 marks in schematic variable names.
2204 * In schematic variable names, *any* symbol following \<^isub> or
2205 \<^isup> is now treated as part of the base name. For example, the
2206 following works without printing of awkward ".0" indexes:
2208 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
2211 * Inner syntax includes (*(*nested*) comments*).
2213 * Pretty printer now supports unbreakable blocks, specified in mixfix
2214 annotations as "(00...)".
2216 * Clear separation of logical types and nonterminals, where the latter
2217 may only occur in 'syntax' specifications or type abbreviations.
2218 Before that distinction was only partially implemented via type class
2219 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
2220 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
2221 exotic syntax specifications may require further adaption
2222 (e.g. Cube/Cube.thy).
2224 * Removed obsolete type class "logic", use the top sort {} instead.
2225 Note that non-logical types should be declared as 'nonterminals'
2226 rather than 'types'. INCOMPATIBILITY for new object-logic
2229 * Attributes 'induct' and 'cases': type or set names may now be
2230 locally fixed variables as well.
2232 * Simplifier: can now control the depth to which conditional rewriting
2233 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
2236 * Simplifier: simplification procedures may now take the current
2237 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
2238 interface), which is very useful for calling the Simplifier
2239 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
2240 is gone -- use prems_of_ss on the simpset instead. Moreover, the
2241 low-level mk_simproc no longer applies Logic.varify internally, to
2242 allow for use in a context of fixed variables.
2244 * thin_tac now works even if the assumption being deleted contains !!
2245 or ==>. More generally, erule now works even if the major premise of
2246 the elimination rule contains !! or ==>.
2248 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
2250 * Reorganized bootstrapping of the Pure theories; CPure is now derived
2251 from Pure, which contains all common declarations already. Both
2252 theories are defined via plain Isabelle/Isar .thy files.
2253 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
2254 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
2255 use isatool fixcpure to adapt your theory and ML sources.
2257 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
2258 selections of theorems in named facts via index ranges.
2260 * 'print_theorems': in theory mode, really print the difference
2261 wrt. the last state (works for interactive theory development only),
2262 in proof mode print all local facts (cf. 'print_facts');
2264 * 'hide': option '(open)' hides only base names.
2266 * More efficient treatment of intermediate checkpoints in interactive
2269 * Code generator is now invoked via code_module (incremental code
2270 generation) and code_library (modular code generation, ML structures
2271 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
2272 must be quoted when used as identifiers.
2274 * New 'value' command for reading, evaluating and printing terms using
2275 the code generator. INCOMPATIBILITY: command keyword 'value' must be
2276 quoted when used as identifier.
2281 * New commands for the interpretation of locale expressions in
2282 theories (1), locales (2) and proof contexts (3). These generate
2283 proof obligations from the expression specification. After the
2284 obligations have been discharged, theorems of the expression are added
2285 to the theory, target locale or proof context. The synopsis of the
2286 commands is a follows:
2288 (1) interpretation expr inst
2289 (2) interpretation target < expr
2290 (3) interpret expr inst
2292 Interpretation in theories and proof contexts require a parameter
2293 instantiation of terms from the current context. This is applied to
2294 specifications and theorems of the interpreted expression.
2295 Interpretation in locales only permits parameter renaming through the
2296 locale expression. Interpretation is smart in that interpretations
2297 that are active already do not occur in proof obligations, neither are
2298 instantiated theorems stored in duplicate. Use 'print_interps' to
2299 inspect active interpretations of a particular locale. For details,
2300 see the Isar Reference manual. Examples can be found in
2301 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
2303 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
2304 'interpret' instead.
2306 * New context element 'constrains' for adding type constraints to
2309 * Context expressions: renaming of parameters with syntax
2312 * Locale declaration: 'includes' disallowed.
2314 * Proper static binding of attribute syntax -- i.e. types / terms /
2315 facts mentioned as arguments are always those of the locale definition
2316 context, independently of the context of later invocations. Moreover,
2317 locale operations (renaming and type / term instantiation) are applied
2318 to attribute arguments as expected.
2320 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
2321 actual attributes; rare situations may require Attrib.attribute to
2322 embed those attributes into Attrib.src that lack concrete syntax.
2323 Attribute implementations need to cooperate properly with the static
2324 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
2325 Attrib.XXX_thm etc. already do the right thing without further
2326 intervention. Only unusual applications -- such as "where" or "of"
2327 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
2328 on the context and the facts involved -- may have to assign parsed
2329 values to argument tokens explicitly.
2331 * Changed parameter management in theorem generation for long goal
2332 statements with 'includes'. INCOMPATIBILITY: produces a different
2333 theorem statement in rare situations.
2335 * Locale inspection command 'print_locale' omits notes elements. Use
2336 'print_locale!' to have them included in the output.
2341 * Provers/hypsubst.ML: improved version of the subst method, for
2342 single-step rewriting: it now works in bound variable contexts. New is
2343 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
2344 rewrite a different subterm than the original subst method, which is
2345 still available as 'simplesubst'.
2347 * Provers/quasi.ML: new transitivity reasoners for transitivity only
2350 * Provers/trancl.ML: new transitivity reasoner for transitive and
2351 reflexive-transitive closure of relations.
2353 * Provers/blast.ML: new reference depth_limit to make blast's depth
2354 limit (previously hard-coded with a value of 20) user-definable.
2356 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
2357 is peformed already. Object-logics merely need to finish their
2358 initial simpset configuration as before. INCOMPATIBILITY.
2363 * Symbolic syntax of Hilbert Choice Operator is now as follows:
2366 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
2368 The symbol \<some> is displayed as the alternative epsilon of LaTeX
2369 and x-symbol; use option '-m epsilon' to get it actually printed.
2370 Moreover, the mathematically important symbolic identifier \<epsilon>
2371 becomes available as variable, constant etc. INCOMPATIBILITY,
2373 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
2374 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
2375 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
2376 support corresponding Isar calculations.
2378 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
2381 * theory SetInterval: changed the syntax for open intervals:
2390 The old syntax is still supported but will disappear in the next
2391 release. For conversion use the following Emacs search and replace
2392 patterns (these are not perfect but work quite well):
2394 {)\([^\.]*\)\.\. -> {\1<\.\.}
2395 \.\.\([^(}]*\)(} -> \.\.<\1}
2397 * Theory Commutative_Ring (in Library): method comm_ring for proving
2398 equalities in commutative rings; method 'algebra' provides a generic
2401 * Theory Finite_Set: changed the syntax for 'setsum', summation over
2402 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
2403 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
2406 Some new syntax forms are available:
2408 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
2409 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
2410 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
2411 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
2413 The latter form "\<Sum>x < k. e" used to be based on a separate
2414 function "Summation", which has been discontinued.
2416 * theory Finite_Set: in structured induction proofs, the insert case
2417 is now 'case (insert x F)' instead of the old counterintuitive 'case
2420 * The 'refute' command has been extended to support a much larger
2421 fragment of HOL, including axiomatic type classes, constdefs and
2422 typedefs, inductive datatypes and recursion.
2424 * New tactics 'sat' and 'satx' to prove propositional tautologies.
2425 Requires zChaff with proof generation to be installed. See
2426 HOL/ex/SAT_Examples.thy for examples.
2428 * Datatype induction via method 'induct' now preserves the name of the
2429 induction variable. For example, when proving P(xs::'a list) by
2430 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
2431 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
2432 in unstructured proof scripts.
2434 * Reworked implementation of records. Improved scalability for
2435 records with many fields, avoiding performance problems for type
2436 inference. Records are no longer composed of nested field types, but
2437 of nested extension types. Therefore the record type only grows linear
2438 in the number of extensions and not in the number of fields. The
2439 top-level (users) view on records is preserved. Potential
2440 INCOMPATIBILITY only in strange cases, where the theory depends on the
2441 old record representation. The type generated for a record is called
2442 <record_name>_ext_type.
2444 Flag record_quick_and_dirty_sensitive can be enabled to skip the
2445 proofs triggered by a record definition or a simproc (if
2446 quick_and_dirty is enabled). Definitions of large records can take
2449 New simproc record_upd_simproc for simplification of multiple record
2450 updates enabled by default. Moreover, trivial updates are also
2451 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
2452 occasionally, since simplification is more powerful by default.
2454 * typedef: proper support for polymorphic sets, which contain extra
2455 type-variables in the term.
2457 * Simplifier: automatically reasons about transitivity chains
2458 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
2459 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
2460 old proofs break occasionally as simplification may now solve more
2461 goals than previously.
2463 * Simplifier: converts x <= y into x = y if assumption y <= x is
2464 present. Works for all partial orders (class "order"), in particular
2465 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
2468 * Simplifier: new simproc for "let x = a in f x". If a is a free or
2469 bound variable or a constant then the let is unfolded. Otherwise
2470 first a is simplified to b, and then f b is simplified to g. If
2471 possible we abstract b from g arriving at "let x = b in h x",
2472 otherwise we unfold the let and arrive at g. The simproc can be
2473 enabled/disabled by the reference use_let_simproc. Potential
2474 INCOMPATIBILITY since simplification is more powerful by default.
2476 * Classical reasoning: the meson method now accepts theorems as arguments.
2478 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
2479 jobs to provide advice on the provability of subgoals.
2481 * Theory OrderedGroup and Ring_and_Field: various additions and
2482 improvements to faciliate calculations involving equalities and
2485 The following theorems have been eliminated or modified
2488 abs_eq now named abs_of_nonneg
2489 abs_of_ge_0 now named abs_of_nonneg
2490 abs_minus_eq now named abs_of_nonpos
2491 imp_abs_id now named abs_of_nonneg
2492 imp_abs_neg_id now named abs_of_nonpos
2493 mult_pos now named mult_pos_pos
2494 mult_pos_le now named mult_nonneg_nonneg
2495 mult_pos_neg_le now named mult_nonneg_nonpos
2496 mult_pos_neg2_le now named mult_nonneg_nonpos2
2497 mult_neg now named mult_neg_neg
2498 mult_neg_le now named mult_nonpos_nonpos
2500 * The following lemmas in Ring_and_Field have been added to the simplifier:
2503 not_square_less_zero
2505 The following lemmas have been deleted from Real/RealPow:
2515 * Theory Parity: added rules for simplifying exponents.
2519 The following theorems have been eliminated or modified
2522 list_all_Nil now named list_all.simps(1)
2523 list_all_Cons now named list_all.simps(2)
2524 list_all_conv now named list_all_iff
2525 set_mem_eq now named mem_iff
2527 * Theories SetsAndFunctions and BigO (see HOL/Library) support
2528 asymptotic "big O" calculations. See the notes in BigO.thy.
2533 * Theory RealDef: better support for embedding natural numbers and
2534 integers in the reals.
2536 The following theorems have been eliminated or modified
2539 exp_ge_add_one_self now requires no hypotheses
2540 real_of_int_add reversed direction of equality (use [symmetric])
2541 real_of_int_minus reversed direction of equality (use [symmetric])
2542 real_of_int_diff reversed direction of equality (use [symmetric])
2543 real_of_int_mult reversed direction of equality (use [symmetric])
2545 * Theory RComplete: expanded support for floor and ceiling functions.
2547 * Theory Ln is new, with properties of the natural logarithm
2549 * Hyperreal: There is a new type constructor "star" for making
2550 nonstandard types. The old type names are now type synonyms:
2554 hcomplex = complex star
2556 * Hyperreal: Many groups of similarly-defined constants have been
2557 replaced by polymorphic versions (INCOMPATIBILITY):
2559 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
2561 starset <-- starsetNat, starsetC
2562 *s* <-- *sNat*, *sc*
2563 starset_n <-- starsetNat_n, starsetC_n
2564 *sn* <-- *sNatn*, *scn*
2565 InternalSets <-- InternalNatSets, InternalCSets
2567 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2568 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
2569 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
2570 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
2571 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
2573 * Hyperreal: Many type-specific theorems have been removed in favor of
2574 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
2576 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
2577 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
2578 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
2579 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
2580 right_minus <-- hypreal_add_minus
2581 left_minus <-- {hypreal,hcomplex}_add_minus_left
2582 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
2583 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
2584 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
2585 mult_1_right <-- hcomplex_mult_one_right
2586 mult_zero_left <-- hcomplex_mult_zero_left
2587 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
2588 right_distrib <-- hypnat_add_mult_distrib2
2589 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
2590 right_inverse <-- hypreal_mult_inverse
2591 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
2592 order_refl <-- {hypreal,hypnat}_le_refl
2593 order_trans <-- {hypreal,hypnat}_le_trans
2594 order_antisym <-- {hypreal,hypnat}_le_anti_sym
2595 order_less_le <-- {hypreal,hypnat}_less_le
2596 linorder_linear <-- {hypreal,hypnat}_le_linear
2597 add_left_mono <-- {hypreal,hypnat}_add_left_mono
2598 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
2599 add_nonneg_nonneg <-- hypreal_le_add_order
2601 * Hyperreal: Separate theorems having to do with type-specific
2602 versions of constants have been merged into theorems that apply to the
2603 new polymorphic constants (INCOMPATIBILITY):
2605 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
2606 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
2607 STAR_Un <-- {STAR,NatStar,STARC}_Un
2608 STAR_Int <-- {STAR,NatStar,STARC}_Int
2609 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
2610 STAR_subset <-- {STAR,NatStar,STARC}_subset
2611 STAR_mem <-- {STAR,NatStar,STARC}_mem
2612 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
2613 STAR_diff <-- {STAR,STARC}_diff
2614 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
2615 STARC_hcomplex_of_complex}_image_subset
2616 starset_n_Un <-- starset{Nat,C}_n_Un
2617 starset_n_Int <-- starset{Nat,C}_n_Int
2618 starset_n_Compl <-- starset{Nat,C}_n_Compl
2619 starset_n_diff <-- starset{Nat,C}_n_diff
2620 InternalSets_Un <-- Internal{Nat,C}Sets_Un
2621 InternalSets_Int <-- Internal{Nat,C}Sets_Int
2622 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
2623 InternalSets_diff <-- Internal{Nat,C}Sets_diff
2624 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
2625 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
2626 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
2627 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
2628 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
2629 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2630 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
2631 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
2632 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
2633 starfun_diff <-- starfun{C,RC,CR}_diff
2634 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
2635 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
2636 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
2637 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
2638 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
2639 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
2640 starfun_Id <-- starfunC_Id
2641 starfun_approx <-- starfun{Nat,CR}_approx
2642 starfun_capprox <-- starfun{C,RC}_capprox
2643 starfun_abs <-- starfunNat_rabs
2644 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
2645 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
2646 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
2647 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
2648 starfun_add_capprox <-- starfun{C,RC}_add_capprox
2649 starfun_add_approx <-- starfunCR_add_approx
2650 starfun_inverse_inverse <-- starfunC_inverse_inverse
2651 starfun_divide <-- starfun{C,CR,RC}_divide
2652 starfun_n <-- starfun{Nat,C}_n
2653 starfun_n_mult <-- starfun{Nat,C}_n_mult
2654 starfun_n_add <-- starfun{Nat,C}_n_add
2655 starfun_n_add_minus <-- starfunNat_n_add_minus
2656 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
2657 starfun_n_minus <-- starfun{Nat,C}_n_minus
2658 starfun_n_eq <-- starfun{Nat,C}_n_eq
2660 star_n_add <-- {hypreal,hypnat,hcomplex}_add
2661 star_n_minus <-- {hypreal,hcomplex}_minus
2662 star_n_diff <-- {hypreal,hcomplex}_diff
2663 star_n_mult <-- {hypreal,hcomplex}_mult
2664 star_n_inverse <-- {hypreal,hcomplex}_inverse
2665 star_n_le <-- {hypreal,hypnat}_le
2666 star_n_less <-- {hypreal,hypnat}_less
2667 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
2668 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
2669 star_n_abs <-- hypreal_hrabs
2670 star_n_divide <-- hcomplex_divide
2672 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
2673 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
2674 star_of_diff <-- hypreal_of_real_diff
2675 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
2676 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
2677 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
2678 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
2679 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
2680 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
2681 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
2682 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
2683 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
2684 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
2685 star_of_number_of <-- {hypreal,hcomplex}_number_of
2686 star_of_number_less <-- number_of_less_hypreal_of_real_iff
2687 star_of_number_le <-- number_of_le_hypreal_of_real_iff
2688 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
2689 star_of_less_number <-- hypreal_of_real_less_number_of_iff
2690 star_of_le_number <-- hypreal_of_real_le_number_of_iff
2691 star_of_power <-- hypreal_of_real_power
2692 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
2694 * Hyperreal: new method "transfer" that implements the transfer
2695 principle of nonstandard analysis. With a subgoal that mentions
2696 nonstandard types like "'a star", the command "apply transfer"
2697 replaces it with an equivalent one that mentions only standard types.
2698 To be successful, all free variables must have standard types; non-
2699 standard variables must have explicit universal quantifiers.
2701 * Hyperreal: A theory of Taylor series.
2706 * Discontinued special version of 'constdefs' (which used to support
2707 continuous functions) in favor of the general Pure one with full
2710 * New simplification procedure for solving continuity conditions; it
2711 is much faster on terms with many nested lambda abstractions (cubic
2712 instead of exponential time).
2714 * New syntax for domain package: selector names are now optional.
2715 Parentheses should be omitted unless argument is lazy, for example:
2717 domain 'a stream = cons "'a" (lazy "'a stream")
2719 * New command 'fixrec' for defining recursive functions with pattern
2720 matching; defining multiple functions with mutual recursion is also
2721 supported. Patterns may include the constants cpair, spair, up, sinl,
2722 sinr, or any data constructor defined by the domain package. The given
2723 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
2724 syntax and examples.
2726 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
2727 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
2728 but the proof obligation additionally includes an admissibility
2729 requirement. The packages generate instances of class cpo or pcpo,
2730 with continuity and strictness theorems for Rep and Abs.
2732 * HOLCF: Many theorems have been renamed according to a more standard naming
2733 scheme (INCOMPATIBILITY):
2735 foo_inject: "foo$x = foo$y ==> x = y"
2736 foo_eq: "(foo$x = foo$y) = (x = y)"
2737 foo_less: "(foo$x << foo$y) = (x << y)"
2738 foo_strict: "foo$UU = UU"
2739 foo_defined: "... ==> foo$x ~= UU"
2740 foo_defined_iff: "(foo$x = UU) = (x = UU)"
2745 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
2746 including the First Isomorphism Theorem (on quotienting by the kernel
2749 * ZF/Simplifier: install second copy of type solver that actually
2750 makes use of TC rules declared to Isar proof contexts (or locales);
2751 the old version is still required for ML proof scripts.
2756 * Converted to Isar theory format; use locales instead of axiomatic
2762 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
2765 * Pure/library.ML no longer defines its own option datatype, but uses
2766 that of the SML basis, which has constructors NONE and SOME instead of
2767 None and Some, as well as exception Option.Option instead of OPTION.
2768 The functions the, if_none, is_some, is_none have been adapted
2769 accordingly, while Option.map replaces apsome.
2771 * Pure/library.ML: the exception LIST has been given up in favour of
2772 the standard exceptions Empty and Subscript, as well as
2773 Library.UnequalLengths. Function like Library.hd and Library.tl are
2774 superceded by the standard hd and tl functions etc.
2776 A number of basic list functions are no longer exported to the ML
2777 toplevel, as they are variants of predefined functions. The following
2778 suggests how one can translate existing code:
2780 rev_append xs ys = List.revAppend (xs, ys)
2781 nth_elem (i, xs) = List.nth (xs, i)
2782 last_elem xs = List.last xs
2783 flat xss = List.concat xss
2784 seq fs = List.app fs
2785 partition P xs = List.partition P xs
2786 mapfilter f xs = List.mapPartial f xs
2788 * Pure/library.ML: several combinators for linear functional
2789 transformations, notably reverse application and composition:
2792 (x, y) |-> f f #-> g
2794 * Pure/library.ML: introduced/changed precedence of infix operators:
2796 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
2798 infix 3 o oo ooo oooo;
2799 infix 4 ~~ upto downto;
2801 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
2804 * Pure/library.ML: natural list combinators fold, fold_rev, and
2805 fold_map support linear functional transformations and nesting. For
2808 fold f [x1, ..., xN] y =
2809 y |> f x1 |> ... |> f xN
2811 (fold o fold) f [xs1, ..., xsN] y =
2812 y |> fold f xs1 |> ... |> fold f xsN
2814 fold f [x1, ..., xN] =
2817 (fold o fold) f [xs1, ..., xsN] =
2818 fold f xs1 #> ... #> fold f xsN
2820 * Pure/library.ML: the following selectors on type 'a option are
2823 the: 'a option -> 'a (*partial*)
2824 these: 'a option -> 'a where 'a = 'b list
2825 the_default: 'a -> 'a option -> 'a
2826 the_list: 'a option -> 'a list
2828 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2829 basic operations for association lists, following natural argument
2830 order; moreover the explicit equality predicate passed here avoids
2831 potentially expensive polymorphic runtime equality checks.
2832 The old functions may be expressed as follows:
2834 assoc = uncurry (AList.lookup (op =))
2835 assocs = these oo AList.lookup (op =)
2836 overwrite = uncurry (AList.update (op =)) o swap
2838 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
2840 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
2841 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
2843 replacing make_keylist and keyfilter (occassionally used)
2846 make_keylist = AList.make
2847 keyfilter = AList.find (op =)
2849 * eq_fst and eq_snd now take explicit equality parameter, thus
2850 avoiding eqtypes. Naive rewrites:
2852 eq_fst = eq_fst (op =)
2853 eq_snd = eq_snd (op =)
2855 * Removed deprecated apl and apr (rarely used).
2858 apl (n, op) =>>= curry op n
2859 apr (op, m) =>>= fn n => op (n, m)
2861 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
2862 provides a reasonably efficient light-weight implementation of sets as
2865 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
2866 few new operations; existing lookup and update are now curried to
2867 follow natural argument order (for use with fold etc.);
2868 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
2870 * Pure/General: output via the Isabelle channels of
2871 writeln/warning/error etc. is now passed through Output.output, with a
2872 hook for arbitrary transformations depending on the print_mode
2873 (cf. Output.add_mode -- the first active mode that provides a output
2874 function wins). Already formatted output may be embedded into further
2875 text via Output.raw; the result of Pretty.string_of/str_of and derived
2876 functions (string_of_term/cterm/thm etc.) is already marked raw to
2877 accommodate easy composition of diagnostic messages etc. Programmers
2878 rarely need to care about Output.output or Output.raw at all, with
2879 some notable exceptions: Output.output is required when bypassing the
2880 standard channels (writeln etc.), or in token translations to produce
2881 properly formatted results; Output.raw is required when capturing
2882 already output material that will eventually be presented to the user
2883 a second time. For the default print mode, both Output.output and
2884 Output.raw have no effect.
2886 * Pure/General: Output.time_accumulator NAME creates an operator ('a
2887 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
2888 cumulative results are displayed at the end of a batch session.
2890 * Pure/General: File.sysify_path and File.quote_sysify path have been
2891 replaced by File.platform_path and File.shell_path (with appropriate
2892 hooks). This provides a clean interface for unusual systems where the
2893 internal and external process view of file names are different.
2895 * Pure: more efficient orders for basic syntactic entities: added
2896 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
2897 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
2898 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
2899 orders now -- potential INCOMPATIBILITY for code that depends on a
2900 particular order for Symtab.keys, Symtab.dest, etc. (consider using
2901 Library.sort_strings on result).
2903 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
2904 fold_types traverse types/terms from left to right, observing natural
2905 argument order. Supercedes previous foldl_XXX versions, add_frees,
2906 add_vars etc. have been adapted as well: INCOMPATIBILITY.
2908 * Pure: name spaces have been refined, with significant changes of the
2909 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
2910 to extern(_table). The plain name entry path is superceded by a
2911 general 'naming' context, which also includes the 'policy' to produce
2912 a fully qualified name and external accesses of a fully qualified
2913 name; NameSpace.extend is superceded by context dependent
2914 Sign.declare_name. Several theory and proof context operations modify
2915 the naming context. Especially note Theory.restore_naming and
2916 ProofContext.restore_naming to get back to a sane state; note that
2917 Theory.add_path is no longer sufficient to recover from
2918 Theory.absolute_path in particular.
2920 * Pure: new flags short_names (default false) and unique_names
2921 (default true) for controlling output of qualified names. If
2922 short_names is set, names are printed unqualified. If unique_names is
2923 reset, the name prefix is reduced to the minimum required to achieve
2924 the original result when interning again, even if there is an overlap
2925 with earlier declarations.
2927 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
2928 now 'extend', and 'merge' gets an additional Pretty.pp argument
2929 (useful for printing error messages). INCOMPATIBILITY.
2931 * Pure: major reorganization of the theory context. Type Sign.sg and
2932 Theory.theory are now identified, referring to the universal
2933 Context.theory (see Pure/context.ML). Actual signature and theory
2934 content is managed as theory data. The old code and interfaces were
2935 spread over many files and structures; the new arrangement introduces
2936 considerable INCOMPATIBILITY to gain more clarity:
2938 Context -- theory management operations (name, identity, inclusion,
2939 parents, ancestors, merge, etc.), plus generic theory data;
2941 Sign -- logical signature and syntax operations (declaring consts,
2942 types, etc.), plus certify/read for common entities;
2944 Theory -- logical theory operations (stating axioms, definitions,
2945 oracles), plus a copy of logical signature operations (consts,
2946 types, etc.); also a few basic management operations (Theory.copy,
2949 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
2950 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
2951 for convenience -- they merely return the theory.
2953 * Pure: type Type.tsig is superceded by theory in most interfaces.
2955 * Pure: the Isar proof context type is already defined early in Pure
2956 as Context.proof (note that ProofContext.context and Proof.context are
2957 aliases, where the latter is the preferred name). This enables other
2958 Isabelle components to refer to that type even before Isar is present.
2960 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
2961 typeK, constK, axiomK, oracleK), but provide explicit operations for
2962 any of these kinds. For example, Sign.intern typeK is now
2963 Sign.intern_type, Theory.hide_space Sign.typeK is now
2964 Theory.hide_types. Also note that former
2965 Theory.hide_classes/types/consts are now
2966 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
2967 internalize their arguments! INCOMPATIBILITY.
2969 * Pure: get_thm interface (of PureThy and ProofContext) expects
2970 datatype thmref (with constructors Name and NameSelection) instead of
2971 plain string -- INCOMPATIBILITY;
2973 * Pure: cases produced by proof methods specify options, where NONE
2974 means to remove case bindings -- INCOMPATIBILITY in
2977 * Pure: the following operations retrieve axioms or theorems from a
2978 theory node or theory hierarchy, respectively:
2980 Theory.axioms_of: theory -> (string * term) list
2981 Theory.all_axioms_of: theory -> (string * term) list
2982 PureThy.thms_of: theory -> (string * thm) list
2983 PureThy.all_thms_of: theory -> (string * thm) list
2985 * Pure: print_tac now outputs the goal through the trace channel.
2987 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
2988 Reference Toplevel.debug (default false) controls detailed printing
2989 and tracing of low-level exceptions; Toplevel.profiling (default 0)
2990 controls execution profiling -- set to 1 for time and 2 for space
2991 (both increase the runtime).
2993 * Isar session: The initial use of ROOT.ML is now always timed,
2994 i.e. the log will show the actual process times, in contrast to the
2995 elapsed wall-clock time that the outer shell wrapper produces.
2997 * Simplifier: improved handling of bound variables (nameless
2998 representation, avoid allocating new strings). Simprocs that invoke
2999 the Simplifier recursively should use Simplifier.inherit_bounds to
3000 avoid local name clashes. Failure to do so produces warnings
3001 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
3002 for further details.
3004 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
3005 bindings for all theorems stored within a given theory; this may help
3006 in porting non-Isar theories to Isar ones, while keeping ML proof
3007 scripts for the time being.
3009 * ML operator HTML.with_charset specifies the charset begin used for
3010 generated HTML files. For example:
3012 HTML.with_charset "utf-8" use_thy "Hebrew";
3013 HTML.with_charset "utf-8" use_thy "Chinese";
3018 * Allow symlinks to all proper Isabelle executables (Isabelle,
3019 isabelle, isatool etc.).
3021 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
3022 isatool doc, isatool mkdir, display_drafts etc.).
3024 * isatool usedir: option -f allows specification of the ML file to be
3025 used by Isabelle; default is ROOT.ML.
3027 * New isatool version outputs the version identifier of the Isabelle
3028 distribution being used.
3030 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
3031 (containing Boolean satisfiability problems) into Isabelle/HOL
3036 New in Isabelle2004 (April 2004)
3037 --------------------------------
3041 * Provers/order.ML: new efficient reasoner for partial and linear orders.
3042 Replaces linorder.ML.
3044 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
3045 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
3046 (\<a>...\<z>), are now considered normal letters, and can therefore
3047 be used anywhere where an ASCII letter (a...zA...Z) has until
3048 now. COMPATIBILITY: This obviously changes the parsing of some
3049 terms, especially where a symbol has been used as a binder, say
3050 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
3051 as an identifier. Fix it by inserting a space around former
3052 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
3053 existing theory and ML files.
3055 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
3057 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
3058 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
3059 a normal (but invisible) letter. For multiple letter subscripts repeat
3060 \<^isub> like this: x\<^isub>1\<^isub>2.
3062 * Pure: There are now sub-/superscripts that can span more than one
3063 character. Text between \<^bsub> and \<^esub> is set in subscript in
3064 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
3065 superscript. The new control characters are not identifier parts.
3067 * Pure: Control-symbols of the form \<^raw:...> will literally print the
3068 content of "..." to the latex file instead of \isacntrl... . The "..."
3069 may consist of any printable characters excluding the end bracket >.
3071 * Pure: Using new Isar command "finalconsts" (or the ML functions
3072 Theory.add_finals or Theory.add_finals_i) it is now possible to
3073 declare constants "final", which prevents their being given a definition
3074 later. It is useful for constants whose behaviour is fixed axiomatically
3075 rather than definitionally, such as the meta-logic connectives.
3077 * Pure: 'instance' now handles general arities with general sorts
3078 (i.e. intersections of classes),
3080 * Presentation: generated HTML now uses a CSS style sheet to make layout
3081 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
3082 It can be changed to alter the colors/layout of generated pages.
3087 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
3088 cut_tac, subgoal_tac and thin_tac:
3089 - Now understand static (Isar) contexts. As a consequence, users of Isar
3090 locales are no longer forced to write Isar proof scripts.
3091 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
3093 - INCOMPATIBILITY: names of variables to be instantiated may no
3094 longer be enclosed in quotes. Instead, precede variable name with `?'.
3095 This is consistent with the instantiation attribute "where".
3097 * Attributes "where" and "of":
3098 - Now take type variables of instantiated theorem into account when reading
3099 the instantiation string. This fixes a bug that caused instantiated
3100 theorems to have too special types in some circumstances.
3101 - "where" permits explicit instantiations of type variables.
3103 * Calculation commands "moreover" and "also" no longer interfere with
3104 current facts ("this"), admitting arbitrary combinations with "then"
3108 - Goal statements involving the context element "includes" no longer
3109 generate theorems with internal delta predicates (those ending on
3110 "_axioms") in the premise.
3111 Resolve particular premise with <locale>.intro to obtain old form.
3112 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
3113 specification and "includes" elements in goal statement.
3114 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
3115 [intro?] and [elim?] (respectively) by default.
3116 - Experimental command for instantiation of locales in proof contexts:
3117 instantiate <label>[<attrs>]: <loc>
3118 Instantiates locale <loc> and adds all its theorems to the current context
3119 taking into account their attributes. Label and attrs are optional
3120 modifiers, like in theorem declarations. If present, names of
3121 instantiated theorems are qualified with <label>, and the attributes
3122 <attrs> are applied after any attributes these theorems might have already.
3123 If the locale has assumptions, a chained fact of the form
3124 "<loc> t1 ... tn" is expected from which instantiations of the parameters
3125 are derived. The command does not support old-style locales declared
3126 with "locale (open)".
3127 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
3129 * HOL: Tactic emulation methods induct_tac and case_tac understand static
3135 * Proof import: new image HOL4 contains the imported library from
3136 the HOL4 system with about 2500 theorems. It is imported by
3137 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
3138 can be used like any other Isabelle image. See
3139 HOL/Import/HOL/README for more information.
3142 - Much improved handling of linear and partial orders.
3143 Reasoners for linear and partial orders are set up for type classes
3144 "linorder" and "order" respectively, and are added to the default simpset
3145 as solvers. This means that the simplifier can build transitivity chains
3146 to solve goals from the assumptions.
3147 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
3148 of blast or auto after simplification become unnecessary because the goal
3149 is solved by simplification already.
3151 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
3152 all proved in axiomatic type classes for semirings, rings and fields.
3155 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
3156 now formalized using the Ring_and_Field theory mentioned above.
3157 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
3158 than before, because now they are set up once in a generic manner.
3159 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
3160 Look for the general versions in Ring_and_Field (and Power if they concern
3163 * Type "rat" of the rational numbers is now available in HOL-Complex.
3166 - Record types are now by default printed with their type abbreviation
3167 instead of the list of all field types. This can be configured via
3168 the reference "print_record_type_abbr".
3169 - Simproc "record_upd_simproc" for simplification of multiple updates added
3170 (not enabled by default).
3171 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
3172 EX x. x = sel r to True (not enabled by default).
3173 - Tactic "record_split_simp_tac" to split and simplify records added.
3175 * 'specification' command added, allowing for definition by
3176 specification. There is also an 'ax_specification' command that
3177 introduces the new constants axiomatically.
3179 * arith(_tac) is now able to generate counterexamples for reals as well.
3181 * HOL-Algebra: new locale "ring" for non-commutative rings.
3183 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
3184 definitions, thanks to Sava Krsti\'{c} and John Matthews.
3186 * HOL-Matrix: a first theory for matrices in HOL with an application of
3187 matrix theory to linear programming.
3189 * Unions and Intersections:
3190 The latex output syntax of UN and INT has been changed
3191 from "\Union x \in A. B" to "\Union_{x \in A} B"
3192 i.e. the index formulae has become a subscript.
3193 Similarly for "\Union x. B", and for \Inter instead of \Union.
3195 * Unions and Intersections over Intervals:
3196 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
3197 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
3198 like in normal math, and corresponding versions for < and for intersection.
3200 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
3201 lexicographic dictonary ordering has been added as "lexord".
3203 * ML: the legacy theory structures Int and List have been removed. They had
3204 conflicted with ML Basis Library structures having the same names.
3206 * 'refute' command added to search for (finite) countermodels. Only works
3207 for a fragment of HOL. The installation of an external SAT solver is
3208 highly recommended. See "HOL/Refute.thy" for details.
3210 * 'quickcheck' command: Allows to find counterexamples by evaluating
3211 formulae under an assignment of free variables to random values.
3212 In contrast to 'refute', it can deal with inductive datatypes,
3213 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
3219 * Streams now come with concatenation and are part of the HOLCF image
3223 New in Isabelle2003 (May 2003)
3224 ------------------------------
3228 * Provers/simplifier:
3230 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
3231 Assumptions are now subject to complete mutual simplification,
3232 not just from left to right. The simplifier now preserves
3233 the order of assumptions.
3235 Potential INCOMPATIBILITY:
3237 -- simp sometimes diverges where the old version did
3238 not, e.g. invoking simp on the goal
3240 [| P (f x); y = x; f x = f y |] ==> Q
3242 now gives rise to the infinite reduction sequence
3244 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
3246 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
3249 -- Tactics combining classical reasoner and simplification (such as auto)
3250 are also affected by this change, because many of them rely on
3251 simp. They may sometimes diverge as well or yield a different numbers
3252 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
3253 in case of problems. Sometimes subsequent calls to the classical
3254 reasoner will fail because a preceeding call to the simplifier too
3255 eagerly simplified the goal, e.g. deleted redundant premises.
3257 - The simplifier trace now shows the names of the applied rewrite rules
3259 - You can limit the number of recursive invocations of the simplifier
3260 during conditional rewriting (where the simplifie tries to solve the
3261 conditions before applying the rewrite rule):
3262 ML "simp_depth_limit := n"
3263 where n is an integer. Thus you can force termination where previously
3264 the simplifier would diverge.
3266 - Accepts free variables as head terms in congruence rules. Useful in Isar.
3268 - No longer aborts on failed congruence proof. Instead, the
3269 congruence is ignored.
3271 * Pure: New generic framework for extracting programs from constructive
3272 proofs. See HOL/Extraction.thy for an example instantiation, as well
3273 as HOL/Extraction for some case studies.
3275 * Pure: The main goal of the proof state is no longer shown by default, only
3276 the subgoals. This behaviour is controlled by a new flag.
3277 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
3278 (ML: Proof.show_main_goal).
3280 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
3281 rules whose conclusion matches subgoal 1:
3282 PG menu: Isabelle/Isar -> Show me -> matching rules
3283 The rules are ordered by how closely they match the subgoal.
3284 In particular, rules that solve a subgoal outright are displayed first
3285 (or rather last, the way they are printed).
3286 (ML: ProofGeneral.print_intros())
3288 * Pure: New flag trace_unify_fail causes unification to print
3289 diagnostic information (PG: in trace buffer) when it fails. This is
3290 useful for figuring out why single step proofs like rule, erule or
3293 * Pure: Locale specifications now produce predicate definitions
3294 according to the body of text (covering assumptions modulo local
3295 definitions); predicate "loc_axioms" covers newly introduced text,
3296 while "loc" is cumulative wrt. all included locale expressions; the
3297 latter view is presented only on export into the global theory
3298 context; potential INCOMPATIBILITY, use "(open)" option to fall back
3299 on the old view without predicates;
3301 * Pure: predefined locales "var" and "struct" are useful for sharing
3302 parameters (as in CASL, for example); just specify something like
3303 ``var x + var y + struct M'' as import;
3305 * Pure: improved thms_containing: proper indexing of facts instead of
3306 raw theorems; check validity of results wrt. current name space;
3307 include local facts of proof configuration (also covers active
3308 locales), cover fixed variables in index; may use "_" in term
3309 specification; an optional limit for the number of printed facts may
3310 be given (the default is 40);
3312 * Pure: disallow duplicate fact bindings within new-style theory files
3315 * Provers: improved induct method: assumptions introduced by case
3316 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
3317 the goal statement); "foo" still refers to all facts collectively;
3319 * Provers: the function blast.overloaded has been removed: all constants
3320 are regarded as potentially overloaded, which improves robustness in exchange
3321 for slight decrease in efficiency;
3323 * Provers/linorder: New generic prover for transitivity reasoning over
3324 linear orders. Note: this prover is not efficient!
3326 * Isar: preview of problems to finish 'show' now produce an error
3327 rather than just a warning (in interactive mode);
3334 - Produces a counter example if it cannot prove a goal.
3335 Note that the counter example may be spurious if the goal is not a formula
3336 of quantifier-free linear arithmetic.
3337 In ProofGeneral the counter example appears in the trace buffer.
3339 - Knows about div k and mod k where k is a numeral of type nat or int.
3341 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
3342 linear arithmetic fails. This takes account of quantifiers and divisibility.
3343 Presburger arithmetic can also be called explicitly via presburger(_tac).
3345 * simp's arithmetic capabilities have been enhanced a bit: it now
3346 takes ~= in premises into account (by performing a case split);
3348 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
3349 are distributed over a sum of terms;
3351 * New tactic "trans_tac" and method "trans" instantiate
3352 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
3355 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
3356 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
3358 * 'typedef' command has new option "open" to suppress the set
3361 * functions Min and Max on finite sets have been introduced (theory
3364 * attribute [symmetric] now works for relations as well; it turns
3365 (x,y) : R^-1 into (y,x) : R, and vice versa;
3367 * induct over a !!-quantified statement (say !!x1..xn):
3368 each "case" automatically performs "fix x1 .. xn" with exactly those names.
3370 * Map: `empty' is no longer a constant but a syntactic abbreviation for
3371 %x. None. Warning: empty_def now refers to the previously hidden definition
3374 * Algebra: formalization of classical algebra. Intended as base for
3375 any algebraic development in Isabelle. Currently covers group theory
3376 (up to Sylow's theorem) and ring theory (Universal Property of
3377 Univariate Polynomials). Contributions welcome;
3379 * GroupTheory: deleted, since its material has been moved to Algebra;
3381 * Complex: new directory of the complex numbers with numeric constants,
3382 nonstandard complex numbers, and some complex analysis, standard and
3383 nonstandard (Jacques Fleuriot);
3385 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
3387 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
3390 * Real/HahnBanach: updated and adapted to locales;
3392 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
3395 * UNITY: added the Meier-Sanders theory of progress sets;
3397 * MicroJava: bytecode verifier and lightweight bytecode verifier
3398 as abstract algorithms, instantiated to the JVM;
3400 * Bali: Java source language formalization. Type system, operational
3401 semantics, axiomatic semantics. Supported language features:
3402 classes, interfaces, objects,virtual methods, static methods,
3403 static/instance fields, arrays, access modifiers, definite
3404 assignment, exceptions.
3409 * ZF/Constructible: consistency proof for AC (Gdel's constructible
3412 * Main ZF: virtually all theories converted to new-style format;
3417 * Pure: Tactic.prove provides sane interface for internal proofs;
3418 omits the infamous "standard" operation, so this is more appropriate
3419 than prove_goalw_cterm in many situations (e.g. in simprocs);
3421 * Pure: improved error reporting of simprocs;
3423 * Provers: Simplifier.simproc(_i) provides sane interface for setting
3427 *** Document preparation ***
3429 * uses \par instead of \\ for line breaks in theory text. This may
3430 shift some page breaks in large documents. To get the old behaviour
3431 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
3433 * minimized dependencies of isabelle.sty and isabellesym.sty on
3436 * \<euro> now needs package babel/greek instead of marvosym (which
3439 * normal size for \<zero>...\<nine> (uses \mathbf instead of
3444 New in Isabelle2002 (March 2002)
3445 --------------------------------
3447 *** Document preparation ***
3449 * greatly simplified document preparation setup, including more
3450 graceful interpretation of isatool usedir -i/-d/-D options, and more
3451 instructive isatool mkdir; users should basically be able to get
3452 started with "isatool mkdir HOL Test && isatool make"; alternatively,
3453 users may run a separate document processing stage manually like this:
3454 "isatool usedir -D output HOL Test && isatool document Test/output";
3456 * theory dependency graph may now be incorporated into documents;
3457 isatool usedir -g true will produce session_graph.eps/.pdf for use
3458 with \includegraphics of LaTeX;
3460 * proper spacing of consecutive markup elements, especially text
3461 blocks after section headings;
3463 * support bold style (for single symbols only), input syntax is like
3464 this: "\<^bold>\<alpha>" or "\<^bold>A";
3466 * \<bullet> is now output as bold \cdot by default, which looks much
3467 better in printed text;
3469 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
3470 note that these symbols are currently unavailable in Proof General /
3471 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
3473 * isatool latex no longer depends on changed TEXINPUTS, instead
3474 isatool document copies the Isabelle style files to the target
3480 * Pure/Provers: improved proof by cases and induction;
3481 - 'case' command admits impromptu naming of parameters (such as
3483 - 'induct' method divinates rule instantiation from the inductive
3484 claim; no longer requires excessive ?P bindings for proper
3485 instantiation of cases;
3486 - 'induct' method properly enumerates all possibilities of set/type
3487 rules; as a consequence facts may be also passed through *type*
3488 rules without further ado;
3489 - 'induct' method now derives symbolic cases from the *rulified*
3490 rule (before it used to rulify cases stemming from the internal
3491 atomized version); this means that the context of a non-atomic
3492 statement becomes is included in the hypothesis, avoiding the
3493 slightly cumbersome show "PROP ?case" form;
3494 - 'induct' may now use elim-style induction rules without chaining
3495 facts, using ``missing'' premises from the goal state; this allows
3496 rules stemming from inductive sets to be applied in unstructured
3497 scripts, while still benefitting from proper handling of non-atomic
3498 statements; NB: major inductive premises need to be put first, all
3499 the rest of the goal is passed through the induction;
3500 - 'induct' proper support for mutual induction involving non-atomic
3501 rule statements (uses the new concept of simultaneous goals, see
3503 - append all possible rule selections, but only use the first
3504 success (no backtracking);
3505 - removed obsolete "(simplified)" and "(stripped)" options of methods;
3506 - undeclared rule case names default to numbers 1, 2, 3, ...;
3507 - added 'print_induct_rules' (covered by help item in recent Proof
3509 - moved induct/cases attributes to Pure, methods to Provers;
3510 - generic method setup instantiated for FOL and HOL;
3512 * Pure: support multiple simultaneous goal statements, for example
3513 "have a: A and b: B" (same for 'theorem' etc.); being a pure
3514 meta-level mechanism, this acts as if several individual goals had
3515 been stated separately; in particular common proof methods need to be
3516 repeated in order to cover all claims; note that a single elimination
3517 step is *not* sufficient to establish the two conjunctions, so this
3520 assume "A & B" then have A and B .. (*".." fails*)
3522 better use "obtain" in situations as above; alternative refer to
3523 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
3525 * Pure: proper integration with ``locales''; unlike the original
3526 version by Florian Kammller, Isar locales package high-level proof
3527 contexts rather than raw logical ones (e.g. we admit to include
3528 attributes everywhere); operations on locales include merge and
3529 rename; support for implicit arguments (``structures''); simultaneous
3530 type-inference over imports and text; see also HOL/ex/Locales.thy for
3533 * Pure: the following commands have been ``localized'', supporting a
3534 target locale specification "(in name)": 'lemma', 'theorem',
3535 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
3536 stored both within the locale and at the theory level (exported and
3537 qualified by the locale name);
3539 * Pure: theory goals may now be specified in ``long'' form, with
3540 ad-hoc contexts consisting of arbitrary locale elements. for example
3541 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
3542 definitions may be given, too); the result is a meta-level rule with
3543 the context elements being discharged in the obvious way;
3545 * Pure: new proof command 'using' allows to augment currently used
3546 facts after a goal statement ('using' is syntactically analogous to
3547 'apply', but acts on the goal's facts only); this allows chained facts
3548 to be separated into parts given before and after a claim, as in
3549 ``from a and b have C using d and e <proof>'';
3551 * Pure: renamed "antecedent" case to "rule_context";
3553 * Pure: new 'judgment' command records explicit information about the
3554 object-logic embedding (used by several tools internally); no longer
3555 use hard-wired "Trueprop";
3557 * Pure: added 'corollary' command;
3559 * Pure: fixed 'token_translation' command;
3561 * Pure: removed obsolete 'exported' attribute;
3563 * Pure: dummy pattern "_" in is/let is now automatically lifted over
3564 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
3565 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
3567 * Pure: method 'atomize' presents local goal premises as object-level
3568 statements (atomic meta-level propositions); setup controlled via
3569 rewrite rules declarations of 'atomize' attribute; example
3570 application: 'induct' method with proper rule statements in improper
3573 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
3574 now consider the syntactic context of assumptions, giving a better
3575 chance to get type-inference of the arguments right (this is
3576 especially important for locales);
3578 * Pure: "sorry" no longer requires quick_and_dirty in interactive
3581 * Pure/obtain: the formal conclusion "thesis", being marked as
3582 ``internal'', may no longer be reference directly in the text;
3583 potential INCOMPATIBILITY, may need to use "?thesis" in rare
3586 * Pure: generic 'sym' attribute which declares a rule both as pure
3587 'elim?' and for the 'symmetric' operation;
3589 * Pure: marginal comments ``--'' may now occur just anywhere in the
3590 text; the fixed correlation with particular command syntax has been
3593 * Pure: new method 'rules' is particularly well-suited for proof
3594 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
3595 but often produces more compact proof terms with less detours;
3597 * Pure/Provers/classical: simplified integration with pure rule
3598 attributes and methods; the classical "intro?/elim?/dest?"
3599 declarations coincide with the pure ones; the "rule" method no longer
3600 includes classically swapped intros; "intro" and "elim" methods no
3601 longer pick rules from the context; also got rid of ML declarations
3602 AddXIs/AddXEs/AddXDs; all of this has some potential for
3605 * Provers/classical: attribute 'swapped' produces classical inversions
3606 of introduction rules;
3608 * Provers/simplifier: 'simplified' attribute may refer to explicit
3609 rules instead of full simplifier context; 'iff' attribute handles
3612 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
3614 * HOL: 'recdef' now fails on unfinished automated proofs, use
3615 "(permissive)" option to recover old behavior;
3617 * HOL: 'inductive' no longer features separate (collective) attributes
3618 for 'intros' (was found too confusing);
3620 * HOL: properly declared induction rules less_induct and
3626 * HOL: moved over to sane numeral syntax; the new policy is as
3629 - 0 and 1 are polymorphic constants, which are defined on any
3630 numeric type (nat, int, real etc.);
3632 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
3633 binary representation internally;
3635 - type nat has special constructor Suc, and generally prefers Suc 0
3636 over 1::nat and Suc (Suc 0) over 2::nat;
3638 This change may cause significant problems of INCOMPATIBILITY; here
3639 are some hints on converting existing sources:
3641 - due to the new "num" token, "-0" and "-1" etc. are now atomic
3642 entities, so expressions involving "-" (unary or binary minus) need
3643 to be spaced properly;
3645 - existing occurrences of "1" may need to be constraint "1::nat" or
3646 even replaced by Suc 0; similar for old "2";
3648 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
3650 - remove all special provisions on numerals in proofs;
3652 * HOL: simp rules nat_number expand numerals on nat to Suc/0
3653 representation (depends on bin_arith_simps in the default context);
3655 * HOL: symbolic syntax for x^2 (numeral 2);
3657 * HOL: the class of all HOL types is now called "type" rather than
3658 "term"; INCOMPATIBILITY, need to adapt references to this type class
3659 in axclass/classes, instance/arities, and (usually rare) occurrences
3660 in typings (of consts etc.); internally the class is called
3661 "HOL.type", ML programs should refer to HOLogic.typeS;
3663 * HOL/record package improvements:
3664 - new derived operations "fields" to build a partial record section,
3665 "extend" to promote a fixed record to a record scheme, and
3666 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
3667 declared as simp by default;
3668 - shared operations ("more", "fields", etc.) now need to be always
3669 qualified) --- potential INCOMPATIBILITY;
3670 - removed "make_scheme" operations (use "make" with "extend") --
3672 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
3673 - provides cases/induct rules for use with corresponding Isar
3674 methods (for concrete records, record schemes, concrete more
3675 parts, and schematic more parts -- in that order);
3676 - internal definitions directly based on a light-weight abstract
3677 theory of product types over typedef rather than datatype;
3679 * HOL: generic code generator for generating executable ML code from
3680 specifications; specific support for HOL constructs such as inductive
3681 datatypes and sets, as well as recursive functions; can be invoked
3682 via 'generate_code' theory section;
3684 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
3686 * HOL: consolidated and renamed several theories. In particular:
3687 Ord.thy has been absorbed into HOL.thy
3688 String.thy has been absorbed into List.thy
3690 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
3691 (beware of argument permutation!);
3693 * HOL: linorder_less_split superseded by linorder_cases;
3695 * HOL/List: "nodups" renamed to "distinct";
3697 * HOL: added "The" definite description operator; move Hilbert's "Eps"
3698 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
3699 - Ex_def has changed, now need to use some_eq_ex
3701 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
3702 in this (rare) case use:
3704 delSWrapper "split_all_tac"
3705 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
3707 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
3710 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
3711 Isabelle's type classes, ^ on functions and relations has too general
3712 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
3713 necessary to attach explicit type constraints;
3715 * HOL/Relation: the prefix name of the infix "O" has been changed from
3716 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
3717 renamed accordingly (eg "compI" -> "rel_compI").
3719 * HOL: syntax translations now work properly with numerals and records
3722 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
3723 of "lam" -- INCOMPATIBILITY;
3725 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
3726 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
3727 renamed "Product_Type.unit";
3729 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
3731 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
3732 the "cases" method);
3734 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
3737 * HOL/IMP: updated and converted to new-style theory format; several
3738 parts turned into readable document, with proper Isar proof texts and
3739 some explanations (by Gerwin Klein);
3741 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
3743 * HOL-Hyperreal is now a logic image;
3748 * Isar: consts/constdefs supports mixfix syntax for continuous
3751 * Isar: domain package adapted to new-style theory format, e.g. see
3754 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
3755 potential INCOMPATIBILITY; now use plain induct_tac instead of former
3756 lift.induct_tac, always use UU instead of Undef;
3758 * HOLCF/IMP: updated and converted to new-style theory;
3763 * Isar: proper integration of logic-specific tools and packages,
3764 including theory commands '(co)inductive', '(co)datatype',
3765 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
3766 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
3768 * theory Main no longer includes AC; for the Axiom of Choice, base
3769 your theory on Main_ZFC;
3771 * the integer library now covers quotients and remainders, with many
3772 laws relating division to addition, multiplication, etc.;
3774 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
3775 typeless version of the formalism;
3777 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
3780 * ZF/Induct: new directory for examples of inductive definitions,
3781 including theory Multiset for multiset orderings; converted to
3782 new-style theory format;
3784 * ZF: many new theorems about lists, ordinals, etc.;
3789 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
3790 variable proof controls level of detail: 0 = no proofs (only oracle
3791 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
3792 also ref manual for further ML interfaces;
3794 * Pure/axclass: removed obsolete ML interface
3795 goal_subclass/goal_arity;
3797 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
3798 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
3799 separate tokens, so expressions involving minus need to be spaced
3802 * Pure/syntax: support non-oriented infixes, using keyword "infix"
3803 rather than "infixl" or "infixr";
3805 * Pure/syntax: concrete syntax for dummy type variables admits genuine
3806 sort constraint specifications in type inference; e.g. "x::_::foo"
3807 ensures that the type of "x" is of sort "foo" (but not necessarily a
3810 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
3811 control output of nested => (types); the default behavior is
3814 * Pure/syntax: builtin parse translation for "_constify" turns valued
3815 tokens into AST constants;
3817 * Pure/syntax: prefer later declarations of translations and print
3818 translation functions; potential INCOMPATIBILITY: need to reverse
3819 multiple declarations for same syntax element constant;
3821 * Pure/show_hyps reset by default (in accordance to existing Isar
3824 * Provers/classical: renamed addaltern to addafter, addSaltern to
3827 * Provers/clasimp: ``iff'' declarations now handle conditional rules
3830 * system: tested support for MacOS X; should be able to get Isabelle +
3831 Proof General to work in a plain Terminal after installing Poly/ML
3832 (e.g. from the Isabelle distribution area) and GNU bash alone
3833 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
3834 support requires further installations, e.g. from
3835 http://fink.sourceforge.net/);
3837 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
3839 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
3840 of 40 MB), cf. ML_OPTIONS;
3842 * system: Proof General keywords specification is now part of the
3843 Isabelle distribution (see etc/isar-keywords.el);
3845 * system: support for persistent Proof General sessions (refrain from
3846 outdating all loaded theories on startup); user may create writable
3847 logic images like this: ``isabelle -q HOL Test'';
3849 * system: smart selection of Isabelle process versus Isabelle
3850 interface, accommodates case-insensitive file systems (e.g. HFS+); may
3851 run both "isabelle" and "Isabelle" even if file names are badly
3852 damaged (executable inspects the case of the first letter of its own
3853 name); added separate "isabelle-process" and "isabelle-interface";
3855 * system: refrain from any attempt at filtering input streams; no
3856 longer support ``8bit'' encoding of old isabelle font, instead proper
3857 iso-latin characters may now be used; the related isatools
3858 "symbolinput" and "nonascii" have disappeared as well;
3860 * system: removed old "xterm" interface (the print modes "xterm" and
3861 "xterm_color" are still available for direct use in a suitable
3866 New in Isabelle99-2 (February 2001)
3867 -----------------------------------
3869 *** Overview of INCOMPATIBILITIES ***
3871 * HOL: please note that theories in the Library and elsewhere often use the
3872 new-style (Isar) format; to refer to their theorems in an ML script you must
3873 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
3875 * HOL: inductive package no longer splits induction rule aggressively,
3876 but only as far as specified by the introductions given; the old
3877 format may be recovered via ML function complete_split_rule or attribute
3878 'split_rule (complete)';
3880 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
3881 gfp_Tarski to gfp_unfold;
3883 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
3885 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
3886 relation); infix "^^" has been renamed "``"; infix "``" has been
3887 renamed "`"; "univalent" has been renamed "single_valued";
3889 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
3892 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
3894 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
3896 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
3897 consequence, it is no longer monotonic wrt. the local goal context
3898 (which is now passed through the inductive cases);
3900 * Document preparation: renamed standard symbols \<ll> to \<lless> and
3901 \<gg> to \<ggreater>;
3904 *** Document preparation ***
3906 * \isabellestyle{NAME} selects version of Isabelle output (currently
3907 available: are "it" for near math-mode best-style output, "sl" for
3908 slanted text style, and "tt" for plain type-writer; if no
3909 \isabellestyle command is given, output is according to slanted
3912 * support sub/super scripts (for single symbols only), input syntax is
3913 like this: "A\<^sup>*" or "A\<^sup>\<star>";
3915 * some more standard symbols; see Appendix A of the system manual for
3916 the complete list of symbols defined in isabellesym.sty;
3918 * improved isabelle style files; more abstract symbol implementation
3919 (should now use \isamath{...} and \isatext{...} in custom symbol
3922 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
3923 state; Note that presentation of goal states does not conform to
3924 actual human-readable proof documents. Please do not include goal
3925 states into document output unless you really know what you are doing!
3927 * proper indentation of antiquoted output with proportional LaTeX
3930 * no_document ML operator temporarily disables LaTeX document
3933 * isatool unsymbolize tunes sources for plain ASCII communication;
3938 * Pure: Isar now suffers initial goal statements to contain unbound
3939 schematic variables (this does not conform to actual readable proof
3940 documents, due to unpredictable outcome and non-compositional proof
3941 checking); users who know what they are doing may use schematic goals
3942 for Prolog-style synthesis of proven results;
3944 * Pure: assumption method (an implicit finishing) now handles actual
3947 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
3948 initial goal, declare "that" only as Pure intro (only for single
3949 steps); the "that" rule assumption may now be involved in implicit
3950 finishing, thus ".." becomes a feasible for trivial obtains;
3952 * Pure: default proof step now includes 'intro_classes'; thus trivial
3953 instance proofs may be performed by "..";
3955 * Pure: ?thesis / ?this / "..." now work for pure meta-level
3958 * Pure: more robust selection of calculational rules;
3960 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
3961 rule (as well as the assumption rule);
3963 * Pure: 'thm_deps' command visualizes dependencies of theorems and
3964 lemmas, using the graph browser tool;
3966 * Pure: predict failure of "show" in interactive mode;
3968 * Pure: 'thms_containing' now takes actual terms as arguments;
3970 * HOL: improved method 'induct' --- now handles non-atomic goals
3971 (potential INCOMPATIBILITY); tuned error handling;
3973 * HOL: cases and induct rules now provide explicit hints about the
3974 number of facts to be consumed (0 for "type" and 1 for "set" rules);
3975 any remaining facts are inserted into the goal verbatim;
3977 * HOL: local contexts (aka cases) may now contain term bindings as
3978 well; the 'cases' and 'induct' methods new provide a ?case binding for
3979 the result to be shown in each case;
3981 * HOL: added 'recdef_tc' command;
3983 * isatool convert assists in eliminating legacy ML scripts;
3988 * HOL/Library: a collection of generic theories to be used together
3989 with main HOL; the theory loader path already includes this directory
3990 by default; the following existing theories have been moved here:
3991 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
3992 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
3994 * HOL/Unix: "Some aspects of Unix file-system security", a typical
3995 modelling and verification task performed in Isabelle/HOL +
3996 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
3998 * HOL/Algebra: special summation operator SUM no longer exists, it has
3999 been replaced by setsum; infix 'assoc' now has priority 50 (like
4000 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
4001 'domain', this makes the theory consistent with mathematical
4004 * HOL basics: added overloaded operations "inverse" and "divide"
4005 (infix "/"), syntax for generic "abs" operation, generic summation
4008 * HOL/typedef: simplified package, provide more useful rules (see also
4011 * HOL/datatype: induction rule for arbitrarily branching datatypes is
4012 now expressed as a proper nested rule (old-style tactic scripts may
4013 require atomize_strip_tac to cope with non-atomic premises);
4015 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
4016 to "split_conv" (old name still available for compatibility);
4018 * HOL: improved concrete syntax for strings (e.g. allows translation
4019 rules with string literals);
4021 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
4022 and Fleuriot's mechanization of analysis, including the transcendental
4023 functions for the reals;
4025 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
4030 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
4031 "lam" is displayed as TWO lambda-symbols
4033 * CTT: theory Main now available, containing everything (that is, Bool
4039 * Pure: the Simplifier has been implemented properly as a derived rule
4040 outside of the actual kernel (at last!); the overall performance
4041 penalty in practical applications is about 50%, while reliability of
4042 the Isabelle inference kernel has been greatly improved;
4044 * print modes "brackets" and "no_brackets" control output of nested =>
4045 (types) and ==> (props); the default behaviour is "brackets";
4047 * Provers: fast_tac (and friends) now handle actual object-logic rules
4048 as assumptions as well;
4050 * system: support Poly/ML 4.0;
4052 * system: isatool install handles KDE version 1 or 2;
4056 New in Isabelle99-1 (October 2000)
4057 ----------------------------------
4059 *** Overview of INCOMPATIBILITIES ***
4061 * HOL: simplification of natural numbers is much changed; to partly
4062 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
4063 issue the following ML commands:
4065 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
4066 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
4068 * HOL: simplification no longer dives into case-expressions; this is
4069 controlled by "t.weak_case_cong" for each datatype t;
4071 * HOL: nat_less_induct renamed to less_induct;
4073 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
4074 fixsome to patch .thy and .ML sources automatically;
4076 select_equality -> some_equality
4077 select_eq_Ex -> some_eq_ex
4078 selectI2EX -> someI2_ex
4081 select1_equality -> some1_equality
4082 Eps_sym_eq -> some_sym_eq_trivial
4083 Eps_eq -> some_eq_trivial
4085 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
4087 * HOL: removed obsolete theorem binding expand_if (refer to split_if
4090 * HOL: the recursion equations generated by 'recdef' are now called
4091 f.simps instead of f.rules;
4093 * HOL: qed_spec_mp now also handles bounded ALL as well;
4095 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
4096 sometimes be needed;
4098 * HOL: the constant for "f``x" is now "image" rather than "op ``";
4100 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
4102 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
4103 product is now "<*>" instead of "Times"; the lexicographic product is
4104 now "<*lex*>" instead of "**";
4106 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
4107 of main HOL, but was unused); better use HOL's datatype package;
4109 * HOL: removed "symbols" syntax for constant "override" of theory Map;
4110 the old syntax may be recovered as follows:
4113 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
4114 (infixl "\\<oplus>" 100)
4116 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4118 * HOL/ML: even fewer consts are declared as global (see theories Ord,
4119 Lfp, Gfp, WF); this only affects ML packages that refer to const names
4122 * HOL and ZF: syntax for quotienting wrt an equivalence relation
4123 changed from A/r to A//r;
4125 * ZF: new treatment of arithmetic (nat & int) may break some old
4128 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
4129 rulify -> rule_format, elimify -> elim_format, ...);
4131 * Isar/Provers: intro/elim/dest attributes changed; renamed
4132 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
4133 should have to change intro!! to intro? only); replaced "delrule" by
4136 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
4138 * Provers: strengthened force_tac by using new first_best_tac;
4140 * LaTeX document preparation: several changes of isabelle.sty (see
4144 *** Document preparation ***
4146 * formal comments (text blocks etc.) in new-style theories may now
4147 contain antiquotations of thm/prop/term/typ/text to be presented
4148 according to latex print mode; concrete syntax is like this:
4149 @{term[show_types] "f(x) = a + x"};
4151 * isatool mkdir provides easy setup of Isabelle session directories,
4152 including proper document sources;
4154 * generated LaTeX sources are now deleted after successful run
4155 (isatool document -c); may retain a copy somewhere else via -D option
4158 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
4159 style files, achieving self-contained LaTeX sources and simplifying
4162 * old-style theories now produce (crude) LaTeX output as well;
4164 * browser info session directories are now self-contained (may be put
4165 on WWW server seperately); improved graphs of nested sessions; removed
4166 graph for 'all sessions';
4168 * several improvements in isabelle style files; \isabellestyle{it}
4169 produces fake math mode output; \isamarkupheader is now \section by
4170 default; see lib/texinputs/isabelle.sty etc.;
4175 * Isar/Pure: local results and corresponding term bindings are now
4176 subject to Hindley-Milner polymorphism (similar to ML); this
4177 accommodates incremental type-inference very nicely;
4179 * Isar/Pure: new derived language element 'obtain' supports
4180 generalized existence reasoning;
4182 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
4183 support accumulation of results, without applying any rules yet;
4184 useful to collect intermediate results without explicit name
4185 references, and for use with transitivity rules with more than 2
4188 * Isar/Pure: scalable support for case-analysis type proofs: new
4189 'case' language element refers to local contexts symbolically, as
4190 produced by certain proof methods; internally, case names are attached
4191 to theorems as "tags";
4193 * Isar/Pure: theory command 'hide' removes declarations from
4194 class/type/const name spaces;
4196 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
4197 indicate potential overloading;
4199 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
4201 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
4202 "{a,b,c}" instead of {a,b,c};
4204 * Isar/Pure now provides its own version of intro/elim/dest
4205 attributes; useful for building new logics, but beware of confusion
4206 with the version in Provers/classical;
4208 * Isar/Pure: the local context of (non-atomic) goals is provided via
4209 case name 'antecedent';
4211 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
4212 to the current context is now done automatically);
4214 * Isar/Pure: theory command 'method_setup' provides a simple interface
4215 for definining proof methods in ML;
4217 * Isar/Provers: intro/elim/dest attributes changed; renamed
4218 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
4219 most cases, one should have to change intro!! to intro? only);
4220 replaced "delrule" by "rule del";
4222 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
4223 'symmetric' attribute (the latter supercedes [RS sym]);
4225 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
4226 method modifier); 'simp' method: 'only:' modifier removes loopers as
4227 well (including splits);
4229 * Isar/Provers: Simplifier and Classical methods now support all kind
4230 of modifiers used in the past, including 'cong', 'iff', etc.
4232 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
4233 of Simplifier and Classical reasoner);
4235 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
4236 now support named cases; major packages (inductive, datatype, primrec,
4237 recdef) support case names and properly name parameters;
4239 * Isar/HOL: new transitivity rules for substitution in inequalities --
4240 monotonicity conditions are extracted to be proven at end of
4243 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
4246 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
4247 split_if split_if_asm; datatype package provides theorems foo.splits =
4248 foo.split foo.split_asm for each datatype;
4250 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
4251 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
4252 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
4253 use "(cases (simplified))" method in proper proof texts);
4255 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
4257 * Isar: names of theorems etc. may be natural numbers as well;
4259 * Isar: 'pr' command: optional arguments for goals_limit and
4260 ProofContext.prems_limit; no longer prints theory contexts, but only
4263 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
4264 additional print modes to be specified; e.g. "pr(latex)" will print
4265 proof state according to the Isabelle LaTeX style;
4267 * Isar: improved support for emulating tactic scripts, including proof
4268 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
4269 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
4270 (for HOL datatypes);
4272 * Isar: simplified (more robust) goal selection of proof methods: 1st
4273 goal, all goals, or explicit goal specifier (tactic emulation); thus
4274 'proof method scripts' have to be in depth-first order;
4276 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
4278 * Isar: removed 'help' command, which hasn't been too helpful anyway;
4279 should instead use individual commands for printing items
4280 (print_commands, print_methods etc.);
4282 * Isar: added 'nothing' --- the empty list of theorems;
4287 * HOL/MicroJava: formalization of a fragment of Java, together with a
4288 corresponding virtual machine and a specification of its bytecode
4289 verifier and a lightweight bytecode verifier, including proofs of
4290 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
4291 Cornelia Pusch (see also the homepage of project Bali at
4292 http://isabelle.in.tum.de/Bali/);
4294 * HOL/Algebra: new theory of rings and univariate polynomials, by
4297 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
4298 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
4301 * HOL/Lattice: fundamental concepts of lattice theory and order
4302 structures, including duals, properties of bounds versus algebraic
4303 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
4304 Theorem for complete lattices etc.; may also serve as a demonstration
4305 for abstract algebraic reasoning using axiomatic type classes, and
4306 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
4308 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
4311 * HOL/IMPP: extension of IMP with local variables and mutually
4312 recursive procedures, by David von Oheimb;
4314 * HOL/Lambda: converted into new-style theory and document;
4316 * HOL/ex/Multiquote: example of multiple nested quotations and
4317 anti-quotations -- basically a generalized version of de-Bruijn
4318 representation; very useful in avoiding lifting of operations;
4320 * HOL/record: added general record equality rule to simpset; fixed
4321 select-update simplification procedure to handle extended records as
4322 well; admit "r" as field name;
4324 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
4325 other numeric types and also as the identity of groups, rings, etc.;
4327 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
4328 Types nat and int belong to this axclass;
4330 * HOL: greatly improved simplification involving numerals of type nat, int, real:
4331 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
4332 i*j + k + j*#3*i simplifies to #4*(i*j) + k
4333 two terms #m*u and #n*u are replaced by #(m+n)*u
4334 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
4335 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
4336 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
4338 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
4339 powerful prover for predicate logic but knows nothing of clasets; see
4340 ex/mesontest.ML and ex/mesontest2.ML for example applications;
4342 * HOL: new version of "case_tac" subsumes both boolean case split and
4343 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
4344 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
4346 * HOL: simplification no longer dives into case-expressions: only the
4347 selector expression is simplified, but not the remaining arms; to
4348 enable full simplification of case-expressions for datatype t, you may
4349 remove t.weak_case_cong from the simpset, either globally (Delcongs
4350 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
4352 * HOL/recdef: the recursion equations generated by 'recdef' for
4353 function 'f' are now called f.simps instead of f.rules; if all
4354 termination conditions are proved automatically, these simplification
4355 rules are added to the simpset, as in primrec; rules may be named
4356 individually as well, resulting in a separate list of theorems for
4359 * HOL/While is a new theory that provides a while-combinator. It
4360 permits the definition of tail-recursive functions without the
4361 provision of a termination measure. The latter is necessary once the
4362 invariant proof rule for while is applied.
4364 * HOL: new (overloaded) notation for the set of elements below/above
4365 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
4367 * HOL: theorems impI, allI, ballI bound as "strip";
4369 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
4370 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
4371 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
4373 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4375 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
4376 main HOL, but was unused);
4378 * HOL: fewer consts declared as global (e.g. have to refer to
4379 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
4381 * HOL: tuned AST representation of nested pairs, avoiding bogus output
4382 in case of overlap with user translations (e.g. judgements over
4383 tuples); (note that the underlying logical represenation is still
4389 * ZF: simplification automatically cancels common terms in arithmetic
4390 expressions over nat and int;
4392 * ZF: new treatment of nat to minimize type-checking: all operators
4393 coerce their operands to a natural number using the function natify,
4394 making the algebraic laws unconditional;
4396 * ZF: as above, for int: operators coerce their operands to an integer
4397 using the function intify;
4399 * ZF: the integer library now contains many of the usual laws for the
4400 orderings, including $<=, and monotonicity laws for $+ and $*;
4402 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
4405 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
4406 to the simplifier and classical reasoner simultaneously;
4411 * Provers: blast_tac now handles actual object-logic rules as
4412 assumptions; note that auto_tac uses blast_tac internally as well;
4414 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
4415 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
4417 * Provers: delrules now handles destruct rules as well (no longer need
4418 explicit make_elim);
4420 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
4421 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4422 use instead the strong form,
4423 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4424 in HOL, FOL and ZF the function cla_make_elim will create such rules
4425 from destruct-rules;
4427 * Provers: Simplifier.easy_setup provides a fast path to basic
4428 Simplifier setup for new object-logics;
4430 * Pure: AST translation rules no longer require constant head on LHS;
4432 * Pure: improved name spaces: ambiguous output is qualified; support
4433 for hiding of names;
4435 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
4436 XSYMBOL_HOME; no longer need to do manual configuration in most
4439 * system: compression of ML heaps images may now be controlled via -c
4440 option of isabelle and isatool usedir (currently only observed by
4443 * system: isatool installfonts may handle X-Symbol fonts as well (very
4444 useful for remote X11);
4446 * system: provide TAGS file for Isabelle sources;
4448 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
4451 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
4452 timing flag supersedes proof_timing and Toplevel.trace;
4454 * ML: new combinators |>> and |>>> for incremental transformations
4455 with secondary results (e.g. certain theory extensions):
4457 * ML: PureThy.add_defs gets additional argument to indicate potential
4458 overloading (usually false);
4460 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
4465 New in Isabelle99 (October 1999)
4466 --------------------------------
4468 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4470 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
4471 are no longer simplified. (This allows the simplifier to unfold recursive
4472 functional programs.) To restore the old behaviour, declare
4474 Delcongs [if_weak_cong];
4476 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
4479 * HOL: the predicate "inj" is now defined by translation to "inj_on";
4481 * HOL/datatype: mutual_induct_tac no longer exists --
4482 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
4484 * HOL/typedef: fixed type inference for representing set; type
4485 arguments now have to occur explicitly on the rhs as type constraints;
4487 * ZF: The con_defs part of an inductive definition may no longer refer
4488 to constants declared in the same theory;
4490 * HOL, ZF: the function mk_cases, generated by the inductive
4491 definition package, has lost an argument. To simplify its result, it
4492 uses the default simpset instead of a supplied list of theorems.
4494 * HOL/List: the constructors of type list are now Nil and Cons;
4496 * Simplifier: the type of the infix ML functions
4497 setSSolver addSSolver setSolver addSolver
4498 is now simpset * solver -> simpset where `solver' is a new abstract type
4499 for packaging solvers. A solver is created via
4500 mk_solver: string -> (thm list -> int -> tactic) -> solver
4501 where the string argument is only a comment.
4506 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
4507 decision procedure for linear arithmetic. Currently it is used for
4508 types `nat', `int', and `real' in HOL (see below); it can, should and
4509 will be instantiated for other types and logics as well.
4511 * The simplifier now accepts rewrite rules with flexible heads, eg
4512 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
4513 They are applied like any rule with a non-pattern lhs, i.e. by first-order
4519 * New Isabelle/Isar subsystem provides an alternative to traditional
4520 tactical theorem proving; together with the ProofGeneral/isar user
4521 interface it offers an interactive environment for developing human
4522 readable proof documents (Isar == Intelligible semi-automated
4523 reasoning); for further information see isatool doc isar-ref,
4524 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
4526 * improved and simplified presentation of theories: better HTML markup
4527 (including colors), graph views in several sizes; isatool usedir now
4528 provides a proper interface for user theories (via -P option); actual
4529 document preparation based on (PDF)LaTeX is available as well (for
4530 new-style theories only); see isatool doc system for more information;
4532 * native support for Proof General, both for classic Isabelle and
4535 * ML function thm_deps visualizes dependencies of theorems and lemmas,
4536 using the graph browser tool;
4538 * Isabelle manuals now also available as PDF;
4540 * theory loader rewritten from scratch (may not be fully
4541 bug-compatible); old loadpath variable has been replaced by show_path,
4542 add_path, del_path, reset_path functions; new operations such as
4543 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
4546 * improved isatool install: option -k creates KDE application icon,
4547 option -p DIR installs standalone binaries;
4549 * added ML_PLATFORM setting (useful for cross-platform installations);
4550 more robust handling of platform specific ML images for SML/NJ;
4552 * the settings environment is now statically scoped, i.e. it is never
4553 created again in sub-processes invoked from isabelle, isatool, or
4556 * path element specification '~~' refers to '$ISABELLE_HOME';
4558 * in locales, the "assumes" and "defines" parts may be omitted if
4561 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
4564 * new print_mode "HTML";
4566 * new flag show_tags controls display of tags of theorems (which are
4567 basically just comments that may be attached by some tools);
4569 * Isamode 2.6 requires patch to accomodate change of Isabelle font
4570 mode and goal output format:
4572 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
4574 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
4576 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
4577 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
4579 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
4581 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
4583 * function bind_thms stores lists of theorems (cf. bind_thm);
4585 * new shorthand tactics ftac, eatac, datac, fatac;
4587 * qed (and friends) now accept "" as result name; in that case the
4588 theorem is not stored, but proper checks and presentation of the
4591 * theorem database now also indexes constants "Trueprop", "all",
4592 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
4597 ** HOL arithmetic **
4599 * There are now decision procedures for linear arithmetic over nat and
4602 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
4603 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
4604 are treated as atomic; subformulae not involving type `nat' or `int'
4605 are ignored; quantified subformulae are ignored unless they are
4606 positive universal or negative existential. The tactic has to be
4607 invoked by hand and can be a little bit slow. In particular, the
4608 running time is exponential in the number of occurrences of `min' and
4609 `max', and `-' on `nat'.
4611 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
4612 (negated) (in)equalities among the premises and the conclusion into
4613 account (i.e. no compound formulae) and does not know about `min' and
4614 `max', and `-' on `nat'. It is fast and is used automatically by the
4617 NB: At the moment, these decision procedures do not cope with mixed
4618 nat/int formulae where the two parts interact, such as `m < n ==>
4621 * HOL/Numeral provides a generic theory of numerals (encoded
4622 efficiently as bit strings); setup for types nat/int/real is in place;
4623 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
4624 int, existing theories and proof scripts may require a few additional
4627 * integer division and remainder can now be performed on constant
4630 * many properties of integer multiplication, division and remainder
4633 * An interface to the Stanford Validity Checker (SVC) is available through the
4634 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
4635 are proved automatically. SVC must be installed separately, and its results
4636 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
4637 invocation of the underlying oracle). For SVC see
4638 http://verify.stanford.edu/SVC
4640 * IsaMakefile: the HOL-Real target now builds an actual image;
4645 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
4646 (in Isabelle/Isar) -- by Gertrud Bauer;
4648 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
4649 analysis for assembly languages with subtypes;
4651 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
4652 -- avoids syntactic ambiguities and treats state, transition, and
4653 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
4654 changed syntax and (many) tactics;
4656 * HOL/inductive: Now also handles more general introduction rules such
4657 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
4658 theorems are now maintained within the theory (maintained via the
4661 * HOL/datatype: Now also handles arbitrarily branching datatypes
4662 (using function types) such as
4664 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
4666 * HOL/record: record_simproc (part of the default simpset) takes care
4667 of selectors applied to updated records; record_split_tac is no longer
4668 part of the default claset; update_defs may now be removed from the
4669 simpset in many cases; COMPATIBILITY: old behavior achieved by
4671 claset_ref () := claset() addSWrapper record_split_wrapper;
4672 Delsimprocs [record_simproc]
4674 * HOL/typedef: fixed type inference for representing set; type
4675 arguments now have to occur explicitly on the rhs as type constraints;
4677 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
4678 names rather than an ML expression;
4680 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
4681 supplied later. Program schemes can be defined, such as
4682 "While B C s = (if B s then While B C (C s) else s)"
4683 where the well-founded relation can be chosen after B and C have been given.
4685 * HOL/List: the constructors of type list are now Nil and Cons;
4686 INCOMPATIBILITY: while [] and infix # syntax is still there, of
4687 course, ML tools referring to List.list.op # etc. have to be adapted;
4689 * HOL_quantifiers flag superseded by "HOL" print mode, which is
4690 disabled by default; run isabelle with option -m HOL to get back to
4691 the original Gordon/HOL-style output;
4693 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
4694 ALL x<=y. P, EX x<y. P, EX x<=y. P;
4696 * HOL basic syntax simplified (more orthogonal): all variants of
4697 All/Ex now support plain / symbolic / HOL notation; plain syntax for
4698 Eps operator is provided as well: "SOME x. P[x]";
4700 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
4702 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
4703 thus available for user theories;
4705 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
4706 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
4709 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
4710 several times and then mp;
4715 * the notation <<...>> is now available as a notation for sequences of
4718 * the simplifier is now installed
4720 * the axiom system has been generalized (thanks to Soren Heilmann)
4722 * the classical reasoner now has a default rule database
4727 * new primrec section allows primitive recursive functions to be given
4728 directly (as in HOL) over datatypes and the natural numbers;
4730 * new tactics induct_tac and exhaust_tac for induction (or case
4731 analysis) over datatypes and the natural numbers;
4733 * the datatype declaration of type T now defines the recursor T_rec;
4735 * simplification automatically does freeness reasoning for datatype
4738 * automatic type-inference, with AddTCs command to insert new
4739 type-checking rules;
4741 * datatype introduction rules are now added as Safe Introduction rules
4744 * the syntax "if P then x else y" is now available in addition to
4748 *** Internal programming interfaces ***
4750 * tuned simplifier trace output; new flag debug_simp;
4752 * structures Vartab / Termtab (instances of TableFun) offer efficient
4753 tables indexed by indexname_ord / term_ord (compatible with aconv);
4755 * AxClass.axclass_tac lost the theory argument;
4757 * tuned current_goals_markers semantics: begin / end goal avoids
4758 printing empty lines;
4760 * removed prs and prs_fn hook, which was broken because it did not
4761 include \n in its semantics, forcing writeln to add one
4762 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
4763 string -> unit if you really want to output text without newline;
4765 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
4766 plain output, interface builders may have to enable 'isabelle_font'
4767 mode to get Isabelle font glyphs as before;
4769 * refined token_translation interface; INCOMPATIBILITY: output length
4770 now of type real instead of int;
4772 * theory loader actions may be traced via new ThyInfo.add_hook
4773 interface (see src/Pure/Thy/thy_info.ML); example application: keep
4774 your own database of information attached to *whole* theories -- as
4775 opposed to intra-theory data slots offered via TheoryDataFun;
4777 * proper handling of dangling sort hypotheses (at last!);
4778 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
4779 extra sort hypotheses that can be witnessed from the type signature;
4780 the force_strip_shyps flag is gone, any remaining shyps are simply
4781 left in the theorem (with a warning issued by strip_shyps_warning);
4785 New in Isabelle98-1 (October 1998)
4786 ----------------------------------
4788 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4790 * several changes of automated proof tools;
4792 * HOL: major changes to the inductive and datatype packages, including
4793 some minor incompatibilities of theory syntax;
4795 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
4798 * HOL: removed duplicate thms in Arith:
4799 less_imp_add_less should be replaced by trans_less_add1
4800 le_imp_add_le should be replaced by trans_le_add1
4802 * HOL: unary minus is now overloaded (new type constraints may be
4805 * HOL and ZF: unary minus for integers is now #- instead of #~. In
4806 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
4807 now taken as an integer constant.
4809 * Pure: ML function 'theory_of' renamed to 'theory';
4815 1. Asm_full_simp_tac is now more aggressive.
4816 1. It will sometimes reorient premises if that increases their power to
4818 2. It does no longer proceed strictly from left to right but may also
4819 rotate premises to achieve further simplification.
4820 For compatibility reasons there is now Asm_lr_simp_tac which is like the
4821 old Asm_full_simp_tac in that it does not rotate premises.
4822 2. The simplifier now knows a little bit about nat-arithmetic.
4824 * Classical reasoner: wrapper mechanism for the classical reasoner now
4825 allows for selected deletion of wrappers, by introduction of names for
4826 wrapper functionals. This implies that addbefore, addSbefore,
4827 addaltern, and addSaltern now take a pair (name, tactic) as argument,
4828 and that adding two tactics with the same name overwrites the first
4829 one (emitting a warning).
4830 type wrapper = (int -> tactic) -> (int -> tactic)
4831 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
4832 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
4833 delWrapper, delSWrapper: claset * string -> claset
4834 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
4836 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
4837 semantics; addbefore now affects only the unsafe part of step_tac
4838 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
4839 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
4842 * Classical reasoner: setwrapper to setWrapper and compwrapper to
4843 compWrapper; added safe wrapper (and access functions for it);
4845 * HOL/split_all_tac is now much faster and fails if there is nothing
4846 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
4847 and the names of the automatically generated variables have changed.
4848 split_all_tac has moved within claset() from unsafe wrappers to safe
4849 wrappers, which means that !!-bound variables are split much more
4850 aggressively, and safe_tac and clarify_tac now split such variables.
4851 If this splitting is not appropriate, use delSWrapper "split_all_tac".
4852 Note: the same holds for record_split_tac, which does the job of
4853 split_all_tac for record fields.
4855 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
4856 permanently to the default simpset using Addsplits just like
4857 Addsimps. They can be removed via Delsplits just like
4858 Delsimps. Lower-case versions are also available.
4860 * HOL/Simplifier: The rule split_if is now part of the default
4861 simpset. This means that the simplifier will eliminate all occurrences
4862 of if-then-else in the conclusion of a goal. To prevent this, you can
4863 either remove split_if completely from the default simpset by
4864 `Delsplits [split_if]' or remove it in a specific call of the
4865 simplifier using `... delsplits [split_if]'. You can also add/delete
4866 other case splitting rules to/from the default simpset: every datatype
4867 generates suitable rules `split_t_case' and `split_t_case_asm' (where
4868 t is the name of the datatype).
4870 * Classical reasoner / Simplifier combination: new force_tac (and
4871 derivatives Force_tac, force) combines rewriting and classical
4872 reasoning (and whatever other tools) similarly to auto_tac, but is
4873 aimed to solve the given subgoal completely.
4878 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
4879 and `goalw': the theory is no longer needed as an explicit argument -
4880 the current theory context is used; assumptions are no longer returned
4881 at the ML-level unless one of them starts with ==> or !!; it is
4882 recommended to convert to these new commands using isatool fixgoal
4883 (backup your sources first!);
4885 * new top-level commands 'thm' and 'thms' for retrieving theorems from
4886 the current theory context, and 'theory' to lookup stored theories;
4888 * new theory section 'locale' for declaring constants, assumptions and
4889 definitions that have local scope;
4891 * new theory section 'nonterminals' for purely syntactic types;
4893 * new theory section 'setup' for generic ML setup functions
4894 (e.g. package initialization);
4896 * the distribution now includes Isabelle icons: see
4897 lib/logo/isabelle-{small,tiny}.xpm;
4899 * isatool install - install binaries with absolute references to
4902 * isatool logo -- create instances of the Isabelle logo (as EPS);
4904 * print mode 'emacs' reserved for Isamode;
4906 * support multiple print (ast) translations per constant name;
4908 * theorems involving oracles are now printed with a suffixed [!];
4913 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
4915 * HOL/inductive package reorganized and improved: now supports mutual
4921 oddI "n : EVEN ==> Suc n : ODD"
4922 evenI "n : ODD ==> Suc n : EVEN"
4924 new theorem list "elims" contains an elimination rule for each of the
4925 recursive sets; inductive definitions now handle disjunctive premises
4926 correctly (also ZF);
4928 INCOMPATIBILITIES: requires Inductive as an ancestor; component
4929 "mutual_induct" no longer exists - the induction rule is always
4930 contained in "induct";
4933 * HOL/datatype package re-implemented and greatly improved: now
4934 supports mutually recursive datatypes such as
4937 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
4938 | SUM ('a aexp) ('a aexp)
4939 | DIFF ('a aexp) ('a aexp)
4942 'a bexp = LESS ('a aexp) ('a aexp)
4943 | AND ('a bexp) ('a bexp)
4944 | OR ('a bexp) ('a bexp)
4946 as well as indirectly recursive datatypes such as
4949 ('a, 'b) term = Var 'a
4950 | App 'b ((('a, 'b) term) list)
4952 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
4953 induction on mutually / indirectly recursive datatypes.
4955 Primrec equations are now stored in theory and can be accessed via
4956 <function_name>.simps.
4960 - Theories using datatypes must now have theory Datatype as an
4962 - The specific <typename>.induct_tac no longer exists - use the
4963 generic induct_tac instead.
4964 - natE has been renamed to nat.exhaust - use exhaust_tac
4965 instead of res_inst_tac ... natE. Note that the variable
4966 names in nat.exhaust differ from the names in natE, this
4967 may cause some "fragile" proofs to fail.
4968 - The theorems split_<typename>_case and split_<typename>_case_asm
4969 have been renamed to <typename>.split and <typename>.split_asm.
4970 - Since default sorts of type variables are now handled correctly,
4971 some datatype definitions may have to be annotated with explicit
4973 - Primrec definitions no longer require function name and type
4974 of recursive argument.
4976 Consider using isatool fixdatatype to adapt your theories and proof
4977 scripts to the new package (backup your sources first!).
4980 * HOL/record package: considerably improved implementation; now
4981 includes concrete syntax for record types, terms, updates; theorems
4982 for surjective pairing and splitting !!-bound record variables; proof
4983 support is as follows:
4985 1) standard conversions (selectors or updates applied to record
4986 constructor terms) are part of the standard simpset;
4988 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
4989 made part of standard simpset and claset via addIffs;
4991 3) a tactic for record field splitting (record_split_tac) is part of
4992 the standard claset (addSWrapper);
4994 To get a better idea about these rules you may retrieve them via
4995 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
4996 the name of your record type.
4998 The split tactic 3) conceptually simplifies by the following rule:
5000 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
5002 Thus any record variable that is bound by meta-all will automatically
5003 blow up into some record constructor term, consequently the
5004 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
5005 solve record problems automatically.
5008 * reorganized the main HOL image: HOL/Integ and String loaded by
5009 default; theory Main includes everything;
5011 * automatic simplification of integer sums and comparisons, using cancellation;
5013 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
5015 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
5017 * many new identities for unions, intersections, set difference, etc.;
5019 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
5020 called split_if, split_split, split_sum_case and split_nat_case (to go
5021 with add/delsplits);
5023 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
5024 (?x::unit) = (); this is made part of the default simpset, which COULD
5025 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
5026 'Delsimprocs [unit_eq_proc];' as last resort); also note that
5027 unit_abs_eta_conv is added in order to counter the effect of
5028 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
5031 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
5034 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5035 It and 'sym RS equals0D' are now in the default claset, giving automatic
5036 disjointness reasoning but breaking a few old proofs.
5038 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
5039 to 'converse' from 'inverse' (for compatibility with ZF and some
5042 * HOL/recdef can now declare non-recursive functions, with {} supplied as
5043 the well-founded relation;
5045 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
5046 Compl A. The "Compl" syntax remains available as input syntax for this
5049 * HOL/Update: new theory of function updates:
5050 f(a:=b) == %x. if x=a then b else f x
5051 may also be iterated as in f(a:=b,c:=d,...);
5053 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
5056 - new function list_update written xs[i:=v] that updates the i-th
5057 list position. May also be iterated as in xs[i:=a,j:=b,...].
5058 - new function `upt' written [i..j(] which generates the list
5059 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
5060 bound write [i..j], which is a shorthand for [i..j+1(].
5061 - new lexicographic orderings and corresponding wellfoundedness theorems.
5064 - removed 'pred' (predecessor) function;
5065 - generalized some theorems about n-1;
5066 - many new laws about "div" and "mod";
5067 - new laws about greatest common divisors (see theory ex/Primes);
5069 * HOL/Relation: renamed the relational operator r^-1 "converse"
5070 instead of "inverse";
5072 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
5073 of the multiset ordering;
5075 * directory HOL/Real: a construction of the reals using Dedekind cuts
5076 (not included by default);
5078 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
5080 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
5081 programs, i.e. different program variables may have different types.
5083 * calling (stac rew i) now fails if "rew" has no effect on the goal
5084 [previously, this check worked only if the rewrite rule was unconditional]
5085 Now rew can involve either definitions or equalities (either == or =).
5090 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
5091 only the theorems proved on ZF.ML;
5093 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5094 It and 'sym RS equals0D' are now in the default claset, giving automatic
5095 disjointness reasoning but breaking a few old proofs.
5097 * ZF/Update: new theory of function updates
5098 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
5099 may also be iterated as in f(a:=b,c:=d,...);
5101 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
5103 * calling (stac rew i) now fails if "rew" has no effect on the goal
5104 [previously, this check worked only if the rewrite rule was unconditional]
5105 Now rew can involve either definitions or equalities (either == or =).
5107 * case_tac provided for compatibility with HOL
5108 (like the old excluded_middle_tac, but with subgoals swapped)
5111 *** Internal programming interfaces ***
5113 * Pure: several new basic modules made available for general use, see
5114 also src/Pure/README;
5116 * improved the theory data mechanism to support encapsulation (data
5117 kind name replaced by private Object.kind, acting as authorization
5118 key); new type-safe user interface via functor TheoryDataFun; generic
5119 print_data function becomes basically useless;
5121 * removed global_names compatibility flag -- all theory declarations
5122 are qualified by default;
5124 * module Pure/Syntax now offers quote / antiquote translation
5125 functions (useful for Hoare logic etc. with implicit dependencies);
5126 see HOL/ex/Antiquote for an example use;
5128 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
5131 * new tactical CHANGED_GOAL for checking that a tactic modifies a
5134 * Display.print_goals function moved to Locale.print_goals;
5136 * standard print function for goals supports current_goals_markers
5137 variable for marking begin of proof, end of proof, start of goal; the
5138 default is ("", "", ""); setting current_goals_markers := ("<proof>",
5139 "</proof>", "<goal>") causes SGML like tagged proof state printing,
5144 New in Isabelle98 (January 1998)
5145 --------------------------------
5147 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5149 * changed lexical syntax of terms / types: dots made part of long
5150 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
5152 * simpset (and claset) reference variable replaced by functions
5153 simpset / simpset_ref;
5155 * no longer supports theory aliases (via merge) and non-trivial
5156 implicit merge of thms' signatures;
5158 * most internal names of constants changed due to qualified names;
5160 * changed Pure/Sequence interface (see Pure/seq.ML);
5163 *** General Changes ***
5165 * hierachically structured name spaces (for consts, types, axms, thms
5166 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
5167 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
5168 isatool fixdots ensures space after dots (e.g. "%x. x"); set
5169 long_names for fully qualified output names; NOTE: ML programs
5170 (special tactics, packages etc.) referring to internal names may have
5171 to be adapted to cope with fully qualified names; in case of severe
5172 backward campatibility problems try setting 'global_names' at compile
5173 time to have enrything declared within a flat name space; one may also
5174 fine tune name declarations in theories via the 'global' and 'local'
5177 * reimplemented the implicit simpset and claset using the new anytype
5178 data filed in signatures; references simpset:simpset ref etc. are
5179 replaced by functions simpset:unit->simpset and
5180 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
5181 to patch your ML files accordingly;
5183 * HTML output now includes theory graph data for display with Java
5184 applet or isatool browser; data generated automatically via isatool
5185 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
5187 * defs may now be conditional; improved rewrite_goals_tac to handle
5188 conditional equations;
5190 * defs now admits additional type arguments, using TYPE('a) syntax;
5192 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
5193 creates a new theory node; implicit merge of thms' signatures is
5194 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
5195 transfer:theory->thm->thm in (rare) cases;
5197 * improved handling of draft signatures / theories; draft thms (and
5198 ctyps, cterms) are automatically promoted to real ones;
5200 * slightly changed interfaces for oracles: admit many per theory, named
5201 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
5203 * print_goals: optional output of const types (set show_consts and
5206 * improved output of warnings (###) and errors (***);
5208 * subgoal_tac displays a warning if the new subgoal has type variables;
5210 * removed old README and Makefiles;
5212 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
5214 * removed obsolete init_pps and init_database;
5216 * deleted the obsolete tactical STATE, which was declared by
5217 fun STATE tacfun st = tacfun st st;
5219 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
5220 (which abbreviates $HOME);
5222 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
5223 use isatool fixseq to adapt your ML programs (this works for fully
5224 qualified references to the Sequence structure only!);
5226 * use_thy no longer requires writable current directory; it always
5227 reloads .ML *and* .thy file, if either one is out of date;
5230 *** Classical Reasoner ***
5232 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
5233 tactics that use classical reasoning to simplify a subgoal without
5234 splitting it into several subgoals;
5236 * Safe_tac: like safe_tac but uses the default claset;
5241 * added simplification meta rules:
5242 (asm_)(full_)simplify: simpset -> thm -> thm;
5244 * simplifier.ML no longer part of Pure -- has to be loaded by object
5247 * added prems argument to simplification procedures;
5249 * HOL, FOL, ZF: added infix function `addsplits':
5250 instead of `<simpset> setloop (split_tac <thms>)'
5251 you can simply write `<simpset> addsplits <thms>'
5256 * TYPE('a) syntax for type reflection terms;
5258 * no longer handles consts with name "" -- declare as 'syntax' instead;
5260 * pretty printer: changed order of mixfix annotation preference (again!);
5262 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
5267 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
5268 with `addloop' of the simplifier to faciliate case splitting in premises.
5270 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
5272 * HOL/Auth: new protocol proofs including some for the Internet
5275 * HOL/Map: new theory of `maps' a la VDM;
5277 * HOL/simplifier: simplification procedures nat_cancel_sums for
5278 cancelling out common nat summands from =, <, <= (in)equalities, or
5279 differences; simplification procedures nat_cancel_factor for
5280 cancelling common factor from =, <, <= (in)equalities over natural
5281 sums; nat_cancel contains both kinds of procedures, it is installed by
5282 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
5284 * HOL/simplifier: terms of the form
5285 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
5287 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
5288 and those of the form
5289 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
5291 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
5294 Each datatype `t' now comes with a theorem `split_t_case' of the form
5296 P(t_case f1 ... fn x) =
5297 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
5299 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
5302 and a theorem `split_t_case_asm' of the form
5304 P(t_case f1 ... fn x) =
5305 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
5307 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
5309 which can be added to a simpset via `addsplits'. The existing theorems
5310 expand_list_case and expand_option_case have been renamed to
5311 split_list_case and split_option_case.
5314 - `pred n' is automatically converted to `n-1'.
5315 Users are strongly encouraged not to use `pred' any longer,
5316 because it will disappear altogether at some point.
5317 - Users are strongly encouraged to write "0 < n" rather than
5318 "n ~= 0". Theorems and proof tools have been modified towards this
5322 the function "set_of_list" has been renamed "set" (and its theorems too);
5323 the function "nth" now takes its arguments in the reverse order and
5324 has acquired the infix notation "!" as in "xs!n".
5326 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
5328 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
5329 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
5331 * HOL/record: extensible records with schematic structural subtyping
5332 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
5333 still lacks various theorems and concrete record syntax;
5338 * removed "axioms" and "generated by" sections;
5340 * replaced "ops" section by extended "consts" section, which is capable of
5341 handling the continuous function space "->" directly;
5344 . proves theorems immediately and stores them in the theory,
5345 . creates hierachical name space,
5346 . now uses normal mixfix annotations (instead of cinfix...),
5347 . minor changes to some names and values (for consistency),
5348 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
5349 . separator between mutual domain defs: changed "," to "and",
5350 . improved handling of sort constraints; now they have to
5351 appear on the left-hand side of the equations only;
5353 * fixed LAM <x,y,zs>.b syntax;
5355 * added extended adm_tac to simplifier in HOLCF -- can now discharge
5356 adm (%x. P (t x)), where P is chainfinite and t continuous;
5361 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
5362 with `addloop' of the simplifier to faciliate case splitting in premises.
5364 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
5365 in HOL, they strip ALL and --> from proved theorems;
5369 New in Isabelle94-8 (May 1997)
5370 ------------------------------
5372 *** General Changes ***
5374 * new utilities to build / run / maintain Isabelle etc. (in parts
5375 still somewhat experimental); old Makefiles etc. still functional;
5377 * new 'Isabelle System Manual';
5379 * INSTALL text, together with ./configure and ./build scripts;
5381 * reimplemented type inference for greater efficiency, better error
5382 messages and clean internal interface;
5384 * prlim command for dealing with lots of subgoals (an easier way of
5385 setting goals_limit);
5390 * supports alternative (named) syntax tables (parser and pretty
5391 printer); internal interface is provided by add_modesyntax(_i);
5393 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
5394 be used in conjunction with the Isabelle symbol font; uses the
5395 "symbols" syntax table;
5397 * added token_translation interface (may translate name tokens in
5398 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
5399 the current print_mode); IMPORTANT: user print translation functions
5400 are responsible for marking newly introduced bounds
5401 (Syntax.mark_boundT);
5403 * token translations for modes "xterm" and "xterm_color" that display
5404 names in bold, underline etc. or colors (which requires a color
5407 * infixes may now be declared with names independent of their syntax;
5409 * added typed_print_translation (like print_translation, but may
5410 access type of constant);
5413 *** Classical Reasoner ***
5415 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
5416 some limitations. Blast_tac...
5417 + ignores addss, addbefore, addafter; this restriction is intrinsic
5418 + ignores elimination rules that don't have the correct format
5419 (the conclusion MUST be a formula variable)
5420 + ignores types, which can make HOL proofs fail
5421 + rules must not require higher-order unification, e.g. apply_type in ZF
5422 [message "Function Var's argument not a bound variable" relates to this]
5423 + its proof strategy is more general but can actually be slower
5425 * substitution with equality assumptions no longer permutes other
5428 * minor changes in semantics of addafter (now called addaltern); renamed
5429 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
5430 (and access functions for it);
5432 * improved combination of classical reasoner and simplifier:
5433 + functions for handling clasimpsets
5434 + improvement of addss: now the simplifier is called _after_ the
5436 + safe variant of addss called addSss: uses safe simplifications
5437 _during_ the safe steps. It is more complete as it allows multiple
5438 instantiations of unknowns (e.g. with slow_tac).
5442 * added interface for simplification procedures (functions that
5443 produce *proven* rewrite rules on the fly, depending on current
5446 * ordering on terms as parameter (used for ordered rewriting);
5448 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
5450 * the solver is now split into a safe and an unsafe part.
5451 This should be invisible for the normal user, except that the
5452 functions setsolver and addsolver have been renamed to setSolver and
5453 addSolver; added safe_asm_full_simp_tac;
5458 * a generic induction tactic `induct_tac' which works for all datatypes and
5459 also for type `nat';
5461 * a generic case distinction tactic `exhaust_tac' which works for all
5462 datatypes and also for type `nat';
5464 * each datatype comes with a function `size';
5466 * patterns in case expressions allow tuple patterns as arguments to
5467 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
5469 * primrec now also works with type nat;
5471 * recdef: a new declaration form, allows general recursive functions to be
5472 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
5474 * the constant for negation has been renamed from "not" to "Not" to
5475 harmonize with FOL, ZF, LK, etc.;
5477 * HOL/ex/LFilter theory of a corecursive "filter" functional for
5480 * HOL/Modelcheck demonstrates invocation of model checker oracle;
5482 * HOL/ex/Ring.thy declares cring_simp, which solves equational
5483 problems in commutative rings, using axiomatic type classes for + and *;
5485 * more examples in HOL/MiniML and HOL/Auth;
5487 * more default rewrite rules for quantifiers, union/intersection;
5489 * a new constant `arbitrary == @x.False';
5491 * HOLCF/IOA replaces old HOL/IOA;
5493 * HOLCF changes: derived all rules and arities
5494 + axiomatic type classes instead of classes
5495 + typedef instead of faking type definitions
5496 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
5497 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
5498 + eliminated the types void, one, tr
5499 + use unit lift and bool lift (with translations) instead of one and tr
5500 + eliminated blift from Lift3.thy (use Def instead of blift)
5501 all eliminated rules are derived as theorems --> no visible changes ;
5506 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
5507 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
5508 as ZF_cs addSIs [equalityI];
5512 New in Isabelle94-7 (November 96)
5513 ---------------------------------
5515 * allowing negative levels (as offsets) in prlev and choplev;
5517 * super-linear speedup for large simplifications;
5519 * FOL, ZF and HOL now use miniscoping: rewriting pushes
5520 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
5521 FAIL); can suppress it using the command Delsimps (ex_simps @
5522 all_simps); De Morgan laws are also now included, by default;
5524 * improved printing of ==> : ~:
5526 * new object-logic "Sequents" adds linear logic, while replacing LK
5527 and Modal (thanks to Sara Kalvala);
5529 * HOL/Auth: correctness proofs for authentication protocols;
5531 * HOL: new auto_tac combines rewriting and classical reasoning (many
5532 examples on HOL/Auth);
5534 * HOL: new command AddIffs for declaring theorems of the form P=Q to
5535 the rewriter and classical reasoner simultaneously;
5537 * function uresult no longer returns theorems in "standard" format;
5538 regain previous version by: val uresult = standard o uresult;
5545 * oracles -- these establish an interface between Isabelle and trusted
5546 external reasoners, which may deliver results as theorems;
5548 * proof objects (in particular record all uses of oracles);
5550 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
5552 * "constdefs" section in theory files;
5554 * "primrec" section (HOL) no longer requires names;
5556 * internal type "tactic" now simply "thm -> thm Sequence.seq";
5563 * reduced space requirements;
5565 * automatic HTML generation from theories;
5567 * theory files no longer require "..." (quotes) around most types;
5569 * new examples, including two proofs of the Church-Rosser theorem;
5571 * non-curried (1994) version of HOL is no longer distributed;
5578 * greatly reduced space requirements;
5580 * theory files (.thy) no longer require \...\ escapes at line breaks;
5582 * searchable theorem database (see the section "Retrieving theorems" on
5583 page 8 of the Reference Manual);
5585 * new examples, including Grabczewski's monumental case study of the
5588 * The previous version of HOL renamed to Old_HOL;
5590 * The new version of HOL (previously called CHOL) uses a curried syntax
5591 for functions. Application looks like f a b instead of f(a,b);
5593 * Mutually recursive inductive definitions finally work in HOL;
5595 * In ZF, pattern-matching on tuples is now available in all abstractions and
5596 translates to the operator "split";
5603 * new infix operator, addss, allowing the classical reasoner to
5604 perform simplification at each step of its search. Example:
5605 fast_tac (cs addss ss)
5607 * a new logic, CHOL, the same as HOL, but with a curried syntax
5608 for functions. Application looks like f a b instead of f(a,b). Also pairs
5609 look like (a,b) instead of <a,b>;
5611 * PLEASE NOTE: CHOL will eventually replace HOL!
5613 * In CHOL, pattern-matching on tuples is now available in all abstractions.
5614 It translates to the operator "split". A new theory of integers is available;
5616 * In ZF, integer numerals now denote two's-complement binary integers.
5617 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
5619 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
5620 of the Axiom of Choice;
5627 * Significantly faster resolution;
5629 * the different sections in a .thy file can now be mixed and repeated
5632 * Database of theorems for FOL, HOL and ZF. New
5633 commands including qed, qed_goal and bind_thm store theorems in the database.
5635 * Simple database queries: return a named theorem (get_thm) or all theorems of
5636 a given theory (thms_of), or find out what theory a theorem was proved in
5639 * Bugs fixed in the inductive definition and datatype packages;
5641 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
5642 and HOL_dup_cs obsolete;
5644 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
5647 * Simpler definition of function space in ZF;
5649 * new results about cardinal and ordinal arithmetic in ZF;
5651 * 'subtype' facility in HOL for introducing new types as subsets of existing
5654 :mode=text:wrap=hard:maxLineLen=72: