Instead of giving up entirely, arith now ignores all inequalities when there are too many.
1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * The main reference manuals (isar-ref, implementation, system) have
10 been updated and extended. Formally checked references as hyperlinks
11 are now available in uniform manner.
13 * Simplified main Isabelle executables, with less surprises on
14 case-insensitive file-systems (such as Mac OS).
16 - The main Isabelle tool wrapper is now called "isabelle" instead of
19 - The former "isabelle" alias for "isabelle-process" has been
20 removed (should rarely occur to regular users).
22 - The former "isabelle-interface" and its alias "Isabelle" have been
23 removed (interfaces are now regular Isabelle tools).
25 Within scripts and make files, the Isabelle environment variables
26 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
27 respectively. (The latter are still available as legacy feature.)
29 The old isabelle-interface wrapper could react in confusing ways if
30 the interface was uninstalled or changed otherwise. Individual
31 interface tool configuration is now more explicit, see also the
32 Isabelle system manual. In particular, Proof General is now available
35 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
36 purge installed copies of Isabelle executables and re-run "isabelle
37 install -p ...", or use symlinks.
39 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
40 old ~/isabelle, which was slightly non-standard and apt cause
41 surprises on case-insensitive file-systems.
43 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
44 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
45 care is required when using older releases of Isabelle. Note that
46 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
47 Isabelle distribution.
49 * Proofs of fully specified statements are run in parallel on
50 multi-core systems. A speedup factor of 2-3 can be expected on a
51 regular 4-core machine, if the initial heap space is made reasonably
52 large (cf. Poly/ML option -H). [Poly/ML 5.2.1 or later]
54 * Generalized Isar history, with support for linear undo, direct state
57 * Recovered hiding of consts, which was accidentally broken in
58 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
59 makes c inaccessible; consider using ``hide (open) const c'' instead.
61 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
64 * There is a new syntactic category "float_const" for signed decimal
65 fractions (e.g. 123.45 or -123.45).
67 * New prover for coherent logic (see src/Tools/coherent.ML).
72 * Class declaration: sc. "base sort" must not be given in import list
73 any longer but is inferred from the specification. Particularly in HOL,
76 class foo = ... instead of class foo = type + ...
78 * Module moves in repository:
79 src/Pure/Tools/value.ML ~> src/Tools/
80 src/Pure/Tools/quickcheck.ML ~> src/Tools/
82 * Slightly more coherent Pure syntax, with updated documentation in
83 isar-ref manual. Removed locales meta_term_syntax and
84 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
85 INCOMPATIBILITY in rare situations.
87 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
88 hypotheses. Sorts required in the course of reasoning need to be
89 covered by the constraints in the initial statement, completed by the
90 type instance information of the background theory. Non-trivial sort
91 hypotheses, which rarely occur in practice, may be specified via
92 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
94 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
96 The result contains an implicit sort hypotheses as before --
97 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
100 * Changed defaults for unify configuration options:
102 unify_trace_bound = 50 (formerly 25)
103 unify_search_bound = 60 (formerly 30)
105 * Different bookkeeping for code equations (INCOMPATIBILITY):
107 a) On theory merge, the last set of code equations for a particular
108 constant is taken (in accordance with the policy applied by other
109 parts of the code generator framework).
111 b) Code equations stemming from explicit declarations (e.g. code
112 attribute) gain priority over default code equations stemming
113 from definition, primrec, fun etc.
115 * Global versions of theorems stemming from classes do not carry a
116 parameter prefix any longer. INCOMPATIBILITY.
118 * Dropped locale element "includes". This is a major INCOMPATIBILITY.
119 In existing theorem specifications replace the includes element by the
120 respective context elements of the included locale, omitting those
121 that are already present in the theorem specification. Multiple
122 assume elements of a locale should be replaced by a single one
123 involving the locale predicate. In the proof body, declarations (most
124 notably theorems) may be regained by interpreting the respective
125 locales in the proof context as required (command "interpret").
127 If using "includes" in replacement of a target solely because the
128 parameter types in the theorem are not as general as in the target,
129 consider declaring a new locale with additional type constraints on
130 the parameters (context element "constrains").
132 * Dropped "locale (open)". INCOMPATIBILITY.
134 * Interpretation commands no longer attempt to simplify goal.
135 INCOMPATIBILITY: in rare situations the generated goal differs. Use
136 methods intro_locales and unfold_locales to clarify.
138 * Interpretation commands no longer accept interpretation attributes.
141 * Complete re-implementation of locales. INCOMPATIBILITY. The most
142 important changes are listed below. See documentation (forthcoming)
143 and tutorial (also forthcoming) for details.
145 - In locale expressions, instantiation replaces renaming. Parameters
146 must be declared in a for clause. To aid compatibility with previous
147 parameter inheritance, in locale declarations, parameters that are not
148 'touched' (instantiation position "_" or omitted) are implicitly added
149 with their syntax at the beginning of the for clause.
151 - Syntax from abbreviations and definitions in locales is available in
152 locale expressions and context elements. The latter is particularly
153 useful in locale declarations.
155 - More flexible mechanisms to qualify names generated by locale
156 expressions. Qualifiers (prefixes) may be specified in locale
157 expressions. Available are normal qualifiers (syntax "name:") and
158 strict qualifiers (syntax "name!:"). The latter must occur in name
159 references and are useful to avoid accidental hiding of names, the
160 former are optional. Qualifiers derived from the parameter names of a
161 locale are no longer generated.
163 - "sublocale l < e" replaces "interpretation l < e". The
164 instantiation clause in "interpretation" and "interpret" (square
165 brackets) is no longer available. Use locale expressions.
167 - When converting proof scripts, be sure to replace qualifiers in
168 "interpretation" and "interpret" by strict qualifiers. Qualifiers in
169 locale expressions range over a single locale instance only.
171 * Command 'instance': attached definitions no longer accepted.
172 INCOMPATIBILITY, use proper 'instantiation' target.
174 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
176 * The 'axiomatization' command now only works within a global theory
177 context. INCOMPATIBILITY.
179 * New find_theorems criterion "solves" matching theorems that directly
180 solve the current goal. Try "find_theorems solves".
182 * Added an auto solve option, which can be enabled through the
183 ProofGeneral Isabelle settings menu (disabled by default).
185 When enabled, find_theorems solves is called whenever a new lemma is
186 stated. Any theorems that could solve the lemma directly are listed
189 * New command find_consts searches for constants based on type and
192 find_consts "_ => bool"
194 By default, matching is against subtypes, but it may be restricted to
195 the whole type. Searching by name is possible. Multiple queries are
196 conjunctive and queries may be negated by prefixing them with a
199 find_consts strict: "_ => bool" name: "Int" -"int => int"
201 * Linear arithmetic now ignores all inequalities when fast_arith_neq_limit
202 is exceeded, instead of giving up entirely.
205 *** Document preparation ***
207 * Antiquotation @{lemma} now imitates a regular terminal proof,
208 demanding keyword 'by' and supporting the full method expression
209 syntax just like the Isar command 'by'.
214 * Theory Library/Diagonalize.thy provides constructive version of
215 Cantor's first diagonalization argument.
217 * New predicate "strict_mono" classifies strict functions on partial orders.
218 With strict functions on linear orders, reasoning about (in)equalities is
219 facilitated by theorems "strict_mono_eq", "strict_mono_less_eq" and "strict_mono_less".
221 * Some set operations are now proper qualified constants with authentic syntax.
233 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in theory
236 * Auxiliary class "itself" has disappeared -- classes without any parameter
237 are treated as expected by the 'class' command.
239 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
241 * Common decision procedures (Cooper, MIR, Ferrack, Approximation, Dense_Linear_Order)
242 now in directory HOL/Decision_Procs.
244 * Theory HOL/Decisioin_Procs/Approximation.thy provides the new proof method
245 "approximation". It proves formulas on real values by using interval arithmetic.
246 In the formulas are also the transcendental functions sin, cos, tan, atan, ln,
247 exp and the constant pi are allowed. For examples see HOL/ex/ApproximationEx.thy.
249 * Theory "Reflection" now resides in HOL/Library.
251 * Entry point to Word library now simply named "Word". INCOMPATIBILITY.
253 * Made source layout more coherent with logical distribution
256 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
257 src/HOL/Library/Code_Message.thy ~> src/HOL/
258 src/HOL/Library/GCD.thy ~> src/HOL/
259 src/HOL/Library/Order_Relation.thy ~> src/HOL/
260 src/HOL/Library/Parity.thy ~> src/HOL/
261 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
262 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
263 src/HOL/Real/Lubs.thy ~> src/HOL/
264 src/HOL/Real/PReal.thy ~> src/HOL/
265 src/HOL/Real/Rational.thy ~> src/HOL/
266 src/HOL/Real/RComplete.thy ~> src/HOL/
267 src/HOL/Real/RealDef.thy ~> src/HOL/
268 src/HOL/Real/RealPow.thy ~> src/HOL/
269 src/HOL/Real/Real.thy ~> src/HOL/
270 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
271 src/HOL/Complex/Complex.thy ~> src/HOL/
272 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
273 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
274 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
275 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
276 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
277 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
278 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
279 src/HOL/Hyperreal/Log.thy ~> src/HOL/
280 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
281 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
282 src/HOL/Hyperreal/Series.thy ~> src/HOL/
283 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
284 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
285 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
286 src/HOL/Real/Float ~> src/HOL/Library/
287 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
288 src/HOL/Real/RealVector.thy ~> src/HOL/
290 src/HOL/arith_data.ML ~> src/HOL/Tools
291 src/HOL/hologic.ML ~> src/HOL/Tools
292 src/HOL/simpdata.ML ~> src/HOL/Tools
293 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
294 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
295 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
296 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
297 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
298 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
299 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
301 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
302 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
303 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
304 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
305 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
306 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
308 * If methods "eval" and "evaluation" encounter a structured proof state
309 with !!/==>, only the conclusion is evaluated to True (if possible),
310 avoiding strange error messages.
312 * Simplifier: simproc for let expressions now unfolds if bound variable
313 occurs at most once in let expression body. INCOMPATIBILITY.
315 * New classes "top" and "bot" with corresponding operations "top" and "bot"
316 in theory Orderings; instantiation of class "complete_lattice" requires
317 instantiation of classes "top" and "bot". INCOMPATIBILITY.
319 * Changed definition lemma "less_fun_def" in order to provide an instance
320 for preorders on functions; use lemma "less_le" instead. INCOMPATIBILITY.
322 * Unified theorem tables for both code code generators. Thus
323 [code func] has disappeared and only [code] remains. INCOMPATIBILITY.
325 * Constants "undefined" and "default" replace "arbitrary". Usually
326 "undefined" is the right choice to replace "arbitrary", though logically
327 there is no difference. INCOMPATIBILITY.
329 * Generic ATP manager for Sledgehammer, based on ML threads instead of
330 Posix processes. Avoids potentially expensive forking of the ML
331 process. New thread-based implementation also works on non-Unix
332 platforms (Cygwin). Provers are no longer hardwired, but defined
333 within the theory via plain ML wrapper functions. Basic Sledgehammer
334 commands are covered in the isar-ref manual.
336 * Wrapper scripts for remote SystemOnTPTP service allows to use
337 sledgehammer without local ATP installation (Vampire etc.). See also
338 ISABELLE_HOME/contrib/SystemOnTPTP and the VAMPIRE_HOME setting
339 variable. Other provers may be included via suitable ML wrappers, see
340 also src/HOL/ATP_Linkup.thy.
342 * Normalization by evaluation now allows non-leftlinear equations.
343 Declare with attribute [code nbe].
345 * Command "value" now integrates different evaluation
346 mechanisms. The result of the first successful evaluation mechanism
347 is printed. In square brackets a particular named evaluation
348 mechanisms may be specified (currently, [SML], [code] or [nbe]). See
349 further src/HOL/ex/Eval_Examples.thy.
351 * New method "sizechange" to automate termination proofs using (a
352 modification of) the size-change principle. Requires SAT solver. See
353 src/HOL/ex/Termination.thy for examples.
355 * HOL/Orderings: class "wellorder" moved here, with explicit induction
356 rule "less_induct" as assumption. For instantiation of "wellorder" by
357 means of predicate "wf", use rule wf_wellorderI. INCOMPATIBILITY.
359 * HOL/Orderings: added class "preorder" as superclass of "order".
360 INCOMPATIBILITY: Instantiation proofs for order, linorder
361 etc. slightly changed. Some theorems named order_class.* now named
365 Renamed "refl" to "refl_on", "reflexive" to "refl, "diag" to "Id_on".
367 * HOL/Finite_Set: added a new fold combinator of type
368 ('a => 'b => 'b) => 'b => 'a set => 'b
369 Occasionally this is more convenient than the old fold combinator which is
370 now defined in terms of the new one and renamed to fold_image.
372 * HOL/Ring_and_Field and HOL/OrderedGroup: The lemmas "group_simps" and
373 "ring_simps" have been replaced by "algebra_simps" (which can be extended with
374 further lemmas!). At the moment both still exist but the former will disappear
377 * HOL/Power: Lemma power_Suc is now declared as a simp rule in class
378 recpower. Type-specific simp rules for various recpower types have
379 been removed. INCOMPATIBILITY. Rename old lemmas as follows:
381 rat_power_0 -> power_0
382 rat_power_Suc -> power_Suc
384 realpow_Suc -> power_Suc
385 complexpow_0 -> power_0
386 complexpow_Suc -> power_Suc
387 power_poly_0 -> power_0
388 power_poly_Suc -> power_Suc
390 * HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been
391 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
392 dvd has been generalized to class comm_semiring_1. Likewise a bunch
393 of lemmas from Divides has been generalized from nat to class
394 semiring_div. INCOMPATIBILITY. This involves the following theorem
395 renames resulting from duplicate elimination:
397 dvd_def_mod ~> dvd_eq_mod_eq_0
398 zero_dvd_iff ~> dvd_0_left_iff
400 DIVISION_BY_ZERO_DIV ~> div_by_0
401 DIVISION_BY_ZERO_MOD ~> mod_by_0
402 mult_div ~> div_mult_self2_is_id
403 mult_mod ~> mod_mult_self2_is_0
405 * HOL/IntDiv: removed many lemmas that are instances of class-based
406 generalizations (from Divides and Ring_and_Field).
407 INCOMPATIBILITY. Rename old lemmas as follows:
409 dvd_diff -> nat_dvd_diff
410 dvd_zminus_iff -> dvd_minus_iff
411 mod_add1_eq -> mod_add_eq
412 mod_mult1_eq -> mod_mult_right_eq
413 mod_mult1_eq' -> mod_mult_left_eq
414 mod_mult_distrib_mod -> mod_mult_eq
415 nat_mod_add_left_eq -> mod_add_left_eq
416 nat_mod_add_right_eq -> mod_add_right_eq
417 nat_mod_div_trivial -> mod_div_trivial
418 nat_mod_mod_trivial -> mod_mod_trivial
419 zdiv_zadd_self1 -> div_add_self1
420 zdiv_zadd_self2 -> div_add_self2
421 zdiv_zmult_self1 -> div_mult_self2_is_id
422 zdiv_zmult_self2 -> div_mult_self1_is_id
423 zdvd_triv_left -> dvd_triv_left
424 zdvd_triv_right -> dvd_triv_right
425 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
426 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
427 zmod_zadd_left_eq -> mod_add_left_eq
428 zmod_zadd_right_eq -> mod_add_right_eq
429 zmod_zadd_self1 -> mod_add_self1
430 zmod_zadd_self2 -> mod_add_self2
431 zmod_zadd1_eq -> mod_add_eq
432 zmod_zdiff1_eq -> mod_diff_eq
433 zmod_zdvd_zmod -> mod_mod_cancel
434 zmod_zmod_cancel -> mod_mod_cancel
435 zmod_zmult_self1 -> mod_mult_self2_is_0
436 zmod_zmult_self2 -> mod_mult_self1_is_0
439 zdvd_abs1 -> abs_dvd_iff
440 zdvd_abs2 -> dvd_abs_iff
441 zdvd_refl -> dvd_refl
442 zdvd_trans -> dvd_trans
444 zdvd_zdiff -> dvd_diff
445 zdvd_zminus_iff -> dvd_minus_iff
446 zdvd_zminus2_iff -> minus_dvd_iff
447 zdvd_zmultD -> dvd_mult_right
448 zdvd_zmultD2 -> dvd_mult_left
449 zdvd_zmult_mono -> mult_dvd_mono
450 zdvd_0_right -> dvd_0_right
451 zdvd_0_left -> dvd_0_left_iff
452 zdvd_1_left -> one_dvd
453 zminus_dvd_iff -> minus_dvd_iff
455 * HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
456 zlcm (for int); carried together from various gcd/lcm developements in
457 the HOL Distribution. zgcd and zlcm replace former igcd and ilcm;
458 corresponding theorems renamed accordingly. INCOMPATIBILITY. To
459 recover tupled syntax, use syntax declarations like:
461 hide (open) const gcd
462 abbreviation gcd where
463 "gcd == (%(a, b). GCD.gcd a b)"
465 GCD.gcd ("gcd '(_, _')")
467 (analogously for lcm, zgcd, zlcm).
469 * HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
471 * The real numbers offer decimal input syntax: 12.34 is translated into
472 1234/10^2. This translation is not reversed upon output.
474 * New ML antiquotation @{code}: takes constant as argument, generates
475 corresponding code in background and inserts name of the corresponding
476 resulting ML value/function/datatype constructor binding in place.
477 All occurrences of @{code} with a single ML block are generated
478 simultaneously. Provides a generic and safe interface for
479 instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy
480 example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious
481 application. In future you ought refrain from ad-hoc compiling
482 generated SML code on the ML toplevel. Note that (for technical
483 reasons) @{code} cannot refer to constants for which user-defined
484 serializations are set. Refer to the corresponding ML counterpart
485 directly in that cases.
487 * Integrated image HOL-Complex with HOL. Entry points Main.thy and
488 Complex_Main.thy remain as they are.
490 * New image HOL-Plain provides a minimal HOL with the most important
491 tools available (inductive, datatype, primrec, ...). By convention
492 the corresponding theory Plain should be ancestor of every further
493 (library) theory. Some library theories now have ancestor Plain
494 (instead of Main), thus theory Main occasionally has to be imported
497 * The metis method now fails in the usual manner, rather than raising
498 an exception, if it determines that it cannot prove the theorem.
500 * The metis method no longer fails because the theorem is too trivial
501 (contains the empty clause).
503 * Methods "case_tac" and "induct_tac" now refer to the very same rules
504 as the structured Isar versions "cases" and "induct", cf. the
505 corresponding "cases" and "induct" attributes. Mutual induction rules
506 are now presented as a list of individual projections
507 (e.g. foo_bar.inducts for types foo and bar); the old format with
508 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
509 rare situations a different rule is selected --- notably nested tuple
510 elimination instead of former prod.exhaust: use explicit (case_tac t
511 rule: prod.exhaust) here.
513 * Attributes "cases", "induct", "coinduct" support "del" option.
515 * Removed fact "case_split_thm", which duplicates "case_split".
517 * Command 'rep_datatype': instead of theorem names the command now
518 takes a list of terms denoting the constructors of the type to be
519 represented as datatype. The characteristic theorems have to be
520 proven. INCOMPATIBILITY. Also observe that the following theorems
521 have disappeared in favour of existing ones:
523 unit_induct ~> unit.induct
524 prod_induct ~> prod.induct
525 sum_induct ~> sum.induct
526 Suc_Suc_eq ~> nat.inject
527 Suc_not_Zero Zero_not_Suc ~> nat.distinct
529 * The option datatype has been moved to a new theory HOL/Option.thy.
530 Renamed option_map to Option.map, and o2s to Option.set.
532 * Library/Nat_Infinity: added addition, numeral syntax and more
533 instantiations for algebraic structures. Removed some duplicate
534 theorems. Changes in simp rules. INCOMPATIBILITY.
536 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
542 * New locales for orders and lattices where the equivalence relation
543 is not restricted to equality. INCOMPATIBILITY: all order and lattice
544 locales use a record structure with field eq for the equivalence.
546 * New theory of factorial domains.
548 * Units_l_inv and Units_r_inv are now simprules by default.
549 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
550 and/or r_inv will now also require deletion of these lemmas.
552 * Renamed the following theorems. INCOMPATIBILITY.
555 least_carrier ~> least_closed
556 greatest_carrier ~> greatest_closed
557 greatest_Lower_above ~> greatest_Lower_below
558 one_zero ~> carrier_one_zero
559 one_not_zero ~> carrier_one_not_zero (collision with assumption)
564 * Created new image HOL-NSA, containing theories of nonstandard
565 analysis which were previously part of HOL-Complex. Entry point
566 Hyperreal.thy remains valid, but theories formerly using
567 Complex_Main.thy should now use new entry point Hypercomplex.thy.
572 * Proof of Zorn's Lemma for partial orders.
577 * Reimplemented the simplification procedure for proving continuity
578 subgoals. The new simproc is extensible; users can declare additional
579 continuity introduction rules with the attribute [cont2cont].
581 * The continuity simproc now uses a different introduction rule for
582 solving continuity subgoals on terms with lambda abstractions. In
583 some rare cases the new simproc may fail to solve subgoals that the
584 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
585 Potential INCOMPATIBILITY.
587 * The syntax of the fixrec package has changed. The specification
588 syntax now conforms in style to definition, primrec, function, etc.
589 See HOLCF/ex/Fixrec_ex.thy for examples. INCOMPATIBILITY.
594 * High-level support for concurrent ML programming, see
595 src/Pure/Cuncurrent. The data-oriented model of "future values" is
596 particularly convenient to organize independent functional
597 computations. The concept of "synchronized variables" provides a
598 higher-order interface for components with shared state, avoiding the
599 delicate details of mutexes and condition variables. [Poly/ML 5.2.1
602 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
603 to 'a -> thm, while results are always tagged with an authentic oracle
604 name. The Isar command 'oracle' is now polymorphic, no argument type
605 is specified. INCOMPATIBILITY, need to simplify existing oracle code
606 accordingly. Note that extra performance may be gained by producing
607 the cterm carefully, avoiding slow Thm.cterm_of.
609 * ML bindings produced via Isar commands are stored within the Isar
610 context (theory or proof). Consequently, commands like 'use' and 'ML'
611 become thread-safe and work with undo as expected (concerning
612 top-level bindings, not side-effects on global references).
613 INCOMPATIBILITY, need to provide proper Isar context when invoking the
614 compiler at runtime; really global bindings need to be given outside a
615 theory. [Poly/ML 5.2 or later]
617 * Command 'ML_prf' is analogous to 'ML' but works within a proof
618 context. Top-level ML bindings are stored within the proof context in
619 a purely sequential fashion, disregarding the nested proof structure.
620 ML bindings introduced by 'ML_prf' are discarded at the end of the
621 proof. [Poly/ML 5.2 or later]
623 * Generic Toplevel.add_hook interface allows to analyze the result of
624 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
625 for theorem dependency output of transactions resulting in a new
628 * More systematic treatment of long names, abstract name bindings, and
629 name space operations. Basic operations on qualified names have been
630 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
631 Long_Name.append. Old type bstring has been mostly replaced by
632 abstract type binding (see structure Binding), which supports precise
633 qualification (by packages and local theory targets), as well as
634 proper tracking of source positions. INCOMPATIBILITY, need to wrap
635 old bstring values into Binding.name, or better pass through abstract
636 bindings everywhere. See further src/Pure/General/long_name.ML,
637 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
639 * Simplified interface for defining document antiquotations via
640 ThyOutput.antiquotation, ThyOutput.output, and optionally
641 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
642 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
645 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
646 LocalTheory.note etc.) now refer to the *full* internal name, not the
647 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
649 * Rules and tactics that read instantiations (read_instantiate,
650 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
651 context, which is required for parsing and type-checking. Moreover,
652 the variables are specified as plain indexnames, not string encodings
653 thereof. INCOMPATIBILITY.
655 * Disposed old type and term read functions (Sign.read_def_typ,
656 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
657 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
658 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
659 Syntax.read_term_global etc.; see also OldGoals.read_term as last
660 resort for legacy applications.
662 * Antiquotations: block-structured compilation context indicated by
663 \<lbrace> ... \<rbrace>; additional antiquotation forms:
665 @{let ?pat = term} - term abbreviation (HO matching)
666 @{note name = fact} - fact abbreviation
667 @{thm fact} - singleton fact (with attributes)
668 @{thms fact} - general fact (with attributes)
669 @{lemma prop by method} - singleton goal
670 @{lemma prop by meth1 meth2} - singleton goal
671 @{lemma prop1 ... propN by method} - general goal
672 @{lemma prop1 ... propN by meth1 meth2} - general goal
673 @{lemma (open) ...} - open derivation
678 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
679 Poly/ML 5.2.1 or later.
681 * The Isabelle "emacs" tool provides a specific interface to invoke
682 Proof General / Emacs, with more explicit failure if that is not
683 installed (the old isabelle-interface script silently falls back on
684 isabelle-process). The PROOFGENERAL_HOME setting determines the
685 installation location of the Proof General distribution.
687 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
688 the Isabelle process into a JVM/Scala application. See
689 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
690 process wrapper has been discontinued.)
692 * Status messages (with exact source position information) are
693 emitted, if proper markup print mode is enabled. This allows
694 user-interface components to provide detailed feedback on internal
697 * Homegrown Isabelle font with unicode layout, see Isabelle/lib/fonts.
701 New in Isabelle2008 (June 2008)
702 -------------------------------
706 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
707 and updated, with formally checked references as hyperlinks.
709 * Theory loader: use_thy (and similar operations) no longer set the
710 implicit ML context, which was occasionally hard to predict and in
711 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
712 provides a proper context already.
714 * Theory loader: old-style ML proof scripts being *attached* to a thy
715 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
716 'use' within a theory file will do the job.
718 * Name space merge now observes canonical order, i.e. the second space
719 is inserted into the first one, while existing entries in the first
720 space take precedence. INCOMPATIBILITY in rare situations, may try to
723 * Syntax: symbol \<chi> is now considered a letter. Potential
724 INCOMPATIBILITY in identifier syntax etc.
726 * Outer syntax: string tokens no longer admit escaped white space,
727 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
728 white space without escapes.
730 * Outer syntax: string tokens may contain arbitrary character codes
731 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
737 * Context-dependent token translations. Default setup reverts locally
738 fixed variables, and adds hilite markup for undeclared frees.
740 * Unused theorems can be found using the new command 'unused_thms'.
741 There are three ways of invoking it:
744 Only finds unused theorems in the current theory.
746 (2) unused_thms thy_1 ... thy_n -
747 Finds unused theorems in the current theory and all of its ancestors,
748 excluding the theories thy_1 ... thy_n and all of their ancestors.
750 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
751 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
752 their ancestors, excluding the theories thy_1 ... thy_n and all of
755 In order to increase the readability of the list produced by
756 unused_thms, theorems that have been created by a particular instance
757 of a theory command such as 'inductive' or 'function' are considered
758 to belong to the same "group", meaning that if at least one theorem in
759 this group is used, the other theorems in the same group are no longer
760 reported as unused. Moreover, if all theorems in the group are
761 unused, only one theorem in the group is displayed.
763 Note that proof objects have to be switched on in order for
764 unused_thms to work properly (i.e. !proofs must be >= 1, which is
765 usually the case when using Proof General with the default settings).
767 * Authentic naming of facts disallows ad-hoc overwriting of previous
768 theorems within the same name space. INCOMPATIBILITY, need to remove
769 duplicate fact bindings, or even accidental fact duplications. Note
770 that tools may maintain dynamically scoped facts systematically, using
771 PureThy.add_thms_dynamic.
773 * Command 'hide' now allows to hide from "fact" name space as well.
775 * Eliminated destructive theorem database, simpset, claset, and
776 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
777 update of theories within ML code.
779 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
780 INCOMPATIBILITY, object-logics depending on former Pure require
781 additional setup PureThy.old_appl_syntax_setup; object-logics
782 depending on former CPure need to refer to Pure.
784 * Commands 'use' and 'ML' are now purely functional, operating on
785 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
786 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
789 * Command 'setup': discontinued implicit version with ML reference.
791 * Instantiation target allows for simultaneous specification of class
792 instance operations together with an instantiation proof.
793 Type-checking phase allows to refer to class operations uniformly.
794 See src/HOL/Complex/Complex.thy for an Isar example and
795 src/HOL/Library/Eval.thy for an ML example.
797 * Indexing of literal facts: be more serious about including only
798 facts from the visible specification/proof context, but not the
799 background context (locale etc.). Affects `prop` notation and method
800 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
803 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
804 "(open)" option, which used to expose internal bound variables to the
807 * Isar statements: removed obsolete case "rule_context".
808 INCOMPATIBILITY, better use explicit fixes/assumes.
810 * Locale proofs: default proof step now includes 'unfold_locales';
811 hence 'proof' without argument may be used to unfold locale
815 *** Document preparation ***
817 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
818 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
819 obsolete thumbpdf setup (contemporary PDF viewers do this on the
820 spot); renamed link color from "darkblue" to "linkcolor" (default
821 value unchanged, can be redefined via \definecolor); no longer sets
822 "a4paper" option (unnecessary or even intrusive).
824 * Antiquotation @{lemma A method} proves proposition A by the given
825 method (either a method name or a method name plus (optional) method
826 arguments in parentheses) and prints A just like @{prop A}.
831 * New primrec package. Specification syntax conforms in style to
832 definition/function/.... No separate induction rule is provided. The
833 "primrec" command distinguishes old-style and new-style specifications
834 by syntax. The former primrec package is now named OldPrimrecPackage.
835 When adjusting theories, beware: constants stemming from new-style
836 primrec specifications have authentic syntax.
838 * Metis prover is now an order of magnitude faster, and also works
841 * Metis: the maximum number of clauses that can be produced from a
842 theorem is now given by the attribute max_clauses. Theorems that
843 exceed this number are ignored, with a warning printed.
845 * Sledgehammer no longer produces structured proofs by default. To
846 enable, declare [[sledgehammer_full = true]]. Attributes
847 reconstruction_modulus, reconstruction_sorts renamed
848 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
850 * Method "induct_scheme" derives user-specified induction rules
851 from well-founded induction and completeness of patterns. This factors
852 out some operations that are done internally by the function package
853 and makes them available separately. See
854 src/HOL/ex/Induction_Scheme.thy for examples.
856 * More flexible generation of measure functions for termination
857 proofs: Measure functions can be declared by proving a rule of the
858 form "is_measure f" and giving it the [measure_function] attribute.
859 The "is_measure" predicate is logically meaningless (always true), and
860 just guides the heuristic. To find suitable measure functions, the
861 termination prover sets up the goal "is_measure ?f" of the appropriate
862 type and generates all solutions by prolog-style backwards proof using
865 This setup also deals with rules like
867 "is_measure f ==> is_measure (list_size f)"
869 which accommodates nested datatypes that recurse through lists.
870 Similar rules are predeclared for products and option types.
872 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
876 - Definitions of overloaded constants on sets have to be replaced by
877 definitions on => and bool.
879 - Some definitions of overloaded operators on sets can now be proved
880 using the definitions of the operators on => and bool. Therefore,
881 the following theorems have been renamed:
883 subset_def -> subset_eq
884 psubset_def -> psubset_eq
885 set_diff_def -> set_diff_eq
886 Compl_def -> Compl_eq
887 Sup_set_def -> Sup_set_eq
888 Inf_set_def -> Inf_set_eq
889 sup_set_def -> sup_set_eq
890 inf_set_def -> inf_set_eq
892 - Due to the incompleteness of the HO unification algorithm, some
893 rules such as subst may require manual instantiation, if some of
894 the unknowns in the rule is a set.
896 - Higher order unification and forward proofs:
899 have "P (S::'a set)" <...>
900 then have "EX S. P S" ..
902 no longer works (due to the incompleteness of the HO unification
903 algorithm) and must be replaced by the pattern
910 - Calculational reasoning with subst (or similar rules):
913 have "P (S::'a set)" <...>
914 also have "S = T" <...>
917 no longer works (for similar reasons as the previous example) and
918 must be replaced by something like
920 have "P (S::'a set)" <...>
921 moreover have "S = T" <...>
922 ultimately have "P T" by simp
924 - Tactics or packages written in ML code:
925 Code performing pattern matching on types via
927 Type ("set", [T]) => ...
929 must be rewritten. Moreover, functions like strip_type or
930 binder_types no longer return the right value when applied to a
933 T1 => ... => Tn => U => bool
937 T1 => ... => Tn => U set
939 * Merged theories Wellfounded_Recursion, Accessible_Part and
940 Wellfounded_Relations to theory Wellfounded.
942 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
944 * Class finite no longer treats UNIV as class parameter. Use class
945 enum from theory Library/Enum instead to achieve a similar effect.
948 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
949 and "Cons". INCOMPATIBILITY.
951 * HOL (and FOL): renamed variables in rules imp_elim and swap.
952 Potential INCOMPATIBILITY.
954 * Theory Product_Type: duplicated lemmas split_Pair_apply and
955 injective_fst_snd removed, use split_eta and prod_eqI instead.
956 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
958 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
959 the same name in theory Orderings:
969 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
970 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
971 and different variable names.
973 * Library/Option_ord.thy: Canonical order on option type.
975 * Library/RBT.thy: Red-black trees, an efficient implementation of
978 * Library/Countable.thy: Type class for countable types.
980 * Theory Int: The representation of numerals has changed. The infix
981 operator BIT and the bit datatype with constructors B0 and B1 have
982 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
983 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
984 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
987 * Theory Nat: definition of <= and < on natural numbers no longer
988 depend on well-founded relations. INCOMPATIBILITY. Definitions
989 le_def and less_def have disappeared. Consider lemmas not_less
990 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
992 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
993 (whose purpose mainly is for various fold_set functionals) have been
994 abandoned in favor of the existing algebraic classes
995 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
996 lower_semilattice (resp. upper_semilattice) and linorder.
999 * Theory Transitive_Closure: induct and cases rules now declare proper
1000 case_names ("base" and "step"). INCOMPATIBILITY.
1002 * Theorem Inductive.lfp_ordinal_induct generalized to complete
1003 lattices. The form set-specific version is available as
1004 Inductive.lfp_ordinal_induct_set.
1006 * Renamed theorems "power.simps" to "power_int.simps".
1009 * Class semiring_div provides basic abstract properties of semirings
1010 with division and modulo operations. Subsumes former class dvd_mod.
1012 * Merged theories IntDef, Numeral and IntArith into unified theory
1013 Int. INCOMPATIBILITY.
1015 * Theory Library/Code_Index: type "index" now represents natural
1016 numbers rather than integers. INCOMPATIBILITY.
1018 * New class "uminus" with operation "uminus" (split of from class
1019 "minus" which now only has operation "minus", binary).
1022 * Constants "card", "internal_split", "option_map" now with authentic
1023 syntax. INCOMPATIBILITY.
1025 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
1026 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
1027 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
1028 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
1029 Sup_set_def, le_def, less_def, option_map_def now with object
1030 equality. INCOMPATIBILITY.
1032 * Records. Removed K_record, and replaced it by pure lambda term
1033 %x. c. The simplifier setup is now more robust against eta expansion.
1034 INCOMPATIBILITY: in cases explicitly referring to K_record.
1036 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
1038 * Library/ListVector: new theory of arithmetic vector operations.
1040 * Library/Order_Relation: new theory of various orderings as sets of
1041 pairs. Defines preorders, partial orders, linear orders and
1042 well-orders on sets and on types.
1047 * Renamed some theories to allow to loading both ZF and HOL in the
1050 Datatype -> Datatype_ZF
1051 Inductive -> Inductive_ZF
1058 INCOMPATIBILITY: ZF theories that import individual theories below
1059 Main might need to be adapted. Regular theory Main is still
1060 available, as trivial extension of Main_ZF.
1065 * ML within Isar: antiquotation @{const name} or @{const
1066 name(typargs)} produces statically-checked Const term.
1068 * Functor NamedThmsFun: data is available to the user as dynamic fact
1069 (of the same name). Removed obsolete print command.
1071 * Removed obsolete "use_legacy_bindings" function.
1073 * The ``print mode'' is now a thread-local value derived from a global
1074 template (the former print_mode reference), thus access becomes
1075 non-critical. The global print_mode reference is for session
1076 management only; user-code should use print_mode_value,
1077 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
1079 * Functions system/system_out provide a robust way to invoke external
1080 shell commands, with propagation of interrupts (requires Poly/ML
1081 5.2.1). Do not use OS.Process.system etc. from the basis library!
1086 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
1087 in accordance with Proof General 3.7, which prefers GNU emacs.
1089 * isatool tty runs Isabelle process with plain tty interaction;
1090 optional line editor may be specified via ISABELLE_LINE_EDITOR
1091 setting, the default settings attempt to locate "ledit" and "rlwrap".
1093 * isatool browser now works with Cygwin as well, using general
1094 "javapath" function defined in Isabelle process environment.
1096 * YXML notation provides a simple and efficient alternative to
1097 standard XML transfer syntax. See src/Pure/General/yxml.ML and
1098 isatool yxml as described in the Isabelle system manual.
1100 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
1101 provides general wrapper for managing an Isabelle process in a robust
1102 fashion, with ``cooked'' output from stdin/stderr.
1104 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
1105 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
1107 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
1108 way of changing the user's settings is via
1109 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
1112 * Multithreading.max_threads := 0 refers to the number of actual CPU
1113 cores of the underlying machine, which is a good starting point for
1114 optimal performance tuning. The corresponding usedir option -M allows
1115 "max" as an alias for "0". WARNING: does not work on certain versions
1116 of Mac OS (with Poly/ML 5.1).
1118 * isabelle-process: non-ML sessions are run with "nice", to reduce the
1119 adverse effect of Isabelle flooding interactive front-ends (notably
1120 ProofGeneral / XEmacs).
1124 New in Isabelle2007 (November 2007)
1125 -----------------------------------
1129 * More uniform information about legacy features, notably a
1130 warning/error of "Legacy feature: ...", depending on the state of the
1131 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
1132 legacy features will disappear eventually.
1134 * Theory syntax: the header format ``theory A = B + C:'' has been
1135 discontinued in favour of ``theory A imports B C begin''. Use isatool
1136 fixheaders to convert existing theory files. INCOMPATIBILITY.
1138 * Theory syntax: the old non-Isar theory file format has been
1139 discontinued altogether. Note that ML proof scripts may still be used
1140 with Isar theories; migration is usually quite simple with the ML
1141 function use_legacy_bindings. INCOMPATIBILITY.
1143 * Theory syntax: some popular names (e.g. 'class', 'declaration',
1144 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
1147 * Theory loader: be more serious about observing the static theory
1148 header specifications (including optional directories), but not the
1149 accidental file locations of previously successful loads. The strict
1150 update policy of former update_thy is now already performed by
1151 use_thy, so the former has been removed; use_thys updates several
1152 theories simultaneously, just as 'imports' within a theory header
1153 specification, but without merging the results. Potential
1154 INCOMPATIBILITY: may need to refine theory headers and commands
1155 ROOT.ML which depend on load order.
1157 * Theory loader: optional support for content-based file
1158 identification, instead of the traditional scheme of full physical
1159 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
1160 (cf. the system manual). The new scheme allows to work with
1161 non-finished theories in persistent session images, such that source
1162 files may be moved later on without requiring reloads.
1164 * Theory loader: old-style ML proof scripts being *attached* to a thy
1165 file (with the same base name as the theory) are considered a legacy
1166 feature, which will disappear eventually. Even now, the theory loader
1167 no longer maintains dependencies on such files.
1169 * Syntax: the scope for resolving ambiguities via type-inference is
1170 now limited to individual terms, instead of whole simultaneous
1171 specifications as before. This greatly reduces the complexity of the
1172 syntax module and improves flexibility by separating parsing and
1173 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
1174 'fixes' etc.) are required in rare situations.
1176 * Syntax: constants introduced by new-style packages ('definition',
1177 'abbreviation' etc.) are passed through the syntax module in
1178 ``authentic mode''. This means that associated mixfix annotations
1179 really stick to such constants, independently of potential name space
1180 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
1181 trees are represented slightly differently, may need to adapt syntax
1182 translations accordingly. Use CONST marker in 'translations' and
1183 @{const_syntax} antiquotation in 'parse_translation' etc.
1185 * Legacy goal package: reduced interface to the bare minimum required
1186 to keep existing proof scripts running. Most other user-level
1187 functions are now part of the OldGoals structure, which is *not* open
1188 by default (consider isatool expandshort before open OldGoals).
1189 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
1190 these tend to cause confusion about the actual goal (!) context being
1191 used here, which is not necessarily the same as the_context().
1193 * Command 'find_theorems': supports "*" wild-card in "name:"
1194 criterion; "with_dups" option. Certain ProofGeneral versions might
1195 support a specific search form (see ProofGeneral/CHANGES).
1197 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
1198 by default, which means that "prems" (and also "fixed variables") are
1199 suppressed from proof state output. Note that the ProofGeneral
1200 settings mechanism allows to change and save options persistently, but
1201 older versions of Isabelle will fail to start up if a negative prems
1204 * Local theory targets may be specified by non-nested blocks of
1205 ``context/locale/class ... begin'' followed by ``end''. The body may
1206 contain definitions, theorems etc., including any derived mechanism
1207 that has been implemented on top of these primitives. This concept
1208 generalizes the existing ``theorem (in ...)'' towards more versatility
1211 * Proof General interface: proper undo of final 'end' command;
1212 discontinued Isabelle/classic mode (ML proof scripts).
1215 *** Document preparation ***
1217 * Added antiquotation @{theory name} which prints the given name,
1218 after checking that it refers to a valid ancestor theory in the
1221 * Added antiquotations @{ML_type text} and @{ML_struct text} which
1222 check the given source text as ML type/structure, printing verbatim.
1224 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
1225 "c args == rhs" given in the current context. (Any number of
1226 arguments may be given on the LHS.)
1231 * The 'class' package offers a combination of axclass and locale to
1232 achieve Haskell-like type classes in Isabelle. Definitions and
1233 theorems within a class context produce both relative results (with
1234 implicit parameters according to the locale context), and polymorphic
1235 constants with qualified polymorphism (according to the class
1236 context). Within the body context of a 'class' target, a separate
1237 syntax layer ("user space type system") takes care of converting
1238 between global polymorphic consts and internal locale representation.
1239 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
1240 "isatool doc classes" provides a tutorial.
1242 * Generic code generator framework allows to generate executable
1243 code for ML and Haskell (including Isabelle classes). A short usage
1246 internal compilation:
1247 export_code <list of constants (term syntax)> in SML
1248 writing SML code to a file:
1249 export_code <list of constants (term syntax)> in SML <filename>
1250 writing OCaml code to a file:
1251 export_code <list of constants (term syntax)> in OCaml <filename>
1252 writing Haskell code to a bunch of files:
1253 export_code <list of constants (term syntax)> in Haskell <filename>
1255 evaluating closed propositions to True/False using code generation:
1258 Reasonable default setup of framework in HOL.
1260 Theorem attributs for selecting and transforming function equations theorems:
1262 [code fun]: select a theorem as function equation for a specific constant
1263 [code fun del]: deselect a theorem as function equation for a specific constant
1264 [code inline]: select an equation theorem for unfolding (inlining) in place
1265 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
1267 User-defined serializations (target in {SML, OCaml, Haskell}):
1269 code_const <and-list of constants (term syntax)>
1270 {(target) <and-list of const target syntax>}+
1272 code_type <and-list of type constructors>
1273 {(target) <and-list of type target syntax>}+
1275 code_instance <and-list of instances>
1277 where instance ::= <type constructor> :: <class>
1279 code_class <and_list of classes>
1280 {(target) <and-list of class target syntax>}+
1281 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
1283 code_instance and code_class only are effective to target Haskell.
1285 For example usage see src/HOL/ex/Codegenerator.thy and
1286 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
1287 generation from Isabelle/HOL theories is available via "isatool doc
1290 * Code generator: consts in 'consts_code' Isar commands are now
1291 referred to by usual term syntax (including optional type
1294 * Command 'no_translations' removes translation rules from theory
1297 * Overloaded definitions are now actually checked for acyclic
1298 dependencies. The overloading scheme is slightly more general than
1299 that of Haskell98, although Isabelle does not demand an exact
1300 correspondence to type class and instance declarations.
1301 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
1302 exotic versions of overloading -- at the discretion of the user!
1304 Polymorphic constants are represented via type arguments, i.e. the
1305 instantiation that matches an instance against the most general
1306 declaration given in the signature. For example, with the declaration
1307 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
1308 as c(nat). Overloading is essentially simultaneous structural
1309 recursion over such type arguments. Incomplete specification patterns
1310 impose global constraints on all occurrences, e.g. c('a * 'a) on the
1311 LHS means that more general c('a * 'b) will be disallowed on any RHS.
1312 Command 'print_theory' outputs the normalized system of recursive
1313 equations, see section "definitions".
1315 * Configuration options are maintained within the theory or proof
1316 context (with name and type bool/int/string), providing a very simple
1317 interface to a poor-man's version of general context data. Tools may
1318 declare options in ML (e.g. using Attrib.config_int) and then refer to
1319 these values using Config.get etc. Users may change options via an
1320 associated attribute of the same name. This form of context
1321 declaration works particularly well with commands 'declare' or
1322 'using', for example ``declare [[foo = 42]]''. Thus it has become
1323 very easy to avoid global references, which would not observe Isar
1324 toplevel undo/redo and fail to work with multithreading.
1326 Various global ML references of Pure and HOL have been turned into
1327 configuration options:
1329 Unify.search_bound unify_search_bound
1330 Unify.trace_bound unify_trace_bound
1331 Unify.trace_simp unify_trace_simp
1332 Unify.trace_types unify_trace_types
1333 Simplifier.simp_depth_limit simp_depth_limit
1334 Blast.depth_limit blast_depth_limit
1335 DatatypeProp.dtK datatype_distinctness_limit
1336 fast_arith_neq_limit fast_arith_neq_limit
1337 fast_arith_split_limit fast_arith_split_limit
1339 * Named collections of theorems may be easily installed as context
1340 data using the functor NamedThmsFun (see also
1341 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
1342 attributes; there is also a toplevel print command. This facility is
1343 just a common case of general context data, which is the preferred way
1344 for anything more complex than just a list of facts in canonical
1347 * Isar: command 'declaration' augments a local theory by generic
1348 declaration functions written in ML. This enables arbitrary content
1349 being added to the context, depending on a morphism that tells the
1350 difference of the original declaration context wrt. the application
1351 context encountered later on.
1353 * Isar: proper interfaces for simplification procedures. Command
1354 'simproc_setup' declares named simprocs (with match patterns, and body
1355 text in ML). Attribute "simproc" adds/deletes simprocs in the current
1356 context. ML antiquotation @{simproc name} retrieves named simprocs.
1358 * Isar: an extra pair of brackets around attribute declarations
1359 abbreviates a theorem reference involving an internal dummy fact,
1360 which will be ignored later --- only the effect of the attribute on
1361 the background context will persist. This form of in-place
1362 declarations is particularly useful with commands like 'declare' and
1363 'using', for example ``have A using [[simproc a]] by simp''.
1365 * Isar: method "assumption" (and implicit closing of subproofs) now
1366 takes simple non-atomic goal assumptions into account: after applying
1367 an assumption as a rule the resulting subgoals are solved by atomic
1368 assumption steps. This is particularly useful to finish 'obtain'
1369 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
1370 without referring to the original premise "!!x. P x ==> thesis" in the
1371 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
1374 * Isar: implicit use of prems from the Isar proof context is
1375 considered a legacy feature. Common applications like ``have A .''
1376 may be replaced by ``have A by fact'' or ``note `A`''. In general,
1377 referencing facts explicitly here improves readability and
1378 maintainability of proof texts.
1380 * Isar: improper proof element 'guess' is like 'obtain', but derives
1381 the obtained context from the course of reasoning! For example:
1383 assume "EX x y. A x & B y" -- "any previous fact"
1384 then guess x and y by clarify
1386 This technique is potentially adventurous, depending on the facts and
1387 proof tools being involved here.
1389 * Isar: known facts from the proof context may be specified as literal
1390 propositions, using ASCII back-quote syntax. This works wherever
1391 named facts used to be allowed so far, in proof commands, proof
1392 methods, attributes etc. Literal facts are retrieved from the context
1393 according to unification of type and term parameters. For example,
1394 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
1395 theorems in the current context, then these are valid literal facts:
1396 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
1398 There is also a proof method "fact" which does the same composition
1399 for explicit goal states, e.g. the following proof texts coincide with
1400 certain special cases of literal facts:
1402 have "A" by fact == note `A`
1403 have "A ==> B" by fact == note `A ==> B`
1404 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
1405 have "P a ==> Q a" by fact == note `P a ==> Q a`
1407 * Isar: ":" (colon) is no longer a symbolic identifier character in
1408 outer syntax. Thus symbolic identifiers may be used without
1409 additional white space in declarations like this: ``assume *: A''.
1411 * Isar: 'print_facts' prints all local facts of the current context,
1412 both named and unnamed ones.
1414 * Isar: 'def' now admits simultaneous definitions, e.g.:
1416 def x == "t" and y == "u"
1418 * Isar: added command 'unfolding', which is structurally similar to
1419 'using', but affects both the goal state and facts by unfolding given
1420 rewrite rules. Thus many occurrences of the 'unfold' method or
1421 'unfolded' attribute may be replaced by first-class proof text.
1423 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
1424 and command 'unfolding' now all support object-level equalities
1425 (potentially conditional). The underlying notion of rewrite rule is
1426 analogous to the 'rule_format' attribute, but *not* that of the
1427 Simplifier (which is usually more generous).
1429 * Isar: the new attribute [rotated n] (default n = 1) rotates the
1430 premises of a theorem by n. Useful in conjunction with drule.
1432 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
1433 method expression within a sandbox consisting of the first N
1434 sub-goals, which need to exist. For example, ``simp_all [3]''
1435 simplifies the first three sub-goals, while (rule foo, simp_all)[]
1436 simplifies all new goals that emerge from applying rule foo to the
1437 originally first one.
1439 * Isar: schematic goals are no longer restricted to higher-order
1440 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
1443 * Isar: the conclusion of a long theorem statement is now either
1444 'shows' (a simultaneous conjunction, as before), or 'obtains'
1445 (essentially a disjunction of cases with local parameters and
1446 assumptions). The latter allows to express general elimination rules
1447 adequately; in this notation common elimination rules look like this:
1449 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
1451 obtains x where "P x"
1453 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
1457 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
1463 The subsequent classical rules even refer to the formal "thesis"
1466 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
1469 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
1470 obtains "thesis ==> something"
1472 The actual proof of an 'obtains' statement is analogous to that of the
1473 Isar proof element 'obtain', only that there may be several cases.
1474 Optional case names may be specified in parentheses; these will be
1475 available both in the present proof and as annotations in the
1476 resulting rule, for later use with the 'cases' method (cf. attribute
1479 * Isar: the assumptions of a long theorem statement are available as
1480 "assms" fact in the proof context. This is more appropriate than the
1481 (historical) "prems", which refers to all assumptions of the current
1482 context, including those from the target locale, proof body etc.
1484 * Isar: 'print_statement' prints theorems from the current theory or
1485 proof context in long statement form, according to the syntax of a
1488 * Isar: 'obtain' takes an optional case name for the local context
1489 introduction rule (default "that").
1491 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
1492 explicit (is "_ ==> ?foo") in the rare cases where this still happens
1495 * Pure: syntax "CONST name" produces a fully internalized constant
1496 according to the current context. This is particularly useful for
1497 syntax translations that should refer to internal constant
1498 representations independently of name spaces.
1500 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
1501 instead of "FOO ". This allows multiple binder declarations to coexist
1502 in the same context. INCOMPATIBILITY.
1504 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
1505 primitive that also works in a locale context (both for constants and
1506 fixed variables). Type declaration and internal syntactic representation
1507 of given constants retrieved from the context. Likewise, the
1508 'no_notation' command allows to remove given syntax annotations from the
1511 * Isar/locales: new derived specification elements 'axiomatization',
1512 'definition', 'abbreviation', which support type-inference, admit
1513 object-level specifications (equality, equivalence). See also the
1514 isar-ref manual. Examples:
1517 eq (infix "===" 50) where
1518 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
1520 definition "f x y = x + y + 1"
1521 definition g where "g x = f x x"
1524 neq (infix "=!=" 50) where
1525 "x =!= y == ~ (x === y)"
1527 These specifications may be also used in a locale context. Then the
1528 constants being introduced depend on certain fixed parameters, and the
1529 constant name is qualified by the locale base name. An internal
1530 abbreviation takes care for convenient input and output, making the
1531 parameters implicit and using the original short name. See also
1532 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
1533 entities from a monomorphic theory.
1535 Presently, abbreviations are only available 'in' a target locale, but
1536 not inherited by general import expressions. Also note that
1537 'abbreviation' may be used as a type-safe replacement for 'syntax' +
1538 'translations' in common applications. The "no_abbrevs" print mode
1539 prevents folding of abbreviations in term output.
1541 Concrete syntax is attached to specified constants in internal form,
1542 independently of name spaces. The parse tree representation is
1543 slightly different -- use 'notation' instead of raw 'syntax', and
1544 'translations' with explicit "CONST" markup to accommodate this.
1546 * Pure/Isar: unified syntax for new-style specification mechanisms
1547 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
1548 full type inference and dummy patterns ("_"). For example:
1550 definition "K x _ = x"
1552 inductive conj for A B
1553 where "A ==> B ==> conj A B"
1555 * Pure: command 'print_abbrevs' prints all constant abbreviations of
1556 the current context. Print mode "no_abbrevs" prevents inversion of
1557 abbreviations on output.
1559 * Isar/locales: improved parameter handling: use of locales "var" and
1560 "struct" no longer necessary; - parameter renamings are no longer
1561 required to be injective. For example, this allows to define
1562 endomorphisms as locale endom = homom mult mult h.
1564 * Isar/locales: changed the way locales with predicates are defined.
1565 Instead of accumulating the specification, the imported expression is
1566 now an interpretation. INCOMPATIBILITY: different normal form of
1567 locale expressions. In particular, in interpretations of locales with
1568 predicates, goals repesenting already interpreted fragments are not
1569 removed automatically. Use methods `intro_locales' and
1570 `unfold_locales'; see below.
1572 * Isar/locales: new methods `intro_locales' and `unfold_locales'
1573 provide backward reasoning on locales predicates. The methods are
1574 aware of interpretations and discharge corresponding goals.
1575 `intro_locales' is less aggressive then `unfold_locales' and does not
1576 unfold predicates to assumptions.
1578 * Isar/locales: the order in which locale fragments are accumulated
1579 has changed. This enables to override declarations from fragments due
1580 to interpretations -- for example, unwanted simp rules.
1582 * Isar/locales: interpretation in theories and proof contexts has been
1583 extended. One may now specify (and prove) equations, which are
1584 unfolded in interpreted theorems. This is useful for replacing
1585 defined concepts (constants depending on locale parameters) by
1586 concepts already existing in the target context. Example:
1588 interpretation partial_order ["op <= :: [int, int] => bool"]
1589 where "partial_order.less (op <=) (x::int) y = (x < y)"
1591 Typically, the constant `partial_order.less' is created by a
1592 definition specification element in the context of locale
1595 * Method "induct": improved internal context management to support
1596 local fixes and defines on-the-fly. Thus explicit meta-level
1597 connectives !! and ==> are rarely required anymore in inductive goals
1598 (using object-logic connectives for this purpose has been long
1599 obsolete anyway). Common proof patterns are explained in
1600 src/HOL/Induct/Common_Patterns.thy, see also
1601 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
1604 * Method "induct": improved handling of simultaneous goals. Instead of
1605 introducing object-level conjunction, the statement is now split into
1606 several conclusions, while the corresponding symbolic cases are nested
1607 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
1608 see src/HOL/Induct/Common_Patterns.thy, for example.
1610 * Method "induct": mutual induction rules are now specified as a list
1611 of rule sharing the same induction cases. HOL packages usually provide
1612 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
1613 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
1614 mutual induction rules differently, i.e. like this:
1616 (induct rule: foo_bar.inducts)
1617 (induct set: foo bar)
1618 (induct pred: foo bar)
1619 (induct type: foo bar)
1621 The ML function ProjectRule.projections turns old-style rules into the
1624 * Method "coinduct": dual of induction, see
1625 src/HOL/Library/Coinductive_List.thy for various examples.
1627 * Method "cases", "induct", "coinduct": the ``(open)'' option is
1628 considered a legacy feature.
1630 * Attribute "symmetric" produces result with standardized schematic
1631 variables (index 0). Potential INCOMPATIBILITY.
1633 * Simplifier: by default the simplifier trace only shows top level
1634 rewrites now. That is, trace_simp_depth_limit is set to 1 by
1635 default. Thus there is less danger of being flooded by the trace. The
1636 trace indicates where parts have been suppressed.
1638 * Provers/classical: removed obsolete classical version of elim_format
1639 attribute; classical elim/dest rules are now treated uniformly when
1640 manipulating the claset.
1642 * Provers/classical: stricter checks to ensure that supplied intro,
1643 dest and elim rules are well-formed; dest and elim rules must have at
1646 * Provers/classical: attributes dest/elim/intro take an optional
1647 weight argument for the rule (just as the Pure versions). Weights are
1648 ignored by automated tools, but determine the search order of single
1651 * Syntax: input syntax now supports dummy variable binding "%_. b",
1652 where the body does not mention the bound variable. Note that dummy
1653 patterns implicitly depend on their context of bounds, which makes
1654 "{_. _}" match any set comprehension as expected. Potential
1655 INCOMPATIBILITY -- parse translations need to cope with syntactic
1656 constant "_idtdummy" in the binding position.
1658 * Syntax: removed obsolete syntactic constant "_K" and its associated
1659 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
1660 for example "A -> B" => "Pi A (%_. B)".
1662 * Pure: 'class_deps' command visualizes the subclass relation, using
1663 the graph browser tool.
1665 * Pure: 'print_theory' now suppresses certain internal declarations by
1666 default; use '!' option for full details.
1671 * Method "metis" proves goals by applying the Metis general-purpose
1672 resolution prover (see also http://gilith.com/software/metis/).
1673 Examples are in the directory MetisExamples. WARNING: the
1674 Isabelle/HOL-Metis integration does not yet work properly with
1677 * Command 'sledgehammer' invokes external automatic theorem provers as
1678 background processes. It generates calls to the "metis" method if
1679 successful. These can be pasted into the proof. Users do not have to
1680 wait for the automatic provers to return. WARNING: does not really
1681 work with multi-threading.
1683 * New "auto_quickcheck" feature tests outermost goal statements for
1684 potential counter-examples. Controlled by ML references
1685 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
1686 5000 milliseconds). Fails silently if statements is outside of
1687 executable fragment, or any other codgenerator problem occurs.
1689 * New constant "undefined" with axiom "undefined x = undefined".
1691 * Added class "HOL.eq", allowing for code generation with polymorphic
1694 * Some renaming of class constants due to canonical name prefixing in
1695 the new 'class' package:
1697 HOL.abs ~> HOL.abs_class.abs
1698 HOL.divide ~> HOL.divide_class.divide
1699 0 ~> HOL.zero_class.zero
1700 1 ~> HOL.one_class.one
1701 op + ~> HOL.plus_class.plus
1702 op - ~> HOL.minus_class.minus
1703 uminus ~> HOL.minus_class.uminus
1704 op * ~> HOL.times_class.times
1705 op < ~> HOL.ord_class.less
1706 op <= > HOL.ord_class.less_eq
1707 Nat.power ~> Power.power_class.power
1708 Nat.size ~> Nat.size_class.size
1709 Numeral.number_of ~> Numeral.number_class.number_of
1710 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
1711 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
1712 Orderings.min ~> Orderings.ord_class.min
1713 Orderings.max ~> Orderings.ord_class.max
1714 Divides.op div ~> Divides.div_class.div
1715 Divides.op mod ~> Divides.div_class.mod
1716 Divides.op dvd ~> Divides.div_class.dvd
1718 INCOMPATIBILITY. Adaptions may be required in the following cases:
1720 a) User-defined constants using any of the names "plus", "minus",
1721 "times", "less" or "less_eq". The standard syntax translations for
1722 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
1725 b) Variables named "plus", "minus", "times", "less", "less_eq"
1726 INCOMPATIBILITY: use more specific names.
1728 c) Permutative equations (e.g. "a + b = b + a")
1729 Since the change of names also changes the order of terms, permutative
1730 rewrite rules may get applied in a different order. Experience shows
1731 that this is rarely the case (only two adaptions in the whole Isabelle
1732 distribution). INCOMPATIBILITY: rewrite proofs
1734 d) ML code directly refering to constant names
1735 This in general only affects hand-written proof tactics, simprocs and
1736 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
1737 Consider using @{const_name} antiquotation.
1739 * New class "default" with associated constant "default".
1741 * Function "sgn" is now overloaded and available on int, real, complex
1742 (and other numeric types), using class "sgn". Two possible defs of
1743 sgn are given as equational assumptions in the classes sgn_if and
1744 sgn_div_norm; ordered_idom now also inherits from sgn_if.
1747 * Locale "partial_order" now unified with class "order" (cf. theory
1748 Orderings), added parameter "less". INCOMPATIBILITY.
1750 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
1751 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
1752 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
1754 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
1755 changed order of proof goals in instance proofs.
1757 * The transitivity reasoner for partial and linear orders is set up
1758 for classes "order" and "linorder". Instances of the reasoner are available
1759 in all contexts importing or interpreting the corresponding locales.
1760 Method "order" invokes the reasoner separately; the reasoner
1761 is also integrated with the Simplifier as a solver. Diagnostic
1762 command 'print_orders' shows the available instances of the reasoner
1763 in the current context.
1765 * Localized monotonicity predicate in theory "Orderings"; integrated
1766 lemmas max_of_mono and min_of_mono with this predicate.
1769 * Formulation of theorem "dense" changed slightly due to integration
1770 with new class dense_linear_order.
1772 * Uniform lattice theory development in HOL.
1774 constants "meet" and "join" now named "inf" and "sup"
1775 constant "Meet" now named "Inf"
1777 classes "meet_semilorder" and "join_semilorder" now named
1778 "lower_semilattice" and "upper_semilattice"
1779 class "lorder" now named "lattice"
1780 class "comp_lat" now named "complete_lattice"
1782 Instantiation of lattice classes allows explicit definitions
1783 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
1785 INCOMPATIBILITY. Theorem renames:
1787 meet_left_le ~> inf_le1
1788 meet_right_le ~> inf_le2
1789 join_left_le ~> sup_ge1
1790 join_right_le ~> sup_ge2
1791 meet_join_le ~> inf_sup_ord
1794 le_meet ~> le_inf_iff
1795 le_join ~> ge_sup_conv
1796 meet_idempotent ~> inf_idem
1797 join_idempotent ~> sup_idem
1798 meet_comm ~> inf_commute
1799 join_comm ~> sup_commute
1800 meet_leI1 ~> le_infI1
1801 meet_leI2 ~> le_infI2
1802 le_joinI1 ~> le_supI1
1803 le_joinI2 ~> le_supI2
1804 meet_assoc ~> inf_assoc
1805 join_assoc ~> sup_assoc
1806 meet_left_comm ~> inf_left_commute
1807 meet_left_idempotent ~> inf_left_idem
1808 join_left_comm ~> sup_left_commute
1809 join_left_idempotent ~> sup_left_idem
1812 le_def_meet ~> le_iff_inf
1813 le_def_join ~> le_iff_sup
1814 join_absorp2 ~> sup_absorb2
1815 join_absorp1 ~> sup_absorb1
1816 meet_absorp1 ~> inf_absorb1
1817 meet_absorp2 ~> inf_absorb2
1818 meet_join_absorp ~> inf_sup_absorb
1819 join_meet_absorp ~> sup_inf_absorb
1820 distrib_join_le ~> distrib_sup_le
1821 distrib_meet_le ~> distrib_inf_le
1823 add_meet_distrib_left ~> add_inf_distrib_left
1824 add_join_distrib_left ~> add_sup_distrib_left
1825 is_join_neg_meet ~> is_join_neg_inf
1826 is_meet_neg_join ~> is_meet_neg_sup
1827 add_meet_distrib_right ~> add_inf_distrib_right
1828 add_join_distrib_right ~> add_sup_distrib_right
1829 add_meet_join_distribs ~> add_sup_inf_distribs
1830 join_eq_neg_meet ~> sup_eq_neg_inf
1831 meet_eq_neg_join ~> inf_eq_neg_sup
1832 add_eq_meet_join ~> add_eq_inf_sup
1833 meet_0_imp_0 ~> inf_0_imp_0
1834 join_0_imp_0 ~> sup_0_imp_0
1835 meet_0_eq_0 ~> inf_0_eq_0
1836 join_0_eq_0 ~> sup_0_eq_0
1837 neg_meet_eq_join ~> neg_inf_eq_sup
1838 neg_join_eq_meet ~> neg_sup_eq_inf
1839 join_eq_if ~> sup_eq_if
1841 mono_meet ~> mono_inf
1842 mono_join ~> mono_sup
1843 meet_bool_eq ~> inf_bool_eq
1844 join_bool_eq ~> sup_bool_eq
1845 meet_fun_eq ~> inf_fun_eq
1846 join_fun_eq ~> sup_fun_eq
1847 meet_set_eq ~> inf_set_eq
1848 join_set_eq ~> sup_set_eq
1849 meet1_iff ~> inf1_iff
1850 meet2_iff ~> inf2_iff
1859 join1_iff ~> sup1_iff
1860 join2_iff ~> sup2_iff
1870 is_meet_Meet ~> is_meet_Inf
1871 Meet_bool_def ~> Inf_bool_def
1872 Meet_fun_def ~> Inf_fun_def
1873 Meet_greatest ~> Inf_greatest
1874 Meet_lower ~> Inf_lower
1875 Meet_set_def ~> Inf_set_def
1878 Sup_bool_eq ~> Sup_bool_def
1879 Sup_fun_eq ~> Sup_fun_def
1880 Sup_set_eq ~> Sup_set_def
1882 listsp_meetI ~> listsp_infI
1883 listsp_meet_eq ~> listsp_inf_eq
1888 * Added syntactic class "size"; overloaded constant "size" now has
1889 type "'a::size ==> bool"
1891 * Internal reorganisation of `size' of datatypes: size theorems
1892 "foo.size" are no longer subsumed by "foo.simps" (but are still
1893 simplification rules by default!); theorems "prod.size" now named
1896 * Class "div" now inherits from class "times" rather than "type".
1899 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
1900 Linorder etc. have disappeared; operations defined in terms of
1901 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
1903 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
1905 * HOL-Word: New extensive library and type for generic, fixed size
1906 machine words, with arithemtic, bit-wise, shifting and rotating
1907 operations, reflection into int, nat, and bool lists, automation for
1908 linear arithmetic (by automatic reflection into nat or int), including
1909 lemmas on overflow and monotonicity. Instantiated to all appropriate
1910 arithmetic type classes, supporting automatic simplification of
1911 numerals on all operations.
1913 * Library/Boolean_Algebra: locales for abstract boolean algebras.
1915 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
1917 * Code generator library theories:
1918 - Code_Integer represents HOL integers by big integer literals in target
1920 - Code_Char represents HOL characters by character literals in target
1922 - Code_Char_chr like Code_Char, but also offers treatment of character
1923 codes; includes Code_Integer.
1924 - Executable_Set allows to generate code for finite sets using lists.
1925 - Executable_Rat implements rational numbers as triples (sign, enumerator,
1927 - Executable_Real implements a subset of real numbers, namly those
1928 representable by rational numbers.
1929 - Efficient_Nat implements natural numbers by integers, which in general will
1930 result in higher efficency; pattern matching with 0/Suc is eliminated;
1931 includes Code_Integer.
1932 - Code_Index provides an additional datatype index which is mapped to
1933 target-language built-in integers.
1934 - Code_Message provides an additional datatype message_string which is isomorphic to
1935 strings; messages are mapped to target-language strings.
1937 * New package for inductive predicates
1939 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
1942 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1943 for z_1 :: U_1 and ... and z_n :: U_m
1945 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1948 with full support for type-inference, rather than
1950 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1952 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1953 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1955 inductive "s z_1 ... z_m"
1957 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1960 For backward compatibility, there is a wrapper allowing inductive
1961 sets to be defined with the new package via
1964 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1965 for z_1 :: U_1 and ... and z_n :: U_m
1967 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
1973 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
1974 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
1975 for z_1 :: U_1 and ... and z_n :: U_m
1977 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
1978 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
1981 if the additional syntax "p ..." is required.
1983 Numerous examples can be found in the subdirectories src/HOL/Auth,
1984 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
1988 - Since declaration and definition of inductive sets or predicates
1989 is no longer separated, abbreviations involving the newly
1990 introduced sets or predicates must be specified together with the
1991 introduction rules after the 'where' keyword (see above), rather
1992 than before the actual inductive definition.
1994 - The variables in induction and elimination rules are now
1995 quantified in the order of their occurrence in the introduction
1996 rules, rather than in alphabetical order. Since this may break
1997 some proofs, these proofs either have to be repaired, e.g. by
1998 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
1999 statements of the form
2001 case (rule_i a_i_1 ... a_i_{k_i})
2003 or the old order of quantification has to be restored by explicitly adding
2004 meta-level quantifiers in the introduction rules, i.e.
2006 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
2008 - The format of the elimination rules is now
2010 p z_1 ... z_m x_1 ... x_n ==>
2011 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2016 (x_1, ..., x_n) : s z_1 ... z_m ==>
2017 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2020 for sets rather than
2022 x : s z_1 ... z_m ==>
2023 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
2026 This may require terms in goals to be expanded to n-tuples
2027 (e.g. using case_tac or simplification with the split_paired_all
2028 rule) before the above elimination rule is applicable.
2030 - The elimination or case analysis rules for (mutually) inductive
2031 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
2032 list of rules "p_1_..._p_k.elims" is no longer available.
2034 * New package "function"/"fun" for general recursive functions,
2035 supporting mutual and nested recursion, definitions in local contexts,
2036 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
2037 for small examples, and the separate tutorial on the function
2038 package. The old recdef "package" is still available as before, but
2039 users are encouraged to use the new package.
2041 * Method "lexicographic_order" automatically synthesizes termination
2042 relations as lexicographic combinations of size measures.
2044 * Case-expressions allow arbitrary constructor-patterns (including
2045 "_") and take their order into account, like in functional
2046 programming. Internally, this is translated into nested
2047 case-expressions; missing cases are added and mapped to the predefined
2048 constant "undefined". In complicated cases printing may no longer show
2049 the original input but the internal form. Lambda-abstractions allow
2050 the same form of pattern matching: "% pat1 => e1 | ..." is an
2051 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
2054 * IntDef: The constant "int :: nat => int" has been removed; now "int"
2055 is an abbreviation for "of_nat :: nat => int". The simplification
2056 rules for "of_nat" have been changed to work like "int" did
2057 previously. Potential INCOMPATIBILITY:
2058 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
2059 - of_nat_diff and of_nat_mult are no longer default simp rules
2061 * Method "algebra" solves polynomial equations over (semi)rings using
2062 Groebner bases. The (semi)ring structure is defined by locales and the
2063 tool setup depends on that generic context. Installing the method for
2064 a specific type involves instantiating the locale and possibly adding
2065 declarations for computation on the coefficients. The method is
2066 already instantiated for natural numbers and for the axiomatic class
2067 of idoms with numerals. See also the paper by Chaieb and Wenzel at
2068 CALCULEMUS 2007 for the general principles underlying this
2069 architecture of context-aware proof-tools.
2071 * Method "ferrack" implements quantifier elimination over
2072 special-purpose dense linear orders using locales (analogous to
2073 "algebra"). The method is already installed for class
2074 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
2077 * Former constant "List.op @" now named "List.append". Use ML
2078 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
2079 circumvent possible incompatibilities when working on ML level.
2081 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
2083 * New function listsum :: 'a list => 'a for arbitrary monoids.
2084 Special syntax: "SUM x <- xs. f x" (and latex variants)
2086 * New syntax for Haskell-like list comprehension (input only), eg.
2087 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
2089 * The special syntax for function "filter" has changed from [x :
2090 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
2091 comprehension syntax, and for uniformity. INCOMPATIBILITY.
2093 * [a..b] is now defined for arbitrary linear orders. It used to be
2094 defined on nat only, as an abbreviation for [a..<Suc b]
2097 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
2099 * New functions "sorted" and "sort" in src/HOL/List.thy.
2101 * New lemma collection field_simps (an extension of ring_simps) for
2102 manipulating (in)equations involving division. Multiplies with all
2103 denominators that can be proved to be non-zero (in equations) or
2104 positive/negative (in inequations).
2106 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
2107 have been improved and renamed to ring_simps, group_simps and
2108 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
2109 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
2111 * Theory Library/Commutative_Ring: switched from recdef to function
2112 package; constants add, mul, pow now curried. Infix syntax for
2113 algebraic operations.
2115 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
2118 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
2121 * HOL/records: generalised field-update to take a function on the
2122 field rather than the new value: r(|A := x|) is translated to A_update
2123 (K x) r The K-combinator that is internally used is called K_record.
2124 INCOMPATIBILITY: Usage of the plain update functions has to be
2127 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
2128 * x = 0, which are required for a semiring. Richer structures do not
2129 inherit from semiring_0 anymore, because this property is a theorem
2130 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
2131 there is more to prove, but this is mostly trivial.
2133 * Class "recpower" is generalized to arbitrary monoids, not just
2134 commutative semirings. INCOMPATIBILITY: may need to incorporate
2135 commutativity or semiring properties additionally.
2137 * Constant "List.list_all2" in List.thy now uses authentic syntax.
2138 INCOMPATIBILITY: translations containing list_all2 may go wrong,
2139 better use 'abbreviation'.
2141 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
2143 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
2144 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
2145 significant changes for setting up numeral syntax for types:
2146 - New constants Numeral.pred and Numeral.succ instead
2147 of former Numeral.bin_pred and Numeral.bin_succ.
2148 - Use integer operations instead of bin_add, bin_mult and so on.
2149 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
2150 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
2152 See src/HOL/Integ/IntArith.thy for an example setup.
2154 * Command 'normal_form' computes the normal form of a term that may
2155 contain free variables. For example ``normal_form "rev [a, b, c]"''
2156 produces ``[b, c, a]'' (without proof). This command is suitable for
2157 heavy-duty computations because the functions are compiled to ML
2158 first. Correspondingly, a method "normalization" is provided. See
2159 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
2161 * Alternative iff syntax "A <-> B" for equality on bool (with priority
2162 25 like -->); output depends on the "iff" print_mode, the default is
2163 "A = B" (with priority 50).
2165 * Relations less (<) and less_eq (<=) are also available on type bool.
2166 Modified syntax to disallow nesting without explicit parentheses,
2167 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
2170 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
2172 * Relation composition operator "op O" now has precedence 75 and binds
2173 stronger than union and intersection. INCOMPATIBILITY.
2175 * The old set interval syntax "{m..n(}" (and relatives) has been
2176 removed. Use "{m..<n}" (and relatives) instead.
2178 * In the context of the assumption "~(s = t)" the Simplifier rewrites
2179 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
2180 ``declare [[simproc del: neq]]''.
2182 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
2185 * Theorem Cons_eq_map_conv no longer declared as "simp".
2187 * Theorem setsum_mult renamed to setsum_right_distrib.
2189 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
2192 * Reimplemented methods "sat" and "satx", with several improvements:
2193 goals no longer need to be stated as "<prems> ==> False", equivalences
2194 (i.e. "=" on type bool) are handled, variable names of the form
2195 "lit_<n>" are no longer reserved, significant speedup.
2197 * Methods "sat" and "satx" can now replay MiniSat proof traces.
2198 zChaff is still supported as well.
2200 * 'inductive' and 'datatype': provide projections of mutual rules,
2201 bundled as foo_bar.inducts;
2203 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
2206 * Library: moved theory Accessible_Part to main HOL.
2208 * Library: added theory Coinductive_List of potentially infinite lists
2209 as greatest fixed-point.
2211 * Library: added theory AssocList which implements (finite) maps as
2214 * Method "evaluation" solves goals (i.e. a boolean expression)
2215 efficiently by compiling it to ML. The goal is "proved" (via an
2216 oracle) if it evaluates to True.
2218 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
2219 also when invoked by the simplifier. This results in the Simplifier
2220 being more powerful on arithmetic goals. INCOMPATIBILITY.
2221 Configuration option fast_arith_split_limit=0 recovers the old
2224 * Support for hex (0x20) and binary (0b1001) numerals.
2226 * New method: reify eqs (t), where eqs are equations for an
2227 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
2228 parameter, computes a term s::'b and a list xs::'a list and proves the
2229 theorem I xs s = t. This is also known as reification or quoting. The
2230 resulting theorem is applied to the subgoal to substitute t with I xs
2231 s. If t is omitted, the subgoal itself is reified.
2233 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
2234 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
2235 where f is supposed to be a computable function (in the sense of code
2236 generattion). The method uses reify to compute s and xs as above then
2237 applies corr_thm and uses normalization by evaluation to "prove" f s =
2238 r and finally gets the theorem t = r, which is again applied to the
2239 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
2241 * Reflection: Automatic reification now handels binding, an example is
2242 available in src/HOL/ex/ReflectionEx.thy
2244 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
2245 command 'statespace' that is similar to 'record', but introduces an
2246 abstract specification based on the locale infrastructure instead of
2247 HOL types. This leads to extra flexibility in composing state spaces,
2248 in particular multiple inheritance and renaming of components.
2253 * Hyperreal: Functions root and sqrt are now defined on negative real
2254 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
2255 Nonnegativity side conditions have been removed from many lemmas, so
2256 that more subgoals may now be solved by simplification; potential
2259 * Real: new type classes formalize real normed vector spaces and
2260 algebras, using new overloaded constants scaleR :: real => 'a => 'a
2261 and norm :: 'a => real.
2263 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
2264 reals into other types. The overloaded constant Reals :: 'a set is now
2265 defined as range of_real; potential INCOMPATIBILITY.
2267 * Real: proper support for ML code generation, including 'quickcheck'.
2268 Reals are implemented as arbitrary precision rationals.
2270 * Hyperreal: Several constants that previously worked only for the
2271 reals have been generalized, so they now work over arbitrary vector
2272 spaces. Type annotations may need to be added in some cases; potential
2275 Infinitesimal :: ('a::real_normed_vector) star set
2276 HFinite :: ('a::real_normed_vector) star set
2277 HInfinite :: ('a::real_normed_vector) star set
2278 approx :: ('a::real_normed_vector) star => 'a star => bool
2279 monad :: ('a::real_normed_vector) star => 'a star set
2280 galaxy :: ('a::real_normed_vector) star => 'a star set
2281 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
2282 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
2283 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
2284 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
2285 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
2286 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
2287 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
2288 sgn :: 'a::real_normed_vector => 'a
2289 exp :: 'a::{recpower,real_normed_field,banach} => 'a
2291 * Complex: Some complex-specific constants are now abbreviations for
2292 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
2293 hnorm. Other constants have been entirely removed in favor of the
2294 polymorphic versions (INCOMPATIBILITY):
2298 HInfinite <-- CInfinite
2299 Infinitesimal <-- CInfinitesimal
2302 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
2303 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
2304 (ns)deriv <-- (ns)cderiv
2309 * Formalisation of ideals and the quotient construction over rings.
2311 * Order and lattice theory no longer based on records.
2314 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
2315 greatest_closed. INCOMPATIBILITY.
2317 * Method algebra is now set up via an attribute. For examples see
2318 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
2319 of algebraic structures.
2321 * Renamed theory CRing to Ring.
2326 * Substantial, yet incomplete support for nominal datatypes (binding
2327 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
2328 src/HOL/Nominal/Examples. Prospective users should consult
2329 http://isabelle.in.tum.de/nominal/
2334 * ML basics: just one true type int, which coincides with IntInf.int
2337 * ML within Isar: antiquotations allow to embed statically-checked
2338 formal entities in the source, referring to the context available at
2339 compile-time. For example:
2341 ML {* @{sort "{zero,one}"} *}
2342 ML {* @{typ "'a => 'b"} *}
2343 ML {* @{term "%x. x"} *}
2344 ML {* @{prop "x == y"} *}
2345 ML {* @{ctyp "'a => 'b"} *}
2346 ML {* @{cterm "%x. x"} *}
2347 ML {* @{cprop "x == y"} *}
2348 ML {* @{thm asm_rl} *}
2349 ML {* @{thms asm_rl} *}
2350 ML {* @{type_name c} *}
2351 ML {* @{type_syntax c} *}
2352 ML {* @{const_name c} *}
2353 ML {* @{const_syntax c} *}
2356 ML {* @{theory Pure} *}
2357 ML {* @{theory_ref} *}
2358 ML {* @{theory_ref Pure} *}
2361 ML {* @{clasimpset} *}
2363 The same works for sources being ``used'' within an Isar context.
2365 * ML in Isar: improved error reporting; extra verbosity with
2366 ML_Context.trace enabled.
2368 * Pure/General/table.ML: the join operations now works via exceptions
2369 DUP/SAME instead of type option. This is simpler in simple cases, and
2370 admits slightly more efficient complex applications.
2372 * Pure: 'advanced' translation functions (parse_translation etc.) now
2373 use Context.generic instead of just theory.
2375 * Pure: datatype Context.generic joins theory/Proof.context and
2376 provides some facilities for code that works in either kind of
2377 context, notably GenericDataFun for uniform theory and proof data.
2379 * Pure: simplified internal attribute type, which is now always
2380 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
2381 local (Proof.context) attributes have been discontinued, while
2382 minimizing code duplication. Thm.rule_attribute and
2383 Thm.declaration_attribute build canonical attributes; see also structure
2384 Context for further operations on Context.generic, notably
2385 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
2386 declarations and definitions.
2388 * Context data interfaces (Theory/Proof/GenericDataFun): removed
2389 name/print, uninitialized data defaults to ad-hoc copy of empty value,
2390 init only required for impure data. INCOMPATIBILITY: empty really need
2391 to be empty (no dependencies on theory content!)
2393 * Pure/kernel: consts certification ignores sort constraints given in
2394 signature declarations. (This information is not relevant to the
2395 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
2396 potential INCOMPATIBILITY.
2398 * Pure: axiomatic type classes are now purely definitional, with
2399 explicit proofs of class axioms and super class relations performed
2400 internally. See Pure/axclass.ML for the main internal interfaces --
2401 notably AxClass.define_class supercedes AxClass.add_axclass, and
2402 AxClass.axiomatize_class/classrel/arity supersede
2403 Sign.add_classes/classrel/arities.
2405 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
2406 global/local versions on theory vs. Proof.context have been
2407 discontinued; Attrib.syntax and Method.syntax have been adapted
2408 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
2409 attributes, methods, etc.
2411 * Pure: several functions of signature "... -> theory -> theory * ..."
2412 have been reoriented to "... -> theory -> ... * theory" in order to
2413 allow natural usage in combination with the ||>, ||>>, |-> and
2414 fold_map combinators.
2416 * Pure: official theorem names (closed derivations) and additional
2417 comments (tags) are now strictly separate. Name hints -- which are
2418 maintained as tags -- may be attached any time without affecting the
2421 * Pure: primitive rule lift_rule now takes goal cterm instead of an
2422 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
2423 achieve the old behaviour.
2425 * Pure: the "Goal" constant is now called "prop", supporting a
2426 slightly more general idea of ``protecting'' meta-level rule
2429 * Pure: Logic.(un)varify only works in a global context, which is now
2430 enforced instead of silently assumed. INCOMPATIBILITY, may use
2431 Logic.legacy_(un)varify as temporary workaround.
2433 * Pure: structure Name provides scalable operations for generating
2434 internal variable names, notably Name.variants etc. This replaces
2435 some popular functions from term.ML:
2437 Term.variant -> Name.variant
2438 Term.variantlist -> Name.variant_list
2439 Term.invent_names -> Name.invent_list
2441 Note that low-level renaming rarely occurs in new code -- operations
2442 from structure Variable are used instead (see below).
2444 * Pure: structure Variable provides fundamental operations for proper
2445 treatment of fixed/schematic variables in a context. For example,
2446 Variable.import introduces fixes for schematics of given facts and
2447 Variable.export reverses the effect (up to renaming) -- this replaces
2448 various freeze_thaw operations.
2450 * Pure: structure Goal provides simple interfaces for
2451 init/conclude/finish and tactical prove operations (replacing former
2452 Tactic.prove). Goal.prove is the canonical way to prove results
2453 within a given context; Goal.prove_global is a degraded version for
2454 theory level goals, including a global Drule.standard. Note that
2455 OldGoals.prove_goalw_cterm has long been obsolete, since it is
2456 ill-behaved in a local proof context (e.g. with local fixes/assumes or
2457 in a locale context).
2459 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
2460 and type checking (Syntax.check_term etc.), with common combinations
2461 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
2462 which are considered legacy and await removal.
2464 * Pure/Syntax: generic interfaces for type unchecking
2465 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
2466 with common combinations (Syntax.pretty_term, Syntax.string_of_term
2467 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
2468 available for convenience, but refer to the very same operations using
2469 a mere theory instead of a full context.
2471 * Isar: simplified treatment of user-level errors, using exception
2472 ERROR of string uniformly. Function error now merely raises ERROR,
2473 without any side effect on output channels. The Isar toplevel takes
2474 care of proper display of ERROR exceptions. ML code may use plain
2475 handle/can/try; cat_error may be used to concatenate errors like this:
2477 ... handle ERROR msg => cat_error msg "..."
2479 Toplevel ML code (run directly or through the Isar toplevel) may be
2480 embedded into the Isar toplevel with exception display/debug like
2483 Isar.toplevel (fn () => ...)
2485 INCOMPATIBILITY, removed special transform_error facilities, removed
2486 obsolete variants of user-level exceptions (ERROR_MESSAGE,
2487 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
2488 -- use plain ERROR instead.
2490 * Isar: theory setup now has type (theory -> theory), instead of a
2491 list. INCOMPATIBILITY, may use #> to compose setup functions.
2493 * Isar: ML toplevel pretty printer for type Proof.context, subject to
2494 ProofContext.debug/verbose flags.
2496 * Isar: Toplevel.theory_to_proof admits transactions that modify the
2497 theory before entering a proof state. Transactions now always see a
2498 quasi-functional intermediate checkpoint, both in interactive and
2501 * Isar: simplified interfaces for outer syntax. Renamed
2502 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
2503 OuterSyntax.add_parsers -- this functionality is now included in
2504 OuterSyntax.command etc. INCOMPATIBILITY.
2506 * Simplifier: the simpset of a running simplification process now
2507 contains a proof context (cf. Simplifier.the_context), which is the
2508 very context that the initial simpset has been retrieved from (by
2509 simpset_of/local_simpset_of). Consequently, all plug-in components
2510 (solver, looper etc.) may depend on arbitrary proof data.
2512 * Simplifier.inherit_context inherits the proof context (plus the
2513 local bounds) of the current simplification process; any simproc
2514 etc. that calls the Simplifier recursively should do this! Removed
2515 former Simplifier.inherit_bounds, which is already included here --
2516 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
2517 specify an explicit context using Simplifier.context/theory_context.
2519 * Simplifier/Classical Reasoner: more abstract interfaces
2520 change_simpset/claset for modifying the simpset/claset reference of a
2521 theory; raw versions simpset/claset_ref etc. have been discontinued --
2524 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
2530 * settings: the default heap location within ISABELLE_HOME_USER now
2531 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
2532 Isabelle installations.
2534 * isabelle-process: option -S (secure mode) disables some critical
2535 operations, notably runtime compilation and evaluation of ML source
2538 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
2540 * Support for parallel execution, using native multicore support of
2541 Poly/ML 5.1. The theory loader exploits parallelism when processing
2542 independent theories, according to the given theory header
2543 specifications. The maximum number of worker threads is specified via
2544 usedir option -M or the "max-threads" setting in Proof General. A
2545 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
2546 to 6 on a 8-core machine. User-code needs to observe certain
2547 guidelines for thread-safe programming, see appendix A in the Isar
2548 Implementation manual.
2552 New in Isabelle2005 (October 2005)
2553 ----------------------------------
2557 * Theory headers: the new header syntax for Isar theories is
2560 imports <theory1> ... <theoryN>
2561 uses <file1> ... <fileM>
2564 where the 'uses' part is optional. The previous syntax
2566 theory <name> = <theory1> + ... + <theoryN>:
2568 will disappear in the next release. Use isatool fixheaders to convert
2569 existing theory files. Note that there is no change in ancient
2570 non-Isar theories now, but these will disappear soon.
2572 * Theory loader: parent theories can now also be referred to via
2573 relative and absolute paths.
2575 * Command 'find_theorems' searches for a list of criteria instead of a
2576 list of constants. Known criteria are: intro, elim, dest, name:string,
2577 simp:term, and any term. Criteria can be preceded by '-' to select
2578 theorems that do not match. Intro, elim, dest select theorems that
2579 match the current goal, name:s selects theorems whose fully qualified
2580 name contain s, and simp:term selects all simplification rules whose
2581 lhs match term. Any other term is interpreted as pattern and selects
2582 all theorems matching the pattern. Available in ProofGeneral under
2583 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
2585 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
2587 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
2588 matching the current goal as introduction rule and not having "HOL."
2589 in their name (i.e. not being defined in theory HOL).
2591 * Command 'thms_containing' has been discontinued in favour of
2592 'find_theorems'; INCOMPATIBILITY.
2594 * Communication with Proof General is now 8bit clean, which means that
2595 Unicode text in UTF-8 encoding may be used within theory texts (both
2596 formal and informal parts). Cf. option -U of the Isabelle Proof
2597 General interface. Here are some simple examples (cf. src/HOL/ex):
2599 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
2600 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
2602 * Improved efficiency of the Simplifier and, to a lesser degree, the
2603 Classical Reasoner. Typical big applications run around 2 times
2607 *** Document preparation ***
2609 * Commands 'display_drafts' and 'print_drafts' perform simple output
2610 of raw sources. Only those symbols that do not require additional
2611 LaTeX packages (depending on comments in isabellesym.sty) are
2612 displayed properly, everything else is left verbatim. isatool display
2613 and isatool print are used as front ends (these are subject to the
2614 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
2616 * Command tags control specific markup of certain regions of text,
2617 notably folding and hiding. Predefined tags include "theory" (for
2618 theory begin and end), "proof" for proof commands, and "ML" for
2619 commands involving ML code; the additional tags "visible" and
2620 "invisible" are unused by default. Users may give explicit tag
2621 specifications in the text, e.g. ''by %invisible (auto)''. The
2622 interpretation of tags is determined by the LaTeX job during document
2623 preparation: see option -V of isatool usedir, or options -n and -t of
2624 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
2627 Several document versions may be produced at the same time via isatool
2628 usedir (the generated index.html will link all of them). Typical
2629 specifications include ''-V document=theory,proof,ML'' to present
2630 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
2631 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
2632 these parts without any formal replacement text. The Isabelle site
2633 default settings produce ''document'' and ''outline'' versions as
2636 * Several new antiquotations:
2638 @{term_type term} prints a term with its type annotated;
2640 @{typeof term} prints the type of a term;
2642 @{const const} is the same as @{term const}, but checks that the
2643 argument is a known logical constant;
2645 @{term_style style term} and @{thm_style style thm} print a term or
2646 theorem applying a "style" to it
2650 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
2651 definitions, equations, inequations etc., 'concl' printing only the
2652 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
2653 to print the specified premise. TermStyle.add_style provides an ML
2654 interface for introducing further styles. See also the "LaTeX Sugar"
2655 document practical applications. The ML antiquotation prints
2656 type-checked ML expressions verbatim.
2658 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
2659 and 'text' support optional locale specification '(in loc)', which
2660 specifies the default context for interpreting antiquotations. For
2661 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
2663 * Option 'locale=NAME' of antiquotations specifies an alternative
2664 context interpreting the subsequent argument. For example: @{thm
2665 [locale=lattice] inf_assoc}.
2667 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
2670 * Proper output of antiquotations for theory commands involving a
2671 proof context (such as 'locale' or 'theorem (in loc) ...').
2673 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
2674 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
2676 * isatool usedir: new option -C (default true) controls whether option
2677 -D should include a copy of the original document directory; -C false
2678 prevents unwanted effects such as copying of administrative CVS data.
2683 * Considerably improved version of 'constdefs' command. Now performs
2684 automatic type-inference of declared constants; additional support for
2685 local structure declarations (cf. locales and HOL records), see also
2686 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
2687 sequential dependencies of definitions within a single 'constdefs'
2688 section; moreover, the declared name needs to be an identifier. If
2689 all fails, consider to fall back on 'consts' and 'defs' separately.
2691 * Improved indexed syntax and implicit structures. First of all,
2692 indexed syntax provides a notational device for subscripted
2693 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
2694 expressions. Secondly, in a local context with structure
2695 declarations, number indexes \<^sub>n or the empty index (default
2696 number 1) refer to a certain fixed variable implicitly; option
2697 show_structs controls printing of implicit structures. Typical
2698 applications of these concepts involve record types and locales.
2700 * New command 'no_syntax' removes grammar declarations (and
2701 translations) resulting from the given syntax specification, which is
2702 interpreted in the same manner as for the 'syntax' command.
2704 * 'Advanced' translation functions (parse_translation etc.) may depend
2705 on the signature of the theory context being presently used for
2706 parsing/printing, see also isar-ref manual.
2708 * Improved 'oracle' command provides a type-safe interface to turn an
2709 ML expression of type theory -> T -> term into a primitive rule of
2710 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
2711 is already included here); see also FOL/ex/IffExample.thy;
2714 * axclass: name space prefix for class "c" is now "c_class" (was "c"
2715 before); "cI" is no longer bound, use "c.intro" instead.
2716 INCOMPATIBILITY. This change avoids clashes of fact bindings for
2717 axclasses vs. locales.
2719 * Improved internal renaming of symbolic identifiers -- attach primes
2720 instead of base 26 numbers.
2722 * New flag show_question_marks controls printing of leading question
2723 marks in schematic variable names.
2725 * In schematic variable names, *any* symbol following \<^isub> or
2726 \<^isup> is now treated as part of the base name. For example, the
2727 following works without printing of awkward ".0" indexes:
2729 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
2732 * Inner syntax includes (*(*nested*) comments*).
2734 * Pretty printer now supports unbreakable blocks, specified in mixfix
2735 annotations as "(00...)".
2737 * Clear separation of logical types and nonterminals, where the latter
2738 may only occur in 'syntax' specifications or type abbreviations.
2739 Before that distinction was only partially implemented via type class
2740 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
2741 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
2742 exotic syntax specifications may require further adaption
2743 (e.g. Cube/Cube.thy).
2745 * Removed obsolete type class "logic", use the top sort {} instead.
2746 Note that non-logical types should be declared as 'nonterminals'
2747 rather than 'types'. INCOMPATIBILITY for new object-logic
2750 * Attributes 'induct' and 'cases': type or set names may now be
2751 locally fixed variables as well.
2753 * Simplifier: can now control the depth to which conditional rewriting
2754 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
2757 * Simplifier: simplification procedures may now take the current
2758 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
2759 interface), which is very useful for calling the Simplifier
2760 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
2761 is gone -- use prems_of_ss on the simpset instead. Moreover, the
2762 low-level mk_simproc no longer applies Logic.varify internally, to
2763 allow for use in a context of fixed variables.
2765 * thin_tac now works even if the assumption being deleted contains !!
2766 or ==>. More generally, erule now works even if the major premise of
2767 the elimination rule contains !! or ==>.
2769 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
2771 * Reorganized bootstrapping of the Pure theories; CPure is now derived
2772 from Pure, which contains all common declarations already. Both
2773 theories are defined via plain Isabelle/Isar .thy files.
2774 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
2775 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
2776 use isatool fixcpure to adapt your theory and ML sources.
2778 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
2779 selections of theorems in named facts via index ranges.
2781 * 'print_theorems': in theory mode, really print the difference
2782 wrt. the last state (works for interactive theory development only),
2783 in proof mode print all local facts (cf. 'print_facts');
2785 * 'hide': option '(open)' hides only base names.
2787 * More efficient treatment of intermediate checkpoints in interactive
2790 * Code generator is now invoked via code_module (incremental code
2791 generation) and code_library (modular code generation, ML structures
2792 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
2793 must be quoted when used as identifiers.
2795 * New 'value' command for reading, evaluating and printing terms using
2796 the code generator. INCOMPATIBILITY: command keyword 'value' must be
2797 quoted when used as identifier.
2802 * New commands for the interpretation of locale expressions in
2803 theories (1), locales (2) and proof contexts (3). These generate
2804 proof obligations from the expression specification. After the
2805 obligations have been discharged, theorems of the expression are added
2806 to the theory, target locale or proof context. The synopsis of the
2807 commands is a follows:
2809 (1) interpretation expr inst
2810 (2) interpretation target < expr
2811 (3) interpret expr inst
2813 Interpretation in theories and proof contexts require a parameter
2814 instantiation of terms from the current context. This is applied to
2815 specifications and theorems of the interpreted expression.
2816 Interpretation in locales only permits parameter renaming through the
2817 locale expression. Interpretation is smart in that interpretations
2818 that are active already do not occur in proof obligations, neither are
2819 instantiated theorems stored in duplicate. Use 'print_interps' to
2820 inspect active interpretations of a particular locale. For details,
2821 see the Isar Reference manual. Examples can be found in
2822 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
2824 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
2825 'interpret' instead.
2827 * New context element 'constrains' for adding type constraints to
2830 * Context expressions: renaming of parameters with syntax
2833 * Locale declaration: 'includes' disallowed.
2835 * Proper static binding of attribute syntax -- i.e. types / terms /
2836 facts mentioned as arguments are always those of the locale definition
2837 context, independently of the context of later invocations. Moreover,
2838 locale operations (renaming and type / term instantiation) are applied
2839 to attribute arguments as expected.
2841 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
2842 actual attributes; rare situations may require Attrib.attribute to
2843 embed those attributes into Attrib.src that lack concrete syntax.
2844 Attribute implementations need to cooperate properly with the static
2845 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
2846 Attrib.XXX_thm etc. already do the right thing without further
2847 intervention. Only unusual applications -- such as "where" or "of"
2848 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
2849 on the context and the facts involved -- may have to assign parsed
2850 values to argument tokens explicitly.
2852 * Changed parameter management in theorem generation for long goal
2853 statements with 'includes'. INCOMPATIBILITY: produces a different
2854 theorem statement in rare situations.
2856 * Locale inspection command 'print_locale' omits notes elements. Use
2857 'print_locale!' to have them included in the output.
2862 * Provers/hypsubst.ML: improved version of the subst method, for
2863 single-step rewriting: it now works in bound variable contexts. New is
2864 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
2865 rewrite a different subterm than the original subst method, which is
2866 still available as 'simplesubst'.
2868 * Provers/quasi.ML: new transitivity reasoners for transitivity only
2871 * Provers/trancl.ML: new transitivity reasoner for transitive and
2872 reflexive-transitive closure of relations.
2874 * Provers/blast.ML: new reference depth_limit to make blast's depth
2875 limit (previously hard-coded with a value of 20) user-definable.
2877 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
2878 is peformed already. Object-logics merely need to finish their
2879 initial simpset configuration as before. INCOMPATIBILITY.
2884 * Symbolic syntax of Hilbert Choice Operator is now as follows:
2887 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
2889 The symbol \<some> is displayed as the alternative epsilon of LaTeX
2890 and x-symbol; use option '-m epsilon' to get it actually printed.
2891 Moreover, the mathematically important symbolic identifier \<epsilon>
2892 becomes available as variable, constant etc. INCOMPATIBILITY,
2894 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
2895 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
2896 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
2897 support corresponding Isar calculations.
2899 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
2902 * theory SetInterval: changed the syntax for open intervals:
2911 The old syntax is still supported but will disappear in the next
2912 release. For conversion use the following Emacs search and replace
2913 patterns (these are not perfect but work quite well):
2915 {)\([^\.]*\)\.\. -> {\1<\.\.}
2916 \.\.\([^(}]*\)(} -> \.\.<\1}
2918 * Theory Commutative_Ring (in Library): method comm_ring for proving
2919 equalities in commutative rings; method 'algebra' provides a generic
2922 * Theory Finite_Set: changed the syntax for 'setsum', summation over
2923 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
2924 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
2927 Some new syntax forms are available:
2929 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
2930 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
2931 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
2932 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
2934 The latter form "\<Sum>x < k. e" used to be based on a separate
2935 function "Summation", which has been discontinued.
2937 * theory Finite_Set: in structured induction proofs, the insert case
2938 is now 'case (insert x F)' instead of the old counterintuitive 'case
2941 * The 'refute' command has been extended to support a much larger
2942 fragment of HOL, including axiomatic type classes, constdefs and
2943 typedefs, inductive datatypes and recursion.
2945 * New tactics 'sat' and 'satx' to prove propositional tautologies.
2946 Requires zChaff with proof generation to be installed. See
2947 HOL/ex/SAT_Examples.thy for examples.
2949 * Datatype induction via method 'induct' now preserves the name of the
2950 induction variable. For example, when proving P(xs::'a list) by
2951 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
2952 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
2953 in unstructured proof scripts.
2955 * Reworked implementation of records. Improved scalability for
2956 records with many fields, avoiding performance problems for type
2957 inference. Records are no longer composed of nested field types, but
2958 of nested extension types. Therefore the record type only grows linear
2959 in the number of extensions and not in the number of fields. The
2960 top-level (users) view on records is preserved. Potential
2961 INCOMPATIBILITY only in strange cases, where the theory depends on the
2962 old record representation. The type generated for a record is called
2963 <record_name>_ext_type.
2965 Flag record_quick_and_dirty_sensitive can be enabled to skip the
2966 proofs triggered by a record definition or a simproc (if
2967 quick_and_dirty is enabled). Definitions of large records can take
2970 New simproc record_upd_simproc for simplification of multiple record
2971 updates enabled by default. Moreover, trivial updates are also
2972 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
2973 occasionally, since simplification is more powerful by default.
2975 * typedef: proper support for polymorphic sets, which contain extra
2976 type-variables in the term.
2978 * Simplifier: automatically reasons about transitivity chains
2979 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
2980 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
2981 old proofs break occasionally as simplification may now solve more
2982 goals than previously.
2984 * Simplifier: converts x <= y into x = y if assumption y <= x is
2985 present. Works for all partial orders (class "order"), in particular
2986 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
2989 * Simplifier: new simproc for "let x = a in f x". If a is a free or
2990 bound variable or a constant then the let is unfolded. Otherwise
2991 first a is simplified to b, and then f b is simplified to g. If
2992 possible we abstract b from g arriving at "let x = b in h x",
2993 otherwise we unfold the let and arrive at g. The simproc can be
2994 enabled/disabled by the reference use_let_simproc. Potential
2995 INCOMPATIBILITY since simplification is more powerful by default.
2997 * Classical reasoning: the meson method now accepts theorems as arguments.
2999 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
3000 jobs to provide advice on the provability of subgoals.
3002 * Theory OrderedGroup and Ring_and_Field: various additions and
3003 improvements to faciliate calculations involving equalities and
3006 The following theorems have been eliminated or modified
3009 abs_eq now named abs_of_nonneg
3010 abs_of_ge_0 now named abs_of_nonneg
3011 abs_minus_eq now named abs_of_nonpos
3012 imp_abs_id now named abs_of_nonneg
3013 imp_abs_neg_id now named abs_of_nonpos
3014 mult_pos now named mult_pos_pos
3015 mult_pos_le now named mult_nonneg_nonneg
3016 mult_pos_neg_le now named mult_nonneg_nonpos
3017 mult_pos_neg2_le now named mult_nonneg_nonpos2
3018 mult_neg now named mult_neg_neg
3019 mult_neg_le now named mult_nonpos_nonpos
3021 * The following lemmas in Ring_and_Field have been added to the simplifier:
3024 not_square_less_zero
3026 The following lemmas have been deleted from Real/RealPow:
3036 * Theory Parity: added rules for simplifying exponents.
3040 The following theorems have been eliminated or modified
3043 list_all_Nil now named list_all.simps(1)
3044 list_all_Cons now named list_all.simps(2)
3045 list_all_conv now named list_all_iff
3046 set_mem_eq now named mem_iff
3048 * Theories SetsAndFunctions and BigO (see HOL/Library) support
3049 asymptotic "big O" calculations. See the notes in BigO.thy.
3054 * Theory RealDef: better support for embedding natural numbers and
3055 integers in the reals.
3057 The following theorems have been eliminated or modified
3060 exp_ge_add_one_self now requires no hypotheses
3061 real_of_int_add reversed direction of equality (use [symmetric])
3062 real_of_int_minus reversed direction of equality (use [symmetric])
3063 real_of_int_diff reversed direction of equality (use [symmetric])
3064 real_of_int_mult reversed direction of equality (use [symmetric])
3066 * Theory RComplete: expanded support for floor and ceiling functions.
3068 * Theory Ln is new, with properties of the natural logarithm
3070 * Hyperreal: There is a new type constructor "star" for making
3071 nonstandard types. The old type names are now type synonyms:
3075 hcomplex = complex star
3077 * Hyperreal: Many groups of similarly-defined constants have been
3078 replaced by polymorphic versions (INCOMPATIBILITY):
3080 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
3082 starset <-- starsetNat, starsetC
3083 *s* <-- *sNat*, *sc*
3084 starset_n <-- starsetNat_n, starsetC_n
3085 *sn* <-- *sNatn*, *scn*
3086 InternalSets <-- InternalNatSets, InternalCSets
3088 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3089 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
3090 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
3091 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
3092 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
3094 * Hyperreal: Many type-specific theorems have been removed in favor of
3095 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
3097 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
3098 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
3099 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
3100 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
3101 right_minus <-- hypreal_add_minus
3102 left_minus <-- {hypreal,hcomplex}_add_minus_left
3103 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
3104 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
3105 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
3106 mult_1_right <-- hcomplex_mult_one_right
3107 mult_zero_left <-- hcomplex_mult_zero_left
3108 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
3109 right_distrib <-- hypnat_add_mult_distrib2
3110 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
3111 right_inverse <-- hypreal_mult_inverse
3112 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
3113 order_refl <-- {hypreal,hypnat}_le_refl
3114 order_trans <-- {hypreal,hypnat}_le_trans
3115 order_antisym <-- {hypreal,hypnat}_le_anti_sym
3116 order_less_le <-- {hypreal,hypnat}_less_le
3117 linorder_linear <-- {hypreal,hypnat}_le_linear
3118 add_left_mono <-- {hypreal,hypnat}_add_left_mono
3119 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
3120 add_nonneg_nonneg <-- hypreal_le_add_order
3122 * Hyperreal: Separate theorems having to do with type-specific
3123 versions of constants have been merged into theorems that apply to the
3124 new polymorphic constants (INCOMPATIBILITY):
3126 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
3127 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
3128 STAR_Un <-- {STAR,NatStar,STARC}_Un
3129 STAR_Int <-- {STAR,NatStar,STARC}_Int
3130 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
3131 STAR_subset <-- {STAR,NatStar,STARC}_subset
3132 STAR_mem <-- {STAR,NatStar,STARC}_mem
3133 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
3134 STAR_diff <-- {STAR,STARC}_diff
3135 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
3136 STARC_hcomplex_of_complex}_image_subset
3137 starset_n_Un <-- starset{Nat,C}_n_Un
3138 starset_n_Int <-- starset{Nat,C}_n_Int
3139 starset_n_Compl <-- starset{Nat,C}_n_Compl
3140 starset_n_diff <-- starset{Nat,C}_n_diff
3141 InternalSets_Un <-- Internal{Nat,C}Sets_Un
3142 InternalSets_Int <-- Internal{Nat,C}Sets_Int
3143 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
3144 InternalSets_diff <-- Internal{Nat,C}Sets_diff
3145 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
3146 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
3147 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
3148 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
3149 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
3150 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3151 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
3152 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
3153 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
3154 starfun_diff <-- starfun{C,RC,CR}_diff
3155 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
3156 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
3157 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
3158 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
3159 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
3160 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
3161 starfun_Id <-- starfunC_Id
3162 starfun_approx <-- starfun{Nat,CR}_approx
3163 starfun_capprox <-- starfun{C,RC}_capprox
3164 starfun_abs <-- starfunNat_rabs
3165 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
3166 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
3167 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
3168 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
3169 starfun_add_capprox <-- starfun{C,RC}_add_capprox
3170 starfun_add_approx <-- starfunCR_add_approx
3171 starfun_inverse_inverse <-- starfunC_inverse_inverse
3172 starfun_divide <-- starfun{C,CR,RC}_divide
3173 starfun_n <-- starfun{Nat,C}_n
3174 starfun_n_mult <-- starfun{Nat,C}_n_mult
3175 starfun_n_add <-- starfun{Nat,C}_n_add
3176 starfun_n_add_minus <-- starfunNat_n_add_minus
3177 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
3178 starfun_n_minus <-- starfun{Nat,C}_n_minus
3179 starfun_n_eq <-- starfun{Nat,C}_n_eq
3181 star_n_add <-- {hypreal,hypnat,hcomplex}_add
3182 star_n_minus <-- {hypreal,hcomplex}_minus
3183 star_n_diff <-- {hypreal,hcomplex}_diff
3184 star_n_mult <-- {hypreal,hcomplex}_mult
3185 star_n_inverse <-- {hypreal,hcomplex}_inverse
3186 star_n_le <-- {hypreal,hypnat}_le
3187 star_n_less <-- {hypreal,hypnat}_less
3188 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
3189 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
3190 star_n_abs <-- hypreal_hrabs
3191 star_n_divide <-- hcomplex_divide
3193 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
3194 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
3195 star_of_diff <-- hypreal_of_real_diff
3196 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
3197 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
3198 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
3199 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
3200 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
3201 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
3202 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
3203 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
3204 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
3205 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
3206 star_of_number_of <-- {hypreal,hcomplex}_number_of
3207 star_of_number_less <-- number_of_less_hypreal_of_real_iff
3208 star_of_number_le <-- number_of_le_hypreal_of_real_iff
3209 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
3210 star_of_less_number <-- hypreal_of_real_less_number_of_iff
3211 star_of_le_number <-- hypreal_of_real_le_number_of_iff
3212 star_of_power <-- hypreal_of_real_power
3213 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
3215 * Hyperreal: new method "transfer" that implements the transfer
3216 principle of nonstandard analysis. With a subgoal that mentions
3217 nonstandard types like "'a star", the command "apply transfer"
3218 replaces it with an equivalent one that mentions only standard types.
3219 To be successful, all free variables must have standard types; non-
3220 standard variables must have explicit universal quantifiers.
3222 * Hyperreal: A theory of Taylor series.
3227 * Discontinued special version of 'constdefs' (which used to support
3228 continuous functions) in favor of the general Pure one with full
3231 * New simplification procedure for solving continuity conditions; it
3232 is much faster on terms with many nested lambda abstractions (cubic
3233 instead of exponential time).
3235 * New syntax for domain package: selector names are now optional.
3236 Parentheses should be omitted unless argument is lazy, for example:
3238 domain 'a stream = cons "'a" (lazy "'a stream")
3240 * New command 'fixrec' for defining recursive functions with pattern
3241 matching; defining multiple functions with mutual recursion is also
3242 supported. Patterns may include the constants cpair, spair, up, sinl,
3243 sinr, or any data constructor defined by the domain package. The given
3244 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
3245 syntax and examples.
3247 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
3248 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
3249 but the proof obligation additionally includes an admissibility
3250 requirement. The packages generate instances of class cpo or pcpo,
3251 with continuity and strictness theorems for Rep and Abs.
3253 * HOLCF: Many theorems have been renamed according to a more standard naming
3254 scheme (INCOMPATIBILITY):
3256 foo_inject: "foo$x = foo$y ==> x = y"
3257 foo_eq: "(foo$x = foo$y) = (x = y)"
3258 foo_less: "(foo$x << foo$y) = (x << y)"
3259 foo_strict: "foo$UU = UU"
3260 foo_defined: "... ==> foo$x ~= UU"
3261 foo_defined_iff: "(foo$x = UU) = (x = UU)"
3266 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
3267 including the First Isomorphism Theorem (on quotienting by the kernel
3270 * ZF/Simplifier: install second copy of type solver that actually
3271 makes use of TC rules declared to Isar proof contexts (or locales);
3272 the old version is still required for ML proof scripts.
3277 * Converted to Isar theory format; use locales instead of axiomatic
3283 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
3286 * Pure/library.ML no longer defines its own option datatype, but uses
3287 that of the SML basis, which has constructors NONE and SOME instead of
3288 None and Some, as well as exception Option.Option instead of OPTION.
3289 The functions the, if_none, is_some, is_none have been adapted
3290 accordingly, while Option.map replaces apsome.
3292 * Pure/library.ML: the exception LIST has been given up in favour of
3293 the standard exceptions Empty and Subscript, as well as
3294 Library.UnequalLengths. Function like Library.hd and Library.tl are
3295 superceded by the standard hd and tl functions etc.
3297 A number of basic list functions are no longer exported to the ML
3298 toplevel, as they are variants of predefined functions. The following
3299 suggests how one can translate existing code:
3301 rev_append xs ys = List.revAppend (xs, ys)
3302 nth_elem (i, xs) = List.nth (xs, i)
3303 last_elem xs = List.last xs
3304 flat xss = List.concat xss
3305 seq fs = List.app fs
3306 partition P xs = List.partition P xs
3307 mapfilter f xs = List.mapPartial f xs
3309 * Pure/library.ML: several combinators for linear functional
3310 transformations, notably reverse application and composition:
3313 (x, y) |-> f f #-> g
3315 * Pure/library.ML: introduced/changed precedence of infix operators:
3317 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
3319 infix 3 o oo ooo oooo;
3320 infix 4 ~~ upto downto;
3322 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
3325 * Pure/library.ML: natural list combinators fold, fold_rev, and
3326 fold_map support linear functional transformations and nesting. For
3329 fold f [x1, ..., xN] y =
3330 y |> f x1 |> ... |> f xN
3332 (fold o fold) f [xs1, ..., xsN] y =
3333 y |> fold f xs1 |> ... |> fold f xsN
3335 fold f [x1, ..., xN] =
3338 (fold o fold) f [xs1, ..., xsN] =
3339 fold f xs1 #> ... #> fold f xsN
3341 * Pure/library.ML: the following selectors on type 'a option are
3344 the: 'a option -> 'a (*partial*)
3345 these: 'a option -> 'a where 'a = 'b list
3346 the_default: 'a -> 'a option -> 'a
3347 the_list: 'a option -> 'a list
3349 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
3350 basic operations for association lists, following natural argument
3351 order; moreover the explicit equality predicate passed here avoids
3352 potentially expensive polymorphic runtime equality checks.
3353 The old functions may be expressed as follows:
3355 assoc = uncurry (AList.lookup (op =))
3356 assocs = these oo AList.lookup (op =)
3357 overwrite = uncurry (AList.update (op =)) o swap
3359 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
3361 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
3362 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
3364 replacing make_keylist and keyfilter (occassionally used)
3367 make_keylist = AList.make
3368 keyfilter = AList.find (op =)
3370 * eq_fst and eq_snd now take explicit equality parameter, thus
3371 avoiding eqtypes. Naive rewrites:
3373 eq_fst = eq_fst (op =)
3374 eq_snd = eq_snd (op =)
3376 * Removed deprecated apl and apr (rarely used).
3379 apl (n, op) =>>= curry op n
3380 apr (op, m) =>>= fn n => op (n, m)
3382 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
3383 provides a reasonably efficient light-weight implementation of sets as
3386 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
3387 few new operations; existing lookup and update are now curried to
3388 follow natural argument order (for use with fold etc.);
3389 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
3391 * Pure/General: output via the Isabelle channels of
3392 writeln/warning/error etc. is now passed through Output.output, with a
3393 hook for arbitrary transformations depending on the print_mode
3394 (cf. Output.add_mode -- the first active mode that provides a output
3395 function wins). Already formatted output may be embedded into further
3396 text via Output.raw; the result of Pretty.string_of/str_of and derived
3397 functions (string_of_term/cterm/thm etc.) is already marked raw to
3398 accommodate easy composition of diagnostic messages etc. Programmers
3399 rarely need to care about Output.output or Output.raw at all, with
3400 some notable exceptions: Output.output is required when bypassing the
3401 standard channels (writeln etc.), or in token translations to produce
3402 properly formatted results; Output.raw is required when capturing
3403 already output material that will eventually be presented to the user
3404 a second time. For the default print mode, both Output.output and
3405 Output.raw have no effect.
3407 * Pure/General: Output.time_accumulator NAME creates an operator ('a
3408 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
3409 cumulative results are displayed at the end of a batch session.
3411 * Pure/General: File.sysify_path and File.quote_sysify path have been
3412 replaced by File.platform_path and File.shell_path (with appropriate
3413 hooks). This provides a clean interface for unusual systems where the
3414 internal and external process view of file names are different.
3416 * Pure: more efficient orders for basic syntactic entities: added
3417 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
3418 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
3419 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
3420 orders now -- potential INCOMPATIBILITY for code that depends on a
3421 particular order for Symtab.keys, Symtab.dest, etc. (consider using
3422 Library.sort_strings on result).
3424 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
3425 fold_types traverse types/terms from left to right, observing natural
3426 argument order. Supercedes previous foldl_XXX versions, add_frees,
3427 add_vars etc. have been adapted as well: INCOMPATIBILITY.
3429 * Pure: name spaces have been refined, with significant changes of the
3430 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
3431 to extern(_table). The plain name entry path is superceded by a
3432 general 'naming' context, which also includes the 'policy' to produce
3433 a fully qualified name and external accesses of a fully qualified
3434 name; NameSpace.extend is superceded by context dependent
3435 Sign.declare_name. Several theory and proof context operations modify
3436 the naming context. Especially note Theory.restore_naming and
3437 ProofContext.restore_naming to get back to a sane state; note that
3438 Theory.add_path is no longer sufficient to recover from
3439 Theory.absolute_path in particular.
3441 * Pure: new flags short_names (default false) and unique_names
3442 (default true) for controlling output of qualified names. If
3443 short_names is set, names are printed unqualified. If unique_names is
3444 reset, the name prefix is reduced to the minimum required to achieve
3445 the original result when interning again, even if there is an overlap
3446 with earlier declarations.
3448 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
3449 now 'extend', and 'merge' gets an additional Pretty.pp argument
3450 (useful for printing error messages). INCOMPATIBILITY.
3452 * Pure: major reorganization of the theory context. Type Sign.sg and
3453 Theory.theory are now identified, referring to the universal
3454 Context.theory (see Pure/context.ML). Actual signature and theory
3455 content is managed as theory data. The old code and interfaces were
3456 spread over many files and structures; the new arrangement introduces
3457 considerable INCOMPATIBILITY to gain more clarity:
3459 Context -- theory management operations (name, identity, inclusion,
3460 parents, ancestors, merge, etc.), plus generic theory data;
3462 Sign -- logical signature and syntax operations (declaring consts,
3463 types, etc.), plus certify/read for common entities;
3465 Theory -- logical theory operations (stating axioms, definitions,
3466 oracles), plus a copy of logical signature operations (consts,
3467 types, etc.); also a few basic management operations (Theory.copy,
3470 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
3471 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
3472 for convenience -- they merely return the theory.
3474 * Pure: type Type.tsig is superceded by theory in most interfaces.
3476 * Pure: the Isar proof context type is already defined early in Pure
3477 as Context.proof (note that ProofContext.context and Proof.context are
3478 aliases, where the latter is the preferred name). This enables other
3479 Isabelle components to refer to that type even before Isar is present.
3481 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
3482 typeK, constK, axiomK, oracleK), but provide explicit operations for
3483 any of these kinds. For example, Sign.intern typeK is now
3484 Sign.intern_type, Theory.hide_space Sign.typeK is now
3485 Theory.hide_types. Also note that former
3486 Theory.hide_classes/types/consts are now
3487 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
3488 internalize their arguments! INCOMPATIBILITY.
3490 * Pure: get_thm interface (of PureThy and ProofContext) expects
3491 datatype thmref (with constructors Name and NameSelection) instead of
3492 plain string -- INCOMPATIBILITY;
3494 * Pure: cases produced by proof methods specify options, where NONE
3495 means to remove case bindings -- INCOMPATIBILITY in
3498 * Pure: the following operations retrieve axioms or theorems from a
3499 theory node or theory hierarchy, respectively:
3501 Theory.axioms_of: theory -> (string * term) list
3502 Theory.all_axioms_of: theory -> (string * term) list
3503 PureThy.thms_of: theory -> (string * thm) list
3504 PureThy.all_thms_of: theory -> (string * thm) list
3506 * Pure: print_tac now outputs the goal through the trace channel.
3508 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
3509 Reference Toplevel.debug (default false) controls detailed printing
3510 and tracing of low-level exceptions; Toplevel.profiling (default 0)
3511 controls execution profiling -- set to 1 for time and 2 for space
3512 (both increase the runtime).
3514 * Isar session: The initial use of ROOT.ML is now always timed,
3515 i.e. the log will show the actual process times, in contrast to the
3516 elapsed wall-clock time that the outer shell wrapper produces.
3518 * Simplifier: improved handling of bound variables (nameless
3519 representation, avoid allocating new strings). Simprocs that invoke
3520 the Simplifier recursively should use Simplifier.inherit_bounds to
3521 avoid local name clashes. Failure to do so produces warnings
3522 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
3523 for further details.
3525 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
3526 bindings for all theorems stored within a given theory; this may help
3527 in porting non-Isar theories to Isar ones, while keeping ML proof
3528 scripts for the time being.
3530 * ML operator HTML.with_charset specifies the charset begin used for
3531 generated HTML files. For example:
3533 HTML.with_charset "utf-8" use_thy "Hebrew";
3534 HTML.with_charset "utf-8" use_thy "Chinese";
3539 * Allow symlinks to all proper Isabelle executables (Isabelle,
3540 isabelle, isatool etc.).
3542 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
3543 isatool doc, isatool mkdir, display_drafts etc.).
3545 * isatool usedir: option -f allows specification of the ML file to be
3546 used by Isabelle; default is ROOT.ML.
3548 * New isatool version outputs the version identifier of the Isabelle
3549 distribution being used.
3551 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
3552 (containing Boolean satisfiability problems) into Isabelle/HOL
3557 New in Isabelle2004 (April 2004)
3558 --------------------------------
3562 * Provers/order.ML: new efficient reasoner for partial and linear orders.
3563 Replaces linorder.ML.
3565 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
3566 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
3567 (\<a>...\<z>), are now considered normal letters, and can therefore
3568 be used anywhere where an ASCII letter (a...zA...Z) has until
3569 now. COMPATIBILITY: This obviously changes the parsing of some
3570 terms, especially where a symbol has been used as a binder, say
3571 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
3572 as an identifier. Fix it by inserting a space around former
3573 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
3574 existing theory and ML files.
3576 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
3578 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
3579 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
3580 a normal (but invisible) letter. For multiple letter subscripts repeat
3581 \<^isub> like this: x\<^isub>1\<^isub>2.
3583 * Pure: There are now sub-/superscripts that can span more than one
3584 character. Text between \<^bsub> and \<^esub> is set in subscript in
3585 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
3586 superscript. The new control characters are not identifier parts.
3588 * Pure: Control-symbols of the form \<^raw:...> will literally print the
3589 content of "..." to the latex file instead of \isacntrl... . The "..."
3590 may consist of any printable characters excluding the end bracket >.
3592 * Pure: Using new Isar command "finalconsts" (or the ML functions
3593 Theory.add_finals or Theory.add_finals_i) it is now possible to
3594 declare constants "final", which prevents their being given a definition
3595 later. It is useful for constants whose behaviour is fixed axiomatically
3596 rather than definitionally, such as the meta-logic connectives.
3598 * Pure: 'instance' now handles general arities with general sorts
3599 (i.e. intersections of classes),
3601 * Presentation: generated HTML now uses a CSS style sheet to make layout
3602 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
3603 It can be changed to alter the colors/layout of generated pages.
3608 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
3609 cut_tac, subgoal_tac and thin_tac:
3610 - Now understand static (Isar) contexts. As a consequence, users of Isar
3611 locales are no longer forced to write Isar proof scripts.
3612 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
3614 - INCOMPATIBILITY: names of variables to be instantiated may no
3615 longer be enclosed in quotes. Instead, precede variable name with `?'.
3616 This is consistent with the instantiation attribute "where".
3618 * Attributes "where" and "of":
3619 - Now take type variables of instantiated theorem into account when reading
3620 the instantiation string. This fixes a bug that caused instantiated
3621 theorems to have too special types in some circumstances.
3622 - "where" permits explicit instantiations of type variables.
3624 * Calculation commands "moreover" and "also" no longer interfere with
3625 current facts ("this"), admitting arbitrary combinations with "then"
3629 - Goal statements involving the context element "includes" no longer
3630 generate theorems with internal delta predicates (those ending on
3631 "_axioms") in the premise.
3632 Resolve particular premise with <locale>.intro to obtain old form.
3633 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
3634 specification and "includes" elements in goal statement.
3635 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
3636 [intro?] and [elim?] (respectively) by default.
3637 - Experimental command for instantiation of locales in proof contexts:
3638 instantiate <label>[<attrs>]: <loc>
3639 Instantiates locale <loc> and adds all its theorems to the current context
3640 taking into account their attributes. Label and attrs are optional
3641 modifiers, like in theorem declarations. If present, names of
3642 instantiated theorems are qualified with <label>, and the attributes
3643 <attrs> are applied after any attributes these theorems might have already.
3644 If the locale has assumptions, a chained fact of the form
3645 "<loc> t1 ... tn" is expected from which instantiations of the parameters
3646 are derived. The command does not support old-style locales declared
3647 with "locale (open)".
3648 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
3650 * HOL: Tactic emulation methods induct_tac and case_tac understand static
3656 * Proof import: new image HOL4 contains the imported library from
3657 the HOL4 system with about 2500 theorems. It is imported by
3658 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
3659 can be used like any other Isabelle image. See
3660 HOL/Import/HOL/README for more information.
3663 - Much improved handling of linear and partial orders.
3664 Reasoners for linear and partial orders are set up for type classes
3665 "linorder" and "order" respectively, and are added to the default simpset
3666 as solvers. This means that the simplifier can build transitivity chains
3667 to solve goals from the assumptions.
3668 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
3669 of blast or auto after simplification become unnecessary because the goal
3670 is solved by simplification already.
3672 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
3673 all proved in axiomatic type classes for semirings, rings and fields.
3676 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
3677 now formalized using the Ring_and_Field theory mentioned above.
3678 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
3679 than before, because now they are set up once in a generic manner.
3680 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
3681 Look for the general versions in Ring_and_Field (and Power if they concern
3684 * Type "rat" of the rational numbers is now available in HOL-Complex.
3687 - Record types are now by default printed with their type abbreviation
3688 instead of the list of all field types. This can be configured via
3689 the reference "print_record_type_abbr".
3690 - Simproc "record_upd_simproc" for simplification of multiple updates added
3691 (not enabled by default).
3692 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
3693 EX x. x = sel r to True (not enabled by default).
3694 - Tactic "record_split_simp_tac" to split and simplify records added.
3696 * 'specification' command added, allowing for definition by
3697 specification. There is also an 'ax_specification' command that
3698 introduces the new constants axiomatically.
3700 * arith(_tac) is now able to generate counterexamples for reals as well.
3702 * HOL-Algebra: new locale "ring" for non-commutative rings.
3704 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
3705 definitions, thanks to Sava Krsti\'{c} and John Matthews.
3707 * HOL-Matrix: a first theory for matrices in HOL with an application of
3708 matrix theory to linear programming.
3710 * Unions and Intersections:
3711 The latex output syntax of UN and INT has been changed
3712 from "\Union x \in A. B" to "\Union_{x \in A} B"
3713 i.e. the index formulae has become a subscript.
3714 Similarly for "\Union x. B", and for \Inter instead of \Union.
3716 * Unions and Intersections over Intervals:
3717 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
3718 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
3719 like in normal math, and corresponding versions for < and for intersection.
3721 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
3722 lexicographic dictonary ordering has been added as "lexord".
3724 * ML: the legacy theory structures Int and List have been removed. They had
3725 conflicted with ML Basis Library structures having the same names.
3727 * 'refute' command added to search for (finite) countermodels. Only works
3728 for a fragment of HOL. The installation of an external SAT solver is
3729 highly recommended. See "HOL/Refute.thy" for details.
3731 * 'quickcheck' command: Allows to find counterexamples by evaluating
3732 formulae under an assignment of free variables to random values.
3733 In contrast to 'refute', it can deal with inductive datatypes,
3734 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
3740 * Streams now come with concatenation and are part of the HOLCF image
3744 New in Isabelle2003 (May 2003)
3745 ------------------------------
3749 * Provers/simplifier:
3751 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
3752 Assumptions are now subject to complete mutual simplification,
3753 not just from left to right. The simplifier now preserves
3754 the order of assumptions.
3756 Potential INCOMPATIBILITY:
3758 -- simp sometimes diverges where the old version did
3759 not, e.g. invoking simp on the goal
3761 [| P (f x); y = x; f x = f y |] ==> Q
3763 now gives rise to the infinite reduction sequence
3765 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
3767 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
3770 -- Tactics combining classical reasoner and simplification (such as auto)
3771 are also affected by this change, because many of them rely on
3772 simp. They may sometimes diverge as well or yield a different numbers
3773 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
3774 in case of problems. Sometimes subsequent calls to the classical
3775 reasoner will fail because a preceeding call to the simplifier too
3776 eagerly simplified the goal, e.g. deleted redundant premises.
3778 - The simplifier trace now shows the names of the applied rewrite rules
3780 - You can limit the number of recursive invocations of the simplifier
3781 during conditional rewriting (where the simplifie tries to solve the
3782 conditions before applying the rewrite rule):
3783 ML "simp_depth_limit := n"
3784 where n is an integer. Thus you can force termination where previously
3785 the simplifier would diverge.
3787 - Accepts free variables as head terms in congruence rules. Useful in Isar.
3789 - No longer aborts on failed congruence proof. Instead, the
3790 congruence is ignored.
3792 * Pure: New generic framework for extracting programs from constructive
3793 proofs. See HOL/Extraction.thy for an example instantiation, as well
3794 as HOL/Extraction for some case studies.
3796 * Pure: The main goal of the proof state is no longer shown by default, only
3797 the subgoals. This behaviour is controlled by a new flag.
3798 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
3799 (ML: Proof.show_main_goal).
3801 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
3802 rules whose conclusion matches subgoal 1:
3803 PG menu: Isabelle/Isar -> Show me -> matching rules
3804 The rules are ordered by how closely they match the subgoal.
3805 In particular, rules that solve a subgoal outright are displayed first
3806 (or rather last, the way they are printed).
3807 (ML: ProofGeneral.print_intros())
3809 * Pure: New flag trace_unify_fail causes unification to print
3810 diagnostic information (PG: in trace buffer) when it fails. This is
3811 useful for figuring out why single step proofs like rule, erule or
3814 * Pure: Locale specifications now produce predicate definitions
3815 according to the body of text (covering assumptions modulo local
3816 definitions); predicate "loc_axioms" covers newly introduced text,
3817 while "loc" is cumulative wrt. all included locale expressions; the
3818 latter view is presented only on export into the global theory
3819 context; potential INCOMPATIBILITY, use "(open)" option to fall back
3820 on the old view without predicates;
3822 * Pure: predefined locales "var" and "struct" are useful for sharing
3823 parameters (as in CASL, for example); just specify something like
3824 ``var x + var y + struct M'' as import;
3826 * Pure: improved thms_containing: proper indexing of facts instead of
3827 raw theorems; check validity of results wrt. current name space;
3828 include local facts of proof configuration (also covers active
3829 locales), cover fixed variables in index; may use "_" in term
3830 specification; an optional limit for the number of printed facts may
3831 be given (the default is 40);
3833 * Pure: disallow duplicate fact bindings within new-style theory files
3836 * Provers: improved induct method: assumptions introduced by case
3837 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
3838 the goal statement); "foo" still refers to all facts collectively;
3840 * Provers: the function blast.overloaded has been removed: all constants
3841 are regarded as potentially overloaded, which improves robustness in exchange
3842 for slight decrease in efficiency;
3844 * Provers/linorder: New generic prover for transitivity reasoning over
3845 linear orders. Note: this prover is not efficient!
3847 * Isar: preview of problems to finish 'show' now produce an error
3848 rather than just a warning (in interactive mode);
3855 - Produces a counter example if it cannot prove a goal.
3856 Note that the counter example may be spurious if the goal is not a formula
3857 of quantifier-free linear arithmetic.
3858 In ProofGeneral the counter example appears in the trace buffer.
3860 - Knows about div k and mod k where k is a numeral of type nat or int.
3862 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
3863 linear arithmetic fails. This takes account of quantifiers and divisibility.
3864 Presburger arithmetic can also be called explicitly via presburger(_tac).
3866 * simp's arithmetic capabilities have been enhanced a bit: it now
3867 takes ~= in premises into account (by performing a case split);
3869 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
3870 are distributed over a sum of terms;
3872 * New tactic "trans_tac" and method "trans" instantiate
3873 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
3876 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
3877 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
3879 * 'typedef' command has new option "open" to suppress the set
3882 * functions Min and Max on finite sets have been introduced (theory
3885 * attribute [symmetric] now works for relations as well; it turns
3886 (x,y) : R^-1 into (y,x) : R, and vice versa;
3888 * induct over a !!-quantified statement (say !!x1..xn):
3889 each "case" automatically performs "fix x1 .. xn" with exactly those names.
3891 * Map: `empty' is no longer a constant but a syntactic abbreviation for
3892 %x. None. Warning: empty_def now refers to the previously hidden definition
3895 * Algebra: formalization of classical algebra. Intended as base for
3896 any algebraic development in Isabelle. Currently covers group theory
3897 (up to Sylow's theorem) and ring theory (Universal Property of
3898 Univariate Polynomials). Contributions welcome;
3900 * GroupTheory: deleted, since its material has been moved to Algebra;
3902 * Complex: new directory of the complex numbers with numeric constants,
3903 nonstandard complex numbers, and some complex analysis, standard and
3904 nonstandard (Jacques Fleuriot);
3906 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
3908 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
3911 * Real/HahnBanach: updated and adapted to locales;
3913 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
3916 * UNITY: added the Meier-Sanders theory of progress sets;
3918 * MicroJava: bytecode verifier and lightweight bytecode verifier
3919 as abstract algorithms, instantiated to the JVM;
3921 * Bali: Java source language formalization. Type system, operational
3922 semantics, axiomatic semantics. Supported language features:
3923 classes, interfaces, objects,virtual methods, static methods,
3924 static/instance fields, arrays, access modifiers, definite
3925 assignment, exceptions.
3930 * ZF/Constructible: consistency proof for AC (Gdel's constructible
3933 * Main ZF: virtually all theories converted to new-style format;
3938 * Pure: Tactic.prove provides sane interface for internal proofs;
3939 omits the infamous "standard" operation, so this is more appropriate
3940 than prove_goalw_cterm in many situations (e.g. in simprocs);
3942 * Pure: improved error reporting of simprocs;
3944 * Provers: Simplifier.simproc(_i) provides sane interface for setting
3948 *** Document preparation ***
3950 * uses \par instead of \\ for line breaks in theory text. This may
3951 shift some page breaks in large documents. To get the old behaviour
3952 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
3954 * minimized dependencies of isabelle.sty and isabellesym.sty on
3957 * \<euro> now needs package babel/greek instead of marvosym (which
3960 * normal size for \<zero>...\<nine> (uses \mathbf instead of
3965 New in Isabelle2002 (March 2002)
3966 --------------------------------
3968 *** Document preparation ***
3970 * greatly simplified document preparation setup, including more
3971 graceful interpretation of isatool usedir -i/-d/-D options, and more
3972 instructive isatool mkdir; users should basically be able to get
3973 started with "isatool mkdir HOL Test && isatool make"; alternatively,
3974 users may run a separate document processing stage manually like this:
3975 "isatool usedir -D output HOL Test && isatool document Test/output";
3977 * theory dependency graph may now be incorporated into documents;
3978 isatool usedir -g true will produce session_graph.eps/.pdf for use
3979 with \includegraphics of LaTeX;
3981 * proper spacing of consecutive markup elements, especially text
3982 blocks after section headings;
3984 * support bold style (for single symbols only), input syntax is like
3985 this: "\<^bold>\<alpha>" or "\<^bold>A";
3987 * \<bullet> is now output as bold \cdot by default, which looks much
3988 better in printed text;
3990 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
3991 note that these symbols are currently unavailable in Proof General /
3992 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
3994 * isatool latex no longer depends on changed TEXINPUTS, instead
3995 isatool document copies the Isabelle style files to the target
4001 * Pure/Provers: improved proof by cases and induction;
4002 - 'case' command admits impromptu naming of parameters (such as
4004 - 'induct' method divinates rule instantiation from the inductive
4005 claim; no longer requires excessive ?P bindings for proper
4006 instantiation of cases;
4007 - 'induct' method properly enumerates all possibilities of set/type
4008 rules; as a consequence facts may be also passed through *type*
4009 rules without further ado;
4010 - 'induct' method now derives symbolic cases from the *rulified*
4011 rule (before it used to rulify cases stemming from the internal
4012 atomized version); this means that the context of a non-atomic
4013 statement becomes is included in the hypothesis, avoiding the
4014 slightly cumbersome show "PROP ?case" form;
4015 - 'induct' may now use elim-style induction rules without chaining
4016 facts, using ``missing'' premises from the goal state; this allows
4017 rules stemming from inductive sets to be applied in unstructured
4018 scripts, while still benefitting from proper handling of non-atomic
4019 statements; NB: major inductive premises need to be put first, all
4020 the rest of the goal is passed through the induction;
4021 - 'induct' proper support for mutual induction involving non-atomic
4022 rule statements (uses the new concept of simultaneous goals, see
4024 - append all possible rule selections, but only use the first
4025 success (no backtracking);
4026 - removed obsolete "(simplified)" and "(stripped)" options of methods;
4027 - undeclared rule case names default to numbers 1, 2, 3, ...;
4028 - added 'print_induct_rules' (covered by help item in recent Proof
4030 - moved induct/cases attributes to Pure, methods to Provers;
4031 - generic method setup instantiated for FOL and HOL;
4033 * Pure: support multiple simultaneous goal statements, for example
4034 "have a: A and b: B" (same for 'theorem' etc.); being a pure
4035 meta-level mechanism, this acts as if several individual goals had
4036 been stated separately; in particular common proof methods need to be
4037 repeated in order to cover all claims; note that a single elimination
4038 step is *not* sufficient to establish the two conjunctions, so this
4041 assume "A & B" then have A and B .. (*".." fails*)
4043 better use "obtain" in situations as above; alternative refer to
4044 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
4046 * Pure: proper integration with ``locales''; unlike the original
4047 version by Florian Kammller, Isar locales package high-level proof
4048 contexts rather than raw logical ones (e.g. we admit to include
4049 attributes everywhere); operations on locales include merge and
4050 rename; support for implicit arguments (``structures''); simultaneous
4051 type-inference over imports and text; see also HOL/ex/Locales.thy for
4054 * Pure: the following commands have been ``localized'', supporting a
4055 target locale specification "(in name)": 'lemma', 'theorem',
4056 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
4057 stored both within the locale and at the theory level (exported and
4058 qualified by the locale name);
4060 * Pure: theory goals may now be specified in ``long'' form, with
4061 ad-hoc contexts consisting of arbitrary locale elements. for example
4062 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
4063 definitions may be given, too); the result is a meta-level rule with
4064 the context elements being discharged in the obvious way;
4066 * Pure: new proof command 'using' allows to augment currently used
4067 facts after a goal statement ('using' is syntactically analogous to
4068 'apply', but acts on the goal's facts only); this allows chained facts
4069 to be separated into parts given before and after a claim, as in
4070 ``from a and b have C using d and e <proof>'';
4072 * Pure: renamed "antecedent" case to "rule_context";
4074 * Pure: new 'judgment' command records explicit information about the
4075 object-logic embedding (used by several tools internally); no longer
4076 use hard-wired "Trueprop";
4078 * Pure: added 'corollary' command;
4080 * Pure: fixed 'token_translation' command;
4082 * Pure: removed obsolete 'exported' attribute;
4084 * Pure: dummy pattern "_" in is/let is now automatically lifted over
4085 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
4086 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
4088 * Pure: method 'atomize' presents local goal premises as object-level
4089 statements (atomic meta-level propositions); setup controlled via
4090 rewrite rules declarations of 'atomize' attribute; example
4091 application: 'induct' method with proper rule statements in improper
4094 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
4095 now consider the syntactic context of assumptions, giving a better
4096 chance to get type-inference of the arguments right (this is
4097 especially important for locales);
4099 * Pure: "sorry" no longer requires quick_and_dirty in interactive
4102 * Pure/obtain: the formal conclusion "thesis", being marked as
4103 ``internal'', may no longer be reference directly in the text;
4104 potential INCOMPATIBILITY, may need to use "?thesis" in rare
4107 * Pure: generic 'sym' attribute which declares a rule both as pure
4108 'elim?' and for the 'symmetric' operation;
4110 * Pure: marginal comments ``--'' may now occur just anywhere in the
4111 text; the fixed correlation with particular command syntax has been
4114 * Pure: new method 'rules' is particularly well-suited for proof
4115 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
4116 but often produces more compact proof terms with less detours;
4118 * Pure/Provers/classical: simplified integration with pure rule
4119 attributes and methods; the classical "intro?/elim?/dest?"
4120 declarations coincide with the pure ones; the "rule" method no longer
4121 includes classically swapped intros; "intro" and "elim" methods no
4122 longer pick rules from the context; also got rid of ML declarations
4123 AddXIs/AddXEs/AddXDs; all of this has some potential for
4126 * Provers/classical: attribute 'swapped' produces classical inversions
4127 of introduction rules;
4129 * Provers/simplifier: 'simplified' attribute may refer to explicit
4130 rules instead of full simplifier context; 'iff' attribute handles
4133 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
4135 * HOL: 'recdef' now fails on unfinished automated proofs, use
4136 "(permissive)" option to recover old behavior;
4138 * HOL: 'inductive' no longer features separate (collective) attributes
4139 for 'intros' (was found too confusing);
4141 * HOL: properly declared induction rules less_induct and
4147 * HOL: moved over to sane numeral syntax; the new policy is as
4150 - 0 and 1 are polymorphic constants, which are defined on any
4151 numeric type (nat, int, real etc.);
4153 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
4154 binary representation internally;
4156 - type nat has special constructor Suc, and generally prefers Suc 0
4157 over 1::nat and Suc (Suc 0) over 2::nat;
4159 This change may cause significant problems of INCOMPATIBILITY; here
4160 are some hints on converting existing sources:
4162 - due to the new "num" token, "-0" and "-1" etc. are now atomic
4163 entities, so expressions involving "-" (unary or binary minus) need
4164 to be spaced properly;
4166 - existing occurrences of "1" may need to be constraint "1::nat" or
4167 even replaced by Suc 0; similar for old "2";
4169 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
4171 - remove all special provisions on numerals in proofs;
4173 * HOL: simp rules nat_number expand numerals on nat to Suc/0
4174 representation (depends on bin_arith_simps in the default context);
4176 * HOL: symbolic syntax for x^2 (numeral 2);
4178 * HOL: the class of all HOL types is now called "type" rather than
4179 "term"; INCOMPATIBILITY, need to adapt references to this type class
4180 in axclass/classes, instance/arities, and (usually rare) occurrences
4181 in typings (of consts etc.); internally the class is called
4182 "HOL.type", ML programs should refer to HOLogic.typeS;
4184 * HOL/record package improvements:
4185 - new derived operations "fields" to build a partial record section,
4186 "extend" to promote a fixed record to a record scheme, and
4187 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
4188 declared as simp by default;
4189 - shared operations ("more", "fields", etc.) now need to be always
4190 qualified) --- potential INCOMPATIBILITY;
4191 - removed "make_scheme" operations (use "make" with "extend") --
4193 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
4194 - provides cases/induct rules for use with corresponding Isar
4195 methods (for concrete records, record schemes, concrete more
4196 parts, and schematic more parts -- in that order);
4197 - internal definitions directly based on a light-weight abstract
4198 theory of product types over typedef rather than datatype;
4200 * HOL: generic code generator for generating executable ML code from
4201 specifications; specific support for HOL constructs such as inductive
4202 datatypes and sets, as well as recursive functions; can be invoked
4203 via 'generate_code' theory section;
4205 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
4207 * HOL: consolidated and renamed several theories. In particular:
4208 Ord.thy has been absorbed into HOL.thy
4209 String.thy has been absorbed into List.thy
4211 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
4212 (beware of argument permutation!);
4214 * HOL: linorder_less_split superseded by linorder_cases;
4216 * HOL/List: "nodups" renamed to "distinct";
4218 * HOL: added "The" definite description operator; move Hilbert's "Eps"
4219 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
4220 - Ex_def has changed, now need to use some_eq_ex
4222 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
4223 in this (rare) case use:
4225 delSWrapper "split_all_tac"
4226 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
4228 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
4231 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
4232 Isabelle's type classes, ^ on functions and relations has too general
4233 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
4234 necessary to attach explicit type constraints;
4236 * HOL/Relation: the prefix name of the infix "O" has been changed from
4237 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
4238 renamed accordingly (eg "compI" -> "rel_compI").
4240 * HOL: syntax translations now work properly with numerals and records
4243 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
4244 of "lam" -- INCOMPATIBILITY;
4246 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
4247 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
4248 renamed "Product_Type.unit";
4250 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
4252 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
4253 the "cases" method);
4255 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
4258 * HOL/IMP: updated and converted to new-style theory format; several
4259 parts turned into readable document, with proper Isar proof texts and
4260 some explanations (by Gerwin Klein);
4262 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
4264 * HOL-Hyperreal is now a logic image;
4269 * Isar: consts/constdefs supports mixfix syntax for continuous
4272 * Isar: domain package adapted to new-style theory format, e.g. see
4275 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
4276 potential INCOMPATIBILITY; now use plain induct_tac instead of former
4277 lift.induct_tac, always use UU instead of Undef;
4279 * HOLCF/IMP: updated and converted to new-style theory;
4284 * Isar: proper integration of logic-specific tools and packages,
4285 including theory commands '(co)inductive', '(co)datatype',
4286 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
4287 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
4289 * theory Main no longer includes AC; for the Axiom of Choice, base
4290 your theory on Main_ZFC;
4292 * the integer library now covers quotients and remainders, with many
4293 laws relating division to addition, multiplication, etc.;
4295 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
4296 typeless version of the formalism;
4298 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
4301 * ZF/Induct: new directory for examples of inductive definitions,
4302 including theory Multiset for multiset orderings; converted to
4303 new-style theory format;
4305 * ZF: many new theorems about lists, ordinals, etc.;
4310 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
4311 variable proof controls level of detail: 0 = no proofs (only oracle
4312 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
4313 also ref manual for further ML interfaces;
4315 * Pure/axclass: removed obsolete ML interface
4316 goal_subclass/goal_arity;
4318 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
4319 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
4320 separate tokens, so expressions involving minus need to be spaced
4323 * Pure/syntax: support non-oriented infixes, using keyword "infix"
4324 rather than "infixl" or "infixr";
4326 * Pure/syntax: concrete syntax for dummy type variables admits genuine
4327 sort constraint specifications in type inference; e.g. "x::_::foo"
4328 ensures that the type of "x" is of sort "foo" (but not necessarily a
4331 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
4332 control output of nested => (types); the default behavior is
4335 * Pure/syntax: builtin parse translation for "_constify" turns valued
4336 tokens into AST constants;
4338 * Pure/syntax: prefer later declarations of translations and print
4339 translation functions; potential INCOMPATIBILITY: need to reverse
4340 multiple declarations for same syntax element constant;
4342 * Pure/show_hyps reset by default (in accordance to existing Isar
4345 * Provers/classical: renamed addaltern to addafter, addSaltern to
4348 * Provers/clasimp: ``iff'' declarations now handle conditional rules
4351 * system: tested support for MacOS X; should be able to get Isabelle +
4352 Proof General to work in a plain Terminal after installing Poly/ML
4353 (e.g. from the Isabelle distribution area) and GNU bash alone
4354 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
4355 support requires further installations, e.g. from
4356 http://fink.sourceforge.net/);
4358 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
4360 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
4361 of 40 MB), cf. ML_OPTIONS;
4363 * system: Proof General keywords specification is now part of the
4364 Isabelle distribution (see etc/isar-keywords.el);
4366 * system: support for persistent Proof General sessions (refrain from
4367 outdating all loaded theories on startup); user may create writable
4368 logic images like this: ``isabelle -q HOL Test'';
4370 * system: smart selection of Isabelle process versus Isabelle
4371 interface, accommodates case-insensitive file systems (e.g. HFS+); may
4372 run both "isabelle" and "Isabelle" even if file names are badly
4373 damaged (executable inspects the case of the first letter of its own
4374 name); added separate "isabelle-process" and "isabelle-interface";
4376 * system: refrain from any attempt at filtering input streams; no
4377 longer support ``8bit'' encoding of old isabelle font, instead proper
4378 iso-latin characters may now be used; the related isatools
4379 "symbolinput" and "nonascii" have disappeared as well;
4381 * system: removed old "xterm" interface (the print modes "xterm" and
4382 "xterm_color" are still available for direct use in a suitable
4387 New in Isabelle99-2 (February 2001)
4388 -----------------------------------
4390 *** Overview of INCOMPATIBILITIES ***
4392 * HOL: please note that theories in the Library and elsewhere often use the
4393 new-style (Isar) format; to refer to their theorems in an ML script you must
4394 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
4396 * HOL: inductive package no longer splits induction rule aggressively,
4397 but only as far as specified by the introductions given; the old
4398 format may be recovered via ML function complete_split_rule or attribute
4399 'split_rule (complete)';
4401 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
4402 gfp_Tarski to gfp_unfold;
4404 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
4406 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
4407 relation); infix "^^" has been renamed "``"; infix "``" has been
4408 renamed "`"; "univalent" has been renamed "single_valued";
4410 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
4413 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
4415 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
4417 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
4418 consequence, it is no longer monotonic wrt. the local goal context
4419 (which is now passed through the inductive cases);
4421 * Document preparation: renamed standard symbols \<ll> to \<lless> and
4422 \<gg> to \<ggreater>;
4425 *** Document preparation ***
4427 * \isabellestyle{NAME} selects version of Isabelle output (currently
4428 available: are "it" for near math-mode best-style output, "sl" for
4429 slanted text style, and "tt" for plain type-writer; if no
4430 \isabellestyle command is given, output is according to slanted
4433 * support sub/super scripts (for single symbols only), input syntax is
4434 like this: "A\<^sup>*" or "A\<^sup>\<star>";
4436 * some more standard symbols; see Appendix A of the system manual for
4437 the complete list of symbols defined in isabellesym.sty;
4439 * improved isabelle style files; more abstract symbol implementation
4440 (should now use \isamath{...} and \isatext{...} in custom symbol
4443 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
4444 state; Note that presentation of goal states does not conform to
4445 actual human-readable proof documents. Please do not include goal
4446 states into document output unless you really know what you are doing!
4448 * proper indentation of antiquoted output with proportional LaTeX
4451 * no_document ML operator temporarily disables LaTeX document
4454 * isatool unsymbolize tunes sources for plain ASCII communication;
4459 * Pure: Isar now suffers initial goal statements to contain unbound
4460 schematic variables (this does not conform to actual readable proof
4461 documents, due to unpredictable outcome and non-compositional proof
4462 checking); users who know what they are doing may use schematic goals
4463 for Prolog-style synthesis of proven results;
4465 * Pure: assumption method (an implicit finishing) now handles actual
4468 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
4469 initial goal, declare "that" only as Pure intro (only for single
4470 steps); the "that" rule assumption may now be involved in implicit
4471 finishing, thus ".." becomes a feasible for trivial obtains;
4473 * Pure: default proof step now includes 'intro_classes'; thus trivial
4474 instance proofs may be performed by "..";
4476 * Pure: ?thesis / ?this / "..." now work for pure meta-level
4479 * Pure: more robust selection of calculational rules;
4481 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
4482 rule (as well as the assumption rule);
4484 * Pure: 'thm_deps' command visualizes dependencies of theorems and
4485 lemmas, using the graph browser tool;
4487 * Pure: predict failure of "show" in interactive mode;
4489 * Pure: 'thms_containing' now takes actual terms as arguments;
4491 * HOL: improved method 'induct' --- now handles non-atomic goals
4492 (potential INCOMPATIBILITY); tuned error handling;
4494 * HOL: cases and induct rules now provide explicit hints about the
4495 number of facts to be consumed (0 for "type" and 1 for "set" rules);
4496 any remaining facts are inserted into the goal verbatim;
4498 * HOL: local contexts (aka cases) may now contain term bindings as
4499 well; the 'cases' and 'induct' methods new provide a ?case binding for
4500 the result to be shown in each case;
4502 * HOL: added 'recdef_tc' command;
4504 * isatool convert assists in eliminating legacy ML scripts;
4509 * HOL/Library: a collection of generic theories to be used together
4510 with main HOL; the theory loader path already includes this directory
4511 by default; the following existing theories have been moved here:
4512 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
4513 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
4515 * HOL/Unix: "Some aspects of Unix file-system security", a typical
4516 modelling and verification task performed in Isabelle/HOL +
4517 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
4519 * HOL/Algebra: special summation operator SUM no longer exists, it has
4520 been replaced by setsum; infix 'assoc' now has priority 50 (like
4521 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
4522 'domain', this makes the theory consistent with mathematical
4525 * HOL basics: added overloaded operations "inverse" and "divide"
4526 (infix "/"), syntax for generic "abs" operation, generic summation
4529 * HOL/typedef: simplified package, provide more useful rules (see also
4532 * HOL/datatype: induction rule for arbitrarily branching datatypes is
4533 now expressed as a proper nested rule (old-style tactic scripts may
4534 require atomize_strip_tac to cope with non-atomic premises);
4536 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
4537 to "split_conv" (old name still available for compatibility);
4539 * HOL: improved concrete syntax for strings (e.g. allows translation
4540 rules with string literals);
4542 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
4543 and Fleuriot's mechanization of analysis, including the transcendental
4544 functions for the reals;
4546 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
4551 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
4552 "lam" is displayed as TWO lambda-symbols
4554 * CTT: theory Main now available, containing everything (that is, Bool
4560 * Pure: the Simplifier has been implemented properly as a derived rule
4561 outside of the actual kernel (at last!); the overall performance
4562 penalty in practical applications is about 50%, while reliability of
4563 the Isabelle inference kernel has been greatly improved;
4565 * print modes "brackets" and "no_brackets" control output of nested =>
4566 (types) and ==> (props); the default behaviour is "brackets";
4568 * Provers: fast_tac (and friends) now handle actual object-logic rules
4569 as assumptions as well;
4571 * system: support Poly/ML 4.0;
4573 * system: isatool install handles KDE version 1 or 2;
4577 New in Isabelle99-1 (October 2000)
4578 ----------------------------------
4580 *** Overview of INCOMPATIBILITIES ***
4582 * HOL: simplification of natural numbers is much changed; to partly
4583 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
4584 issue the following ML commands:
4586 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
4587 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
4589 * HOL: simplification no longer dives into case-expressions; this is
4590 controlled by "t.weak_case_cong" for each datatype t;
4592 * HOL: nat_less_induct renamed to less_induct;
4594 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
4595 fixsome to patch .thy and .ML sources automatically;
4597 select_equality -> some_equality
4598 select_eq_Ex -> some_eq_ex
4599 selectI2EX -> someI2_ex
4602 select1_equality -> some1_equality
4603 Eps_sym_eq -> some_sym_eq_trivial
4604 Eps_eq -> some_eq_trivial
4606 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
4608 * HOL: removed obsolete theorem binding expand_if (refer to split_if
4611 * HOL: the recursion equations generated by 'recdef' are now called
4612 f.simps instead of f.rules;
4614 * HOL: qed_spec_mp now also handles bounded ALL as well;
4616 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
4617 sometimes be needed;
4619 * HOL: the constant for "f``x" is now "image" rather than "op ``";
4621 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
4623 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
4624 product is now "<*>" instead of "Times"; the lexicographic product is
4625 now "<*lex*>" instead of "**";
4627 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
4628 of main HOL, but was unused); better use HOL's datatype package;
4630 * HOL: removed "symbols" syntax for constant "override" of theory Map;
4631 the old syntax may be recovered as follows:
4634 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
4635 (infixl "\\<oplus>" 100)
4637 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4639 * HOL/ML: even fewer consts are declared as global (see theories Ord,
4640 Lfp, Gfp, WF); this only affects ML packages that refer to const names
4643 * HOL and ZF: syntax for quotienting wrt an equivalence relation
4644 changed from A/r to A//r;
4646 * ZF: new treatment of arithmetic (nat & int) may break some old
4649 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
4650 rulify -> rule_format, elimify -> elim_format, ...);
4652 * Isar/Provers: intro/elim/dest attributes changed; renamed
4653 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
4654 should have to change intro!! to intro? only); replaced "delrule" by
4657 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
4659 * Provers: strengthened force_tac by using new first_best_tac;
4661 * LaTeX document preparation: several changes of isabelle.sty (see
4665 *** Document preparation ***
4667 * formal comments (text blocks etc.) in new-style theories may now
4668 contain antiquotations of thm/prop/term/typ/text to be presented
4669 according to latex print mode; concrete syntax is like this:
4670 @{term[show_types] "f(x) = a + x"};
4672 * isatool mkdir provides easy setup of Isabelle session directories,
4673 including proper document sources;
4675 * generated LaTeX sources are now deleted after successful run
4676 (isatool document -c); may retain a copy somewhere else via -D option
4679 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
4680 style files, achieving self-contained LaTeX sources and simplifying
4683 * old-style theories now produce (crude) LaTeX output as well;
4685 * browser info session directories are now self-contained (may be put
4686 on WWW server seperately); improved graphs of nested sessions; removed
4687 graph for 'all sessions';
4689 * several improvements in isabelle style files; \isabellestyle{it}
4690 produces fake math mode output; \isamarkupheader is now \section by
4691 default; see lib/texinputs/isabelle.sty etc.;
4696 * Isar/Pure: local results and corresponding term bindings are now
4697 subject to Hindley-Milner polymorphism (similar to ML); this
4698 accommodates incremental type-inference very nicely;
4700 * Isar/Pure: new derived language element 'obtain' supports
4701 generalized existence reasoning;
4703 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
4704 support accumulation of results, without applying any rules yet;
4705 useful to collect intermediate results without explicit name
4706 references, and for use with transitivity rules with more than 2
4709 * Isar/Pure: scalable support for case-analysis type proofs: new
4710 'case' language element refers to local contexts symbolically, as
4711 produced by certain proof methods; internally, case names are attached
4712 to theorems as "tags";
4714 * Isar/Pure: theory command 'hide' removes declarations from
4715 class/type/const name spaces;
4717 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
4718 indicate potential overloading;
4720 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
4722 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
4723 "{a,b,c}" instead of {a,b,c};
4725 * Isar/Pure now provides its own version of intro/elim/dest
4726 attributes; useful for building new logics, but beware of confusion
4727 with the version in Provers/classical;
4729 * Isar/Pure: the local context of (non-atomic) goals is provided via
4730 case name 'antecedent';
4732 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
4733 to the current context is now done automatically);
4735 * Isar/Pure: theory command 'method_setup' provides a simple interface
4736 for definining proof methods in ML;
4738 * Isar/Provers: intro/elim/dest attributes changed; renamed
4739 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
4740 most cases, one should have to change intro!! to intro? only);
4741 replaced "delrule" by "rule del";
4743 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
4744 'symmetric' attribute (the latter supercedes [RS sym]);
4746 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
4747 method modifier); 'simp' method: 'only:' modifier removes loopers as
4748 well (including splits);
4750 * Isar/Provers: Simplifier and Classical methods now support all kind
4751 of modifiers used in the past, including 'cong', 'iff', etc.
4753 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
4754 of Simplifier and Classical reasoner);
4756 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
4757 now support named cases; major packages (inductive, datatype, primrec,
4758 recdef) support case names and properly name parameters;
4760 * Isar/HOL: new transitivity rules for substitution in inequalities --
4761 monotonicity conditions are extracted to be proven at end of
4764 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
4767 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
4768 split_if split_if_asm; datatype package provides theorems foo.splits =
4769 foo.split foo.split_asm for each datatype;
4771 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
4772 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
4773 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
4774 use "(cases (simplified))" method in proper proof texts);
4776 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
4778 * Isar: names of theorems etc. may be natural numbers as well;
4780 * Isar: 'pr' command: optional arguments for goals_limit and
4781 ProofContext.prems_limit; no longer prints theory contexts, but only
4784 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
4785 additional print modes to be specified; e.g. "pr(latex)" will print
4786 proof state according to the Isabelle LaTeX style;
4788 * Isar: improved support for emulating tactic scripts, including proof
4789 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
4790 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
4791 (for HOL datatypes);
4793 * Isar: simplified (more robust) goal selection of proof methods: 1st
4794 goal, all goals, or explicit goal specifier (tactic emulation); thus
4795 'proof method scripts' have to be in depth-first order;
4797 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
4799 * Isar: removed 'help' command, which hasn't been too helpful anyway;
4800 should instead use individual commands for printing items
4801 (print_commands, print_methods etc.);
4803 * Isar: added 'nothing' --- the empty list of theorems;
4808 * HOL/MicroJava: formalization of a fragment of Java, together with a
4809 corresponding virtual machine and a specification of its bytecode
4810 verifier and a lightweight bytecode verifier, including proofs of
4811 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
4812 Cornelia Pusch (see also the homepage of project Bali at
4813 http://isabelle.in.tum.de/Bali/);
4815 * HOL/Algebra: new theory of rings and univariate polynomials, by
4818 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
4819 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
4822 * HOL/Lattice: fundamental concepts of lattice theory and order
4823 structures, including duals, properties of bounds versus algebraic
4824 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
4825 Theorem for complete lattices etc.; may also serve as a demonstration
4826 for abstract algebraic reasoning using axiomatic type classes, and
4827 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
4829 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
4832 * HOL/IMPP: extension of IMP with local variables and mutually
4833 recursive procedures, by David von Oheimb;
4835 * HOL/Lambda: converted into new-style theory and document;
4837 * HOL/ex/Multiquote: example of multiple nested quotations and
4838 anti-quotations -- basically a generalized version of de-Bruijn
4839 representation; very useful in avoiding lifting of operations;
4841 * HOL/record: added general record equality rule to simpset; fixed
4842 select-update simplification procedure to handle extended records as
4843 well; admit "r" as field name;
4845 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
4846 other numeric types and also as the identity of groups, rings, etc.;
4848 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
4849 Types nat and int belong to this axclass;
4851 * HOL: greatly improved simplification involving numerals of type nat, int, real:
4852 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
4853 i*j + k + j*#3*i simplifies to #4*(i*j) + k
4854 two terms #m*u and #n*u are replaced by #(m+n)*u
4855 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
4856 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
4857 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
4859 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
4860 powerful prover for predicate logic but knows nothing of clasets; see
4861 ex/mesontest.ML and ex/mesontest2.ML for example applications;
4863 * HOL: new version of "case_tac" subsumes both boolean case split and
4864 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
4865 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
4867 * HOL: simplification no longer dives into case-expressions: only the
4868 selector expression is simplified, but not the remaining arms; to
4869 enable full simplification of case-expressions for datatype t, you may
4870 remove t.weak_case_cong from the simpset, either globally (Delcongs
4871 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
4873 * HOL/recdef: the recursion equations generated by 'recdef' for
4874 function 'f' are now called f.simps instead of f.rules; if all
4875 termination conditions are proved automatically, these simplification
4876 rules are added to the simpset, as in primrec; rules may be named
4877 individually as well, resulting in a separate list of theorems for
4880 * HOL/While is a new theory that provides a while-combinator. It
4881 permits the definition of tail-recursive functions without the
4882 provision of a termination measure. The latter is necessary once the
4883 invariant proof rule for while is applied.
4885 * HOL: new (overloaded) notation for the set of elements below/above
4886 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
4888 * HOL: theorems impI, allI, ballI bound as "strip";
4890 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
4891 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
4892 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
4894 * HOL/Real: "rabs" replaced by overloaded "abs" function;
4896 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
4897 main HOL, but was unused);
4899 * HOL: fewer consts declared as global (e.g. have to refer to
4900 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
4902 * HOL: tuned AST representation of nested pairs, avoiding bogus output
4903 in case of overlap with user translations (e.g. judgements over
4904 tuples); (note that the underlying logical represenation is still
4910 * ZF: simplification automatically cancels common terms in arithmetic
4911 expressions over nat and int;
4913 * ZF: new treatment of nat to minimize type-checking: all operators
4914 coerce their operands to a natural number using the function natify,
4915 making the algebraic laws unconditional;
4917 * ZF: as above, for int: operators coerce their operands to an integer
4918 using the function intify;
4920 * ZF: the integer library now contains many of the usual laws for the
4921 orderings, including $<=, and monotonicity laws for $+ and $*;
4923 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
4926 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
4927 to the simplifier and classical reasoner simultaneously;
4932 * Provers: blast_tac now handles actual object-logic rules as
4933 assumptions; note that auto_tac uses blast_tac internally as well;
4935 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
4936 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
4938 * Provers: delrules now handles destruct rules as well (no longer need
4939 explicit make_elim);
4941 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
4942 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4943 use instead the strong form,
4944 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
4945 in HOL, FOL and ZF the function cla_make_elim will create such rules
4946 from destruct-rules;
4948 * Provers: Simplifier.easy_setup provides a fast path to basic
4949 Simplifier setup for new object-logics;
4951 * Pure: AST translation rules no longer require constant head on LHS;
4953 * Pure: improved name spaces: ambiguous output is qualified; support
4954 for hiding of names;
4956 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
4957 XSYMBOL_HOME; no longer need to do manual configuration in most
4960 * system: compression of ML heaps images may now be controlled via -c
4961 option of isabelle and isatool usedir (currently only observed by
4964 * system: isatool installfonts may handle X-Symbol fonts as well (very
4965 useful for remote X11);
4967 * system: provide TAGS file for Isabelle sources;
4969 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
4972 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
4973 timing flag supersedes proof_timing and Toplevel.trace;
4975 * ML: new combinators |>> and |>>> for incremental transformations
4976 with secondary results (e.g. certain theory extensions):
4978 * ML: PureThy.add_defs gets additional argument to indicate potential
4979 overloading (usually false);
4981 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
4986 New in Isabelle99 (October 1999)
4987 --------------------------------
4989 *** Overview of INCOMPATIBILITIES (see below for more details) ***
4991 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
4992 are no longer simplified. (This allows the simplifier to unfold recursive
4993 functional programs.) To restore the old behaviour, declare
4995 Delcongs [if_weak_cong];
4997 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
5000 * HOL: the predicate "inj" is now defined by translation to "inj_on";
5002 * HOL/datatype: mutual_induct_tac no longer exists --
5003 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
5005 * HOL/typedef: fixed type inference for representing set; type
5006 arguments now have to occur explicitly on the rhs as type constraints;
5008 * ZF: The con_defs part of an inductive definition may no longer refer
5009 to constants declared in the same theory;
5011 * HOL, ZF: the function mk_cases, generated by the inductive
5012 definition package, has lost an argument. To simplify its result, it
5013 uses the default simpset instead of a supplied list of theorems.
5015 * HOL/List: the constructors of type list are now Nil and Cons;
5017 * Simplifier: the type of the infix ML functions
5018 setSSolver addSSolver setSolver addSolver
5019 is now simpset * solver -> simpset where `solver' is a new abstract type
5020 for packaging solvers. A solver is created via
5021 mk_solver: string -> (thm list -> int -> tactic) -> solver
5022 where the string argument is only a comment.
5027 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
5028 decision procedure for linear arithmetic. Currently it is used for
5029 types `nat', `int', and `real' in HOL (see below); it can, should and
5030 will be instantiated for other types and logics as well.
5032 * The simplifier now accepts rewrite rules with flexible heads, eg
5033 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
5034 They are applied like any rule with a non-pattern lhs, i.e. by first-order
5040 * New Isabelle/Isar subsystem provides an alternative to traditional
5041 tactical theorem proving; together with the ProofGeneral/isar user
5042 interface it offers an interactive environment for developing human
5043 readable proof documents (Isar == Intelligible semi-automated
5044 reasoning); for further information see isatool doc isar-ref,
5045 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
5047 * improved and simplified presentation of theories: better HTML markup
5048 (including colors), graph views in several sizes; isatool usedir now
5049 provides a proper interface for user theories (via -P option); actual
5050 document preparation based on (PDF)LaTeX is available as well (for
5051 new-style theories only); see isatool doc system for more information;
5053 * native support for Proof General, both for classic Isabelle and
5056 * ML function thm_deps visualizes dependencies of theorems and lemmas,
5057 using the graph browser tool;
5059 * Isabelle manuals now also available as PDF;
5061 * theory loader rewritten from scratch (may not be fully
5062 bug-compatible); old loadpath variable has been replaced by show_path,
5063 add_path, del_path, reset_path functions; new operations such as
5064 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
5067 * improved isatool install: option -k creates KDE application icon,
5068 option -p DIR installs standalone binaries;
5070 * added ML_PLATFORM setting (useful for cross-platform installations);
5071 more robust handling of platform specific ML images for SML/NJ;
5073 * the settings environment is now statically scoped, i.e. it is never
5074 created again in sub-processes invoked from isabelle, isatool, or
5077 * path element specification '~~' refers to '$ISABELLE_HOME';
5079 * in locales, the "assumes" and "defines" parts may be omitted if
5082 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
5085 * new print_mode "HTML";
5087 * new flag show_tags controls display of tags of theorems (which are
5088 basically just comments that may be attached by some tools);
5090 * Isamode 2.6 requires patch to accomodate change of Isabelle font
5091 mode and goal output format:
5093 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
5095 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
5097 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
5098 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
5100 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
5102 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
5104 * function bind_thms stores lists of theorems (cf. bind_thm);
5106 * new shorthand tactics ftac, eatac, datac, fatac;
5108 * qed (and friends) now accept "" as result name; in that case the
5109 theorem is not stored, but proper checks and presentation of the
5112 * theorem database now also indexes constants "Trueprop", "all",
5113 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
5118 ** HOL arithmetic **
5120 * There are now decision procedures for linear arithmetic over nat and
5123 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
5124 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
5125 are treated as atomic; subformulae not involving type `nat' or `int'
5126 are ignored; quantified subformulae are ignored unless they are
5127 positive universal or negative existential. The tactic has to be
5128 invoked by hand and can be a little bit slow. In particular, the
5129 running time is exponential in the number of occurrences of `min' and
5130 `max', and `-' on `nat'.
5132 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
5133 (negated) (in)equalities among the premises and the conclusion into
5134 account (i.e. no compound formulae) and does not know about `min' and
5135 `max', and `-' on `nat'. It is fast and is used automatically by the
5138 NB: At the moment, these decision procedures do not cope with mixed
5139 nat/int formulae where the two parts interact, such as `m < n ==>
5142 * HOL/Numeral provides a generic theory of numerals (encoded
5143 efficiently as bit strings); setup for types nat/int/real is in place;
5144 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
5145 int, existing theories and proof scripts may require a few additional
5148 * integer division and remainder can now be performed on constant
5151 * many properties of integer multiplication, division and remainder
5154 * An interface to the Stanford Validity Checker (SVC) is available through the
5155 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
5156 are proved automatically. SVC must be installed separately, and its results
5157 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
5158 invocation of the underlying oracle). For SVC see
5159 http://verify.stanford.edu/SVC
5161 * IsaMakefile: the HOL-Real target now builds an actual image;
5166 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
5167 (in Isabelle/Isar) -- by Gertrud Bauer;
5169 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
5170 analysis for assembly languages with subtypes;
5172 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
5173 -- avoids syntactic ambiguities and treats state, transition, and
5174 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
5175 changed syntax and (many) tactics;
5177 * HOL/inductive: Now also handles more general introduction rules such
5178 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
5179 theorems are now maintained within the theory (maintained via the
5182 * HOL/datatype: Now also handles arbitrarily branching datatypes
5183 (using function types) such as
5185 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
5187 * HOL/record: record_simproc (part of the default simpset) takes care
5188 of selectors applied to updated records; record_split_tac is no longer
5189 part of the default claset; update_defs may now be removed from the
5190 simpset in many cases; COMPATIBILITY: old behavior achieved by
5192 claset_ref () := claset() addSWrapper record_split_wrapper;
5193 Delsimprocs [record_simproc]
5195 * HOL/typedef: fixed type inference for representing set; type
5196 arguments now have to occur explicitly on the rhs as type constraints;
5198 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
5199 names rather than an ML expression;
5201 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
5202 supplied later. Program schemes can be defined, such as
5203 "While B C s = (if B s then While B C (C s) else s)"
5204 where the well-founded relation can be chosen after B and C have been given.
5206 * HOL/List: the constructors of type list are now Nil and Cons;
5207 INCOMPATIBILITY: while [] and infix # syntax is still there, of
5208 course, ML tools referring to List.list.op # etc. have to be adapted;
5210 * HOL_quantifiers flag superseded by "HOL" print mode, which is
5211 disabled by default; run isabelle with option -m HOL to get back to
5212 the original Gordon/HOL-style output;
5214 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
5215 ALL x<=y. P, EX x<y. P, EX x<=y. P;
5217 * HOL basic syntax simplified (more orthogonal): all variants of
5218 All/Ex now support plain / symbolic / HOL notation; plain syntax for
5219 Eps operator is provided as well: "SOME x. P[x]";
5221 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
5223 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
5224 thus available for user theories;
5226 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
5227 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
5230 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
5231 several times and then mp;
5236 * the notation <<...>> is now available as a notation for sequences of
5239 * the simplifier is now installed
5241 * the axiom system has been generalized (thanks to Soren Heilmann)
5243 * the classical reasoner now has a default rule database
5248 * new primrec section allows primitive recursive functions to be given
5249 directly (as in HOL) over datatypes and the natural numbers;
5251 * new tactics induct_tac and exhaust_tac for induction (or case
5252 analysis) over datatypes and the natural numbers;
5254 * the datatype declaration of type T now defines the recursor T_rec;
5256 * simplification automatically does freeness reasoning for datatype
5259 * automatic type-inference, with AddTCs command to insert new
5260 type-checking rules;
5262 * datatype introduction rules are now added as Safe Introduction rules
5265 * the syntax "if P then x else y" is now available in addition to
5269 *** Internal programming interfaces ***
5271 * tuned simplifier trace output; new flag debug_simp;
5273 * structures Vartab / Termtab (instances of TableFun) offer efficient
5274 tables indexed by indexname_ord / term_ord (compatible with aconv);
5276 * AxClass.axclass_tac lost the theory argument;
5278 * tuned current_goals_markers semantics: begin / end goal avoids
5279 printing empty lines;
5281 * removed prs and prs_fn hook, which was broken because it did not
5282 include \n in its semantics, forcing writeln to add one
5283 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
5284 string -> unit if you really want to output text without newline;
5286 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
5287 plain output, interface builders may have to enable 'isabelle_font'
5288 mode to get Isabelle font glyphs as before;
5290 * refined token_translation interface; INCOMPATIBILITY: output length
5291 now of type real instead of int;
5293 * theory loader actions may be traced via new ThyInfo.add_hook
5294 interface (see src/Pure/Thy/thy_info.ML); example application: keep
5295 your own database of information attached to *whole* theories -- as
5296 opposed to intra-theory data slots offered via TheoryDataFun;
5298 * proper handling of dangling sort hypotheses (at last!);
5299 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
5300 extra sort hypotheses that can be witnessed from the type signature;
5301 the force_strip_shyps flag is gone, any remaining shyps are simply
5302 left in the theorem (with a warning issued by strip_shyps_warning);
5306 New in Isabelle98-1 (October 1998)
5307 ----------------------------------
5309 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5311 * several changes of automated proof tools;
5313 * HOL: major changes to the inductive and datatype packages, including
5314 some minor incompatibilities of theory syntax;
5316 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
5319 * HOL: removed duplicate thms in Arith:
5320 less_imp_add_less should be replaced by trans_less_add1
5321 le_imp_add_le should be replaced by trans_le_add1
5323 * HOL: unary minus is now overloaded (new type constraints may be
5326 * HOL and ZF: unary minus for integers is now #- instead of #~. In
5327 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
5328 now taken as an integer constant.
5330 * Pure: ML function 'theory_of' renamed to 'theory';
5336 1. Asm_full_simp_tac is now more aggressive.
5337 1. It will sometimes reorient premises if that increases their power to
5339 2. It does no longer proceed strictly from left to right but may also
5340 rotate premises to achieve further simplification.
5341 For compatibility reasons there is now Asm_lr_simp_tac which is like the
5342 old Asm_full_simp_tac in that it does not rotate premises.
5343 2. The simplifier now knows a little bit about nat-arithmetic.
5345 * Classical reasoner: wrapper mechanism for the classical reasoner now
5346 allows for selected deletion of wrappers, by introduction of names for
5347 wrapper functionals. This implies that addbefore, addSbefore,
5348 addaltern, and addSaltern now take a pair (name, tactic) as argument,
5349 and that adding two tactics with the same name overwrites the first
5350 one (emitting a warning).
5351 type wrapper = (int -> tactic) -> (int -> tactic)
5352 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
5353 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
5354 delWrapper, delSWrapper: claset * string -> claset
5355 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
5357 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
5358 semantics; addbefore now affects only the unsafe part of step_tac
5359 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
5360 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
5363 * Classical reasoner: setwrapper to setWrapper and compwrapper to
5364 compWrapper; added safe wrapper (and access functions for it);
5366 * HOL/split_all_tac is now much faster and fails if there is nothing
5367 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
5368 and the names of the automatically generated variables have changed.
5369 split_all_tac has moved within claset() from unsafe wrappers to safe
5370 wrappers, which means that !!-bound variables are split much more
5371 aggressively, and safe_tac and clarify_tac now split such variables.
5372 If this splitting is not appropriate, use delSWrapper "split_all_tac".
5373 Note: the same holds for record_split_tac, which does the job of
5374 split_all_tac for record fields.
5376 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
5377 permanently to the default simpset using Addsplits just like
5378 Addsimps. They can be removed via Delsplits just like
5379 Delsimps. Lower-case versions are also available.
5381 * HOL/Simplifier: The rule split_if is now part of the default
5382 simpset. This means that the simplifier will eliminate all occurrences
5383 of if-then-else in the conclusion of a goal. To prevent this, you can
5384 either remove split_if completely from the default simpset by
5385 `Delsplits [split_if]' or remove it in a specific call of the
5386 simplifier using `... delsplits [split_if]'. You can also add/delete
5387 other case splitting rules to/from the default simpset: every datatype
5388 generates suitable rules `split_t_case' and `split_t_case_asm' (where
5389 t is the name of the datatype).
5391 * Classical reasoner / Simplifier combination: new force_tac (and
5392 derivatives Force_tac, force) combines rewriting and classical
5393 reasoning (and whatever other tools) similarly to auto_tac, but is
5394 aimed to solve the given subgoal completely.
5399 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
5400 and `goalw': the theory is no longer needed as an explicit argument -
5401 the current theory context is used; assumptions are no longer returned
5402 at the ML-level unless one of them starts with ==> or !!; it is
5403 recommended to convert to these new commands using isatool fixgoal
5404 (backup your sources first!);
5406 * new top-level commands 'thm' and 'thms' for retrieving theorems from
5407 the current theory context, and 'theory' to lookup stored theories;
5409 * new theory section 'locale' for declaring constants, assumptions and
5410 definitions that have local scope;
5412 * new theory section 'nonterminals' for purely syntactic types;
5414 * new theory section 'setup' for generic ML setup functions
5415 (e.g. package initialization);
5417 * the distribution now includes Isabelle icons: see
5418 lib/logo/isabelle-{small,tiny}.xpm;
5420 * isatool install - install binaries with absolute references to
5423 * isatool logo -- create instances of the Isabelle logo (as EPS);
5425 * print mode 'emacs' reserved for Isamode;
5427 * support multiple print (ast) translations per constant name;
5429 * theorems involving oracles are now printed with a suffixed [!];
5434 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
5436 * HOL/inductive package reorganized and improved: now supports mutual
5442 oddI "n : EVEN ==> Suc n : ODD"
5443 evenI "n : ODD ==> Suc n : EVEN"
5445 new theorem list "elims" contains an elimination rule for each of the
5446 recursive sets; inductive definitions now handle disjunctive premises
5447 correctly (also ZF);
5449 INCOMPATIBILITIES: requires Inductive as an ancestor; component
5450 "mutual_induct" no longer exists - the induction rule is always
5451 contained in "induct";
5454 * HOL/datatype package re-implemented and greatly improved: now
5455 supports mutually recursive datatypes such as
5458 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
5459 | SUM ('a aexp) ('a aexp)
5460 | DIFF ('a aexp) ('a aexp)
5463 'a bexp = LESS ('a aexp) ('a aexp)
5464 | AND ('a bexp) ('a bexp)
5465 | OR ('a bexp) ('a bexp)
5467 as well as indirectly recursive datatypes such as
5470 ('a, 'b) term = Var 'a
5471 | App 'b ((('a, 'b) term) list)
5473 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
5474 induction on mutually / indirectly recursive datatypes.
5476 Primrec equations are now stored in theory and can be accessed via
5477 <function_name>.simps.
5481 - Theories using datatypes must now have theory Datatype as an
5483 - The specific <typename>.induct_tac no longer exists - use the
5484 generic induct_tac instead.
5485 - natE has been renamed to nat.exhaust - use exhaust_tac
5486 instead of res_inst_tac ... natE. Note that the variable
5487 names in nat.exhaust differ from the names in natE, this
5488 may cause some "fragile" proofs to fail.
5489 - The theorems split_<typename>_case and split_<typename>_case_asm
5490 have been renamed to <typename>.split and <typename>.split_asm.
5491 - Since default sorts of type variables are now handled correctly,
5492 some datatype definitions may have to be annotated with explicit
5494 - Primrec definitions no longer require function name and type
5495 of recursive argument.
5497 Consider using isatool fixdatatype to adapt your theories and proof
5498 scripts to the new package (backup your sources first!).
5501 * HOL/record package: considerably improved implementation; now
5502 includes concrete syntax for record types, terms, updates; theorems
5503 for surjective pairing and splitting !!-bound record variables; proof
5504 support is as follows:
5506 1) standard conversions (selectors or updates applied to record
5507 constructor terms) are part of the standard simpset;
5509 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
5510 made part of standard simpset and claset via addIffs;
5512 3) a tactic for record field splitting (record_split_tac) is part of
5513 the standard claset (addSWrapper);
5515 To get a better idea about these rules you may retrieve them via
5516 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
5517 the name of your record type.
5519 The split tactic 3) conceptually simplifies by the following rule:
5521 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
5523 Thus any record variable that is bound by meta-all will automatically
5524 blow up into some record constructor term, consequently the
5525 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
5526 solve record problems automatically.
5529 * reorganized the main HOL image: HOL/Integ and String loaded by
5530 default; theory Main includes everything;
5532 * automatic simplification of integer sums and comparisons, using cancellation;
5534 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
5536 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
5538 * many new identities for unions, intersections, set difference, etc.;
5540 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
5541 called split_if, split_split, split_sum_case and split_nat_case (to go
5542 with add/delsplits);
5544 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
5545 (?x::unit) = (); this is made part of the default simpset, which COULD
5546 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
5547 'Delsimprocs [unit_eq_proc];' as last resort); also note that
5548 unit_abs_eta_conv is added in order to counter the effect of
5549 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
5552 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
5555 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5556 It and 'sym RS equals0D' are now in the default claset, giving automatic
5557 disjointness reasoning but breaking a few old proofs.
5559 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
5560 to 'converse' from 'inverse' (for compatibility with ZF and some
5563 * HOL/recdef can now declare non-recursive functions, with {} supplied as
5564 the well-founded relation;
5566 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
5567 Compl A. The "Compl" syntax remains available as input syntax for this
5570 * HOL/Update: new theory of function updates:
5571 f(a:=b) == %x. if x=a then b else f x
5572 may also be iterated as in f(a:=b,c:=d,...);
5574 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
5577 - new function list_update written xs[i:=v] that updates the i-th
5578 list position. May also be iterated as in xs[i:=a,j:=b,...].
5579 - new function `upt' written [i..j(] which generates the list
5580 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
5581 bound write [i..j], which is a shorthand for [i..j+1(].
5582 - new lexicographic orderings and corresponding wellfoundedness theorems.
5585 - removed 'pred' (predecessor) function;
5586 - generalized some theorems about n-1;
5587 - many new laws about "div" and "mod";
5588 - new laws about greatest common divisors (see theory ex/Primes);
5590 * HOL/Relation: renamed the relational operator r^-1 "converse"
5591 instead of "inverse";
5593 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
5594 of the multiset ordering;
5596 * directory HOL/Real: a construction of the reals using Dedekind cuts
5597 (not included by default);
5599 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
5601 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
5602 programs, i.e. different program variables may have different types.
5604 * calling (stac rew i) now fails if "rew" has no effect on the goal
5605 [previously, this check worked only if the rewrite rule was unconditional]
5606 Now rew can involve either definitions or equalities (either == or =).
5611 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
5612 only the theorems proved on ZF.ML;
5614 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
5615 It and 'sym RS equals0D' are now in the default claset, giving automatic
5616 disjointness reasoning but breaking a few old proofs.
5618 * ZF/Update: new theory of function updates
5619 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
5620 may also be iterated as in f(a:=b,c:=d,...);
5622 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
5624 * calling (stac rew i) now fails if "rew" has no effect on the goal
5625 [previously, this check worked only if the rewrite rule was unconditional]
5626 Now rew can involve either definitions or equalities (either == or =).
5628 * case_tac provided for compatibility with HOL
5629 (like the old excluded_middle_tac, but with subgoals swapped)
5632 *** Internal programming interfaces ***
5634 * Pure: several new basic modules made available for general use, see
5635 also src/Pure/README;
5637 * improved the theory data mechanism to support encapsulation (data
5638 kind name replaced by private Object.kind, acting as authorization
5639 key); new type-safe user interface via functor TheoryDataFun; generic
5640 print_data function becomes basically useless;
5642 * removed global_names compatibility flag -- all theory declarations
5643 are qualified by default;
5645 * module Pure/Syntax now offers quote / antiquote translation
5646 functions (useful for Hoare logic etc. with implicit dependencies);
5647 see HOL/ex/Antiquote for an example use;
5649 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
5652 * new tactical CHANGED_GOAL for checking that a tactic modifies a
5655 * Display.print_goals function moved to Locale.print_goals;
5657 * standard print function for goals supports current_goals_markers
5658 variable for marking begin of proof, end of proof, start of goal; the
5659 default is ("", "", ""); setting current_goals_markers := ("<proof>",
5660 "</proof>", "<goal>") causes SGML like tagged proof state printing,
5665 New in Isabelle98 (January 1998)
5666 --------------------------------
5668 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5670 * changed lexical syntax of terms / types: dots made part of long
5671 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
5673 * simpset (and claset) reference variable replaced by functions
5674 simpset / simpset_ref;
5676 * no longer supports theory aliases (via merge) and non-trivial
5677 implicit merge of thms' signatures;
5679 * most internal names of constants changed due to qualified names;
5681 * changed Pure/Sequence interface (see Pure/seq.ML);
5684 *** General Changes ***
5686 * hierachically structured name spaces (for consts, types, axms, thms
5687 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
5688 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
5689 isatool fixdots ensures space after dots (e.g. "%x. x"); set
5690 long_names for fully qualified output names; NOTE: ML programs
5691 (special tactics, packages etc.) referring to internal names may have
5692 to be adapted to cope with fully qualified names; in case of severe
5693 backward campatibility problems try setting 'global_names' at compile
5694 time to have enrything declared within a flat name space; one may also
5695 fine tune name declarations in theories via the 'global' and 'local'
5698 * reimplemented the implicit simpset and claset using the new anytype
5699 data filed in signatures; references simpset:simpset ref etc. are
5700 replaced by functions simpset:unit->simpset and
5701 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
5702 to patch your ML files accordingly;
5704 * HTML output now includes theory graph data for display with Java
5705 applet or isatool browser; data generated automatically via isatool
5706 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
5708 * defs may now be conditional; improved rewrite_goals_tac to handle
5709 conditional equations;
5711 * defs now admits additional type arguments, using TYPE('a) syntax;
5713 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
5714 creates a new theory node; implicit merge of thms' signatures is
5715 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
5716 transfer:theory->thm->thm in (rare) cases;
5718 * improved handling of draft signatures / theories; draft thms (and
5719 ctyps, cterms) are automatically promoted to real ones;
5721 * slightly changed interfaces for oracles: admit many per theory, named
5722 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
5724 * print_goals: optional output of const types (set show_consts and
5727 * improved output of warnings (###) and errors (***);
5729 * subgoal_tac displays a warning if the new subgoal has type variables;
5731 * removed old README and Makefiles;
5733 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
5735 * removed obsolete init_pps and init_database;
5737 * deleted the obsolete tactical STATE, which was declared by
5738 fun STATE tacfun st = tacfun st st;
5740 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
5741 (which abbreviates $HOME);
5743 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
5744 use isatool fixseq to adapt your ML programs (this works for fully
5745 qualified references to the Sequence structure only!);
5747 * use_thy no longer requires writable current directory; it always
5748 reloads .ML *and* .thy file, if either one is out of date;
5751 *** Classical Reasoner ***
5753 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
5754 tactics that use classical reasoning to simplify a subgoal without
5755 splitting it into several subgoals;
5757 * Safe_tac: like safe_tac but uses the default claset;
5762 * added simplification meta rules:
5763 (asm_)(full_)simplify: simpset -> thm -> thm;
5765 * simplifier.ML no longer part of Pure -- has to be loaded by object
5768 * added prems argument to simplification procedures;
5770 * HOL, FOL, ZF: added infix function `addsplits':
5771 instead of `<simpset> setloop (split_tac <thms>)'
5772 you can simply write `<simpset> addsplits <thms>'
5777 * TYPE('a) syntax for type reflection terms;
5779 * no longer handles consts with name "" -- declare as 'syntax' instead;
5781 * pretty printer: changed order of mixfix annotation preference (again!);
5783 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
5788 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
5789 with `addloop' of the simplifier to faciliate case splitting in premises.
5791 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
5793 * HOL/Auth: new protocol proofs including some for the Internet
5796 * HOL/Map: new theory of `maps' a la VDM;
5798 * HOL/simplifier: simplification procedures nat_cancel_sums for
5799 cancelling out common nat summands from =, <, <= (in)equalities, or
5800 differences; simplification procedures nat_cancel_factor for
5801 cancelling common factor from =, <, <= (in)equalities over natural
5802 sums; nat_cancel contains both kinds of procedures, it is installed by
5803 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
5805 * HOL/simplifier: terms of the form
5806 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
5808 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
5809 and those of the form
5810 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
5812 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
5815 Each datatype `t' now comes with a theorem `split_t_case' of the form
5817 P(t_case f1 ... fn x) =
5818 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
5820 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
5823 and a theorem `split_t_case_asm' of the form
5825 P(t_case f1 ... fn x) =
5826 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
5828 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
5830 which can be added to a simpset via `addsplits'. The existing theorems
5831 expand_list_case and expand_option_case have been renamed to
5832 split_list_case and split_option_case.
5835 - `pred n' is automatically converted to `n-1'.
5836 Users are strongly encouraged not to use `pred' any longer,
5837 because it will disappear altogether at some point.
5838 - Users are strongly encouraged to write "0 < n" rather than
5839 "n ~= 0". Theorems and proof tools have been modified towards this
5843 the function "set_of_list" has been renamed "set" (and its theorems too);
5844 the function "nth" now takes its arguments in the reverse order and
5845 has acquired the infix notation "!" as in "xs!n".
5847 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
5849 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
5850 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
5852 * HOL/record: extensible records with schematic structural subtyping
5853 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
5854 still lacks various theorems and concrete record syntax;
5859 * removed "axioms" and "generated by" sections;
5861 * replaced "ops" section by extended "consts" section, which is capable of
5862 handling the continuous function space "->" directly;
5865 . proves theorems immediately and stores them in the theory,
5866 . creates hierachical name space,
5867 . now uses normal mixfix annotations (instead of cinfix...),
5868 . minor changes to some names and values (for consistency),
5869 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
5870 . separator between mutual domain defs: changed "," to "and",
5871 . improved handling of sort constraints; now they have to
5872 appear on the left-hand side of the equations only;
5874 * fixed LAM <x,y,zs>.b syntax;
5876 * added extended adm_tac to simplifier in HOLCF -- can now discharge
5877 adm (%x. P (t x)), where P is chainfinite and t continuous;
5882 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
5883 with `addloop' of the simplifier to faciliate case splitting in premises.
5885 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
5886 in HOL, they strip ALL and --> from proved theorems;
5890 New in Isabelle94-8 (May 1997)
5891 ------------------------------
5893 *** General Changes ***
5895 * new utilities to build / run / maintain Isabelle etc. (in parts
5896 still somewhat experimental); old Makefiles etc. still functional;
5898 * new 'Isabelle System Manual';
5900 * INSTALL text, together with ./configure and ./build scripts;
5902 * reimplemented type inference for greater efficiency, better error
5903 messages and clean internal interface;
5905 * prlim command for dealing with lots of subgoals (an easier way of
5906 setting goals_limit);
5911 * supports alternative (named) syntax tables (parser and pretty
5912 printer); internal interface is provided by add_modesyntax(_i);
5914 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
5915 be used in conjunction with the Isabelle symbol font; uses the
5916 "symbols" syntax table;
5918 * added token_translation interface (may translate name tokens in
5919 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
5920 the current print_mode); IMPORTANT: user print translation functions
5921 are responsible for marking newly introduced bounds
5922 (Syntax.mark_boundT);
5924 * token translations for modes "xterm" and "xterm_color" that display
5925 names in bold, underline etc. or colors (which requires a color
5928 * infixes may now be declared with names independent of their syntax;
5930 * added typed_print_translation (like print_translation, but may
5931 access type of constant);
5934 *** Classical Reasoner ***
5936 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
5937 some limitations. Blast_tac...
5938 + ignores addss, addbefore, addafter; this restriction is intrinsic
5939 + ignores elimination rules that don't have the correct format
5940 (the conclusion MUST be a formula variable)
5941 + ignores types, which can make HOL proofs fail
5942 + rules must not require higher-order unification, e.g. apply_type in ZF
5943 [message "Function Var's argument not a bound variable" relates to this]
5944 + its proof strategy is more general but can actually be slower
5946 * substitution with equality assumptions no longer permutes other
5949 * minor changes in semantics of addafter (now called addaltern); renamed
5950 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
5951 (and access functions for it);
5953 * improved combination of classical reasoner and simplifier:
5954 + functions for handling clasimpsets
5955 + improvement of addss: now the simplifier is called _after_ the
5957 + safe variant of addss called addSss: uses safe simplifications
5958 _during_ the safe steps. It is more complete as it allows multiple
5959 instantiations of unknowns (e.g. with slow_tac).
5963 * added interface for simplification procedures (functions that
5964 produce *proven* rewrite rules on the fly, depending on current
5967 * ordering on terms as parameter (used for ordered rewriting);
5969 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
5971 * the solver is now split into a safe and an unsafe part.
5972 This should be invisible for the normal user, except that the
5973 functions setsolver and addsolver have been renamed to setSolver and
5974 addSolver; added safe_asm_full_simp_tac;
5979 * a generic induction tactic `induct_tac' which works for all datatypes and
5980 also for type `nat';
5982 * a generic case distinction tactic `exhaust_tac' which works for all
5983 datatypes and also for type `nat';
5985 * each datatype comes with a function `size';
5987 * patterns in case expressions allow tuple patterns as arguments to
5988 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
5990 * primrec now also works with type nat;
5992 * recdef: a new declaration form, allows general recursive functions to be
5993 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
5995 * the constant for negation has been renamed from "not" to "Not" to
5996 harmonize with FOL, ZF, LK, etc.;
5998 * HOL/ex/LFilter theory of a corecursive "filter" functional for
6001 * HOL/Modelcheck demonstrates invocation of model checker oracle;
6003 * HOL/ex/Ring.thy declares cring_simp, which solves equational
6004 problems in commutative rings, using axiomatic type classes for + and *;
6006 * more examples in HOL/MiniML and HOL/Auth;
6008 * more default rewrite rules for quantifiers, union/intersection;
6010 * a new constant `arbitrary == @x.False';
6012 * HOLCF/IOA replaces old HOL/IOA;
6014 * HOLCF changes: derived all rules and arities
6015 + axiomatic type classes instead of classes
6016 + typedef instead of faking type definitions
6017 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
6018 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
6019 + eliminated the types void, one, tr
6020 + use unit lift and bool lift (with translations) instead of one and tr
6021 + eliminated blift from Lift3.thy (use Def instead of blift)
6022 all eliminated rules are derived as theorems --> no visible changes ;
6027 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
6028 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
6029 as ZF_cs addSIs [equalityI];
6033 New in Isabelle94-7 (November 96)
6034 ---------------------------------
6036 * allowing negative levels (as offsets) in prlev and choplev;
6038 * super-linear speedup for large simplifications;
6040 * FOL, ZF and HOL now use miniscoping: rewriting pushes
6041 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
6042 FAIL); can suppress it using the command Delsimps (ex_simps @
6043 all_simps); De Morgan laws are also now included, by default;
6045 * improved printing of ==> : ~:
6047 * new object-logic "Sequents" adds linear logic, while replacing LK
6048 and Modal (thanks to Sara Kalvala);
6050 * HOL/Auth: correctness proofs for authentication protocols;
6052 * HOL: new auto_tac combines rewriting and classical reasoning (many
6053 examples on HOL/Auth);
6055 * HOL: new command AddIffs for declaring theorems of the form P=Q to
6056 the rewriter and classical reasoner simultaneously;
6058 * function uresult no longer returns theorems in "standard" format;
6059 regain previous version by: val uresult = standard o uresult;
6066 * oracles -- these establish an interface between Isabelle and trusted
6067 external reasoners, which may deliver results as theorems;
6069 * proof objects (in particular record all uses of oracles);
6071 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
6073 * "constdefs" section in theory files;
6075 * "primrec" section (HOL) no longer requires names;
6077 * internal type "tactic" now simply "thm -> thm Sequence.seq";
6084 * reduced space requirements;
6086 * automatic HTML generation from theories;
6088 * theory files no longer require "..." (quotes) around most types;
6090 * new examples, including two proofs of the Church-Rosser theorem;
6092 * non-curried (1994) version of HOL is no longer distributed;
6099 * greatly reduced space requirements;
6101 * theory files (.thy) no longer require \...\ escapes at line breaks;
6103 * searchable theorem database (see the section "Retrieving theorems" on
6104 page 8 of the Reference Manual);
6106 * new examples, including Grabczewski's monumental case study of the
6109 * The previous version of HOL renamed to Old_HOL;
6111 * The new version of HOL (previously called CHOL) uses a curried syntax
6112 for functions. Application looks like f a b instead of f(a,b);
6114 * Mutually recursive inductive definitions finally work in HOL;
6116 * In ZF, pattern-matching on tuples is now available in all abstractions and
6117 translates to the operator "split";
6124 * new infix operator, addss, allowing the classical reasoner to
6125 perform simplification at each step of its search. Example:
6126 fast_tac (cs addss ss)
6128 * a new logic, CHOL, the same as HOL, but with a curried syntax
6129 for functions. Application looks like f a b instead of f(a,b). Also pairs
6130 look like (a,b) instead of <a,b>;
6132 * PLEASE NOTE: CHOL will eventually replace HOL!
6134 * In CHOL, pattern-matching on tuples is now available in all abstractions.
6135 It translates to the operator "split". A new theory of integers is available;
6137 * In ZF, integer numerals now denote two's-complement binary integers.
6138 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
6140 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
6141 of the Axiom of Choice;
6148 * Significantly faster resolution;
6150 * the different sections in a .thy file can now be mixed and repeated
6153 * Database of theorems for FOL, HOL and ZF. New
6154 commands including qed, qed_goal and bind_thm store theorems in the database.
6156 * Simple database queries: return a named theorem (get_thm) or all theorems of
6157 a given theory (thms_of), or find out what theory a theorem was proved in
6160 * Bugs fixed in the inductive definition and datatype packages;
6162 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
6163 and HOL_dup_cs obsolete;
6165 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
6168 * Simpler definition of function space in ZF;
6170 * new results about cardinal and ordinal arithmetic in ZF;
6172 * 'subtype' facility in HOL for introducing new types as subsets of existing
6175 :mode=text:wrap=hard:maxLineLen=72: