1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Simplified main Isabelle executables, with less surprises on
10 case-insensitive file-systems (such as Mac OS).
12 - The main Isabelle tool wrapper is now called "isabelle" instead of
15 - The former "isabelle" alias for "isabelle-process" has been
16 removed (should rarely occur to regular users).
18 - The former "isabelle-interface" and its alias "Isabelle" have been
19 removed (interfaces are now regular Isabelle tools).
21 Within scripts and make files, the Isabelle environment variables
22 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
23 respectively. (The latter are still available as legacy feature.)
25 The old isabelle-interface wrapper could react in confusing ways if
26 the interface was uninstalled or changed otherwise. Individual
27 interface tool configuration is now more explicit, see also the
28 Isabelle system manual. In particular, Proof General is now available
31 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
32 purge installed copies of Isabelle executables and re-run "isabelle
33 install -p ...", or use symlinks.
35 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
36 old ~/isabelle, which was slightly non-standard and apt cause
37 surprises on case-insensitive file-systems.
39 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
40 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
41 care is required when using older releases of Isabelle. Note that
42 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
43 Isabelle distribution.
45 * The Isabelle System Manual (system) has been updated, with formally
46 checked references as hyperlinks.
48 * Generalized Isar history, with support for linear undo, direct state
51 * Recovered hiding of consts, which was accidentally broken in
52 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
53 makes c inaccessible; consider using ``hide (open) const c'' instead.
55 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
61 * Type Binding.T gradually replaces formerly used type bstring for names
62 to be bound. Name space interface for declarations has been simplified:
64 NameSpace.declare: NameSpace.naming
65 -> Binding.T -> NameSpace.T -> string * NameSpace.T
66 NameSpace.bind: NameSpace.naming
67 -> Binding.T * 'a -> 'a NameSpace.table -> string * 'a NameSpace.table
68 (*exception Symtab.DUP*)
70 See further modules src/Pure/General/binding.ML and
71 src/Pure/General/name_space.ML
73 * Module moves in repository:
74 src/Pure/Tools/value.ML ~> src/Tools/
75 src/Pure/Tools/quickcheck.ML ~> src/Tools/
77 * Slightly more coherent Pure syntax, with updated documentation in
78 isar-ref manual. Removed locales meta_term_syntax and
79 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
80 INCOMPATIBILITY in rare situations.
82 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
83 hypotheses. Sorts required in the course of reasoning need to be
84 covered by the constraints in the initial statement, completed by the
85 type instance information of the background theory. Non-trivial sort
86 hypotheses, which rarely occur in practice, may be specified via
87 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
89 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
91 The result contains an implicit sort hypotheses as before --
92 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
95 * Changed defaults for unify configuration options:
97 unify_trace_bound = 50 (formerly 25)
98 unify_search_bound = 60 (formerly 30)
100 * Different bookkeeping for code equations:
101 a) On theory merge, the last set of code equations for a particular constant
102 is taken (in accordance with the policy applied by other parts of the
103 code generator framework).
104 b) Code equations stemming from explicit declarations (e.g. code attribute)
105 gain priority over default code equations stemming from definition, primrec,
109 * Global versions of theorems stemming from classes do not carry
110 a parameter prefix any longer. INCOMPATIBILITY.
112 * Dropped locale element "includes". This is a major INCOMPATIBILITY.
113 In existing theorem specifications replace the includes element by the
114 respective context elements of the included locale, omitting those that
115 are already present in the theorem specification. Multiple assume
116 elements of a locale should be replaced by a single one involving the
117 locale predicate. In the proof body, declarations (most notably
118 theorems) may be regained by interpreting the respective locales in the
119 proof context as required (command "interpret").
120 If using "includes" in replacement of a target solely because the
121 parameter types in the theorem are not as general as in the target,
122 consider declaring a new locale with additional type constraints on the
123 parameters (context element "constrains").
125 * Dropped "locale (open)". INCOMPATBILITY.
127 * Interpretation commands no longer attempt to simplify goal.
128 INCOMPATIBILITY: in rare situations the generated goal differs. Use
129 methods intro_locales and unfold_locales to clarify.
131 * Interpretation commands no longer accept interpretation attributes.
134 * Command 'instance': attached definitions no longer accepted.
135 INCOMPATIBILITY, use proper 'instantiation' target.
137 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
139 * The 'axiomatization' command now only works within a global theory
140 context. INCOMPATIBILITY.
143 *** Document preparation ***
145 * Antiquotation @{lemma} now imitates a regular terminal proof,
146 demanding keyword 'by' and supporting the full method expression
147 syntax just like the Isar command 'by'.
152 * Made repository layout more coherent with logical
153 distribution structure:
155 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
156 src/HOL/Library/Code_Message.thy ~> src/HOL/
157 src/HOL/Library/GCD.thy ~> src/HOL/
158 src/HOL/Library/Order_Relation.thy ~> src/HOL/
159 src/HOL/Library/Parity.thy ~> src/HOL/
160 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
161 src/HOL/Real/ContNotDenum.thy ~> src/HOL/
162 src/HOL/Real/Lubs.thy ~> src/HOL/
163 src/HOL/Real/PReal.thy ~> src/HOL/
164 src/HOL/Real/Rational.thy ~> src/HOL/
165 src/HOL/Real/RComplete.thy ~> src/HOL/
166 src/HOL/Real/RealDef.thy ~> src/HOL/
167 src/HOL/Real/RealPow.thy ~> src/HOL/
168 src/HOL/Real/Real.thy ~> src/HOL/
169 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
170 src/HOL/Complex/Complex.thy ~> src/HOL/
171 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/
172 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
173 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
174 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
175 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
176 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
177 src/HOL/Hyperreal/Log.thy ~> src/HOL/
178 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
179 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
180 src/HOL/Hyperreal/Series.thy ~> src/HOL/
181 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
182 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
183 src/HOL/Real/Float ~> src/HOL/Library/
185 src/HOL/arith_data.ML ~> src/HOL/Tools
186 src/HOL/hologic.ML ~> src/HOL/Tools
187 src/HOL/simpdata.ML ~> src/HOL/Tools
188 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
189 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
190 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
191 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
192 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
193 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
194 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
196 * If methods "eval" and "evaluation" encounter a structured proof state
197 with !!/==>, only the conclusion is evaluated to True (if possible),
198 avoiding strange error messages.
200 * Simplifier: simproc for let expressions now unfolds if bound variable
201 occurs at most one time in let expression body. INCOMPATIBILITY.
203 * New classes "top" and "bot" with corresponding operations "top" and "bot"
204 in theory Orderings; instantiation of class "complete_lattice" requires
205 instantiation of classes "top" and "bot". INCOMPATIBILITY.
207 * Changed definition lemma "less_fun_def" in order to provide an instance
208 for preorders on functions; use lemma "less_le" instead. INCOMPATIBILITY.
210 * Unified theorem tables for both code code generators. Thus
211 [code func] has disappeared and only [code] remains. INCOMPATIBILITY.
213 * Constants "undefined" and "default" replace "arbitrary". Usually
214 "undefined" is the right choice to replace "arbitrary", though logically
215 there is no difference. INCOMPATIBILITY.
217 * Generic ATP manager for Sledgehammer, based on ML threads instead of
218 Posix processes. Avoids potentially expensive forking of the ML
219 process. New thread-based implementation also works on non-Unix
220 platforms (Cygwin). Provers are no longer hardwired, but defined
221 within the theory via plain ML wrapper functions. Basic Sledgehammer
222 commands are covered in the isar-ref manual
224 * Wrapper scripts for remote SystemOnTPTP service allows to use
225 sledgehammer without local ATP installation (Vampire etc.). See also
226 ISABELLE_HOME/contrib/SystemOnTPTP and the VAMPIRE_HOME setting
227 variable. Other provers may be included via suitable ML wrappers, see
228 also src/HOL/ATP_Linkup.thy.
230 * Normalization by evaluation now allows non-leftlinear equations.
231 Declare with attribute [code nbe].
233 * Command "value" now integrates different evaluation
234 mechanisms. The result of the first successful evaluation mechanism
235 is printed. In square brackets a particular named evaluation
236 mechanisms may be specified (currently, [SML], [code] or [nbe]). See
237 further src/HOL/ex/Eval_Examples.thy.
239 * HOL/Orderings: class "wellorder" moved here, with explicit induction
240 rule "less_induct" as assumption. For instantiation of "wellorder" by
241 means of predicate "wf", use rule wf_wellorderI. INCOMPATIBILITY.
243 * HOL/Orderings: added class "preorder" as superclass of "order".
244 INCOMPATIBILITY: Instantiation proofs for order, linorder
245 etc. slightly changed. Some theorems named order_class.* now named
248 * HOL/Finite_Set: added a new fold combinator of type
249 ('a => 'b => 'b) => 'b => 'a set => 'b
250 Occasionally this is more convenient than the old fold combinator which is
251 now defined in terms of the new one and renamed to fold_image.
253 * HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been
254 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
255 dvd has been generalized to class comm_semiring_1. Likewise a bunch
256 of lemmas from Divides has been generalized from nat to class
257 semiring_div. INCOMPATIBILITY. This involves the following theorem
258 renames resulting from duplicate elimination:
260 dvd_def_mod ~> dvd_eq_mod_eq_0
261 zero_dvd_iff ~> dvd_0_left_iff
263 DIVISION_BY_ZERO_DIV ~> div_by_0
264 DIVISION_BY_ZERO_MOD ~> mod_by_0
265 mult_div ~> div_mult_self2_is_id
266 mult_mod ~> mod_mult_self2_is_0
268 * HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
269 zlcm (for int); carried together from various gcd/lcm developements in
270 the HOL Distribution. zgcd and zlcm replace former igcd and ilcm;
271 corresponding theorems renamed accordingly. INCOMPATIBILY. To
272 recover tupled syntax, use syntax declarations like:
274 hide (open) const gcd
275 abbreviation gcd where
276 "gcd == (%(a, b). GCD.gcd a b)"
278 GCD.gcd ("gcd '(_, _')")
280 (analogously for lcm, zgcd, zlcm).
282 * HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
284 * New ML antiquotation @{code}: takes constant as argument, generates
285 corresponding code in background and inserts name of the corresponding
286 resulting ML value/function/datatype constructor binding in place.
287 All occurrences of @{code} with a single ML block are generated
288 simultaneously. Provides a generic and safe interface for
289 instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy
290 example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious
291 application. In future you ought refrain from ad-hoc compiling
292 generated SML code on the ML toplevel. Note that (for technical
293 reasons) @{code} cannot refer to constants for which user-defined
294 serializations are set. Refer to the corresponding ML counterpart
295 directly in that cases.
297 * Integrated image HOL-Complex with HOL. Entry points Main.thy and
298 Complex_Main.thy remain as they are.
300 * New image HOL-Plain provides a minimal HOL with the most important
301 tools available (inductive, datatype, primrec, ...). By convention
302 the corresponding theory Plain should be ancestor of every further
303 (library) theory. Some library theories now have ancestor Plain
304 (instead of Main), thus theory Main occasionally has to be imported
307 * The metis method now fails in the usual manner, rather than raising
308 an exception, if it determines that it cannot prove the theorem.
310 * The metis method no longer fails because the theorem is too trivial
311 (contains the empty clause).
313 * Methods "case_tac" and "induct_tac" now refer to the very same rules
314 as the structured Isar versions "cases" and "induct", cf. the
315 corresponding "cases" and "induct" attributes. Mutual induction rules
316 are now presented as a list of individual projections
317 (e.g. foo_bar.inducts for types foo and bar); the old format with
318 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
319 rare situations a different rule is selected --- notably nested tuple
320 elimination instead of former prod.exhaust: use explicit (case_tac t
321 rule: prod.exhaust) here.
323 * Attributes "cases", "induct", "coinduct" support "del" option.
325 * Removed fact "case_split_thm", which duplicates "case_split".
327 * Command 'rep_datatype': instead of theorem names the command now
328 takes a list of terms denoting the constructors of the type to be
329 represented as datatype. The characteristic theorems have to be
330 proven. INCOMPATIBILITY. Also observe that the following theorems
331 have disappeared in favour of existing ones:
333 unit_induct ~> unit.induct
334 prod_induct ~> prod.induct
335 sum_induct ~> sum.induct
336 Suc_Suc_eq ~> nat.inject
337 Suc_not_Zero Zero_not_Suc ~> nat.distinct
339 * Library/Nat_Infinity: added addition, numeral syntax and more
340 instantiations for algebraic structures. Removed some duplicate
341 theorems. Changes in simp rules. INCOMPATIBILITY.
343 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
349 * New locales for orders and lattices where the equivalence relation
350 is not restricted to equality. INCOMPATIBILITY: all order and
351 lattice locales use a record structure with field eq for the
354 * New theory of factorial domains.
356 * Units_l_inv and Units_r_inv are now simprules by default.
357 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
358 and/or r_inv will now also require deletion of these lemmas.
360 * Renamed the following theorems. INCOMPATIBILITY.
363 least_carrier ~> least_closed
364 greatest_carrier ~> greatest_closed
365 greatest_Lower_above ~> greatest_Lower_below
366 one_zero ~> carrier_one_zero
367 one_not_zero ~> carrier_one_not_zero (collision with assumption)
372 * Created new image HOL-NSA, containing theories of nonstandard
373 analysis which were previously part of HOL-Complex. Entry point
374 Hyperreal.thy remains valid, but theories formerly using
375 Complex_Main.thy should now use new entry point Hypercomplex.thy.
380 * Proof of Zorn's Lemma for partial orders.
385 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
386 to 'a -> thm, while results are always tagged with an authentic oracle
387 name. The Isar command 'oracle' is now polymorphic, no argument type
388 is specified. INCOMPATIBILITY, need to simplify existing oracle code
389 accordingly. Note that extra performance may be gained by producing
390 the cterm carefully, avoiding slow Thm.cterm_of.
392 * ML bindings produced via Isar commands are stored within the Isar
393 context (theory or proof). Consequently, commands like 'use' and 'ML'
394 become thread-safe and work with undo as expected (concerning
395 top-level bindings, not side-effects on global references).
396 INCOMPATIBILITY, need to provide proper Isar context when invoking the
397 compiler at runtime; really global bindings need to be given outside a
398 theory. [Poly/ML 5.2 or later]
400 * Command 'ML_prf' is analogous to 'ML' but works within a proof
401 context. Top-level ML bindings are stored within the proof context in
402 a purely sequential fashion, disregarding the nested proof structure.
403 ML bindings introduced by 'ML_prf' are discarded at the end of the
404 proof. [Poly/ML 5.2 or later]
406 * Generic Toplevel.add_hook interface allows to analyze the result of
407 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
408 for theorem dependency output of transactions resulting in a new
411 * Name bindings in higher specification mechanisms (notably
412 LocalTheory.define, LocalTheory.note, and derived packages) are now
413 formalized as type Name.binding, replacing old bstring.
414 INCOMPATIBILITY, need to wrap strings via Name.binding function, see
415 also Name.name_of. Packages should pass name bindings given by the
416 user to underlying specification mechanisms; this enables precise
417 tracking of source positions, for example.
419 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
420 LocalTheory.note etc.) now refer to the *full* internal name, not the
421 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
423 * Rules and tactics that read instantiations (read_instantiate,
424 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
425 context, which is required for parsing and type-checking. Moreover,
426 the variables are specified as plain indexnames, not string encodings
427 thereof. INCOMPATIBILITY.
429 * Disposed old type and term read functions (Sign.read_def_typ,
430 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
431 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
432 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
433 Syntax.read_term_global etc.; see also OldGoals.read_term as last
434 resort for legacy applications.
436 * Antiquotations: block-structured compilation context indicated by
437 \<lbrace> ... \<rbrace>; additional antiquotation forms:
439 @{let ?pat = term} - term abbreviation (HO matching)
440 @{note name = fact} - fact abbreviation
441 @{thm fact} - singleton fact (with attributes)
442 @{thms fact} - general fact (with attributes)
443 @{lemma prop by method} - singleton goal
444 @{lemma prop by meth1 meth2} - singleton goal
445 @{lemma prop1 ... propN by method} - general goal
446 @{lemma prop1 ... propN by meth1 meth2} - general goal
447 @{lemma (open) ...} - open derivation
452 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
453 Poly/ML 5.2.1 or later.
455 * The Isabelle "emacs" tool provides a specific interface to invoke
456 Proof General / Emacs, with more explicit failure if that is not
457 installed (the old isabelle-interface script silently falls back on
458 isabelle-process). The PROOFGENERAL_HOME setting determines the
459 installation location of the Proof General distribution.
461 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
462 the Isabelle process into a JVM/Scala application. See
463 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
464 process wrapper has been discontinued.)
466 * Status messages (with exact source position information) are
467 emitted, if proper markup print mode is enabled. This allows
468 user-interface components to provide detailed feedback on internal
471 * Homegrown Isabelle font with unicode layout, see Isabelle/lib/fonts.
475 New in Isabelle2008 (June 2008)
476 -------------------------------
480 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
481 and updated, with formally checked references as hyperlinks.
483 * Theory loader: use_thy (and similar operations) no longer set the
484 implicit ML context, which was occasionally hard to predict and in
485 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
486 provides a proper context already.
488 * Theory loader: old-style ML proof scripts being *attached* to a thy
489 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
490 'use' within a theory file will do the job.
492 * Name space merge now observes canonical order, i.e. the second space
493 is inserted into the first one, while existing entries in the first
494 space take precedence. INCOMPATIBILITY in rare situations, may try to
497 * Syntax: symbol \<chi> is now considered a letter. Potential
498 INCOMPATIBILITY in identifier syntax etc.
500 * Outer syntax: string tokens no longer admit escaped white space,
501 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
502 white space without escapes.
504 * Outer syntax: string tokens may contain arbitrary character codes
505 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
511 * Context-dependent token translations. Default setup reverts locally
512 fixed variables, and adds hilite markup for undeclared frees.
514 * Unused theorems can be found using the new command 'unused_thms'.
515 There are three ways of invoking it:
518 Only finds unused theorems in the current theory.
520 (2) unused_thms thy_1 ... thy_n -
521 Finds unused theorems in the current theory and all of its ancestors,
522 excluding the theories thy_1 ... thy_n and all of their ancestors.
524 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
525 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
526 their ancestors, excluding the theories thy_1 ... thy_n and all of
529 In order to increase the readability of the list produced by
530 unused_thms, theorems that have been created by a particular instance
531 of a theory command such as 'inductive' or 'function' are considered
532 to belong to the same "group", meaning that if at least one theorem in
533 this group is used, the other theorems in the same group are no longer
534 reported as unused. Moreover, if all theorems in the group are
535 unused, only one theorem in the group is displayed.
537 Note that proof objects have to be switched on in order for
538 unused_thms to work properly (i.e. !proofs must be >= 1, which is
539 usually the case when using Proof General with the default settings).
541 * Authentic naming of facts disallows ad-hoc overwriting of previous
542 theorems within the same name space. INCOMPATIBILITY, need to remove
543 duplicate fact bindings, or even accidental fact duplications. Note
544 that tools may maintain dynamically scoped facts systematically, using
545 PureThy.add_thms_dynamic.
547 * Command 'hide' now allows to hide from "fact" name space as well.
549 * Eliminated destructive theorem database, simpset, claset, and
550 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
551 update of theories within ML code.
553 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
554 INCOMPATIBILITY, object-logics depending on former Pure require
555 additional setup PureThy.old_appl_syntax_setup; object-logics
556 depending on former CPure need to refer to Pure.
558 * Commands 'use' and 'ML' are now purely functional, operating on
559 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
560 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
563 * Command 'setup': discontinued implicit version with ML reference.
565 * Instantiation target allows for simultaneous specification of class
566 instance operations together with an instantiation proof.
567 Type-checking phase allows to refer to class operations uniformly.
568 See src/HOL/Complex/Complex.thy for an Isar example and
569 src/HOL/Library/Eval.thy for an ML example.
571 * Indexing of literal facts: be more serious about including only
572 facts from the visible specification/proof context, but not the
573 background context (locale etc.). Affects `prop` notation and method
574 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
577 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
578 "(open)" option, which used to expose internal bound variables to the
581 * Isar statements: removed obsolete case "rule_context".
582 INCOMPATIBILITY, better use explicit fixes/assumes.
584 * Locale proofs: default proof step now includes 'unfold_locales';
585 hence 'proof' without argument may be used to unfold locale
589 *** Document preparation ***
591 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
592 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
593 obsolete thumbpdf setup (contemporary PDF viewers do this on the
594 spot); renamed link color from "darkblue" to "linkcolor" (default
595 value unchanged, can be redefined via \definecolor); no longer sets
596 "a4paper" option (unnecessary or even intrusive).
598 * Antiquotation @{lemma A method} proves proposition A by the given
599 method (either a method name or a method name plus (optional) method
600 arguments in parentheses) and prints A just like @{prop A}.
605 * New primrec package. Specification syntax conforms in style to
606 definition/function/.... No separate induction rule is provided. The
607 "primrec" command distinguishes old-style and new-style specifications
608 by syntax. The former primrec package is now named OldPrimrecPackage.
609 When adjusting theories, beware: constants stemming from new-style
610 primrec specifications have authentic syntax.
612 * Metis prover is now an order of magnitude faster, and also works
615 * Metis: the maximum number of clauses that can be produced from a
616 theorem is now given by the attribute max_clauses. Theorems that
617 exceed this number are ignored, with a warning printed.
619 * Sledgehammer no longer produces structured proofs by default. To
620 enable, declare [[sledgehammer_full = true]]. Attributes
621 reconstruction_modulus, reconstruction_sorts renamed
622 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
624 * Method "induct_scheme" derives user-specified induction rules
625 from well-founded induction and completeness of patterns. This factors
626 out some operations that are done internally by the function package
627 and makes them available separately. See
628 src/HOL/ex/Induction_Scheme.thy for examples.
630 * More flexible generation of measure functions for termination
631 proofs: Measure functions can be declared by proving a rule of the
632 form "is_measure f" and giving it the [measure_function] attribute.
633 The "is_measure" predicate is logically meaningless (always true), and
634 just guides the heuristic. To find suitable measure functions, the
635 termination prover sets up the goal "is_measure ?f" of the appropriate
636 type and generates all solutions by prolog-style backwards proof using
639 This setup also deals with rules like
641 "is_measure f ==> is_measure (list_size f)"
643 which accommodates nested datatypes that recurse through lists.
644 Similar rules are predeclared for products and option types.
646 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
650 - Definitions of overloaded constants on sets have to be replaced by
651 definitions on => and bool.
653 - Some definitions of overloaded operators on sets can now be proved
654 using the definitions of the operators on => and bool. Therefore,
655 the following theorems have been renamed:
657 subset_def -> subset_eq
658 psubset_def -> psubset_eq
659 set_diff_def -> set_diff_eq
660 Compl_def -> Compl_eq
661 Sup_set_def -> Sup_set_eq
662 Inf_set_def -> Inf_set_eq
663 sup_set_def -> sup_set_eq
664 inf_set_def -> inf_set_eq
666 - Due to the incompleteness of the HO unification algorithm, some
667 rules such as subst may require manual instantiation, if some of
668 the unknowns in the rule is a set.
670 - Higher order unification and forward proofs:
673 have "P (S::'a set)" <...>
674 then have "EX S. P S" ..
676 no longer works (due to the incompleteness of the HO unification
677 algorithm) and must be replaced by the pattern
684 - Calculational reasoning with subst (or similar rules):
687 have "P (S::'a set)" <...>
688 also have "S = T" <...>
691 no longer works (for similar reasons as the previous example) and
692 must be replaced by something like
694 have "P (S::'a set)" <...>
695 moreover have "S = T" <...>
696 ultimately have "P T" by simp
698 - Tactics or packages written in ML code:
699 Code performing pattern matching on types via
701 Type ("set", [T]) => ...
703 must be rewritten. Moreover, functions like strip_type or
704 binder_types no longer return the right value when applied to a
707 T1 => ... => Tn => U => bool
711 T1 => ... => Tn => U set
713 * Merged theories Wellfounded_Recursion, Accessible_Part and
714 Wellfounded_Relations to theory Wellfounded.
716 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
718 * Class finite no longer treats UNIV as class parameter. Use class
719 enum from theory Library/Enum instead to achieve a similar effect.
722 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
723 and "Cons". INCOMPATIBILITY.
725 * HOL (and FOL): renamed variables in rules imp_elim and swap.
726 Potential INCOMPATIBILITY.
728 * Theory Product_Type: duplicated lemmas split_Pair_apply and
729 injective_fst_snd removed, use split_eta and prod_eqI instead.
730 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
732 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
733 the same name in theory Orderings:
743 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
744 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
745 and different variable names.
747 * Library/Option_ord.thy: Canonical order on option type.
749 * Library/RBT.thy: Red-black trees, an efficient implementation of
752 * Library/Countable.thy: Type class for countable types.
754 * Theory Int: The representation of numerals has changed. The infix
755 operator BIT and the bit datatype with constructors B0 and B1 have
756 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
757 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
758 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
761 * Theory Nat: definition of <= and < on natural numbers no longer
762 depend on well-founded relations. INCOMPATIBILITY. Definitions
763 le_def and less_def have disappeared. Consider lemmas not_less
764 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
766 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
767 (whose purpose mainly is for various fold_set functionals) have been
768 abandoned in favor of the existing algebraic classes
769 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
770 lower_semilattice (resp. upper_semilattice) and linorder.
773 * Theory Transitive_Closure: induct and cases rules now declare proper
774 case_names ("base" and "step"). INCOMPATIBILITY.
776 * Theorem Inductive.lfp_ordinal_induct generalized to complete
777 lattices. The form set-specific version is available as
778 Inductive.lfp_ordinal_induct_set.
780 * Renamed theorems "power.simps" to "power_int.simps".
783 * Class semiring_div provides basic abstract properties of semirings
784 with division and modulo operations. Subsumes former class dvd_mod.
786 * Merged theories IntDef, Numeral and IntArith into unified theory
787 Int. INCOMPATIBILITY.
789 * Theory Library/Code_Index: type "index" now represents natural
790 numbers rather than integers. INCOMPATIBILITY.
792 * New class "uminus" with operation "uminus" (split of from class
793 "minus" which now only has operation "minus", binary).
796 * Constants "card", "internal_split", "option_map" now with authentic
797 syntax. INCOMPATIBILITY.
799 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
800 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
801 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
802 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
803 Sup_set_def, le_def, less_def, option_map_def now with object
804 equality. INCOMPATIBILITY.
806 * Records. Removed K_record, and replaced it by pure lambda term
807 %x. c. The simplifier setup is now more robust against eta expansion.
808 INCOMPATIBILITY: in cases explicitly referring to K_record.
810 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
812 * Library/ListVector: new theory of arithmetic vector operations.
814 * Library/Order_Relation: new theory of various orderings as sets of
815 pairs. Defines preorders, partial orders, linear orders and
816 well-orders on sets and on types.
821 * Renamed some theories to allow to loading both ZF and HOL in the
824 Datatype -> Datatype_ZF
825 Inductive -> Inductive_ZF
832 INCOMPATIBILITY: ZF theories that import individual theories below
833 Main might need to be adapted. Regular theory Main is still
834 available, as trivial extension of Main_ZF.
839 * ML within Isar: antiquotation @{const name} or @{const
840 name(typargs)} produces statically-checked Const term.
842 * Functor NamedThmsFun: data is available to the user as dynamic fact
843 (of the same name). Removed obsolete print command.
845 * Removed obsolete "use_legacy_bindings" function.
847 * The ``print mode'' is now a thread-local value derived from a global
848 template (the former print_mode reference), thus access becomes
849 non-critical. The global print_mode reference is for session
850 management only; user-code should use print_mode_value,
851 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
853 * Functions system/system_out provide a robust way to invoke external
854 shell commands, with propagation of interrupts (requires Poly/ML 5.2).
855 Do not use OS.Process.system etc. from the basis library!
860 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
861 in accordance with Proof General 3.7, which prefers GNU emacs.
863 * isatool tty runs Isabelle process with plain tty interaction;
864 optional line editor may be specified via ISABELLE_LINE_EDITOR
865 setting, the default settings attempt to locate "ledit" and "rlwrap".
867 * isatool browser now works with Cygwin as well, using general
868 "javapath" function defined in Isabelle process environment.
870 * YXML notation provides a simple and efficient alternative to
871 standard XML transfer syntax. See src/Pure/General/yxml.ML and
872 isatool yxml as described in the Isabelle system manual.
874 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
875 provides general wrapper for managing an Isabelle process in a robust
876 fashion, with ``cooked'' output from stdin/stderr.
878 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
879 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
881 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
882 way of changing the user's settings is via
883 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
886 * Multithreading.max_threads := 0 refers to the number of actual CPU
887 cores of the underlying machine, which is a good starting point for
888 optimal performance tuning. The corresponding usedir option -M allows
889 "max" as an alias for "0". WARNING: does not work on certain versions
890 of Mac OS (with Poly/ML 5.1).
892 * isabelle-process: non-ML sessions are run with "nice", to reduce the
893 adverse effect of Isabelle flooding interactive front-ends (notably
894 ProofGeneral / XEmacs).
898 New in Isabelle2007 (November 2007)
899 -----------------------------------
903 * More uniform information about legacy features, notably a
904 warning/error of "Legacy feature: ...", depending on the state of the
905 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
906 legacy features will disappear eventually.
908 * Theory syntax: the header format ``theory A = B + C:'' has been
909 discontinued in favour of ``theory A imports B C begin''. Use isatool
910 fixheaders to convert existing theory files. INCOMPATIBILITY.
912 * Theory syntax: the old non-Isar theory file format has been
913 discontinued altogether. Note that ML proof scripts may still be used
914 with Isar theories; migration is usually quite simple with the ML
915 function use_legacy_bindings. INCOMPATIBILITY.
917 * Theory syntax: some popular names (e.g. 'class', 'declaration',
918 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
921 * Theory loader: be more serious about observing the static theory
922 header specifications (including optional directories), but not the
923 accidental file locations of previously successful loads. The strict
924 update policy of former update_thy is now already performed by
925 use_thy, so the former has been removed; use_thys updates several
926 theories simultaneously, just as 'imports' within a theory header
927 specification, but without merging the results. Potential
928 INCOMPATIBILITY: may need to refine theory headers and commands
929 ROOT.ML which depend on load order.
931 * Theory loader: optional support for content-based file
932 identification, instead of the traditional scheme of full physical
933 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
934 (cf. the system manual). The new scheme allows to work with
935 non-finished theories in persistent session images, such that source
936 files may be moved later on without requiring reloads.
938 * Theory loader: old-style ML proof scripts being *attached* to a thy
939 file (with the same base name as the theory) are considered a legacy
940 feature, which will disappear eventually. Even now, the theory loader
941 no longer maintains dependencies on such files.
943 * Syntax: the scope for resolving ambiguities via type-inference is
944 now limited to individual terms, instead of whole simultaneous
945 specifications as before. This greatly reduces the complexity of the
946 syntax module and improves flexibility by separating parsing and
947 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
948 'fixes' etc.) are required in rare situations.
950 * Syntax: constants introduced by new-style packages ('definition',
951 'abbreviation' etc.) are passed through the syntax module in
952 ``authentic mode''. This means that associated mixfix annotations
953 really stick to such constants, independently of potential name space
954 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
955 trees are represented slightly differently, may need to adapt syntax
956 translations accordingly. Use CONST marker in 'translations' and
957 @{const_syntax} antiquotation in 'parse_translation' etc.
959 * Legacy goal package: reduced interface to the bare minimum required
960 to keep existing proof scripts running. Most other user-level
961 functions are now part of the OldGoals structure, which is *not* open
962 by default (consider isatool expandshort before open OldGoals).
963 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
964 these tend to cause confusion about the actual goal (!) context being
965 used here, which is not necessarily the same as the_context().
967 * Command 'find_theorems': supports "*" wild-card in "name:"
968 criterion; "with_dups" option. Certain ProofGeneral versions might
969 support a specific search form (see ProofGeneral/CHANGES).
971 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
972 by default, which means that "prems" (and also "fixed variables") are
973 suppressed from proof state output. Note that the ProofGeneral
974 settings mechanism allows to change and save options persistently, but
975 older versions of Isabelle will fail to start up if a negative prems
978 * Local theory targets may be specified by non-nested blocks of
979 ``context/locale/class ... begin'' followed by ``end''. The body may
980 contain definitions, theorems etc., including any derived mechanism
981 that has been implemented on top of these primitives. This concept
982 generalizes the existing ``theorem (in ...)'' towards more versatility
985 * Proof General interface: proper undo of final 'end' command;
986 discontinued Isabelle/classic mode (ML proof scripts).
989 *** Document preparation ***
991 * Added antiquotation @{theory name} which prints the given name,
992 after checking that it refers to a valid ancestor theory in the
995 * Added antiquotations @{ML_type text} and @{ML_struct text} which
996 check the given source text as ML type/structure, printing verbatim.
998 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
999 "c args == rhs" given in the current context. (Any number of
1000 arguments may be given on the LHS.)
1005 * The 'class' package offers a combination of axclass and locale to
1006 achieve Haskell-like type classes in Isabelle. Definitions and
1007 theorems within a class context produce both relative results (with
1008 implicit parameters according to the locale context), and polymorphic
1009 constants with qualified polymorphism (according to the class
1010 context). Within the body context of a 'class' target, a separate
1011 syntax layer ("user space type system") takes care of converting
1012 between global polymorphic consts and internal locale representation.
1013 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
1014 "isatool doc classes" provides a tutorial.
1016 * Generic code generator framework allows to generate executable
1017 code for ML and Haskell (including Isabelle classes). A short usage
1020 internal compilation:
1021 export_code <list of constants (term syntax)> in SML
1022 writing SML code to a file:
1023 export_code <list of constants (term syntax)> in SML <filename>
1024 writing OCaml code to a file:
1025 export_code <list of constants (term syntax)> in OCaml <filename>
1026 writing Haskell code to a bunch of files:
1027 export_code <list of constants (term syntax)> in Haskell <filename>
1029 evaluating closed propositions to True/False using code generation:
1032 Reasonable default setup of framework in HOL.
1034 Theorem attributs for selecting and transforming function equations theorems:
1036 [code fun]: select a theorem as function equation for a specific constant
1037 [code fun del]: deselect a theorem as function equation for a specific constant
1038 [code inline]: select an equation theorem for unfolding (inlining) in place
1039 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
1041 User-defined serializations (target in {SML, OCaml, Haskell}):
1043 code_const <and-list of constants (term syntax)>
1044 {(target) <and-list of const target syntax>}+
1046 code_type <and-list of type constructors>
1047 {(target) <and-list of type target syntax>}+
1049 code_instance <and-list of instances>
1051 where instance ::= <type constructor> :: <class>
1053 code_class <and_list of classes>
1054 {(target) <and-list of class target syntax>}+
1055 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
1057 code_instance and code_class only are effective to target Haskell.
1059 For example usage see src/HOL/ex/Codegenerator.thy and
1060 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
1061 generation from Isabelle/HOL theories is available via "isatool doc
1064 * Code generator: consts in 'consts_code' Isar commands are now
1065 referred to by usual term syntax (including optional type
1068 * Command 'no_translations' removes translation rules from theory
1071 * Overloaded definitions are now actually checked for acyclic
1072 dependencies. The overloading scheme is slightly more general than
1073 that of Haskell98, although Isabelle does not demand an exact
1074 correspondence to type class and instance declarations.
1075 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
1076 exotic versions of overloading -- at the discretion of the user!
1078 Polymorphic constants are represented via type arguments, i.e. the
1079 instantiation that matches an instance against the most general
1080 declaration given in the signature. For example, with the declaration
1081 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
1082 as c(nat). Overloading is essentially simultaneous structural
1083 recursion over such type arguments. Incomplete specification patterns
1084 impose global constraints on all occurrences, e.g. c('a * 'a) on the
1085 LHS means that more general c('a * 'b) will be disallowed on any RHS.
1086 Command 'print_theory' outputs the normalized system of recursive
1087 equations, see section "definitions".
1089 * Configuration options are maintained within the theory or proof
1090 context (with name and type bool/int/string), providing a very simple
1091 interface to a poor-man's version of general context data. Tools may
1092 declare options in ML (e.g. using Attrib.config_int) and then refer to
1093 these values using Config.get etc. Users may change options via an
1094 associated attribute of the same name. This form of context
1095 declaration works particularly well with commands 'declare' or
1096 'using', for example ``declare [[foo = 42]]''. Thus it has become
1097 very easy to avoid global references, which would not observe Isar
1098 toplevel undo/redo and fail to work with multithreading.
1100 Various global ML references of Pure and HOL have been turned into
1101 configuration options:
1103 Unify.search_bound unify_search_bound
1104 Unify.trace_bound unify_trace_bound
1105 Unify.trace_simp unify_trace_simp
1106 Unify.trace_types unify_trace_types
1107 Simplifier.simp_depth_limit simp_depth_limit
1108 Blast.depth_limit blast_depth_limit
1109 DatatypeProp.dtK datatype_distinctness_limit
1110 fast_arith_neq_limit fast_arith_neq_limit
1111 fast_arith_split_limit fast_arith_split_limit
1113 * Named collections of theorems may be easily installed as context
1114 data using the functor NamedThmsFun (see also
1115 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
1116 attributes; there is also a toplevel print command. This facility is
1117 just a common case of general context data, which is the preferred way
1118 for anything more complex than just a list of facts in canonical
1121 * Isar: command 'declaration' augments a local theory by generic
1122 declaration functions written in ML. This enables arbitrary content
1123 being added to the context, depending on a morphism that tells the
1124 difference of the original declaration context wrt. the application
1125 context encountered later on.
1127 * Isar: proper interfaces for simplification procedures. Command
1128 'simproc_setup' declares named simprocs (with match patterns, and body
1129 text in ML). Attribute "simproc" adds/deletes simprocs in the current
1130 context. ML antiquotation @{simproc name} retrieves named simprocs.
1132 * Isar: an extra pair of brackets around attribute declarations
1133 abbreviates a theorem reference involving an internal dummy fact,
1134 which will be ignored later --- only the effect of the attribute on
1135 the background context will persist. This form of in-place
1136 declarations is particularly useful with commands like 'declare' and
1137 'using', for example ``have A using [[simproc a]] by simp''.
1139 * Isar: method "assumption" (and implicit closing of subproofs) now
1140 takes simple non-atomic goal assumptions into account: after applying
1141 an assumption as a rule the resulting subgoals are solved by atomic
1142 assumption steps. This is particularly useful to finish 'obtain'
1143 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
1144 without referring to the original premise "!!x. P x ==> thesis" in the
1145 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
1148 * Isar: implicit use of prems from the Isar proof context is
1149 considered a legacy feature. Common applications like ``have A .''
1150 may be replaced by ``have A by fact'' or ``note `A`''. In general,
1151 referencing facts explicitly here improves readability and
1152 maintainability of proof texts.
1154 * Isar: improper proof element 'guess' is like 'obtain', but derives
1155 the obtained context from the course of reasoning! For example:
1157 assume "EX x y. A x & B y" -- "any previous fact"
1158 then guess x and y by clarify
1160 This technique is potentially adventurous, depending on the facts and
1161 proof tools being involved here.
1163 * Isar: known facts from the proof context may be specified as literal
1164 propositions, using ASCII back-quote syntax. This works wherever
1165 named facts used to be allowed so far, in proof commands, proof
1166 methods, attributes etc. Literal facts are retrieved from the context
1167 according to unification of type and term parameters. For example,
1168 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
1169 theorems in the current context, then these are valid literal facts:
1170 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
1172 There is also a proof method "fact" which does the same composition
1173 for explicit goal states, e.g. the following proof texts coincide with
1174 certain special cases of literal facts:
1176 have "A" by fact == note `A`
1177 have "A ==> B" by fact == note `A ==> B`
1178 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
1179 have "P a ==> Q a" by fact == note `P a ==> Q a`
1181 * Isar: ":" (colon) is no longer a symbolic identifier character in
1182 outer syntax. Thus symbolic identifiers may be used without
1183 additional white space in declarations like this: ``assume *: A''.
1185 * Isar: 'print_facts' prints all local facts of the current context,
1186 both named and unnamed ones.
1188 * Isar: 'def' now admits simultaneous definitions, e.g.:
1190 def x == "t" and y == "u"
1192 * Isar: added command 'unfolding', which is structurally similar to
1193 'using', but affects both the goal state and facts by unfolding given
1194 rewrite rules. Thus many occurrences of the 'unfold' method or
1195 'unfolded' attribute may be replaced by first-class proof text.
1197 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
1198 and command 'unfolding' now all support object-level equalities
1199 (potentially conditional). The underlying notion of rewrite rule is
1200 analogous to the 'rule_format' attribute, but *not* that of the
1201 Simplifier (which is usually more generous).
1203 * Isar: the new attribute [rotated n] (default n = 1) rotates the
1204 premises of a theorem by n. Useful in conjunction with drule.
1206 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
1207 method expression within a sandbox consisting of the first N
1208 sub-goals, which need to exist. For example, ``simp_all [3]''
1209 simplifies the first three sub-goals, while (rule foo, simp_all)[]
1210 simplifies all new goals that emerge from applying rule foo to the
1211 originally first one.
1213 * Isar: schematic goals are no longer restricted to higher-order
1214 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
1217 * Isar: the conclusion of a long theorem statement is now either
1218 'shows' (a simultaneous conjunction, as before), or 'obtains'
1219 (essentially a disjunction of cases with local parameters and
1220 assumptions). The latter allows to express general elimination rules
1221 adequately; in this notation common elimination rules look like this:
1223 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
1225 obtains x where "P x"
1227 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
1231 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
1237 The subsequent classical rules even refer to the formal "thesis"
1240 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
1243 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
1244 obtains "thesis ==> something"
1246 The actual proof of an 'obtains' statement is analogous to that of the
1247 Isar proof element 'obtain', only that there may be several cases.
1248 Optional case names may be specified in parentheses; these will be
1249 available both in the present proof and as annotations in the
1250 resulting rule, for later use with the 'cases' method (cf. attribute
1253 * Isar: the assumptions of a long theorem statement are available as
1254 "assms" fact in the proof context. This is more appropriate than the
1255 (historical) "prems", which refers to all assumptions of the current
1256 context, including those from the target locale, proof body etc.
1258 * Isar: 'print_statement' prints theorems from the current theory or
1259 proof context in long statement form, according to the syntax of a
1262 * Isar: 'obtain' takes an optional case name for the local context
1263 introduction rule (default "that").
1265 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
1266 explicit (is "_ ==> ?foo") in the rare cases where this still happens
1269 * Pure: syntax "CONST name" produces a fully internalized constant
1270 according to the current context. This is particularly useful for
1271 syntax translations that should refer to internal constant
1272 representations independently of name spaces.
1274 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
1275 instead of "FOO ". This allows multiple binder declarations to coexist
1276 in the same context. INCOMPATIBILITY.
1278 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
1279 primitive that also works in a locale context (both for constants and
1280 fixed variables). Type declaration and internal syntactic representation
1281 of given constants retrieved from the context. Likewise, the
1282 'no_notation' command allows to remove given syntax annotations from the
1285 * Isar/locales: new derived specification elements 'axiomatization',
1286 'definition', 'abbreviation', which support type-inference, admit
1287 object-level specifications (equality, equivalence). See also the
1288 isar-ref manual. Examples:
1291 eq (infix "===" 50) where
1292 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
1294 definition "f x y = x + y + 1"
1295 definition g where "g x = f x x"
1298 neq (infix "=!=" 50) where
1299 "x =!= y == ~ (x === y)"
1301 These specifications may be also used in a locale context. Then the
1302 constants being introduced depend on certain fixed parameters, and the
1303 constant name is qualified by the locale base name. An internal
1304 abbreviation takes care for convenient input and output, making the
1305 parameters implicit and using the original short name. See also
1306 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
1307 entities from a monomorphic theory.
1309 Presently, abbreviations are only available 'in' a target locale, but
1310 not inherited by general import expressions. Also note that
1311 'abbreviation' may be used as a type-safe replacement for 'syntax' +
1312 'translations' in common applications. The "no_abbrevs" print mode
1313 prevents folding of abbreviations in term output.
1315 Concrete syntax is attached to specified constants in internal form,
1316 independently of name spaces. The parse tree representation is
1317 slightly different -- use 'notation' instead of raw 'syntax', and
1318 'translations' with explicit "CONST" markup to accommodate this.
1320 * Pure/Isar: unified syntax for new-style specification mechanisms
1321 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
1322 full type inference and dummy patterns ("_"). For example:
1324 definition "K x _ = x"
1326 inductive conj for A B
1327 where "A ==> B ==> conj A B"
1329 * Pure: command 'print_abbrevs' prints all constant abbreviations of
1330 the current context. Print mode "no_abbrevs" prevents inversion of
1331 abbreviations on output.
1333 * Isar/locales: improved parameter handling: use of locales "var" and
1334 "struct" no longer necessary; - parameter renamings are no longer
1335 required to be injective. For example, this allows to define
1336 endomorphisms as locale endom = homom mult mult h.
1338 * Isar/locales: changed the way locales with predicates are defined.
1339 Instead of accumulating the specification, the imported expression is
1340 now an interpretation. INCOMPATIBILITY: different normal form of
1341 locale expressions. In particular, in interpretations of locales with
1342 predicates, goals repesenting already interpreted fragments are not
1343 removed automatically. Use methods `intro_locales' and
1344 `unfold_locales'; see below.
1346 * Isar/locales: new methods `intro_locales' and `unfold_locales'
1347 provide backward reasoning on locales predicates. The methods are
1348 aware of interpretations and discharge corresponding goals.
1349 `intro_locales' is less aggressive then `unfold_locales' and does not
1350 unfold predicates to assumptions.
1352 * Isar/locales: the order in which locale fragments are accumulated
1353 has changed. This enables to override declarations from fragments due
1354 to interpretations -- for example, unwanted simp rules.
1356 * Isar/locales: interpretation in theories and proof contexts has been
1357 extended. One may now specify (and prove) equations, which are
1358 unfolded in interpreted theorems. This is useful for replacing
1359 defined concepts (constants depending on locale parameters) by
1360 concepts already existing in the target context. Example:
1362 interpretation partial_order ["op <= :: [int, int] => bool"]
1363 where "partial_order.less (op <=) (x::int) y = (x < y)"
1365 Typically, the constant `partial_order.less' is created by a
1366 definition specification element in the context of locale
1369 * Method "induct": improved internal context management to support
1370 local fixes and defines on-the-fly. Thus explicit meta-level
1371 connectives !! and ==> are rarely required anymore in inductive goals
1372 (using object-logic connectives for this purpose has been long
1373 obsolete anyway). Common proof patterns are explained in
1374 src/HOL/Induct/Common_Patterns.thy, see also
1375 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
1378 * Method "induct": improved handling of simultaneous goals. Instead of
1379 introducing object-level conjunction, the statement is now split into
1380 several conclusions, while the corresponding symbolic cases are nested
1381 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
1382 see src/HOL/Induct/Common_Patterns.thy, for example.
1384 * Method "induct": mutual induction rules are now specified as a list
1385 of rule sharing the same induction cases. HOL packages usually provide
1386 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
1387 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
1388 mutual induction rules differently, i.e. like this:
1390 (induct rule: foo_bar.inducts)
1391 (induct set: foo bar)
1392 (induct pred: foo bar)
1393 (induct type: foo bar)
1395 The ML function ProjectRule.projections turns old-style rules into the
1398 * Method "coinduct": dual of induction, see
1399 src/HOL/Library/Coinductive_List.thy for various examples.
1401 * Method "cases", "induct", "coinduct": the ``(open)'' option is
1402 considered a legacy feature.
1404 * Attribute "symmetric" produces result with standardized schematic
1405 variables (index 0). Potential INCOMPATIBILITY.
1407 * Simplifier: by default the simplifier trace only shows top level
1408 rewrites now. That is, trace_simp_depth_limit is set to 1 by
1409 default. Thus there is less danger of being flooded by the trace. The
1410 trace indicates where parts have been suppressed.
1412 * Provers/classical: removed obsolete classical version of elim_format
1413 attribute; classical elim/dest rules are now treated uniformly when
1414 manipulating the claset.
1416 * Provers/classical: stricter checks to ensure that supplied intro,
1417 dest and elim rules are well-formed; dest and elim rules must have at
1420 * Provers/classical: attributes dest/elim/intro take an optional
1421 weight argument for the rule (just as the Pure versions). Weights are
1422 ignored by automated tools, but determine the search order of single
1425 * Syntax: input syntax now supports dummy variable binding "%_. b",
1426 where the body does not mention the bound variable. Note that dummy
1427 patterns implicitly depend on their context of bounds, which makes
1428 "{_. _}" match any set comprehension as expected. Potential
1429 INCOMPATIBILITY -- parse translations need to cope with syntactic
1430 constant "_idtdummy" in the binding position.
1432 * Syntax: removed obsolete syntactic constant "_K" and its associated
1433 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
1434 for example "A -> B" => "Pi A (%_. B)".
1436 * Pure: 'class_deps' command visualizes the subclass relation, using
1437 the graph browser tool.
1439 * Pure: 'print_theory' now suppresses certain internal declarations by
1440 default; use '!' option for full details.
1445 * Method "metis" proves goals by applying the Metis general-purpose
1446 resolution prover (see also http://gilith.com/software/metis/).
1447 Examples are in the directory MetisExamples. WARNING: the
1448 Isabelle/HOL-Metis integration does not yet work properly with
1451 * Command 'sledgehammer' invokes external automatic theorem provers as
1452 background processes. It generates calls to the "metis" method if
1453 successful. These can be pasted into the proof. Users do not have to
1454 wait for the automatic provers to return. WARNING: does not really
1455 work with multi-threading.
1457 * New "auto_quickcheck" feature tests outermost goal statements for
1458 potential counter-examples. Controlled by ML references
1459 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
1460 5000 milliseconds). Fails silently if statements is outside of
1461 executable fragment, or any other codgenerator problem occurs.
1463 * New constant "undefined" with axiom "undefined x = undefined".
1465 * Added class "HOL.eq", allowing for code generation with polymorphic
1468 * Some renaming of class constants due to canonical name prefixing in
1469 the new 'class' package:
1471 HOL.abs ~> HOL.abs_class.abs
1472 HOL.divide ~> HOL.divide_class.divide
1473 0 ~> HOL.zero_class.zero
1474 1 ~> HOL.one_class.one
1475 op + ~> HOL.plus_class.plus
1476 op - ~> HOL.minus_class.minus
1477 uminus ~> HOL.minus_class.uminus
1478 op * ~> HOL.times_class.times
1479 op < ~> HOL.ord_class.less
1480 op <= > HOL.ord_class.less_eq
1481 Nat.power ~> Power.power_class.power
1482 Nat.size ~> Nat.size_class.size
1483 Numeral.number_of ~> Numeral.number_class.number_of
1484 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
1485 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
1486 Orderings.min ~> Orderings.ord_class.min
1487 Orderings.max ~> Orderings.ord_class.max
1488 Divides.op div ~> Divides.div_class.div
1489 Divides.op mod ~> Divides.div_class.mod
1490 Divides.op dvd ~> Divides.div_class.dvd
1492 INCOMPATIBILITY. Adaptions may be required in the following cases:
1494 a) User-defined constants using any of the names "plus", "minus",
1495 "times", "less" or "less_eq". The standard syntax translations for
1496 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
1499 b) Variables named "plus", "minus", "times", "less", "less_eq"
1500 INCOMPATIBILITY: use more specific names.
1502 c) Permutative equations (e.g. "a + b = b + a")
1503 Since the change of names also changes the order of terms, permutative
1504 rewrite rules may get applied in a different order. Experience shows
1505 that this is rarely the case (only two adaptions in the whole Isabelle
1506 distribution). INCOMPATIBILITY: rewrite proofs
1508 d) ML code directly refering to constant names
1509 This in general only affects hand-written proof tactics, simprocs and
1510 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
1511 Consider using @{const_name} antiquotation.
1513 * New class "default" with associated constant "default".
1515 * Function "sgn" is now overloaded and available on int, real, complex
1516 (and other numeric types), using class "sgn". Two possible defs of
1517 sgn are given as equational assumptions in the classes sgn_if and
1518 sgn_div_norm; ordered_idom now also inherits from sgn_if.
1521 * Locale "partial_order" now unified with class "order" (cf. theory
1522 Orderings), added parameter "less". INCOMPATIBILITY.
1524 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
1525 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
1526 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
1528 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
1529 changed order of proof goals in instance proofs.
1531 * The transitivity reasoner for partial and linear orders is set up
1532 for classes "order" and "linorder". Instances of the reasoner are available
1533 in all contexts importing or interpreting the corresponding locales.
1534 Method "order" invokes the reasoner separately; the reasoner
1535 is also integrated with the Simplifier as a solver. Diagnostic
1536 command 'print_orders' shows the available instances of the reasoner
1537 in the current context.
1539 * Localized monotonicity predicate in theory "Orderings"; integrated
1540 lemmas max_of_mono and min_of_mono with this predicate.
1543 * Formulation of theorem "dense" changed slightly due to integration
1544 with new class dense_linear_order.
1546 * Uniform lattice theory development in HOL.
1548 constants "meet" and "join" now named "inf" and "sup"
1549 constant "Meet" now named "Inf"
1551 classes "meet_semilorder" and "join_semilorder" now named
1552 "lower_semilattice" and "upper_semilattice"
1553 class "lorder" now named "lattice"
1554 class "comp_lat" now named "complete_lattice"
1556 Instantiation of lattice classes allows explicit definitions
1557 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
1559 INCOMPATIBILITY. Theorem renames:
1561 meet_left_le ~> inf_le1
1562 meet_right_le ~> inf_le2
1563 join_left_le ~> sup_ge1
1564 join_right_le ~> sup_ge2
1565 meet_join_le ~> inf_sup_ord
1568 le_meet ~> le_inf_iff
1569 le_join ~> ge_sup_conv
1570 meet_idempotent ~> inf_idem
1571 join_idempotent ~> sup_idem
1572 meet_comm ~> inf_commute
1573 join_comm ~> sup_commute
1574 meet_leI1 ~> le_infI1
1575 meet_leI2 ~> le_infI2
1576 le_joinI1 ~> le_supI1
1577 le_joinI2 ~> le_supI2
1578 meet_assoc ~> inf_assoc
1579 join_assoc ~> sup_assoc
1580 meet_left_comm ~> inf_left_commute
1581 meet_left_idempotent ~> inf_left_idem
1582 join_left_comm ~> sup_left_commute
1583 join_left_idempotent ~> sup_left_idem
1586 le_def_meet ~> le_iff_inf
1587 le_def_join ~> le_iff_sup
1588 join_absorp2 ~> sup_absorb2
1589 join_absorp1 ~> sup_absorb1
1590 meet_absorp1 ~> inf_absorb1
1591 meet_absorp2 ~> inf_absorb2
1592 meet_join_absorp ~> inf_sup_absorb
1593 join_meet_absorp ~> sup_inf_absorb
1594 distrib_join_le ~> distrib_sup_le
1595 distrib_meet_le ~> distrib_inf_le
1597 add_meet_distrib_left ~> add_inf_distrib_left
1598 add_join_distrib_left ~> add_sup_distrib_left
1599 is_join_neg_meet ~> is_join_neg_inf
1600 is_meet_neg_join ~> is_meet_neg_sup
1601 add_meet_distrib_right ~> add_inf_distrib_right
1602 add_join_distrib_right ~> add_sup_distrib_right
1603 add_meet_join_distribs ~> add_sup_inf_distribs
1604 join_eq_neg_meet ~> sup_eq_neg_inf
1605 meet_eq_neg_join ~> inf_eq_neg_sup
1606 add_eq_meet_join ~> add_eq_inf_sup
1607 meet_0_imp_0 ~> inf_0_imp_0
1608 join_0_imp_0 ~> sup_0_imp_0
1609 meet_0_eq_0 ~> inf_0_eq_0
1610 join_0_eq_0 ~> sup_0_eq_0
1611 neg_meet_eq_join ~> neg_inf_eq_sup
1612 neg_join_eq_meet ~> neg_sup_eq_inf
1613 join_eq_if ~> sup_eq_if
1615 mono_meet ~> mono_inf
1616 mono_join ~> mono_sup
1617 meet_bool_eq ~> inf_bool_eq
1618 join_bool_eq ~> sup_bool_eq
1619 meet_fun_eq ~> inf_fun_eq
1620 join_fun_eq ~> sup_fun_eq
1621 meet_set_eq ~> inf_set_eq
1622 join_set_eq ~> sup_set_eq
1623 meet1_iff ~> inf1_iff
1624 meet2_iff ~> inf2_iff
1633 join1_iff ~> sup1_iff
1634 join2_iff ~> sup2_iff
1644 is_meet_Meet ~> is_meet_Inf
1645 Meet_bool_def ~> Inf_bool_def
1646 Meet_fun_def ~> Inf_fun_def
1647 Meet_greatest ~> Inf_greatest
1648 Meet_lower ~> Inf_lower
1649 Meet_set_def ~> Inf_set_def
1652 Sup_bool_eq ~> Sup_bool_def
1653 Sup_fun_eq ~> Sup_fun_def
1654 Sup_set_eq ~> Sup_set_def
1656 listsp_meetI ~> listsp_infI
1657 listsp_meet_eq ~> listsp_inf_eq
1662 * Added syntactic class "size"; overloaded constant "size" now has
1663 type "'a::size ==> bool"
1665 * Internal reorganisation of `size' of datatypes: size theorems
1666 "foo.size" are no longer subsumed by "foo.simps" (but are still
1667 simplification rules by default!); theorems "prod.size" now named
1670 * Class "div" now inherits from class "times" rather than "type".
1673 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
1674 Linorder etc. have disappeared; operations defined in terms of
1675 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
1677 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
1679 * HOL-Word: New extensive library and type for generic, fixed size
1680 machine words, with arithemtic, bit-wise, shifting and rotating
1681 operations, reflection into int, nat, and bool lists, automation for
1682 linear arithmetic (by automatic reflection into nat or int), including
1683 lemmas on overflow and monotonicity. Instantiated to all appropriate
1684 arithmetic type classes, supporting automatic simplification of
1685 numerals on all operations.
1687 * Library/Boolean_Algebra: locales for abstract boolean algebras.
1689 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
1691 * Code generator library theories:
1692 - Code_Integer represents HOL integers by big integer literals in target
1694 - Code_Char represents HOL characters by character literals in target
1696 - Code_Char_chr like Code_Char, but also offers treatment of character
1697 codes; includes Code_Integer.
1698 - Executable_Set allows to generate code for finite sets using lists.
1699 - Executable_Rat implements rational numbers as triples (sign, enumerator,
1701 - Executable_Real implements a subset of real numbers, namly those
1702 representable by rational numbers.
1703 - Efficient_Nat implements natural numbers by integers, which in general will
1704 result in higher efficency; pattern matching with 0/Suc is eliminated;
1705 includes Code_Integer.
1706 - Code_Index provides an additional datatype index which is mapped to
1707 target-language built-in integers.
1708 - Code_Message provides an additional datatype message_string which is isomorphic to
1709 strings; messages are mapped to target-language strings.
1711 * New package for inductive predicates
1713 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
1716 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1717 for z_1 :: U_1 and ... and z_n :: U_m
1719 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1722 with full support for type-inference, rather than
1724 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1726 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1727 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1729 inductive "s z_1 ... z_m"
1731 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1734 For backward compatibility, there is a wrapper allowing inductive
1735 sets to be defined with the new package via
1738 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1739 for z_1 :: U_1 and ... and z_n :: U_m
1741 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1747 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1748 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1749 for z_1 :: U_1 and ... and z_n :: U_m
1751 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1752 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1755 if the additional syntax "p ..." is required.
1757 Numerous examples can be found in the subdirectories src/HOL/Auth,
1758 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
1762 - Since declaration and definition of inductive sets or predicates
1763 is no longer separated, abbreviations involving the newly
1764 introduced sets or predicates must be specified together with the
1765 introduction rules after the 'where' keyword (see above), rather
1766 than before the actual inductive definition.
1768 - The variables in induction and elimination rules are now
1769 quantified in the order of their occurrence in the introduction
1770 rules, rather than in alphabetical order. Since this may break
1771 some proofs, these proofs either have to be repaired, e.g. by
1772 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
1773 statements of the form
1775 case (rule_i a_i_1 ... a_i_{k_i})
1777 or the old order of quantification has to be restored by explicitly adding
1778 meta-level quantifiers in the introduction rules, i.e.
1780 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
1782 - The format of the elimination rules is now
1784 p z_1 ... z_m x_1 ... x_n ==>
1785 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1790 (x_1, ..., x_n) : s z_1 ... z_m ==>
1791 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
1794 for sets rather than
1796 x : s z_1 ... z_m ==>
1797 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
1800 This may require terms in goals to be expanded to n-tuples
1801 (e.g. using case_tac or simplification with the split_paired_all
1802 rule) before the above elimination rule is applicable.
1804 - The elimination or case analysis rules for (mutually) inductive
1805 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
1806 list of rules "p_1_..._p_k.elims" is no longer available.
1808 * New package "function"/"fun" for general recursive functions,
1809 supporting mutual and nested recursion, definitions in local contexts,
1810 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
1811 for small examples, and the separate tutorial on the function
1812 package. The old recdef "package" is still available as before, but
1813 users are encouraged to use the new package.
1815 * Method "lexicographic_order" automatically synthesizes termination
1816 relations as lexicographic combinations of size measures.
1818 * Case-expressions allow arbitrary constructor-patterns (including
1819 "_") and take their order into account, like in functional
1820 programming. Internally, this is translated into nested
1821 case-expressions; missing cases are added and mapped to the predefined
1822 constant "undefined". In complicated cases printing may no longer show
1823 the original input but the internal form. Lambda-abstractions allow
1824 the same form of pattern matching: "% pat1 => e1 | ..." is an
1825 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
1828 * IntDef: The constant "int :: nat => int" has been removed; now "int"
1829 is an abbreviation for "of_nat :: nat => int". The simplification
1830 rules for "of_nat" have been changed to work like "int" did
1831 previously. Potential INCOMPATIBILITY:
1832 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
1833 - of_nat_diff and of_nat_mult are no longer default simp rules
1835 * Method "algebra" solves polynomial equations over (semi)rings using
1836 Groebner bases. The (semi)ring structure is defined by locales and the
1837 tool setup depends on that generic context. Installing the method for
1838 a specific type involves instantiating the locale and possibly adding
1839 declarations for computation on the coefficients. The method is
1840 already instantiated for natural numbers and for the axiomatic class
1841 of idoms with numerals. See also the paper by Chaieb and Wenzel at
1842 CALCULEMUS 2007 for the general principles underlying this
1843 architecture of context-aware proof-tools.
1845 * Method "ferrack" implements quantifier elimination over
1846 special-purpose dense linear orders using locales (analogous to
1847 "algebra"). The method is already installed for class
1848 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
1851 * Former constant "List.op @" now named "List.append". Use ML
1852 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
1853 circumvent possible incompatibilities when working on ML level.
1855 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
1857 * New function listsum :: 'a list => 'a for arbitrary monoids.
1858 Special syntax: "SUM x <- xs. f x" (and latex variants)
1860 * New syntax for Haskell-like list comprehension (input only), eg.
1861 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
1863 * The special syntax for function "filter" has changed from [x :
1864 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
1865 comprehension syntax, and for uniformity. INCOMPATIBILITY.
1867 * [a..b] is now defined for arbitrary linear orders. It used to be
1868 defined on nat only, as an abbreviation for [a..<Suc b]
1871 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
1873 * New functions "sorted" and "sort" in src/HOL/List.thy.
1875 * New lemma collection field_simps (an extension of ring_simps) for
1876 manipulating (in)equations involving division. Multiplies with all
1877 denominators that can be proved to be non-zero (in equations) or
1878 positive/negative (in inequations).
1880 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
1881 have been improved and renamed to ring_simps, group_simps and
1882 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
1883 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
1885 * Theory Library/Commutative_Ring: switched from recdef to function
1886 package; constants add, mul, pow now curried. Infix syntax for
1887 algebraic operations.
1889 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
1892 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
1895 * HOL/records: generalised field-update to take a function on the
1896 field rather than the new value: r(|A := x|) is translated to A_update
1897 (K x) r The K-combinator that is internally used is called K_record.
1898 INCOMPATIBILITY: Usage of the plain update functions has to be
1901 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
1902 * x = 0, which are required for a semiring. Richer structures do not
1903 inherit from semiring_0 anymore, because this property is a theorem
1904 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
1905 there is more to prove, but this is mostly trivial.
1907 * Class "recpower" is generalized to arbitrary monoids, not just
1908 commutative semirings. INCOMPATIBILITY: may need to incorporate
1909 commutativity or semiring properties additionally.
1911 * Constant "List.list_all2" in List.thy now uses authentic syntax.
1912 INCOMPATIBILITY: translations containing list_all2 may go wrong,
1913 better use 'abbreviation'.
1915 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
1917 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
1918 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
1919 significant changes for setting up numeral syntax for types:
1920 - New constants Numeral.pred and Numeral.succ instead
1921 of former Numeral.bin_pred and Numeral.bin_succ.
1922 - Use integer operations instead of bin_add, bin_mult and so on.
1923 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
1924 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
1926 See src/HOL/Integ/IntArith.thy for an example setup.
1928 * Command 'normal_form' computes the normal form of a term that may
1929 contain free variables. For example ``normal_form "rev [a, b, c]"''
1930 produces ``[b, c, a]'' (without proof). This command is suitable for
1931 heavy-duty computations because the functions are compiled to ML
1932 first. Correspondingly, a method "normalization" is provided. See
1933 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
1935 * Alternative iff syntax "A <-> B" for equality on bool (with priority
1936 25 like -->); output depends on the "iff" print_mode, the default is
1937 "A = B" (with priority 50).
1939 * Relations less (<) and less_eq (<=) are also available on type bool.
1940 Modified syntax to disallow nesting without explicit parentheses,
1941 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
1944 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
1946 * Relation composition operator "op O" now has precedence 75 and binds
1947 stronger than union and intersection. INCOMPATIBILITY.
1949 * The old set interval syntax "{m..n(}" (and relatives) has been
1950 removed. Use "{m..<n}" (and relatives) instead.
1952 * In the context of the assumption "~(s = t)" the Simplifier rewrites
1953 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
1954 ``declare [[simproc del: neq]]''.
1956 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
1959 * Theorem Cons_eq_map_conv no longer declared as "simp".
1961 * Theorem setsum_mult renamed to setsum_right_distrib.
1963 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
1966 * Reimplemented methods "sat" and "satx", with several improvements:
1967 goals no longer need to be stated as "<prems> ==> False", equivalences
1968 (i.e. "=" on type bool) are handled, variable names of the form
1969 "lit_<n>" are no longer reserved, significant speedup.
1971 * Methods "sat" and "satx" can now replay MiniSat proof traces.
1972 zChaff is still supported as well.
1974 * 'inductive' and 'datatype': provide projections of mutual rules,
1975 bundled as foo_bar.inducts;
1977 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
1980 * Library: moved theory Accessible_Part to main HOL.
1982 * Library: added theory Coinductive_List of potentially infinite lists
1983 as greatest fixed-point.
1985 * Library: added theory AssocList which implements (finite) maps as
1988 * Method "evaluation" solves goals (i.e. a boolean expression)
1989 efficiently by compiling it to ML. The goal is "proved" (via an
1990 oracle) if it evaluates to True.
1992 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
1993 also when invoked by the simplifier. This results in the Simplifier
1994 being more powerful on arithmetic goals. INCOMPATIBILITY.
1995 Configuration option fast_arith_split_limit=0 recovers the old
1998 * Support for hex (0x20) and binary (0b1001) numerals.
2000 * New method: reify eqs (t), where eqs are equations for an
2001 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
2002 parameter, computes a term s::'b and a list xs::'a list and proves the
2003 theorem I xs s = t. This is also known as reification or quoting. The
2004 resulting theorem is applied to the subgoal to substitute t with I xs
2005 s. If t is omitted, the subgoal itself is reified.
2007 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
2008 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
2009 where f is supposed to be a computable function (in the sense of code
2010 generattion). The method uses reify to compute s and xs as above then
2011 applies corr_thm and uses normalization by evaluation to "prove" f s =
2012 r and finally gets the theorem t = r, which is again applied to the
2013 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
2015 * Reflection: Automatic reification now handels binding, an example is
2016 available in src/HOL/ex/ReflectionEx.thy
2018 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
2019 command 'statespace' that is similar to 'record', but introduces an
2020 abstract specification based on the locale infrastructure instead of
2021 HOL types. This leads to extra flexibility in composing state spaces,
2022 in particular multiple inheritance and renaming of components.
2027 * Hyperreal: Functions root and sqrt are now defined on negative real
2028 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
2029 Nonnegativity side conditions have been removed from many lemmas, so
2030 that more subgoals may now be solved by simplification; potential
2033 * Real: new type classes formalize real normed vector spaces and
2034 algebras, using new overloaded constants scaleR :: real => 'a => 'a
2035 and norm :: 'a => real.
2037 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
2038 reals into other types. The overloaded constant Reals :: 'a set is now
2039 defined as range of_real; potential INCOMPATIBILITY.
2041 * Real: proper support for ML code generation, including 'quickcheck'.
2042 Reals are implemented as arbitrary precision rationals.
2044 * Hyperreal: Several constants that previously worked only for the
2045 reals have been generalized, so they now work over arbitrary vector
2046 spaces. Type annotations may need to be added in some cases; potential
2049 Infinitesimal :: ('a::real_normed_vector) star set
2050 HFinite :: ('a::real_normed_vector) star set
2051 HInfinite :: ('a::real_normed_vector) star set
2052 approx :: ('a::real_normed_vector) star => 'a star => bool
2053 monad :: ('a::real_normed_vector) star => 'a star set
2054 galaxy :: ('a::real_normed_vector) star => 'a star set
2055 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
2056 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
2057 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
2058 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
2059 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
2060 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
2061 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
2062 sgn :: 'a::real_normed_vector => 'a
2063 exp :: 'a::{recpower,real_normed_field,banach} => 'a
2065 * Complex: Some complex-specific constants are now abbreviations for
2066 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
2067 hnorm. Other constants have been entirely removed in favor of the
2068 polymorphic versions (INCOMPATIBILITY):
2072 HInfinite <-- CInfinite
2073 Infinitesimal <-- CInfinitesimal
2076 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
2077 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
2078 (ns)deriv <-- (ns)cderiv
2083 * Formalisation of ideals and the quotient construction over rings.
2085 * Order and lattice theory no longer based on records.
2088 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
2089 greatest_closed. INCOMPATIBILITY.
2091 * Method algebra is now set up via an attribute. For examples see
2092 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
2093 of algebraic structures.
2095 * Renamed theory CRing to Ring.
2100 * Substantial, yet incomplete support for nominal datatypes (binding
2101 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
2102 src/HOL/Nominal/Examples. Prospective users should consult
2103 http://isabelle.in.tum.de/nominal/
2108 * ML basics: just one true type int, which coincides with IntInf.int
2111 * ML within Isar: antiquotations allow to embed statically-checked
2112 formal entities in the source, referring to the context available at
2113 compile-time. For example:
2115 ML {* @{sort "{zero,one}"} *}
2116 ML {* @{typ "'a => 'b"} *}
2117 ML {* @{term "%x. x"} *}
2118 ML {* @{prop "x == y"} *}
2119 ML {* @{ctyp "'a => 'b"} *}
2120 ML {* @{cterm "%x. x"} *}
2121 ML {* @{cprop "x == y"} *}
2122 ML {* @{thm asm_rl} *}
2123 ML {* @{thms asm_rl} *}
2124 ML {* @{type_name c} *}
2125 ML {* @{type_syntax c} *}
2126 ML {* @{const_name c} *}
2127 ML {* @{const_syntax c} *}
2130 ML {* @{theory Pure} *}
2131 ML {* @{theory_ref} *}
2132 ML {* @{theory_ref Pure} *}
2135 ML {* @{clasimpset} *}
2137 The same works for sources being ``used'' within an Isar context.
2139 * ML in Isar: improved error reporting; extra verbosity with
2140 ML_Context.trace enabled.
2142 * Pure/General/table.ML: the join operations now works via exceptions
2143 DUP/SAME instead of type option. This is simpler in simple cases, and
2144 admits slightly more efficient complex applications.
2146 * Pure: 'advanced' translation functions (parse_translation etc.) now
2147 use Context.generic instead of just theory.
2149 * Pure: datatype Context.generic joins theory/Proof.context and
2150 provides some facilities for code that works in either kind of
2151 context, notably GenericDataFun for uniform theory and proof data.
2153 * Pure: simplified internal attribute type, which is now always
2154 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
2155 local (Proof.context) attributes have been discontinued, while
2156 minimizing code duplication. Thm.rule_attribute and
2157 Thm.declaration_attribute build canonical attributes; see also structure
2158 Context for further operations on Context.generic, notably
2159 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
2160 declarations and definitions.
2162 * Context data interfaces (Theory/Proof/GenericDataFun): removed
2163 name/print, uninitialized data defaults to ad-hoc copy of empty value,
2164 init only required for impure data. INCOMPATIBILITY: empty really need
2165 to be empty (no dependencies on theory content!)
2167 * Pure/kernel: consts certification ignores sort constraints given in
2168 signature declarations. (This information is not relevant to the
2169 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
2170 potential INCOMPATIBILITY.
2172 * Pure: axiomatic type classes are now purely definitional, with
2173 explicit proofs of class axioms and super class relations performed
2174 internally. See Pure/axclass.ML for the main internal interfaces --
2175 notably AxClass.define_class supercedes AxClass.add_axclass, and
2176 AxClass.axiomatize_class/classrel/arity supersede
2177 Sign.add_classes/classrel/arities.
2179 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
2180 global/local versions on theory vs. Proof.context have been
2181 discontinued; Attrib.syntax and Method.syntax have been adapted
2182 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
2183 attributes, methods, etc.
2185 * Pure: several functions of signature "... -> theory -> theory * ..."
2186 have been reoriented to "... -> theory -> ... * theory" in order to
2187 allow natural usage in combination with the ||>, ||>>, |-> and
2188 fold_map combinators.
2190 * Pure: official theorem names (closed derivations) and additional
2191 comments (tags) are now strictly separate. Name hints -- which are
2192 maintained as tags -- may be attached any time without affecting the
2195 * Pure: primitive rule lift_rule now takes goal cterm instead of an
2196 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
2197 achieve the old behaviour.
2199 * Pure: the "Goal" constant is now called "prop", supporting a
2200 slightly more general idea of ``protecting'' meta-level rule
2203 * Pure: Logic.(un)varify only works in a global context, which is now
2204 enforced instead of silently assumed. INCOMPATIBILITY, may use
2205 Logic.legacy_(un)varify as temporary workaround.
2207 * Pure: structure Name provides scalable operations for generating
2208 internal variable names, notably Name.variants etc. This replaces
2209 some popular functions from term.ML:
2211 Term.variant -> Name.variant
2212 Term.variantlist -> Name.variant_list
2213 Term.invent_names -> Name.invent_list
2215 Note that low-level renaming rarely occurs in new code -- operations
2216 from structure Variable are used instead (see below).
2218 * Pure: structure Variable provides fundamental operations for proper
2219 treatment of fixed/schematic variables in a context. For example,
2220 Variable.import introduces fixes for schematics of given facts and
2221 Variable.export reverses the effect (up to renaming) -- this replaces
2222 various freeze_thaw operations.
2224 * Pure: structure Goal provides simple interfaces for
2225 init/conclude/finish and tactical prove operations (replacing former
2226 Tactic.prove). Goal.prove is the canonical way to prove results
2227 within a given context; Goal.prove_global is a degraded version for
2228 theory level goals, including a global Drule.standard. Note that
2229 OldGoals.prove_goalw_cterm has long been obsolete, since it is
2230 ill-behaved in a local proof context (e.g. with local fixes/assumes or
2231 in a locale context).
2233 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
2234 and type checking (Syntax.check_term etc.), with common combinations
2235 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
2236 which are considered legacy and await removal.
2238 * Pure/Syntax: generic interfaces for type unchecking
2239 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
2240 with common combinations (Syntax.pretty_term, Syntax.string_of_term
2241 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
2242 available for convenience, but refer to the very same operations using
2243 a mere theory instead of a full context.
2245 * Isar: simplified treatment of user-level errors, using exception
2246 ERROR of string uniformly. Function error now merely raises ERROR,
2247 without any side effect on output channels. The Isar toplevel takes
2248 care of proper display of ERROR exceptions. ML code may use plain
2249 handle/can/try; cat_error may be used to concatenate errors like this:
2251 ... handle ERROR msg => cat_error msg "..."
2253 Toplevel ML code (run directly or through the Isar toplevel) may be
2254 embedded into the Isar toplevel with exception display/debug like
2257 Isar.toplevel (fn () => ...)
2259 INCOMPATIBILITY, removed special transform_error facilities, removed
2260 obsolete variants of user-level exceptions (ERROR_MESSAGE,
2261 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
2262 -- use plain ERROR instead.
2264 * Isar: theory setup now has type (theory -> theory), instead of a
2265 list. INCOMPATIBILITY, may use #> to compose setup functions.
2267 * Isar: ML toplevel pretty printer for type Proof.context, subject to
2268 ProofContext.debug/verbose flags.
2270 * Isar: Toplevel.theory_to_proof admits transactions that modify the
2271 theory before entering a proof state. Transactions now always see a
2272 quasi-functional intermediate checkpoint, both in interactive and
2275 * Isar: simplified interfaces for outer syntax. Renamed
2276 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
2277 OuterSyntax.add_parsers -- this functionality is now included in
2278 OuterSyntax.command etc. INCOMPATIBILITY.
2280 * Simplifier: the simpset of a running simplification process now
2281 contains a proof context (cf. Simplifier.the_context), which is the
2282 very context that the initial simpset has been retrieved from (by
2283 simpset_of/local_simpset_of). Consequently, all plug-in components
2284 (solver, looper etc.) may depend on arbitrary proof data.
2286 * Simplifier.inherit_context inherits the proof context (plus the
2287 local bounds) of the current simplification process; any simproc
2288 etc. that calls the Simplifier recursively should do this! Removed
2289 former Simplifier.inherit_bounds, which is already included here --
2290 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
2291 specify an explicit context using Simplifier.context/theory_context.
2293 * Simplifier/Classical Reasoner: more abstract interfaces
2294 change_simpset/claset for modifying the simpset/claset reference of a
2295 theory; raw versions simpset/claset_ref etc. have been discontinued --
2298 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
2304 * settings: the default heap location within ISABELLE_HOME_USER now
2305 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
2306 Isabelle installations.
2308 * isabelle-process: option -S (secure mode) disables some critical
2309 operations, notably runtime compilation and evaluation of ML source
2312 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
2314 * Support for parallel execution, using native multicore support of
2315 Poly/ML 5.1. The theory loader exploits parallelism when processing
2316 independent theories, according to the given theory header
2317 specifications. The maximum number of worker threads is specified via
2318 usedir option -M or the "max-threads" setting in Proof General. A
2319 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
2320 to 6 on a 8-core machine. User-code needs to observe certain
2321 guidelines for thread-safe programming, see appendix A in the Isar
2322 Implementation manual.
2326 New in Isabelle2005 (October 2005)
2327 ----------------------------------
2331 * Theory headers: the new header syntax for Isar theories is
2334 imports <theory1> ... <theoryN>
2335 uses <file1> ... <fileM>
2338 where the 'uses' part is optional. The previous syntax
2340 theory <name> = <theory1> + ... + <theoryN>:
2342 will disappear in the next release. Use isatool fixheaders to convert
2343 existing theory files. Note that there is no change in ancient
2344 non-Isar theories now, but these will disappear soon.
2346 * Theory loader: parent theories can now also be referred to via
2347 relative and absolute paths.
2349 * Command 'find_theorems' searches for a list of criteria instead of a
2350 list of constants. Known criteria are: intro, elim, dest, name:string,
2351 simp:term, and any term. Criteria can be preceded by '-' to select
2352 theorems that do not match. Intro, elim, dest select theorems that
2353 match the current goal, name:s selects theorems whose fully qualified
2354 name contain s, and simp:term selects all simplification rules whose
2355 lhs match term. Any other term is interpreted as pattern and selects
2356 all theorems matching the pattern. Available in ProofGeneral under
2357 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
2359 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
2361 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
2362 matching the current goal as introduction rule and not having "HOL."
2363 in their name (i.e. not being defined in theory HOL).
2365 * Command 'thms_containing' has been discontinued in favour of
2366 'find_theorems'; INCOMPATIBILITY.
2368 * Communication with Proof General is now 8bit clean, which means that
2369 Unicode text in UTF-8 encoding may be used within theory texts (both
2370 formal and informal parts). Cf. option -U of the Isabelle Proof
2371 General interface. Here are some simple examples (cf. src/HOL/ex):
2373 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
2374 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
2376 * Improved efficiency of the Simplifier and, to a lesser degree, the
2377 Classical Reasoner. Typical big applications run around 2 times
2381 *** Document preparation ***
2383 * Commands 'display_drafts' and 'print_drafts' perform simple output
2384 of raw sources. Only those symbols that do not require additional
2385 LaTeX packages (depending on comments in isabellesym.sty) are
2386 displayed properly, everything else is left verbatim. isatool display
2387 and isatool print are used as front ends (these are subject to the
2388 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
2390 * Command tags control specific markup of certain regions of text,
2391 notably folding and hiding. Predefined tags include "theory" (for
2392 theory begin and end), "proof" for proof commands, and "ML" for
2393 commands involving ML code; the additional tags "visible" and
2394 "invisible" are unused by default. Users may give explicit tag
2395 specifications in the text, e.g. ''by %invisible (auto)''. The
2396 interpretation of tags is determined by the LaTeX job during document
2397 preparation: see option -V of isatool usedir, or options -n and -t of
2398 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
2401 Several document versions may be produced at the same time via isatool
2402 usedir (the generated index.html will link all of them). Typical
2403 specifications include ''-V document=theory,proof,ML'' to present
2404 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
2405 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
2406 these parts without any formal replacement text. The Isabelle site
2407 default settings produce ''document'' and ''outline'' versions as
2410 * Several new antiquotations:
2412 @{term_type term} prints a term with its type annotated;
2414 @{typeof term} prints the type of a term;
2416 @{const const} is the same as @{term const}, but checks that the
2417 argument is a known logical constant;
2419 @{term_style style term} and @{thm_style style thm} print a term or
2420 theorem applying a "style" to it
2424 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
2425 definitions, equations, inequations etc., 'concl' printing only the
2426 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
2427 to print the specified premise. TermStyle.add_style provides an ML
2428 interface for introducing further styles. See also the "LaTeX Sugar"
2429 document practical applications. The ML antiquotation prints
2430 type-checked ML expressions verbatim.
2432 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
2433 and 'text' support optional locale specification '(in loc)', which
2434 specifies the default context for interpreting antiquotations. For
2435 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
2437 * Option 'locale=NAME' of antiquotations specifies an alternative
2438 context interpreting the subsequent argument. For example: @{thm
2439 [locale=lattice] inf_assoc}.
2441 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
2444 * Proper output of antiquotations for theory commands involving a
2445 proof context (such as 'locale' or 'theorem (in loc) ...').
2447 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
2448 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
2450 * isatool usedir: new option -C (default true) controls whether option
2451 -D should include a copy of the original document directory; -C false
2452 prevents unwanted effects such as copying of administrative CVS data.
2457 * Considerably improved version of 'constdefs' command. Now performs
2458 automatic type-inference of declared constants; additional support for
2459 local structure declarations (cf. locales and HOL records), see also
2460 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
2461 sequential dependencies of definitions within a single 'constdefs'
2462 section; moreover, the declared name needs to be an identifier. If
2463 all fails, consider to fall back on 'consts' and 'defs' separately.
2465 * Improved indexed syntax and implicit structures. First of all,
2466 indexed syntax provides a notational device for subscripted
2467 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
2468 expressions. Secondly, in a local context with structure
2469 declarations, number indexes \<^sub>n or the empty index (default
2470 number 1) refer to a certain fixed variable implicitly; option
2471 show_structs controls printing of implicit structures. Typical
2472 applications of these concepts involve record types and locales.
2474 * New command 'no_syntax' removes grammar declarations (and
2475 translations) resulting from the given syntax specification, which is
2476 interpreted in the same manner as for the 'syntax' command.
2478 * 'Advanced' translation functions (parse_translation etc.) may depend
2479 on the signature of the theory context being presently used for
2480 parsing/printing, see also isar-ref manual.
2482 * Improved 'oracle' command provides a type-safe interface to turn an
2483 ML expression of type theory -> T -> term into a primitive rule of
2484 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
2485 is already included here); see also FOL/ex/IffExample.thy;
2488 * axclass: name space prefix for class "c" is now "c_class" (was "c"
2489 before); "cI" is no longer bound, use "c.intro" instead.
2490 INCOMPATIBILITY. This change avoids clashes of fact bindings for
2491 axclasses vs. locales.
2493 * Improved internal renaming of symbolic identifiers -- attach primes
2494 instead of base 26 numbers.
2496 * New flag show_question_marks controls printing of leading question
2497 marks in schematic variable names.
2499 * In schematic variable names, *any* symbol following \<^isub> or
2500 \<^isup> is now treated as part of the base name. For example, the
2501 following works without printing of awkward ".0" indexes:
2503 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
2506 * Inner syntax includes (*(*nested*) comments*).
2508 * Pretty printer now supports unbreakable blocks, specified in mixfix
2509 annotations as "(00...)".
2511 * Clear separation of logical types and nonterminals, where the latter
2512 may only occur in 'syntax' specifications or type abbreviations.
2513 Before that distinction was only partially implemented via type class
2514 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
2515 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
2516 exotic syntax specifications may require further adaption
2517 (e.g. Cube/Cube.thy).
2519 * Removed obsolete type class "logic", use the top sort {} instead.
2520 Note that non-logical types should be declared as 'nonterminals'
2521 rather than 'types'. INCOMPATIBILITY for new object-logic
2524 * Attributes 'induct' and 'cases': type or set names may now be
2525 locally fixed variables as well.
2527 * Simplifier: can now control the depth to which conditional rewriting
2528 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
2531 * Simplifier: simplification procedures may now take the current
2532 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
2533 interface), which is very useful for calling the Simplifier
2534 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
2535 is gone -- use prems_of_ss on the simpset instead. Moreover, the
2536 low-level mk_simproc no longer applies Logic.varify internally, to
2537 allow for use in a context of fixed variables.
2539 * thin_tac now works even if the assumption being deleted contains !!
2540 or ==>. More generally, erule now works even if the major premise of
2541 the elimination rule contains !! or ==>.
2543 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
2545 * Reorganized bootstrapping of the Pure theories; CPure is now derived
2546 from Pure, which contains all common declarations already. Both
2547 theories are defined via plain Isabelle/Isar .thy files.
2548 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
2549 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
2550 use isatool fixcpure to adapt your theory and ML sources.
2552 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
2553 selections of theorems in named facts via index ranges.
2555 * 'print_theorems': in theory mode, really print the difference
2556 wrt. the last state (works for interactive theory development only),
2557 in proof mode print all local facts (cf. 'print_facts');
2559 * 'hide': option '(open)' hides only base names.
2561 * More efficient treatment of intermediate checkpoints in interactive
2564 * Code generator is now invoked via code_module (incremental code
2565 generation) and code_library (modular code generation, ML structures
2566 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
2567 must be quoted when used as identifiers.
2569 * New 'value' command for reading, evaluating and printing terms using
2570 the code generator. INCOMPATIBILITY: command keyword 'value' must be
2571 quoted when used as identifier.
2576 * New commands for the interpretation of locale expressions in
2577 theories (1), locales (2) and proof contexts (3). These generate
2578 proof obligations from the expression specification. After the
2579 obligations have been discharged, theorems of the expression are added
2580 to the theory, target locale or proof context. The synopsis of the
2581 commands is a follows:
2583 (1) interpretation expr inst
2584 (2) interpretation target < expr
2585 (3) interpret expr inst
2587 Interpretation in theories and proof contexts require a parameter
2588 instantiation of terms from the current context. This is applied to
2589 specifications and theorems of the interpreted expression.
2590 Interpretation in locales only permits parameter renaming through the
2591 locale expression. Interpretation is smart in that interpretations
2592 that are active already do not occur in proof obligations, neither are
2593 instantiated theorems stored in duplicate. Use 'print_interps' to
2594 inspect active interpretations of a particular locale. For details,
2595 see the Isar Reference manual. Examples can be found in
2596 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
2598 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
2599 'interpret' instead.
2601 * New context element 'constrains' for adding type constraints to
2604 * Context expressions: renaming of parameters with syntax
2607 * Locale declaration: 'includes' disallowed.
2609 * Proper static binding of attribute syntax -- i.e. types / terms /
2610 facts mentioned as arguments are always those of the locale definition
2611 context, independently of the context of later invocations. Moreover,
2612 locale operations (renaming and type / term instantiation) are applied
2613 to attribute arguments as expected.
2615 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
2616 actual attributes; rare situations may require Attrib.attribute to
2617 embed those attributes into Attrib.src that lack concrete syntax.
2618 Attribute implementations need to cooperate properly with the static
2619 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
2620 Attrib.XXX_thm etc. already do the right thing without further
2621 intervention. Only unusual applications -- such as "where" or "of"
2622 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
2623 on the context and the facts involved -- may have to assign parsed
2624 values to argument tokens explicitly.
2626 * Changed parameter management in theorem generation for long goal
2627 statements with 'includes'. INCOMPATIBILITY: produces a different
2628 theorem statement in rare situations.
2630 * Locale inspection command 'print_locale' omits notes elements. Use
2631 'print_locale!' to have them included in the output.
2636 * Provers/hypsubst.ML: improved version of the subst method, for
2637 single-step rewriting: it now works in bound variable contexts. New is
2638 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
2639 rewrite a different subterm than the original subst method, which is
2640 still available as 'simplesubst'.
2642 * Provers/quasi.ML: new transitivity reasoners for transitivity only
2645 * Provers/trancl.ML: new transitivity reasoner for transitive and
2646 reflexive-transitive closure of relations.
2648 * Provers/blast.ML: new reference depth_limit to make blast's depth
2649 limit (previously hard-coded with a value of 20) user-definable.
2651 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
2652 is peformed already. Object-logics merely need to finish their
2653 initial simpset configuration as before. INCOMPATIBILITY.
2658 * Symbolic syntax of Hilbert Choice Operator is now as follows:
2661 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
2663 The symbol \<some> is displayed as the alternative epsilon of LaTeX
2664 and x-symbol; use option '-m epsilon' to get it actually printed.
2665 Moreover, the mathematically important symbolic identifier \<epsilon>
2666 becomes available as variable, constant etc. INCOMPATIBILITY,
2668 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
2669 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
2670 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
2671 support corresponding Isar calculations.
2673 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
2676 * theory SetInterval: changed the syntax for open intervals:
2685 The old syntax is still supported but will disappear in the next
2686 release. For conversion use the following Emacs search and replace
2687 patterns (these are not perfect but work quite well):
2689 {)\([^\.]*\)\.\. -> {\1<\.\.}
2690 \.\.\([^(}]*\)(} -> \.\.<\1}
2692 * Theory Commutative_Ring (in Library): method comm_ring for proving
2693 equalities in commutative rings; method 'algebra' provides a generic
2696 * Theory Finite_Set: changed the syntax for 'setsum', summation over
2697 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
2698 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
2701 Some new syntax forms are available:
2703 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
2704 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
2705 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
2706 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
2708 The latter form "\<Sum>x < k. e" used to be based on a separate
2709 function "Summation", which has been discontinued.
2711 * theory Finite_Set: in structured induction proofs, the insert case
2712 is now 'case (insert x F)' instead of the old counterintuitive 'case
2715 * The 'refute' command has been extended to support a much larger
2716 fragment of HOL, including axiomatic type classes, constdefs and
2717 typedefs, inductive datatypes and recursion.
2719 * New tactics 'sat' and 'satx' to prove propositional tautologies.
2720 Requires zChaff with proof generation to be installed. See
2721 HOL/ex/SAT_Examples.thy for examples.
2723 * Datatype induction via method 'induct' now preserves the name of the
2724 induction variable. For example, when proving P(xs::'a list) by
2725 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
2726 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
2727 in unstructured proof scripts.
2729 * Reworked implementation of records. Improved scalability for
2730 records with many fields, avoiding performance problems for type
2731 inference. Records are no longer composed of nested field types, but
2732 of nested extension types. Therefore the record type only grows linear
2733 in the number of extensions and not in the number of fields. The
2734 top-level (users) view on records is preserved. Potential
2735 INCOMPATIBILITY only in strange cases, where the theory depends on the
2736 old record representation. The type generated for a record is called
2737 <record_name>_ext_type.
2739 Flag record_quick_and_dirty_sensitive can be enabled to skip the
2740 proofs triggered by a record definition or a simproc (if
2741 quick_and_dirty is enabled). Definitions of large records can take
2744 New simproc record_upd_simproc for simplification of multiple record
2745 updates enabled by default. Moreover, trivial updates are also
2746 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
2747 occasionally, since simplification is more powerful by default.
2749 * typedef: proper support for polymorphic sets, which contain extra
2750 type-variables in the term.
2752 * Simplifier: automatically reasons about transitivity chains
2753 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
2754 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
2755 old proofs break occasionally as simplification may now solve more
2756 goals than previously.
2758 * Simplifier: converts x <= y into x = y if assumption y <= x is
2759 present. Works for all partial orders (class "order"), in particular
2760 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
2763 * Simplifier: new simproc for "let x = a in f x". If a is a free or
2764 bound variable or a constant then the let is unfolded. Otherwise
2765 first a is simplified to b, and then f b is simplified to g. If
2766 possible we abstract b from g arriving at "let x = b in h x",
2767 otherwise we unfold the let and arrive at g. The simproc can be
2768 enabled/disabled by the reference use_let_simproc. Potential
2769 INCOMPATIBILITY since simplification is more powerful by default.
2771 * Classical reasoning: the meson method now accepts theorems as arguments.
2773 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
2774 jobs to provide advice on the provability of subgoals.
2776 * Theory OrderedGroup and Ring_and_Field: various additions and
2777 improvements to faciliate calculations involving equalities and
2780 The following theorems have been eliminated or modified
2783 abs_eq now named abs_of_nonneg
2784 abs_of_ge_0 now named abs_of_nonneg
2785 abs_minus_eq now named abs_of_nonpos
2786 imp_abs_id now named abs_of_nonneg
2787 imp_abs_neg_id now named abs_of_nonpos
2788 mult_pos now named mult_pos_pos
2789 mult_pos_le now named mult_nonneg_nonneg
2790 mult_pos_neg_le now named mult_nonneg_nonpos
2791 mult_pos_neg2_le now named mult_nonneg_nonpos2
2792 mult_neg now named mult_neg_neg
2793 mult_neg_le now named mult_nonpos_nonpos
2795 * The following lemmas in Ring_and_Field have been added to the simplifier:
2798 not_square_less_zero
2800 The following lemmas have been deleted from Real/RealPow:
2810 * Theory Parity: added rules for simplifying exponents.
2814 The following theorems have been eliminated or modified
2817 list_all_Nil now named list_all.simps(1)
2818 list_all_Cons now named list_all.simps(2)
2819 list_all_conv now named list_all_iff
2820 set_mem_eq now named mem_iff
2822 * Theories SetsAndFunctions and BigO (see HOL/Library) support
2823 asymptotic "big O" calculations. See the notes in BigO.thy.
2828 * Theory RealDef: better support for embedding natural numbers and
2829 integers in the reals.
2831 The following theorems have been eliminated or modified
2834 exp_ge_add_one_self now requires no hypotheses
2835 real_of_int_add reversed direction of equality (use [symmetric])
2836 real_of_int_minus reversed direction of equality (use [symmetric])
2837 real_of_int_diff reversed direction of equality (use [symmetric])
2838 real_of_int_mult reversed direction of equality (use [symmetric])
2840 * Theory RComplete: expanded support for floor and ceiling functions.
2842 * Theory Ln is new, with properties of the natural logarithm
2844 * Hyperreal: There is a new type constructor "star" for making
2845 nonstandard types. The old type names are now type synonyms:
2849 hcomplex = complex star
2851 * Hyperreal: Many groups of similarly-defined constants have been
2852 replaced by polymorphic versions (INCOMPATIBILITY):
2854 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
2856 starset <-- starsetNat, starsetC
2857 *s* <-- *sNat*, *sc*
2858 starset_n <-- starsetNat_n, starsetC_n
2859 *sn* <-- *sNatn*, *scn*
2860 InternalSets <-- InternalNatSets, InternalCSets
2862 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2863 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
2864 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
2865 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
2866 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
2868 * Hyperreal: Many type-specific theorems have been removed in favor of
2869 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
2871 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
2872 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
2873 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
2874 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
2875 right_minus <-- hypreal_add_minus
2876 left_minus <-- {hypreal,hcomplex}_add_minus_left
2877 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
2878 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
2879 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
2880 mult_1_right <-- hcomplex_mult_one_right
2881 mult_zero_left <-- hcomplex_mult_zero_left
2882 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
2883 right_distrib <-- hypnat_add_mult_distrib2
2884 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
2885 right_inverse <-- hypreal_mult_inverse
2886 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
2887 order_refl <-- {hypreal,hypnat}_le_refl
2888 order_trans <-- {hypreal,hypnat}_le_trans
2889 order_antisym <-- {hypreal,hypnat}_le_anti_sym
2890 order_less_le <-- {hypreal,hypnat}_less_le
2891 linorder_linear <-- {hypreal,hypnat}_le_linear
2892 add_left_mono <-- {hypreal,hypnat}_add_left_mono
2893 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
2894 add_nonneg_nonneg <-- hypreal_le_add_order
2896 * Hyperreal: Separate theorems having to do with type-specific
2897 versions of constants have been merged into theorems that apply to the
2898 new polymorphic constants (INCOMPATIBILITY):
2900 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
2901 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
2902 STAR_Un <-- {STAR,NatStar,STARC}_Un
2903 STAR_Int <-- {STAR,NatStar,STARC}_Int
2904 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
2905 STAR_subset <-- {STAR,NatStar,STARC}_subset
2906 STAR_mem <-- {STAR,NatStar,STARC}_mem
2907 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
2908 STAR_diff <-- {STAR,STARC}_diff
2909 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
2910 STARC_hcomplex_of_complex}_image_subset
2911 starset_n_Un <-- starset{Nat,C}_n_Un
2912 starset_n_Int <-- starset{Nat,C}_n_Int
2913 starset_n_Compl <-- starset{Nat,C}_n_Compl
2914 starset_n_diff <-- starset{Nat,C}_n_diff
2915 InternalSets_Un <-- Internal{Nat,C}Sets_Un
2916 InternalSets_Int <-- Internal{Nat,C}Sets_Int
2917 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
2918 InternalSets_diff <-- Internal{Nat,C}Sets_diff
2919 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
2920 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
2921 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
2922 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
2923 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
2924 starfun <-- starfun{Nat,Nat2,C,RC,CR}
2925 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
2926 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
2927 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
2928 starfun_diff <-- starfun{C,RC,CR}_diff
2929 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
2930 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
2931 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
2932 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
2933 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
2934 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
2935 starfun_Id <-- starfunC_Id
2936 starfun_approx <-- starfun{Nat,CR}_approx
2937 starfun_capprox <-- starfun{C,RC}_capprox
2938 starfun_abs <-- starfunNat_rabs
2939 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
2940 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
2941 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
2942 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
2943 starfun_add_capprox <-- starfun{C,RC}_add_capprox
2944 starfun_add_approx <-- starfunCR_add_approx
2945 starfun_inverse_inverse <-- starfunC_inverse_inverse
2946 starfun_divide <-- starfun{C,CR,RC}_divide
2947 starfun_n <-- starfun{Nat,C}_n
2948 starfun_n_mult <-- starfun{Nat,C}_n_mult
2949 starfun_n_add <-- starfun{Nat,C}_n_add
2950 starfun_n_add_minus <-- starfunNat_n_add_minus
2951 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
2952 starfun_n_minus <-- starfun{Nat,C}_n_minus
2953 starfun_n_eq <-- starfun{Nat,C}_n_eq
2955 star_n_add <-- {hypreal,hypnat,hcomplex}_add
2956 star_n_minus <-- {hypreal,hcomplex}_minus
2957 star_n_diff <-- {hypreal,hcomplex}_diff
2958 star_n_mult <-- {hypreal,hcomplex}_mult
2959 star_n_inverse <-- {hypreal,hcomplex}_inverse
2960 star_n_le <-- {hypreal,hypnat}_le
2961 star_n_less <-- {hypreal,hypnat}_less
2962 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
2963 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
2964 star_n_abs <-- hypreal_hrabs
2965 star_n_divide <-- hcomplex_divide
2967 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
2968 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
2969 star_of_diff <-- hypreal_of_real_diff
2970 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
2971 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
2972 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
2973 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
2974 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
2975 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
2976 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
2977 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
2978 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
2979 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
2980 star_of_number_of <-- {hypreal,hcomplex}_number_of
2981 star_of_number_less <-- number_of_less_hypreal_of_real_iff
2982 star_of_number_le <-- number_of_le_hypreal_of_real_iff
2983 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
2984 star_of_less_number <-- hypreal_of_real_less_number_of_iff
2985 star_of_le_number <-- hypreal_of_real_le_number_of_iff
2986 star_of_power <-- hypreal_of_real_power
2987 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
2989 * Hyperreal: new method "transfer" that implements the transfer
2990 principle of nonstandard analysis. With a subgoal that mentions
2991 nonstandard types like "'a star", the command "apply transfer"
2992 replaces it with an equivalent one that mentions only standard types.
2993 To be successful, all free variables must have standard types; non-
2994 standard variables must have explicit universal quantifiers.
2996 * Hyperreal: A theory of Taylor series.
3001 * Discontinued special version of 'constdefs' (which used to support
3002 continuous functions) in favor of the general Pure one with full
3005 * New simplification procedure for solving continuity conditions; it
3006 is much faster on terms with many nested lambda abstractions (cubic
3007 instead of exponential time).
3009 * New syntax for domain package: selector names are now optional.
3010 Parentheses should be omitted unless argument is lazy, for example:
3012 domain 'a stream = cons "'a" (lazy "'a stream")
3014 * New command 'fixrec' for defining recursive functions with pattern
3015 matching; defining multiple functions with mutual recursion is also
3016 supported. Patterns may include the constants cpair, spair, up, sinl,
3017 sinr, or any data constructor defined by the domain package. The given
3018 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
3019 syntax and examples.
3021 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
3022 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
3023 but the proof obligation additionally includes an admissibility
3024 requirement. The packages generate instances of class cpo or pcpo,
3025 with continuity and strictness theorems for Rep and Abs.
3027 * HOLCF: Many theorems have been renamed according to a more standard naming
3028 scheme (INCOMPATIBILITY):
3030 foo_inject: "foo$x = foo$y ==> x = y"
3031 foo_eq: "(foo$x = foo$y) = (x = y)"
3032 foo_less: "(foo$x << foo$y) = (x << y)"
3033 foo_strict: "foo$UU = UU"
3034 foo_defined: "... ==> foo$x ~= UU"
3035 foo_defined_iff: "(foo$x = UU) = (x = UU)"
3040 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
3041 including the First Isomorphism Theorem (on quotienting by the kernel
3044 * ZF/Simplifier: install second copy of type solver that actually
3045 makes use of TC rules declared to Isar proof contexts (or locales);
3046 the old version is still required for ML proof scripts.
3051 * Converted to Isar theory format; use locales instead of axiomatic
3057 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
3060 * Pure/library.ML no longer defines its own option datatype, but uses
3061 that of the SML basis, which has constructors NONE and SOME instead of
3062 None and Some, as well as exception Option.Option instead of OPTION.
3063 The functions the, if_none, is_some, is_none have been adapted
3064 accordingly, while Option.map replaces apsome.
3066 * Pure/library.ML: the exception LIST has been given up in favour of
3067 the standard exceptions Empty and Subscript, as well as
3068 Library.UnequalLengths. Function like Library.hd and Library.tl are
3069 superceded by the standard hd and tl functions etc.
3071 A number of basic list functions are no longer exported to the ML
3072 toplevel, as they are variants of predefined functions. The following
3073 suggests how one can translate existing code:
3075 rev_append xs ys = List.revAppend (xs, ys)
3076 nth_elem (i, xs) = List.nth (xs, i)
3077 last_elem xs = List.last xs
3078 flat xss = List.concat xss
3079 seq fs = List.app fs
3080 partition P xs = List.partition P xs
3081 mapfilter f xs = List.mapPartial f xs
3083 * Pure/library.ML: several combinators for linear functional
3084 transformations, notably reverse application and composition:
3087 (x, y) |-> f f #-> g
3089 * Pure/library.ML: introduced/changed precedence of infix operators:
3091 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
3093 infix 3 o oo ooo oooo;
3094 infix 4 ~~ upto downto;
3096 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
3099 * Pure/library.ML: natural list combinators fold, fold_rev, and
3100 fold_map support linear functional transformations and nesting. For
3103 fold f [x1, ..., xN] y =
3104 y |> f x1 |> ... |> f xN
3106 (fold o fold) f [xs1, ..., xsN] y =
3107 y |> fold f xs1 |> ... |> fold f xsN
3109 fold f [x1, ..., xN] =
3112 (fold o fold) f [xs1, ..., xsN] =
3113 fold f xs1 #> ... #> fold f xsN
3115 * Pure/library.ML: the following selectors on type 'a option are
3118 the: 'a option -> 'a (*partial*)
3119 these: 'a option -> 'a where 'a = 'b list
3120 the_default: 'a -> 'a option -> 'a
3121 the_list: 'a option -> 'a list
3123 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
3124 basic operations for association lists, following natural argument
3125 order; moreover the explicit equality predicate passed here avoids
3126 potentially expensive polymorphic runtime equality checks.
3127 The old functions may be expressed as follows:
3129 assoc = uncurry (AList.lookup (op =))
3130 assocs = these oo AList.lookup (op =)
3131 overwrite = uncurry (AList.update (op =)) o swap
3133 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
3135 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
3136 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
3138 replacing make_keylist and keyfilter (occassionally used)
3141 make_keylist = AList.make
3142 keyfilter = AList.find (op =)
3144 * eq_fst and eq_snd now take explicit equality parameter, thus
3145 avoiding eqtypes. Naive rewrites:
3147 eq_fst = eq_fst (op =)
3148 eq_snd = eq_snd (op =)
3150 * Removed deprecated apl and apr (rarely used).
3153 apl (n, op) =>>= curry op n
3154 apr (op, m) =>>= fn n => op (n, m)
3156 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
3157 provides a reasonably efficient light-weight implementation of sets as
3160 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
3161 few new operations; existing lookup and update are now curried to
3162 follow natural argument order (for use with fold etc.);
3163 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
3165 * Pure/General: output via the Isabelle channels of
3166 writeln/warning/error etc. is now passed through Output.output, with a
3167 hook for arbitrary transformations depending on the print_mode
3168 (cf. Output.add_mode -- the first active mode that provides a output
3169 function wins). Already formatted output may be embedded into further
3170 text via Output.raw; the result of Pretty.string_of/str_of and derived
3171 functions (string_of_term/cterm/thm etc.) is already marked raw to
3172 accommodate easy composition of diagnostic messages etc. Programmers
3173 rarely need to care about Output.output or Output.raw at all, with
3174 some notable exceptions: Output.output is required when bypassing the
3175 standard channels (writeln etc.), or in token translations to produce
3176 properly formatted results; Output.raw is required when capturing
3177 already output material that will eventually be presented to the user
3178 a second time. For the default print mode, both Output.output and
3179 Output.raw have no effect.
3181 * Pure/General: Output.time_accumulator NAME creates an operator ('a
3182 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
3183 cumulative results are displayed at the end of a batch session.
3185 * Pure/General: File.sysify_path and File.quote_sysify path have been
3186 replaced by File.platform_path and File.shell_path (with appropriate
3187 hooks). This provides a clean interface for unusual systems where the
3188 internal and external process view of file names are different.
3190 * Pure: more efficient orders for basic syntactic entities: added
3191 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
3192 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
3193 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
3194 orders now -- potential INCOMPATIBILITY for code that depends on a
3195 particular order for Symtab.keys, Symtab.dest, etc. (consider using
3196 Library.sort_strings on result).
3198 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
3199 fold_types traverse types/terms from left to right, observing natural
3200 argument order. Supercedes previous foldl_XXX versions, add_frees,
3201 add_vars etc. have been adapted as well: INCOMPATIBILITY.
3203 * Pure: name spaces have been refined, with significant changes of the
3204 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
3205 to extern(_table). The plain name entry path is superceded by a
3206 general 'naming' context, which also includes the 'policy' to produce
3207 a fully qualified name and external accesses of a fully qualified
3208 name; NameSpace.extend is superceded by context dependent
3209 Sign.declare_name. Several theory and proof context operations modify
3210 the naming context. Especially note Theory.restore_naming and
3211 ProofContext.restore_naming to get back to a sane state; note that
3212 Theory.add_path is no longer sufficient to recover from
3213 Theory.absolute_path in particular.
3215 * Pure: new flags short_names (default false) and unique_names
3216 (default true) for controlling output of qualified names. If
3217 short_names is set, names are printed unqualified. If unique_names is
3218 reset, the name prefix is reduced to the minimum required to achieve
3219 the original result when interning again, even if there is an overlap
3220 with earlier declarations.
3222 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
3223 now 'extend', and 'merge' gets an additional Pretty.pp argument
3224 (useful for printing error messages). INCOMPATIBILITY.
3226 * Pure: major reorganization of the theory context. Type Sign.sg and
3227 Theory.theory are now identified, referring to the universal
3228 Context.theory (see Pure/context.ML). Actual signature and theory
3229 content is managed as theory data. The old code and interfaces were
3230 spread over many files and structures; the new arrangement introduces
3231 considerable INCOMPATIBILITY to gain more clarity:
3233 Context -- theory management operations (name, identity, inclusion,
3234 parents, ancestors, merge, etc.), plus generic theory data;
3236 Sign -- logical signature and syntax operations (declaring consts,
3237 types, etc.), plus certify/read for common entities;
3239 Theory -- logical theory operations (stating axioms, definitions,
3240 oracles), plus a copy of logical signature operations (consts,
3241 types, etc.); also a few basic management operations (Theory.copy,
3244 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
3245 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
3246 for convenience -- they merely return the theory.
3248 * Pure: type Type.tsig is superceded by theory in most interfaces.
3250 * Pure: the Isar proof context type is already defined early in Pure
3251 as Context.proof (note that ProofContext.context and Proof.context are
3252 aliases, where the latter is the preferred name). This enables other
3253 Isabelle components to refer to that type even before Isar is present.
3255 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
3256 typeK, constK, axiomK, oracleK), but provide explicit operations for
3257 any of these kinds. For example, Sign.intern typeK is now
3258 Sign.intern_type, Theory.hide_space Sign.typeK is now
3259 Theory.hide_types. Also note that former
3260 Theory.hide_classes/types/consts are now
3261 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
3262 internalize their arguments! INCOMPATIBILITY.
3264 * Pure: get_thm interface (of PureThy and ProofContext) expects
3265 datatype thmref (with constructors Name and NameSelection) instead of
3266 plain string -- INCOMPATIBILITY;
3268 * Pure: cases produced by proof methods specify options, where NONE
3269 means to remove case bindings -- INCOMPATIBILITY in
3272 * Pure: the following operations retrieve axioms or theorems from a
3273 theory node or theory hierarchy, respectively:
3275 Theory.axioms_of: theory -> (string * term) list
3276 Theory.all_axioms_of: theory -> (string * term) list
3277 PureThy.thms_of: theory -> (string * thm) list
3278 PureThy.all_thms_of: theory -> (string * thm) list
3280 * Pure: print_tac now outputs the goal through the trace channel.
3282 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
3283 Reference Toplevel.debug (default false) controls detailed printing
3284 and tracing of low-level exceptions; Toplevel.profiling (default 0)
3285 controls execution profiling -- set to 1 for time and 2 for space
3286 (both increase the runtime).
3288 * Isar session: The initial use of ROOT.ML is now always timed,
3289 i.e. the log will show the actual process times, in contrast to the
3290 elapsed wall-clock time that the outer shell wrapper produces.
3292 * Simplifier: improved handling of bound variables (nameless
3293 representation, avoid allocating new strings). Simprocs that invoke
3294 the Simplifier recursively should use Simplifier.inherit_bounds to
3295 avoid local name clashes. Failure to do so produces warnings
3296 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
3297 for further details.
3299 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
3300 bindings for all theorems stored within a given theory; this may help
3301 in porting non-Isar theories to Isar ones, while keeping ML proof
3302 scripts for the time being.
3304 * ML operator HTML.with_charset specifies the charset begin used for
3305 generated HTML files. For example:
3307 HTML.with_charset "utf-8" use_thy "Hebrew";
3308 HTML.with_charset "utf-8" use_thy "Chinese";
3313 * Allow symlinks to all proper Isabelle executables (Isabelle,
3314 isabelle, isatool etc.).
3316 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
3317 isatool doc, isatool mkdir, display_drafts etc.).
3319 * isatool usedir: option -f allows specification of the ML file to be
3320 used by Isabelle; default is ROOT.ML.
3322 * New isatool version outputs the version identifier of the Isabelle
3323 distribution being used.
3325 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
3326 (containing Boolean satisfiability problems) into Isabelle/HOL
3331 New in Isabelle2004 (April 2004)
3332 --------------------------------
3336 * Provers/order.ML: new efficient reasoner for partial and linear orders.
3337 Replaces linorder.ML.
3339 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
3340 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
3341 (\<a>...\<z>), are now considered normal letters, and can therefore
3342 be used anywhere where an ASCII letter (a...zA...Z) has until
3343 now. COMPATIBILITY: This obviously changes the parsing of some
3344 terms, especially where a symbol has been used as a binder, say
3345 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
3346 as an identifier. Fix it by inserting a space around former
3347 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
3348 existing theory and ML files.
3350 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
3352 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
3353 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
3354 a normal (but invisible) letter. For multiple letter subscripts repeat
3355 \<^isub> like this: x\<^isub>1\<^isub>2.
3357 * Pure: There are now sub-/superscripts that can span more than one
3358 character. Text between \<^bsub> and \<^esub> is set in subscript in
3359 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
3360 superscript. The new control characters are not identifier parts.
3362 * Pure: Control-symbols of the form \<^raw:...> will literally print the
3363 content of "..." to the latex file instead of \isacntrl... . The "..."
3364 may consist of any printable characters excluding the end bracket >.
3366 * Pure: Using new Isar command "finalconsts" (or the ML functions
3367 Theory.add_finals or Theory.add_finals_i) it is now possible to
3368 declare constants "final", which prevents their being given a definition
3369 later. It is useful for constants whose behaviour is fixed axiomatically
3370 rather than definitionally, such as the meta-logic connectives.
3372 * Pure: 'instance' now handles general arities with general sorts
3373 (i.e. intersections of classes),
3375 * Presentation: generated HTML now uses a CSS style sheet to make layout
3376 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
3377 It can be changed to alter the colors/layout of generated pages.
3382 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
3383 cut_tac, subgoal_tac and thin_tac:
3384 - Now understand static (Isar) contexts. As a consequence, users of Isar
3385 locales are no longer forced to write Isar proof scripts.
3386 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
3388 - INCOMPATIBILITY: names of variables to be instantiated may no
3389 longer be enclosed in quotes. Instead, precede variable name with `?'.
3390 This is consistent with the instantiation attribute "where".
3392 * Attributes "where" and "of":
3393 - Now take type variables of instantiated theorem into account when reading
3394 the instantiation string. This fixes a bug that caused instantiated
3395 theorems to have too special types in some circumstances.
3396 - "where" permits explicit instantiations of type variables.
3398 * Calculation commands "moreover" and "also" no longer interfere with
3399 current facts ("this"), admitting arbitrary combinations with "then"
3403 - Goal statements involving the context element "includes" no longer
3404 generate theorems with internal delta predicates (those ending on
3405 "_axioms") in the premise.
3406 Resolve particular premise with <locale>.intro to obtain old form.
3407 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
3408 specification and "includes" elements in goal statement.
3409 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
3410 [intro?] and [elim?] (respectively) by default.
3411 - Experimental command for instantiation of locales in proof contexts:
3412 instantiate <label>[<attrs>]: <loc>
3413 Instantiates locale <loc> and adds all its theorems to the current context
3414 taking into account their attributes. Label and attrs are optional
3415 modifiers, like in theorem declarations. If present, names of
3416 instantiated theorems are qualified with <label>, and the attributes
3417 <attrs> are applied after any attributes these theorems might have already.
3418 If the locale has assumptions, a chained fact of the form
3419 "<loc> t1 ... tn" is expected from which instantiations of the parameters
3420 are derived. The command does not support old-style locales declared
3421 with "locale (open)".
3422 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
3424 * HOL: Tactic emulation methods induct_tac and case_tac understand static
3430 * Proof import: new image HOL4 contains the imported library from
3431 the HOL4 system with about 2500 theorems. It is imported by
3432 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
3433 can be used like any other Isabelle image. See
3434 HOL/Import/HOL/README for more information.
3437 - Much improved handling of linear and partial orders.
3438 Reasoners for linear and partial orders are set up for type classes
3439 "linorder" and "order" respectively, and are added to the default simpset
3440 as solvers. This means that the simplifier can build transitivity chains
3441 to solve goals from the assumptions.
3442 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
3443 of blast or auto after simplification become unnecessary because the goal
3444 is solved by simplification already.
3446 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
3447 all proved in axiomatic type classes for semirings, rings and fields.
3450 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
3451 now formalized using the Ring_and_Field theory mentioned above.
3452 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
3453 than before, because now they are set up once in a generic manner.
3454 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
3455 Look for the general versions in Ring_and_Field (and Power if they concern
3458 * Type "rat" of the rational numbers is now available in HOL-Complex.
3461 - Record types are now by default printed with their type abbreviation
3462 instead of the list of all field types. This can be configured via
3463 the reference "print_record_type_abbr".
3464 - Simproc "record_upd_simproc" for simplification of multiple updates added
3465 (not enabled by default).
3466 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
3467 EX x. x = sel r to True (not enabled by default).
3468 - Tactic "record_split_simp_tac" to split and simplify records added.
3470 * 'specification' command added, allowing for definition by
3471 specification. There is also an 'ax_specification' command that
3472 introduces the new constants axiomatically.
3474 * arith(_tac) is now able to generate counterexamples for reals as well.
3476 * HOL-Algebra: new locale "ring" for non-commutative rings.
3478 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
3479 definitions, thanks to Sava Krsti\'{c} and John Matthews.
3481 * HOL-Matrix: a first theory for matrices in HOL with an application of
3482 matrix theory to linear programming.
3484 * Unions and Intersections:
3485 The latex output syntax of UN and INT has been changed
3486 from "\Union x \in A. B" to "\Union_{x \in A} B"
3487 i.e. the index formulae has become a subscript.
3488 Similarly for "\Union x. B", and for \Inter instead of \Union.
3490 * Unions and Intersections over Intervals:
3491 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
3492 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
3493 like in normal math, and corresponding versions for < and for intersection.
3495 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
3496 lexicographic dictonary ordering has been added as "lexord".
3498 * ML: the legacy theory structures Int and List have been removed. They had
3499 conflicted with ML Basis Library structures having the same names.
3501 * 'refute' command added to search for (finite) countermodels. Only works
3502 for a fragment of HOL. The installation of an external SAT solver is
3503 highly recommended. See "HOL/Refute.thy" for details.
3505 * 'quickcheck' command: Allows to find counterexamples by evaluating
3506 formulae under an assignment of free variables to random values.
3507 In contrast to 'refute', it can deal with inductive datatypes,
3508 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
3514 * Streams now come with concatenation and are part of the HOLCF image
3518 New in Isabelle2003 (May 2003)
3519 ------------------------------
3523 * Provers/simplifier:
3525 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
3526 Assumptions are now subject to complete mutual simplification,
3527 not just from left to right. The simplifier now preserves
3528 the order of assumptions.
3530 Potential INCOMPATIBILITY:
3532 -- simp sometimes diverges where the old version did
3533 not, e.g. invoking simp on the goal
3535 [| P (f x); y = x; f x = f y |] ==> Q
3537 now gives rise to the infinite reduction sequence
3539 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
3541 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
3544 -- Tactics combining classical reasoner and simplification (such as auto)
3545 are also affected by this change, because many of them rely on
3546 simp. They may sometimes diverge as well or yield a different numbers
3547 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
3548 in case of problems. Sometimes subsequent calls to the classical
3549 reasoner will fail because a preceeding call to the simplifier too
3550 eagerly simplified the goal, e.g. deleted redundant premises.
3552 - The simplifier trace now shows the names of the applied rewrite rules
3554 - You can limit the number of recursive invocations of the simplifier
3555 during conditional rewriting (where the simplifie tries to solve the
3556 conditions before applying the rewrite rule):
3557 ML "simp_depth_limit := n"
3558 where n is an integer. Thus you can force termination where previously
3559 the simplifier would diverge.
3561 - Accepts free variables as head terms in congruence rules. Useful in Isar.
3563 - No longer aborts on failed congruence proof. Instead, the
3564 congruence is ignored.
3566 * Pure: New generic framework for extracting programs from constructive
3567 proofs. See HOL/Extraction.thy for an example instantiation, as well
3568 as HOL/Extraction for some case studies.
3570 * Pure: The main goal of the proof state is no longer shown by default, only
3571 the subgoals. This behaviour is controlled by a new flag.
3572 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
3573 (ML: Proof.show_main_goal).
3575 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
3576 rules whose conclusion matches subgoal 1:
3577 PG menu: Isabelle/Isar -> Show me -> matching rules
3578 The rules are ordered by how closely they match the subgoal.
3579 In particular, rules that solve a subgoal outright are displayed first
3580 (or rather last, the way they are printed).
3581 (ML: ProofGeneral.print_intros())
3583 * Pure: New flag trace_unify_fail causes unification to print
3584 diagnostic information (PG: in trace buffer) when it fails. This is
3585 useful for figuring out why single step proofs like rule, erule or
3588 * Pure: Locale specifications now produce predicate definitions
3589 according to the body of text (covering assumptions modulo local
3590 definitions); predicate "loc_axioms" covers newly introduced text,
3591 while "loc" is cumulative wrt. all included locale expressions; the
3592 latter view is presented only on export into the global theory
3593 context; potential INCOMPATIBILITY, use "(open)" option to fall back
3594 on the old view without predicates;
3596 * Pure: predefined locales "var" and "struct" are useful for sharing
3597 parameters (as in CASL, for example); just specify something like
3598 ``var x + var y + struct M'' as import;
3600 * Pure: improved thms_containing: proper indexing of facts instead of
3601 raw theorems; check validity of results wrt. current name space;
3602 include local facts of proof configuration (also covers active
3603 locales), cover fixed variables in index; may use "_" in term
3604 specification; an optional limit for the number of printed facts may
3605 be given (the default is 40);
3607 * Pure: disallow duplicate fact bindings within new-style theory files
3610 * Provers: improved induct method: assumptions introduced by case
3611 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
3612 the goal statement); "foo" still refers to all facts collectively;
3614 * Provers: the function blast.overloaded has been removed: all constants
3615 are regarded as potentially overloaded, which improves robustness in exchange
3616 for slight decrease in efficiency;
3618 * Provers/linorder: New generic prover for transitivity reasoning over
3619 linear orders. Note: this prover is not efficient!
3621 * Isar: preview of problems to finish 'show' now produce an error
3622 rather than just a warning (in interactive mode);
3629 - Produces a counter example if it cannot prove a goal.
3630 Note that the counter example may be spurious if the goal is not a formula
3631 of quantifier-free linear arithmetic.
3632 In ProofGeneral the counter example appears in the trace buffer.
3634 - Knows about div k and mod k where k is a numeral of type nat or int.
3636 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
3637 linear arithmetic fails. This takes account of quantifiers and divisibility.
3638 Presburger arithmetic can also be called explicitly via presburger(_tac).
3640 * simp's arithmetic capabilities have been enhanced a bit: it now
3641 takes ~= in premises into account (by performing a case split);
3643 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
3644 are distributed over a sum of terms;
3646 * New tactic "trans_tac" and method "trans" instantiate
3647 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
3650 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
3651 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
3653 * 'typedef' command has new option "open" to suppress the set
3656 * functions Min and Max on finite sets have been introduced (theory
3659 * attribute [symmetric] now works for relations as well; it turns
3660 (x,y) : R^-1 into (y,x) : R, and vice versa;
3662 * induct over a !!-quantified statement (say !!x1..xn):
3663 each "case" automatically performs "fix x1 .. xn" with exactly those names.
3665 * Map: `empty' is no longer a constant but a syntactic abbreviation for
3666 %x. None. Warning: empty_def now refers to the previously hidden definition
3669 * Algebra: formalization of classical algebra. Intended as base for
3670 any algebraic development in Isabelle. Currently covers group theory
3671 (up to Sylow's theorem) and ring theory (Universal Property of
3672 Univariate Polynomials). Contributions welcome;
3674 * GroupTheory: deleted, since its material has been moved to Algebra;
3676 * Complex: new directory of the complex numbers with numeric constants,
3677 nonstandard complex numbers, and some complex analysis, standard and
3678 nonstandard (Jacques Fleuriot);
3680 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
3682 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
3685 * Real/HahnBanach: updated and adapted to locales;
3687 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
3690 * UNITY: added the Meier-Sanders theory of progress sets;
3692 * MicroJava: bytecode verifier and lightweight bytecode verifier
3693 as abstract algorithms, instantiated to the JVM;
3695 * Bali: Java source language formalization. Type system, operational
3696 semantics, axiomatic semantics. Supported language features:
3697 classes, interfaces, objects,virtual methods, static methods,
3698 static/instance fields, arrays, access modifiers, definite
3699 assignment, exceptions.
3704 * ZF/Constructible: consistency proof for AC (Gdel's constructible
3707 * Main ZF: virtually all theories converted to new-style format;
3712 * Pure: Tactic.prove provides sane interface for internal proofs;
3713 omits the infamous "standard" operation, so this is more appropriate
3714 than prove_goalw_cterm in many situations (e.g. in simprocs);
3716 * Pure: improved error reporting of simprocs;
3718 * Provers: Simplifier.simproc(_i) provides sane interface for setting
3722 *** Document preparation ***
3724 * uses \par instead of \\ for line breaks in theory text. This may
3725 shift some page breaks in large documents. To get the old behaviour
3726 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
3728 * minimized dependencies of isabelle.sty and isabellesym.sty on
3731 * \<euro> now needs package babel/greek instead of marvosym (which
3734 * normal size for \<zero>...\<nine> (uses \mathbf instead of
3739 New in Isabelle2002 (March 2002)
3740 --------------------------------
3742 *** Document preparation ***
3744 * greatly simplified document preparation setup, including more
3745 graceful interpretation of isatool usedir -i/-d/-D options, and more
3746 instructive isatool mkdir; users should basically be able to get
3747 started with "isatool mkdir HOL Test && isatool make"; alternatively,
3748 users may run a separate document processing stage manually like this:
3749 "isatool usedir -D output HOL Test && isatool document Test/output";
3751 * theory dependency graph may now be incorporated into documents;
3752 isatool usedir -g true will produce session_graph.eps/.pdf for use
3753 with \includegraphics of LaTeX;
3755 * proper spacing of consecutive markup elements, especially text
3756 blocks after section headings;
3758 * support bold style (for single symbols only), input syntax is like
3759 this: "\<^bold>\<alpha>" or "\<^bold>A";
3761 * \<bullet> is now output as bold \cdot by default, which looks much
3762 better in printed text;
3764 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
3765 note that these symbols are currently unavailable in Proof General /
3766 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
3768 * isatool latex no longer depends on changed TEXINPUTS, instead
3769 isatool document copies the Isabelle style files to the target
3775 * Pure/Provers: improved proof by cases and induction;
3776 - 'case' command admits impromptu naming of parameters (such as
3778 - 'induct' method divinates rule instantiation from the inductive
3779 claim; no longer requires excessive ?P bindings for proper
3780 instantiation of cases;
3781 - 'induct' method properly enumerates all possibilities of set/type
3782 rules; as a consequence facts may be also passed through *type*
3783 rules without further ado;
3784 - 'induct' method now derives symbolic cases from the *rulified*
3785 rule (before it used to rulify cases stemming from the internal
3786 atomized version); this means that the context of a non-atomic
3787 statement becomes is included in the hypothesis, avoiding the
3788 slightly cumbersome show "PROP ?case" form;
3789 - 'induct' may now use elim-style induction rules without chaining
3790 facts, using ``missing'' premises from the goal state; this allows
3791 rules stemming from inductive sets to be applied in unstructured
3792 scripts, while still benefitting from proper handling of non-atomic
3793 statements; NB: major inductive premises need to be put first, all
3794 the rest of the goal is passed through the induction;
3795 - 'induct' proper support for mutual induction involving non-atomic
3796 rule statements (uses the new concept of simultaneous goals, see
3798 - append all possible rule selections, but only use the first
3799 success (no backtracking);
3800 - removed obsolete "(simplified)" and "(stripped)" options of methods;
3801 - undeclared rule case names default to numbers 1, 2, 3, ...;
3802 - added 'print_induct_rules' (covered by help item in recent Proof
3804 - moved induct/cases attributes to Pure, methods to Provers;
3805 - generic method setup instantiated for FOL and HOL;
3807 * Pure: support multiple simultaneous goal statements, for example
3808 "have a: A and b: B" (same for 'theorem' etc.); being a pure
3809 meta-level mechanism, this acts as if several individual goals had
3810 been stated separately; in particular common proof methods need to be
3811 repeated in order to cover all claims; note that a single elimination
3812 step is *not* sufficient to establish the two conjunctions, so this
3815 assume "A & B" then have A and B .. (*".." fails*)
3817 better use "obtain" in situations as above; alternative refer to
3818 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
3820 * Pure: proper integration with ``locales''; unlike the original
3821 version by Florian Kammller, Isar locales package high-level proof
3822 contexts rather than raw logical ones (e.g. we admit to include
3823 attributes everywhere); operations on locales include merge and
3824 rename; support for implicit arguments (``structures''); simultaneous
3825 type-inference over imports and text; see also HOL/ex/Locales.thy for
3828 * Pure: the following commands have been ``localized'', supporting a
3829 target locale specification "(in name)": 'lemma', 'theorem',
3830 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
3831 stored both within the locale and at the theory level (exported and
3832 qualified by the locale name);
3834 * Pure: theory goals may now be specified in ``long'' form, with
3835 ad-hoc contexts consisting of arbitrary locale elements. for example
3836 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
3837 definitions may be given, too); the result is a meta-level rule with
3838 the context elements being discharged in the obvious way;
3840 * Pure: new proof command 'using' allows to augment currently used
3841 facts after a goal statement ('using' is syntactically analogous to
3842 'apply', but acts on the goal's facts only); this allows chained facts
3843 to be separated into parts given before and after a claim, as in
3844 ``from a and b have C using d and e <proof>'';
3846 * Pure: renamed "antecedent" case to "rule_context";
3848 * Pure: new 'judgment' command records explicit information about the
3849 object-logic embedding (used by several tools internally); no longer
3850 use hard-wired "Trueprop";
3852 * Pure: added 'corollary' command;
3854 * Pure: fixed 'token_translation' command;
3856 * Pure: removed obsolete 'exported' attribute;
3858 * Pure: dummy pattern "_" in is/let is now automatically lifted over
3859 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
3860 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
3862 * Pure: method 'atomize' presents local goal premises as object-level
3863 statements (atomic meta-level propositions); setup controlled via
3864 rewrite rules declarations of 'atomize' attribute; example
3865 application: 'induct' method with proper rule statements in improper
3868 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
3869 now consider the syntactic context of assumptions, giving a better
3870 chance to get type-inference of the arguments right (this is
3871 especially important for locales);
3873 * Pure: "sorry" no longer requires quick_and_dirty in interactive
3876 * Pure/obtain: the formal conclusion "thesis", being marked as
3877 ``internal'', may no longer be reference directly in the text;
3878 potential INCOMPATIBILITY, may need to use "?thesis" in rare
3881 * Pure: generic 'sym' attribute which declares a rule both as pure
3882 'elim?' and for the 'symmetric' operation;
3884 * Pure: marginal comments ``--'' may now occur just anywhere in the
3885 text; the fixed correlation with particular command syntax has been
3888 * Pure: new method 'rules' is particularly well-suited for proof
3889 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
3890 but often produces more compact proof terms with less detours;
3892 * Pure/Provers/classical: simplified integration with pure rule
3893 attributes and methods; the classical "intro?/elim?/dest?"
3894 declarations coincide with the pure ones; the "rule" method no longer
3895 includes classically swapped intros; "intro" and "elim" methods no
3896 longer pick rules from the context; also got rid of ML declarations
3897 AddXIs/AddXEs/AddXDs; all of this has some potential for
3900 * Provers/classical: attribute 'swapped' produces classical inversions
3901 of introduction rules;
3903 * Provers/simplifier: 'simplified' attribute may refer to explicit
3904 rules instead of full simplifier context; 'iff' attribute handles
3907 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
3909 * HOL: 'recdef' now fails on unfinished automated proofs, use
3910 "(permissive)" option to recover old behavior;
3912 * HOL: 'inductive' no longer features separate (collective) attributes
3913 for 'intros' (was found too confusing);
3915 * HOL: properly declared induction rules less_induct and
3921 * HOL: moved over to sane numeral syntax; the new policy is as
3924 - 0 and 1 are polymorphic constants, which are defined on any
3925 numeric type (nat, int, real etc.);
3927 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
3928 binary representation internally;
3930 - type nat has special constructor Suc, and generally prefers Suc 0
3931 over 1::nat and Suc (Suc 0) over 2::nat;
3933 This change may cause significant problems of INCOMPATIBILITY; here
3934 are some hints on converting existing sources:
3936 - due to the new "num" token, "-0" and "-1" etc. are now atomic
3937 entities, so expressions involving "-" (unary or binary minus) need
3938 to be spaced properly;
3940 - existing occurrences of "1" may need to be constraint "1::nat" or
3941 even replaced by Suc 0; similar for old "2";
3943 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
3945 - remove all special provisions on numerals in proofs;
3947 * HOL: simp rules nat_number expand numerals on nat to Suc/0
3948 representation (depends on bin_arith_simps in the default context);
3950 * HOL: symbolic syntax for x^2 (numeral 2);
3952 * HOL: the class of all HOL types is now called "type" rather than
3953 "term"; INCOMPATIBILITY, need to adapt references to this type class
3954 in axclass/classes, instance/arities, and (usually rare) occurrences
3955 in typings (of consts etc.); internally the class is called
3956 "HOL.type", ML programs should refer to HOLogic.typeS;
3958 * HOL/record package improvements:
3959 - new derived operations "fields" to build a partial record section,
3960 "extend" to promote a fixed record to a record scheme, and
3961 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
3962 declared as simp by default;
3963 - shared operations ("more", "fields", etc.) now need to be always
3964 qualified) --- potential INCOMPATIBILITY;
3965 - removed "make_scheme" operations (use "make" with "extend") --
3967 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
3968 - provides cases/induct rules for use with corresponding Isar
3969 methods (for concrete records, record schemes, concrete more
3970 parts, and schematic more parts -- in that order);
3971 - internal definitions directly based on a light-weight abstract
3972 theory of product types over typedef rather than datatype;
3974 * HOL: generic code generator for generating executable ML code from
3975 specifications; specific support for HOL constructs such as inductive
3976 datatypes and sets, as well as recursive functions; can be invoked
3977 via 'generate_code' theory section;
3979 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
3981 * HOL: consolidated and renamed several theories. In particular:
3982 Ord.thy has been absorbed into HOL.thy
3983 String.thy has been absorbed into List.thy
3985 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
3986 (beware of argument permutation!);
3988 * HOL: linorder_less_split superseded by linorder_cases;
3990 * HOL/List: "nodups" renamed to "distinct";
3992 * HOL: added "The" definite description operator; move Hilbert's "Eps"
3993 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
3994 - Ex_def has changed, now need to use some_eq_ex
3996 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
3997 in this (rare) case use:
3999 delSWrapper "split_all_tac"
4000 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
4002 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
4005 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
4006 Isabelle's type classes, ^ on functions and relations has too general
4007 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
4008 necessary to attach explicit type constraints;
4010 * HOL/Relation: the prefix name of the infix "O" has been changed from
4011 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
4012 renamed accordingly (eg "compI" -> "rel_compI").
4014 * HOL: syntax translations now work properly with numerals and records
4017 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
4018 of "lam" -- INCOMPATIBILITY;
4020 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
4021 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
4022 renamed "Product_Type.unit";
4024 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
4026 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
4027 the "cases" method);
4029 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
4032 * HOL/IMP: updated and converted to new-style theory format; several
4033 parts turned into readable document, with proper Isar proof texts and
4034 some explanations (by Gerwin Klein);
4036 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
4038 * HOL-Hyperreal is now a logic image;
4043 * Isar: consts/constdefs supports mixfix syntax for continuous
4046 * Isar: domain package adapted to new-style theory format, e.g. see
4049 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
4050 potential INCOMPATIBILITY; now use plain induct_tac instead of former
4051 lift.induct_tac, always use UU instead of Undef;
4053 * HOLCF/IMP: updated and converted to new-style theory;
4058 * Isar: proper integration of logic-specific tools and packages,
4059 including theory commands '(co)inductive', '(co)datatype',
4060 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
4061 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
4063 * theory Main no longer includes AC; for the Axiom of Choice, base
4064 your theory on Main_ZFC;
4066 * the integer library now covers quotients and remainders, with many
4067 laws relating division to addition, multiplication, etc.;
4069 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
4070 typeless version of the formalism;
4072 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
4075 * ZF/Induct: new directory for examples of inductive definitions,
4076 including theory Multiset for multiset orderings; converted to
4077 new-style theory format;
4079 * ZF: many new theorems about lists, ordinals, etc.;
4084 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
4085 variable proof controls level of detail: 0 = no proofs (only oracle
4086 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
4087 also ref manual for further ML interfaces;
4089 * Pure/axclass: removed obsolete ML interface
4090 goal_subclass/goal_arity;
4092 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
4093 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
4094 separate tokens, so expressions involving minus need to be spaced
4097 * Pure/syntax: support non-oriented infixes, using keyword "infix"
4098 rather than "infixl" or "infixr";
4100 * Pure/syntax: concrete syntax for dummy type variables admits genuine
4101 sort constraint specifications in type inference; e.g. "x::_::foo"
4102 ensures that the type of "x" is of sort "foo" (but not necessarily a
4105 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
4106 control output of nested => (types); the default behavior is
4109 * Pure/syntax: builtin parse translation for "_constify" turns valued
4110 tokens into AST constants;
4112 * Pure/syntax: prefer later declarations of translations and print
4113 translation functions; potential INCOMPATIBILITY: need to reverse
4114 multiple declarations for same syntax element constant;
4116 * Pure/show_hyps reset by default (in accordance to existing Isar
4119 * Provers/classical: renamed addaltern to addafter, addSaltern to
4122 * Provers/clasimp: ``iff'' declarations now handle conditional rules
4125 * system: tested support for MacOS X; should be able to get Isabelle +
4126 Proof General to work in a plain Terminal after installing Poly/ML
4127 (e.g. from the Isabelle distribution area) and GNU bash alone
4128 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
4129 support requires further installations, e.g. from
4130 http://fink.sourceforge.net/);
4132 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
4134 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
4135 of 40 MB), cf. ML_OPTIONS;
4137 * system: Proof General keywords specification is now part of the
4138 Isabelle distribution (see etc/isar-keywords.el);
4140 * system: support for persistent Proof General sessions (refrain from
4141 outdating all loaded theories on startup); user may create writable
4142 logic images like this: ``isabelle -q HOL Test'';
4144 * system: smart selection of Isabelle process versus Isabelle
4145 interface, accommodates case-insensitive file systems (e.g. HFS+); may
4146 run both "isabelle" and "Isabelle" even if file names are badly
4147 damaged (executable inspects the case of the first letter of its own
4148 name); added separate "isabelle-process" and "isabelle-interface";
4150 * system: refrain from any attempt at filtering input streams; no
4151 longer support ``8bit'' encoding of old isabelle font, instead proper
4152 iso-latin characters may now be used; the related isatools
4153 "symbolinput" and "nonascii" have disappeared as well;
4155 * system: removed old "xterm" interface (the print modes "xterm" and
4156 "xterm_color" are still available for direct use in a suitable
4161 New in Isabelle99-2 (February 2001)
4162 -----------------------------------
4164 *** Overview of INCOMPATIBILITIES ***
4166 * HOL: please note that theories in the Library and elsewhere often use the
4167 new-style (Isar) format; to refer to their theorems in an ML script you must
4168 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
4170 * HOL: inductive package no longer splits induction rule aggressively,
4171 but only as far as specified by the introductions given; the old
4172 format may be recovered via ML function complete_split_rule or attribute
4173 'split_rule (complete)';
4175 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
4176 gfp_Tarski to gfp_unfold;
4178 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
4180 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
4181 relation); infix "^^" has been renamed "``"; infix "``" has been
4182 renamed "`"; "univalent" has been renamed "single_valued";
4184 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
4187 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
4189 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
4191 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
4192 consequence, it is no longer monotonic wrt. the local goal context
4193 (which is now passed through the inductive cases);
4195 * Document preparation: renamed standard symbols \<ll> to \<lless> and
4196 \<gg> to \<ggreater>;
4199 *** Document preparation ***
4201 * \isabellestyle{NAME} selects version of Isabelle output (currently
4202 available: are "it" for near math-mode best-style output, "sl" for
4203 slanted text style, and "tt" for plain type-writer; if no
4204 \isabellestyle command is given, output is according to slanted
4207 * support sub/super scripts (for single symbols only), input syntax is
4208 like this: "A\<^sup>*" or "A\<^sup>\<star>";
4210 * some more standard symbols; see Appendix A of the system manual for
4211 the complete list of symbols defined in isabellesym.sty;
4213 * improved isabelle style files; more abstract symbol implementation
4214 (should now use \isamath{...} and \isatext{...} in custom symbol
4217 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
4218 state; Note that presentation of goal states does not conform to
4219 actual human-readable proof documents. Please do not include goal
4220 states into document output unless you really know what you are doing!
4222 * proper indentation of antiquoted output with proportional LaTeX
4225 * no_document ML operator temporarily disables LaTeX document
4228 * isatool unsymbolize tunes sources for plain ASCII communication;
4233 * Pure: Isar now suffers initial goal statements to contain unbound
4234 schematic variables (this does not conform to actual readable proof
4235 documents, due to unpredictable outcome and non-compositional proof
4236 checking); users who know what they are doing may use schematic goals
4237 for Prolog-style synthesis of proven results;
4239 * Pure: assumption method (an implicit finishing) now handles actual
4242 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
4243 initial goal, declare "that" only as Pure intro (only for single
4244 steps); the "that" rule assumption may now be involved in implicit
4245 finishing, thus ".." becomes a feasible for trivial obtains;
4247 * Pure: default proof step now includes 'intro_classes'; thus trivial
4248 instance proofs may be performed by "..";
4250 * Pure: ?thesis / ?this / "..." now work for pure meta-level
4253 * Pure: more robust selection of calculational rules;
4255 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
4256 rule (as well as the assumption rule);
4258 * Pure: 'thm_deps' command visualizes dependencies of theorems and
4259 lemmas, using the graph browser tool;
4261 * Pure: predict failure of "show" in interactive mode;
4263 * Pure: 'thms_containing' now takes actual terms as arguments;
4265 * HOL: improved method 'induct' --- now handles non-atomic goals
4266 (potential INCOMPATIBILITY); tuned error handling;
4268 * HOL: cases and induct rules now provide explicit hints about the
4269 number of facts to be consumed (0 for "type" and 1 for "set" rules);
4270 any remaining facts are inserted into the goal verbatim;
4272 * HOL: local contexts (aka cases) may now contain term bindings as
4273 well; the 'cases' and 'induct' methods new provide a ?case binding for
4274 the result to be shown in each case;
4276 * HOL: added 'recdef_tc' command;
4278 * isatool convert assists in eliminating legacy ML scripts;
4283 * HOL/Library: a collection of generic theories to be used together
4284 with main HOL; the theory loader path already includes this directory
4285 by default; the following existing theories have been moved here:
4286 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
4287 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
4289 * HOL/Unix: "Some aspects of Unix file-system security", a typical
4290 modelling and verification task performed in Isabelle/HOL +
4291 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
4293 * HOL/Algebra: special summation operator SUM no longer exists, it has
4294 been replaced by setsum; infix 'assoc' now has priority 50 (like
4295 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
4296 'domain', this makes the theory consistent with mathematical
4299 * HOL basics: added overloaded operations "inverse" and "divide"
4300 (infix "/"), syntax for generic "abs" operation, generic summation
4303 * HOL/typedef: simplified package, provide more useful rules (see also
4306 * HOL/datatype: induction rule for arbitrarily branching datatypes is
4307 now expressed as a proper nested rule (old-style tactic scripts may
4308 require atomize_strip_tac to cope with non-atomic premises);
4310 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
4311 to "split_conv" (old name still available for compatibility);
4313 * HOL: improved concrete syntax for strings (e.g. allows translation
4314 rules with string literals);
4316 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
4317 and Fleuriot's mechanization of analysis, including the transcendental
4318 functions for the reals;
4320 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
4325 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
4326 "lam" is displayed as TWO lambda-symbols
4328 * CTT: theory Main now available, containing everything (that is, Bool
4334 * Pure: the Simplifier has been implemented properly as a derived rule
4335 outside of the actual kernel (at last!); the overall performance
4336 penalty in practical applications is about 50%, while reliability of
4337 the Isabelle inference kernel has been greatly improved;
4339 * print modes "brackets" and "no_brackets" control output of nested =>
4340 (types) and ==> (props); the default behaviour is "brackets";
4342 * Provers: fast_tac (and friends) now handle actual object-logic rules
4343 as assumptions as well;
4345 * system: support Poly/ML 4.0;
4347 * system: isatool install handles KDE version 1 or 2;
4351 New in Isabelle99-1 (October 2000)
4352 ----------------------------------
4354 *** Overview of INCOMPATIBILITIES ***
4356 * HOL: simplification of natural numbers is much changed; to partly
4357 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
4358 issue the following ML commands:
4360 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
4361 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
4363 * HOL: simplification no longer dives into case-expressions; this is
4364 controlled by "t.weak_case_cong" for each datatype t;
4366 * HOL: nat_less_induct renamed to less_induct;
4368 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
4369 fixsome to patch .thy and .ML sources automatically;
4371 select_equality -> some_equality
4372 select_eq_Ex -> some_eq_ex
4373 selectI2EX -> someI2_ex
4376 select1_equality -> some1_equality
4377 Eps_sym_eq -> some_sym_eq_trivial
4378 Eps_eq -> some_eq_trivial
4380 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
4382 * HOL: removed obsolete theorem binding expand_if (refer to split_if
4385 * HOL: the recursion equations generated by 'recdef' are now called
4386 f.simps instead of f.rules;
4388 * HOL: qed_spec_mp now also handles bounded ALL as well;
4390 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
4391 sometimes be needed;
4393 * HOL: the constant for "f``x" is now "image" rather than "op ``";
4395 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
4397 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
4398 product is now "<*>" instead of "Times"; the lexicographic product is
4399 now "<*lex*>" instead of "**";
4401 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
4402 of main HOL, but was unused); better use HOL's datatype package;
4404 * HOL: removed "symbols" syntax for constant "override" of theory Map;
4405 the old syntax may be recovered as follows:
4408 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
4409 (infixl "\\<oplus>" 100)
4411 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4413 * HOL/ML: even fewer consts are declared as global (see theories Ord,
4414 Lfp, Gfp, WF); this only affects ML packages that refer to const names
4417 * HOL and ZF: syntax for quotienting wrt an equivalence relation
4418 changed from A/r to A//r;
4420 * ZF: new treatment of arithmetic (nat & int) may break some old
4423 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
4424 rulify -> rule_format, elimify -> elim_format, ...);
4426 * Isar/Provers: intro/elim/dest attributes changed; renamed
4427 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
4428 should have to change intro!! to intro? only); replaced "delrule" by
4431 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
4433 * Provers: strengthened force_tac by using new first_best_tac;
4435 * LaTeX document preparation: several changes of isabelle.sty (see
4439 *** Document preparation ***
4441 * formal comments (text blocks etc.) in new-style theories may now
4442 contain antiquotations of thm/prop/term/typ/text to be presented
4443 according to latex print mode; concrete syntax is like this:
4444 @{term[show_types] "f(x) = a + x"};
4446 * isatool mkdir provides easy setup of Isabelle session directories,
4447 including proper document sources;
4449 * generated LaTeX sources are now deleted after successful run
4450 (isatool document -c); may retain a copy somewhere else via -D option
4453 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
4454 style files, achieving self-contained LaTeX sources and simplifying
4457 * old-style theories now produce (crude) LaTeX output as well;
4459 * browser info session directories are now self-contained (may be put
4460 on WWW server seperately); improved graphs of nested sessions; removed
4461 graph for 'all sessions';
4463 * several improvements in isabelle style files; \isabellestyle{it}
4464 produces fake math mode output; \isamarkupheader is now \section by
4465 default; see lib/texinputs/isabelle.sty etc.;
4470 * Isar/Pure: local results and corresponding term bindings are now
4471 subject to Hindley-Milner polymorphism (similar to ML); this
4472 accommodates incremental type-inference very nicely;
4474 * Isar/Pure: new derived language element 'obtain' supports
4475 generalized existence reasoning;
4477 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
4478 support accumulation of results, without applying any rules yet;
4479 useful to collect intermediate results without explicit name
4480 references, and for use with transitivity rules with more than 2
4483 * Isar/Pure: scalable support for case-analysis type proofs: new
4484 'case' language element refers to local contexts symbolically, as
4485 produced by certain proof methods; internally, case names are attached
4486 to theorems as "tags";
4488 * Isar/Pure: theory command 'hide' removes declarations from
4489 class/type/const name spaces;
4491 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
4492 indicate potential overloading;
4494 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
4496 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
4497 "{a,b,c}" instead of {a,b,c};
4499 * Isar/Pure now provides its own version of intro/elim/dest
4500 attributes; useful for building new logics, but beware of confusion
4501 with the version in Provers/classical;
4503 * Isar/Pure: the local context of (non-atomic) goals is provided via
4504 case name 'antecedent';
4506 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
4507 to the current context is now done automatically);
4509 * Isar/Pure: theory command 'method_setup' provides a simple interface
4510 for definining proof methods in ML;
4512 * Isar/Provers: intro/elim/dest attributes changed; renamed
4513 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
4514 most cases, one should have to change intro!! to intro? only);
4515 replaced "delrule" by "rule del";
4517 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
4518 'symmetric' attribute (the latter supercedes [RS sym]);
4520 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
4521 method modifier); 'simp' method: 'only:' modifier removes loopers as
4522 well (including splits);
4524 * Isar/Provers: Simplifier and Classical methods now support all kind
4525 of modifiers used in the past, including 'cong', 'iff', etc.
4527 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
4528 of Simplifier and Classical reasoner);
4530 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
4531 now support named cases; major packages (inductive, datatype, primrec,
4532 recdef) support case names and properly name parameters;
4534 * Isar/HOL: new transitivity rules for substitution in inequalities --
4535 monotonicity conditions are extracted to be proven at end of
4538 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
4541 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
4542 split_if split_if_asm; datatype package provides theorems foo.splits =
4543 foo.split foo.split_asm for each datatype;
4545 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
4546 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
4547 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
4548 use "(cases (simplified))" method in proper proof texts);
4550 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
4552 * Isar: names of theorems etc. may be natural numbers as well;
4554 * Isar: 'pr' command: optional arguments for goals_limit and
4555 ProofContext.prems_limit; no longer prints theory contexts, but only
4558 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
4559 additional print modes to be specified; e.g. "pr(latex)" will print
4560 proof state according to the Isabelle LaTeX style;
4562 * Isar: improved support for emulating tactic scripts, including proof
4563 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
4564 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
4565 (for HOL datatypes);
4567 * Isar: simplified (more robust) goal selection of proof methods: 1st
4568 goal, all goals, or explicit goal specifier (tactic emulation); thus
4569 'proof method scripts' have to be in depth-first order;
4571 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
4573 * Isar: removed 'help' command, which hasn't been too helpful anyway;
4574 should instead use individual commands for printing items
4575 (print_commands, print_methods etc.);
4577 * Isar: added 'nothing' --- the empty list of theorems;
4582 * HOL/MicroJava: formalization of a fragment of Java, together with a
4583 corresponding virtual machine and a specification of its bytecode
4584 verifier and a lightweight bytecode verifier, including proofs of
4585 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
4586 Cornelia Pusch (see also the homepage of project Bali at
4587 http://isabelle.in.tum.de/Bali/);
4589 * HOL/Algebra: new theory of rings and univariate polynomials, by
4592 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
4593 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
4596 * HOL/Lattice: fundamental concepts of lattice theory and order
4597 structures, including duals, properties of bounds versus algebraic
4598 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
4599 Theorem for complete lattices etc.; may also serve as a demonstration
4600 for abstract algebraic reasoning using axiomatic type classes, and
4601 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
4603 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
4606 * HOL/IMPP: extension of IMP with local variables and mutually
4607 recursive procedures, by David von Oheimb;
4609 * HOL/Lambda: converted into new-style theory and document;
4611 * HOL/ex/Multiquote: example of multiple nested quotations and
4612 anti-quotations -- basically a generalized version of de-Bruijn
4613 representation; very useful in avoiding lifting of operations;
4615 * HOL/record: added general record equality rule to simpset; fixed
4616 select-update simplification procedure to handle extended records as
4617 well; admit "r" as field name;
4619 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
4620 other numeric types and also as the identity of groups, rings, etc.;
4622 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
4623 Types nat and int belong to this axclass;
4625 * HOL: greatly improved simplification involving numerals of type nat, int, real:
4626 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
4627 i*j + k + j*#3*i simplifies to #4*(i*j) + k
4628 two terms #m*u and #n*u are replaced by #(m+n)*u
4629 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
4630 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
4631 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
4633 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
4634 powerful prover for predicate logic but knows nothing of clasets; see
4635 ex/mesontest.ML and ex/mesontest2.ML for example applications;
4637 * HOL: new version of "case_tac" subsumes both boolean case split and
4638 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
4639 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
4641 * HOL: simplification no longer dives into case-expressions: only the
4642 selector expression is simplified, but not the remaining arms; to
4643 enable full simplification of case-expressions for datatype t, you may
4644 remove t.weak_case_cong from the simpset, either globally (Delcongs
4645 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
4647 * HOL/recdef: the recursion equations generated by 'recdef' for
4648 function 'f' are now called f.simps instead of f.rules; if all
4649 termination conditions are proved automatically, these simplification
4650 rules are added to the simpset, as in primrec; rules may be named
4651 individually as well, resulting in a separate list of theorems for
4654 * HOL/While is a new theory that provides a while-combinator. It
4655 permits the definition of tail-recursive functions without the
4656 provision of a termination measure. The latter is necessary once the
4657 invariant proof rule for while is applied.
4659 * HOL: new (overloaded) notation for the set of elements below/above
4660 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
4662 * HOL: theorems impI, allI, ballI bound as "strip";
4664 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
4665 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
4666 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
4668 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4670 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
4671 main HOL, but was unused);
4673 * HOL: fewer consts declared as global (e.g. have to refer to
4674 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
4676 * HOL: tuned AST representation of nested pairs, avoiding bogus output
4677 in case of overlap with user translations (e.g. judgements over
4678 tuples); (note that the underlying logical represenation is still
4684 * ZF: simplification automatically cancels common terms in arithmetic
4685 expressions over nat and int;
4687 * ZF: new treatment of nat to minimize type-checking: all operators
4688 coerce their operands to a natural number using the function natify,
4689 making the algebraic laws unconditional;
4691 * ZF: as above, for int: operators coerce their operands to an integer
4692 using the function intify;
4694 * ZF: the integer library now contains many of the usual laws for the
4695 orderings, including $<=, and monotonicity laws for $+ and $*;
4697 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
4700 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
4701 to the simplifier and classical reasoner simultaneously;
4706 * Provers: blast_tac now handles actual object-logic rules as
4707 assumptions; note that auto_tac uses blast_tac internally as well;
4709 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
4710 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
4712 * Provers: delrules now handles destruct rules as well (no longer need
4713 explicit make_elim);
4715 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
4716 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4717 use instead the strong form,
4718 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4719 in HOL, FOL and ZF the function cla_make_elim will create such rules
4720 from destruct-rules;
4722 * Provers: Simplifier.easy_setup provides a fast path to basic
4723 Simplifier setup for new object-logics;
4725 * Pure: AST translation rules no longer require constant head on LHS;
4727 * Pure: improved name spaces: ambiguous output is qualified; support
4728 for hiding of names;
4730 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
4731 XSYMBOL_HOME; no longer need to do manual configuration in most
4734 * system: compression of ML heaps images may now be controlled via -c
4735 option of isabelle and isatool usedir (currently only observed by
4738 * system: isatool installfonts may handle X-Symbol fonts as well (very
4739 useful for remote X11);
4741 * system: provide TAGS file for Isabelle sources;
4743 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
4746 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
4747 timing flag supersedes proof_timing and Toplevel.trace;
4749 * ML: new combinators |>> and |>>> for incremental transformations
4750 with secondary results (e.g. certain theory extensions):
4752 * ML: PureThy.add_defs gets additional argument to indicate potential
4753 overloading (usually false);
4755 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
4760 New in Isabelle99 (October 1999)
4761 --------------------------------
4763 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4765 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
4766 are no longer simplified. (This allows the simplifier to unfold recursive
4767 functional programs.) To restore the old behaviour, declare
4769 Delcongs [if_weak_cong];
4771 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
4774 * HOL: the predicate "inj" is now defined by translation to "inj_on";
4776 * HOL/datatype: mutual_induct_tac no longer exists --
4777 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
4779 * HOL/typedef: fixed type inference for representing set; type
4780 arguments now have to occur explicitly on the rhs as type constraints;
4782 * ZF: The con_defs part of an inductive definition may no longer refer
4783 to constants declared in the same theory;
4785 * HOL, ZF: the function mk_cases, generated by the inductive
4786 definition package, has lost an argument. To simplify its result, it
4787 uses the default simpset instead of a supplied list of theorems.
4789 * HOL/List: the constructors of type list are now Nil and Cons;
4791 * Simplifier: the type of the infix ML functions
4792 setSSolver addSSolver setSolver addSolver
4793 is now simpset * solver -> simpset where `solver' is a new abstract type
4794 for packaging solvers. A solver is created via
4795 mk_solver: string -> (thm list -> int -> tactic) -> solver
4796 where the string argument is only a comment.
4801 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
4802 decision procedure for linear arithmetic. Currently it is used for
4803 types `nat', `int', and `real' in HOL (see below); it can, should and
4804 will be instantiated for other types and logics as well.
4806 * The simplifier now accepts rewrite rules with flexible heads, eg
4807 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
4808 They are applied like any rule with a non-pattern lhs, i.e. by first-order
4814 * New Isabelle/Isar subsystem provides an alternative to traditional
4815 tactical theorem proving; together with the ProofGeneral/isar user
4816 interface it offers an interactive environment for developing human
4817 readable proof documents (Isar == Intelligible semi-automated
4818 reasoning); for further information see isatool doc isar-ref,
4819 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
4821 * improved and simplified presentation of theories: better HTML markup
4822 (including colors), graph views in several sizes; isatool usedir now
4823 provides a proper interface for user theories (via -P option); actual
4824 document preparation based on (PDF)LaTeX is available as well (for
4825 new-style theories only); see isatool doc system for more information;
4827 * native support for Proof General, both for classic Isabelle and
4830 * ML function thm_deps visualizes dependencies of theorems and lemmas,
4831 using the graph browser tool;
4833 * Isabelle manuals now also available as PDF;
4835 * theory loader rewritten from scratch (may not be fully
4836 bug-compatible); old loadpath variable has been replaced by show_path,
4837 add_path, del_path, reset_path functions; new operations such as
4838 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
4841 * improved isatool install: option -k creates KDE application icon,
4842 option -p DIR installs standalone binaries;
4844 * added ML_PLATFORM setting (useful for cross-platform installations);
4845 more robust handling of platform specific ML images for SML/NJ;
4847 * the settings environment is now statically scoped, i.e. it is never
4848 created again in sub-processes invoked from isabelle, isatool, or
4851 * path element specification '~~' refers to '$ISABELLE_HOME';
4853 * in locales, the "assumes" and "defines" parts may be omitted if
4856 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
4859 * new print_mode "HTML";
4861 * new flag show_tags controls display of tags of theorems (which are
4862 basically just comments that may be attached by some tools);
4864 * Isamode 2.6 requires patch to accomodate change of Isabelle font
4865 mode and goal output format:
4867 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
4869 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
4871 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
4872 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
4874 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
4876 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
4878 * function bind_thms stores lists of theorems (cf. bind_thm);
4880 * new shorthand tactics ftac, eatac, datac, fatac;
4882 * qed (and friends) now accept "" as result name; in that case the
4883 theorem is not stored, but proper checks and presentation of the
4886 * theorem database now also indexes constants "Trueprop", "all",
4887 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
4892 ** HOL arithmetic **
4894 * There are now decision procedures for linear arithmetic over nat and
4897 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
4898 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
4899 are treated as atomic; subformulae not involving type `nat' or `int'
4900 are ignored; quantified subformulae are ignored unless they are
4901 positive universal or negative existential. The tactic has to be
4902 invoked by hand and can be a little bit slow. In particular, the
4903 running time is exponential in the number of occurrences of `min' and
4904 `max', and `-' on `nat'.
4906 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
4907 (negated) (in)equalities among the premises and the conclusion into
4908 account (i.e. no compound formulae) and does not know about `min' and
4909 `max', and `-' on `nat'. It is fast and is used automatically by the
4912 NB: At the moment, these decision procedures do not cope with mixed
4913 nat/int formulae where the two parts interact, such as `m < n ==>
4916 * HOL/Numeral provides a generic theory of numerals (encoded
4917 efficiently as bit strings); setup for types nat/int/real is in place;
4918 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
4919 int, existing theories and proof scripts may require a few additional
4922 * integer division and remainder can now be performed on constant
4925 * many properties of integer multiplication, division and remainder
4928 * An interface to the Stanford Validity Checker (SVC) is available through the
4929 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
4930 are proved automatically. SVC must be installed separately, and its results
4931 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
4932 invocation of the underlying oracle). For SVC see
4933 http://verify.stanford.edu/SVC
4935 * IsaMakefile: the HOL-Real target now builds an actual image;
4940 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
4941 (in Isabelle/Isar) -- by Gertrud Bauer;
4943 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
4944 analysis for assembly languages with subtypes;
4946 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
4947 -- avoids syntactic ambiguities and treats state, transition, and
4948 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
4949 changed syntax and (many) tactics;
4951 * HOL/inductive: Now also handles more general introduction rules such
4952 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
4953 theorems are now maintained within the theory (maintained via the
4956 * HOL/datatype: Now also handles arbitrarily branching datatypes
4957 (using function types) such as
4959 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
4961 * HOL/record: record_simproc (part of the default simpset) takes care
4962 of selectors applied to updated records; record_split_tac is no longer
4963 part of the default claset; update_defs may now be removed from the
4964 simpset in many cases; COMPATIBILITY: old behavior achieved by
4966 claset_ref () := claset() addSWrapper record_split_wrapper;
4967 Delsimprocs [record_simproc]
4969 * HOL/typedef: fixed type inference for representing set; type
4970 arguments now have to occur explicitly on the rhs as type constraints;
4972 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
4973 names rather than an ML expression;
4975 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
4976 supplied later. Program schemes can be defined, such as
4977 "While B C s = (if B s then While B C (C s) else s)"
4978 where the well-founded relation can be chosen after B and C have been given.
4980 * HOL/List: the constructors of type list are now Nil and Cons;
4981 INCOMPATIBILITY: while [] and infix # syntax is still there, of
4982 course, ML tools referring to List.list.op # etc. have to be adapted;
4984 * HOL_quantifiers flag superseded by "HOL" print mode, which is
4985 disabled by default; run isabelle with option -m HOL to get back to
4986 the original Gordon/HOL-style output;
4988 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
4989 ALL x<=y. P, EX x<y. P, EX x<=y. P;
4991 * HOL basic syntax simplified (more orthogonal): all variants of
4992 All/Ex now support plain / symbolic / HOL notation; plain syntax for
4993 Eps operator is provided as well: "SOME x. P[x]";
4995 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
4997 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
4998 thus available for user theories;
5000 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
5001 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
5004 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
5005 several times and then mp;
5010 * the notation <<...>> is now available as a notation for sequences of
5013 * the simplifier is now installed
5015 * the axiom system has been generalized (thanks to Soren Heilmann)
5017 * the classical reasoner now has a default rule database
5022 * new primrec section allows primitive recursive functions to be given
5023 directly (as in HOL) over datatypes and the natural numbers;
5025 * new tactics induct_tac and exhaust_tac for induction (or case
5026 analysis) over datatypes and the natural numbers;
5028 * the datatype declaration of type T now defines the recursor T_rec;
5030 * simplification automatically does freeness reasoning for datatype
5033 * automatic type-inference, with AddTCs command to insert new
5034 type-checking rules;
5036 * datatype introduction rules are now added as Safe Introduction rules
5039 * the syntax "if P then x else y" is now available in addition to
5043 *** Internal programming interfaces ***
5045 * tuned simplifier trace output; new flag debug_simp;
5047 * structures Vartab / Termtab (instances of TableFun) offer efficient
5048 tables indexed by indexname_ord / term_ord (compatible with aconv);
5050 * AxClass.axclass_tac lost the theory argument;
5052 * tuned current_goals_markers semantics: begin / end goal avoids
5053 printing empty lines;
5055 * removed prs and prs_fn hook, which was broken because it did not
5056 include \n in its semantics, forcing writeln to add one
5057 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
5058 string -> unit if you really want to output text without newline;
5060 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
5061 plain output, interface builders may have to enable 'isabelle_font'
5062 mode to get Isabelle font glyphs as before;
5064 * refined token_translation interface; INCOMPATIBILITY: output length
5065 now of type real instead of int;
5067 * theory loader actions may be traced via new ThyInfo.add_hook
5068 interface (see src/Pure/Thy/thy_info.ML); example application: keep
5069 your own database of information attached to *whole* theories -- as
5070 opposed to intra-theory data slots offered via TheoryDataFun;
5072 * proper handling of dangling sort hypotheses (at last!);
5073 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
5074 extra sort hypotheses that can be witnessed from the type signature;
5075 the force_strip_shyps flag is gone, any remaining shyps are simply
5076 left in the theorem (with a warning issued by strip_shyps_warning);
5080 New in Isabelle98-1 (October 1998)
5081 ----------------------------------
5083 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5085 * several changes of automated proof tools;
5087 * HOL: major changes to the inductive and datatype packages, including
5088 some minor incompatibilities of theory syntax;
5090 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
5093 * HOL: removed duplicate thms in Arith:
5094 less_imp_add_less should be replaced by trans_less_add1
5095 le_imp_add_le should be replaced by trans_le_add1
5097 * HOL: unary minus is now overloaded (new type constraints may be
5100 * HOL and ZF: unary minus for integers is now #- instead of #~. In
5101 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
5102 now taken as an integer constant.
5104 * Pure: ML function 'theory_of' renamed to 'theory';
5110 1. Asm_full_simp_tac is now more aggressive.
5111 1. It will sometimes reorient premises if that increases their power to
5113 2. It does no longer proceed strictly from left to right but may also
5114 rotate premises to achieve further simplification.
5115 For compatibility reasons there is now Asm_lr_simp_tac which is like the
5116 old Asm_full_simp_tac in that it does not rotate premises.
5117 2. The simplifier now knows a little bit about nat-arithmetic.
5119 * Classical reasoner: wrapper mechanism for the classical reasoner now
5120 allows for selected deletion of wrappers, by introduction of names for
5121 wrapper functionals. This implies that addbefore, addSbefore,
5122 addaltern, and addSaltern now take a pair (name, tactic) as argument,
5123 and that adding two tactics with the same name overwrites the first
5124 one (emitting a warning).
5125 type wrapper = (int -> tactic) -> (int -> tactic)
5126 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
5127 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
5128 delWrapper, delSWrapper: claset * string -> claset
5129 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
5131 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
5132 semantics; addbefore now affects only the unsafe part of step_tac
5133 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
5134 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
5137 * Classical reasoner: setwrapper to setWrapper and compwrapper to
5138 compWrapper; added safe wrapper (and access functions for it);
5140 * HOL/split_all_tac is now much faster and fails if there is nothing
5141 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
5142 and the names of the automatically generated variables have changed.
5143 split_all_tac has moved within claset() from unsafe wrappers to safe
5144 wrappers, which means that !!-bound variables are split much more
5145 aggressively, and safe_tac and clarify_tac now split such variables.
5146 If this splitting is not appropriate, use delSWrapper "split_all_tac".
5147 Note: the same holds for record_split_tac, which does the job of
5148 split_all_tac for record fields.
5150 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
5151 permanently to the default simpset using Addsplits just like
5152 Addsimps. They can be removed via Delsplits just like
5153 Delsimps. Lower-case versions are also available.
5155 * HOL/Simplifier: The rule split_if is now part of the default
5156 simpset. This means that the simplifier will eliminate all occurrences
5157 of if-then-else in the conclusion of a goal. To prevent this, you can
5158 either remove split_if completely from the default simpset by
5159 `Delsplits [split_if]' or remove it in a specific call of the
5160 simplifier using `... delsplits [split_if]'. You can also add/delete
5161 other case splitting rules to/from the default simpset: every datatype
5162 generates suitable rules `split_t_case' and `split_t_case_asm' (where
5163 t is the name of the datatype).
5165 * Classical reasoner / Simplifier combination: new force_tac (and
5166 derivatives Force_tac, force) combines rewriting and classical
5167 reasoning (and whatever other tools) similarly to auto_tac, but is
5168 aimed to solve the given subgoal completely.
5173 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
5174 and `goalw': the theory is no longer needed as an explicit argument -
5175 the current theory context is used; assumptions are no longer returned
5176 at the ML-level unless one of them starts with ==> or !!; it is
5177 recommended to convert to these new commands using isatool fixgoal
5178 (backup your sources first!);
5180 * new top-level commands 'thm' and 'thms' for retrieving theorems from
5181 the current theory context, and 'theory' to lookup stored theories;
5183 * new theory section 'locale' for declaring constants, assumptions and
5184 definitions that have local scope;
5186 * new theory section 'nonterminals' for purely syntactic types;
5188 * new theory section 'setup' for generic ML setup functions
5189 (e.g. package initialization);
5191 * the distribution now includes Isabelle icons: see
5192 lib/logo/isabelle-{small,tiny}.xpm;
5194 * isatool install - install binaries with absolute references to
5197 * isatool logo -- create instances of the Isabelle logo (as EPS);
5199 * print mode 'emacs' reserved for Isamode;
5201 * support multiple print (ast) translations per constant name;
5203 * theorems involving oracles are now printed with a suffixed [!];
5208 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
5210 * HOL/inductive package reorganized and improved: now supports mutual
5216 oddI "n : EVEN ==> Suc n : ODD"
5217 evenI "n : ODD ==> Suc n : EVEN"
5219 new theorem list "elims" contains an elimination rule for each of the
5220 recursive sets; inductive definitions now handle disjunctive premises
5221 correctly (also ZF);
5223 INCOMPATIBILITIES: requires Inductive as an ancestor; component
5224 "mutual_induct" no longer exists - the induction rule is always
5225 contained in "induct";
5228 * HOL/datatype package re-implemented and greatly improved: now
5229 supports mutually recursive datatypes such as
5232 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
5233 | SUM ('a aexp) ('a aexp)
5234 | DIFF ('a aexp) ('a aexp)
5237 'a bexp = LESS ('a aexp) ('a aexp)
5238 | AND ('a bexp) ('a bexp)
5239 | OR ('a bexp) ('a bexp)
5241 as well as indirectly recursive datatypes such as
5244 ('a, 'b) term = Var 'a
5245 | App 'b ((('a, 'b) term) list)
5247 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
5248 induction on mutually / indirectly recursive datatypes.
5250 Primrec equations are now stored in theory and can be accessed via
5251 <function_name>.simps.
5255 - Theories using datatypes must now have theory Datatype as an
5257 - The specific <typename>.induct_tac no longer exists - use the
5258 generic induct_tac instead.
5259 - natE has been renamed to nat.exhaust - use exhaust_tac
5260 instead of res_inst_tac ... natE. Note that the variable
5261 names in nat.exhaust differ from the names in natE, this
5262 may cause some "fragile" proofs to fail.
5263 - The theorems split_<typename>_case and split_<typename>_case_asm
5264 have been renamed to <typename>.split and <typename>.split_asm.
5265 - Since default sorts of type variables are now handled correctly,
5266 some datatype definitions may have to be annotated with explicit
5268 - Primrec definitions no longer require function name and type
5269 of recursive argument.
5271 Consider using isatool fixdatatype to adapt your theories and proof
5272 scripts to the new package (backup your sources first!).
5275 * HOL/record package: considerably improved implementation; now
5276 includes concrete syntax for record types, terms, updates; theorems
5277 for surjective pairing and splitting !!-bound record variables; proof
5278 support is as follows:
5280 1) standard conversions (selectors or updates applied to record
5281 constructor terms) are part of the standard simpset;
5283 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
5284 made part of standard simpset and claset via addIffs;
5286 3) a tactic for record field splitting (record_split_tac) is part of
5287 the standard claset (addSWrapper);
5289 To get a better idea about these rules you may retrieve them via
5290 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
5291 the name of your record type.
5293 The split tactic 3) conceptually simplifies by the following rule:
5295 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
5297 Thus any record variable that is bound by meta-all will automatically
5298 blow up into some record constructor term, consequently the
5299 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
5300 solve record problems automatically.
5303 * reorganized the main HOL image: HOL/Integ and String loaded by
5304 default; theory Main includes everything;
5306 * automatic simplification of integer sums and comparisons, using cancellation;
5308 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
5310 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
5312 * many new identities for unions, intersections, set difference, etc.;
5314 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
5315 called split_if, split_split, split_sum_case and split_nat_case (to go
5316 with add/delsplits);
5318 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
5319 (?x::unit) = (); this is made part of the default simpset, which COULD
5320 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
5321 'Delsimprocs [unit_eq_proc];' as last resort); also note that
5322 unit_abs_eta_conv is added in order to counter the effect of
5323 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
5326 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
5329 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5330 It and 'sym RS equals0D' are now in the default claset, giving automatic
5331 disjointness reasoning but breaking a few old proofs.
5333 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
5334 to 'converse' from 'inverse' (for compatibility with ZF and some
5337 * HOL/recdef can now declare non-recursive functions, with {} supplied as
5338 the well-founded relation;
5340 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
5341 Compl A. The "Compl" syntax remains available as input syntax for this
5344 * HOL/Update: new theory of function updates:
5345 f(a:=b) == %x. if x=a then b else f x
5346 may also be iterated as in f(a:=b,c:=d,...);
5348 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
5351 - new function list_update written xs[i:=v] that updates the i-th
5352 list position. May also be iterated as in xs[i:=a,j:=b,...].
5353 - new function `upt' written [i..j(] which generates the list
5354 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
5355 bound write [i..j], which is a shorthand for [i..j+1(].
5356 - new lexicographic orderings and corresponding wellfoundedness theorems.
5359 - removed 'pred' (predecessor) function;
5360 - generalized some theorems about n-1;
5361 - many new laws about "div" and "mod";
5362 - new laws about greatest common divisors (see theory ex/Primes);
5364 * HOL/Relation: renamed the relational operator r^-1 "converse"
5365 instead of "inverse";
5367 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
5368 of the multiset ordering;
5370 * directory HOL/Real: a construction of the reals using Dedekind cuts
5371 (not included by default);
5373 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
5375 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
5376 programs, i.e. different program variables may have different types.
5378 * calling (stac rew i) now fails if "rew" has no effect on the goal
5379 [previously, this check worked only if the rewrite rule was unconditional]
5380 Now rew can involve either definitions or equalities (either == or =).
5385 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
5386 only the theorems proved on ZF.ML;
5388 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5389 It and 'sym RS equals0D' are now in the default claset, giving automatic
5390 disjointness reasoning but breaking a few old proofs.
5392 * ZF/Update: new theory of function updates
5393 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
5394 may also be iterated as in f(a:=b,c:=d,...);
5396 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
5398 * calling (stac rew i) now fails if "rew" has no effect on the goal
5399 [previously, this check worked only if the rewrite rule was unconditional]
5400 Now rew can involve either definitions or equalities (either == or =).
5402 * case_tac provided for compatibility with HOL
5403 (like the old excluded_middle_tac, but with subgoals swapped)
5406 *** Internal programming interfaces ***
5408 * Pure: several new basic modules made available for general use, see
5409 also src/Pure/README;
5411 * improved the theory data mechanism to support encapsulation (data
5412 kind name replaced by private Object.kind, acting as authorization
5413 key); new type-safe user interface via functor TheoryDataFun; generic
5414 print_data function becomes basically useless;
5416 * removed global_names compatibility flag -- all theory declarations
5417 are qualified by default;
5419 * module Pure/Syntax now offers quote / antiquote translation
5420 functions (useful for Hoare logic etc. with implicit dependencies);
5421 see HOL/ex/Antiquote for an example use;
5423 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
5426 * new tactical CHANGED_GOAL for checking that a tactic modifies a
5429 * Display.print_goals function moved to Locale.print_goals;
5431 * standard print function for goals supports current_goals_markers
5432 variable for marking begin of proof, end of proof, start of goal; the
5433 default is ("", "", ""); setting current_goals_markers := ("<proof>",
5434 "</proof>", "<goal>") causes SGML like tagged proof state printing,
5439 New in Isabelle98 (January 1998)
5440 --------------------------------
5442 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5444 * changed lexical syntax of terms / types: dots made part of long
5445 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
5447 * simpset (and claset) reference variable replaced by functions
5448 simpset / simpset_ref;
5450 * no longer supports theory aliases (via merge) and non-trivial
5451 implicit merge of thms' signatures;
5453 * most internal names of constants changed due to qualified names;
5455 * changed Pure/Sequence interface (see Pure/seq.ML);
5458 *** General Changes ***
5460 * hierachically structured name spaces (for consts, types, axms, thms
5461 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
5462 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
5463 isatool fixdots ensures space after dots (e.g. "%x. x"); set
5464 long_names for fully qualified output names; NOTE: ML programs
5465 (special tactics, packages etc.) referring to internal names may have
5466 to be adapted to cope with fully qualified names; in case of severe
5467 backward campatibility problems try setting 'global_names' at compile
5468 time to have enrything declared within a flat name space; one may also
5469 fine tune name declarations in theories via the 'global' and 'local'
5472 * reimplemented the implicit simpset and claset using the new anytype
5473 data filed in signatures; references simpset:simpset ref etc. are
5474 replaced by functions simpset:unit->simpset and
5475 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
5476 to patch your ML files accordingly;
5478 * HTML output now includes theory graph data for display with Java
5479 applet or isatool browser; data generated automatically via isatool
5480 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
5482 * defs may now be conditional; improved rewrite_goals_tac to handle
5483 conditional equations;
5485 * defs now admits additional type arguments, using TYPE('a) syntax;
5487 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
5488 creates a new theory node; implicit merge of thms' signatures is
5489 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
5490 transfer:theory->thm->thm in (rare) cases;
5492 * improved handling of draft signatures / theories; draft thms (and
5493 ctyps, cterms) are automatically promoted to real ones;
5495 * slightly changed interfaces for oracles: admit many per theory, named
5496 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
5498 * print_goals: optional output of const types (set show_consts and
5501 * improved output of warnings (###) and errors (***);
5503 * subgoal_tac displays a warning if the new subgoal has type variables;
5505 * removed old README and Makefiles;
5507 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
5509 * removed obsolete init_pps and init_database;
5511 * deleted the obsolete tactical STATE, which was declared by
5512 fun STATE tacfun st = tacfun st st;
5514 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
5515 (which abbreviates $HOME);
5517 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
5518 use isatool fixseq to adapt your ML programs (this works for fully
5519 qualified references to the Sequence structure only!);
5521 * use_thy no longer requires writable current directory; it always
5522 reloads .ML *and* .thy file, if either one is out of date;
5525 *** Classical Reasoner ***
5527 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
5528 tactics that use classical reasoning to simplify a subgoal without
5529 splitting it into several subgoals;
5531 * Safe_tac: like safe_tac but uses the default claset;
5536 * added simplification meta rules:
5537 (asm_)(full_)simplify: simpset -> thm -> thm;
5539 * simplifier.ML no longer part of Pure -- has to be loaded by object
5542 * added prems argument to simplification procedures;
5544 * HOL, FOL, ZF: added infix function `addsplits':
5545 instead of `<simpset> setloop (split_tac <thms>)'
5546 you can simply write `<simpset> addsplits <thms>'
5551 * TYPE('a) syntax for type reflection terms;
5553 * no longer handles consts with name "" -- declare as 'syntax' instead;
5555 * pretty printer: changed order of mixfix annotation preference (again!);
5557 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
5562 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
5563 with `addloop' of the simplifier to faciliate case splitting in premises.
5565 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
5567 * HOL/Auth: new protocol proofs including some for the Internet
5570 * HOL/Map: new theory of `maps' a la VDM;
5572 * HOL/simplifier: simplification procedures nat_cancel_sums for
5573 cancelling out common nat summands from =, <, <= (in)equalities, or
5574 differences; simplification procedures nat_cancel_factor for
5575 cancelling common factor from =, <, <= (in)equalities over natural
5576 sums; nat_cancel contains both kinds of procedures, it is installed by
5577 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
5579 * HOL/simplifier: terms of the form
5580 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
5582 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
5583 and those of the form
5584 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
5586 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
5589 Each datatype `t' now comes with a theorem `split_t_case' of the form
5591 P(t_case f1 ... fn x) =
5592 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
5594 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
5597 and a theorem `split_t_case_asm' of the form
5599 P(t_case f1 ... fn x) =
5600 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
5602 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
5604 which can be added to a simpset via `addsplits'. The existing theorems
5605 expand_list_case and expand_option_case have been renamed to
5606 split_list_case and split_option_case.
5609 - `pred n' is automatically converted to `n-1'.
5610 Users are strongly encouraged not to use `pred' any longer,
5611 because it will disappear altogether at some point.
5612 - Users are strongly encouraged to write "0 < n" rather than
5613 "n ~= 0". Theorems and proof tools have been modified towards this
5617 the function "set_of_list" has been renamed "set" (and its theorems too);
5618 the function "nth" now takes its arguments in the reverse order and
5619 has acquired the infix notation "!" as in "xs!n".
5621 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
5623 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
5624 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
5626 * HOL/record: extensible records with schematic structural subtyping
5627 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
5628 still lacks various theorems and concrete record syntax;
5633 * removed "axioms" and "generated by" sections;
5635 * replaced "ops" section by extended "consts" section, which is capable of
5636 handling the continuous function space "->" directly;
5639 . proves theorems immediately and stores them in the theory,
5640 . creates hierachical name space,
5641 . now uses normal mixfix annotations (instead of cinfix...),
5642 . minor changes to some names and values (for consistency),
5643 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
5644 . separator between mutual domain defs: changed "," to "and",
5645 . improved handling of sort constraints; now they have to
5646 appear on the left-hand side of the equations only;
5648 * fixed LAM <x,y,zs>.b syntax;
5650 * added extended adm_tac to simplifier in HOLCF -- can now discharge
5651 adm (%x. P (t x)), where P is chainfinite and t continuous;
5656 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
5657 with `addloop' of the simplifier to faciliate case splitting in premises.
5659 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
5660 in HOL, they strip ALL and --> from proved theorems;
5664 New in Isabelle94-8 (May 1997)
5665 ------------------------------
5667 *** General Changes ***
5669 * new utilities to build / run / maintain Isabelle etc. (in parts
5670 still somewhat experimental); old Makefiles etc. still functional;
5672 * new 'Isabelle System Manual';
5674 * INSTALL text, together with ./configure and ./build scripts;
5676 * reimplemented type inference for greater efficiency, better error
5677 messages and clean internal interface;
5679 * prlim command for dealing with lots of subgoals (an easier way of
5680 setting goals_limit);
5685 * supports alternative (named) syntax tables (parser and pretty
5686 printer); internal interface is provided by add_modesyntax(_i);
5688 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
5689 be used in conjunction with the Isabelle symbol font; uses the
5690 "symbols" syntax table;
5692 * added token_translation interface (may translate name tokens in
5693 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
5694 the current print_mode); IMPORTANT: user print translation functions
5695 are responsible for marking newly introduced bounds
5696 (Syntax.mark_boundT);
5698 * token translations for modes "xterm" and "xterm_color" that display
5699 names in bold, underline etc. or colors (which requires a color
5702 * infixes may now be declared with names independent of their syntax;
5704 * added typed_print_translation (like print_translation, but may
5705 access type of constant);
5708 *** Classical Reasoner ***
5710 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
5711 some limitations. Blast_tac...
5712 + ignores addss, addbefore, addafter; this restriction is intrinsic
5713 + ignores elimination rules that don't have the correct format
5714 (the conclusion MUST be a formula variable)
5715 + ignores types, which can make HOL proofs fail
5716 + rules must not require higher-order unification, e.g. apply_type in ZF
5717 [message "Function Var's argument not a bound variable" relates to this]
5718 + its proof strategy is more general but can actually be slower
5720 * substitution with equality assumptions no longer permutes other
5723 * minor changes in semantics of addafter (now called addaltern); renamed
5724 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
5725 (and access functions for it);
5727 * improved combination of classical reasoner and simplifier:
5728 + functions for handling clasimpsets
5729 + improvement of addss: now the simplifier is called _after_ the
5731 + safe variant of addss called addSss: uses safe simplifications
5732 _during_ the safe steps. It is more complete as it allows multiple
5733 instantiations of unknowns (e.g. with slow_tac).
5737 * added interface for simplification procedures (functions that
5738 produce *proven* rewrite rules on the fly, depending on current
5741 * ordering on terms as parameter (used for ordered rewriting);
5743 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
5745 * the solver is now split into a safe and an unsafe part.
5746 This should be invisible for the normal user, except that the
5747 functions setsolver and addsolver have been renamed to setSolver and
5748 addSolver; added safe_asm_full_simp_tac;
5753 * a generic induction tactic `induct_tac' which works for all datatypes and
5754 also for type `nat';
5756 * a generic case distinction tactic `exhaust_tac' which works for all
5757 datatypes and also for type `nat';
5759 * each datatype comes with a function `size';
5761 * patterns in case expressions allow tuple patterns as arguments to
5762 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
5764 * primrec now also works with type nat;
5766 * recdef: a new declaration form, allows general recursive functions to be
5767 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
5769 * the constant for negation has been renamed from "not" to "Not" to
5770 harmonize with FOL, ZF, LK, etc.;
5772 * HOL/ex/LFilter theory of a corecursive "filter" functional for
5775 * HOL/Modelcheck demonstrates invocation of model checker oracle;
5777 * HOL/ex/Ring.thy declares cring_simp, which solves equational
5778 problems in commutative rings, using axiomatic type classes for + and *;
5780 * more examples in HOL/MiniML and HOL/Auth;
5782 * more default rewrite rules for quantifiers, union/intersection;
5784 * a new constant `arbitrary == @x.False';
5786 * HOLCF/IOA replaces old HOL/IOA;
5788 * HOLCF changes: derived all rules and arities
5789 + axiomatic type classes instead of classes
5790 + typedef instead of faking type definitions
5791 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
5792 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
5793 + eliminated the types void, one, tr
5794 + use unit lift and bool lift (with translations) instead of one and tr
5795 + eliminated blift from Lift3.thy (use Def instead of blift)
5796 all eliminated rules are derived as theorems --> no visible changes ;
5801 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
5802 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
5803 as ZF_cs addSIs [equalityI];
5807 New in Isabelle94-7 (November 96)
5808 ---------------------------------
5810 * allowing negative levels (as offsets) in prlev and choplev;
5812 * super-linear speedup for large simplifications;
5814 * FOL, ZF and HOL now use miniscoping: rewriting pushes
5815 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
5816 FAIL); can suppress it using the command Delsimps (ex_simps @
5817 all_simps); De Morgan laws are also now included, by default;
5819 * improved printing of ==> : ~:
5821 * new object-logic "Sequents" adds linear logic, while replacing LK
5822 and Modal (thanks to Sara Kalvala);
5824 * HOL/Auth: correctness proofs for authentication protocols;
5826 * HOL: new auto_tac combines rewriting and classical reasoning (many
5827 examples on HOL/Auth);
5829 * HOL: new command AddIffs for declaring theorems of the form P=Q to
5830 the rewriter and classical reasoner simultaneously;
5832 * function uresult no longer returns theorems in "standard" format;
5833 regain previous version by: val uresult = standard o uresult;
5840 * oracles -- these establish an interface between Isabelle and trusted
5841 external reasoners, which may deliver results as theorems;
5843 * proof objects (in particular record all uses of oracles);
5845 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
5847 * "constdefs" section in theory files;
5849 * "primrec" section (HOL) no longer requires names;
5851 * internal type "tactic" now simply "thm -> thm Sequence.seq";
5858 * reduced space requirements;
5860 * automatic HTML generation from theories;
5862 * theory files no longer require "..." (quotes) around most types;
5864 * new examples, including two proofs of the Church-Rosser theorem;
5866 * non-curried (1994) version of HOL is no longer distributed;
5873 * greatly reduced space requirements;
5875 * theory files (.thy) no longer require \...\ escapes at line breaks;
5877 * searchable theorem database (see the section "Retrieving theorems" on
5878 page 8 of the Reference Manual);
5880 * new examples, including Grabczewski's monumental case study of the
5883 * The previous version of HOL renamed to Old_HOL;
5885 * The new version of HOL (previously called CHOL) uses a curried syntax
5886 for functions. Application looks like f a b instead of f(a,b);
5888 * Mutually recursive inductive definitions finally work in HOL;
5890 * In ZF, pattern-matching on tuples is now available in all abstractions and
5891 translates to the operator "split";
5898 * new infix operator, addss, allowing the classical reasoner to
5899 perform simplification at each step of its search. Example:
5900 fast_tac (cs addss ss)
5902 * a new logic, CHOL, the same as HOL, but with a curried syntax
5903 for functions. Application looks like f a b instead of f(a,b). Also pairs
5904 look like (a,b) instead of <a,b>;
5906 * PLEASE NOTE: CHOL will eventually replace HOL!
5908 * In CHOL, pattern-matching on tuples is now available in all abstractions.
5909 It translates to the operator "split". A new theory of integers is available;
5911 * In ZF, integer numerals now denote two's-complement binary integers.
5912 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
5914 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
5915 of the Axiom of Choice;
5922 * Significantly faster resolution;
5924 * the different sections in a .thy file can now be mixed and repeated
5927 * Database of theorems for FOL, HOL and ZF. New
5928 commands including qed, qed_goal and bind_thm store theorems in the database.
5930 * Simple database queries: return a named theorem (get_thm) or all theorems of
5931 a given theory (thms_of), or find out what theory a theorem was proved in
5934 * Bugs fixed in the inductive definition and datatype packages;
5936 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
5937 and HOL_dup_cs obsolete;
5939 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
5942 * Simpler definition of function space in ZF;
5944 * new results about cardinal and ordinal arithmetic in ZF;
5946 * 'subtype' facility in HOL for introducing new types as subsets of existing
5949 :mode=text:wrap=hard:maxLineLen=72: