more MaSh tweaking -- in particular, export the same facts in "MaSh_Export" as are later tried in "MaSh_Eval"
1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Theorem status about oracles and unfinished/failed future proofs is
10 no longer printed by default, since it is incompatible with
11 incremental / parallel checking of the persistent document model. ML
12 function Thm.peek_status may be used to inspect a snapshot of the
13 ongoing evaluation process. Note that in batch mode --- notably
14 isabelle build --- the system ensures that future proofs of all
15 accessible theorems in the theory context are finished (as before).
17 * Configuration option show_markup controls direct inlining of markup
18 into the printed representation of formal entities --- notably type
19 and sort constraints. This enables Prover IDE users to retrieve that
20 information via tooltips in the output window, for example.
22 * Command 'ML_file' evaluates ML text from a file directly within the
23 theory, without any predeclaration via 'uses' in the theory header.
25 * Old command 'use' command and corresponding keyword 'uses' in the
26 theory header are legacy features and will be discontinued soon.
27 Tools that load their additional source files may imitate the
28 'ML_file' implementation, such that the system can take care of
29 dependencies properly.
31 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
32 is called fastforce / fast_force_tac already since Isabelle2011-1.
34 * Updated and extended "isar-ref" and "implementation" manual, reduced
35 remaining material in old "ref" manual.
37 * Improved support for auxiliary contexts indicate block structure for
38 specifications: nesting of "context fixes ... context assumes ..."
39 and "class ... context ...".
41 * More informative error messages for Isar proof commands involving
42 lazy enumerations (method applications etc.).
44 * Refined 'help' command to retrieve outer syntax commands according
45 to name patterns (with clickable results).
48 *** Prover IDE -- Isabelle/Scala/jEdit ***
50 * Parallel terminal proofs ('by') are enabled by default, likewise
51 proofs that are built into packages like 'datatype', 'function'. This
52 allows to "run ahead" checking the theory specifications on the
53 surface, while the prover is still crunching on internal
54 justifications. Unfinished / cancelled proofs are restarted as
55 required to complete full proof checking eventually.
57 * Improved output panel with tooltips, hyperlinks etc. based on the
58 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
59 tooltips leads to some window that supports the same recursively,
60 which can lead to stacks of tooltips as the semantic document content
61 is explored. ESCAPE closes the whole stack, individual windows may be
62 closed separately, or detached to become independent jEdit dockables.
64 * More robust incremental parsing of outer syntax (partial comments,
65 malformed symbols). Changing the balance of open/close quotes and
66 comment delimiters works more conveniently with unfinished situations
67 that frequently occur in user interaction.
69 * More efficient painting and improved reactivity when editing large
70 files. More scalable management of formal document content.
72 * Smarter handling of tracing messages: output window informs about
73 accumulated messages; prover transactions are limited to emit maximum
74 amount of output, before being canceled (cf. system option
75 "editor_tracing_limit"). This avoids swamping the front-end with
76 potentially infinite message streams.
78 * More plugin options and preferences, based on Isabelle/Scala. The
79 jEdit plugin option panel provides access to some Isabelle/Scala
80 options, including tuning parameters for editor reactivity and color
83 * Dockable window "Symbols" provides some editing support for Isabelle
86 * Improved editing support for control styles: subscript, superscript,
87 bold, reset of style -- operating on single symbols or text
88 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
90 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
91 adjust the main text area font size, and its derivatives for output,
92 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS.
94 * Implicit check and build dialog of the specified logic session
95 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
96 demand, without bundling big platform-dependent heap images in the
97 Isabelle distribution.
99 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
100 from Oracle provide better multi-platform experience. This version is
101 now bundled exclusively with Isabelle.
106 * Code generation for Haskell: restrict unqualified imports from
107 Haskell Prelude to a small set of fundamental operations.
109 * Command "export_code": relative file names are interpreted
110 relatively to master directory of current theory rather than
111 the rather arbitrary current working directory.
114 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
115 use regular rule composition via "OF" / "THEN", or explicit proof
116 structure instead. Note that Isabelle/ML provides a variety of
117 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
118 with some care where this is really required.
120 * Command 'typ' supports an additional variant with explicit sort
121 constraint, to infer and check the most general type conforming to a
122 given given sort. Example (in HOL):
124 typ "_ * _ * bool * unit" :: finite
129 * Removed constant "chars". Prefer "Enum.enum" on type "char"
130 directly. INCOMPATIBILITY.
132 * Moved operation product, sublists and n_lists from Enum.thy
133 to List.thy. INCOMPATIBILITY.
135 * Simplified 'typedef' specifications: historical options for implicit
136 set definition and alternative name have been discontinued. The
137 former behavior of "typedef (open) t = A" is now the default, but
138 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
141 * Theory "Library/Multiset":
144 fold_mset ~> Multiset.fold -- for coherence with other fold combinators
147 fold_mset_commute ~> fold_mset_comm -- for coherence with fold_comm
151 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
153 * Class "comm_monoid_diff" formalises properties of bounded
154 subtraction, with natural numbers and multisets as typical instances.
156 * Theory "Library/Option_ord" provides instantiation of option type
157 to lattice type classes.
159 * New combinator "Option.these" with type "'a option set => 'a set".
161 * Renamed theory Library/List_Prefix to Library/Sublist.
162 INCOMPATIBILITY. Related changes are:
167 strict_prefix ~> prefix
169 Renamed lemmas accordingly, INCOMPATIBILITY.
171 - Replaced constant "postfix" by "suffixeq" with swapped argument order
172 (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped old infix
173 syntax "xs >>= ys"; use "suffixeq ys xs" instead. Renamed lemmas
174 accordingly. INCOMPATIBILITY.
176 - New constant "emb" for homeomorphic embedding on lists. New
177 abbreviation "sub" for special case "emb (op =)".
179 - Library/Sublist does no longer provide "order" and "bot" type class
180 instances for the prefix order (merely corresponding locale
181 interpretations). The type class instances are to be found in
182 Library/Prefix_Order. INCOMPATIBILITY.
184 - The sublist relation from Library/Sublist_Order is now based on
185 "Sublist.sub". Replaced lemmas:
187 le_list_append_le_same_iff ~> Sublist.sub_append_le_same_iff
188 le_list_append_mono ~> Sublist.emb_append_mono
189 le_list_below_empty ~> Sublist.emb_Nil, Sublist.emb_Nil2
190 le_list_Cons_EX ~> Sublist.emb_ConsD
191 le_list_drop_Cons2 ~> Sublist.sub_Cons2'
192 le_list_drop_Cons_neq ~> Sublist.sub_Cons2_neq
193 le_list_drop_Cons ~> Sublist.sub_Cons'
194 le_list_drop_many ~> Sublist.sub_drop_many
195 le_list_filter_left ~> Sublist.sub_filter_left
196 le_list_rev_drop_many ~> Sublist.sub_rev_drop_many
197 le_list_rev_take_iff ~> Sublist.sub_append
198 le_list_same_length ~> Sublist.sub_same_length
199 le_list_take_many_iff ~> Sublist.sub_append'
200 less_eq_list.drop ~> less_eq_list_drop
201 less_eq_list.induct ~> less_eq_list_induct
202 not_le_list_length ~> Sublist.not_sub_length
206 * HOL/Rings: renamed lemmas
208 left_distrib ~> distrib_right
209 right_distrib ~> distrib_left
211 in class semiring. INCOMPATIBILITY.
213 * HOL/BNF: New (co)datatype package based on bounded natural
214 functors with support for mixed, nested recursion and interesting
217 * HOL/Cardinals: Theories of ordinals and cardinals
218 (supersedes the AFP entry "Ordinals_and_Cardinals").
221 - Add simproc "measurable" to automatically prove measurability
223 - Add induction rules for sigma sets with disjoint union (sigma_sets_induct_disjoint)
224 and for Borel-measurable functions (borel_measurable_induct).
226 - The Daniell-Kolmogorov theorem (the existence the limit of a projective family)
228 * Library/Countable_Set.thy: Theory of countable sets.
230 * Library/Debug.thy and Library/Parallel.thy: debugging and parallel
231 execution for code generated towards Isabelle/ML.
233 * Library/FuncSet.thy: Extended support for Pi and extensional and introduce the
234 extensional dependent function space "PiE". Replaces extensional_funcset by an
235 abbreviation, rename a couple of lemmas from extensional_funcset to PiE:
237 extensional_empty ~> PiE_empty
238 extensional_funcset_empty_domain ~> PiE_empty_domain
239 extensional_funcset_empty_range ~> PiE_empty_range
240 extensional_funcset_arb ~> PiE_arb
241 extensional_funcset_mem > PiE_mem
242 extensional_funcset_extend_domainI ~> PiE_fun_upd
243 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
244 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
245 card_extensional_funcset ~> card_PiE
246 finite_extensional_funcset ~> finite_PiE
250 * Library/FinFun.thy: theory of almost everywhere constant functions
251 (supersedes the AFP entry "Code Generation for Functions as Data").
253 * Library/Phantom.thy: generic phantom type to make a type parameter
254 appear in a constant's type. This alternative to adding TYPE('a) as
255 another parameter avoids unnecessary closures in generated code.
257 * Library/RBT_Impl.thy: efficient construction of red-black trees
258 from sorted associative lists. Merging two trees with rbt_union may
259 return a structurally different tree than before. MINOR INCOMPATIBILITY.
261 * Library/IArray.thy: immutable arrays with code generation.
263 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
266 * Preprocessing of the code generator rewrites set comprehensions into
267 pointfree expressions.
271 - added an optimisation for equality premises.
272 It is switched on by default, and can be switched off by setting
273 the configuration quickcheck_optimise_equality to false.
275 * The SMT solver Z3 has now by default a restricted set of directly
276 supported features. For the full set of features (div/mod, nonlinear
277 arithmetic, datatypes/records) with potential proof reconstruction
278 failures, enable the configuration option "z3_with_extensions".
279 Minor INCOMPATIBILITY.
283 - Added MaSh relevance filter based on machine-learning; see the
284 Sledgehammer manual for details.
285 - Polished Isar proofs generated with "isar_proofs" option.
286 - Rationalized type encodings ("type_enc" option).
287 - Renamed "kill_provers" subcommand to "kill".
289 isar_proof ~> isar_proofs
290 isar_shrink_factor ~> isar_shrink
291 max_relevant ~> max_facts
292 relevance_thresholds ~> fact_thresholds
295 *** Document preparation ***
297 * Default for \<euro> is now based on eurosym package, instead of
298 slightly exotic babel/greek.
300 * Document variant NAME may use different LaTeX entry point
301 document/root_NAME.tex if that file exists, instead of the common
304 * Simplified custom document/build script, instead of old-style
305 document/IsaMakefile. Minor INCOMPATIBILITY.
310 * Type Seq.results and related operations support embedded error
311 messages within lazy enumerations, and thus allow to provide
312 informative errors in the absence of any usable results.
314 * Renamed Position.str_of to Position.here to emphasize that this is a
315 formal device to inline positions into message text, but not
316 necessarily printing visible text.
321 * The default limit for maximum number of worker threads is now 8,
324 * The ML system is configured as regular component, and no longer
325 picked up from some surrounding directory. Potential INCOMPATIBILITY
326 for home-made configurations.
328 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
329 Minor INCOMPATIBILITY in command-line options.
331 * Advanced support for Isabelle sessions and build management, see
332 "system" manual for the chapter of that name, especially the "isabelle
333 build" tool and its examples. INCOMPATIBILITY, isabelle usedir /
334 mkdir / make are rendered obsolete.
336 * Discontinued obsolete "isabelle makeall".
338 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
339 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
340 provides some traditional targets that invoke "isabelle build". Note
341 that this is inefficient! Applications of Isabelle/HOL involving
342 "isabelle make" should be upgraded to use "isabelle build" directly.
344 * Discontinued obsolete Isabelle/build script, it is superseded by the
345 regular isabelle build tool. For example:
347 isabelle build -s -b HOLCF
349 * The "isabelle options" tool prints Isabelle system options, as
350 required for "isabelle build", for example.
352 * The "isabelle mkroot" tool prepares session root directories for use
353 with "isabelle build", similar to former "isabelle mkdir" for
356 * The "isabelle components" tool helps to resolve add-on components
357 that are not bundled, or referenced from a bare-bones repository
360 * The "isabelle install" tool has now a simpler command-line. Minor
363 * Discontinued support for Poly/ML 5.2.1, which was the last version
364 without exception positions and advanced ML compiler/toplevel
367 * Discontinued special treatment of Proof General -- no longer guess
368 PROOFGENERAL_HOME based on accidental file-system layout. Minor
369 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
370 settings manually, or use a Proof General version that has been
371 bundled as Isabelle component.
373 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
374 platform family: "linux", "macos", "windows".
377 New in Isabelle2012 (May 2012)
378 ------------------------------
382 * Prover IDE (PIDE) improvements:
384 - more robust Sledgehammer integration (as before the sledgehammer
385 command-line needs to be typed into the source buffer)
386 - markup for bound variables
387 - markup for types of term variables (displayed as tooltips)
388 - support for user-defined Isar commands within the running session
389 - improved support for Unicode outside original 16bit range
390 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
392 * Forward declaration of outer syntax keywords within the theory
393 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
394 commands to be used in the same theory where defined.
396 * Auxiliary contexts indicate block structure for specifications with
397 additional parameters and assumptions. Such unnamed contexts may be
398 nested within other targets, like 'theory', 'locale', 'class',
399 'instantiation' etc. Results from the local context are generalized
400 accordingly and applied to the enclosing target context. Example:
404 assumes xy: "x = y" and yz: "y = z"
407 lemma my_trans: "x = z" using xy yz by simp
413 The most basic application is to factor-out context elements of
414 several fixes/assumes/shows theorem statements, e.g. see
415 ~~/src/HOL/Isar_Examples/Group_Context.thy
417 Any other local theory specification element works within the "context
418 ... begin ... end" block as well.
420 * Bundled declarations associate attributed fact expressions with a
421 given name in the context. These may be later included in other
422 contexts. This allows to manage context extensions casually, without
423 the logical dependencies of locales and locale interpretation. See
424 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
426 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
427 declaration, and results are standardized before being stored. Thus
428 old-style "standard" after instantiation or composition of facts
429 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
430 indices of schematic variables.
432 * Rule attributes in local theory declarations (e.g. locale or class)
433 are now statically evaluated: the resulting theorem is stored instead
434 of the original expression. INCOMPATIBILITY in rare situations, where
435 the historic accident of dynamic re-evaluation in interpretations
438 * New tutorial "Programming and Proving in Isabelle/HOL"
439 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
440 Structured Isar Proofs" ("isar-overview"), which has been removed. It
441 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
442 Logic" as the recommended beginners tutorial, but does not cover all
443 of the material of that old tutorial.
445 * Updated and extended reference manuals: "isar-ref",
446 "implementation", "system"; reduced remaining material in old "ref"
452 * Command 'definition' no longer exports the foundational "raw_def"
453 into the user context. Minor INCOMPATIBILITY, may use the regular
454 "def" result with attribute "abs_def" to imitate the old version.
456 * Attribute "abs_def" turns an equation of the form "f x y == t" into
457 "f == %x y. t", which ensures that "simp" or "unfold" steps always
458 expand it. This also works for object-logic equality. (Formerly
459 undocumented feature.)
461 * Sort constraints are now propagated in simultaneous statements, just
462 like type constraints. INCOMPATIBILITY in rare situations, where
463 distinct sorts used to be assigned accidentally. For example:
465 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
467 lemma "P (x::'a)" and "Q (y::'a::bar)"
468 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
470 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
471 tolerant against multiple unifiers, as long as the final result is
472 unique. (As before, rules are composed in canonical right-to-left
473 order to accommodate newly introduced premises.)
475 * Renamed some inner syntax categories:
481 Minor INCOMPATIBILITY. Note that in practice "num_const" or
482 "num_position" etc. are mainly used instead (which also include
483 position information via constraints).
485 * Simplified configuration options for syntax ambiguity: see
486 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
487 manual. Minor INCOMPATIBILITY.
489 * Discontinued configuration option "syntax_positions": atomic terms
490 in parse trees are always annotated by position constraints.
492 * Old code generator for SML and its commands 'code_module',
493 'code_library', 'consts_code', 'types_code' have been discontinued.
494 Use commands of the generic code generator instead. INCOMPATIBILITY.
496 * Redundant attribute "code_inline" has been discontinued. Use
497 "code_unfold" instead. INCOMPATIBILITY.
499 * Dropped attribute "code_unfold_post" in favor of the its dual
500 "code_abbrev", which yields a common pattern in definitions like
502 definition [code_abbrev]: "f = t"
506 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
507 instead. INCOMPATIBILITY.
509 * Discontinued old "prems" fact, which used to refer to the accidental
510 collection of foundational premises in the context (already marked as
511 legacy since Isabelle2011).
516 * Type 'a set is now a proper type constructor (just as before
517 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
518 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
519 sets separate, it is often sufficient to rephrase some set S that has
520 been accidentally used as predicates by "%x. x : S", and some
521 predicate P that has been accidentally used as set by "{x. P x}".
522 Corresponding proofs in a first step should be pruned from any
523 tinkering with former theorems mem_def and Collect_def as far as
526 For developments which deliberately mix predicates and sets, a
527 planning step is necessary to determine what should become a predicate
528 and what a set. It can be helpful to carry out that step in
529 Isabelle2011-1 before jumping right into the current release.
531 * Code generation by default implements sets as container type rather
532 than predicates. INCOMPATIBILITY.
534 * New type synonym 'a rel = ('a * 'a) set
536 * The representation of numerals has changed. Datatype "num"
537 represents strictly positive binary numerals, along with functions
538 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
539 positive and negated numeric literals, respectively. See also
540 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
541 user theories may require adaptations as follows:
543 - Theorems with number_ring or number_semiring constraints: These
544 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
546 - Theories defining numeric types: Remove number, number_semiring,
547 and number_ring instances. Defer all theorems about numerals until
548 after classes one and semigroup_add have been instantiated.
550 - Numeral-only simp rules: Replace each rule having a "number_of v"
551 pattern with two copies, one for numeral and one for neg_numeral.
553 - Theorems about subclasses of semiring_1 or ring_1: These classes
554 automatically support numerals now, so more simp rules and
555 simprocs may now apply within the proof.
557 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
558 Redefine using other integer operations.
560 * Transfer: New package intended to generalize the existing
561 "descending" method and related theorem attributes from the Quotient
562 package. (Not all functionality is implemented yet, but future
563 development will focus on Transfer as an eventual replacement for the
564 corresponding parts of the Quotient package.)
566 - transfer_rule attribute: Maintains a collection of transfer rules,
567 which relate constants at two different types. Transfer rules may
568 relate different type instances of the same polymorphic constant,
569 or they may relate an operation on a raw type to a corresponding
570 operation on an abstract type (quotient or subtype). For example:
572 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
573 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
575 - transfer method: Replaces a subgoal on abstract types with an
576 equivalent subgoal on the corresponding raw types. Constants are
577 replaced with corresponding ones according to the transfer rules.
578 Goals are generalized over all free variables by default; this is
579 necessary for variables whose types change, but can be overridden
580 for specific variables with e.g. "transfer fixing: x y z". The
581 variant transfer' method allows replacing a subgoal with one that
582 is logically stronger (rather than equivalent).
584 - relator_eq attribute: Collects identity laws for relators of
585 various type constructors, e.g. "list_all2 (op =) = (op =)". The
586 transfer method uses these lemmas to infer transfer rules for
587 non-polymorphic constants on the fly.
589 - transfer_prover method: Assists with proving a transfer rule for a
590 new constant, provided the constant is defined in terms of other
591 constants that already have transfer rules. It should be applied
592 after unfolding the constant definitions.
594 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
595 from type nat to type int.
597 * Lifting: New package intended to generalize the quotient_definition
598 facility of the Quotient package; designed to work with Transfer.
600 - lift_definition command: Defines operations on an abstract type in
601 terms of a corresponding operation on a representation
602 type. Example syntax:
604 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
607 Users must discharge a respectfulness proof obligation when each
608 constant is defined. (For a type copy, i.e. a typedef with UNIV,
609 the proof is discharged automatically.) The obligation is
610 presented in a user-friendly, readable form; a respectfulness
611 theorem in the standard format and a transfer rule are generated
614 - Integration with code_abstype: For typedefs (e.g. subtypes
615 corresponding to a datatype invariant, such as dlist),
616 lift_definition generates a code certificate theorem and sets up
617 code generation for each constant.
619 - setup_lifting command: Sets up the Lifting package to work with a
620 user-defined type. The user must provide either a quotient theorem
621 or a type_definition theorem. The package configures transfer
622 rules for equality and quantifiers on the type, and sets up the
623 lift_definition command to work with the type.
625 - Usage examples: See Quotient_Examples/Lift_DList.thy,
626 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
627 Word/Word.thy and Library/Float.thy.
631 - The 'quotient_type' command now supports a 'morphisms' option with
632 rep and abs functions, similar to typedef.
634 - 'quotient_type' sets up new types to work with the Lifting and
635 Transfer packages, as with 'setup_lifting'.
637 - The 'quotient_definition' command now requires the user to prove a
638 respectfulness property at the point where the constant is
639 defined, similar to lift_definition; INCOMPATIBILITY.
641 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
642 accordingly, INCOMPATIBILITY.
644 * New diagnostic command 'find_unused_assms' to find potentially
645 superfluous assumptions in theorems using Quickcheck.
649 - Quickcheck returns variable assignments as counterexamples, which
650 allows to reveal the underspecification of functions under test.
651 For example, refuting "hd xs = x", it presents the variable
652 assignment xs = [] and x = a1 as a counterexample, assuming that
653 any property is false whenever "hd []" occurs in it.
655 These counterexample are marked as potentially spurious, as
656 Quickcheck also returns "xs = []" as a counterexample to the
657 obvious theorem "hd xs = hd xs".
659 After finding a potentially spurious counterexample, Quickcheck
660 continues searching for genuine ones.
662 By default, Quickcheck shows potentially spurious and genuine
663 counterexamples. The option "genuine_only" sets quickcheck to only
664 show genuine counterexamples.
666 - The command 'quickcheck_generator' creates random and exhaustive
667 value generators for a given type and operations.
669 It generates values by using the operations as if they were
670 constructors of that type.
672 - Support for multisets.
674 - Added "use_subtype" options.
676 - Added "quickcheck_locale" configuration to specify how to process
677 conjectures in a locale context.
679 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
680 and affecting 'rat' and 'real'.
683 - Integrated more tightly with SPASS, as described in the ITP 2012
684 paper "More SPASS with Isabelle".
685 - Made it try "smt" as a fallback if "metis" fails or times out.
686 - Added support for the following provers: Alt-Ergo (via Why3 and
687 TFF1), iProver, iProver-Eq.
688 - Sped up the minimizer.
689 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
690 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
691 - Renamed "sound" option to "strict".
693 * Metis: Added possibility to specify lambda translations scheme as a
694 parenthesized argument (e.g., "by (metis (lifting) ...)").
696 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
698 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
700 * New "case_product" attribute to generate a case rule doing multiple
701 case distinctions at the same time. E.g.
703 list.exhaust [case_product nat.exhaust]
705 produces a rule which can be used to perform case distinction on both
708 * New "eventually_elim" method as a generalized variant of the
709 eventually_elim* rules. Supports structured proofs.
711 * Typedef with implicit set definition is considered legacy. Use
712 "typedef (open)" form instead, which will eventually become the
715 * Record: code generation can be switched off manually with
717 declare [[record_coden = false]] -- "default true"
719 * Datatype: type parameters allow explicit sort constraints.
721 * Concrete syntax for case expressions includes constraints for source
722 positions, and thus produces Prover IDE markup for its bindings.
723 INCOMPATIBILITY for old-style syntax translations that augment the
724 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
727 * Clarified attribute "mono_set": pure declaration without modifying
728 the result of the fact expression.
730 * More default pred/set conversions on a couple of relation operations
731 and predicates. Added powers of predicate relations. Consolidation
732 of some relation theorems:
734 converse_def ~> converse_unfold
735 rel_comp_def ~> relcomp_unfold
736 symp_def ~> (modified, use symp_def and sym_def instead)
737 transp_def ~> transp_trans
738 Domain_def ~> Domain_unfold
739 Range_def ~> Domain_converse [symmetric]
741 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
743 See theory "Relation" for examples for making use of pred/set
744 conversions by means of attributes "to_set" and "to_pred".
748 * Renamed facts about the power operation on relations, i.e., relpow
749 to match the constant's name:
751 rel_pow_1 ~> relpow_1
752 rel_pow_0_I ~> relpow_0_I
753 rel_pow_Suc_I ~> relpow_Suc_I
754 rel_pow_Suc_I2 ~> relpow_Suc_I2
755 rel_pow_0_E ~> relpow_0_E
756 rel_pow_Suc_E ~> relpow_Suc_E
757 rel_pow_E ~> relpow_E
758 rel_pow_Suc_D2 ~> relpow_Suc_D2
759 rel_pow_Suc_E2 ~> relpow_Suc_E2
760 rel_pow_Suc_D2' ~> relpow_Suc_D2'
761 rel_pow_E2 ~> relpow_E2
762 rel_pow_add ~> relpow_add
763 rel_pow_commute ~> relpow
764 rel_pow_empty ~> relpow_empty:
765 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
766 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
767 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
768 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
769 rel_pow_fun_conv ~> relpow_fun_conv
770 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
771 rel_pow_finite_bounded ~> relpow_finite_bounded
772 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
773 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
774 single_valued_rel_pow ~> single_valued_relpow
778 * Theory Relation: Consolidated constant name for relation composition
779 and corresponding theorem names:
781 - Renamed constant rel_comp to relcomp.
783 - Dropped abbreviation pred_comp. Use relcompp instead.
787 rel_compI ~> relcompI
788 rel_compEpair ~> relcompEpair
789 rel_compE ~> relcompE
790 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
791 rel_comp_empty1 ~> relcomp_empty1
792 rel_comp_mono ~> relcomp_mono
793 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
794 rel_comp_distrib ~> relcomp_distrib
795 rel_comp_distrib2 ~> relcomp_distrib2
796 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
797 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
798 single_valued_rel_comp ~> single_valued_relcomp
799 rel_comp_def ~> relcomp_unfold
800 converse_rel_comp ~> converse_relcomp
801 pred_compI ~> relcomppI
802 pred_compE ~> relcomppE
803 pred_comp_bot1 ~> relcompp_bot1
804 pred_comp_bot2 ~> relcompp_bot2
805 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
806 pred_comp_mono ~> relcompp_mono
807 pred_comp_distrib ~> relcompp_distrib
808 pred_comp_distrib2 ~> relcompp_distrib2
809 converse_pred_comp ~> converse_relcompp
811 finite_rel_comp ~> finite_relcomp
813 set_rel_comp ~> set_relcomp
817 * Theory Divides: Discontinued redundant theorems about div and mod.
818 INCOMPATIBILITY, use the corresponding generic theorems instead.
820 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
821 zdiv_self ~> div_self
822 zmod_self ~> mod_self
825 zdiv_zmod_equality ~> div_mod_equality2
826 zdiv_zmod_equality2 ~> div_mod_equality
827 zmod_zdiv_trivial ~> mod_div_trivial
828 zdiv_zminus_zminus ~> div_minus_minus
829 zmod_zminus_zminus ~> mod_minus_minus
830 zdiv_zminus2 ~> div_minus_right
831 zmod_zminus2 ~> mod_minus_right
832 zdiv_minus1_right ~> div_minus1_right
833 zmod_minus1_right ~> mod_minus1_right
834 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
835 zmod_zmult1_eq ~> mod_mult_right_eq
836 zpower_zmod ~> power_mod
838 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
839 mod_mult_distrib ~> mult_mod_left
840 mod_mult_distrib2 ~> mult_mod_right
842 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
843 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
845 * Finite_Set.fold now qualified. INCOMPATIBILITY.
847 * Consolidated theorem names concerning fold combinators:
849 inf_INFI_fold_inf ~> inf_INF_fold_inf
850 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
851 INFI_fold_inf ~> INF_fold_inf
852 SUPR_fold_sup ~> SUP_fold_sup
853 union_set ~> union_set_fold
854 minus_set ~> minus_set_fold
855 INFI_set_fold ~> INF_set_fold
856 SUPR_set_fold ~> SUP_set_fold
857 INF_code ~> INF_set_foldr
858 SUP_code ~> SUP_set_foldr
859 foldr.simps ~> foldr.simps (in point-free formulation)
860 foldr_fold_rev ~> foldr_conv_fold
861 foldl_fold ~> foldl_conv_fold
862 foldr_foldr ~> foldr_conv_foldl
863 foldl_foldr ~> foldl_conv_foldr
864 fold_set_remdups ~> fold_set_fold_remdups
865 fold_set ~> fold_set_fold
866 fold1_set ~> fold1_set_fold
870 * Dropped rarely useful theorems concerning fold combinators:
871 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
872 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
873 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
874 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
875 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
876 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
877 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
878 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
879 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
880 unfolding "foldr_conv_fold" and "foldl_conv_fold".
882 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
883 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
884 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
885 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
886 lemmas over fold rather than foldr, or make use of lemmas
887 fold_conv_foldr and fold_rev.
889 * Congruence rules Option.map_cong and Option.bind_cong for recursion
890 through option types.
892 * "Transitive_Closure.ntrancl": bounded transitive closure on
895 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
897 * Theory Int: Discontinued many legacy theorems specific to type int.
898 INCOMPATIBILITY, use the corresponding generic theorems instead.
900 zminus_zminus ~> minus_minus
901 zminus_0 ~> minus_zero
902 zminus_zadd_distrib ~> minus_add_distrib
903 zadd_commute ~> add_commute
904 zadd_assoc ~> add_assoc
905 zadd_left_commute ~> add_left_commute
909 zadd_0_right ~> add_0_right
910 zadd_zminus_inverse2 ~> left_minus
911 zmult_zminus ~> mult_minus_left
912 zmult_commute ~> mult_commute
913 zmult_assoc ~> mult_assoc
914 zadd_zmult_distrib ~> left_distrib
915 zadd_zmult_distrib2 ~> right_distrib
916 zdiff_zmult_distrib ~> left_diff_distrib
917 zdiff_zmult_distrib2 ~> right_diff_distrib
918 zmult_1 ~> mult_1_left
919 zmult_1_right ~> mult_1_right
920 zle_refl ~> order_refl
921 zle_trans ~> order_trans
922 zle_antisym ~> order_antisym
923 zle_linear ~> linorder_linear
924 zless_linear ~> linorder_less_linear
925 zadd_left_mono ~> add_left_mono
926 zadd_strict_right_mono ~> add_strict_right_mono
927 zadd_zless_mono ~> add_less_le_mono
928 int_0_less_1 ~> zero_less_one
929 int_0_neq_1 ~> zero_neq_one
931 zpower_zadd_distrib ~> power_add
932 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
933 zero_le_zpower_abs ~> zero_le_power_abs
935 * Theory Deriv: Renamed
937 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
939 * Theory Library/Multiset: Improved code generation of multisets.
941 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
942 are expressed via type classes again. The special syntax
943 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
944 setsum_set, which is now subsumed by Big_Operators.setsum.
947 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
948 use theory HOL/Library/Nat_Bijection instead.
950 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
951 trees is now inside a type class context. Names of affected
952 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
953 theories working directly with raw red-black trees, adapt the names as
957 bulkload -> rbt_bulkload
958 del_from_left -> rbt_del_from_left
959 del_from_right -> rbt_del_from_right
964 insertw -> rbt_insert_with
965 insert_with_key -> rbt_insert_with_key
966 map_entry -> rbt_map_entry
969 tree_greater -> rbt_greater
970 tree_less -> rbt_less
971 tree_less_symbol -> rbt_less_symbol
973 union_with -> rbt_union_with
974 union_with_key -> rbt_union_with_key
977 balance_left_sorted -> balance_left_rbt_sorted
978 balance_left_tree_greater -> balance_left_rbt_greater
979 balance_left_tree_less -> balance_left_rbt_less
980 balance_right_sorted -> balance_right_rbt_sorted
981 balance_right_tree_greater -> balance_right_rbt_greater
982 balance_right_tree_less -> balance_right_rbt_less
983 balance_sorted -> balance_rbt_sorted
984 balance_tree_greater -> balance_rbt_greater
985 balance_tree_less -> balance_rbt_less
986 bulkload_is_rbt -> rbt_bulkload_is_rbt
987 combine_sorted -> combine_rbt_sorted
988 combine_tree_greater -> combine_rbt_greater
989 combine_tree_less -> combine_rbt_less
990 delete_in_tree -> rbt_delete_in_tree
991 delete_is_rbt -> rbt_delete_is_rbt
992 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
993 del_from_left_tree_less -> rbt_del_from_left_rbt_less
994 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
995 del_from_right_tree_less -> rbt_del_from_right_rbt_less
996 del_in_tree -> rbt_del_in_tree
997 del_inv1_inv2 -> rbt_del_inv1_inv2
998 del_sorted -> rbt_del_rbt_sorted
999 del_tree_greater -> rbt_del_rbt_greater
1000 del_tree_less -> rbt_del_rbt_less
1001 dom_lookup_Branch -> dom_rbt_lookup_Branch
1002 entries_lookup -> entries_rbt_lookup
1003 finite_dom_lookup -> finite_dom_rbt_lookup
1004 insert_sorted -> rbt_insert_rbt_sorted
1005 insertw_is_rbt -> rbt_insertw_is_rbt
1006 insertwk_is_rbt -> rbt_insertwk_is_rbt
1007 insertwk_sorted -> rbt_insertwk_rbt_sorted
1008 insertw_sorted -> rbt_insertw_rbt_sorted
1009 ins_sorted -> ins_rbt_sorted
1010 ins_tree_greater -> ins_rbt_greater
1011 ins_tree_less -> ins_rbt_less
1012 is_rbt_sorted -> is_rbt_rbt_sorted
1013 lookup_balance -> rbt_lookup_balance
1014 lookup_bulkload -> rbt_lookup_rbt_bulkload
1015 lookup_delete -> rbt_lookup_rbt_delete
1016 lookup_Empty -> rbt_lookup_Empty
1017 lookup_from_in_tree -> rbt_lookup_from_in_tree
1018 lookup_in_tree -> rbt_lookup_in_tree
1019 lookup_ins -> rbt_lookup_ins
1020 lookup_insert -> rbt_lookup_rbt_insert
1021 lookup_insertw -> rbt_lookup_rbt_insertw
1022 lookup_insertwk -> rbt_lookup_rbt_insertwk
1023 lookup_keys -> rbt_lookup_keys
1024 lookup_map -> rbt_lookup_map
1025 lookup_map_entry -> rbt_lookup_rbt_map_entry
1026 lookup_tree_greater -> rbt_lookup_rbt_greater
1027 lookup_tree_less -> rbt_lookup_rbt_less
1028 lookup_union -> rbt_lookup_rbt_union
1029 map_entry_color_of -> rbt_map_entry_color_of
1030 map_entry_inv1 -> rbt_map_entry_inv1
1031 map_entry_inv2 -> rbt_map_entry_inv2
1032 map_entry_is_rbt -> rbt_map_entry_is_rbt
1033 map_entry_sorted -> rbt_map_entry_rbt_sorted
1034 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1035 map_entry_tree_less -> rbt_map_entry_rbt_less
1036 map_tree_greater -> map_rbt_greater
1037 map_tree_less -> map_rbt_less
1038 map_sorted -> map_rbt_sorted
1039 paint_sorted -> paint_rbt_sorted
1040 paint_lookup -> paint_rbt_lookup
1041 paint_tree_greater -> paint_rbt_greater
1042 paint_tree_less -> paint_rbt_less
1043 sorted_entries -> rbt_sorted_entries
1044 tree_greater_eq_trans -> rbt_greater_eq_trans
1045 tree_greater_nit -> rbt_greater_nit
1046 tree_greater_prop -> rbt_greater_prop
1047 tree_greater_simps -> rbt_greater_simps
1048 tree_greater_trans -> rbt_greater_trans
1049 tree_less_eq_trans -> rbt_less_eq_trans
1050 tree_less_nit -> rbt_less_nit
1051 tree_less_prop -> rbt_less_prop
1052 tree_less_simps -> rbt_less_simps
1053 tree_less_trans -> rbt_less_trans
1054 tree_ord_props -> rbt_ord_props
1055 union_Branch -> rbt_union_Branch
1056 union_is_rbt -> rbt_union_is_rbt
1057 unionw_is_rbt -> rbt_unionw_is_rbt
1058 unionwk_is_rbt -> rbt_unionwk_is_rbt
1059 unionwk_sorted -> rbt_unionwk_rbt_sorted
1061 * Theory HOL/Library/Float: Floating point numbers are now defined as
1062 a subset of the real numbers. All operations are defined using the
1063 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1070 round_down -> float_round_down
1071 round_up -> float_round_up
1075 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1078 abs_float_def -> Float.compute_float_abs
1079 bitlen_ge0 -> bitlen_nonneg
1080 bitlen.simps -> Float.compute_bitlen
1081 float_components -> Float_mantissa_exponent
1082 float_divl.simps -> Float.compute_float_divl
1083 float_divr.simps -> Float.compute_float_divr
1084 float_eq_odd -> mult_powr_eq_mult_powr_iff
1085 float_power -> real_of_float_power
1086 lapprox_posrat_def -> Float.compute_lapprox_posrat
1087 lapprox_rat.simps -> Float.compute_lapprox_rat
1088 le_float_def' -> Float.compute_float_le
1089 le_float_def -> less_eq_float.rep_eq
1090 less_float_def' -> Float.compute_float_less
1091 less_float_def -> less_float.rep_eq
1092 normfloat_def -> Float.compute_normfloat
1093 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1094 normfloat -> normfloat_def
1095 normfloat_unique -> use normfloat_def
1096 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1097 one_float_def -> Float.compute_float_one
1098 plus_float_def -> Float.compute_float_plus
1099 rapprox_posrat_def -> Float.compute_rapprox_posrat
1100 rapprox_rat.simps -> Float.compute_rapprox_rat
1101 real_of_float_0 -> zero_float.rep_eq
1102 real_of_float_1 -> one_float.rep_eq
1103 real_of_float_abs -> abs_float.rep_eq
1104 real_of_float_add -> plus_float.rep_eq
1105 real_of_float_minus -> uminus_float.rep_eq
1106 real_of_float_mult -> times_float.rep_eq
1107 real_of_float_simp -> Float.rep_eq
1108 real_of_float_sub -> minus_float.rep_eq
1109 round_down.simps -> Float.compute_float_round_down
1110 round_up.simps -> Float.compute_float_round_up
1111 times_float_def -> Float.compute_float_times
1112 uminus_float_def -> Float.compute_float_uminus
1113 zero_float_def -> Float.compute_float_zero
1115 Lemmas not necessary anymore, use the transfer method:
1116 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1117 float_divr, float_le_simp, float_less1_mantissa_bound,
1118 float_less_simp, float_less_zero, float_le_zero,
1119 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1120 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1121 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1122 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1123 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1124 round_up, zero_le_float, zero_less_float
1126 * New theory HOL/Library/DAList provides an abstract type for
1127 association lists with distinct keys.
1129 * Session HOL/IMP: Added new theory of abstract interpretation of
1132 * Session HOL-Import: Re-implementation from scratch is faster,
1133 simpler, and more scalable. Requires a proof bundle, which is
1134 available as an external component. Discontinued old (and mostly
1135 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1137 * Session HOL-Word: Discontinued many redundant theorems specific to
1138 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1141 word_sub_alt ~> word_sub_wi
1142 word_add_alt ~> word_add_def
1143 word_mult_alt ~> word_mult_def
1144 word_minus_alt ~> word_minus_def
1145 word_0_alt ~> word_0_wi
1146 word_1_alt ~> word_1_wi
1147 word_add_0 ~> add_0_left
1148 word_add_0_right ~> add_0_right
1149 word_mult_1 ~> mult_1_left
1150 word_mult_1_right ~> mult_1_right
1151 word_add_commute ~> add_commute
1152 word_add_assoc ~> add_assoc
1153 word_add_left_commute ~> add_left_commute
1154 word_mult_commute ~> mult_commute
1155 word_mult_assoc ~> mult_assoc
1156 word_mult_left_commute ~> mult_left_commute
1157 word_left_distrib ~> left_distrib
1158 word_right_distrib ~> right_distrib
1159 word_left_minus ~> left_minus
1160 word_diff_0_right ~> diff_0_right
1161 word_diff_self ~> diff_self
1162 word_sub_def ~> diff_minus
1163 word_diff_minus ~> diff_minus
1164 word_add_ac ~> add_ac
1165 word_mult_ac ~> mult_ac
1166 word_plus_ac0 ~> add_0_left add_0_right add_ac
1167 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1168 word_order_trans ~> order_trans
1169 word_order_refl ~> order_refl
1170 word_order_antisym ~> order_antisym
1171 word_order_linear ~> linorder_linear
1172 lenw1_zero_neq_one ~> zero_neq_one
1173 word_number_of_eq ~> number_of_eq
1174 word_of_int_add_hom ~> wi_hom_add
1175 word_of_int_sub_hom ~> wi_hom_sub
1176 word_of_int_mult_hom ~> wi_hom_mult
1177 word_of_int_minus_hom ~> wi_hom_neg
1178 word_of_int_succ_hom ~> wi_hom_succ
1179 word_of_int_pred_hom ~> wi_hom_pred
1180 word_of_int_0_hom ~> word_0_wi
1181 word_of_int_1_hom ~> word_1_wi
1183 * Session HOL-Word: New proof method "word_bitwise" for splitting
1184 machine word equalities and inequalities into logical circuits,
1185 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1186 multiplication, shifting by constants, bitwise operators and numeric
1187 constants. Requires fixed-length word types, not 'a word. Solves
1188 many standard word identities outright and converts more into first
1189 order problems amenable to blast or similar. See also examples in
1190 HOL/Word/Examples/WordExamples.thy.
1192 * Session HOL-Probability: Introduced the type "'a measure" to
1193 represent measures, this replaces the records 'a algebra and 'a
1194 measure_space. The locales based on subset_class now have two
1195 locale-parameters the space \<Omega> and the set of measurable sets M.
1196 The product of probability spaces uses now the same constant as the
1197 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1198 measure". Most constants are defined now outside of locales and gain
1199 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1200 Measure space constructions for distributions and densities now got
1201 their own constants distr and density. Instead of using locales to
1202 describe measure spaces with a finite space, the measure count_space
1203 and point_measure is introduced. INCOMPATIBILITY.
1207 finite_measure.\<mu>' -> measure
1208 product_algebra_generator -> prod_algebra
1209 product_prob_space.emb -> prod_emb
1210 product_prob_space.infprod_algebra -> PiM
1213 completeable_measure_space
1214 finite_measure_space
1216 finite_product_finite_prob_space
1217 finite_product_sigma_algebra
1218 finite_sigma_algebra
1220 pair_finite_prob_space
1221 pair_finite_sigma_algebra
1224 product_sigma_algebra
1228 distribution -> use distr measure, or distributed predicate
1230 joint_distribution -> use distr measure, or distributed predicate
1231 pair_measure_generator
1232 product_prob_space.infprod_algebra -> use PiM
1235 Replacement theorems:
1236 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1237 finite_measure.empty_measure -> measure_empty
1238 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1239 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1240 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1241 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1242 finite_measure.finite_measure -> finite_measure.emeasure_finite
1243 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1244 finite_measure.positive_measure' -> measure_nonneg
1245 finite_measure.real_measure -> finite_measure.emeasure_real
1246 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1247 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1248 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1249 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1250 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1251 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1252 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1253 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1254 information_space.entropy_commute -> information_space.entropy_commute_simple
1255 information_space.entropy_eq -> information_space.entropy_simple_distributed
1256 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1257 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1258 information_space.entropy_uniform_max -> information_space.entropy_uniform
1259 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1260 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1261 information_space.KL_ge_0 -> information_space.KL_nonneg
1262 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1263 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1264 Int_stable_cuboids -> Int_stable_atLeastAtMost
1265 Int_stable_product_algebra_generator -> positive_integral
1266 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1267 measure_space.additive -> emeasure_additive
1268 measure_space.AE_iff_null_set -> AE_iff_null
1269 measure_space.almost_everywhere_def -> eventually_ae_filter
1270 measure_space.almost_everywhere_vimage -> AE_distrD
1271 measure_space.continuity_from_above -> INF_emeasure_decseq
1272 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1273 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1274 measure_space.continuity_from_below -> SUP_emeasure_incseq
1275 measure_space_density -> emeasure_density
1276 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1277 measure_space.integrable_vimage -> integrable_distr
1278 measure_space.integral_translated_density -> integral_density
1279 measure_space.integral_vimage -> integral_distr
1280 measure_space.measure_additive -> plus_emeasure
1281 measure_space.measure_compl -> emeasure_compl
1282 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1283 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1284 measure_space.measure_decseq -> decseq_emeasure
1285 measure_space.measure_Diff -> emeasure_Diff
1286 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1287 measure_space.measure_eq_0 -> emeasure_eq_0
1288 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1289 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1290 measure_space.measure_incseq -> incseq_emeasure
1291 measure_space.measure_insert -> emeasure_insert
1292 measure_space.measure_mono -> emeasure_mono
1293 measure_space.measure_not_negative -> emeasure_not_MInf
1294 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1295 measure_space.measure_setsum -> setsum_emeasure
1296 measure_space.measure_setsum_split -> setsum_emeasure_cover
1297 measure_space.measure_space_vimage -> emeasure_distr
1298 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1299 measure_space.measure_subadditive -> subadditive
1300 measure_space.measure_top -> emeasure_space
1301 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1302 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1303 measure_space.positive_integral_translated_density -> positive_integral_density
1304 measure_space.positive_integral_vimage -> positive_integral_distr
1305 measure_space.real_continuity_from_above -> Lim_measure_decseq
1306 measure_space.real_continuity_from_below -> Lim_measure_incseq
1307 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1308 measure_space.real_measure_Diff -> measure_Diff
1309 measure_space.real_measure_finite_Union -> measure_finite_Union
1310 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1311 measure_space.real_measure_subadditive -> measure_subadditive
1312 measure_space.real_measure_Union -> measure_Union
1313 measure_space.real_measure_UNION -> measure_UNION
1314 measure_space.simple_function_vimage -> simple_function_comp
1315 measure_space.simple_integral_vimage -> simple_integral_distr
1316 measure_space.simple_integral_vimage -> simple_integral_distr
1317 measure_unique_Int_stable -> measure_eqI_generator_eq
1318 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1319 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1320 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1321 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1322 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1323 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1324 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1325 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1326 pair_sigma_algebra.sets_swap -> sets_pair_swap
1327 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1328 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1329 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1330 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1331 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1332 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1333 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1334 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1335 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1336 prob_space.prob_space_vimage -> prob_space_distr
1337 prob_space.random_variable_restrict -> measurable_restrict
1338 prob_space_unique_Int_stable -> measure_eqI_prob_space
1339 product_algebraE -> prod_algebraE_all
1340 product_algebra_generator_der -> prod_algebra_eq_finite
1341 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1342 product_algebraI -> sets_PiM_I_finite
1343 product_measure_exists -> product_sigma_finite.sigma_finite
1344 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1345 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1346 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1347 product_prob_space.measurable_component -> measurable_component_singleton
1348 product_prob_space.measurable_emb -> measurable_prod_emb
1349 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1350 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1351 product_prob_space.measure_emb -> emeasure_prod_emb
1352 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1353 product_sigma_algebra.product_algebra_into_space -> space_closed
1354 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1355 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1356 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1357 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1358 sets_product_algebra -> sets_PiM
1359 sigma_algebra.measurable_sigma -> measurable_measure_of
1360 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1361 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1362 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1363 space_product_algebra -> space_PiM
1365 * Session HOL-TPTP: support to parse and import TPTP problems (all
1366 languages) into Isabelle/HOL.
1371 * New "case_product" attribute (see HOL).
1376 * Greater support for structured proofs involving induction or case
1379 * Much greater use of mathematical symbols.
1381 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1386 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1387 from a minor keyword introduced via theory header declaration.
1389 * Antiquotation @{command_spec "name"} produces the
1390 Outer_Syntax.command_spec from a major keyword introduced via theory
1391 header declaration; it can be passed to Outer_Syntax.command etc.
1393 * Local_Theory.define no longer hard-wires default theorem name
1394 "foo_def", but retains the binding as given. If that is Binding.empty
1395 / Attrib.empty_binding, the result is not registered as user-level
1396 fact. The Local_Theory.define_internal variant allows to specify a
1397 non-empty name (used for the foundation in the background theory),
1398 while omitting the fact binding in the user-context. Potential
1399 INCOMPATIBILITY for derived definitional packages: need to specify
1400 naming policy for primitive definitions more explicitly.
1402 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1403 conformance with similar operations in structure Term and Logic.
1405 * Antiquotation @{attributes [...]} embeds attribute source
1406 representation into the ML text, which is particularly useful with
1407 declarations like Local_Theory.note.
1409 * Structure Proof_Context follows standard naming scheme. Old
1410 ProofContext has been discontinued. INCOMPATIBILITY.
1412 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1413 change of semantics: update is applied to auxiliary local theory
1416 * Modernized some old-style infix operations:
1418 addeqcongs ~> Simplifier.add_eqcong
1419 deleqcongs ~> Simplifier.del_eqcong
1420 addcongs ~> Simplifier.add_cong
1421 delcongs ~> Simplifier.del_cong
1422 setmksimps ~> Simplifier.set_mksimps
1423 setmkcong ~> Simplifier.set_mkcong
1424 setmksym ~> Simplifier.set_mksym
1425 setmkeqTrue ~> Simplifier.set_mkeqTrue
1426 settermless ~> Simplifier.set_termless
1427 setsubgoaler ~> Simplifier.set_subgoaler
1428 addsplits ~> Splitter.add_split
1429 delsplits ~> Splitter.del_split
1434 * USER_HOME settings variable points to cross-platform user home
1435 directory, which coincides with HOME on POSIX systems only. Likewise,
1436 the Isabelle path specification "~" now expands to $USER_HOME, instead
1437 of former $HOME. A different default for USER_HOME may be set
1438 explicitly in shell environment, before Isabelle settings are
1439 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1440 the generic user home was intended.
1442 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1443 notation, which is useful for the jEdit file browser, for example.
1445 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1450 New in Isabelle2011-1 (October 2011)
1451 ------------------------------------
1455 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1456 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1458 - Management of multiple theory files directly from the editor
1459 buffer store -- bypassing the file-system (no requirement to save
1460 files for checking).
1462 - Markup of formal entities within the text buffer, with semantic
1463 highlighting, tooltips and hyperlinks to jump to defining source
1466 - Improved text rendering, with sub/superscripts in the source
1467 buffer (including support for copy/paste wrt. output panel, HTML
1468 theory output and other non-Isabelle text boxes).
1470 - Refined scheduling of proof checking and printing of results,
1471 based on interactive editor view. (Note: jEdit folding and
1472 narrowing allows to restrict buffer perspectives explicitly.)
1474 - Reduced CPU performance requirements, usable on machines with few
1477 - Reduced memory requirements due to pruning of unused document
1478 versions (garbage collection).
1480 See also ~~/src/Tools/jEdit/README.html for further information,
1481 including some remaining limitations.
1483 * Theory loader: source files are exclusively located via the master
1484 directory of each theory node (where the .thy file itself resides).
1485 The global load path (such as src/HOL/Library) has been discontinued.
1486 Note that the path element ~~ may be used to reference theories in the
1487 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1490 * Theory loader: source files are identified by content via SHA1
1491 digests. Discontinued former path/modtime identification and optional
1492 ISABELLE_FILE_IDENT plugin scripts.
1494 * Parallelization of nested Isar proofs is subject to
1495 Goal.parallel_proofs_threshold (default 100). See also isabelle
1498 * Name space: former unsynchronized references are now proper
1499 configuration options, with more conventional names:
1501 long_names ~> names_long
1502 short_names ~> names_short
1503 unique_names ~> names_unique
1505 Minor INCOMPATIBILITY, need to declare options in context like this:
1507 declare [[names_unique = false]]
1509 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
1510 that the result needs to be unique, which means fact specifications
1511 may have to be refined after enriching a proof context.
1513 * Attribute "case_names" has been refined: the assumptions in each case
1514 can be named now by following the case name with [name1 name2 ...].
1516 * Isabelle/Isar reference manual has been updated and extended:
1517 - "Synopsis" provides a catalog of main Isar language concepts.
1518 - Formal references in syntax diagrams, via @{rail} antiquotation.
1519 - Updated material from classic "ref" manual, notably about
1520 "Classical Reasoner".
1525 * Class bot and top require underlying partial order rather than
1526 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
1528 * Class complete_lattice: generalized a couple of lemmas from sets;
1529 generalized theorems INF_cong and SUP_cong. New type classes for
1530 complete boolean algebras and complete linear orders. Lemmas
1531 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
1532 class complete_linorder.
1534 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
1535 Sup_fun_def, Inf_apply, Sup_apply.
1537 Removed redundant lemmas (the right hand side gives hints how to
1538 replace them for (metis ...), or (simp only: ...) proofs):
1540 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
1541 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
1542 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
1543 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
1544 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
1545 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
1546 Inter_def ~> INF_def, image_def
1547 Union_def ~> SUP_def, image_def
1548 INT_eq ~> INF_def, and image_def
1549 UN_eq ~> SUP_def, and image_def
1550 INF_subset ~> INF_superset_mono [OF _ order_refl]
1552 More consistent and comprehensive names:
1554 INTER_eq_Inter_image ~> INF_def
1555 UNION_eq_Union_image ~> SUP_def
1558 INF_leI ~> INF_lower
1559 INF_leI2 ~> INF_lower2
1560 le_INFI ~> INF_greatest
1561 le_SUPI ~> SUP_upper
1562 le_SUPI2 ~> SUP_upper2
1563 SUP_leI ~> SUP_least
1564 INFI_bool_eq ~> INF_bool_eq
1565 SUPR_bool_eq ~> SUP_bool_eq
1566 INFI_apply ~> INF_apply
1567 SUPR_apply ~> SUP_apply
1568 INTER_def ~> INTER_eq
1569 UNION_def ~> UNION_eq
1573 * Renamed theory Complete_Lattice to Complete_Lattices.
1576 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1577 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1578 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1579 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1581 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1582 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1583 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1586 * Added syntactic classes "inf" and "sup" for the respective
1587 constants. INCOMPATIBILITY: Changes in the argument order of the
1588 (mostly internal) locale predicates for some derived classes.
1590 * Theorem collections ball_simps and bex_simps do not contain theorems
1591 referring to UNION any longer; these have been moved to collection
1592 UN_ball_bex_simps. INCOMPATIBILITY.
1594 * Theory Archimedean_Field: floor now is defined as parameter of a
1595 separate type class floor_ceiling.
1597 * Theory Finite_Set: more coherent development of fold_set locales:
1599 locale fun_left_comm ~> locale comp_fun_commute
1600 locale fun_left_comm_idem ~> locale comp_fun_idem
1602 Both use point-free characterization; interpretation proofs may need
1603 adjustment. INCOMPATIBILITY.
1605 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1606 accordance with standard mathematical terminology. INCOMPATIBILITY.
1608 * Theory Complex_Main: The locale interpretations for the
1609 bounded_linear and bounded_bilinear locales have been removed, in
1610 order to reduce the number of duplicate lemmas. Users must use the
1611 original names for distributivity theorems, potential INCOMPATIBILITY.
1613 divide.add ~> add_divide_distrib
1614 divide.diff ~> diff_divide_distrib
1615 divide.setsum ~> setsum_divide_distrib
1616 mult.add_right ~> right_distrib
1617 mult.diff_right ~> right_diff_distrib
1618 mult_right.setsum ~> setsum_right_distrib
1619 mult_left.diff ~> left_diff_distrib
1621 * Theory Complex_Main: Several redundant theorems have been removed or
1622 replaced by more general versions. INCOMPATIBILITY.
1624 real_diff_def ~> minus_real_def
1625 real_divide_def ~> divide_real_def
1626 real_less_def ~> less_le
1627 real_abs_def ~> abs_real_def
1628 real_sgn_def ~> sgn_real_def
1629 real_mult_commute ~> mult_commute
1630 real_mult_assoc ~> mult_assoc
1631 real_mult_1 ~> mult_1_left
1632 real_add_mult_distrib ~> left_distrib
1633 real_zero_not_eq_one ~> zero_neq_one
1634 real_mult_inverse_left ~> left_inverse
1635 INVERSE_ZERO ~> inverse_zero
1636 real_le_refl ~> order_refl
1637 real_le_antisym ~> order_antisym
1638 real_le_trans ~> order_trans
1639 real_le_linear ~> linear
1640 real_le_eq_diff ~> le_iff_diff_le_0
1641 real_add_left_mono ~> add_left_mono
1642 real_mult_order ~> mult_pos_pos
1643 real_mult_less_mono2 ~> mult_strict_left_mono
1644 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1645 real_0_le_divide_iff ~> zero_le_divide_iff
1646 realpow_two_disj ~> power2_eq_iff
1647 real_squared_diff_one_factored ~> square_diff_one_factored
1648 realpow_two_diff ~> square_diff_square_factored
1649 reals_complete2 ~> complete_real
1650 real_sum_squared_expand ~> power2_sum
1651 exp_ln_eq ~> ln_unique
1653 expi_zero ~> exp_zero
1654 lemma_DERIV_subst ~> DERIV_cong
1655 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1656 LIMSEQ_const ~> tendsto_const
1657 LIMSEQ_norm ~> tendsto_norm
1658 LIMSEQ_add ~> tendsto_add
1659 LIMSEQ_minus ~> tendsto_minus
1660 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1661 LIMSEQ_diff ~> tendsto_diff
1662 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1663 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1664 LIMSEQ_mult ~> tendsto_mult
1665 LIMSEQ_inverse ~> tendsto_inverse
1666 LIMSEQ_divide ~> tendsto_divide
1667 LIMSEQ_pow ~> tendsto_power
1668 LIMSEQ_setsum ~> tendsto_setsum
1669 LIMSEQ_setprod ~> tendsto_setprod
1670 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1671 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1672 LIMSEQ_imp_rabs ~> tendsto_rabs
1673 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1674 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1675 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1676 LIMSEQ_Complex ~> tendsto_Complex
1677 LIM_ident ~> tendsto_ident_at
1678 LIM_const ~> tendsto_const
1679 LIM_add ~> tendsto_add
1680 LIM_add_zero ~> tendsto_add_zero
1681 LIM_minus ~> tendsto_minus
1682 LIM_diff ~> tendsto_diff
1683 LIM_norm ~> tendsto_norm
1684 LIM_norm_zero ~> tendsto_norm_zero
1685 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1686 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1687 LIM_rabs ~> tendsto_rabs
1688 LIM_rabs_zero ~> tendsto_rabs_zero
1689 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1690 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1691 LIM_compose ~> tendsto_compose
1692 LIM_mult ~> tendsto_mult
1693 LIM_scaleR ~> tendsto_scaleR
1694 LIM_of_real ~> tendsto_of_real
1695 LIM_power ~> tendsto_power
1696 LIM_inverse ~> tendsto_inverse
1697 LIM_sgn ~> tendsto_sgn
1698 isCont_LIM_compose ~> isCont_tendsto_compose
1699 bounded_linear.LIM ~> bounded_linear.tendsto
1700 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1701 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1702 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1703 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1704 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1705 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1707 * Theory Complex_Main: The definition of infinite series was
1708 generalized. Now it is defined on the type class {topological_space,
1709 comm_monoid_add}. Hence it is useable also for extended real numbers.
1711 * Theory Complex_Main: The complex exponential function "expi" is now
1712 a type-constrained abbreviation for "exp :: complex => complex"; thus
1713 several polymorphic lemmas about "exp" are now applicable to "expi".
1717 - Theory Library/Code_Char_ord provides native ordering of
1718 characters in the target language.
1720 - Commands code_module and code_library are legacy, use export_code
1723 - Method "evaluation" is legacy, use method "eval" instead.
1725 - Legacy evaluator "SML" is deactivated by default. May be
1726 reactivated by the following theory command:
1728 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1730 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1732 * New proof method "induction" that gives induction hypotheses the
1733 name "IH", thus distinguishing them from further hypotheses that come
1734 from rule induction. The latter are still called "hyps". Method
1735 "induction" is a thin wrapper around "induct" and follows the same
1738 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1739 still available as a legacy feature for some time.
1742 - Added "need" and "total_consts" options.
1743 - Reintroduced "show_skolems" option by popular demand.
1744 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1748 - Use quasi-sound (and efficient) translations by default.
1749 - Added support for the following provers: E-ToFoF, LEO-II,
1750 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1751 - Automatically preplay and minimize proofs before showing them if
1752 this can be done within reasonable time.
1753 - sledgehammer available_provers ~> sledgehammer supported_provers.
1755 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1756 "max_mono_iters", and "max_new_mono_instances" options.
1757 - Removed "explicit_apply" and "full_types" options as well as "Full
1758 Types" Proof General menu item. INCOMPATIBILITY.
1761 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1762 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1766 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1767 "elim:" options. INCOMPATIBILITY.
1768 - Introduced 'try' that not only runs 'try_methods' but also
1769 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1772 - Added "eval" option to evaluate terms for the found counterexample
1773 (currently only supported by the default (exhaustive) tester).
1774 - Added post-processing of terms to obtain readable counterexamples
1775 (currently only supported by the default (exhaustive) tester).
1776 - New counterexample generator quickcheck[narrowing] enables
1777 narrowing-based testing. Requires the Glasgow Haskell compiler
1778 with its installation location defined in the Isabelle settings
1779 environment as ISABELLE_GHC.
1780 - Removed quickcheck tester "SML" based on the SML code generator
1781 (formly in HOL/Library).
1783 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1784 use 'partial_function' instead.
1786 * Theory Library/Extended_Reals replaces now the positive extended
1787 reals found in probability theory. This file is extended by
1788 Multivariate_Analysis/Extended_Real_Limits.
1790 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1791 from where it must be imported explicitly if it is really required.
1794 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1795 been moved here. INCOMPATIBILITY.
1797 * Theory Library/Saturated provides type of numbers with saturated
1800 * Theory Library/Product_Lattice defines a pointwise ordering for the
1801 product type 'a * 'b, and provides instance proofs for various order
1802 and lattice type classes.
1804 * Theory Library/Countable now provides the "countable_datatype" proof
1805 method for proving "countable" class instances for datatypes.
1807 * Theory Library/Cset_Monad allows do notation for computable sets
1808 (cset) via the generic monad ad-hoc overloading facility.
1810 * Library: Theories of common data structures are split into theories
1811 for implementation, an invariant-ensuring type, and connection to an
1812 abstract type. INCOMPATIBILITY.
1814 - RBT is split into RBT and RBT_Mapping.
1815 - AssocList is split and renamed into AList and AList_Mapping.
1816 - DList is split into DList_Impl, DList, and DList_Cset.
1817 - Cset is split into Cset and List_Cset.
1819 * Theory Library/Nat_Infinity has been renamed to
1820 Library/Extended_Nat, with name changes of the following types and
1823 type inat ~> type enat
1825 Infty ~> infinity (overloaded)
1829 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1830 been renamed accordingly. INCOMPATIBILITY.
1832 * Session Multivariate_Analysis: The euclidean_space type class now
1833 fixes a constant "Basis :: 'a set" consisting of the standard
1834 orthonormal basis for the type. Users now have the option of
1835 quantifying over this set instead of using the "basis" function, e.g.
1836 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1838 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1839 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1840 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1841 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1842 changed to match. Definition theorems for overloaded constants now use
1843 the standard "foo_vec_def" naming scheme. A few other theorems have
1844 been renamed as follows (INCOMPATIBILITY):
1846 Cart_eq ~> vec_eq_iff
1847 dist_nth_le_cart ~> dist_vec_nth_le
1848 tendsto_vector ~> vec_tendstoI
1849 Cauchy_vector ~> vec_CauchyI
1851 * Session Multivariate_Analysis: Several duplicate theorems have been
1852 removed, and other theorems have been renamed or replaced with more
1853 general versions. INCOMPATIBILITY.
1855 finite_choice ~> finite_set_choice
1856 eventually_conjI ~> eventually_conj
1857 eventually_and ~> eventually_conj_iff
1858 eventually_false ~> eventually_False
1859 setsum_norm ~> norm_setsum
1860 Lim_sequentially ~> LIMSEQ_def
1861 Lim_ident_at ~> LIM_ident
1862 Lim_const ~> tendsto_const
1863 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1864 Lim_neg ~> tendsto_minus
1865 Lim_add ~> tendsto_add
1866 Lim_sub ~> tendsto_diff
1867 Lim_mul ~> tendsto_scaleR
1868 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1869 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1870 Lim_linear ~> bounded_linear.tendsto
1871 Lim_component ~> tendsto_euclidean_component
1872 Lim_component_cart ~> tendsto_vec_nth
1873 Lim_inner ~> tendsto_inner [OF tendsto_const]
1874 dot_lsum ~> inner_setsum_left
1875 dot_rsum ~> inner_setsum_right
1876 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1877 continuous_neg ~> continuous_minus
1878 continuous_sub ~> continuous_diff
1879 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1880 continuous_mul ~> continuous_scaleR
1881 continuous_inv ~> continuous_inverse
1882 continuous_at_within_inv ~> continuous_at_within_inverse
1883 continuous_at_inv ~> continuous_at_inverse
1884 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1885 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1886 continuous_at_component ~> continuous_component [OF continuous_at_id]
1887 continuous_on_neg ~> continuous_on_minus
1888 continuous_on_sub ~> continuous_on_diff
1889 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1890 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1891 continuous_on_mul ~> continuous_on_scaleR
1892 continuous_on_mul_real ~> continuous_on_mult
1893 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1894 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1895 continuous_on_inverse ~> continuous_on_inv
1896 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1897 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1898 subset_interior ~> interior_mono
1899 subset_closure ~> closure_mono
1900 closure_univ ~> closure_UNIV
1901 real_arch_lt ~> reals_Archimedean2
1902 real_arch ~> reals_Archimedean3
1903 real_abs_norm ~> abs_norm_cancel
1904 real_abs_sub_norm ~> norm_triangle_ineq3
1905 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1907 * Session HOL-Probability:
1908 - Caratheodory's extension lemma is now proved for ring_of_sets.
1909 - Infinite products of probability measures are now available.
1910 - Sigma closure is independent, if the generator is independent
1911 - Use extended reals instead of positive extended
1912 reals. INCOMPATIBILITY.
1914 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1916 expand_fun_below ~> fun_below_iff
1917 below_fun_ext ~> fun_belowI
1918 expand_cfun_eq ~> cfun_eq_iff
1919 ext_cfun ~> cfun_eqI
1920 expand_cfun_below ~> cfun_below_iff
1921 below_cfun_ext ~> cfun_belowI
1922 monofun_fun_fun ~> fun_belowD
1923 monofun_fun_arg ~> monofunE
1924 monofun_lub_fun ~> adm_monofun [THEN admD]
1925 cont_lub_fun ~> adm_cont [THEN admD]
1926 cont2cont_Rep_CFun ~> cont2cont_APP
1927 cont_Rep_CFun_app ~> cont_APP_app
1928 cont_Rep_CFun_app_app ~> cont_APP_app_app
1929 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
1930 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
1931 contlub_cfun ~> lub_APP [symmetric]
1932 contlub_LAM ~> lub_LAM [symmetric]
1935 lift_distinct1 ~> lift.distinct(1)
1936 lift_distinct2 ~> lift.distinct(2)
1937 Def_not_UU ~> lift.distinct(2)
1938 Def_inject ~> lift.inject
1939 below_UU_iff ~> below_bottom_iff
1940 eq_UU_iff ~> eq_bottom_iff
1943 *** Document preparation ***
1945 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
1946 isar-ref manual, both for description and actual application of the
1949 * Antiquotation @{value} evaluates the given term and presents its
1952 * Antiquotations: term style "isub" provides ad-hoc conversion of
1953 variables x1, y23 into subscripted form x\<^isub>1,
1954 y\<^isub>2\<^isub>3.
1956 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
1957 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
1959 * Localized \isabellestyle switch can be used within blocks or groups
1962 \isabellestyle{it} %preferred default
1963 {\isabellestylett @{text "typewriter stuff"}}
1965 * Discontinued special treatment of hard tabulators. Implicit
1966 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
1972 * The inner syntax of sort/type/term/prop supports inlined YXML
1973 representations within quoted string tokens. By encoding logical
1974 entities via Term_XML (in ML or Scala) concrete syntax can be
1975 bypassed, which is particularly useful for producing bits of text
1976 under external program control.
1978 * Antiquotations for ML and document preparation are managed as theory
1979 data, which requires explicit setup.
1981 * Isabelle_Process.is_active allows tools to check if the official
1982 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
1983 (better known as Proof General).
1985 * Structure Proof_Context follows standard naming scheme. Old
1986 ProofContext is still available for some time as legacy alias.
1988 * Structure Timing provides various operations for timing; supersedes
1989 former start_timing/end_timing etc.
1991 * Path.print is the official way to show file-system paths to users
1992 (including quotes etc.).
1994 * Inner syntax: identifiers in parse trees of generic categories
1995 "logic", "aprop", "idt" etc. carry position information (disguised as
1996 type constraints). Occasional INCOMPATIBILITY with non-compliant
1997 translations that choke on unexpected type constraints. Positions can
1998 be stripped in ML translations via Syntax.strip_positions /
1999 Syntax.strip_positions_ast, or via the syntax constant
2000 "_strip_positions" within parse trees. As last resort, positions can
2001 be disabled via the configuration option Syntax.positions, which is
2002 called "syntax_positions" in Isar attribute syntax.
2004 * Discontinued special status of various ML structures that contribute
2005 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2006 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2007 refer directly to Ast.Constant, Lexicon.is_identifier,
2008 Syntax_Trans.mk_binder_tr etc.
2010 * Typed print translation: discontinued show_sorts argument, which is
2011 already available via context of "advanced" translation.
2013 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2014 goal states; body tactic needs to address all subgoals uniformly.
2016 * Slightly more special eq_list/eq_set, with shortcut involving
2017 pointer equality (assumes that eq relation is reflexive).
2019 * Classical tactics use proper Proof.context instead of historic types
2020 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2021 operate directly on Proof.context. Raw type claset retains its use as
2022 snapshot of the classical context, which can be recovered via
2023 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2024 INCOMPATIBILITY, classical tactics and derived proof methods require
2025 proper Proof.context.
2030 * Discontinued support for Poly/ML 5.2, which was the last version
2031 without proper multithreading and TimeLimit implementation.
2033 * Discontinued old lib/scripts/polyml-platform, which has been
2034 obsolete since Isabelle2009-2.
2036 * Various optional external tools are referenced more robustly and
2037 uniformly by explicit Isabelle settings as follows:
2039 ISABELLE_CSDP (formerly CSDP_EXE)
2040 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2041 ISABELLE_OCAML (formerly EXEC_OCAML)
2042 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2043 ISABELLE_YAP (formerly EXEC_YAP)
2045 Note that automated detection from the file-system or search path has
2046 been discontinued. INCOMPATIBILITY.
2048 * Scala layer provides JVM method invocation service for static
2049 methods of type (String)String, see Invoke_Scala.method in ML. For
2052 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2054 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2055 this allows to pass structured values between ML and Scala.
2057 * The IsabelleText fonts includes some further glyphs to support the
2058 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2059 installed a local copy (which is normally *not* required) need to
2060 delete or update it from ~~/lib/fonts/.
2064 New in Isabelle2011 (January 2011)
2065 ----------------------------------
2069 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2070 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2071 useful tooltips and hyperlinks produced from its static analysis. The
2072 bundled component provides an executable Isabelle tool that can be run
2075 Isabelle2011/bin/isabelle jedit
2077 * Significantly improved Isabelle/Isar implementation manual.
2079 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2080 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2081 while the default heap location within that directory lacks that extra
2082 suffix. This isolates multiple Isabelle installations from each
2083 other, avoiding problems with old settings in new versions.
2084 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2086 * Source files are always encoded as UTF-8, instead of old-fashioned
2087 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2088 the following package declarations:
2090 \usepackage[utf8]{inputenc}
2091 \usepackage{textcomp}
2093 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2094 a Unicode character is treated as a single symbol, not a sequence of
2095 non-ASCII bytes as before. Since Isabelle/ML string literals may
2096 contain symbols without further backslash escapes, Unicode can now be
2097 used here as well. Recall that Symbol.explode in ML provides a
2098 consistent view on symbols, while raw explode (or String.explode)
2099 merely give a byte-oriented representation.
2101 * Theory loader: source files are primarily located via the master
2102 directory of each theory node (where the .thy file itself resides).
2103 The global load path is still partially available as legacy feature.
2104 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2105 explicit paths, relatively to the theory.
2107 * Special treatment of ML file names has been discontinued.
2108 Historically, optional extensions .ML or .sml were added on demand --
2109 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2110 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2112 * Various options that affect pretty printing etc. are now properly
2113 handled within the context via configuration options, instead of
2114 unsynchronized references or print modes. There are both ML Config.T
2115 entities and Isar declaration attributes to access these.
2117 ML (Config.T) Isar (attribute)
2119 eta_contract eta_contract
2120 show_brackets show_brackets
2121 show_sorts show_sorts
2122 show_types show_types
2123 show_question_marks show_question_marks
2124 show_consts show_consts
2125 show_abbrevs show_abbrevs
2127 Syntax.ast_trace syntax_ast_trace
2128 Syntax.ast_stat syntax_ast_stat
2129 Syntax.ambiguity_level syntax_ambiguity_level
2131 Goal_Display.goals_limit goals_limit
2132 Goal_Display.show_main_goal show_main_goal
2134 Method.rule_trace rule_trace
2136 Thy_Output.display thy_output_display
2137 Thy_Output.quotes thy_output_quotes
2138 Thy_Output.indent thy_output_indent
2139 Thy_Output.source thy_output_source
2140 Thy_Output.break thy_output_break
2142 Note that corresponding "..._default" references in ML may only be
2143 changed globally at the ROOT session setup, but *not* within a theory.
2144 The option "show_abbrevs" supersedes the former print mode
2145 "no_abbrevs" with inverted meaning.
2147 * More systematic naming of some configuration options.
2150 trace_simp ~> simp_trace
2151 debug_simp ~> simp_debug
2153 * Support for real valued configuration options, using simplistic
2154 floating-point notation that coincides with the inner syntax for
2157 * Support for real valued preferences (with approximative PGIP type):
2158 front-ends need to accept "pgint" values in float notation.
2161 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2164 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2169 * Command 'type_synonym' (with single argument) replaces somewhat
2170 outdated 'types', which is still available as legacy feature for some
2173 * Command 'nonterminal' (with 'and' separated list of arguments)
2174 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2176 * Command 'notepad' replaces former 'example_proof' for
2177 experimentation in Isar without any result. INCOMPATIBILITY.
2179 * Locale interpretation commands 'interpret' and 'sublocale' accept
2180 lists of equations to map definitions in a locale to appropriate
2181 entities in the context of the interpretation. The 'interpretation'
2182 command already provided this functionality.
2184 * Diagnostic command 'print_dependencies' prints the locale instances
2185 that would be activated if the specified expression was interpreted in
2186 the current context. Variant "print_dependencies!" assumes a context
2187 without interpretations.
2189 * Diagnostic command 'print_interps' prints interpretations in proofs
2190 in addition to interpretations in theories.
2192 * Discontinued obsolete 'global' and 'local' commands to manipulate
2193 the theory name space. Rare INCOMPATIBILITY. The ML functions
2194 Sign.root_path and Sign.local_path may be applied directly where this
2195 feature is still required for historical reasons.
2197 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2198 'definition' instead.
2200 * The "prems" fact, which refers to the accidental collection of
2201 foundational premises in the context, is now explicitly marked as
2202 legacy feature and will be discontinued soon. Consider using "assms"
2203 of the head statement or reference facts by explicit names.
2205 * Document antiquotations @{class} and @{type} print classes and type
2208 * Document antiquotation @{file} checks file/directory entries within
2209 the local file system.
2214 * Coercive subtyping: functions can be declared as coercions and type
2215 inference will add them as necessary upon input of a term. Theory
2216 Complex_Main declares real :: nat => real and real :: int => real as
2217 coercions. A coercion function f is declared like this:
2219 declare [[coercion f]]
2221 To lift coercions through type constructors (e.g. from nat => real to
2222 nat list => real list), map functions can be declared, e.g.
2224 declare [[coercion_map map]]
2226 Currently coercion inference is activated only in theories including
2227 real numbers, i.e. descendants of Complex_Main. This is controlled by
2228 the configuration option "coercion_enabled", e.g. it can be enabled in
2229 other theories like this:
2231 declare [[coercion_enabled]]
2233 * Command 'partial_function' provides basic support for recursive
2234 function definitions over complete partial orders. Concrete instances
2235 are provided for i) the option type, ii) tail recursion on arbitrary
2236 types, and iii) the heap monad of Imperative_HOL. See
2237 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2240 * Function package: f.psimps rules are no longer implicitly declared
2241 as [simp]. INCOMPATIBILITY.
2243 * Datatype package: theorems generated for executable equality (class
2244 "eq") carry proper names and are treated as default code equations.
2246 * Inductive package: now offers command 'inductive_simps' to
2247 automatically derive instantiated and simplified equations for
2248 inductive predicates, similar to 'inductive_cases'.
2250 * Command 'enriched_type' allows to register properties of the
2251 functorial structure of types.
2253 * Improved infrastructure for term evaluation using code generator
2254 techniques, in particular static evaluation conversions.
2256 * Code generator: Scala (2.8 or higher) has been added to the target
2259 * Code generator: globbing constant expressions "*" and "Theory.*"
2260 have been replaced by the more idiomatic "_" and "Theory._".
2263 * Code generator: export_code without explicit file declaration prints
2264 to standard output. INCOMPATIBILITY.
2266 * Code generator: do not print function definitions for case
2267 combinators any longer.
2269 * Code generator: simplification with rules determined with
2270 src/Tools/Code/code_simp.ML and method "code_simp".
2272 * Code generator for records: more idiomatic representation of record
2273 types. Warning: records are not covered by ancient SML code
2274 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2275 rep_datatype declaration helps to succeed then:
2279 rep_datatype foo_ext ...
2281 * Records: logical foundation type for records does not carry a
2282 '_type' suffix any longer (obsolete due to authentic syntax).
2285 * Quickcheck now by default uses exhaustive testing instead of random
2286 testing. Random testing can be invoked by "quickcheck [random]",
2287 exhaustive testing by "quickcheck [exhaustive]".
2289 * Quickcheck instantiates polymorphic types with small finite
2290 datatypes by default. This enables a simple execution mechanism to
2291 handle quantifiers and function equality over the finite datatypes.
2293 * Quickcheck random generator has been renamed from "code" to
2294 "random". INCOMPATIBILITY.
2296 * Quickcheck now has a configurable time limit which is set to 30
2297 seconds by default. This can be changed by adding [timeout = n] to the
2298 quickcheck command. The time limit for Auto Quickcheck is still set
2301 * Quickcheck in locales considers interpretations of that locale for
2302 counter example search.
2305 - Added "smt" and "remote_smt" provers based on the "smt" proof
2306 method. See the Sledgehammer manual for details ("isabelle doc
2309 sledgehammer atp_info ~> sledgehammer running_provers
2310 sledgehammer atp_kill ~> sledgehammer kill_provers
2311 sledgehammer available_atps ~> sledgehammer available_provers
2314 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2315 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2316 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2317 (and "ms" and "min" are no longer supported)
2322 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2323 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2325 - Added support for partial quotient types.
2326 - Added local versions of the "Nitpick.register_xxx" functions.
2327 - Added "whack" option.
2328 - Allow registration of quotient types as codatatypes.
2329 - Improved "merge_type_vars" option to merge more types.
2330 - Removed unsound "fast_descrs" option.
2331 - Added custom symmetry breaking for datatypes, making it possible to reach
2332 higher cardinalities.
2333 - Prevent the expansion of too large definitions.
2335 * Proof methods "metis" and "meson" now have configuration options
2336 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2337 to diagnose these tools. E.g.
2339 using [[metis_trace = true]]
2341 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2342 manually as command 'solve_direct'.
2344 * The default SMT solver Z3 must be enabled explicitly (due to
2345 licensing issues) by setting the environment variable
2346 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2347 commercial applications, the SMT solver CVC3 is provided as fall-back;
2348 changing the SMT solver is done via the configuration option
2351 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2352 i.e. "remote_cvc3" and "remote_z3".
2354 * Added basic SMT support for datatypes, records, and typedefs using
2355 the oracle mode (no proofs). Direct support of pairs has been dropped
2356 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2357 support for a similar behavior). Minor INCOMPATIBILITY.
2359 * Changed SMT configuration options:
2361 z3_proofs ~> smt_oracle (with inverted meaning)
2362 z3_trace_assms ~> smt_trace_used_facts
2375 * Boogie output files (.b2i files) need to be declared in the theory
2378 * Simplification procedure "list_to_set_comprehension" rewrites list
2379 comprehensions applied to List.set to set comprehensions. Occasional
2380 INCOMPATIBILITY, may be deactivated like this:
2382 declare [[simproc del: list_to_set_comprehension]]
2384 * Removed old version of primrec package. INCOMPATIBILITY.
2386 * Removed simplifier congruence rule of "prod_case", as has for long
2387 been the case with "split". INCOMPATIBILITY.
2389 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2391 * Removed [split_format ... and ... and ...] version of
2392 [split_format]. Potential INCOMPATIBILITY.
2394 * Predicate "sorted" now defined inductively, with nice induction
2395 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2397 * Constant "contents" renamed to "the_elem", to free the generic name
2398 contents for other uses. INCOMPATIBILITY.
2400 * Renamed class eq and constant eq (for code generation) to class
2401 equal and constant equal, plus renaming of related facts and various
2402 tuning. INCOMPATIBILITY.
2404 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2406 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2409 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2410 avoid confusion with finite sets. INCOMPATIBILITY.
2412 * Abandoned locales equiv, congruent and congruent2 for equivalence
2413 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2416 * Some previously unqualified names have been qualified:
2423 Trueprop ~> HOL.Trueprop
2428 op --> ~> HOL.implies
2440 Pair ~> Product_Type.Pair
2441 fst ~> Product_Type.fst
2442 snd ~> Product_Type.snd
2443 curry ~> Product_Type.curry
2445 Collect ~> Set.Collect
2449 * More canonical naming convention for some fundamental definitions:
2451 bot_bool_eq ~> bot_bool_def
2452 top_bool_eq ~> top_bool_def
2453 inf_bool_eq ~> inf_bool_def
2454 sup_bool_eq ~> sup_bool_def
2455 bot_fun_eq ~> bot_fun_def
2456 top_fun_eq ~> top_fun_def
2457 inf_fun_eq ~> inf_fun_def
2458 sup_fun_eq ~> sup_fun_def
2462 * More stylized fact names:
2464 expand_fun_eq ~> fun_eq_iff
2465 expand_set_eq ~> set_eq_iff
2467 nat_number ~> eval_nat_numeral
2471 * Refactoring of code-generation specific operations in theory List:
2477 mem_iff ~> member_def
2478 null_empty ~> null_def
2480 INCOMPATIBILITY. Note that these were not supposed to be used
2481 regularly unless for striking reasons; their main purpose was code
2484 Various operations from the Haskell prelude are used for generating
2487 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2488 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2489 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2491 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2492 "*" and "+" respectively. INCOMPATIBILITY.
2494 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2495 "Sum_Type.Plus" instead.
2497 * Constant "split" has been merged with constant "prod_case"; names of
2498 ML functions, facts etc. involving split have been retained so far,
2499 though. INCOMPATIBILITY.
2501 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2502 instead. INCOMPATIBILITY.
2504 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2507 * Former theory Library/Enum is now part of the HOL-Main image.
2508 INCOMPATIBILITY: all constants of the Enum theory now have to be
2509 referred to by its qualified name.
2512 nlists ~> Enum.nlists
2513 product ~> Enum.product
2515 * Theory Library/Monad_Syntax provides do-syntax for monad types.
2516 Syntax in Library/State_Monad has been changed to avoid ambiguities.
2519 * Theory Library/SetsAndFunctions has been split into
2520 Library/Function_Algebras and Library/Set_Algebras; canonical names
2521 for instance definitions for functions; various improvements.
2524 * Theory Library/Multiset provides stable quicksort implementation of
2527 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
2530 * Session Multivariate_Analysis: introduced a type class for euclidean
2531 space. Most theorems are now stated in terms of euclidean spaces
2532 instead of finite cartesian products.
2535 real ^ 'n ~> 'a::real_vector
2536 ~> 'a::euclidean_space
2537 ~> 'a::ordered_euclidean_space
2538 (depends on your needs)
2542 \<chi> x. _ ~> \<chi>\<chi> x. _
2545 Also note that the indices are now natural numbers and not from some
2546 finite type. Finite cartesian products of euclidean spaces, products
2547 of euclidean spaces the real and complex numbers are instantiated to
2548 be euclidean_spaces. INCOMPATIBILITY.
2550 * Session Probability: introduced pextreal as positive extended real
2551 numbers. Use pextreal as value for measures. Introduce the
2552 Radon-Nikodym derivative, product spaces and Fubini's theorem for
2553 arbitrary sigma finite measures. Introduces Lebesgue measure based on
2554 the integral in Multivariate Analysis. INCOMPATIBILITY.
2556 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
2559 * Session SPARK (with image HOL-SPARK) provides commands to load and
2560 prove verification conditions generated by the SPARK Ada program
2561 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
2566 * Theorems for additive ring operations (locale abelian_monoid and
2567 descendants) are generated by interpretation from their multiplicative
2568 counterparts. Names (in particular theorem names) have the mandatory
2569 qualifier 'add'. Previous theorem names are redeclared for
2572 * Structure "int_ring" is now an abbreviation (previously a
2573 definition). This fits more natural with advanced interpretations.
2578 * The domain package now runs in definitional mode by default: The
2579 former command 'new_domain' is now called 'domain'. To use the domain
2580 package in its original axiomatic mode, use 'domain (unsafe)'.
2583 * The new class "domain" is now the default sort. Class "predomain"
2584 is an unpointed version of "domain". Theories can be updated by
2585 replacing sort annotations as shown below. INCOMPATIBILITY.
2587 'a::type ~> 'a::countable
2588 'a::cpo ~> 'a::predomain
2589 'a::pcpo ~> 'a::domain
2591 * The old type class "rep" has been superseded by class "domain".
2592 Accordingly, users of the definitional package must remove any
2593 "default_sort rep" declarations. INCOMPATIBILITY.
2595 * The domain package (definitional mode) now supports unpointed
2596 predomain argument types, as long as they are marked 'lazy'. (Strict
2597 arguments must be in class "domain".) For example, the following
2598 domain definition now works:
2600 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2602 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2603 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2604 'a option, and 'a list. Additionally, it configures fixrec and the
2605 domain package to work with these types. For example:
2607 fixrec isInl :: "('a + 'b) u -> tr"
2608 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2610 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2612 * The "(permissive)" option of fixrec has been replaced with a
2613 per-equation "(unchecked)" option. See
2614 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2616 * The "bifinite" class no longer fixes a constant "approx"; the class
2617 now just asserts that such a function exists. INCOMPATIBILITY.
2619 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2620 defines an embedding of type 'a defl into udom by default; instances
2621 of "bifinite" and "domain" classes are available in
2622 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2624 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2626 * The predicate "directed" has been removed. INCOMPATIBILITY.
2628 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2630 * The function "cprod_map" has been renamed to "prod_map".
2633 * The monadic bind operator on each powerdomain has new binder syntax
2634 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2635 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2637 * The infix syntax for binary union on each powerdomain has changed
2638 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2639 syntax. INCOMPATIBILITY.
2641 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2642 still supported as an input translation.
2644 * Renamed some theorems (the original names are also still available).
2646 expand_fun_below ~> fun_below_iff
2647 below_fun_ext ~> fun_belowI
2648 expand_cfun_eq ~> cfun_eq_iff
2649 ext_cfun ~> cfun_eqI
2650 expand_cfun_below ~> cfun_below_iff
2651 below_cfun_ext ~> cfun_belowI
2652 cont2cont_Rep_CFun ~> cont2cont_APP
2654 * The Abs and Rep functions for various types have changed names.
2655 Related theorem names have also changed to match. INCOMPATIBILITY.
2657 Rep_CFun ~> Rep_cfun
2658 Abs_CFun ~> Abs_cfun
2659 Rep_Sprod ~> Rep_sprod
2660 Abs_Sprod ~> Abs_sprod
2661 Rep_Ssum ~> Rep_ssum
2662 Abs_Ssum ~> Abs_ssum
2664 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2665 been renamed to *_bottom_iff. INCOMPATIBILITY.
2667 * Various changes to bisimulation/coinduction with domain package:
2669 - Definitions of "bisim" constants no longer mention definedness.
2670 - With mutual recursion, "bisim" predicate is now curried.
2671 - With mutual recursion, each type gets a separate coind theorem.
2672 - Variable names in bisim_def and coinduct rules have changed.
2676 * Case combinators generated by the domain package for type "foo" are
2677 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2679 * Several theorems have been renamed to more accurately reflect the
2680 names of constants and types involved. INCOMPATIBILITY.
2682 thelub_const ~> lub_const
2683 lub_const ~> is_lub_const
2685 is_lub_lub ~> is_lubD2
2687 unique_lub ~> is_lub_unique
2688 is_ub_lub ~> is_lub_rangeD1
2689 lub_bin_chain ~> is_lub_bin_chain
2690 lub_fun ~> is_lub_fun
2691 thelub_fun ~> lub_fun
2692 thelub_cfun ~> lub_cfun
2693 thelub_Pair ~> lub_Pair
2694 lub_cprod ~> is_lub_prod
2695 thelub_cprod ~> lub_prod
2696 minimal_cprod ~> minimal_prod
2697 inst_cprod_pcpo ~> inst_prod_pcpo
2699 compact_UU ~> compact_bottom
2700 deflation_UU ~> deflation_bottom
2701 finite_deflation_UU ~> finite_deflation_bottom
2703 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2705 sq_ord_less_eq_trans ~> below_eq_trans
2706 sq_ord_eq_less_trans ~> eq_below_trans
2707 refl_less ~> below_refl
2708 trans_less ~> below_trans
2709 antisym_less ~> below_antisym
2710 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2711 box_less ~> box_below
2712 rev_trans_less ~> rev_below_trans
2713 not_less2not_eq ~> not_below2not_eq
2714 less_UU_iff ~> below_UU_iff
2715 flat_less_iff ~> flat_below_iff
2716 adm_less ~> adm_below
2717 adm_not_less ~> adm_not_below
2718 adm_compact_not_less ~> adm_compact_not_below
2719 less_fun_def ~> below_fun_def
2720 expand_fun_less ~> fun_below_iff
2721 less_fun_ext ~> fun_belowI
2722 less_discr_def ~> below_discr_def
2723 discr_less_eq ~> discr_below_eq
2724 less_unit_def ~> below_unit_def
2725 less_cprod_def ~> below_prod_def
2726 prod_lessI ~> prod_belowI
2727 Pair_less_iff ~> Pair_below_iff
2728 fst_less_iff ~> fst_below_iff
2729 snd_less_iff ~> snd_below_iff
2730 expand_cfun_less ~> cfun_below_iff
2731 less_cfun_ext ~> cfun_belowI
2732 injection_less ~> injection_below
2733 less_up_def ~> below_up_def
2734 not_Iup_less ~> not_Iup_below
2735 Iup_less ~> Iup_below
2737 Def_inject_less_eq ~> Def_below_Def
2738 Def_less_is_eq ~> Def_below_iff
2739 spair_less_iff ~> spair_below_iff
2740 less_sprod ~> below_sprod
2741 spair_less ~> spair_below
2742 sfst_less_iff ~> sfst_below_iff
2743 ssnd_less_iff ~> ssnd_below_iff
2744 fix_least_less ~> fix_least_below
2745 dist_less_one ~> dist_below_one
2746 less_ONE ~> below_ONE
2747 ONE_less_iff ~> ONE_below_iff
2748 less_sinlD ~> below_sinlD
2749 less_sinrD ~> below_sinrD
2754 * All constant names are now qualified internally and use proper
2755 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2760 * Antiquotation @{assert} inlines a function bool -> unit that raises
2761 Fail if the argument is false. Due to inlining the source position of
2762 failed assertions is included in the error output.
2764 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2765 text is in practice always evaluated with a stable theory checkpoint.
2766 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2768 * Antiquotation @{theory A} refers to theory A from the ancestry of
2769 the current context, not any accidental theory loader state as before.
2770 Potential INCOMPATIBILITY, subtle change in semantics.
2772 * Syntax.pretty_priority (default 0) configures the required priority
2773 of pretty-printed output and thus affects insertion of parentheses.
2775 * Syntax.default_root (default "any") configures the inner syntax
2776 category (nonterminal symbol) for parsing of terms.
2778 * Former exception Library.UnequalLengths now coincides with
2779 ListPair.UnequalLengths.
2781 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2782 main functionality is provided by structure Simplifier.
2784 * Renamed raw "explode" function to "raw_explode" to emphasize its
2785 meaning. Note that internally to Isabelle, Symbol.explode is used in
2786 almost all situations.
2788 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2789 See implementation manual for further details on exceptions in
2792 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2795 * Renamed structure PureThy to Pure_Thy and moved most of its
2796 operations to structure Global_Theory, to emphasize that this is
2797 rarely-used global-only stuff.
2799 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2800 instead (or tracing for high-volume output).
2802 * Configuration option show_question_marks only affects regular pretty
2803 printing of types and terms, not raw Term.string_of_vname.
2805 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2806 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2807 @{thms} for most purposes.
2809 * ML structure Unsynchronized is never opened, not even in Isar
2810 interaction mode as before. Old Unsynchronized.set etc. have been
2811 discontinued -- use plain := instead. This should be *rare* anyway,
2812 since modern tools always work via official context data, notably
2813 configuration options.
2815 * Parallel and asynchronous execution requires special care concerning
2816 interrupts. Structure Exn provides some convenience functions that
2817 avoid working directly with raw Interrupt. User code must not absorb
2818 interrupts -- intermediate handling (for cleanup etc.) needs to be
2819 followed by re-raising of the original exception. Another common
2820 source of mistakes are "handle _" patterns, which make the meaning of
2821 the program subject to physical effects of the environment.
2825 New in Isabelle2009-2 (June 2010)
2826 ---------------------------------
2830 * Authentic syntax for *all* logical entities (type classes, type
2831 constructors, term constants): provides simple and robust
2832 correspondence between formal entities and concrete syntax. Within
2833 the parse tree / AST representations, "constants" are decorated by
2834 their category (class, type, const) and spelled out explicitly with
2835 their full internal name.
2837 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2838 and translations (translation rules and translation functions in ML).
2839 Some hints on upgrading:
2841 - Many existing uses of 'syntax' and 'translations' can be replaced
2842 by more modern 'type_notation', 'notation' and 'abbreviation',
2843 which are independent of this issue.
2845 - 'translations' require markup within the AST; the term syntax
2846 provides the following special forms:
2848 CONST c -- produces syntax version of constant c from context
2849 XCONST c -- literally c, checked as constant from context
2850 c -- literally c, if declared by 'syntax'
2852 Plain identifiers are treated as AST variables -- occasionally the
2853 system indicates accidental variables via the error "rhs contains
2856 Type classes and type constructors are marked according to their
2857 concrete syntax. Some old translations rules need to be written
2858 for the "type" category, using type constructor application
2859 instead of pseudo-term application of the default category
2862 - 'parse_translation' etc. in ML may use the following
2865 @{class_syntax c} -- type class c within parse tree / AST
2866 @{term_syntax c} -- type constructor c within parse tree / AST
2867 @{const_syntax c} -- ML version of "CONST c" above
2868 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2870 - Literal types within 'typed_print_translations', i.e. those *not*
2871 represented as pseudo-terms are represented verbatim. Use @{class
2872 c} or @{type_name c} here instead of the above syntax
2875 Note that old non-authentic syntax was based on unqualified base
2876 names, so all of the above "constant" names would coincide. Recall
2877 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2878 diagnose syntax problems.
2880 * Type constructors admit general mixfix syntax, not just infix.
2882 * Concrete syntax may be attached to local entities without a proof
2883 body, too. This works via regular mixfix annotations for 'fix',
2884 'def', 'obtain' etc. or via the explicit 'write' command, which is
2885 similar to the 'notation' command in theory specifications.
2887 * Discontinued unnamed infix syntax (legacy feature for many years) --
2888 need to specify constant name and syntax separately. Internal ML
2889 datatype constructors have been renamed from InfixName to Infix etc.
2890 Minor INCOMPATIBILITY.
2892 * Schematic theorem statements need to be explicitly markup as such,
2893 via commands 'schematic_lemma', 'schematic_theorem',
2894 'schematic_corollary'. Thus the relevance of the proof is made
2895 syntactically clear, which impacts performance in a parallel or
2896 asynchronous interactive environment. Minor INCOMPATIBILITY.
2898 * Use of cumulative prems via "!" in some proof methods has been
2899 discontinued (old legacy feature).
2901 * References 'trace_simp' and 'debug_simp' have been replaced by
2902 configuration options stored in the context. Enabling tracing (the
2903 case of debugging is similar) in proofs works via
2905 using [[trace_simp = true]]
2907 Tracing is then active for all invocations of the simplifier in
2908 subsequent goal refinement steps. Tracing may also still be enabled or
2909 disabled via the ProofGeneral settings menu.
2911 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2912 'hide_fact' replace the former 'hide' KIND command. Minor
2915 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2916 more efficient than combinations with -q1 or -q2.
2921 * Proofterms record type-class reasoning explicitly, using the
2922 "unconstrain" operation internally. This eliminates all sort
2923 constraints from a theorem and proof, introducing explicit
2924 OFCLASS-premises. On the proof term level, this operation is
2925 automatically applied at theorem boundaries, such that closed proofs
2926 are always free of sort constraints. INCOMPATIBILITY for tools that
2927 inspect proof terms.
2929 * Local theory specifications may depend on extra type variables that
2930 are not present in the result type -- arguments TYPE('a) :: 'a itself
2931 are added internally. For example:
2933 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
2935 * Predicates of locales introduced by classes carry a mandatory
2936 "class" prefix. INCOMPATIBILITY.
2938 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
2940 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
2943 * Command 'code_reflect' allows to incorporate generated ML code into
2944 runtime environment; replaces immature code_datatype antiquotation.
2947 * Code generator: simple concept for abstract datatypes obeying
2950 * Code generator: details of internal data cache have no impact on the
2951 user space functionality any longer.
2953 * Methods "unfold_locales" and "intro_locales" ignore non-locale
2954 subgoals. This is more appropriate for interpretations with 'where'.
2957 * Command 'example_proof' opens an empty proof body. This allows to
2958 experiment with Isar, without producing any persistent result.
2960 * Commands 'type_notation' and 'no_type_notation' declare type syntax
2961 within a local theory context, with explicit checking of the
2962 constructors involved (in contrast to the raw 'syntax' versions).
2964 * Commands 'types' and 'typedecl' now work within a local theory
2965 context -- without introducing dependencies on parameters or
2966 assumptions, which is not possible in Isabelle/Pure.
2968 * Command 'defaultsort' has been renamed to 'default_sort', it works
2969 within a local theory context. Minor INCOMPATIBILITY.
2974 * Command 'typedef' now works within a local theory context -- without
2975 introducing dependencies on parameters or assumptions, which is not
2976 possible in Isabelle/Pure/HOL. Note that the logical environment may
2977 contain multiple interpretations of local typedefs (with different
2978 non-emptiness proofs), even in a global theory context.
2980 * New package for quotient types. Commands 'quotient_type' and
2981 'quotient_definition' may be used for defining types and constants by
2982 quotient constructions. An example is the type of integers created by
2983 quotienting pairs of natural numbers:
2986 intrel :: "(nat * nat) => (nat * nat) => bool"
2988 "intrel (x, y) (u, v) = (x + v = u + y)"
2990 quotient_type int = "nat * nat" / intrel
2991 by (auto simp add: equivp_def expand_fun_eq)
2994 "0::int" is "(0::nat, 0::nat)"
2996 The method "lifting" can be used to lift of theorems from the
2997 underlying "raw" type to the quotient type. The example
2998 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
2999 construction and provides a reasoning infrastructure for finite sets.
3001 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3002 clash with new theory Quotient in Main HOL.
3004 * Moved the SMT binding into the main HOL session, eliminating
3005 separate HOL-SMT session.
3007 * List membership infix mem operation is only an input abbreviation.
3010 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3011 for future developements; former Library/Word.thy is still present in
3012 the AFP entry RSAPPS.
3014 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3015 longer shadowed. INCOMPATIBILITY.
3017 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3020 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3023 * Dropped normalizing_semiring etc; use the facts in semiring classes
3024 instead. INCOMPATIBILITY.
3026 * Dropped several real-specific versions of lemmas about floor and
3027 ceiling; use the generic lemmas from theory "Archimedean_Field"
3028 instead. INCOMPATIBILITY.
3030 floor_number_of_eq ~> floor_number_of
3031 le_floor_eq_number_of ~> number_of_le_floor
3032 le_floor_eq_zero ~> zero_le_floor
3033 le_floor_eq_one ~> one_le_floor
3034 floor_less_eq_number_of ~> floor_less_number_of
3035 floor_less_eq_zero ~> floor_less_zero
3036 floor_less_eq_one ~> floor_less_one
3037 less_floor_eq_number_of ~> number_of_less_floor
3038 less_floor_eq_zero ~> zero_less_floor
3039 less_floor_eq_one ~> one_less_floor
3040 floor_le_eq_number_of ~> floor_le_number_of
3041 floor_le_eq_zero ~> floor_le_zero
3042 floor_le_eq_one ~> floor_le_one
3043 floor_subtract_number_of ~> floor_diff_number_of
3044 floor_subtract_one ~> floor_diff_one
3045 ceiling_number_of_eq ~> ceiling_number_of
3046 ceiling_le_eq_number_of ~> ceiling_le_number_of
3047 ceiling_le_zero_eq ~> ceiling_le_zero
3048 ceiling_le_eq_one ~> ceiling_le_one
3049 less_ceiling_eq_number_of ~> number_of_less_ceiling
3050 less_ceiling_eq_zero ~> zero_less_ceiling
3051 less_ceiling_eq_one ~> one_less_ceiling
3052 ceiling_less_eq_number_of ~> ceiling_less_number_of
3053 ceiling_less_eq_zero ~> ceiling_less_zero
3054 ceiling_less_eq_one ~> ceiling_less_one
3055 le_ceiling_eq_number_of ~> number_of_le_ceiling
3056 le_ceiling_eq_zero ~> zero_le_ceiling
3057 le_ceiling_eq_one ~> one_le_ceiling
3058 ceiling_subtract_number_of ~> ceiling_diff_number_of
3059 ceiling_subtract_one ~> ceiling_diff_one
3061 * Theory "Finite_Set": various folding_XXX locales facilitate the
3062 application of the various fold combinators on finite sets.
3064 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3065 provides abstract red-black tree type which is backed by "RBT_Impl" as
3066 implementation. INCOMPATIBILTY.
3068 * Theory Library/Coinductive_List has been removed -- superseded by
3069 AFP/thys/Coinductive.
3071 * Theory PReal, including the type "preal" and related operations, has
3072 been removed. INCOMPATIBILITY.
3074 * Real: new development using Cauchy Sequences.
3076 * Split off theory "Big_Operators" containing setsum, setprod,
3077 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3079 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3080 "Int" etc. INCOMPATIBILITY.
3082 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3084 * New set of rules "ac_simps" provides combined assoc / commute
3085 rewrites for all interpretations of the appropriate generic locales.
3087 * Renamed theory "OrderedGroup" to "Groups" and split theory
3088 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3089 appropriate and more consistent names suitable for name prefixes
3090 within the HOL theories. INCOMPATIBILITY.
3092 * Some generic constants have been put to appropriate theories:
3093 - less_eq, less: Orderings
3094 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3095 - inverse, divide: Rings
3098 * More consistent naming of type classes involving orderings (and
3101 lower_semilattice ~> semilattice_inf
3102 upper_semilattice ~> semilattice_sup
3104 dense_linear_order ~> dense_linorder
3106 pordered_ab_group_add ~> ordered_ab_group_add
3107 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3108 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3109 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3110 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3111 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3112 pordered_cancel_semiring ~> ordered_cancel_semiring
3113 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3114 pordered_comm_ring ~> ordered_comm_ring
3115 pordered_comm_semiring ~> ordered_comm_semiring
3116 pordered_ring ~> ordered_ring
3117 pordered_ring_abs ~> ordered_ring_abs
3118 pordered_semiring ~> ordered_semiring
3120 ordered_ab_group_add ~> linordered_ab_group_add
3121 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3122 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3123 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3124 ordered_field ~> linordered_field
3125 ordered_field_no_lb ~> linordered_field_no_lb
3126 ordered_field_no_ub ~> linordered_field_no_ub
3127 ordered_field_dense_linear_order ~> dense_linordered_field
3128 ordered_idom ~> linordered_idom
3129 ordered_ring ~> linordered_ring
3130 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3131 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3132 ordered_ring_strict ~> linordered_ring_strict
3133 ordered_semidom ~> linordered_semidom
3134 ordered_semiring ~> linordered_semiring
3135 ordered_semiring_1 ~> linordered_semiring_1
3136 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3137 ordered_semiring_strict ~> linordered_semiring_strict
3139 The following slightly odd type classes have been moved to a
3140 separate theory Library/Lattice_Algebras:
3142 lordered_ab_group_add ~> lattice_ab_group_add
3143 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3144 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3145 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3146 lordered_ring ~> lattice_ring
3150 * Refined field classes:
3151 - classes division_ring_inverse_zero, field_inverse_zero,
3152 linordered_field_inverse_zero include rule inverse 0 = 0 --
3153 subsumes former division_by_zero class;
3154 - numerous lemmas have been ported from field to division_ring.
3157 * Refined algebra theorem collections:
3158 - dropped theorem group group_simps, use algebra_simps instead;
3159 - dropped theorem group ring_simps, use field_simps instead;
3160 - proper theorem collection field_simps subsumes former theorem
3161 groups field_eq_simps and field_simps;
3162 - dropped lemma eq_minus_self_iff which is a duplicate for
3166 * Theory Finite_Set and List: some lemmas have been generalized from
3169 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3170 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3171 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3172 union_Union_fold_union ~> sup_Sup_fold_sup
3173 Inter_fold_inter ~> Inf_fold_inf
3174 Union_fold_union ~> Sup_fold_sup
3175 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3176 union_UNION_fold_union ~> sup_SUPR_fold_sup
3177 INTER_fold_inter ~> INFI_fold_inf
3178 UNION_fold_union ~> SUPR_fold_sup
3180 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3181 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3182 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3183 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3184 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3185 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3187 * Reorganized theory Multiset: swapped notation of pointwise and
3190 - pointwise ordering is instance of class order with standard syntax
3192 - multiset ordering has syntax <=# and <#; partial order properties
3193 are provided by means of interpretation with prefix
3195 - less duplication, less historical organization of sections,
3196 conversion from associations lists to multisets, rudimentary code
3198 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3203 multiset_eq_conv_count_eq ~> multiset_ext_iff
3204 multi_count_ext ~> multiset_ext
3205 diff_union_inverse2 ~> diff_union_cancelR
3209 * Theory Permutation: replaced local "remove" by List.remove1.
3211 * Code generation: ML and OCaml code is decorated with signatures.
3213 * Theory List: added transpose.
3215 * Library/Nat_Bijection.thy is a collection of bijective functions
3216 between nat and other types, which supersedes the older libraries
3217 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3220 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3221 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3222 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3223 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3224 Countable.pair_encode ~> prod_encode
3225 NatIso.prod2nat ~> prod_encode
3226 NatIso.nat2prod ~> prod_decode
3227 NatIso.sum2nat ~> sum_encode
3228 NatIso.nat2sum ~> sum_decode
3229 NatIso.list2nat ~> list_encode
3230 NatIso.nat2list ~> list_decode
3231 NatIso.set2nat ~> set_encode
3232 NatIso.nat2set ~> set_decode
3235 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3236 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3237 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3238 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3239 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3240 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3241 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3242 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3243 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3244 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3245 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3246 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3247 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3250 - Renamed ATP commands:
3251 atp_info ~> sledgehammer running_atps
3252 atp_kill ~> sledgehammer kill_atps
3253 atp_messages ~> sledgehammer messages
3254 atp_minimize ~> sledgehammer minimize
3255 print_atps ~> sledgehammer available_atps
3257 - Added user's manual ("isabelle doc sledgehammer").
3258 - Added option syntax and "sledgehammer_params" to customize
3259 Sledgehammer's behavior. See the manual for details.
3260 - Modified the Isar proof reconstruction code so that it produces
3261 direct proofs rather than proofs by contradiction. (This feature
3262 is still experimental.)
3263 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3265 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3268 - Added and implemented "binary_ints" and "bits" options.
3269 - Added "std" option and implemented support for nonstandard models.
3270 - Added and implemented "finitize" option to improve the precision
3271 of infinite datatypes based on a monotonicity analysis.
3272 - Added support for quotient types.
3273 - Added support for "specification" and "ax_specification"
3275 - Added support for local definitions (for "function" and
3276 "termination" proofs).
3277 - Added support for term postprocessors.
3278 - Optimized "Multiset.multiset" and "FinFun.finfun".
3279 - Improved efficiency of "destroy_constrs" optimization.
3280 - Fixed soundness bugs related to "destroy_constrs" optimization and
3282 - Fixed soundness bug related to higher-order constructors.
3283 - Fixed soundness bug when "full_descrs" is enabled.
3284 - Improved precision of set constructs.
3285 - Added "atoms" option.
3286 - Added cache to speed up repeated Kodkod invocations on the same
3288 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3289 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3290 "SAT4J_Light". INCOMPATIBILITY.
3291 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3292 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3293 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3295 * Method "induct" now takes instantiations of the form t, where t is not
3296 a variable, as a shorthand for "x == t", where x is a fresh variable.
3297 If this is not intended, t has to be enclosed in parentheses.
3298 By default, the equalities generated by definitional instantiations
3299 are pre-simplified, which may cause parameters of inductive cases
3300 to disappear, or may even delete some of the inductive cases.
3301 Use "induct (no_simp)" instead of "induct" to restore the old
3302 behaviour. The (no_simp) option is also understood by the "cases"
3303 and "nominal_induct" methods, which now perform pre-simplification, too.
3309 * Variable names in lemmas generated by the domain package have
3310 changed; the naming scheme is now consistent with the HOL datatype
3311 package. Some proof scripts may be affected, INCOMPATIBILITY.
3313 * The domain package no longer defines the function "foo_copy" for
3314 recursive domain "foo". The reach lemma is now stated directly in
3315 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3316 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3318 * Most definedness lemmas generated by the domain package (previously
3319 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3320 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3321 Proofs that used definedness lemmas as intro rules may break,
3322 potential INCOMPATIBILITY.
3324 * Induction and casedist rules generated by the domain package now
3325 declare proper case_names (one called "bottom", and one named for each
3326 constructor). INCOMPATIBILITY.
3328 * For mutually-recursive domains, separate "reach" and "take_lemma"
3329 rules are generated for each domain, INCOMPATIBILITY.
3331 foo_bar.reach ~> foo.reach bar.reach
3332 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3334 * Some lemmas generated by the domain package have been renamed for
3335 consistency with the datatype package, INCOMPATIBILITY.
3337 foo.ind ~> foo.induct
3338 foo.finite_ind ~> foo.finite_induct
3339 foo.coind ~> foo.coinduct
3340 foo.casedist ~> foo.exhaust
3341 foo.exhaust ~> foo.nchotomy
3343 * For consistency with other definition packages, the fixrec package
3344 now generates qualified theorem names, INCOMPATIBILITY.
3346 foo_simps ~> foo.simps
3347 foo_unfold ~> foo.unfold
3348 foo_induct ~> foo.induct
3350 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3351 method and internal fixrec proofs now use the default simpset instead.
3354 * The "contlub" predicate has been removed. Proof scripts should use
3355 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3357 * The "admw" predicate has been removed, INCOMPATIBILITY.
3359 * The constants cpair, cfst, and csnd have been removed in favor of
3360 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3365 * Antiquotations for basic formal entities:
3367 @{class NAME} -- type class
3368 @{class_syntax NAME} -- syntax representation of the above
3370 @{type_name NAME} -- logical type
3371 @{type_abbrev NAME} -- type abbreviation
3372 @{nonterminal NAME} -- type of concrete syntactic category
3373 @{type_syntax NAME} -- syntax representation of any of the above
3375 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3376 @{const_abbrev NAME} -- abbreviated constant
3377 @{const_syntax NAME} -- syntax representation of any of the above
3379 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3380 syntax constant (cf. 'syntax' command).
3382 * Antiquotation @{make_string} inlines a function to print arbitrary
3383 values similar to the ML toplevel. The result is compiler dependent
3384 and may fall back on "?" in certain situations.
3386 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3387 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3388 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3389 not work with the asynchronous Isar document model.
3391 * Configuration options now admit dynamic default values, depending on
3392 the context or even global references.
3394 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3395 uses an efficient external library if available (for Poly/ML).
3397 * Renamed some important ML structures, while keeping the old names
3398 for some time as aliases within the structure Legacy:
3400 OuterKeyword ~> Keyword
3403 OuterSyntax ~> Outer_Syntax
3404 PrintMode ~> Print_Mode
3405 SpecParse ~> Parse_Spec
3408 ThyOutput ~> Thy_Output
3409 TypeInfer ~> Type_Infer
3411 Note that "open Legacy" simplifies porting of sources, but forgetting
3412 to remove it again will complicate porting again in the future.
3414 * Most operations that refer to a global context are named
3415 accordingly, e.g. Simplifier.global_context or
3416 ProofContext.init_global. There are some situations where a global
3417 context actually works, but under normal circumstances one needs to
3418 pass the proper local context through the code!
3420 * Discontinued old TheoryDataFun with its copy/init operation -- data
3421 needs to be pure. Functor Theory_Data_PP retains the traditional
3422 Pretty.pp argument to merge, which is absent in the standard
3423 Theory_Data version.
3425 * Sorts.certify_sort and derived "cert" operations for types and terms
3426 no longer minimize sorts. Thus certification at the boundary of the
3427 inference kernel becomes invariant under addition of class relations,
3428 which is an important monotonicity principle. Sorts are now minimized
3429 in the syntax layer only, at the boundary between the end-user and the
3430 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3431 explicitly in rare situations.
3433 * Renamed old-style Drule.standard to Drule.export_without_context, to
3434 emphasize that this is in no way a standard operation.
3437 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3438 usual for resolution. Rare INCOMPATIBILITY.
3440 * Renamed varify/unvarify operations to varify_global/unvarify_global
3441 to emphasize that these only work in a global situation (which is
3444 * Curried take and drop in library.ML; negative length is interpreted
3445 as infinity (as in chop). Subtle INCOMPATIBILITY.
3447 * Proof terms: type substitutions on proof constants now use canonical
3448 order of type variables. INCOMPATIBILITY for tools working with proof
3451 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3452 may no longer carry premises. User-level specifications are
3453 transformed accordingly by Thm.add_axiom/add_def.
3458 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3459 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3460 proof terms are enabled unconditionally in the new HOL-Proofs image.
3462 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3463 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3466 * Old lib/scripts/polyml-platform is superseded by the
3467 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3468 variant, even on a 64 bit machine. The following example setting
3469 prefers 64 bit if available:
3471 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3473 * The preliminary Isabelle/jEdit application demonstrates the emerging
3474 Isabelle/Scala layer for advanced prover interaction and integration.
3475 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3478 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3479 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3480 similar to the default assignment of the document preparation system
3481 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3482 provides some operations for direct access to the font without asking
3483 the user for manual installation.
3487 New in Isabelle2009-1 (December 2009)
3488 -------------------------------------
3492 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3493 one backslash should be used, even in ML sources.
3498 * Locale interpretation propagates mixins along the locale hierarchy.
3499 The currently only available mixins are the equations used to map
3500 local definitions to terms of the target domain of an interpretation.
3502 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3503 loc" to print all interpretations of locale "loc" in the theory.
3504 Interpretations in proofs are not shown.
3506 * Thoroughly revised locales tutorial. New section on conditional
3509 * On instantiation of classes, remaining undefined class parameters
3510 are formally declared. INCOMPATIBILITY.
3513 *** Document preparation ***
3515 * New generalized style concept for printing terms: @{foo (style) ...}
3516 instead of @{foo_style style ...} (old form is still retained for
3517 backward compatibility). Styles can be also applied for
3518 antiquotations prop, term_type and typeof.
3523 * New proof method "smt" for a combination of first-order logic with
3524 equality, linear and nonlinear (natural/integer/real) arithmetic, and
3525 fixed-size bitvectors; there is also basic support for higher-order
3526 features (esp. lambda abstractions). It is an incomplete decision
3527 procedure based on external SMT solvers using the oracle mechanism;
3528 for the SMT solver Z3, this method is proof-producing. Certificates
3529 are provided to avoid calling the external solvers solely for
3530 re-checking proofs. Due to a remote SMT service there is no need for
3531 installing SMT solvers locally. See src/HOL/SMT.
3533 * New commands to load and prove verification conditions generated by
3534 the Boogie program verifier or derived systems (e.g. the Verifying C
3535 Compiler (VCC) or Spec#). See src/HOL/Boogie.
3537 * New counterexample generator tool 'nitpick' based on the Kodkod
3538 relational model finder. See src/HOL/Tools/Nitpick and
3539 src/HOL/Nitpick_Examples.
3541 * New commands 'code_pred' and 'values' to invoke the predicate
3542 compiler and to enumerate values of inductive predicates.
3544 * A tabled implementation of the reflexive transitive closure.
3546 * New implementation of quickcheck uses generic code generator;
3547 default generators are provided for all suitable HOL types, records
3548 and datatypes. Old quickcheck can be re-activated importing theory
3549 Library/SML_Quickcheck.
3551 * New testing tool Mirabelle for automated proof tools. Applies
3552 several tools and tactics like sledgehammer, metis, or quickcheck, to
3553 every proof step in a theory. To be used in batch mode via the
3554 "mirabelle" utility.
3556 * New proof method "sos" (sum of squares) for nonlinear real
3557 arithmetic (originally due to John Harison). It requires theory
3558 Library/Sum_Of_Squares. It is not a complete decision procedure but
3559 works well in practice on quantifier-free real arithmetic with +, -,
3560 *, ^, =, <= and <, i.e. boolean combinations of equalities and
3561 inequalities between polynomials. It makes use of external
3562 semidefinite programming solvers. Method "sos" generates a
3563 certificate that can be pasted into the proof thus avoiding the need
3564 to call an external tool every time the proof is checked. See
3565 src/HOL/Library/Sum_Of_Squares.
3567 * New method "linarith" invokes existing linear arithmetic decision
3570 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3572 * New Sledgehammer option "Full Types" in Proof General settings menu.
3573 Causes full type information to be output to the ATPs. This slows
3574 ATPs down considerably but eliminates a source of unsound "proofs"
3577 * New method "metisFT": A version of metis that uses full type
3578 information in order to avoid failures of proof reconstruction.
3580 * New evaluator "approximate" approximates an real valued term using
3581 the same method as the approximation method.
3583 * Method "approximate" now supports arithmetic expressions as
3584 boundaries of intervals and implements interval splitting and Taylor
3587 * ML antiquotation @{code_datatype} inserts definition of a datatype
3588 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3590 * New theory SupInf of the supremum and infimum operators for sets of
3593 * New theory Probability, which contains a development of measure
3594 theory, eventually leading to Lebesgue integration and probability.
3596 * Extended Multivariate Analysis to include derivation and Brouwer's
3599 * Reorganization of number theory, INCOMPATIBILITY:
3600 - new number theory development for nat and int, in theories Divides
3601 and GCD as well as in new session Number_Theory
3602 - some constants and facts now suffixed with _nat and _int
3604 - former session NumberTheory now named Old_Number_Theory, including
3605 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3606 - moved theory Pocklington from src/HOL/Library to
3607 src/HOL/Old_Number_Theory
3609 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3610 lcm of finite and infinite sets. It is shown that they form a complete
3613 * Class semiring_div requires superclass no_zero_divisors and proof of
3614 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3615 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3616 generalized to class semiring_div, subsuming former theorems
3617 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3618 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3621 * Refinements to lattice classes and sets:
3622 - less default intro/elim rules in locale variant, more default
3623 intro/elim rules in class variant: more uniformity
3624 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3626 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3628 - renamed ACI to inf_sup_aci
3629 - new class "boolean_algebra"
3630 - class "complete_lattice" moved to separate theory
3631 "Complete_Lattice"; corresponding constants (and abbreviations)
3632 renamed and with authentic syntax:
3633 Set.Inf ~> Complete_Lattice.Inf
3634 Set.Sup ~> Complete_Lattice.Sup
3635 Set.INFI ~> Complete_Lattice.INFI
3636 Set.SUPR ~> Complete_Lattice.SUPR
3637 Set.Inter ~> Complete_Lattice.Inter
3638 Set.Union ~> Complete_Lattice.Union
3639 Set.INTER ~> Complete_Lattice.INTER
3640 Set.UNION ~> Complete_Lattice.UNION
3641 - authentic syntax for
3644 - mere abbreviations:
3647 Set.inter (for inf, formerly Set.Int)
3648 Set.union (for sup, formerly Set.Un)
3649 Complete_Lattice.Inter (for Inf)
3650 Complete_Lattice.Union (for Sup)
3651 Complete_Lattice.INTER (for INFI)
3652 Complete_Lattice.UNION (for SUPR)
3653 - object-logic definitions as far as appropriate
3655 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3656 Un_subset_iff are explicitly deleted as default simp rules; then also
3657 their lattice counterparts le_inf_iff and le_sup_iff have to be
3658 deleted to achieve the desired effect.
3660 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3661 rules by default any longer; the same applies to min_max.inf_absorb1
3662 etc. INCOMPATIBILITY.
3664 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3665 pred_set_conv by default. INCOMPATIBILITY.
3667 * Power operations on relations and functions are now one dedicated
3668 constant "compow" with infix syntax "^^". Power operation on
3669 multiplicative monoids retains syntax "^" and is now defined generic
3670 in class power. INCOMPATIBILITY.
3672 * Relation composition "R O S" now has a more standard argument order:
3673 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3674 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3675 break, since the O_assoc rule was not rewritten like this. Fix using
3676 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3678 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3679 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3682 * Most rules produced by inductive and datatype package have mandatory
3683 prefixes. INCOMPATIBILITY.
3685 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3686 the attribute of the same name. Each of the theorems in the list
3687 DERIV_intros assumes composition with an additional function and
3688 matches a variable to the derivative, which has to be solved by the
3689 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3690 of most elementary terms. Former Maclauren.DERIV_tac and
3691 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3694 * Code generator attributes follow the usual underscore convention:
3695 code_unfold replaces code unfold
3696 code_post replaces code post
3701 sizechange -> size_change
3702 induct_scheme -> induction_schema
3705 * Discontinued abbreviation "arbitrary" of constant "undefined".
3706 INCOMPATIBILITY, use "undefined" directly.
3709 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3710 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3711 Suc_plus1 -> Suc_eq_plus1
3712 *anti_sym -> *antisym*
3713 vector_less_eq_def -> vector_le_def
3716 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3719 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3725 * Theory Representable defines a class "rep" of domains that are
3726 representable (via an ep-pair) in the universal domain type "udom".
3727 Instances are provided for all type constructors defined in HOLCF.
3729 * The 'new_domain' command is a purely definitional version of the
3730 domain package, for representable domains. Syntax is identical to the
3731 old domain package. The 'new_domain' package also supports indirect
3732 recursion using previously-defined type constructors. See
3733 src/HOLCF/ex/New_Domain.thy for examples.
3735 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3736 on the left-hand side of an equation, and then performs
3737 simplification. Rewriting is done using rules declared with the
3738 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3739 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3741 * The pattern-match compiler in 'fixrec' can now handle constructors
3742 with HOL function types. Pattern-match combinators for the Pair
3743 constructor are pre-configured.
3745 * The 'fixrec' package now produces better fixed-point induction rules
3746 for mutually-recursive definitions: Induction rules have conclusions
3747 of the form "P foo bar" instead of "P <foo, bar>".
3749 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3750 been renamed to "below". The name "below" now replaces "less" in many
3751 theorem names. (Legacy theorem names using "less" are still supported
3754 * The 'fixrec' package now supports "bottom patterns". Bottom
3755 patterns can be used to generate strictness rules, or to make
3756 functions more strict (much like the bang-patterns supported by the
3757 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3763 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3764 errors and run-time exceptions, including detailed source positions.
3766 * Structure Name_Space (formerly NameSpace) now manages uniquely
3767 identified entries, with some additional information such as source
3768 position, logical grouping etc.
3770 * Theory and context data is now introduced by the simplified and
3771 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3772 to be pure, but the old TheoryDataFun for mutable data (with explicit
3773 copy operation) is still available for some time.
3775 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3776 provides a high-level programming interface to synchronized state
3777 variables with atomic update. This works via pure function
3778 application within a critical section -- its runtime should be as
3779 short as possible; beware of deadlocks if critical code is nested,
3780 either directly or indirectly via other synchronized variables!
3782 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3783 wraps raw ML references, explicitly indicating their non-thread-safe
3784 behaviour. The Isar toplevel keeps this structure open, to
3785 accommodate Proof General as well as quick and dirty interactive
3786 experiments with references.
3788 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3789 parallel tactical reasoning.
3791 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3792 are similar to SUBPROOF, but are slightly more flexible: only the
3793 specified parts of the subgoal are imported into the context, and the
3794 body tactic may introduce new subgoals and schematic variables.
3796 * Old tactical METAHYPS, which does not observe the proof context, has
3797 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3798 or Subgoal.FOCUS etc.
3800 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3801 functors have their own ML name space there is no point to mark them
3802 separately.) Minor INCOMPATIBILITY.
3804 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3806 * Renamed several structures FooBar to Foo_Bar. Occasional,
3809 * Operations of structure Skip_Proof no longer require quick_and_dirty
3810 mode, which avoids critical setmp.
3812 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3813 combinators for "args". INCOMPATIBILITY, need to use simplified
3814 Attrib/Method.setup introduced in Isabelle2009.
3816 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3817 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3818 last resort. INCOMPATIBILITY.
3820 * Display.pretty_thm now requires a proper context (cf. former
3821 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3822 or even Display.pretty_thm_without_context as last resort.
3825 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3826 Syntax.pretty_typ/term directly, preferably with proper context
3827 instead of global theory.
3832 * Further fine tuning of parallel proof checking, scales up to 8 cores
3833 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3836 * Support for additional "Isabelle components" via etc/components, see
3837 also the system manual.
3839 * The isabelle makeall tool now operates on all components with
3840 IsaMakefile, not just hardwired "logics".
3842 * Removed "compress" option from isabelle-process and isabelle usedir;
3843 this is always enabled.
3845 * Discontinued support for Poly/ML 4.x versions.
3847 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3848 on a given logic image. This requires the lighttpd webserver and is
3849 currently supported on Linux only.
3853 New in Isabelle2009 (April 2009)
3854 --------------------------------
3858 * Simplified main Isabelle executables, with less surprises on
3859 case-insensitive file-systems (such as Mac OS).
3861 - The main Isabelle tool wrapper is now called "isabelle" instead of
3864 - The former "isabelle" alias for "isabelle-process" has been
3865 removed (should rarely occur to regular users).
3867 - The former "isabelle-interface" and its alias "Isabelle" have been
3868 removed (interfaces are now regular Isabelle tools).
3870 Within scripts and make files, the Isabelle environment variables
3871 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3872 respectively. (The latter are still available as legacy feature.)
3874 The old isabelle-interface wrapper could react in confusing ways if
3875 the interface was uninstalled or changed otherwise. Individual
3876 interface tool configuration is now more explicit, see also the
3877 Isabelle system manual. In particular, Proof General is now available
3878 via "isabelle emacs".
3880 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3881 purge installed copies of Isabelle executables and re-run "isabelle
3882 install -p ...", or use symlinks.
3884 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3885 old ~/isabelle, which was slightly non-standard and apt to cause
3886 surprises on case-insensitive file-systems (such as Mac OS).
3888 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3889 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3890 care is required when using older releases of Isabelle. Note that
3891 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3892 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3894 * Proofs of fully specified statements are run in parallel on
3895 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3896 a regular 4-core machine, if the initial heap space is made reasonably
3897 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3899 * The main reference manuals ("isar-ref", "implementation", and
3900 "system") have been updated and extended. Formally checked references
3901 as hyperlinks are now available uniformly.
3906 * Complete re-implementation of locales. INCOMPATIBILITY in several
3907 respects. The most important changes are listed below. See the
3908 Tutorial on Locales ("locales" manual) for details.
3910 - In locale expressions, instantiation replaces renaming. Parameters
3911 must be declared in a for clause. To aid compatibility with previous
3912 parameter inheritance, in locale declarations, parameters that are not
3913 'touched' (instantiation position "_" or omitted) are implicitly added
3914 with their syntax at the beginning of the for clause.
3916 - Syntax from abbreviations and definitions in locales is available in
3917 locale expressions and context elements. The latter is particularly
3918 useful in locale declarations.
3920 - More flexible mechanisms to qualify names generated by locale
3921 expressions. Qualifiers (prefixes) may be specified in locale
3922 expressions, and can be marked as mandatory (syntax: "name!:") or
3923 optional (syntax "name?:"). The default depends for plain "name:"
3924 depends on the situation where a locale expression is used: in
3925 commands 'locale' and 'sublocale' prefixes are optional, in
3926 'interpretation' and 'interpret' prefixes are mandatory. The old
3927 implicit qualifiers derived from the parameter names of a locale are
3928 no longer generated.
3930 - Command "sublocale l < e" replaces "interpretation l < e". The
3931 instantiation clause in "interpretation" and "interpret" (square
3932 brackets) is no longer available. Use locale expressions.
3934 - When converting proof scripts, mandatory qualifiers in
3935 'interpretation' and 'interpret' should be retained by default, even
3936 if this is an INCOMPATIBILITY compared to former behavior. In the
3937 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
3938 in locale expressions range over a single locale instance only.
3940 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
3941 In existing theorem specifications replace the includes element by the
3942 respective context elements of the included locale, omitting those
3943 that are already present in the theorem specification. Multiple
3944 assume elements of a locale should be replaced by a single one
3945 involving the locale predicate. In the proof body, declarations (most
3946 notably theorems) may be regained by interpreting the respective
3947 locales in the proof context as required (command "interpret").
3949 If using "includes" in replacement of a target solely because the
3950 parameter types in the theorem are not as general as in the target,
3951 consider declaring a new locale with additional type constraints on
3952 the parameters (context element "constrains").
3954 - Discontinued "locale (open)". INCOMPATIBILITY.
3956 - Locale interpretation commands no longer attempt to simplify goal.
3957 INCOMPATIBILITY: in rare situations the generated goal differs. Use
3958 methods intro_locales and unfold_locales to clarify.
3960 - Locale interpretation commands no longer accept interpretation
3961 attributes. INCOMPATIBILITY.
3963 * Class declaration: so-called "base sort" must not be given in import
3964 list any longer, but is inferred from the specification. Particularly
3971 class foo = type + ...
3973 * Class target: global versions of theorems stemming do not carry a
3974 parameter prefix any longer. INCOMPATIBILITY.
3976 * Class 'instance' command no longer accepts attached definitions.
3977 INCOMPATIBILITY, use proper 'instantiation' target instead.
3979 * Recovered hiding of consts, which was accidentally broken in
3980 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
3981 makes c inaccessible; consider using ``hide (open) const c'' instead.
3983 * Slightly more coherent Pure syntax, with updated documentation in
3984 isar-ref manual. Removed locales meta_term_syntax and
3985 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
3986 INCOMPATIBILITY in rare situations. Note that &&& should not be used
3987 directly in regular applications.
3989 * There is a new syntactic category "float_const" for signed decimal
3990 fractions (e.g. 123.45 or -123.45).
3992 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
3993 interface with 'setup' command instead.
3995 * Command 'local_setup' is similar to 'setup', but operates on a local
3998 * The 'axiomatization' command now only works within a global theory
3999 context. INCOMPATIBILITY.
4001 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4002 hypotheses. Sorts required in the course of reasoning need to be
4003 covered by the constraints in the initial statement, completed by the
4004 type instance information of the background theory. Non-trivial sort
4005 hypotheses, which rarely occur in practice, may be specified via
4006 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4008 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4010 The result contains an implicit sort hypotheses as before --
4011 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4014 * Generalized Isar history, with support for linear undo, direct state
4017 * Changed defaults for unify configuration options:
4019 unify_trace_bound = 50 (formerly 25)
4020 unify_search_bound = 60 (formerly 30)
4022 * Different bookkeeping for code equations (INCOMPATIBILITY):
4024 a) On theory merge, the last set of code equations for a particular
4025 constant is taken (in accordance with the policy applied by other
4026 parts of the code generator framework).
4028 b) Code equations stemming from explicit declarations (e.g. code
4029 attribute) gain priority over default code equations stemming
4030 from definition, primrec, fun etc.
4032 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4034 * Unified theorem tables for both code generators. Thus [code
4035 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4037 * Command 'find_consts' searches for constants based on type and name
4040 find_consts "_ => bool"
4042 By default, matching is against subtypes, but it may be restricted to
4043 the whole type. Searching by name is possible. Multiple queries are
4044 conjunctive and queries may be negated by prefixing them with a
4047 find_consts strict: "_ => bool" name: "Int" -"int => int"
4049 * New 'find_theorems' criterion "solves" matches theorems that
4050 directly solve the current goal (modulo higher-order unification).
4052 * Auto solve feature for main theorem statements: whenever a new goal
4053 is stated, "find_theorems solves" is called; any theorems that could
4054 solve the lemma directly are listed as part of the goal state.
4055 Cf. associated options in Proof General Isabelle settings menu,
4056 enabled by default, with reasonable timeout for pathological cases of
4057 higher-order unification.
4060 *** Document preparation ***
4062 * Antiquotation @{lemma} now imitates a regular terminal proof,
4063 demanding keyword 'by' and supporting the full method expression
4064 syntax just like the Isar command 'by'.
4069 * Integrated main parts of former image HOL-Complex with HOL. Entry
4070 points Main and Complex_Main remain as before.
4072 * Logic image HOL-Plain provides a minimal HOL with the most important
4073 tools available (inductive, datatype, primrec, ...). This facilitates
4074 experimentation and tool development. Note that user applications
4075 (and library theories) should never refer to anything below theory
4078 * Logic image HOL-Main stops at theory Main, and thus facilitates
4079 experimentation due to shorter build times.
4081 * Logic image HOL-NSA contains theories of nonstandard analysis which
4082 were previously part of former HOL-Complex. Entry point Hyperreal
4083 remains valid, but theories formerly using Complex_Main should now use
4084 new entry point Hypercomplex.
4086 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4087 Posix processes. Avoids potentially expensive forking of the ML
4088 process. New thread-based implementation also works on non-Unix
4089 platforms (Cygwin). Provers are no longer hardwired, but defined
4090 within the theory via plain ML wrapper functions. Basic Sledgehammer
4091 commands are covered in the isar-ref manual.
4093 * Wrapper scripts for remote SystemOnTPTP service allows to use
4094 sledgehammer without local ATP installation (Vampire etc.). Other
4095 provers may be included via suitable ML wrappers, see also
4096 src/HOL/ATP_Linkup.thy.
4098 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4101 * The metis method no longer fails because the theorem is too trivial
4102 (contains the empty clause).
4104 * The metis method now fails in the usual manner, rather than raising
4105 an exception, if it determines that it cannot prove the theorem.
4107 * Method "coherent" implements a prover for coherent logic (see also
4108 src/Tools/coherent.ML).
4110 * Constants "undefined" and "default" replace "arbitrary". Usually
4111 "undefined" is the right choice to replace "arbitrary", though
4112 logically there is no difference. INCOMPATIBILITY.
4114 * Command "value" now integrates different evaluation mechanisms. The
4115 result of the first successful evaluation mechanism is printed. In
4116 square brackets a particular named evaluation mechanisms may be
4117 specified (currently, [SML], [code] or [nbe]). See further
4118 src/HOL/ex/Eval_Examples.thy.
4120 * Normalization by evaluation now allows non-leftlinear equations.
4121 Declare with attribute [code nbe].
4123 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4124 as the structured Isar versions "cases" and "induct", cf. the
4125 corresponding "cases" and "induct" attributes. Mutual induction rules
4126 are now presented as a list of individual projections
4127 (e.g. foo_bar.inducts for types foo and bar); the old format with
4128 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4129 rare situations a different rule is selected --- notably nested tuple
4130 elimination instead of former prod.exhaust: use explicit (case_tac t
4131 rule: prod.exhaust) here.
4133 * Attributes "cases", "induct", "coinduct" support "del" option.
4135 * Removed fact "case_split_thm", which duplicates "case_split".
4137 * The option datatype has been moved to a new theory Option. Renamed
4138 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4140 * New predicate "strict_mono" classifies strict functions on partial
4141 orders. With strict functions on linear orders, reasoning about
4142 (in)equalities is facilitated by theorems "strict_mono_eq",
4143 "strict_mono_less_eq" and "strict_mono_less".
4145 * Some set operations are now proper qualified constants with
4146 authentic syntax. INCOMPATIBILITY:
4157 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4160 * Auxiliary class "itself" has disappeared -- classes without any
4161 parameter are treated as expected by the 'class' command.
4163 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4165 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4166 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4168 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4169 method "approximation". It proves formulas on real values by using
4170 interval arithmetic. In the formulas are also the transcendental
4171 functions sin, cos, tan, atan, ln, exp and the constant pi are
4172 allowed. For examples see
4173 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4175 * Theory "Reflection" now resides in HOL/Library.
4177 * Entry point to Word library now simply named "Word".
4180 * Made source layout more coherent with logical distribution
4183 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4184 src/HOL/Library/Code_Message.thy ~> src/HOL/
4185 src/HOL/Library/GCD.thy ~> src/HOL/
4186 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4187 src/HOL/Library/Parity.thy ~> src/HOL/
4188 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4189 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4190 src/HOL/Real/Lubs.thy ~> src/HOL/
4191 src/HOL/Real/PReal.thy ~> src/HOL/
4192 src/HOL/Real/Rational.thy ~> src/HOL/
4193 src/HOL/Real/RComplete.thy ~> src/HOL/
4194 src/HOL/Real/RealDef.thy ~> src/HOL/
4195 src/HOL/Real/RealPow.thy ~> src/HOL/
4196 src/HOL/Real/Real.thy ~> src/HOL/
4197 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4198 src/HOL/Complex/Complex.thy ~> src/HOL/
4199 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4200 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4201 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4202 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4203 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4204 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4205 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4206 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4207 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4208 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4209 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4210 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4211 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4212 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4213 src/HOL/Real/Float ~> src/HOL/Library/
4214 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4215 src/HOL/Real/RealVector.thy ~> src/HOL/
4217 src/HOL/arith_data.ML ~> src/HOL/Tools
4218 src/HOL/hologic.ML ~> src/HOL/Tools
4219 src/HOL/simpdata.ML ~> src/HOL/Tools
4220 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4221 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4222 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4223 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4224 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4225 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4226 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4228 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4229 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4230 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4231 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4232 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4233 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4235 * If methods "eval" and "evaluation" encounter a structured proof
4236 state with !!/==>, only the conclusion is evaluated to True (if
4237 possible), avoiding strange error messages.
4239 * Method "sizechange" automates termination proofs using (a
4240 modification of) the size-change principle. Requires SAT solver. See
4241 src/HOL/ex/Termination.thy for examples.
4243 * Simplifier: simproc for let expressions now unfolds if bound
4244 variable occurs at most once in let expression body. INCOMPATIBILITY.
4246 * Method "arith": Linear arithmetic now ignores all inequalities when
4247 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4249 * New attribute "arith" for facts that should always be used
4250 automatically by arithmetic. It is intended to be used locally in
4253 assumes [arith]: "x > 0"
4255 Global usage is discouraged because of possible performance impact.
4257 * New classes "top" and "bot" with corresponding operations "top" and
4258 "bot" in theory Orderings; instantiation of class "complete_lattice"
4259 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4261 * Changed definition lemma "less_fun_def" in order to provide an
4262 instance for preorders on functions; use lemma "less_le" instead.
4265 * Theory Orderings: class "wellorder" moved here, with explicit
4266 induction rule "less_induct" as assumption. For instantiation of
4267 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4270 * Theory Orderings: added class "preorder" as superclass of "order".
4271 INCOMPATIBILITY: Instantiation proofs for order, linorder
4272 etc. slightly changed. Some theorems named order_class.* now named
4275 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4278 * Theory Finite_Set: added a new fold combinator of type
4280 ('a => 'b => 'b) => 'b => 'a set => 'b
4282 Occasionally this is more convenient than the old fold combinator
4283 which is now defined in terms of the new one and renamed to
4286 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4287 and "ring_simps" have been replaced by "algebra_simps" (which can be
4288 extended with further lemmas!). At the moment both still exist but
4289 the former will disappear at some point.
4291 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4292 class recpower. Type-specific simp rules for various recpower types
4293 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4295 rat_power_0 -> power_0
4296 rat_power_Suc -> power_Suc
4297 realpow_0 -> power_0
4298 realpow_Suc -> power_Suc
4299 complexpow_0 -> power_0
4300 complexpow_Suc -> power_Suc
4301 power_poly_0 -> power_0
4302 power_poly_Suc -> power_Suc
4304 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4305 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4306 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4307 of lemmas from Divides has been generalized from nat to class
4308 semiring_div. INCOMPATIBILITY. This involves the following theorem
4309 renames resulting from duplicate elimination:
4311 dvd_def_mod ~> dvd_eq_mod_eq_0
4312 zero_dvd_iff ~> dvd_0_left_iff
4313 dvd_0 ~> dvd_0_right
4314 DIVISION_BY_ZERO_DIV ~> div_by_0
4315 DIVISION_BY_ZERO_MOD ~> mod_by_0
4316 mult_div ~> div_mult_self2_is_id
4317 mult_mod ~> mod_mult_self2_is_0
4319 * Theory IntDiv: removed many lemmas that are instances of class-based
4320 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4321 rename old lemmas as follows:
4323 dvd_diff -> nat_dvd_diff
4324 dvd_zminus_iff -> dvd_minus_iff
4325 mod_add1_eq -> mod_add_eq
4326 mod_mult1_eq -> mod_mult_right_eq
4327 mod_mult1_eq' -> mod_mult_left_eq
4328 mod_mult_distrib_mod -> mod_mult_eq
4329 nat_mod_add_left_eq -> mod_add_left_eq
4330 nat_mod_add_right_eq -> mod_add_right_eq
4331 nat_mod_div_trivial -> mod_div_trivial
4332 nat_mod_mod_trivial -> mod_mod_trivial
4333 zdiv_zadd_self1 -> div_add_self1
4334 zdiv_zadd_self2 -> div_add_self2
4335 zdiv_zmult_self1 -> div_mult_self2_is_id
4336 zdiv_zmult_self2 -> div_mult_self1_is_id
4337 zdvd_triv_left -> dvd_triv_left
4338 zdvd_triv_right -> dvd_triv_right
4339 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4340 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4341 zmod_zadd_left_eq -> mod_add_left_eq
4342 zmod_zadd_right_eq -> mod_add_right_eq
4343 zmod_zadd_self1 -> mod_add_self1
4344 zmod_zadd_self2 -> mod_add_self2
4345 zmod_zadd1_eq -> mod_add_eq
4346 zmod_zdiff1_eq -> mod_diff_eq
4347 zmod_zdvd_zmod -> mod_mod_cancel
4348 zmod_zmod_cancel -> mod_mod_cancel
4349 zmod_zmult_self1 -> mod_mult_self2_is_0
4350 zmod_zmult_self2 -> mod_mult_self1_is_0
4353 zdvd_abs1 -> abs_dvd_iff
4354 zdvd_abs2 -> dvd_abs_iff
4355 zdvd_refl -> dvd_refl
4356 zdvd_trans -> dvd_trans
4357 zdvd_zadd -> dvd_add
4358 zdvd_zdiff -> dvd_diff
4359 zdvd_zminus_iff -> dvd_minus_iff
4360 zdvd_zminus2_iff -> minus_dvd_iff
4361 zdvd_zmultD -> dvd_mult_right
4362 zdvd_zmultD2 -> dvd_mult_left
4363 zdvd_zmult_mono -> mult_dvd_mono
4364 zdvd_0_right -> dvd_0_right
4365 zdvd_0_left -> dvd_0_left_iff
4366 zdvd_1_left -> one_dvd
4367 zminus_dvd_iff -> minus_dvd_iff
4369 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4371 * The real numbers offer decimal input syntax: 12.34 is translated
4372 into 1234/10^2. This translation is not reversed upon output.
4374 * Theory Library/Polynomial defines an abstract type 'a poly of
4375 univariate polynomials with coefficients of type 'a. In addition to
4376 the standard ring operations, it also supports div and mod. Code
4377 generation is also supported, using list-style constructors.
4379 * Theory Library/Inner_Product defines a class of real_inner for real
4380 inner product spaces, with an overloaded operation inner :: 'a => 'a
4381 => real. Class real_inner is a subclass of real_normed_vector from
4384 * Theory Library/Product_Vector provides instances for the product
4385 type 'a * 'b of several classes from RealVector and Inner_Product.
4386 Definitions of addition, subtraction, scalar multiplication, norms,
4387 and inner products are included.
4389 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4390 addition to the field operations, numerals and case syntax are also
4393 * Theory Library/Diagonalize provides constructive version of Cantor's
4394 first diagonalization argument.
4396 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4397 zlcm (for int); carried together from various gcd/lcm developements in
4398 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4399 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4400 may recover tupled syntax as follows:
4402 hide (open) const gcd
4403 abbreviation gcd where
4404 "gcd == (%(a, b). GCD.gcd a b)"
4406 GCD.gcd ("gcd '(_, _')")
4408 The same works for lcm, zgcd, zlcm.
4410 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4411 instantiations for algebraic structures. Removed some duplicate
4412 theorems. Changes in simp rules. INCOMPATIBILITY.
4414 * ML antiquotation @{code} takes a constant as argument and generates
4415 corresponding code in background and inserts name of the corresponding
4416 resulting ML value/function/datatype constructor binding in place.
4417 All occurrences of @{code} with a single ML block are generated
4418 simultaneously. Provides a generic and safe interface for
4419 instrumentalizing code generation. See
4420 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4421 In future you ought to refrain from ad-hoc compiling generated SML
4422 code on the ML toplevel. Note that (for technical reasons) @{code}
4423 cannot refer to constants for which user-defined serializations are
4424 set. Refer to the corresponding ML counterpart directly in that
4427 * Command 'rep_datatype': instead of theorem names the command now
4428 takes a list of terms denoting the constructors of the type to be
4429 represented as datatype. The characteristic theorems have to be
4430 proven. INCOMPATIBILITY. Also observe that the following theorems
4431 have disappeared in favour of existing ones:
4433 unit_induct ~> unit.induct
4434 prod_induct ~> prod.induct
4435 sum_induct ~> sum.induct
4436 Suc_Suc_eq ~> nat.inject
4437 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4442 * New locales for orders and lattices where the equivalence relation
4443 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4444 locales use a record structure with field eq for the equivalence.
4446 * New theory of factorial domains.
4448 * Units_l_inv and Units_r_inv are now simp rules by default.
4449 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4450 and/or r_inv will now also require deletion of these lemmas.
4452 * Renamed the following theorems, INCOMPATIBILITY:
4454 UpperD ~> Upper_memD
4455 LowerD ~> Lower_memD
4456 least_carrier ~> least_closed
4457 greatest_carrier ~> greatest_closed
4458 greatest_Lower_above ~> greatest_Lower_below
4459 one_zero ~> carrier_one_zero
4460 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4465 * Nominal datatypes can now contain type-variables.
4467 * Commands 'nominal_inductive' and 'equivariance' work with local
4470 * Nominal primrec can now works with local theory targets and its
4471 specification syntax now conforms to the general format as seen in
4474 * Method "perm_simp" honours the standard simplifier attributes
4475 (no_asm), (no_asm_use) etc.
4477 * The new predicate #* is defined like freshness, except that on the
4478 left hand side can be a set or list of atoms.
4480 * Experimental command 'nominal_inductive2' derives strong induction
4481 principles for inductive definitions. In contrast to
4482 'nominal_inductive', which can only deal with a fixed number of
4483 binders, it can deal with arbitrary expressions standing for sets of
4484 atoms to be avoided. The only inductive definition we have at the
4485 moment that needs this generalisation is the typing rule for Lets in
4488 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4489 -----------------------------------------------------------------
4490 Gamma |- Let x be t1 in t2 : T2
4492 In this rule one wants to avoid all the binders that are introduced by
4493 "close Gamma T1". We are looking for other examples where this
4494 feature might be useful. Please let us know.
4499 * Reimplemented the simplification procedure for proving continuity
4500 subgoals. The new simproc is extensible; users can declare additional
4501 continuity introduction rules with the attribute [cont2cont].
4503 * The continuity simproc now uses a different introduction rule for
4504 solving continuity subgoals on terms with lambda abstractions. In
4505 some rare cases the new simproc may fail to solve subgoals that the
4506 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4507 Potential INCOMPATIBILITY.
4509 * Command 'fixrec': specification syntax now conforms to the general
4510 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
4511 examples. INCOMPATIBILITY.
4516 * Proof of Zorn's Lemma for partial orders.
4521 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
4522 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
4523 depends on multithreading, so timouts will not work before Poly/ML
4526 * High-level support for concurrent ML programming, see
4527 src/Pure/Cuncurrent. The data-oriented model of "future values" is
4528 particularly convenient to organize independent functional
4529 computations. The concept of "synchronized variables" provides a
4530 higher-order interface for components with shared state, avoiding the
4531 delicate details of mutexes and condition variables. (Requires
4532 Poly/ML 5.2.1 or later.)
4534 * ML bindings produced via Isar commands are stored within the Isar
4535 context (theory or proof). Consequently, commands like 'use' and 'ML'
4536 become thread-safe and work with undo as expected (concerning
4537 top-level bindings, not side-effects on global references).
4538 INCOMPATIBILITY, need to provide proper Isar context when invoking the
4539 compiler at runtime; really global bindings need to be given outside a
4540 theory. (Requires Poly/ML 5.2 or later.)
4542 * Command 'ML_prf' is analogous to 'ML' but works within a proof
4543 context. Top-level ML bindings are stored within the proof context in
4544 a purely sequential fashion, disregarding the nested proof structure.
4545 ML bindings introduced by 'ML_prf' are discarded at the end of the
4546 proof. (Requires Poly/ML 5.2 or later.)
4548 * Simplified ML attribute and method setup, cf. functions Attrib.setup
4549 and Method.setup, as well as Isar commands 'attribute_setup' and
4550 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
4551 existing code accordingly, or use plain 'setup' together with old
4554 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
4555 to 'a -> thm, while results are always tagged with an authentic oracle
4556 name. The Isar command 'oracle' is now polymorphic, no argument type
4557 is specified. INCOMPATIBILITY, need to simplify existing oracle code
4558 accordingly. Note that extra performance may be gained by producing
4559 the cterm carefully, avoiding slow Thm.cterm_of.
4561 * Simplified interface for defining document antiquotations via
4562 ThyOutput.antiquotation, ThyOutput.output, and optionally
4563 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
4564 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
4567 * More systematic treatment of long names, abstract name bindings, and
4568 name space operations. Basic operations on qualified names have been
4569 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4570 Long_Name.append. Old type bstring has been mostly replaced by
4571 abstract type binding (see structure Binding), which supports precise
4572 qualification by packages and local theory targets, as well as proper
4573 tracking of source positions. INCOMPATIBILITY, need to wrap old
4574 bstring values into Binding.name, or better pass through abstract
4575 bindings everywhere. See further src/Pure/General/long_name.ML,
4576 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4578 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4579 LocalTheory.note etc.) now refer to the *full* internal name, not the
4580 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4582 * Disposed old type and term read functions (Sign.read_def_typ,
4583 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4584 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4585 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4586 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4587 resort for legacy applications.
4589 * Disposed old declarations, tactics, tactic combinators that refer to
4590 the simpset or claset of an implicit theory (such as Addsimps,
4591 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4592 embedded ML text, or local_simpset_of with a proper context passed as
4593 explicit runtime argument.
4595 * Rules and tactics that read instantiations (read_instantiate,
4596 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4597 context, which is required for parsing and type-checking. Moreover,
4598 the variables are specified as plain indexnames, not string encodings
4599 thereof. INCOMPATIBILITY.
4601 * Generic Toplevel.add_hook interface allows to analyze the result of
4602 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4603 for theorem dependency output of transactions resulting in a new
4606 * ML antiquotations: block-structured compilation context indicated by
4607 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4609 @{binding name} - basic name binding
4610 @{let ?pat = term} - term abbreviation (HO matching)
4611 @{note name = fact} - fact abbreviation
4612 @{thm fact} - singleton fact (with attributes)
4613 @{thms fact} - general fact (with attributes)
4614 @{lemma prop by method} - singleton goal
4615 @{lemma prop by meth1 meth2} - singleton goal
4616 @{lemma prop1 ... propN by method} - general goal
4617 @{lemma prop1 ... propN by meth1 meth2} - general goal
4618 @{lemma (open) ...} - open derivation
4623 * The Isabelle "emacs" tool provides a specific interface to invoke
4624 Proof General / Emacs, with more explicit failure if that is not
4625 installed (the old isabelle-interface script silently falls back on
4626 isabelle-process). The PROOFGENERAL_HOME setting determines the
4627 installation location of the Proof General distribution.
4629 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4630 the Isabelle process into a JVM/Scala application. See
4631 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4632 process wrapper has been discontinued.)
4634 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4636 * Various status messages (with exact source position information) are
4637 emitted, if proper markup print mode is enabled. This allows
4638 user-interface components to provide detailed feedback on internal
4643 New in Isabelle2008 (June 2008)
4644 -------------------------------
4648 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4649 and updated, with formally checked references as hyperlinks.
4651 * Theory loader: use_thy (and similar operations) no longer set the
4652 implicit ML context, which was occasionally hard to predict and in
4653 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4654 provides a proper context already.
4656 * Theory loader: old-style ML proof scripts being *attached* to a thy
4657 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4658 'use' within a theory file will do the job.
4660 * Name space merge now observes canonical order, i.e. the second space
4661 is inserted into the first one, while existing entries in the first
4662 space take precedence. INCOMPATIBILITY in rare situations, may try to
4663 swap theory imports.
4665 * Syntax: symbol \<chi> is now considered a letter. Potential
4666 INCOMPATIBILITY in identifier syntax etc.
4668 * Outer syntax: string tokens no longer admit escaped white space,
4669 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4670 white space without escapes.
4672 * Outer syntax: string tokens may contain arbitrary character codes
4673 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4679 * Context-dependent token translations. Default setup reverts locally
4680 fixed variables, and adds hilite markup for undeclared frees.
4682 * Unused theorems can be found using the new command 'unused_thms'.
4683 There are three ways of invoking it:
4686 Only finds unused theorems in the current theory.
4688 (2) unused_thms thy_1 ... thy_n -
4689 Finds unused theorems in the current theory and all of its ancestors,
4690 excluding the theories thy_1 ... thy_n and all of their ancestors.
4692 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4693 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4694 their ancestors, excluding the theories thy_1 ... thy_n and all of
4697 In order to increase the readability of the list produced by
4698 unused_thms, theorems that have been created by a particular instance
4699 of a theory command such as 'inductive' or 'function' are considered
4700 to belong to the same "group", meaning that if at least one theorem in
4701 this group is used, the other theorems in the same group are no longer
4702 reported as unused. Moreover, if all theorems in the group are
4703 unused, only one theorem in the group is displayed.
4705 Note that proof objects have to be switched on in order for
4706 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4707 usually the case when using Proof General with the default settings).
4709 * Authentic naming of facts disallows ad-hoc overwriting of previous
4710 theorems within the same name space. INCOMPATIBILITY, need to remove
4711 duplicate fact bindings, or even accidental fact duplications. Note
4712 that tools may maintain dynamically scoped facts systematically, using
4713 PureThy.add_thms_dynamic.
4715 * Command 'hide' now allows to hide from "fact" name space as well.
4717 * Eliminated destructive theorem database, simpset, claset, and
4718 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4719 update of theories within ML code.
4721 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4722 INCOMPATIBILITY, object-logics depending on former Pure require
4723 additional setup PureThy.old_appl_syntax_setup; object-logics
4724 depending on former CPure need to refer to Pure.
4726 * Commands 'use' and 'ML' are now purely functional, operating on
4727 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4728 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4731 * Command 'setup': discontinued implicit version with ML reference.
4733 * Instantiation target allows for simultaneous specification of class
4734 instance operations together with an instantiation proof.
4735 Type-checking phase allows to refer to class operations uniformly.
4736 See src/HOL/Complex/Complex.thy for an Isar example and
4737 src/HOL/Library/Eval.thy for an ML example.
4739 * Indexing of literal facts: be more serious about including only
4740 facts from the visible specification/proof context, but not the
4741 background context (locale etc.). Affects `prop` notation and method
4742 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4745 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4746 "(open)" option, which used to expose internal bound variables to the
4749 * Isar statements: removed obsolete case "rule_context".
4750 INCOMPATIBILITY, better use explicit fixes/assumes.
4752 * Locale proofs: default proof step now includes 'unfold_locales';
4753 hence 'proof' without argument may be used to unfold locale
4757 *** Document preparation ***
4759 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4760 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4761 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4762 spot); renamed link color from "darkblue" to "linkcolor" (default
4763 value unchanged, can be redefined via \definecolor); no longer sets
4764 "a4paper" option (unnecessary or even intrusive).
4766 * Antiquotation @{lemma A method} proves proposition A by the given
4767 method (either a method name or a method name plus (optional) method
4768 arguments in parentheses) and prints A just like @{prop A}.
4773 * New primrec package. Specification syntax conforms in style to
4774 definition/function/.... No separate induction rule is provided. The
4775 "primrec" command distinguishes old-style and new-style specifications
4776 by syntax. The former primrec package is now named OldPrimrecPackage.
4777 When adjusting theories, beware: constants stemming from new-style
4778 primrec specifications have authentic syntax.
4780 * Metis prover is now an order of magnitude faster, and also works
4781 with multithreading.
4783 * Metis: the maximum number of clauses that can be produced from a
4784 theorem is now given by the attribute max_clauses. Theorems that
4785 exceed this number are ignored, with a warning printed.
4787 * Sledgehammer no longer produces structured proofs by default. To
4788 enable, declare [[sledgehammer_full = true]]. Attributes
4789 reconstruction_modulus, reconstruction_sorts renamed
4790 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4792 * Method "induct_scheme" derives user-specified induction rules
4793 from well-founded induction and completeness of patterns. This factors
4794 out some operations that are done internally by the function package
4795 and makes them available separately. See
4796 src/HOL/ex/Induction_Scheme.thy for examples.
4798 * More flexible generation of measure functions for termination
4799 proofs: Measure functions can be declared by proving a rule of the
4800 form "is_measure f" and giving it the [measure_function] attribute.
4801 The "is_measure" predicate is logically meaningless (always true), and
4802 just guides the heuristic. To find suitable measure functions, the
4803 termination prover sets up the goal "is_measure ?f" of the appropriate
4804 type and generates all solutions by prolog-style backwards proof using
4807 This setup also deals with rules like
4809 "is_measure f ==> is_measure (list_size f)"
4811 which accommodates nested datatypes that recurse through lists.
4812 Similar rules are predeclared for products and option types.
4814 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4818 - Definitions of overloaded constants on sets have to be replaced by
4819 definitions on => and bool.
4821 - Some definitions of overloaded operators on sets can now be proved
4822 using the definitions of the operators on => and bool. Therefore,
4823 the following theorems have been renamed:
4825 subset_def -> subset_eq
4826 psubset_def -> psubset_eq
4827 set_diff_def -> set_diff_eq
4828 Compl_def -> Compl_eq
4829 Sup_set_def -> Sup_set_eq
4830 Inf_set_def -> Inf_set_eq
4831 sup_set_def -> sup_set_eq
4832 inf_set_def -> inf_set_eq
4834 - Due to the incompleteness of the HO unification algorithm, some
4835 rules such as subst may require manual instantiation, if some of
4836 the unknowns in the rule is a set.
4838 - Higher order unification and forward proofs:
4841 have "P (S::'a set)" <...>
4842 then have "EX S. P S" ..
4844 no longer works (due to the incompleteness of the HO unification
4845 algorithm) and must be replaced by the pattern
4852 - Calculational reasoning with subst (or similar rules):
4855 have "P (S::'a set)" <...>
4856 also have "S = T" <...>
4857 finally have "P T" .
4859 no longer works (for similar reasons as the previous example) and
4860 must be replaced by something like
4862 have "P (S::'a set)" <...>
4863 moreover have "S = T" <...>
4864 ultimately have "P T" by simp
4866 - Tactics or packages written in ML code:
4867 Code performing pattern matching on types via
4869 Type ("set", [T]) => ...
4871 must be rewritten. Moreover, functions like strip_type or
4872 binder_types no longer return the right value when applied to a
4875 T1 => ... => Tn => U => bool
4879 T1 => ... => Tn => U set
4881 * Merged theories Wellfounded_Recursion, Accessible_Part and
4882 Wellfounded_Relations to theory Wellfounded.
4884 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4886 * Class finite no longer treats UNIV as class parameter. Use class
4887 enum from theory Library/Enum instead to achieve a similar effect.
4890 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4891 and "Cons". INCOMPATIBILITY.
4893 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4894 Potential INCOMPATIBILITY.
4896 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4897 injective_fst_snd removed, use split_eta and prod_eqI instead.
4898 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4900 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4901 the same name in theory Orderings:
4911 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4912 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4913 and different variable names.
4915 * Library/Option_ord.thy: Canonical order on option type.
4917 * Library/RBT.thy: Red-black trees, an efficient implementation of
4920 * Library/Countable.thy: Type class for countable types.
4922 * Theory Int: The representation of numerals has changed. The infix
4923 operator BIT and the bit datatype with constructors B0 and B1 have
4924 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
4925 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
4926 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
4929 * Theory Nat: definition of <= and < on natural numbers no longer
4930 depend on well-founded relations. INCOMPATIBILITY. Definitions
4931 le_def and less_def have disappeared. Consider lemmas not_less
4932 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
4934 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
4935 (whose purpose mainly is for various fold_set functionals) have been
4936 abandoned in favor of the existing algebraic classes
4937 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
4938 lower_semilattice (resp. upper_semilattice) and linorder.
4941 * Theory Transitive_Closure: induct and cases rules now declare proper
4942 case_names ("base" and "step"). INCOMPATIBILITY.
4944 * Theorem Inductive.lfp_ordinal_induct generalized to complete
4945 lattices. The form set-specific version is available as
4946 Inductive.lfp_ordinal_induct_set.
4948 * Renamed theorems "power.simps" to "power_int.simps".
4951 * Class semiring_div provides basic abstract properties of semirings
4952 with division and modulo operations. Subsumes former class dvd_mod.
4954 * Merged theories IntDef, Numeral and IntArith into unified theory
4955 Int. INCOMPATIBILITY.
4957 * Theory Library/Code_Index: type "index" now represents natural
4958 numbers rather than integers. INCOMPATIBILITY.
4960 * New class "uminus" with operation "uminus" (split of from class
4961 "minus" which now only has operation "minus", binary).
4964 * Constants "card", "internal_split", "option_map" now with authentic
4965 syntax. INCOMPATIBILITY.
4967 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
4968 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
4969 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
4970 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
4971 Sup_set_def, le_def, less_def, option_map_def now with object
4972 equality. INCOMPATIBILITY.
4974 * Records. Removed K_record, and replaced it by pure lambda term
4975 %x. c. The simplifier setup is now more robust against eta expansion.
4976 INCOMPATIBILITY: in cases explicitly referring to K_record.
4978 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
4980 * Library/ListVector: new theory of arithmetic vector operations.
4982 * Library/Order_Relation: new theory of various orderings as sets of
4983 pairs. Defines preorders, partial orders, linear orders and
4984 well-orders on sets and on types.
4989 * Renamed some theories to allow to loading both ZF and HOL in the
4992 Datatype -> Datatype_ZF
4993 Inductive -> Inductive_ZF
5000 INCOMPATIBILITY: ZF theories that import individual theories below
5001 Main might need to be adapted. Regular theory Main is still
5002 available, as trivial extension of Main_ZF.
5007 * ML within Isar: antiquotation @{const name} or @{const
5008 name(typargs)} produces statically-checked Const term.
5010 * Functor NamedThmsFun: data is available to the user as dynamic fact
5011 (of the same name). Removed obsolete print command.
5013 * Removed obsolete "use_legacy_bindings" function.
5015 * The ``print mode'' is now a thread-local value derived from a global
5016 template (the former print_mode reference), thus access becomes
5017 non-critical. The global print_mode reference is for session
5018 management only; user-code should use print_mode_value,
5019 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5021 * Functions system/system_out provide a robust way to invoke external
5022 shell commands, with propagation of interrupts (requires Poly/ML
5023 5.2.1). Do not use OS.Process.system etc. from the basis library!
5028 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5029 in accordance with Proof General 3.7, which prefers GNU emacs.
5031 * isatool tty runs Isabelle process with plain tty interaction;
5032 optional line editor may be specified via ISABELLE_LINE_EDITOR
5033 setting, the default settings attempt to locate "ledit" and "rlwrap".
5035 * isatool browser now works with Cygwin as well, using general
5036 "javapath" function defined in Isabelle process environment.
5038 * YXML notation provides a simple and efficient alternative to
5039 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5040 isatool yxml as described in the Isabelle system manual.
5042 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5043 provides general wrapper for managing an Isabelle process in a robust
5044 fashion, with ``cooked'' output from stdin/stderr.
5046 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5047 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5049 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5050 way of changing the user's settings is via
5051 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5054 * Multithreading.max_threads := 0 refers to the number of actual CPU
5055 cores of the underlying machine, which is a good starting point for
5056 optimal performance tuning. The corresponding usedir option -M allows
5057 "max" as an alias for "0". WARNING: does not work on certain versions
5058 of Mac OS (with Poly/ML 5.1).
5060 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5061 adverse effect of Isabelle flooding interactive front-ends (notably
5062 ProofGeneral / XEmacs).
5066 New in Isabelle2007 (November 2007)
5067 -----------------------------------
5071 * More uniform information about legacy features, notably a
5072 warning/error of "Legacy feature: ...", depending on the state of the
5073 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5074 legacy features will disappear eventually.
5076 * Theory syntax: the header format ``theory A = B + C:'' has been
5077 discontinued in favour of ``theory A imports B C begin''. Use isatool
5078 fixheaders to convert existing theory files. INCOMPATIBILITY.
5080 * Theory syntax: the old non-Isar theory file format has been
5081 discontinued altogether. Note that ML proof scripts may still be used
5082 with Isar theories; migration is usually quite simple with the ML
5083 function use_legacy_bindings. INCOMPATIBILITY.
5085 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5086 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5089 * Theory loader: be more serious about observing the static theory
5090 header specifications (including optional directories), but not the
5091 accidental file locations of previously successful loads. The strict
5092 update policy of former update_thy is now already performed by
5093 use_thy, so the former has been removed; use_thys updates several
5094 theories simultaneously, just as 'imports' within a theory header
5095 specification, but without merging the results. Potential
5096 INCOMPATIBILITY: may need to refine theory headers and commands
5097 ROOT.ML which depend on load order.
5099 * Theory loader: optional support for content-based file
5100 identification, instead of the traditional scheme of full physical
5101 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5102 (cf. the system manual). The new scheme allows to work with
5103 non-finished theories in persistent session images, such that source
5104 files may be moved later on without requiring reloads.
5106 * Theory loader: old-style ML proof scripts being *attached* to a thy
5107 file (with the same base name as the theory) are considered a legacy
5108 feature, which will disappear eventually. Even now, the theory loader
5109 no longer maintains dependencies on such files.
5111 * Syntax: the scope for resolving ambiguities via type-inference is
5112 now limited to individual terms, instead of whole simultaneous
5113 specifications as before. This greatly reduces the complexity of the
5114 syntax module and improves flexibility by separating parsing and
5115 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5116 'fixes' etc.) are required in rare situations.
5118 * Syntax: constants introduced by new-style packages ('definition',
5119 'abbreviation' etc.) are passed through the syntax module in
5120 ``authentic mode''. This means that associated mixfix annotations
5121 really stick to such constants, independently of potential name space
5122 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5123 trees are represented slightly differently, may need to adapt syntax
5124 translations accordingly. Use CONST marker in 'translations' and
5125 @{const_syntax} antiquotation in 'parse_translation' etc.
5127 * Legacy goal package: reduced interface to the bare minimum required
5128 to keep existing proof scripts running. Most other user-level
5129 functions are now part of the OldGoals structure, which is *not* open
5130 by default (consider isatool expandshort before open OldGoals).
5131 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5132 these tend to cause confusion about the actual goal (!) context being
5133 used here, which is not necessarily the same as the_context().
5135 * Command 'find_theorems': supports "*" wild-card in "name:"
5136 criterion; "with_dups" option. Certain ProofGeneral versions might
5137 support a specific search form (see ProofGeneral/CHANGES).
5139 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5140 by default, which means that "prems" (and also "fixed variables") are
5141 suppressed from proof state output. Note that the ProofGeneral
5142 settings mechanism allows to change and save options persistently, but
5143 older versions of Isabelle will fail to start up if a negative prems
5146 * Local theory targets may be specified by non-nested blocks of
5147 ``context/locale/class ... begin'' followed by ``end''. The body may
5148 contain definitions, theorems etc., including any derived mechanism
5149 that has been implemented on top of these primitives. This concept
5150 generalizes the existing ``theorem (in ...)'' towards more versatility
5153 * Proof General interface: proper undo of final 'end' command;
5154 discontinued Isabelle/classic mode (ML proof scripts).
5157 *** Document preparation ***
5159 * Added antiquotation @{theory name} which prints the given name,
5160 after checking that it refers to a valid ancestor theory in the
5163 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5164 check the given source text as ML type/structure, printing verbatim.
5166 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5167 "c args == rhs" given in the current context. (Any number of
5168 arguments may be given on the LHS.)
5173 * The 'class' package offers a combination of axclass and locale to
5174 achieve Haskell-like type classes in Isabelle. Definitions and
5175 theorems within a class context produce both relative results (with
5176 implicit parameters according to the locale context), and polymorphic
5177 constants with qualified polymorphism (according to the class
5178 context). Within the body context of a 'class' target, a separate
5179 syntax layer ("user space type system") takes care of converting
5180 between global polymorphic consts and internal locale representation.
5181 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5182 "isatool doc classes" provides a tutorial.
5184 * Generic code generator framework allows to generate executable
5185 code for ML and Haskell (including Isabelle classes). A short usage
5188 internal compilation:
5189 export_code <list of constants (term syntax)> in SML
5190 writing SML code to a file:
5191 export_code <list of constants (term syntax)> in SML <filename>
5192 writing OCaml code to a file:
5193 export_code <list of constants (term syntax)> in OCaml <filename>
5194 writing Haskell code to a bunch of files:
5195 export_code <list of constants (term syntax)> in Haskell <filename>
5197 evaluating closed propositions to True/False using code generation:
5200 Reasonable default setup of framework in HOL.
5202 Theorem attributs for selecting and transforming function equations theorems:
5204 [code fun]: select a theorem as function equation for a specific constant
5205 [code fun del]: deselect a theorem as function equation for a specific constant
5206 [code inline]: select an equation theorem for unfolding (inlining) in place
5207 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5209 User-defined serializations (target in {SML, OCaml, Haskell}):
5211 code_const <and-list of constants (term syntax)>
5212 {(target) <and-list of const target syntax>}+
5214 code_type <and-list of type constructors>
5215 {(target) <and-list of type target syntax>}+
5217 code_instance <and-list of instances>
5219 where instance ::= <type constructor> :: <class>
5221 code_class <and_list of classes>
5222 {(target) <and-list of class target syntax>}+
5223 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5225 code_instance and code_class only are effective to target Haskell.
5227 For example usage see src/HOL/ex/Codegenerator.thy and
5228 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5229 generation from Isabelle/HOL theories is available via "isatool doc
5232 * Code generator: consts in 'consts_code' Isar commands are now
5233 referred to by usual term syntax (including optional type
5236 * Command 'no_translations' removes translation rules from theory
5239 * Overloaded definitions are now actually checked for acyclic
5240 dependencies. The overloading scheme is slightly more general than
5241 that of Haskell98, although Isabelle does not demand an exact
5242 correspondence to type class and instance declarations.
5243 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5244 exotic versions of overloading -- at the discretion of the user!
5246 Polymorphic constants are represented via type arguments, i.e. the
5247 instantiation that matches an instance against the most general
5248 declaration given in the signature. For example, with the declaration
5249 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5250 as c(nat). Overloading is essentially simultaneous structural
5251 recursion over such type arguments. Incomplete specification patterns
5252 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5253 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5254 Command 'print_theory' outputs the normalized system of recursive
5255 equations, see section "definitions".
5257 * Configuration options are maintained within the theory or proof
5258 context (with name and type bool/int/string), providing a very simple
5259 interface to a poor-man's version of general context data. Tools may
5260 declare options in ML (e.g. using Attrib.config_int) and then refer to
5261 these values using Config.get etc. Users may change options via an
5262 associated attribute of the same name. This form of context
5263 declaration works particularly well with commands 'declare' or
5264 'using', for example ``declare [[foo = 42]]''. Thus it has become
5265 very easy to avoid global references, which would not observe Isar
5266 toplevel undo/redo and fail to work with multithreading.
5268 Various global ML references of Pure and HOL have been turned into
5269 configuration options:
5271 Unify.search_bound unify_search_bound
5272 Unify.trace_bound unify_trace_bound
5273 Unify.trace_simp unify_trace_simp
5274 Unify.trace_types unify_trace_types
5275 Simplifier.simp_depth_limit simp_depth_limit
5276 Blast.depth_limit blast_depth_limit
5277 DatatypeProp.dtK datatype_distinctness_limit
5278 fast_arith_neq_limit fast_arith_neq_limit
5279 fast_arith_split_limit fast_arith_split_limit
5281 * Named collections of theorems may be easily installed as context
5282 data using the functor NamedThmsFun (see also
5283 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5284 attributes; there is also a toplevel print command. This facility is
5285 just a common case of general context data, which is the preferred way
5286 for anything more complex than just a list of facts in canonical
5289 * Isar: command 'declaration' augments a local theory by generic
5290 declaration functions written in ML. This enables arbitrary content
5291 being added to the context, depending on a morphism that tells the
5292 difference of the original declaration context wrt. the application
5293 context encountered later on.
5295 * Isar: proper interfaces for simplification procedures. Command
5296 'simproc_setup' declares named simprocs (with match patterns, and body
5297 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5298 context. ML antiquotation @{simproc name} retrieves named simprocs.
5300 * Isar: an extra pair of brackets around attribute declarations
5301 abbreviates a theorem reference involving an internal dummy fact,
5302 which will be ignored later --- only the effect of the attribute on
5303 the background context will persist. This form of in-place
5304 declarations is particularly useful with commands like 'declare' and
5305 'using', for example ``have A using [[simproc a]] by simp''.
5307 * Isar: method "assumption" (and implicit closing of subproofs) now
5308 takes simple non-atomic goal assumptions into account: after applying
5309 an assumption as a rule the resulting subgoals are solved by atomic
5310 assumption steps. This is particularly useful to finish 'obtain'
5311 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5312 without referring to the original premise "!!x. P x ==> thesis" in the
5313 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5316 * Isar: implicit use of prems from the Isar proof context is
5317 considered a legacy feature. Common applications like ``have A .''
5318 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5319 referencing facts explicitly here improves readability and
5320 maintainability of proof texts.
5322 * Isar: improper proof element 'guess' is like 'obtain', but derives
5323 the obtained context from the course of reasoning! For example:
5325 assume "EX x y. A x & B y" -- "any previous fact"
5326 then guess x and y by clarify
5328 This technique is potentially adventurous, depending on the facts and
5329 proof tools being involved here.
5331 * Isar: known facts from the proof context may be specified as literal
5332 propositions, using ASCII back-quote syntax. This works wherever
5333 named facts used to be allowed so far, in proof commands, proof
5334 methods, attributes etc. Literal facts are retrieved from the context
5335 according to unification of type and term parameters. For example,
5336 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5337 theorems in the current context, then these are valid literal facts:
5338 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5340 There is also a proof method "fact" which does the same composition
5341 for explicit goal states, e.g. the following proof texts coincide with
5342 certain special cases of literal facts:
5344 have "A" by fact == note `A`
5345 have "A ==> B" by fact == note `A ==> B`
5346 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5347 have "P a ==> Q a" by fact == note `P a ==> Q a`
5349 * Isar: ":" (colon) is no longer a symbolic identifier character in
5350 outer syntax. Thus symbolic identifiers may be used without
5351 additional white space in declarations like this: ``assume *: A''.
5353 * Isar: 'print_facts' prints all local facts of the current context,
5354 both named and unnamed ones.
5356 * Isar: 'def' now admits simultaneous definitions, e.g.:
5358 def x == "t" and y == "u"
5360 * Isar: added command 'unfolding', which is structurally similar to
5361 'using', but affects both the goal state and facts by unfolding given
5362 rewrite rules. Thus many occurrences of the 'unfold' method or
5363 'unfolded' attribute may be replaced by first-class proof text.
5365 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5366 and command 'unfolding' now all support object-level equalities
5367 (potentially conditional). The underlying notion of rewrite rule is
5368 analogous to the 'rule_format' attribute, but *not* that of the
5369 Simplifier (which is usually more generous).
5371 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5372 premises of a theorem by n. Useful in conjunction with drule.
5374 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5375 method expression within a sandbox consisting of the first N
5376 sub-goals, which need to exist. For example, ``simp_all [3]''
5377 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5378 simplifies all new goals that emerge from applying rule foo to the
5379 originally first one.
5381 * Isar: schematic goals are no longer restricted to higher-order
5382 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5385 * Isar: the conclusion of a long theorem statement is now either
5386 'shows' (a simultaneous conjunction, as before), or 'obtains'
5387 (essentially a disjunction of cases with local parameters and
5388 assumptions). The latter allows to express general elimination rules
5389 adequately; in this notation common elimination rules look like this:
5391 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5393 obtains x where "P x"
5395 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5399 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5405 The subsequent classical rules even refer to the formal "thesis"
5408 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5411 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5412 obtains "thesis ==> something"
5414 The actual proof of an 'obtains' statement is analogous to that of the
5415 Isar proof element 'obtain', only that there may be several cases.
5416 Optional case names may be specified in parentheses; these will be
5417 available both in the present proof and as annotations in the
5418 resulting rule, for later use with the 'cases' method (cf. attribute
5421 * Isar: the assumptions of a long theorem statement are available as
5422 "assms" fact in the proof context. This is more appropriate than the
5423 (historical) "prems", which refers to all assumptions of the current
5424 context, including those from the target locale, proof body etc.
5426 * Isar: 'print_statement' prints theorems from the current theory or
5427 proof context in long statement form, according to the syntax of a
5430 * Isar: 'obtain' takes an optional case name for the local context
5431 introduction rule (default "that").
5433 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5434 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5437 * Pure: syntax "CONST name" produces a fully internalized constant
5438 according to the current context. This is particularly useful for
5439 syntax translations that should refer to internal constant
5440 representations independently of name spaces.
5442 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5443 instead of "FOO ". This allows multiple binder declarations to coexist
5444 in the same context. INCOMPATIBILITY.
5446 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5447 primitive that also works in a locale context (both for constants and
5448 fixed variables). Type declaration and internal syntactic representation
5449 of given constants retrieved from the context. Likewise, the
5450 'no_notation' command allows to remove given syntax annotations from the
5453 * Isar/locales: new derived specification elements 'axiomatization',
5454 'definition', 'abbreviation', which support type-inference, admit
5455 object-level specifications (equality, equivalence). See also the
5456 isar-ref manual. Examples:
5459 eq (infix "===" 50) where
5460 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5462 definition "f x y = x + y + 1"
5463 definition g where "g x = f x x"
5466 neq (infix "=!=" 50) where
5467 "x =!= y == ~ (x === y)"
5469 These specifications may be also used in a locale context. Then the
5470 constants being introduced depend on certain fixed parameters, and the
5471 constant name is qualified by the locale base name. An internal
5472 abbreviation takes care for convenient input and output, making the
5473 parameters implicit and using the original short name. See also
5474 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5475 entities from a monomorphic theory.
5477 Presently, abbreviations are only available 'in' a target locale, but
5478 not inherited by general import expressions. Also note that
5479 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5480 'translations' in common applications. The "no_abbrevs" print mode
5481 prevents folding of abbreviations in term output.
5483 Concrete syntax is attached to specified constants in internal form,
5484 independently of name spaces. The parse tree representation is
5485 slightly different -- use 'notation' instead of raw 'syntax', and
5486 'translations' with explicit "CONST" markup to accommodate this.
5488 * Pure/Isar: unified syntax for new-style specification mechanisms
5489 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5490 full type inference and dummy patterns ("_"). For example:
5492 definition "K x _ = x"
5494 inductive conj for A B
5495 where "A ==> B ==> conj A B"
5497 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5498 the current context. Print mode "no_abbrevs" prevents inversion of
5499 abbreviations on output.
5501 * Isar/locales: improved parameter handling: use of locales "var" and
5502 "struct" no longer necessary; - parameter renamings are no longer
5503 required to be injective. For example, this allows to define
5504 endomorphisms as locale endom = homom mult mult h.
5506 * Isar/locales: changed the way locales with predicates are defined.
5507 Instead of accumulating the specification, the imported expression is
5508 now an interpretation. INCOMPATIBILITY: different normal form of
5509 locale expressions. In particular, in interpretations of locales with
5510 predicates, goals repesenting already interpreted fragments are not
5511 removed automatically. Use methods `intro_locales' and
5512 `unfold_locales'; see below.
5514 * Isar/locales: new methods `intro_locales' and `unfold_locales'
5515 provide backward reasoning on locales predicates. The methods are
5516 aware of interpretations and discharge corresponding goals.
5517 `intro_locales' is less aggressive then `unfold_locales' and does not
5518 unfold predicates to assumptions.
5520 * Isar/locales: the order in which locale fragments are accumulated
5521 has changed. This enables to override declarations from fragments due
5522 to interpretations -- for example, unwanted simp rules.
5524 * Isar/locales: interpretation in theories and proof contexts has been
5525 extended. One may now specify (and prove) equations, which are
5526 unfolded in interpreted theorems. This is useful for replacing
5527 defined concepts (constants depending on locale parameters) by
5528 concepts already existing in the target context. Example:
5530 interpretation partial_order ["op <= :: [int, int] => bool"]
5531 where "partial_order.less (op <=) (x::int) y = (x < y)"
5533 Typically, the constant `partial_order.less' is created by a
5534 definition specification element in the context of locale
5537 * Method "induct": improved internal context management to support
5538 local fixes and defines on-the-fly. Thus explicit meta-level
5539 connectives !! and ==> are rarely required anymore in inductive goals
5540 (using object-logic connectives for this purpose has been long
5541 obsolete anyway). Common proof patterns are explained in
5542 src/HOL/Induct/Common_Patterns.thy, see also
5543 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
5546 * Method "induct": improved handling of simultaneous goals. Instead of
5547 introducing object-level conjunction, the statement is now split into
5548 several conclusions, while the corresponding symbolic cases are nested
5549 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
5550 see src/HOL/Induct/Common_Patterns.thy, for example.
5552 * Method "induct": mutual induction rules are now specified as a list
5553 of rule sharing the same induction cases. HOL packages usually provide
5554 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
5555 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
5556 mutual induction rules differently, i.e. like this:
5558 (induct rule: foo_bar.inducts)
5559 (induct set: foo bar)
5560 (induct pred: foo bar)
5561 (induct type: foo bar)
5563 The ML function ProjectRule.projections turns old-style rules into the
5566 * Method "coinduct": dual of induction, see
5567 src/HOL/Library/Coinductive_List.thy for various examples.
5569 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5570 considered a legacy feature.
5572 * Attribute "symmetric" produces result with standardized schematic
5573 variables (index 0). Potential INCOMPATIBILITY.
5575 * Simplifier: by default the simplifier trace only shows top level
5576 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5577 default. Thus there is less danger of being flooded by the trace. The
5578 trace indicates where parts have been suppressed.
5580 * Provers/classical: removed obsolete classical version of elim_format
5581 attribute; classical elim/dest rules are now treated uniformly when
5582 manipulating the claset.
5584 * Provers/classical: stricter checks to ensure that supplied intro,
5585 dest and elim rules are well-formed; dest and elim rules must have at
5588 * Provers/classical: attributes dest/elim/intro take an optional
5589 weight argument for the rule (just as the Pure versions). Weights are
5590 ignored by automated tools, but determine the search order of single
5593 * Syntax: input syntax now supports dummy variable binding "%_. b",
5594 where the body does not mention the bound variable. Note that dummy
5595 patterns implicitly depend on their context of bounds, which makes
5596 "{_. _}" match any set comprehension as expected. Potential
5597 INCOMPATIBILITY -- parse translations need to cope with syntactic
5598 constant "_idtdummy" in the binding position.
5600 * Syntax: removed obsolete syntactic constant "_K" and its associated
5601 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5602 for example "A -> B" => "Pi A (%_. B)".
5604 * Pure: 'class_deps' command visualizes the subclass relation, using
5605 the graph browser tool.
5607 * Pure: 'print_theory' now suppresses certain internal declarations by
5608 default; use '!' option for full details.
5613 * Method "metis" proves goals by applying the Metis general-purpose
5614 resolution prover (see also http://gilith.com/software/metis/).
5615 Examples are in the directory MetisExamples. WARNING: the
5616 Isabelle/HOL-Metis integration does not yet work properly with
5619 * Command 'sledgehammer' invokes external automatic theorem provers as
5620 background processes. It generates calls to the "metis" method if
5621 successful. These can be pasted into the proof. Users do not have to
5622 wait for the automatic provers to return. WARNING: does not really
5623 work with multi-threading.
5625 * New "auto_quickcheck" feature tests outermost goal statements for
5626 potential counter-examples. Controlled by ML references
5627 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5628 5000 milliseconds). Fails silently if statements is outside of
5629 executable fragment, or any other codgenerator problem occurs.
5631 * New constant "undefined" with axiom "undefined x = undefined".
5633 * Added class "HOL.eq", allowing for code generation with polymorphic
5636 * Some renaming of class constants due to canonical name prefixing in
5637 the new 'class' package:
5639 HOL.abs ~> HOL.abs_class.abs
5640 HOL.divide ~> HOL.divide_class.divide
5641 0 ~> HOL.zero_class.zero
5642 1 ~> HOL.one_class.one
5643 op + ~> HOL.plus_class.plus
5644 op - ~> HOL.minus_class.minus
5645 uminus ~> HOL.minus_class.uminus
5646 op * ~> HOL.times_class.times
5647 op < ~> HOL.ord_class.less
5648 op <= > HOL.ord_class.less_eq
5649 Nat.power ~> Power.power_class.power
5650 Nat.size ~> Nat.size_class.size
5651 Numeral.number_of ~> Numeral.number_class.number_of
5652 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5653 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5654 Orderings.min ~> Orderings.ord_class.min
5655 Orderings.max ~> Orderings.ord_class.max
5656 Divides.op div ~> Divides.div_class.div
5657 Divides.op mod ~> Divides.div_class.mod
5658 Divides.op dvd ~> Divides.div_class.dvd
5660 INCOMPATIBILITY. Adaptions may be required in the following cases:
5662 a) User-defined constants using any of the names "plus", "minus",
5663 "times", "less" or "less_eq". The standard syntax translations for
5664 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5667 b) Variables named "plus", "minus", "times", "less", "less_eq"
5668 INCOMPATIBILITY: use more specific names.
5670 c) Permutative equations (e.g. "a + b = b + a")
5671 Since the change of names also changes the order of terms, permutative
5672 rewrite rules may get applied in a different order. Experience shows
5673 that this is rarely the case (only two adaptions in the whole Isabelle
5674 distribution). INCOMPATIBILITY: rewrite proofs
5676 d) ML code directly refering to constant names
5677 This in general only affects hand-written proof tactics, simprocs and
5678 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5679 Consider using @{const_name} antiquotation.
5681 * New class "default" with associated constant "default".
5683 * Function "sgn" is now overloaded and available on int, real, complex
5684 (and other numeric types), using class "sgn". Two possible defs of
5685 sgn are given as equational assumptions in the classes sgn_if and
5686 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5689 * Locale "partial_order" now unified with class "order" (cf. theory
5690 Orderings), added parameter "less". INCOMPATIBILITY.
5692 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5693 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5694 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5696 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5697 changed order of proof goals in instance proofs.
5699 * The transitivity reasoner for partial and linear orders is set up
5700 for classes "order" and "linorder". Instances of the reasoner are available
5701 in all contexts importing or interpreting the corresponding locales.
5702 Method "order" invokes the reasoner separately; the reasoner
5703 is also integrated with the Simplifier as a solver. Diagnostic
5704 command 'print_orders' shows the available instances of the reasoner
5705 in the current context.
5707 * Localized monotonicity predicate in theory "Orderings"; integrated
5708 lemmas max_of_mono and min_of_mono with this predicate.
5711 * Formulation of theorem "dense" changed slightly due to integration
5712 with new class dense_linear_order.
5714 * Uniform lattice theory development in HOL.
5716 constants "meet" and "join" now named "inf" and "sup"
5717 constant "Meet" now named "Inf"
5719 classes "meet_semilorder" and "join_semilorder" now named
5720 "lower_semilattice" and "upper_semilattice"
5721 class "lorder" now named "lattice"
5722 class "comp_lat" now named "complete_lattice"
5724 Instantiation of lattice classes allows explicit definitions
5725 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5727 INCOMPATIBILITY. Theorem renames:
5729 meet_left_le ~> inf_le1
5730 meet_right_le ~> inf_le2
5731 join_left_le ~> sup_ge1
5732 join_right_le ~> sup_ge2
5733 meet_join_le ~> inf_sup_ord
5736 le_meet ~> le_inf_iff
5737 le_join ~> ge_sup_conv
5738 meet_idempotent ~> inf_idem
5739 join_idempotent ~> sup_idem
5740 meet_comm ~> inf_commute
5741 join_comm ~> sup_commute
5742 meet_leI1 ~> le_infI1
5743 meet_leI2 ~> le_infI2
5744 le_joinI1 ~> le_supI1
5745 le_joinI2 ~> le_supI2
5746 meet_assoc ~> inf_assoc
5747 join_assoc ~> sup_assoc
5748 meet_left_comm ~> inf_left_commute
5749 meet_left_idempotent ~> inf_left_idem
5750 join_left_comm ~> sup_left_commute
5751 join_left_idempotent ~> sup_left_idem
5754 le_def_meet ~> le_iff_inf
5755 le_def_join ~> le_iff_sup
5756 join_absorp2 ~> sup_absorb2
5757 join_absorp1 ~> sup_absorb1
5758 meet_absorp1 ~> inf_absorb1
5759 meet_absorp2 ~> inf_absorb2
5760 meet_join_absorp ~> inf_sup_absorb
5761 join_meet_absorp ~> sup_inf_absorb
5762 distrib_join_le ~> distrib_sup_le
5763 distrib_meet_le ~> distrib_inf_le
5765 add_meet_distrib_left ~> add_inf_distrib_left
5766 add_join_distrib_left ~> add_sup_distrib_left
5767 is_join_neg_meet ~> is_join_neg_inf
5768 is_meet_neg_join ~> is_meet_neg_sup
5769 add_meet_distrib_right ~> add_inf_distrib_right
5770 add_join_distrib_right ~> add_sup_distrib_right
5771 add_meet_join_distribs ~> add_sup_inf_distribs
5772 join_eq_neg_meet ~> sup_eq_neg_inf
5773 meet_eq_neg_join ~> inf_eq_neg_sup
5774 add_eq_meet_join ~> add_eq_inf_sup
5775 meet_0_imp_0 ~> inf_0_imp_0
5776 join_0_imp_0 ~> sup_0_imp_0
5777 meet_0_eq_0 ~> inf_0_eq_0
5778 join_0_eq_0 ~> sup_0_eq_0
5779 neg_meet_eq_join ~> neg_inf_eq_sup
5780 neg_join_eq_meet ~> neg_sup_eq_inf
5781 join_eq_if ~> sup_eq_if
5783 mono_meet ~> mono_inf
5784 mono_join ~> mono_sup
5785 meet_bool_eq ~> inf_bool_eq
5786 join_bool_eq ~> sup_bool_eq
5787 meet_fun_eq ~> inf_fun_eq
5788 join_fun_eq ~> sup_fun_eq
5789 meet_set_eq ~> inf_set_eq
5790 join_set_eq ~> sup_set_eq
5791 meet1_iff ~> inf1_iff
5792 meet2_iff ~> inf2_iff
5801 join1_iff ~> sup1_iff
5802 join2_iff ~> sup2_iff
5812 is_meet_Meet ~> is_meet_Inf
5813 Meet_bool_def ~> Inf_bool_def
5814 Meet_fun_def ~> Inf_fun_def
5815 Meet_greatest ~> Inf_greatest
5816 Meet_lower ~> Inf_lower
5817 Meet_set_def ~> Inf_set_def
5820 Sup_bool_eq ~> Sup_bool_def
5821 Sup_fun_eq ~> Sup_fun_def
5822 Sup_set_eq ~> Sup_set_def
5824 listsp_meetI ~> listsp_infI
5825 listsp_meet_eq ~> listsp_inf_eq
5830 * Added syntactic class "size"; overloaded constant "size" now has
5831 type "'a::size ==> bool"
5833 * Internal reorganisation of `size' of datatypes: size theorems
5834 "foo.size" are no longer subsumed by "foo.simps" (but are still
5835 simplification rules by default!); theorems "prod.size" now named
5838 * Class "div" now inherits from class "times" rather than "type".
5841 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5842 Linorder etc. have disappeared; operations defined in terms of
5843 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5845 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5847 * HOL-Word: New extensive library and type for generic, fixed size
5848 machine words, with arithmetic, bit-wise, shifting and rotating
5849 operations, reflection into int, nat, and bool lists, automation for
5850 linear arithmetic (by automatic reflection into nat or int), including
5851 lemmas on overflow and monotonicity. Instantiated to all appropriate
5852 arithmetic type classes, supporting automatic simplification of
5853 numerals on all operations.
5855 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5857 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5859 * Code generator library theories:
5860 - Code_Integer represents HOL integers by big integer literals in target
5862 - Code_Char represents HOL characters by character literals in target
5864 - Code_Char_chr like Code_Char, but also offers treatment of character
5865 codes; includes Code_Integer.
5866 - Executable_Set allows to generate code for finite sets using lists.
5867 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5869 - Executable_Real implements a subset of real numbers, namly those
5870 representable by rational numbers.
5871 - Efficient_Nat implements natural numbers by integers, which in general will
5872 result in higher efficency; pattern matching with 0/Suc is eliminated;
5873 includes Code_Integer.
5874 - Code_Index provides an additional datatype index which is mapped to
5875 target-language built-in integers.
5876 - Code_Message provides an additional datatype message_string which is isomorphic to
5877 strings; messages are mapped to target-language strings.
5879 * New package for inductive predicates
5881 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5884 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5885 for z_1 :: U_1 and ... and z_n :: U_m
5887 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5890 with full support for type-inference, rather than
5892 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5894 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5895 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5897 inductive "s z_1 ... z_m"
5899 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5902 For backward compatibility, there is a wrapper allowing inductive
5903 sets to be defined with the new package via
5906 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5907 for z_1 :: U_1 and ... and z_n :: U_m
5909 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5915 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5916 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5917 for z_1 :: U_1 and ... and z_n :: U_m
5919 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5920 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5923 if the additional syntax "p ..." is required.
5925 Numerous examples can be found in the subdirectories src/HOL/Auth,
5926 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
5930 - Since declaration and definition of inductive sets or predicates
5931 is no longer separated, abbreviations involving the newly
5932 introduced sets or predicates must be specified together with the
5933 introduction rules after the 'where' keyword (see above), rather
5934 than before the actual inductive definition.
5936 - The variables in induction and elimination rules are now
5937 quantified in the order of their occurrence in the introduction
5938 rules, rather than in alphabetical order. Since this may break
5939 some proofs, these proofs either have to be repaired, e.g. by
5940 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
5941 statements of the form
5943 case (rule_i a_i_1 ... a_i_{k_i})
5945 or the old order of quantification has to be restored by explicitly adding
5946 meta-level quantifiers in the introduction rules, i.e.
5948 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
5950 - The format of the elimination rules is now
5952 p z_1 ... z_m x_1 ... x_n ==>
5953 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5958 (x_1, ..., x_n) : s z_1 ... z_m ==>
5959 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5962 for sets rather than
5964 x : s z_1 ... z_m ==>
5965 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
5968 This may require terms in goals to be expanded to n-tuples
5969 (e.g. using case_tac or simplification with the split_paired_all
5970 rule) before the above elimination rule is applicable.
5972 - The elimination or case analysis rules for (mutually) inductive
5973 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
5974 list of rules "p_1_..._p_k.elims" is no longer available.
5976 * New package "function"/"fun" for general recursive functions,
5977 supporting mutual and nested recursion, definitions in local contexts,
5978 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
5979 for small examples, and the separate tutorial on the function
5980 package. The old recdef "package" is still available as before, but
5981 users are encouraged to use the new package.
5983 * Method "lexicographic_order" automatically synthesizes termination
5984 relations as lexicographic combinations of size measures.
5986 * Case-expressions allow arbitrary constructor-patterns (including
5987 "_") and take their order into account, like in functional
5988 programming. Internally, this is translated into nested
5989 case-expressions; missing cases are added and mapped to the predefined
5990 constant "undefined". In complicated cases printing may no longer show
5991 the original input but the internal form. Lambda-abstractions allow
5992 the same form of pattern matching: "% pat1 => e1 | ..." is an
5993 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
5996 * IntDef: The constant "int :: nat => int" has been removed; now "int"
5997 is an abbreviation for "of_nat :: nat => int". The simplification
5998 rules for "of_nat" have been changed to work like "int" did
5999 previously. Potential INCOMPATIBILITY:
6000 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6001 - of_nat_diff and of_nat_mult are no longer default simp rules
6003 * Method "algebra" solves polynomial equations over (semi)rings using
6004 Groebner bases. The (semi)ring structure is defined by locales and the
6005 tool setup depends on that generic context. Installing the method for
6006 a specific type involves instantiating the locale and possibly adding
6007 declarations for computation on the coefficients. The method is
6008 already instantiated for natural numbers and for the axiomatic class
6009 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6010 CALCULEMUS 2007 for the general principles underlying this
6011 architecture of context-aware proof-tools.
6013 * Method "ferrack" implements quantifier elimination over
6014 special-purpose dense linear orders using locales (analogous to
6015 "algebra"). The method is already installed for class
6016 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6019 * Former constant "List.op @" now named "List.append". Use ML
6020 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6021 circumvent possible incompatibilities when working on ML level.
6023 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6025 * New function listsum :: 'a list => 'a for arbitrary monoids.
6026 Special syntax: "SUM x <- xs. f x" (and latex variants)
6028 * New syntax for Haskell-like list comprehension (input only), eg.
6029 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6031 * The special syntax for function "filter" has changed from [x :
6032 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6033 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6035 * [a..b] is now defined for arbitrary linear orders. It used to be
6036 defined on nat only, as an abbreviation for [a..<Suc b]
6039 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6041 * New functions "sorted" and "sort" in src/HOL/List.thy.
6043 * New lemma collection field_simps (an extension of ring_simps) for
6044 manipulating (in)equations involving division. Multiplies with all
6045 denominators that can be proved to be non-zero (in equations) or
6046 positive/negative (in inequations).
6048 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6049 have been improved and renamed to ring_simps, group_simps and
6050 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6051 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6053 * Theory Library/Commutative_Ring: switched from recdef to function
6054 package; constants add, mul, pow now curried. Infix syntax for
6055 algebraic operations.
6057 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6060 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6063 * HOL/records: generalised field-update to take a function on the
6064 field rather than the new value: r(|A := x|) is translated to A_update
6065 (K x) r The K-combinator that is internally used is called K_record.
6066 INCOMPATIBILITY: Usage of the plain update functions has to be
6069 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6070 * x = 0, which are required for a semiring. Richer structures do not
6071 inherit from semiring_0 anymore, because this property is a theorem
6072 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6073 there is more to prove, but this is mostly trivial.
6075 * Class "recpower" is generalized to arbitrary monoids, not just
6076 commutative semirings. INCOMPATIBILITY: may need to incorporate
6077 commutativity or semiring properties additionally.
6079 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6080 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6081 better use 'abbreviation'.
6083 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6085 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6086 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6087 significant changes for setting up numeral syntax for types:
6088 - New constants Numeral.pred and Numeral.succ instead
6089 of former Numeral.bin_pred and Numeral.bin_succ.
6090 - Use integer operations instead of bin_add, bin_mult and so on.
6091 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6092 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6094 See src/HOL/Integ/IntArith.thy for an example setup.
6096 * Command 'normal_form' computes the normal form of a term that may
6097 contain free variables. For example ``normal_form "rev [a, b, c]"''
6098 produces ``[b, c, a]'' (without proof). This command is suitable for
6099 heavy-duty computations because the functions are compiled to ML
6100 first. Correspondingly, a method "normalization" is provided. See
6101 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6103 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6104 25 like -->); output depends on the "iff" print_mode, the default is
6105 "A = B" (with priority 50).
6107 * Relations less (<) and less_eq (<=) are also available on type bool.
6108 Modified syntax to disallow nesting without explicit parentheses,
6109 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6112 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6114 * Relation composition operator "op O" now has precedence 75 and binds
6115 stronger than union and intersection. INCOMPATIBILITY.
6117 * The old set interval syntax "{m..n(}" (and relatives) has been
6118 removed. Use "{m..<n}" (and relatives) instead.
6120 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6121 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6122 ``declare [[simproc del: neq]]''.
6124 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6127 * Theorem Cons_eq_map_conv no longer declared as "simp".
6129 * Theorem setsum_mult renamed to setsum_right_distrib.
6131 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6134 * Reimplemented methods "sat" and "satx", with several improvements:
6135 goals no longer need to be stated as "<prems> ==> False", equivalences
6136 (i.e. "=" on type bool) are handled, variable names of the form
6137 "lit_<n>" are no longer reserved, significant speedup.
6139 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6140 zChaff is still supported as well.
6142 * 'inductive' and 'datatype': provide projections of mutual rules,
6143 bundled as foo_bar.inducts;
6145 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6148 * Library: moved theory Accessible_Part to main HOL.
6150 * Library: added theory Coinductive_List of potentially infinite lists
6151 as greatest fixed-point.
6153 * Library: added theory AssocList which implements (finite) maps as
6156 * Method "evaluation" solves goals (i.e. a boolean expression)
6157 efficiently by compiling it to ML. The goal is "proved" (via an
6158 oracle) if it evaluates to True.
6160 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6161 also when invoked by the simplifier. This results in the Simplifier
6162 being more powerful on arithmetic goals. INCOMPATIBILITY.
6163 Configuration option fast_arith_split_limit=0 recovers the old
6166 * Support for hex (0x20) and binary (0b1001) numerals.
6168 * New method: reify eqs (t), where eqs are equations for an
6169 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6170 parameter, computes a term s::'b and a list xs::'a list and proves the
6171 theorem I xs s = t. This is also known as reification or quoting. The
6172 resulting theorem is applied to the subgoal to substitute t with I xs
6173 s. If t is omitted, the subgoal itself is reified.
6175 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6176 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6177 where f is supposed to be a computable function (in the sense of code
6178 generattion). The method uses reify to compute s and xs as above then
6179 applies corr_thm and uses normalization by evaluation to "prove" f s =
6180 r and finally gets the theorem t = r, which is again applied to the
6181 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6183 * Reflection: Automatic reification now handels binding, an example is
6184 available in src/HOL/ex/ReflectionEx.thy
6186 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6187 command 'statespace' that is similar to 'record', but introduces an
6188 abstract specification based on the locale infrastructure instead of
6189 HOL types. This leads to extra flexibility in composing state spaces,
6190 in particular multiple inheritance and renaming of components.
6195 * Hyperreal: Functions root and sqrt are now defined on negative real
6196 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6197 Nonnegativity side conditions have been removed from many lemmas, so
6198 that more subgoals may now be solved by simplification; potential
6201 * Real: new type classes formalize real normed vector spaces and
6202 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6203 and norm :: 'a => real.
6205 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6206 reals into other types. The overloaded constant Reals :: 'a set is now
6207 defined as range of_real; potential INCOMPATIBILITY.
6209 * Real: proper support for ML code generation, including 'quickcheck'.
6210 Reals are implemented as arbitrary precision rationals.
6212 * Hyperreal: Several constants that previously worked only for the
6213 reals have been generalized, so they now work over arbitrary vector
6214 spaces. Type annotations may need to be added in some cases; potential
6217 Infinitesimal :: ('a::real_normed_vector) star set
6218 HFinite :: ('a::real_normed_vector) star set
6219 HInfinite :: ('a::real_normed_vector) star set
6220 approx :: ('a::real_normed_vector) star => 'a star => bool
6221 monad :: ('a::real_normed_vector) star => 'a star set
6222 galaxy :: ('a::real_normed_vector) star => 'a star set
6223 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6224 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6225 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6226 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6227 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6228 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6229 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6230 sgn :: 'a::real_normed_vector => 'a
6231 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6233 * Complex: Some complex-specific constants are now abbreviations for
6234 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6235 hnorm. Other constants have been entirely removed in favor of the
6236 polymorphic versions (INCOMPATIBILITY):
6240 HInfinite <-- CInfinite
6241 Infinitesimal <-- CInfinitesimal
6244 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6245 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6246 (ns)deriv <-- (ns)cderiv
6251 * Formalisation of ideals and the quotient construction over rings.
6253 * Order and lattice theory no longer based on records.
6256 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6257 greatest_closed. INCOMPATIBILITY.
6259 * Method algebra is now set up via an attribute. For examples see
6260 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6261 of algebraic structures.
6263 * Renamed theory CRing to Ring.
6268 * Substantial, yet incomplete support for nominal datatypes (binding
6269 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6270 src/HOL/Nominal/Examples. Prospective users should consult
6271 http://isabelle.in.tum.de/nominal/
6276 * ML basics: just one true type int, which coincides with IntInf.int
6279 * ML within Isar: antiquotations allow to embed statically-checked
6280 formal entities in the source, referring to the context available at
6281 compile-time. For example:
6283 ML {* @{sort "{zero,one}"} *}
6284 ML {* @{typ "'a => 'b"} *}
6285 ML {* @{term "%x. x"} *}
6286 ML {* @{prop "x == y"} *}
6287 ML {* @{ctyp "'a => 'b"} *}
6288 ML {* @{cterm "%x. x"} *}
6289 ML {* @{cprop "x == y"} *}
6290 ML {* @{thm asm_rl} *}
6291 ML {* @{thms asm_rl} *}
6292 ML {* @{type_name c} *}
6293 ML {* @{type_syntax c} *}
6294 ML {* @{const_name c} *}
6295 ML {* @{const_syntax c} *}
6298 ML {* @{theory Pure} *}
6299 ML {* @{theory_ref} *}
6300 ML {* @{theory_ref Pure} *}
6303 ML {* @{clasimpset} *}
6305 The same works for sources being ``used'' within an Isar context.
6307 * ML in Isar: improved error reporting; extra verbosity with
6308 ML_Context.trace enabled.
6310 * Pure/General/table.ML: the join operations now works via exceptions
6311 DUP/SAME instead of type option. This is simpler in simple cases, and
6312 admits slightly more efficient complex applications.
6314 * Pure: 'advanced' translation functions (parse_translation etc.) now
6315 use Context.generic instead of just theory.
6317 * Pure: datatype Context.generic joins theory/Proof.context and
6318 provides some facilities for code that works in either kind of
6319 context, notably GenericDataFun for uniform theory and proof data.
6321 * Pure: simplified internal attribute type, which is now always
6322 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6323 local (Proof.context) attributes have been discontinued, while
6324 minimizing code duplication. Thm.rule_attribute and
6325 Thm.declaration_attribute build canonical attributes; see also structure
6326 Context for further operations on Context.generic, notably
6327 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6328 declarations and definitions.
6330 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6331 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6332 init only required for impure data. INCOMPATIBILITY: empty really need
6333 to be empty (no dependencies on theory content!)
6335 * Pure/kernel: consts certification ignores sort constraints given in
6336 signature declarations. (This information is not relevant to the
6337 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6338 potential INCOMPATIBILITY.
6340 * Pure: axiomatic type classes are now purely definitional, with
6341 explicit proofs of class axioms and super class relations performed
6342 internally. See Pure/axclass.ML for the main internal interfaces --
6343 notably AxClass.define_class supercedes AxClass.add_axclass, and
6344 AxClass.axiomatize_class/classrel/arity supersede
6345 Sign.add_classes/classrel/arities.
6347 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6348 global/local versions on theory vs. Proof.context have been
6349 discontinued; Attrib.syntax and Method.syntax have been adapted
6350 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6351 attributes, methods, etc.
6353 * Pure: several functions of signature "... -> theory -> theory * ..."
6354 have been reoriented to "... -> theory -> ... * theory" in order to
6355 allow natural usage in combination with the ||>, ||>>, |-> and
6356 fold_map combinators.
6358 * Pure: official theorem names (closed derivations) and additional
6359 comments (tags) are now strictly separate. Name hints -- which are
6360 maintained as tags -- may be attached any time without affecting the
6363 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6364 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6365 achieve the old behaviour.
6367 * Pure: the "Goal" constant is now called "prop", supporting a
6368 slightly more general idea of ``protecting'' meta-level rule
6371 * Pure: Logic.(un)varify only works in a global context, which is now
6372 enforced instead of silently assumed. INCOMPATIBILITY, may use
6373 Logic.legacy_(un)varify as temporary workaround.
6375 * Pure: structure Name provides scalable operations for generating
6376 internal variable names, notably Name.variants etc. This replaces
6377 some popular functions from term.ML:
6379 Term.variant -> Name.variant
6380 Term.variantlist -> Name.variant_list
6381 Term.invent_names -> Name.invent_list
6383 Note that low-level renaming rarely occurs in new code -- operations
6384 from structure Variable are used instead (see below).
6386 * Pure: structure Variable provides fundamental operations for proper
6387 treatment of fixed/schematic variables in a context. For example,
6388 Variable.import introduces fixes for schematics of given facts and
6389 Variable.export reverses the effect (up to renaming) -- this replaces
6390 various freeze_thaw operations.
6392 * Pure: structure Goal provides simple interfaces for
6393 init/conclude/finish and tactical prove operations (replacing former
6394 Tactic.prove). Goal.prove is the canonical way to prove results
6395 within a given context; Goal.prove_global is a degraded version for
6396 theory level goals, including a global Drule.standard. Note that
6397 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6398 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6399 in a locale context).
6401 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6402 and type checking (Syntax.check_term etc.), with common combinations
6403 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6404 which are considered legacy and await removal.
6406 * Pure/Syntax: generic interfaces for type unchecking
6407 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6408 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6409 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6410 available for convenience, but refer to the very same operations using
6411 a mere theory instead of a full context.
6413 * Isar: simplified treatment of user-level errors, using exception
6414 ERROR of string uniformly. Function error now merely raises ERROR,
6415 without any side effect on output channels. The Isar toplevel takes
6416 care of proper display of ERROR exceptions. ML code may use plain
6417 handle/can/try; cat_error may be used to concatenate errors like this:
6419 ... handle ERROR msg => cat_error msg "..."
6421 Toplevel ML code (run directly or through the Isar toplevel) may be
6422 embedded into the Isar toplevel with exception display/debug like
6425 Isar.toplevel (fn () => ...)
6427 INCOMPATIBILITY, removed special transform_error facilities, removed
6428 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6429 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6430 -- use plain ERROR instead.
6432 * Isar: theory setup now has type (theory -> theory), instead of a
6433 list. INCOMPATIBILITY, may use #> to compose setup functions.
6435 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6436 ProofContext.debug/verbose flags.
6438 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6439 theory before entering a proof state. Transactions now always see a
6440 quasi-functional intermediate checkpoint, both in interactive and
6443 * Isar: simplified interfaces for outer syntax. Renamed
6444 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6445 OuterSyntax.add_parsers -- this functionality is now included in
6446 OuterSyntax.command etc. INCOMPATIBILITY.
6448 * Simplifier: the simpset of a running simplification process now
6449 contains a proof context (cf. Simplifier.the_context), which is the
6450 very context that the initial simpset has been retrieved from (by
6451 simpset_of/local_simpset_of). Consequently, all plug-in components
6452 (solver, looper etc.) may depend on arbitrary proof data.
6454 * Simplifier.inherit_context inherits the proof context (plus the
6455 local bounds) of the current simplification process; any simproc
6456 etc. that calls the Simplifier recursively should do this! Removed
6457 former Simplifier.inherit_bounds, which is already included here --
6458 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6459 specify an explicit context using Simplifier.context/theory_context.
6461 * Simplifier/Classical Reasoner: more abstract interfaces
6462 change_simpset/claset for modifying the simpset/claset reference of a
6463 theory; raw versions simpset/claset_ref etc. have been discontinued --
6466 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6472 * settings: the default heap location within ISABELLE_HOME_USER now
6473 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6474 Isabelle installations.
6476 * isabelle-process: option -S (secure mode) disables some critical
6477 operations, notably runtime compilation and evaluation of ML source
6480 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6482 * Support for parallel execution, using native multicore support of
6483 Poly/ML 5.1. The theory loader exploits parallelism when processing
6484 independent theories, according to the given theory header
6485 specifications. The maximum number of worker threads is specified via
6486 usedir option -M or the "max-threads" setting in Proof General. A
6487 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6488 to 6 on a 8-core machine. User-code needs to observe certain
6489 guidelines for thread-safe programming, see appendix A in the Isar
6490 Implementation manual.
6494 New in Isabelle2005 (October 2005)
6495 ----------------------------------
6499 * Theory headers: the new header syntax for Isar theories is
6502 imports <theory1> ... <theoryN>
6503 uses <file1> ... <fileM>
6506 where the 'uses' part is optional. The previous syntax
6508 theory <name> = <theory1> + ... + <theoryN>:
6510 will disappear in the next release. Use isatool fixheaders to convert
6511 existing theory files. Note that there is no change in ancient
6512 non-Isar theories now, but these will disappear soon.
6514 * Theory loader: parent theories can now also be referred to via
6515 relative and absolute paths.
6517 * Command 'find_theorems' searches for a list of criteria instead of a
6518 list of constants. Known criteria are: intro, elim, dest, name:string,
6519 simp:term, and any term. Criteria can be preceded by '-' to select
6520 theorems that do not match. Intro, elim, dest select theorems that
6521 match the current goal, name:s selects theorems whose fully qualified
6522 name contain s, and simp:term selects all simplification rules whose
6523 lhs match term. Any other term is interpreted as pattern and selects
6524 all theorems matching the pattern. Available in ProofGeneral under
6525 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
6527 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
6529 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
6530 matching the current goal as introduction rule and not having "HOL."
6531 in their name (i.e. not being defined in theory HOL).
6533 * Command 'thms_containing' has been discontinued in favour of
6534 'find_theorems'; INCOMPATIBILITY.
6536 * Communication with Proof General is now 8bit clean, which means that
6537 Unicode text in UTF-8 encoding may be used within theory texts (both
6538 formal and informal parts). Cf. option -U of the Isabelle Proof
6539 General interface. Here are some simple examples (cf. src/HOL/ex):
6541 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
6542 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
6544 * Improved efficiency of the Simplifier and, to a lesser degree, the
6545 Classical Reasoner. Typical big applications run around 2 times
6549 *** Document preparation ***
6551 * Commands 'display_drafts' and 'print_drafts' perform simple output
6552 of raw sources. Only those symbols that do not require additional
6553 LaTeX packages (depending on comments in isabellesym.sty) are
6554 displayed properly, everything else is left verbatim. isatool display
6555 and isatool print are used as front ends (these are subject to the
6556 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
6558 * Command tags control specific markup of certain regions of text,
6559 notably folding and hiding. Predefined tags include "theory" (for
6560 theory begin and end), "proof" for proof commands, and "ML" for
6561 commands involving ML code; the additional tags "visible" and
6562 "invisible" are unused by default. Users may give explicit tag
6563 specifications in the text, e.g. ''by %invisible (auto)''. The
6564 interpretation of tags is determined by the LaTeX job during document
6565 preparation: see option -V of isatool usedir, or options -n and -t of
6566 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6569 Several document versions may be produced at the same time via isatool
6570 usedir (the generated index.html will link all of them). Typical
6571 specifications include ''-V document=theory,proof,ML'' to present
6572 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6573 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6574 these parts without any formal replacement text. The Isabelle site
6575 default settings produce ''document'' and ''outline'' versions as
6578 * Several new antiquotations:
6580 @{term_type term} prints a term with its type annotated;
6582 @{typeof term} prints the type of a term;
6584 @{const const} is the same as @{term const}, but checks that the
6585 argument is a known logical constant;
6587 @{term_style style term} and @{thm_style style thm} print a term or
6588 theorem applying a "style" to it
6592 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6593 definitions, equations, inequations etc., 'concl' printing only the
6594 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6595 to print the specified premise. TermStyle.add_style provides an ML
6596 interface for introducing further styles. See also the "LaTeX Sugar"
6597 document practical applications. The ML antiquotation prints
6598 type-checked ML expressions verbatim.
6600 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6601 and 'text' support optional locale specification '(in loc)', which
6602 specifies the default context for interpreting antiquotations. For
6603 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6605 * Option 'locale=NAME' of antiquotations specifies an alternative
6606 context interpreting the subsequent argument. For example: @{thm
6607 [locale=lattice] inf_assoc}.
6609 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6612 * Proper output of antiquotations for theory commands involving a
6613 proof context (such as 'locale' or 'theorem (in loc) ...').
6615 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6616 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6618 * isatool usedir: new option -C (default true) controls whether option
6619 -D should include a copy of the original document directory; -C false
6620 prevents unwanted effects such as copying of administrative CVS data.
6625 * Considerably improved version of 'constdefs' command. Now performs
6626 automatic type-inference of declared constants; additional support for
6627 local structure declarations (cf. locales and HOL records), see also
6628 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6629 sequential dependencies of definitions within a single 'constdefs'
6630 section; moreover, the declared name needs to be an identifier. If
6631 all fails, consider to fall back on 'consts' and 'defs' separately.
6633 * Improved indexed syntax and implicit structures. First of all,
6634 indexed syntax provides a notational device for subscripted
6635 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6636 expressions. Secondly, in a local context with structure
6637 declarations, number indexes \<^sub>n or the empty index (default
6638 number 1) refer to a certain fixed variable implicitly; option
6639 show_structs controls printing of implicit structures. Typical
6640 applications of these concepts involve record types and locales.
6642 * New command 'no_syntax' removes grammar declarations (and
6643 translations) resulting from the given syntax specification, which is
6644 interpreted in the same manner as for the 'syntax' command.
6646 * 'Advanced' translation functions (parse_translation etc.) may depend
6647 on the signature of the theory context being presently used for
6648 parsing/printing, see also isar-ref manual.
6650 * Improved 'oracle' command provides a type-safe interface to turn an
6651 ML expression of type theory -> T -> term into a primitive rule of
6652 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6653 is already included here); see also FOL/ex/IffExample.thy;
6656 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6657 before); "cI" is no longer bound, use "c.intro" instead.
6658 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6659 axclasses vs. locales.
6661 * Improved internal renaming of symbolic identifiers -- attach primes
6662 instead of base 26 numbers.
6664 * New flag show_question_marks controls printing of leading question
6665 marks in schematic variable names.
6667 * In schematic variable names, *any* symbol following \<^isub> or
6668 \<^isup> is now treated as part of the base name. For example, the
6669 following works without printing of awkward ".0" indexes:
6671 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6674 * Inner syntax includes (*(*nested*) comments*).
6676 * Pretty printer now supports unbreakable blocks, specified in mixfix
6677 annotations as "(00...)".
6679 * Clear separation of logical types and nonterminals, where the latter
6680 may only occur in 'syntax' specifications or type abbreviations.
6681 Before that distinction was only partially implemented via type class
6682 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6683 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6684 exotic syntax specifications may require further adaption
6685 (e.g. Cube/Cube.thy).
6687 * Removed obsolete type class "logic", use the top sort {} instead.
6688 Note that non-logical types should be declared as 'nonterminals'
6689 rather than 'types'. INCOMPATIBILITY for new object-logic
6692 * Attributes 'induct' and 'cases': type or set names may now be
6693 locally fixed variables as well.
6695 * Simplifier: can now control the depth to which conditional rewriting
6696 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6699 * Simplifier: simplification procedures may now take the current
6700 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6701 interface), which is very useful for calling the Simplifier
6702 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6703 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6704 low-level mk_simproc no longer applies Logic.varify internally, to
6705 allow for use in a context of fixed variables.
6707 * thin_tac now works even if the assumption being deleted contains !!
6708 or ==>. More generally, erule now works even if the major premise of
6709 the elimination rule contains !! or ==>.
6711 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6713 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6714 from Pure, which contains all common declarations already. Both
6715 theories are defined via plain Isabelle/Isar .thy files.
6716 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6717 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6718 use isatool fixcpure to adapt your theory and ML sources.
6720 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6721 selections of theorems in named facts via index ranges.
6723 * 'print_theorems': in theory mode, really print the difference
6724 wrt. the last state (works for interactive theory development only),
6725 in proof mode print all local facts (cf. 'print_facts');
6727 * 'hide': option '(open)' hides only base names.
6729 * More efficient treatment of intermediate checkpoints in interactive
6732 * Code generator is now invoked via code_module (incremental code
6733 generation) and code_library (modular code generation, ML structures
6734 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6735 must be quoted when used as identifiers.
6737 * New 'value' command for reading, evaluating and printing terms using
6738 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6739 quoted when used as identifier.
6744 * New commands for the interpretation of locale expressions in
6745 theories (1), locales (2) and proof contexts (3). These generate
6746 proof obligations from the expression specification. After the
6747 obligations have been discharged, theorems of the expression are added
6748 to the theory, target locale or proof context. The synopsis of the
6749 commands is a follows:
6751 (1) interpretation expr inst
6752 (2) interpretation target < expr
6753 (3) interpret expr inst
6755 Interpretation in theories and proof contexts require a parameter
6756 instantiation of terms from the current context. This is applied to
6757 specifications and theorems of the interpreted expression.
6758 Interpretation in locales only permits parameter renaming through the
6759 locale expression. Interpretation is smart in that interpretations
6760 that are active already do not occur in proof obligations, neither are
6761 instantiated theorems stored in duplicate. Use 'print_interps' to
6762 inspect active interpretations of a particular locale. For details,
6763 see the Isar Reference manual. Examples can be found in
6764 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6766 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6767 'interpret' instead.
6769 * New context element 'constrains' for adding type constraints to
6772 * Context expressions: renaming of parameters with syntax
6775 * Locale declaration: 'includes' disallowed.
6777 * Proper static binding of attribute syntax -- i.e. types / terms /
6778 facts mentioned as arguments are always those of the locale definition
6779 context, independently of the context of later invocations. Moreover,
6780 locale operations (renaming and type / term instantiation) are applied
6781 to attribute arguments as expected.
6783 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6784 actual attributes; rare situations may require Attrib.attribute to
6785 embed those attributes into Attrib.src that lack concrete syntax.
6786 Attribute implementations need to cooperate properly with the static
6787 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6788 Attrib.XXX_thm etc. already do the right thing without further
6789 intervention. Only unusual applications -- such as "where" or "of"
6790 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6791 on the context and the facts involved -- may have to assign parsed
6792 values to argument tokens explicitly.
6794 * Changed parameter management in theorem generation for long goal
6795 statements with 'includes'. INCOMPATIBILITY: produces a different
6796 theorem statement in rare situations.
6798 * Locale inspection command 'print_locale' omits notes elements. Use
6799 'print_locale!' to have them included in the output.
6804 * Provers/hypsubst.ML: improved version of the subst method, for
6805 single-step rewriting: it now works in bound variable contexts. New is
6806 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6807 rewrite a different subterm than the original subst method, which is
6808 still available as 'simplesubst'.
6810 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6813 * Provers/trancl.ML: new transitivity reasoner for transitive and
6814 reflexive-transitive closure of relations.
6816 * Provers/blast.ML: new reference depth_limit to make blast's depth
6817 limit (previously hard-coded with a value of 20) user-definable.
6819 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6820 is peformed already. Object-logics merely need to finish their
6821 initial simpset configuration as before. INCOMPATIBILITY.
6826 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6829 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6831 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6832 and x-symbol; use option '-m epsilon' to get it actually printed.
6833 Moreover, the mathematically important symbolic identifier \<epsilon>
6834 becomes available as variable, constant etc. INCOMPATIBILITY,
6836 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6837 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6838 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6839 support corresponding Isar calculations.
6841 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6844 * theory SetInterval: changed the syntax for open intervals:
6853 The old syntax is still supported but will disappear in the next
6854 release. For conversion use the following Emacs search and replace
6855 patterns (these are not perfect but work quite well):
6857 {)\([^\.]*\)\.\. -> {\1<\.\.}
6858 \.\.\([^(}]*\)(} -> \.\.<\1}
6860 * Theory Commutative_Ring (in Library): method comm_ring for proving
6861 equalities in commutative rings; method 'algebra' provides a generic
6864 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6865 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6866 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6869 Some new syntax forms are available:
6871 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6872 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6873 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6874 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6876 The latter form "\<Sum>x < k. e" used to be based on a separate
6877 function "Summation", which has been discontinued.
6879 * theory Finite_Set: in structured induction proofs, the insert case
6880 is now 'case (insert x F)' instead of the old counterintuitive 'case
6883 * The 'refute' command has been extended to support a much larger
6884 fragment of HOL, including axiomatic type classes, constdefs and
6885 typedefs, inductive datatypes and recursion.
6887 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6888 Requires zChaff with proof generation to be installed. See
6889 HOL/ex/SAT_Examples.thy for examples.
6891 * Datatype induction via method 'induct' now preserves the name of the
6892 induction variable. For example, when proving P(xs::'a list) by
6893 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6894 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6895 in unstructured proof scripts.
6897 * Reworked implementation of records. Improved scalability for
6898 records with many fields, avoiding performance problems for type
6899 inference. Records are no longer composed of nested field types, but
6900 of nested extension types. Therefore the record type only grows linear
6901 in the number of extensions and not in the number of fields. The
6902 top-level (users) view on records is preserved. Potential
6903 INCOMPATIBILITY only in strange cases, where the theory depends on the
6904 old record representation. The type generated for a record is called
6905 <record_name>_ext_type.
6907 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6908 proofs triggered by a record definition or a simproc (if
6909 quick_and_dirty is enabled). Definitions of large records can take
6912 New simproc record_upd_simproc for simplification of multiple record
6913 updates enabled by default. Moreover, trivial updates are also
6914 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6915 occasionally, since simplification is more powerful by default.
6917 * typedef: proper support for polymorphic sets, which contain extra
6918 type-variables in the term.
6920 * Simplifier: automatically reasons about transitivity chains
6921 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
6922 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
6923 old proofs break occasionally as simplification may now solve more
6924 goals than previously.
6926 * Simplifier: converts x <= y into x = y if assumption y <= x is
6927 present. Works for all partial orders (class "order"), in particular
6928 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
6931 * Simplifier: new simproc for "let x = a in f x". If a is a free or
6932 bound variable or a constant then the let is unfolded. Otherwise
6933 first a is simplified to b, and then f b is simplified to g. If
6934 possible we abstract b from g arriving at "let x = b in h x",
6935 otherwise we unfold the let and arrive at g. The simproc can be
6936 enabled/disabled by the reference use_let_simproc. Potential
6937 INCOMPATIBILITY since simplification is more powerful by default.
6939 * Classical reasoning: the meson method now accepts theorems as arguments.
6941 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
6942 jobs to provide advice on the provability of subgoals.
6944 * Theory OrderedGroup and Ring_and_Field: various additions and
6945 improvements to faciliate calculations involving equalities and
6948 The following theorems have been eliminated or modified
6951 abs_eq now named abs_of_nonneg
6952 abs_of_ge_0 now named abs_of_nonneg
6953 abs_minus_eq now named abs_of_nonpos
6954 imp_abs_id now named abs_of_nonneg
6955 imp_abs_neg_id now named abs_of_nonpos
6956 mult_pos now named mult_pos_pos
6957 mult_pos_le now named mult_nonneg_nonneg
6958 mult_pos_neg_le now named mult_nonneg_nonpos
6959 mult_pos_neg2_le now named mult_nonneg_nonpos2
6960 mult_neg now named mult_neg_neg
6961 mult_neg_le now named mult_nonpos_nonpos
6963 * The following lemmas in Ring_and_Field have been added to the simplifier:
6966 not_square_less_zero
6968 The following lemmas have been deleted from Real/RealPow:
6978 * Theory Parity: added rules for simplifying exponents.
6982 The following theorems have been eliminated or modified
6985 list_all_Nil now named list_all.simps(1)
6986 list_all_Cons now named list_all.simps(2)
6987 list_all_conv now named list_all_iff
6988 set_mem_eq now named mem_iff
6990 * Theories SetsAndFunctions and BigO (see HOL/Library) support
6991 asymptotic "big O" calculations. See the notes in BigO.thy.
6996 * Theory RealDef: better support for embedding natural numbers and
6997 integers in the reals.
6999 The following theorems have been eliminated or modified
7002 exp_ge_add_one_self now requires no hypotheses
7003 real_of_int_add reversed direction of equality (use [symmetric])
7004 real_of_int_minus reversed direction of equality (use [symmetric])
7005 real_of_int_diff reversed direction of equality (use [symmetric])
7006 real_of_int_mult reversed direction of equality (use [symmetric])
7008 * Theory RComplete: expanded support for floor and ceiling functions.
7010 * Theory Ln is new, with properties of the natural logarithm
7012 * Hyperreal: There is a new type constructor "star" for making
7013 nonstandard types. The old type names are now type synonyms:
7017 hcomplex = complex star
7019 * Hyperreal: Many groups of similarly-defined constants have been
7020 replaced by polymorphic versions (INCOMPATIBILITY):
7022 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7024 starset <-- starsetNat, starsetC
7025 *s* <-- *sNat*, *sc*
7026 starset_n <-- starsetNat_n, starsetC_n
7027 *sn* <-- *sNatn*, *scn*
7028 InternalSets <-- InternalNatSets, InternalCSets
7030 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7031 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7032 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7033 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7034 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7036 * Hyperreal: Many type-specific theorems have been removed in favor of
7037 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7039 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7040 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7041 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7042 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7043 right_minus <-- hypreal_add_minus
7044 left_minus <-- {hypreal,hcomplex}_add_minus_left
7045 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7046 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7047 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7048 mult_1_right <-- hcomplex_mult_one_right
7049 mult_zero_left <-- hcomplex_mult_zero_left
7050 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7051 right_distrib <-- hypnat_add_mult_distrib2
7052 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7053 right_inverse <-- hypreal_mult_inverse
7054 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7055 order_refl <-- {hypreal,hypnat}_le_refl
7056 order_trans <-- {hypreal,hypnat}_le_trans
7057 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7058 order_less_le <-- {hypreal,hypnat}_less_le
7059 linorder_linear <-- {hypreal,hypnat}_le_linear
7060 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7061 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7062 add_nonneg_nonneg <-- hypreal_le_add_order
7064 * Hyperreal: Separate theorems having to do with type-specific
7065 versions of constants have been merged into theorems that apply to the
7066 new polymorphic constants (INCOMPATIBILITY):
7068 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7069 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7070 STAR_Un <-- {STAR,NatStar,STARC}_Un
7071 STAR_Int <-- {STAR,NatStar,STARC}_Int
7072 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7073 STAR_subset <-- {STAR,NatStar,STARC}_subset
7074 STAR_mem <-- {STAR,NatStar,STARC}_mem
7075 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7076 STAR_diff <-- {STAR,STARC}_diff
7077 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7078 STARC_hcomplex_of_complex}_image_subset
7079 starset_n_Un <-- starset{Nat,C}_n_Un
7080 starset_n_Int <-- starset{Nat,C}_n_Int
7081 starset_n_Compl <-- starset{Nat,C}_n_Compl
7082 starset_n_diff <-- starset{Nat,C}_n_diff
7083 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7084 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7085 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7086 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7087 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7088 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7089 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7090 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7091 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7092 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7093 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7094 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7095 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7096 starfun_diff <-- starfun{C,RC,CR}_diff
7097 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7098 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7099 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7100 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7101 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7102 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7103 starfun_Id <-- starfunC_Id
7104 starfun_approx <-- starfun{Nat,CR}_approx
7105 starfun_capprox <-- starfun{C,RC}_capprox
7106 starfun_abs <-- starfunNat_rabs
7107 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7108 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7109 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7110 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7111 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7112 starfun_add_approx <-- starfunCR_add_approx
7113 starfun_inverse_inverse <-- starfunC_inverse_inverse
7114 starfun_divide <-- starfun{C,CR,RC}_divide
7115 starfun_n <-- starfun{Nat,C}_n
7116 starfun_n_mult <-- starfun{Nat,C}_n_mult
7117 starfun_n_add <-- starfun{Nat,C}_n_add
7118 starfun_n_add_minus <-- starfunNat_n_add_minus
7119 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7120 starfun_n_minus <-- starfun{Nat,C}_n_minus
7121 starfun_n_eq <-- starfun{Nat,C}_n_eq
7123 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7124 star_n_minus <-- {hypreal,hcomplex}_minus
7125 star_n_diff <-- {hypreal,hcomplex}_diff
7126 star_n_mult <-- {hypreal,hcomplex}_mult
7127 star_n_inverse <-- {hypreal,hcomplex}_inverse
7128 star_n_le <-- {hypreal,hypnat}_le
7129 star_n_less <-- {hypreal,hypnat}_less
7130 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7131 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7132 star_n_abs <-- hypreal_hrabs
7133 star_n_divide <-- hcomplex_divide
7135 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7136 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7137 star_of_diff <-- hypreal_of_real_diff
7138 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7139 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7140 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7141 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7142 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7143 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7144 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7145 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7146 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7147 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7148 star_of_number_of <-- {hypreal,hcomplex}_number_of
7149 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7150 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7151 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7152 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7153 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7154 star_of_power <-- hypreal_of_real_power
7155 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7157 * Hyperreal: new method "transfer" that implements the transfer
7158 principle of nonstandard analysis. With a subgoal that mentions
7159 nonstandard types like "'a star", the command "apply transfer"
7160 replaces it with an equivalent one that mentions only standard types.
7161 To be successful, all free variables must have standard types; non-
7162 standard variables must have explicit universal quantifiers.
7164 * Hyperreal: A theory of Taylor series.
7169 * Discontinued special version of 'constdefs' (which used to support
7170 continuous functions) in favor of the general Pure one with full
7173 * New simplification procedure for solving continuity conditions; it
7174 is much faster on terms with many nested lambda abstractions (cubic
7175 instead of exponential time).
7177 * New syntax for domain package: selector names are now optional.
7178 Parentheses should be omitted unless argument is lazy, for example:
7180 domain 'a stream = cons "'a" (lazy "'a stream")
7182 * New command 'fixrec' for defining recursive functions with pattern
7183 matching; defining multiple functions with mutual recursion is also
7184 supported. Patterns may include the constants cpair, spair, up, sinl,
7185 sinr, or any data constructor defined by the domain package. The given
7186 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7187 syntax and examples.
7189 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7190 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7191 but the proof obligation additionally includes an admissibility
7192 requirement. The packages generate instances of class cpo or pcpo,
7193 with continuity and strictness theorems for Rep and Abs.
7195 * HOLCF: Many theorems have been renamed according to a more standard naming
7196 scheme (INCOMPATIBILITY):
7198 foo_inject: "foo$x = foo$y ==> x = y"
7199 foo_eq: "(foo$x = foo$y) = (x = y)"
7200 foo_less: "(foo$x << foo$y) = (x << y)"
7201 foo_strict: "foo$UU = UU"
7202 foo_defined: "... ==> foo$x ~= UU"
7203 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7208 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7209 including the First Isomorphism Theorem (on quotienting by the kernel
7212 * ZF/Simplifier: install second copy of type solver that actually
7213 makes use of TC rules declared to Isar proof contexts (or locales);
7214 the old version is still required for ML proof scripts.
7219 * Converted to Isar theory format; use locales instead of axiomatic
7225 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7228 * Pure/library.ML no longer defines its own option datatype, but uses
7229 that of the SML basis, which has constructors NONE and SOME instead of
7230 None and Some, as well as exception Option.Option instead of OPTION.
7231 The functions the, if_none, is_some, is_none have been adapted
7232 accordingly, while Option.map replaces apsome.
7234 * Pure/library.ML: the exception LIST has been given up in favour of
7235 the standard exceptions Empty and Subscript, as well as
7236 Library.UnequalLengths. Function like Library.hd and Library.tl are
7237 superceded by the standard hd and tl functions etc.
7239 A number of basic list functions are no longer exported to the ML
7240 toplevel, as they are variants of predefined functions. The following
7241 suggests how one can translate existing code:
7243 rev_append xs ys = List.revAppend (xs, ys)
7244 nth_elem (i, xs) = List.nth (xs, i)
7245 last_elem xs = List.last xs
7246 flat xss = List.concat xss
7247 seq fs = List.app fs
7248 partition P xs = List.partition P xs
7249 mapfilter f xs = List.mapPartial f xs
7251 * Pure/library.ML: several combinators for linear functional
7252 transformations, notably reverse application and composition:
7255 (x, y) |-> f f #-> g
7257 * Pure/library.ML: introduced/changed precedence of infix operators:
7259 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7261 infix 3 o oo ooo oooo;
7262 infix 4 ~~ upto downto;
7264 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7267 * Pure/library.ML: natural list combinators fold, fold_rev, and
7268 fold_map support linear functional transformations and nesting. For
7271 fold f [x1, ..., xN] y =
7272 y |> f x1 |> ... |> f xN
7274 (fold o fold) f [xs1, ..., xsN] y =
7275 y |> fold f xs1 |> ... |> fold f xsN
7277 fold f [x1, ..., xN] =
7280 (fold o fold) f [xs1, ..., xsN] =
7281 fold f xs1 #> ... #> fold f xsN
7283 * Pure/library.ML: the following selectors on type 'a option are
7286 the: 'a option -> 'a (*partial*)
7287 these: 'a option -> 'a where 'a = 'b list
7288 the_default: 'a -> 'a option -> 'a
7289 the_list: 'a option -> 'a list
7291 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7292 basic operations for association lists, following natural argument
7293 order; moreover the explicit equality predicate passed here avoids
7294 potentially expensive polymorphic runtime equality checks.
7295 The old functions may be expressed as follows:
7297 assoc = uncurry (AList.lookup (op =))
7298 assocs = these oo AList.lookup (op =)
7299 overwrite = uncurry (AList.update (op =)) o swap
7301 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7303 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7304 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7306 replacing make_keylist and keyfilter (occassionally used)
7309 make_keylist = AList.make
7310 keyfilter = AList.find (op =)
7312 * eq_fst and eq_snd now take explicit equality parameter, thus
7313 avoiding eqtypes. Naive rewrites:
7315 eq_fst = eq_fst (op =)
7316 eq_snd = eq_snd (op =)
7318 * Removed deprecated apl and apr (rarely used).
7321 apl (n, op) =>>= curry op n
7322 apr (op, m) =>>= fn n => op (n, m)
7324 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7325 provides a reasonably efficient light-weight implementation of sets as
7328 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7329 few new operations; existing lookup and update are now curried to
7330 follow natural argument order (for use with fold etc.);
7331 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7333 * Pure/General: output via the Isabelle channels of
7334 writeln/warning/error etc. is now passed through Output.output, with a
7335 hook for arbitrary transformations depending on the print_mode
7336 (cf. Output.add_mode -- the first active mode that provides a output
7337 function wins). Already formatted output may be embedded into further
7338 text via Output.raw; the result of Pretty.string_of/str_of and derived
7339 functions (string_of_term/cterm/thm etc.) is already marked raw to
7340 accommodate easy composition of diagnostic messages etc. Programmers
7341 rarely need to care about Output.output or Output.raw at all, with
7342 some notable exceptions: Output.output is required when bypassing the
7343 standard channels (writeln etc.), or in token translations to produce
7344 properly formatted results; Output.raw is required when capturing
7345 already output material that will eventually be presented to the user
7346 a second time. For the default print mode, both Output.output and
7347 Output.raw have no effect.
7349 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7350 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7351 cumulative results are displayed at the end of a batch session.
7353 * Pure/General: File.sysify_path and File.quote_sysify path have been
7354 replaced by File.platform_path and File.shell_path (with appropriate
7355 hooks). This provides a clean interface for unusual systems where the
7356 internal and external process view of file names are different.
7358 * Pure: more efficient orders for basic syntactic entities: added
7359 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7360 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7361 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7362 orders now -- potential INCOMPATIBILITY for code that depends on a
7363 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7364 Library.sort_strings on result).
7366 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7367 fold_types traverse types/terms from left to right, observing natural
7368 argument order. Supercedes previous foldl_XXX versions, add_frees,
7369 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7371 * Pure: name spaces have been refined, with significant changes of the
7372 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7373 to extern(_table). The plain name entry path is superceded by a
7374 general 'naming' context, which also includes the 'policy' to produce
7375 a fully qualified name and external accesses of a fully qualified
7376 name; NameSpace.extend is superceded by context dependent
7377 Sign.declare_name. Several theory and proof context operations modify
7378 the naming context. Especially note Theory.restore_naming and
7379 ProofContext.restore_naming to get back to a sane state; note that
7380 Theory.add_path is no longer sufficient to recover from
7381 Theory.absolute_path in particular.
7383 * Pure: new flags short_names (default false) and unique_names
7384 (default true) for controlling output of qualified names. If
7385 short_names is set, names are printed unqualified. If unique_names is
7386 reset, the name prefix is reduced to the minimum required to achieve
7387 the original result when interning again, even if there is an overlap
7388 with earlier declarations.
7390 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7391 now 'extend', and 'merge' gets an additional Pretty.pp argument
7392 (useful for printing error messages). INCOMPATIBILITY.
7394 * Pure: major reorganization of the theory context. Type Sign.sg and
7395 Theory.theory are now identified, referring to the universal
7396 Context.theory (see Pure/context.ML). Actual signature and theory
7397 content is managed as theory data. The old code and interfaces were
7398 spread over many files and structures; the new arrangement introduces
7399 considerable INCOMPATIBILITY to gain more clarity:
7401 Context -- theory management operations (name, identity, inclusion,
7402 parents, ancestors, merge, etc.), plus generic theory data;
7404 Sign -- logical signature and syntax operations (declaring consts,
7405 types, etc.), plus certify/read for common entities;
7407 Theory -- logical theory operations (stating axioms, definitions,
7408 oracles), plus a copy of logical signature operations (consts,
7409 types, etc.); also a few basic management operations (Theory.copy,
7412 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7413 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7414 for convenience -- they merely return the theory.
7416 * Pure: type Type.tsig is superceded by theory in most interfaces.
7418 * Pure: the Isar proof context type is already defined early in Pure
7419 as Context.proof (note that ProofContext.context and Proof.context are
7420 aliases, where the latter is the preferred name). This enables other
7421 Isabelle components to refer to that type even before Isar is present.
7423 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7424 typeK, constK, axiomK, oracleK), but provide explicit operations for
7425 any of these kinds. For example, Sign.intern typeK is now
7426 Sign.intern_type, Theory.hide_space Sign.typeK is now
7427 Theory.hide_types. Also note that former
7428 Theory.hide_classes/types/consts are now
7429 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7430 internalize their arguments! INCOMPATIBILITY.
7432 * Pure: get_thm interface (of PureThy and ProofContext) expects
7433 datatype thmref (with constructors Name and NameSelection) instead of
7434 plain string -- INCOMPATIBILITY;
7436 * Pure: cases produced by proof methods specify options, where NONE
7437 means to remove case bindings -- INCOMPATIBILITY in
7440 * Pure: the following operations retrieve axioms or theorems from a
7441 theory node or theory hierarchy, respectively:
7443 Theory.axioms_of: theory -> (string * term) list
7444 Theory.all_axioms_of: theory -> (string * term) list
7445 PureThy.thms_of: theory -> (string * thm) list
7446 PureThy.all_thms_of: theory -> (string * thm) list
7448 * Pure: print_tac now outputs the goal through the trace channel.
7450 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7451 Reference Toplevel.debug (default false) controls detailed printing
7452 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7453 controls execution profiling -- set to 1 for time and 2 for space
7454 (both increase the runtime).
7456 * Isar session: The initial use of ROOT.ML is now always timed,
7457 i.e. the log will show the actual process times, in contrast to the
7458 elapsed wall-clock time that the outer shell wrapper produces.
7460 * Simplifier: improved handling of bound variables (nameless
7461 representation, avoid allocating new strings). Simprocs that invoke
7462 the Simplifier recursively should use Simplifier.inherit_bounds to
7463 avoid local name clashes. Failure to do so produces warnings
7464 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7465 for further details.
7467 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7468 bindings for all theorems stored within a given theory; this may help
7469 in porting non-Isar theories to Isar ones, while keeping ML proof
7470 scripts for the time being.
7472 * ML operator HTML.with_charset specifies the charset begin used for
7473 generated HTML files. For example:
7475 HTML.with_charset "utf-8" use_thy "Hebrew";
7476 HTML.with_charset "utf-8" use_thy "Chinese";
7481 * Allow symlinks to all proper Isabelle executables (Isabelle,
7482 isabelle, isatool etc.).
7484 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7485 isatool doc, isatool mkdir, display_drafts etc.).
7487 * isatool usedir: option -f allows specification of the ML file to be
7488 used by Isabelle; default is ROOT.ML.
7490 * New isatool version outputs the version identifier of the Isabelle
7491 distribution being used.
7493 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7494 (containing Boolean satisfiability problems) into Isabelle/HOL
7499 New in Isabelle2004 (April 2004)
7500 --------------------------------
7504 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7505 Replaces linorder.ML.
7507 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7508 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7509 (\<a>...\<z>), are now considered normal letters, and can therefore
7510 be used anywhere where an ASCII letter (a...zA...Z) has until
7511 now. COMPATIBILITY: This obviously changes the parsing of some
7512 terms, especially where a symbol has been used as a binder, say
7513 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
7514 as an identifier. Fix it by inserting a space around former
7515 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
7516 existing theory and ML files.
7518 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
7520 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
7521 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
7522 a normal (but invisible) letter. For multiple letter subscripts repeat
7523 \<^isub> like this: x\<^isub>1\<^isub>2.
7525 * Pure: There are now sub-/superscripts that can span more than one
7526 character. Text between \<^bsub> and \<^esub> is set in subscript in
7527 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
7528 superscript. The new control characters are not identifier parts.
7530 * Pure: Control-symbols of the form \<^raw:...> will literally print the
7531 content of "..." to the latex file instead of \isacntrl... . The "..."
7532 may consist of any printable characters excluding the end bracket >.
7534 * Pure: Using new Isar command "finalconsts" (or the ML functions
7535 Theory.add_finals or Theory.add_finals_i) it is now possible to
7536 declare constants "final", which prevents their being given a definition
7537 later. It is useful for constants whose behaviour is fixed axiomatically
7538 rather than definitionally, such as the meta-logic connectives.
7540 * Pure: 'instance' now handles general arities with general sorts
7541 (i.e. intersections of classes),
7543 * Presentation: generated HTML now uses a CSS style sheet to make layout
7544 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
7545 It can be changed to alter the colors/layout of generated pages.
7550 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
7551 cut_tac, subgoal_tac and thin_tac:
7552 - Now understand static (Isar) contexts. As a consequence, users of Isar
7553 locales are no longer forced to write Isar proof scripts.
7554 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
7556 - INCOMPATIBILITY: names of variables to be instantiated may no
7557 longer be enclosed in quotes. Instead, precede variable name with `?'.
7558 This is consistent with the instantiation attribute "where".
7560 * Attributes "where" and "of":
7561 - Now take type variables of instantiated theorem into account when reading
7562 the instantiation string. This fixes a bug that caused instantiated
7563 theorems to have too special types in some circumstances.
7564 - "where" permits explicit instantiations of type variables.
7566 * Calculation commands "moreover" and "also" no longer interfere with
7567 current facts ("this"), admitting arbitrary combinations with "then"
7571 - Goal statements involving the context element "includes" no longer
7572 generate theorems with internal delta predicates (those ending on
7573 "_axioms") in the premise.
7574 Resolve particular premise with <locale>.intro to obtain old form.
7575 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7576 specification and "includes" elements in goal statement.
7577 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7578 [intro?] and [elim?] (respectively) by default.
7579 - Experimental command for instantiation of locales in proof contexts:
7580 instantiate <label>[<attrs>]: <loc>
7581 Instantiates locale <loc> and adds all its theorems to the current context
7582 taking into account their attributes. Label and attrs are optional
7583 modifiers, like in theorem declarations. If present, names of
7584 instantiated theorems are qualified with <label>, and the attributes
7585 <attrs> are applied after any attributes these theorems might have already.
7586 If the locale has assumptions, a chained fact of the form
7587 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7588 are derived. The command does not support old-style locales declared
7589 with "locale (open)".
7590 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7592 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7598 * Proof import: new image HOL4 contains the imported library from
7599 the HOL4 system with about 2500 theorems. It is imported by
7600 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7601 can be used like any other Isabelle image. See
7602 HOL/Import/HOL/README for more information.
7605 - Much improved handling of linear and partial orders.
7606 Reasoners for linear and partial orders are set up for type classes
7607 "linorder" and "order" respectively, and are added to the default simpset
7608 as solvers. This means that the simplifier can build transitivity chains
7609 to solve goals from the assumptions.
7610 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7611 of blast or auto after simplification become unnecessary because the goal
7612 is solved by simplification already.
7614 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7615 all proved in axiomatic type classes for semirings, rings and fields.
7618 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7619 now formalized using the Ring_and_Field theory mentioned above.
7620 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7621 than before, because now they are set up once in a generic manner.
7622 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7623 Look for the general versions in Ring_and_Field (and Power if they concern
7626 * Type "rat" of the rational numbers is now available in HOL-Complex.
7629 - Record types are now by default printed with their type abbreviation
7630 instead of the list of all field types. This can be configured via
7631 the reference "print_record_type_abbr".
7632 - Simproc "record_upd_simproc" for simplification of multiple updates added
7633 (not enabled by default).
7634 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7635 EX x. x = sel r to True (not enabled by default).
7636 - Tactic "record_split_simp_tac" to split and simplify records added.
7638 * 'specification' command added, allowing for definition by
7639 specification. There is also an 'ax_specification' command that
7640 introduces the new constants axiomatically.
7642 * arith(_tac) is now able to generate counterexamples for reals as well.
7644 * HOL-Algebra: new locale "ring" for non-commutative rings.
7646 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7647 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7649 * HOL-Matrix: a first theory for matrices in HOL with an application of
7650 matrix theory to linear programming.
7652 * Unions and Intersections:
7653 The latex output syntax of UN and INT has been changed
7654 from "\Union x \in A. B" to "\Union_{x \in A} B"
7655 i.e. the index formulae has become a subscript.
7656 Similarly for "\Union x. B", and for \Inter instead of \Union.
7658 * Unions and Intersections over Intervals:
7659 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7660 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7661 like in normal math, and corresponding versions for < and for intersection.
7663 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7664 lexicographic dictonary ordering has been added as "lexord".
7666 * ML: the legacy theory structures Int and List have been removed. They had
7667 conflicted with ML Basis Library structures having the same names.
7669 * 'refute' command added to search for (finite) countermodels. Only works
7670 for a fragment of HOL. The installation of an external SAT solver is
7671 highly recommended. See "HOL/Refute.thy" for details.
7673 * 'quickcheck' command: Allows to find counterexamples by evaluating
7674 formulae under an assignment of free variables to random values.
7675 In contrast to 'refute', it can deal with inductive datatypes,
7676 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7682 * Streams now come with concatenation and are part of the HOLCF image
7686 New in Isabelle2003 (May 2003)
7687 ------------------------------
7691 * Provers/simplifier:
7693 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7694 Assumptions are now subject to complete mutual simplification,
7695 not just from left to right. The simplifier now preserves
7696 the order of assumptions.
7698 Potential INCOMPATIBILITY:
7700 -- simp sometimes diverges where the old version did
7701 not, e.g. invoking simp on the goal
7703 [| P (f x); y = x; f x = f y |] ==> Q
7705 now gives rise to the infinite reduction sequence
7707 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7709 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7712 -- Tactics combining classical reasoner and simplification (such as auto)
7713 are also affected by this change, because many of them rely on
7714 simp. They may sometimes diverge as well or yield a different numbers
7715 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7716 in case of problems. Sometimes subsequent calls to the classical
7717 reasoner will fail because a preceeding call to the simplifier too
7718 eagerly simplified the goal, e.g. deleted redundant premises.
7720 - The simplifier trace now shows the names of the applied rewrite rules
7722 - You can limit the number of recursive invocations of the simplifier
7723 during conditional rewriting (where the simplifie tries to solve the
7724 conditions before applying the rewrite rule):
7725 ML "simp_depth_limit := n"
7726 where n is an integer. Thus you can force termination where previously
7727 the simplifier would diverge.
7729 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7731 - No longer aborts on failed congruence proof. Instead, the
7732 congruence is ignored.
7734 * Pure: New generic framework for extracting programs from constructive
7735 proofs. See HOL/Extraction.thy for an example instantiation, as well
7736 as HOL/Extraction for some case studies.
7738 * Pure: The main goal of the proof state is no longer shown by default, only
7739 the subgoals. This behaviour is controlled by a new flag.
7740 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7741 (ML: Proof.show_main_goal).
7743 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7744 rules whose conclusion matches subgoal 1:
7745 PG menu: Isabelle/Isar -> Show me -> matching rules
7746 The rules are ordered by how closely they match the subgoal.
7747 In particular, rules that solve a subgoal outright are displayed first
7748 (or rather last, the way they are printed).
7749 (ML: ProofGeneral.print_intros())
7751 * Pure: New flag trace_unify_fail causes unification to print
7752 diagnostic information (PG: in trace buffer) when it fails. This is
7753 useful for figuring out why single step proofs like rule, erule or
7756 * Pure: Locale specifications now produce predicate definitions
7757 according to the body of text (covering assumptions modulo local
7758 definitions); predicate "loc_axioms" covers newly introduced text,
7759 while "loc" is cumulative wrt. all included locale expressions; the
7760 latter view is presented only on export into the global theory
7761 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7762 on the old view without predicates;
7764 * Pure: predefined locales "var" and "struct" are useful for sharing
7765 parameters (as in CASL, for example); just specify something like
7766 ``var x + var y + struct M'' as import;
7768 * Pure: improved thms_containing: proper indexing of facts instead of
7769 raw theorems; check validity of results wrt. current name space;
7770 include local facts of proof configuration (also covers active
7771 locales), cover fixed variables in index; may use "_" in term
7772 specification; an optional limit for the number of printed facts may
7773 be given (the default is 40);
7775 * Pure: disallow duplicate fact bindings within new-style theory files
7778 * Provers: improved induct method: assumptions introduced by case
7779 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7780 the goal statement); "foo" still refers to all facts collectively;
7782 * Provers: the function blast.overloaded has been removed: all constants
7783 are regarded as potentially overloaded, which improves robustness in exchange
7784 for slight decrease in efficiency;
7786 * Provers/linorder: New generic prover for transitivity reasoning over
7787 linear orders. Note: this prover is not efficient!
7789 * Isar: preview of problems to finish 'show' now produce an error
7790 rather than just a warning (in interactive mode);
7797 - Produces a counter example if it cannot prove a goal.
7798 Note that the counter example may be spurious if the goal is not a formula
7799 of quantifier-free linear arithmetic.
7800 In ProofGeneral the counter example appears in the trace buffer.
7802 - Knows about div k and mod k where k is a numeral of type nat or int.
7804 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7805 linear arithmetic fails. This takes account of quantifiers and divisibility.
7806 Presburger arithmetic can also be called explicitly via presburger(_tac).
7808 * simp's arithmetic capabilities have been enhanced a bit: it now
7809 takes ~= in premises into account (by performing a case split);
7811 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7812 are distributed over a sum of terms;
7814 * New tactic "trans_tac" and method "trans" instantiate
7815 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7818 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7819 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7821 * 'typedef' command has new option "open" to suppress the set
7824 * functions Min and Max on finite sets have been introduced (theory
7827 * attribute [symmetric] now works for relations as well; it turns
7828 (x,y) : R^-1 into (y,x) : R, and vice versa;
7830 * induct over a !!-quantified statement (say !!x1..xn):
7831 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7833 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7834 %x. None. Warning: empty_def now refers to the previously hidden definition
7837 * Algebra: formalization of classical algebra. Intended as base for
7838 any algebraic development in Isabelle. Currently covers group theory
7839 (up to Sylow's theorem) and ring theory (Universal Property of
7840 Univariate Polynomials). Contributions welcome;
7842 * GroupTheory: deleted, since its material has been moved to Algebra;
7844 * Complex: new directory of the complex numbers with numeric constants,
7845 nonstandard complex numbers, and some complex analysis, standard and
7846 nonstandard (Jacques Fleuriot);
7848 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7850 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7853 * Real/HahnBanach: updated and adapted to locales;
7855 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7858 * UNITY: added the Meier-Sanders theory of progress sets;
7860 * MicroJava: bytecode verifier and lightweight bytecode verifier
7861 as abstract algorithms, instantiated to the JVM;
7863 * Bali: Java source language formalization. Type system, operational
7864 semantics, axiomatic semantics. Supported language features:
7865 classes, interfaces, objects,virtual methods, static methods,
7866 static/instance fields, arrays, access modifiers, definite
7867 assignment, exceptions.
7872 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7875 * Main ZF: virtually all theories converted to new-style format;
7880 * Pure: Tactic.prove provides sane interface for internal proofs;
7881 omits the infamous "standard" operation, so this is more appropriate
7882 than prove_goalw_cterm in many situations (e.g. in simprocs);
7884 * Pure: improved error reporting of simprocs;
7886 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7890 *** Document preparation ***
7892 * uses \par instead of \\ for line breaks in theory text. This may
7893 shift some page breaks in large documents. To get the old behaviour
7894 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7896 * minimized dependencies of isabelle.sty and isabellesym.sty on
7899 * \<euro> now needs package babel/greek instead of marvosym (which
7902 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7907 New in Isabelle2002 (March 2002)
7908 --------------------------------
7910 *** Document preparation ***
7912 * greatly simplified document preparation setup, including more
7913 graceful interpretation of isatool usedir -i/-d/-D options, and more
7914 instructive isatool mkdir; users should basically be able to get
7915 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7916 users may run a separate document processing stage manually like this:
7917 "isatool usedir -D output HOL Test && isatool document Test/output";
7919 * theory dependency graph may now be incorporated into documents;
7920 isatool usedir -g true will produce session_graph.eps/.pdf for use
7921 with \includegraphics of LaTeX;
7923 * proper spacing of consecutive markup elements, especially text
7924 blocks after section headings;
7926 * support bold style (for single symbols only), input syntax is like
7927 this: "\<^bold>\<alpha>" or "\<^bold>A";
7929 * \<bullet> is now output as bold \cdot by default, which looks much
7930 better in printed text;
7932 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
7933 note that these symbols are currently unavailable in Proof General /
7934 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
7936 * isatool latex no longer depends on changed TEXINPUTS, instead
7937 isatool document copies the Isabelle style files to the target
7943 * Pure/Provers: improved proof by cases and induction;
7944 - 'case' command admits impromptu naming of parameters (such as
7946 - 'induct' method divinates rule instantiation from the inductive
7947 claim; no longer requires excessive ?P bindings for proper
7948 instantiation of cases;
7949 - 'induct' method properly enumerates all possibilities of set/type
7950 rules; as a consequence facts may be also passed through *type*
7951 rules without further ado;
7952 - 'induct' method now derives symbolic cases from the *rulified*
7953 rule (before it used to rulify cases stemming from the internal
7954 atomized version); this means that the context of a non-atomic
7955 statement becomes is included in the hypothesis, avoiding the
7956 slightly cumbersome show "PROP ?case" form;
7957 - 'induct' may now use elim-style induction rules without chaining
7958 facts, using ``missing'' premises from the goal state; this allows
7959 rules stemming from inductive sets to be applied in unstructured
7960 scripts, while still benefitting from proper handling of non-atomic
7961 statements; NB: major inductive premises need to be put first, all
7962 the rest of the goal is passed through the induction;
7963 - 'induct' proper support for mutual induction involving non-atomic
7964 rule statements (uses the new concept of simultaneous goals, see
7966 - append all possible rule selections, but only use the first
7967 success (no backtracking);
7968 - removed obsolete "(simplified)" and "(stripped)" options of methods;
7969 - undeclared rule case names default to numbers 1, 2, 3, ...;
7970 - added 'print_induct_rules' (covered by help item in recent Proof
7972 - moved induct/cases attributes to Pure, methods to Provers;
7973 - generic method setup instantiated for FOL and HOL;
7975 * Pure: support multiple simultaneous goal statements, for example
7976 "have a: A and b: B" (same for 'theorem' etc.); being a pure
7977 meta-level mechanism, this acts as if several individual goals had
7978 been stated separately; in particular common proof methods need to be
7979 repeated in order to cover all claims; note that a single elimination
7980 step is *not* sufficient to establish the two conjunctions, so this
7983 assume "A & B" then have A and B .. (*".." fails*)
7985 better use "obtain" in situations as above; alternative refer to
7986 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
7988 * Pure: proper integration with ``locales''; unlike the original
7989 version by Florian Kammller, Isar locales package high-level proof
7990 contexts rather than raw logical ones (e.g. we admit to include
7991 attributes everywhere); operations on locales include merge and
7992 rename; support for implicit arguments (``structures''); simultaneous
7993 type-inference over imports and text; see also HOL/ex/Locales.thy for
7996 * Pure: the following commands have been ``localized'', supporting a
7997 target locale specification "(in name)": 'lemma', 'theorem',
7998 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
7999 stored both within the locale and at the theory level (exported and
8000 qualified by the locale name);
8002 * Pure: theory goals may now be specified in ``long'' form, with
8003 ad-hoc contexts consisting of arbitrary locale elements. for example
8004 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8005 definitions may be given, too); the result is a meta-level rule with
8006 the context elements being discharged in the obvious way;
8008 * Pure: new proof command 'using' allows to augment currently used
8009 facts after a goal statement ('using' is syntactically analogous to
8010 'apply', but acts on the goal's facts only); this allows chained facts
8011 to be separated into parts given before and after a claim, as in
8012 ``from a and b have C using d and e <proof>'';
8014 * Pure: renamed "antecedent" case to "rule_context";
8016 * Pure: new 'judgment' command records explicit information about the
8017 object-logic embedding (used by several tools internally); no longer
8018 use hard-wired "Trueprop";
8020 * Pure: added 'corollary' command;
8022 * Pure: fixed 'token_translation' command;
8024 * Pure: removed obsolete 'exported' attribute;
8026 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8027 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8028 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8030 * Pure: method 'atomize' presents local goal premises as object-level
8031 statements (atomic meta-level propositions); setup controlled via
8032 rewrite rules declarations of 'atomize' attribute; example
8033 application: 'induct' method with proper rule statements in improper
8036 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8037 now consider the syntactic context of assumptions, giving a better
8038 chance to get type-inference of the arguments right (this is
8039 especially important for locales);
8041 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8044 * Pure/obtain: the formal conclusion "thesis", being marked as
8045 ``internal'', may no longer be reference directly in the text;
8046 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8049 * Pure: generic 'sym' attribute which declares a rule both as pure
8050 'elim?' and for the 'symmetric' operation;
8052 * Pure: marginal comments ``--'' may now occur just anywhere in the
8053 text; the fixed correlation with particular command syntax has been
8056 * Pure: new method 'rules' is particularly well-suited for proof
8057 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8058 but often produces more compact proof terms with less detours;
8060 * Pure/Provers/classical: simplified integration with pure rule
8061 attributes and methods; the classical "intro?/elim?/dest?"
8062 declarations coincide with the pure ones; the "rule" method no longer
8063 includes classically swapped intros; "intro" and "elim" methods no
8064 longer pick rules from the context; also got rid of ML declarations
8065 AddXIs/AddXEs/AddXDs; all of this has some potential for
8068 * Provers/classical: attribute 'swapped' produces classical inversions
8069 of introduction rules;
8071 * Provers/simplifier: 'simplified' attribute may refer to explicit
8072 rules instead of full simplifier context; 'iff' attribute handles
8075 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8077 * HOL: 'recdef' now fails on unfinished automated proofs, use
8078 "(permissive)" option to recover old behavior;
8080 * HOL: 'inductive' no longer features separate (collective) attributes
8081 for 'intros' (was found too confusing);
8083 * HOL: properly declared induction rules less_induct and
8089 * HOL: moved over to sane numeral syntax; the new policy is as
8092 - 0 and 1 are polymorphic constants, which are defined on any
8093 numeric type (nat, int, real etc.);
8095 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8096 binary representation internally;
8098 - type nat has special constructor Suc, and generally prefers Suc 0
8099 over 1::nat and Suc (Suc 0) over 2::nat;
8101 This change may cause significant problems of INCOMPATIBILITY; here
8102 are some hints on converting existing sources:
8104 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8105 entities, so expressions involving "-" (unary or binary minus) need
8106 to be spaced properly;
8108 - existing occurrences of "1" may need to be constraint "1::nat" or
8109 even replaced by Suc 0; similar for old "2";
8111 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8113 - remove all special provisions on numerals in proofs;
8115 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8116 representation (depends on bin_arith_simps in the default context);
8118 * HOL: symbolic syntax for x^2 (numeral 2);
8120 * HOL: the class of all HOL types is now called "type" rather than
8121 "term"; INCOMPATIBILITY, need to adapt references to this type class
8122 in axclass/classes, instance/arities, and (usually rare) occurrences
8123 in typings (of consts etc.); internally the class is called
8124 "HOL.type", ML programs should refer to HOLogic.typeS;
8126 * HOL/record package improvements:
8127 - new derived operations "fields" to build a partial record section,
8128 "extend" to promote a fixed record to a record scheme, and
8129 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8130 declared as simp by default;
8131 - shared operations ("more", "fields", etc.) now need to be always
8132 qualified) --- potential INCOMPATIBILITY;
8133 - removed "make_scheme" operations (use "make" with "extend") --
8135 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8136 - provides cases/induct rules for use with corresponding Isar
8137 methods (for concrete records, record schemes, concrete more
8138 parts, and schematic more parts -- in that order);
8139 - internal definitions directly based on a light-weight abstract
8140 theory of product types over typedef rather than datatype;
8142 * HOL: generic code generator for generating executable ML code from
8143 specifications; specific support for HOL constructs such as inductive
8144 datatypes and sets, as well as recursive functions; can be invoked
8145 via 'generate_code' theory section;
8147 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8149 * HOL: consolidated and renamed several theories. In particular:
8150 Ord.thy has been absorbed into HOL.thy
8151 String.thy has been absorbed into List.thy
8153 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8154 (beware of argument permutation!);
8156 * HOL: linorder_less_split superseded by linorder_cases;
8158 * HOL/List: "nodups" renamed to "distinct";
8160 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8161 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8162 - Ex_def has changed, now need to use some_eq_ex
8164 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8165 in this (rare) case use:
8167 delSWrapper "split_all_tac"
8168 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8170 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8173 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8174 Isabelle's type classes, ^ on functions and relations has too general
8175 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8176 necessary to attach explicit type constraints;
8178 * HOL/Relation: the prefix name of the infix "O" has been changed from
8179 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8180 renamed accordingly (eg "compI" -> "rel_compI").
8182 * HOL: syntax translations now work properly with numerals and records
8185 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8186 of "lam" -- INCOMPATIBILITY;
8188 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8189 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8190 renamed "Product_Type.unit";
8192 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8194 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8195 the "cases" method);
8197 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8200 * HOL/IMP: updated and converted to new-style theory format; several
8201 parts turned into readable document, with proper Isar proof texts and
8202 some explanations (by Gerwin Klein);
8204 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8206 * HOL-Hyperreal is now a logic image;
8211 * Isar: consts/constdefs supports mixfix syntax for continuous
8214 * Isar: domain package adapted to new-style theory format, e.g. see
8217 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8218 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8219 lift.induct_tac, always use UU instead of Undef;
8221 * HOLCF/IMP: updated and converted to new-style theory;
8226 * Isar: proper integration of logic-specific tools and packages,
8227 including theory commands '(co)inductive', '(co)datatype',
8228 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8229 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8231 * theory Main no longer includes AC; for the Axiom of Choice, base
8232 your theory on Main_ZFC;
8234 * the integer library now covers quotients and remainders, with many
8235 laws relating division to addition, multiplication, etc.;
8237 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8238 typeless version of the formalism;
8240 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8243 * ZF/Induct: new directory for examples of inductive definitions,
8244 including theory Multiset for multiset orderings; converted to
8245 new-style theory format;
8247 * ZF: many new theorems about lists, ordinals, etc.;
8252 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8253 variable proof controls level of detail: 0 = no proofs (only oracle
8254 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8255 also ref manual for further ML interfaces;
8257 * Pure/axclass: removed obsolete ML interface
8258 goal_subclass/goal_arity;
8260 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8261 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8262 separate tokens, so expressions involving minus need to be spaced
8265 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8266 rather than "infixl" or "infixr";
8268 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8269 sort constraint specifications in type inference; e.g. "x::_::foo"
8270 ensures that the type of "x" is of sort "foo" (but not necessarily a
8273 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8274 control output of nested => (types); the default behavior is
8277 * Pure/syntax: builtin parse translation for "_constify" turns valued
8278 tokens into AST constants;
8280 * Pure/syntax: prefer later declarations of translations and print
8281 translation functions; potential INCOMPATIBILITY: need to reverse
8282 multiple declarations for same syntax element constant;
8284 * Pure/show_hyps reset by default (in accordance to existing Isar
8287 * Provers/classical: renamed addaltern to addafter, addSaltern to
8290 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8293 * system: tested support for MacOS X; should be able to get Isabelle +
8294 Proof General to work in a plain Terminal after installing Poly/ML
8295 (e.g. from the Isabelle distribution area) and GNU bash alone
8296 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8297 support requires further installations, e.g. from
8298 http://fink.sourceforge.net/);
8300 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8302 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8303 of 40 MB), cf. ML_OPTIONS;
8305 * system: Proof General keywords specification is now part of the
8306 Isabelle distribution (see etc/isar-keywords.el);
8308 * system: support for persistent Proof General sessions (refrain from
8309 outdating all loaded theories on startup); user may create writable
8310 logic images like this: ``isabelle -q HOL Test'';
8312 * system: smart selection of Isabelle process versus Isabelle
8313 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8314 run both "isabelle" and "Isabelle" even if file names are badly
8315 damaged (executable inspects the case of the first letter of its own
8316 name); added separate "isabelle-process" and "isabelle-interface";
8318 * system: refrain from any attempt at filtering input streams; no
8319 longer support ``8bit'' encoding of old isabelle font, instead proper
8320 iso-latin characters may now be used; the related isatools
8321 "symbolinput" and "nonascii" have disappeared as well;
8323 * system: removed old "xterm" interface (the print modes "xterm" and
8324 "xterm_color" are still available for direct use in a suitable
8329 New in Isabelle99-2 (February 2001)
8330 -----------------------------------
8332 *** Overview of INCOMPATIBILITIES ***
8334 * HOL: please note that theories in the Library and elsewhere often use the
8335 new-style (Isar) format; to refer to their theorems in an ML script you must
8336 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8338 * HOL: inductive package no longer splits induction rule aggressively,
8339 but only as far as specified by the introductions given; the old
8340 format may be recovered via ML function complete_split_rule or attribute
8341 'split_rule (complete)';
8343 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8344 gfp_Tarski to gfp_unfold;
8346 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8348 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8349 relation); infix "^^" has been renamed "``"; infix "``" has been
8350 renamed "`"; "univalent" has been renamed "single_valued";
8352 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8355 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8357 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8359 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8360 consequence, it is no longer monotonic wrt. the local goal context
8361 (which is now passed through the inductive cases);
8363 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8364 \<gg> to \<ggreater>;
8367 *** Document preparation ***
8369 * \isabellestyle{NAME} selects version of Isabelle output (currently
8370 available: are "it" for near math-mode best-style output, "sl" for
8371 slanted text style, and "tt" for plain type-writer; if no
8372 \isabellestyle command is given, output is according to slanted
8375 * support sub/super scripts (for single symbols only), input syntax is
8376 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8378 * some more standard symbols; see Appendix A of the system manual for
8379 the complete list of symbols defined in isabellesym.sty;
8381 * improved isabelle style files; more abstract symbol implementation
8382 (should now use \isamath{...} and \isatext{...} in custom symbol
8385 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8386 state; Note that presentation of goal states does not conform to
8387 actual human-readable proof documents. Please do not include goal
8388 states into document output unless you really know what you are doing!
8390 * proper indentation of antiquoted output with proportional LaTeX
8393 * no_document ML operator temporarily disables LaTeX document
8396 * isatool unsymbolize tunes sources for plain ASCII communication;
8401 * Pure: Isar now suffers initial goal statements to contain unbound
8402 schematic variables (this does not conform to actual readable proof
8403 documents, due to unpredictable outcome and non-compositional proof
8404 checking); users who know what they are doing may use schematic goals
8405 for Prolog-style synthesis of proven results;
8407 * Pure: assumption method (an implicit finishing) now handles actual
8410 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8411 initial goal, declare "that" only as Pure intro (only for single
8412 steps); the "that" rule assumption may now be involved in implicit
8413 finishing, thus ".." becomes a feasible for trivial obtains;
8415 * Pure: default proof step now includes 'intro_classes'; thus trivial
8416 instance proofs may be performed by "..";
8418 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8421 * Pure: more robust selection of calculational rules;
8423 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8424 rule (as well as the assumption rule);
8426 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8427 lemmas, using the graph browser tool;
8429 * Pure: predict failure of "show" in interactive mode;
8431 * Pure: 'thms_containing' now takes actual terms as arguments;
8433 * HOL: improved method 'induct' --- now handles non-atomic goals
8434 (potential INCOMPATIBILITY); tuned error handling;
8436 * HOL: cases and induct rules now provide explicit hints about the
8437 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8438 any remaining facts are inserted into the goal verbatim;
8440 * HOL: local contexts (aka cases) may now contain term bindings as
8441 well; the 'cases' and 'induct' methods new provide a ?case binding for
8442 the result to be shown in each case;
8444 * HOL: added 'recdef_tc' command;
8446 * isatool convert assists in eliminating legacy ML scripts;
8451 * HOL/Library: a collection of generic theories to be used together
8452 with main HOL; the theory loader path already includes this directory
8453 by default; the following existing theories have been moved here:
8454 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8455 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8457 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8458 modelling and verification task performed in Isabelle/HOL +
8459 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8461 * HOL/Algebra: special summation operator SUM no longer exists, it has
8462 been replaced by setsum; infix 'assoc' now has priority 50 (like
8463 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8464 'domain', this makes the theory consistent with mathematical
8467 * HOL basics: added overloaded operations "inverse" and "divide"
8468 (infix "/"), syntax for generic "abs" operation, generic summation
8471 * HOL/typedef: simplified package, provide more useful rules (see also
8474 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8475 now expressed as a proper nested rule (old-style tactic scripts may
8476 require atomize_strip_tac to cope with non-atomic premises);
8478 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8479 to "split_conv" (old name still available for compatibility);
8481 * HOL: improved concrete syntax for strings (e.g. allows translation
8482 rules with string literals);
8484 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8485 and Fleuriot's mechanization of analysis, including the transcendental
8486 functions for the reals;
8488 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8493 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8494 "lam" is displayed as TWO lambda-symbols
8496 * CTT: theory Main now available, containing everything (that is, Bool
8502 * Pure: the Simplifier has been implemented properly as a derived rule
8503 outside of the actual kernel (at last!); the overall performance
8504 penalty in practical applications is about 50%, while reliability of
8505 the Isabelle inference kernel has been greatly improved;
8507 * print modes "brackets" and "no_brackets" control output of nested =>
8508 (types) and ==> (props); the default behaviour is "brackets";
8510 * Provers: fast_tac (and friends) now handle actual object-logic rules
8511 as assumptions as well;
8513 * system: support Poly/ML 4.0;
8515 * system: isatool install handles KDE version 1 or 2;
8519 New in Isabelle99-1 (October 2000)
8520 ----------------------------------
8522 *** Overview of INCOMPATIBILITIES ***
8524 * HOL: simplification of natural numbers is much changed; to partly
8525 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
8526 issue the following ML commands:
8528 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
8529 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
8531 * HOL: simplification no longer dives into case-expressions; this is
8532 controlled by "t.weak_case_cong" for each datatype t;
8534 * HOL: nat_less_induct renamed to less_induct;
8536 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
8537 fixsome to patch .thy and .ML sources automatically;
8539 select_equality -> some_equality
8540 select_eq_Ex -> some_eq_ex
8541 selectI2EX -> someI2_ex
8544 select1_equality -> some1_equality
8545 Eps_sym_eq -> some_sym_eq_trivial
8546 Eps_eq -> some_eq_trivial
8548 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
8550 * HOL: removed obsolete theorem binding expand_if (refer to split_if
8553 * HOL: the recursion equations generated by 'recdef' are now called
8554 f.simps instead of f.rules;
8556 * HOL: qed_spec_mp now also handles bounded ALL as well;
8558 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
8559 sometimes be needed;
8561 * HOL: the constant for "f``x" is now "image" rather than "op ``";
8563 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
8565 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
8566 product is now "<*>" instead of "Times"; the lexicographic product is
8567 now "<*lex*>" instead of "**";
8569 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8570 of main HOL, but was unused); better use HOL's datatype package;
8572 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8573 the old syntax may be recovered as follows:
8576 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8577 (infixl "\\<oplus>" 100)
8579 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8581 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8582 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8585 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8586 changed from A/r to A//r;
8588 * ZF: new treatment of arithmetic (nat & int) may break some old
8591 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8592 rulify -> rule_format, elimify -> elim_format, ...);
8594 * Isar/Provers: intro/elim/dest attributes changed; renamed
8595 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8596 should have to change intro!! to intro? only); replaced "delrule" by
8599 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8601 * Provers: strengthened force_tac by using new first_best_tac;
8603 * LaTeX document preparation: several changes of isabelle.sty (see
8607 *** Document preparation ***
8609 * formal comments (text blocks etc.) in new-style theories may now
8610 contain antiquotations of thm/prop/term/typ/text to be presented
8611 according to latex print mode; concrete syntax is like this:
8612 @{term[show_types] "f(x) = a + x"};
8614 * isatool mkdir provides easy setup of Isabelle session directories,
8615 including proper document sources;
8617 * generated LaTeX sources are now deleted after successful run
8618 (isatool document -c); may retain a copy somewhere else via -D option
8621 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8622 style files, achieving self-contained LaTeX sources and simplifying
8625 * old-style theories now produce (crude) LaTeX output as well;
8627 * browser info session directories are now self-contained (may be put
8628 on WWW server seperately); improved graphs of nested sessions; removed
8629 graph for 'all sessions';
8631 * several improvements in isabelle style files; \isabellestyle{it}
8632 produces fake math mode output; \isamarkupheader is now \section by
8633 default; see lib/texinputs/isabelle.sty etc.;
8638 * Isar/Pure: local results and corresponding term bindings are now
8639 subject to Hindley-Milner polymorphism (similar to ML); this
8640 accommodates incremental type-inference very nicely;
8642 * Isar/Pure: new derived language element 'obtain' supports
8643 generalized existence reasoning;
8645 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8646 support accumulation of results, without applying any rules yet;
8647 useful to collect intermediate results without explicit name
8648 references, and for use with transitivity rules with more than 2
8651 * Isar/Pure: scalable support for case-analysis type proofs: new
8652 'case' language element refers to local contexts symbolically, as
8653 produced by certain proof methods; internally, case names are attached
8654 to theorems as "tags";
8656 * Isar/Pure: theory command 'hide' removes declarations from
8657 class/type/const name spaces;
8659 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8660 indicate potential overloading;
8662 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8664 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8665 "{a,b,c}" instead of {a,b,c};
8667 * Isar/Pure now provides its own version of intro/elim/dest
8668 attributes; useful for building new logics, but beware of confusion
8669 with the version in Provers/classical;
8671 * Isar/Pure: the local context of (non-atomic) goals is provided via
8672 case name 'antecedent';
8674 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8675 to the current context is now done automatically);
8677 * Isar/Pure: theory command 'method_setup' provides a simple interface
8678 for definining proof methods in ML;
8680 * Isar/Provers: intro/elim/dest attributes changed; renamed
8681 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8682 most cases, one should have to change intro!! to intro? only);
8683 replaced "delrule" by "rule del";
8685 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8686 'symmetric' attribute (the latter supercedes [RS sym]);
8688 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8689 method modifier); 'simp' method: 'only:' modifier removes loopers as
8690 well (including splits);
8692 * Isar/Provers: Simplifier and Classical methods now support all kind
8693 of modifiers used in the past, including 'cong', 'iff', etc.
8695 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8696 of Simplifier and Classical reasoner);
8698 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8699 now support named cases; major packages (inductive, datatype, primrec,
8700 recdef) support case names and properly name parameters;
8702 * Isar/HOL: new transitivity rules for substitution in inequalities --
8703 monotonicity conditions are extracted to be proven at end of
8706 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8709 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8710 split_if split_if_asm; datatype package provides theorems foo.splits =
8711 foo.split foo.split_asm for each datatype;
8713 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8714 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8715 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8716 use "(cases (simplified))" method in proper proof texts);
8718 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8720 * Isar: names of theorems etc. may be natural numbers as well;
8722 * Isar: 'pr' command: optional arguments for goals_limit and
8723 ProofContext.prems_limit; no longer prints theory contexts, but only
8726 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8727 additional print modes to be specified; e.g. "pr(latex)" will print
8728 proof state according to the Isabelle LaTeX style;
8730 * Isar: improved support for emulating tactic scripts, including proof
8731 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8732 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8733 (for HOL datatypes);
8735 * Isar: simplified (more robust) goal selection of proof methods: 1st
8736 goal, all goals, or explicit goal specifier (tactic emulation); thus
8737 'proof method scripts' have to be in depth-first order;
8739 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8741 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8742 should instead use individual commands for printing items
8743 (print_commands, print_methods etc.);
8745 * Isar: added 'nothing' --- the empty list of theorems;
8750 * HOL/MicroJava: formalization of a fragment of Java, together with a
8751 corresponding virtual machine and a specification of its bytecode
8752 verifier and a lightweight bytecode verifier, including proofs of
8753 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8754 Cornelia Pusch (see also the homepage of project Bali at
8755 http://isabelle.in.tum.de/Bali/);
8757 * HOL/Algebra: new theory of rings and univariate polynomials, by
8760 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8761 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8764 * HOL/Lattice: fundamental concepts of lattice theory and order
8765 structures, including duals, properties of bounds versus algebraic
8766 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8767 Theorem for complete lattices etc.; may also serve as a demonstration
8768 for abstract algebraic reasoning using axiomatic type classes, and
8769 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8771 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8774 * HOL/IMPP: extension of IMP with local variables and mutually
8775 recursive procedures, by David von Oheimb;
8777 * HOL/Lambda: converted into new-style theory and document;
8779 * HOL/ex/Multiquote: example of multiple nested quotations and
8780 anti-quotations -- basically a generalized version of de-Bruijn
8781 representation; very useful in avoiding lifting of operations;
8783 * HOL/record: added general record equality rule to simpset; fixed
8784 select-update simplification procedure to handle extended records as
8785 well; admit "r" as field name;
8787 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8788 other numeric types and also as the identity of groups, rings, etc.;
8790 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8791 Types nat and int belong to this axclass;
8793 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8794 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8795 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8796 two terms #m*u and #n*u are replaced by #(m+n)*u
8797 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8798 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8799 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8801 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8802 powerful prover for predicate logic but knows nothing of clasets; see
8803 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8805 * HOL: new version of "case_tac" subsumes both boolean case split and
8806 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8807 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8809 * HOL: simplification no longer dives into case-expressions: only the
8810 selector expression is simplified, but not the remaining arms; to
8811 enable full simplification of case-expressions for datatype t, you may
8812 remove t.weak_case_cong from the simpset, either globally (Delcongs
8813 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8815 * HOL/recdef: the recursion equations generated by 'recdef' for
8816 function 'f' are now called f.simps instead of f.rules; if all
8817 termination conditions are proved automatically, these simplification
8818 rules are added to the simpset, as in primrec; rules may be named
8819 individually as well, resulting in a separate list of theorems for
8822 * HOL/While is a new theory that provides a while-combinator. It
8823 permits the definition of tail-recursive functions without the
8824 provision of a termination measure. The latter is necessary once the
8825 invariant proof rule for while is applied.
8827 * HOL: new (overloaded) notation for the set of elements below/above
8828 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8830 * HOL: theorems impI, allI, ballI bound as "strip";
8832 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8833 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8834 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8836 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8838 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8839 main HOL, but was unused);
8841 * HOL: fewer consts declared as global (e.g. have to refer to
8842 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8844 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8845 in case of overlap with user translations (e.g. judgements over
8846 tuples); (note that the underlying logical represenation is still
8852 * ZF: simplification automatically cancels common terms in arithmetic
8853 expressions over nat and int;
8855 * ZF: new treatment of nat to minimize type-checking: all operators
8856 coerce their operands to a natural number using the function natify,
8857 making the algebraic laws unconditional;
8859 * ZF: as above, for int: operators coerce their operands to an integer
8860 using the function intify;
8862 * ZF: the integer library now contains many of the usual laws for the
8863 orderings, including $<=, and monotonicity laws for $+ and $*;
8865 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8868 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8869 to the simplifier and classical reasoner simultaneously;
8874 * Provers: blast_tac now handles actual object-logic rules as
8875 assumptions; note that auto_tac uses blast_tac internally as well;
8877 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8878 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8880 * Provers: delrules now handles destruct rules as well (no longer need
8881 explicit make_elim);
8883 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8884 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8885 use instead the strong form,
8886 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8887 in HOL, FOL and ZF the function cla_make_elim will create such rules
8888 from destruct-rules;
8890 * Provers: Simplifier.easy_setup provides a fast path to basic
8891 Simplifier setup for new object-logics;
8893 * Pure: AST translation rules no longer require constant head on LHS;
8895 * Pure: improved name spaces: ambiguous output is qualified; support
8896 for hiding of names;
8898 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8899 XSYMBOL_HOME; no longer need to do manual configuration in most
8902 * system: compression of ML heaps images may now be controlled via -c
8903 option of isabelle and isatool usedir (currently only observed by
8906 * system: isatool installfonts may handle X-Symbol fonts as well (very
8907 useful for remote X11);
8909 * system: provide TAGS file for Isabelle sources;
8911 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8914 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8915 timing flag supersedes proof_timing and Toplevel.trace;
8917 * ML: new combinators |>> and |>>> for incremental transformations
8918 with secondary results (e.g. certain theory extensions):
8920 * ML: PureThy.add_defs gets additional argument to indicate potential
8921 overloading (usually false);
8923 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
8928 New in Isabelle99 (October 1999)
8929 --------------------------------
8931 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8933 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
8934 are no longer simplified. (This allows the simplifier to unfold recursive
8935 functional programs.) To restore the old behaviour, declare
8937 Delcongs [if_weak_cong];
8939 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
8942 * HOL: the predicate "inj" is now defined by translation to "inj_on";
8944 * HOL/datatype: mutual_induct_tac no longer exists --
8945 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
8947 * HOL/typedef: fixed type inference for representing set; type
8948 arguments now have to occur explicitly on the rhs as type constraints;
8950 * ZF: The con_defs part of an inductive definition may no longer refer
8951 to constants declared in the same theory;
8953 * HOL, ZF: the function mk_cases, generated by the inductive
8954 definition package, has lost an argument. To simplify its result, it
8955 uses the default simpset instead of a supplied list of theorems.
8957 * HOL/List: the constructors of type list are now Nil and Cons;
8959 * Simplifier: the type of the infix ML functions
8960 setSSolver addSSolver setSolver addSolver
8961 is now simpset * solver -> simpset where `solver' is a new abstract type
8962 for packaging solvers. A solver is created via
8963 mk_solver: string -> (thm list -> int -> tactic) -> solver
8964 where the string argument is only a comment.
8969 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
8970 decision procedure for linear arithmetic. Currently it is used for
8971 types `nat', `int', and `real' in HOL (see below); it can, should and
8972 will be instantiated for other types and logics as well.
8974 * The simplifier now accepts rewrite rules with flexible heads, eg
8975 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
8976 They are applied like any rule with a non-pattern lhs, i.e. by first-order
8982 * New Isabelle/Isar subsystem provides an alternative to traditional
8983 tactical theorem proving; together with the ProofGeneral/isar user
8984 interface it offers an interactive environment for developing human
8985 readable proof documents (Isar == Intelligible semi-automated
8986 reasoning); for further information see isatool doc isar-ref,
8987 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
8989 * improved and simplified presentation of theories: better HTML markup
8990 (including colors), graph views in several sizes; isatool usedir now
8991 provides a proper interface for user theories (via -P option); actual
8992 document preparation based on (PDF)LaTeX is available as well (for
8993 new-style theories only); see isatool doc system for more information;
8995 * native support for Proof General, both for classic Isabelle and
8998 * ML function thm_deps visualizes dependencies of theorems and lemmas,
8999 using the graph browser tool;
9001 * Isabelle manuals now also available as PDF;
9003 * theory loader rewritten from scratch (may not be fully
9004 bug-compatible); old loadpath variable has been replaced by show_path,
9005 add_path, del_path, reset_path functions; new operations such as
9006 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9009 * improved isatool install: option -k creates KDE application icon,
9010 option -p DIR installs standalone binaries;
9012 * added ML_PLATFORM setting (useful for cross-platform installations);
9013 more robust handling of platform specific ML images for SML/NJ;
9015 * the settings environment is now statically scoped, i.e. it is never
9016 created again in sub-processes invoked from isabelle, isatool, or
9019 * path element specification '~~' refers to '$ISABELLE_HOME';
9021 * in locales, the "assumes" and "defines" parts may be omitted if
9024 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9027 * new print_mode "HTML";
9029 * new flag show_tags controls display of tags of theorems (which are
9030 basically just comments that may be attached by some tools);
9032 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9033 mode and goal output format:
9035 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9037 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9039 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9040 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9042 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9044 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9046 * function bind_thms stores lists of theorems (cf. bind_thm);
9048 * new shorthand tactics ftac, eatac, datac, fatac;
9050 * qed (and friends) now accept "" as result name; in that case the
9051 theorem is not stored, but proper checks and presentation of the
9054 * theorem database now also indexes constants "Trueprop", "all",
9055 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9060 ** HOL arithmetic **
9062 * There are now decision procedures for linear arithmetic over nat and
9065 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9066 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9067 are treated as atomic; subformulae not involving type `nat' or `int'
9068 are ignored; quantified subformulae are ignored unless they are
9069 positive universal or negative existential. The tactic has to be
9070 invoked by hand and can be a little bit slow. In particular, the
9071 running time is exponential in the number of occurrences of `min' and
9072 `max', and `-' on `nat'.
9074 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9075 (negated) (in)equalities among the premises and the conclusion into
9076 account (i.e. no compound formulae) and does not know about `min' and
9077 `max', and `-' on `nat'. It is fast and is used automatically by the
9080 NB: At the moment, these decision procedures do not cope with mixed
9081 nat/int formulae where the two parts interact, such as `m < n ==>
9084 * HOL/Numeral provides a generic theory of numerals (encoded
9085 efficiently as bit strings); setup for types nat/int/real is in place;
9086 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9087 int, existing theories and proof scripts may require a few additional
9090 * integer division and remainder can now be performed on constant
9093 * many properties of integer multiplication, division and remainder
9096 * An interface to the Stanford Validity Checker (SVC) is available through the
9097 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9098 are proved automatically. SVC must be installed separately, and its results
9099 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9100 invocation of the underlying oracle). For SVC see
9101 http://verify.stanford.edu/SVC
9103 * IsaMakefile: the HOL-Real target now builds an actual image;
9108 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9109 (in Isabelle/Isar) -- by Gertrud Bauer;
9111 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9112 analysis for assembly languages with subtypes;
9114 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9115 -- avoids syntactic ambiguities and treats state, transition, and
9116 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9117 changed syntax and (many) tactics;
9119 * HOL/inductive: Now also handles more general introduction rules such
9120 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9121 theorems are now maintained within the theory (maintained via the
9124 * HOL/datatype: Now also handles arbitrarily branching datatypes
9125 (using function types) such as
9127 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9129 * HOL/record: record_simproc (part of the default simpset) takes care
9130 of selectors applied to updated records; record_split_tac is no longer
9131 part of the default claset; update_defs may now be removed from the
9132 simpset in many cases; COMPATIBILITY: old behavior achieved by
9134 claset_ref () := claset() addSWrapper record_split_wrapper;
9135 Delsimprocs [record_simproc]
9137 * HOL/typedef: fixed type inference for representing set; type
9138 arguments now have to occur explicitly on the rhs as type constraints;
9140 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9141 names rather than an ML expression;
9143 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9144 supplied later. Program schemes can be defined, such as
9145 "While B C s = (if B s then While B C (C s) else s)"
9146 where the well-founded relation can be chosen after B and C have been given.
9148 * HOL/List: the constructors of type list are now Nil and Cons;
9149 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9150 course, ML tools referring to List.list.op # etc. have to be adapted;
9152 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9153 disabled by default; run isabelle with option -m HOL to get back to
9154 the original Gordon/HOL-style output;
9156 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9157 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9159 * HOL basic syntax simplified (more orthogonal): all variants of
9160 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9161 Eps operator is provided as well: "SOME x. P[x]";
9163 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9165 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9166 thus available for user theories;
9168 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9169 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9172 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9173 several times and then mp;
9178 * the notation <<...>> is now available as a notation for sequences of
9181 * the simplifier is now installed
9183 * the axiom system has been generalized (thanks to Soren Heilmann)
9185 * the classical reasoner now has a default rule database
9190 * new primrec section allows primitive recursive functions to be given
9191 directly (as in HOL) over datatypes and the natural numbers;
9193 * new tactics induct_tac and exhaust_tac for induction (or case
9194 analysis) over datatypes and the natural numbers;
9196 * the datatype declaration of type T now defines the recursor T_rec;
9198 * simplification automatically does freeness reasoning for datatype
9201 * automatic type-inference, with AddTCs command to insert new
9202 type-checking rules;
9204 * datatype introduction rules are now added as Safe Introduction rules
9207 * the syntax "if P then x else y" is now available in addition to
9211 *** Internal programming interfaces ***
9213 * tuned simplifier trace output; new flag debug_simp;
9215 * structures Vartab / Termtab (instances of TableFun) offer efficient
9216 tables indexed by indexname_ord / term_ord (compatible with aconv);
9218 * AxClass.axclass_tac lost the theory argument;
9220 * tuned current_goals_markers semantics: begin / end goal avoids
9221 printing empty lines;
9223 * removed prs and prs_fn hook, which was broken because it did not
9224 include \n in its semantics, forcing writeln to add one
9225 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9226 string -> unit if you really want to output text without newline;
9228 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9229 plain output, interface builders may have to enable 'isabelle_font'
9230 mode to get Isabelle font glyphs as before;
9232 * refined token_translation interface; INCOMPATIBILITY: output length
9233 now of type real instead of int;
9235 * theory loader actions may be traced via new ThyInfo.add_hook
9236 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9237 your own database of information attached to *whole* theories -- as
9238 opposed to intra-theory data slots offered via TheoryDataFun;
9240 * proper handling of dangling sort hypotheses (at last!);
9241 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9242 extra sort hypotheses that can be witnessed from the type signature;
9243 the force_strip_shyps flag is gone, any remaining shyps are simply
9244 left in the theorem (with a warning issued by strip_shyps_warning);
9248 New in Isabelle98-1 (October 1998)
9249 ----------------------------------
9251 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9253 * several changes of automated proof tools;
9255 * HOL: major changes to the inductive and datatype packages, including
9256 some minor incompatibilities of theory syntax;
9258 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9261 * HOL: removed duplicate thms in Arith:
9262 less_imp_add_less should be replaced by trans_less_add1
9263 le_imp_add_le should be replaced by trans_le_add1
9265 * HOL: unary minus is now overloaded (new type constraints may be
9268 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9269 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9270 now taken as an integer constant.
9272 * Pure: ML function 'theory_of' renamed to 'theory';
9278 1. Asm_full_simp_tac is now more aggressive.
9279 1. It will sometimes reorient premises if that increases their power to
9281 2. It does no longer proceed strictly from left to right but may also
9282 rotate premises to achieve further simplification.
9283 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9284 old Asm_full_simp_tac in that it does not rotate premises.
9285 2. The simplifier now knows a little bit about nat-arithmetic.
9287 * Classical reasoner: wrapper mechanism for the classical reasoner now
9288 allows for selected deletion of wrappers, by introduction of names for
9289 wrapper functionals. This implies that addbefore, addSbefore,
9290 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9291 and that adding two tactics with the same name overwrites the first
9292 one (emitting a warning).
9293 type wrapper = (int -> tactic) -> (int -> tactic)
9294 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9295 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9296 delWrapper, delSWrapper: claset * string -> claset
9297 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9299 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9300 semantics; addbefore now affects only the unsafe part of step_tac
9301 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9302 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9305 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9306 compWrapper; added safe wrapper (and access functions for it);
9308 * HOL/split_all_tac is now much faster and fails if there is nothing
9309 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9310 and the names of the automatically generated variables have changed.
9311 split_all_tac has moved within claset() from unsafe wrappers to safe
9312 wrappers, which means that !!-bound variables are split much more
9313 aggressively, and safe_tac and clarify_tac now split such variables.
9314 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9315 Note: the same holds for record_split_tac, which does the job of
9316 split_all_tac for record fields.
9318 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9319 permanently to the default simpset using Addsplits just like
9320 Addsimps. They can be removed via Delsplits just like
9321 Delsimps. Lower-case versions are also available.
9323 * HOL/Simplifier: The rule split_if is now part of the default
9324 simpset. This means that the simplifier will eliminate all occurrences
9325 of if-then-else in the conclusion of a goal. To prevent this, you can
9326 either remove split_if completely from the default simpset by
9327 `Delsplits [split_if]' or remove it in a specific call of the
9328 simplifier using `... delsplits [split_if]'. You can also add/delete
9329 other case splitting rules to/from the default simpset: every datatype
9330 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9331 t is the name of the datatype).
9333 * Classical reasoner / Simplifier combination: new force_tac (and
9334 derivatives Force_tac, force) combines rewriting and classical
9335 reasoning (and whatever other tools) similarly to auto_tac, but is
9336 aimed to solve the given subgoal completely.
9341 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9342 and `goalw': the theory is no longer needed as an explicit argument -
9343 the current theory context is used; assumptions are no longer returned
9344 at the ML-level unless one of them starts with ==> or !!; it is
9345 recommended to convert to these new commands using isatool fixgoal
9346 (backup your sources first!);
9348 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9349 the current theory context, and 'theory' to lookup stored theories;
9351 * new theory section 'locale' for declaring constants, assumptions and
9352 definitions that have local scope;
9354 * new theory section 'nonterminals' for purely syntactic types;
9356 * new theory section 'setup' for generic ML setup functions
9357 (e.g. package initialization);
9359 * the distribution now includes Isabelle icons: see
9360 lib/logo/isabelle-{small,tiny}.xpm;
9362 * isatool install - install binaries with absolute references to
9365 * isatool logo -- create instances of the Isabelle logo (as EPS);
9367 * print mode 'emacs' reserved for Isamode;
9369 * support multiple print (ast) translations per constant name;
9371 * theorems involving oracles are now printed with a suffixed [!];
9376 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9378 * HOL/inductive package reorganized and improved: now supports mutual
9384 oddI "n : EVEN ==> Suc n : ODD"
9385 evenI "n : ODD ==> Suc n : EVEN"
9387 new theorem list "elims" contains an elimination rule for each of the
9388 recursive sets; inductive definitions now handle disjunctive premises
9389 correctly (also ZF);
9391 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9392 "mutual_induct" no longer exists - the induction rule is always
9393 contained in "induct";
9396 * HOL/datatype package re-implemented and greatly improved: now
9397 supports mutually recursive datatypes such as
9400 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9401 | SUM ('a aexp) ('a aexp)
9402 | DIFF ('a aexp) ('a aexp)
9405 'a bexp = LESS ('a aexp) ('a aexp)
9406 | AND ('a bexp) ('a bexp)
9407 | OR ('a bexp) ('a bexp)
9409 as well as indirectly recursive datatypes such as
9412 ('a, 'b) term = Var 'a
9413 | App 'b ((('a, 'b) term) list)
9415 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9416 induction on mutually / indirectly recursive datatypes.
9418 Primrec equations are now stored in theory and can be accessed via
9419 <function_name>.simps.
9423 - Theories using datatypes must now have theory Datatype as an
9425 - The specific <typename>.induct_tac no longer exists - use the
9426 generic induct_tac instead.
9427 - natE has been renamed to nat.exhaust - use exhaust_tac
9428 instead of res_inst_tac ... natE. Note that the variable
9429 names in nat.exhaust differ from the names in natE, this
9430 may cause some "fragile" proofs to fail.
9431 - The theorems split_<typename>_case and split_<typename>_case_asm
9432 have been renamed to <typename>.split and <typename>.split_asm.
9433 - Since default sorts of type variables are now handled correctly,
9434 some datatype definitions may have to be annotated with explicit
9436 - Primrec definitions no longer require function name and type
9437 of recursive argument.
9439 Consider using isatool fixdatatype to adapt your theories and proof
9440 scripts to the new package (backup your sources first!).
9443 * HOL/record package: considerably improved implementation; now
9444 includes concrete syntax for record types, terms, updates; theorems
9445 for surjective pairing and splitting !!-bound record variables; proof
9446 support is as follows:
9448 1) standard conversions (selectors or updates applied to record
9449 constructor terms) are part of the standard simpset;
9451 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9452 made part of standard simpset and claset via addIffs;
9454 3) a tactic for record field splitting (record_split_tac) is part of
9455 the standard claset (addSWrapper);
9457 To get a better idea about these rules you may retrieve them via
9458 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9459 the name of your record type.
9461 The split tactic 3) conceptually simplifies by the following rule:
9463 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9465 Thus any record variable that is bound by meta-all will automatically
9466 blow up into some record constructor term, consequently the
9467 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9468 solve record problems automatically.
9471 * reorganized the main HOL image: HOL/Integ and String loaded by
9472 default; theory Main includes everything;
9474 * automatic simplification of integer sums and comparisons, using cancellation;
9476 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9478 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9480 * many new identities for unions, intersections, set difference, etc.;
9482 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9483 called split_if, split_split, split_sum_case and split_nat_case (to go
9484 with add/delsplits);
9486 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9487 (?x::unit) = (); this is made part of the default simpset, which COULD
9488 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9489 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9490 unit_abs_eta_conv is added in order to counter the effect of
9491 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9494 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9497 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9498 It and 'sym RS equals0D' are now in the default claset, giving automatic
9499 disjointness reasoning but breaking a few old proofs.
9501 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9502 to 'converse' from 'inverse' (for compatibility with ZF and some
9505 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9506 the well-founded relation;
9508 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9509 Compl A. The "Compl" syntax remains available as input syntax for this
9512 * HOL/Update: new theory of function updates:
9513 f(a:=b) == %x. if x=a then b else f x
9514 may also be iterated as in f(a:=b,c:=d,...);
9516 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
9519 - new function list_update written xs[i:=v] that updates the i-th
9520 list position. May also be iterated as in xs[i:=a,j:=b,...].
9521 - new function `upt' written [i..j(] which generates the list
9522 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
9523 bound write [i..j], which is a shorthand for [i..j+1(].
9524 - new lexicographic orderings and corresponding wellfoundedness theorems.
9527 - removed 'pred' (predecessor) function;
9528 - generalized some theorems about n-1;
9529 - many new laws about "div" and "mod";
9530 - new laws about greatest common divisors (see theory ex/Primes);
9532 * HOL/Relation: renamed the relational operator r^-1 "converse"
9533 instead of "inverse";
9535 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
9536 of the multiset ordering;
9538 * directory HOL/Real: a construction of the reals using Dedekind cuts
9539 (not included by default);
9541 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
9543 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
9544 programs, i.e. different program variables may have different types.
9546 * calling (stac rew i) now fails if "rew" has no effect on the goal
9547 [previously, this check worked only if the rewrite rule was unconditional]
9548 Now rew can involve either definitions or equalities (either == or =).
9553 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
9554 only the theorems proved on ZF.ML;
9556 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9557 It and 'sym RS equals0D' are now in the default claset, giving automatic
9558 disjointness reasoning but breaking a few old proofs.
9560 * ZF/Update: new theory of function updates
9561 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
9562 may also be iterated as in f(a:=b,c:=d,...);
9564 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
9566 * calling (stac rew i) now fails if "rew" has no effect on the goal
9567 [previously, this check worked only if the rewrite rule was unconditional]
9568 Now rew can involve either definitions or equalities (either == or =).
9570 * case_tac provided for compatibility with HOL
9571 (like the old excluded_middle_tac, but with subgoals swapped)
9574 *** Internal programming interfaces ***
9576 * Pure: several new basic modules made available for general use, see
9577 also src/Pure/README;
9579 * improved the theory data mechanism to support encapsulation (data
9580 kind name replaced by private Object.kind, acting as authorization
9581 key); new type-safe user interface via functor TheoryDataFun; generic
9582 print_data function becomes basically useless;
9584 * removed global_names compatibility flag -- all theory declarations
9585 are qualified by default;
9587 * module Pure/Syntax now offers quote / antiquote translation
9588 functions (useful for Hoare logic etc. with implicit dependencies);
9589 see HOL/ex/Antiquote for an example use;
9591 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9594 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9597 * Display.print_goals function moved to Locale.print_goals;
9599 * standard print function for goals supports current_goals_markers
9600 variable for marking begin of proof, end of proof, start of goal; the
9601 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9602 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9607 New in Isabelle98 (January 1998)
9608 --------------------------------
9610 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9612 * changed lexical syntax of terms / types: dots made part of long
9613 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9615 * simpset (and claset) reference variable replaced by functions
9616 simpset / simpset_ref;
9618 * no longer supports theory aliases (via merge) and non-trivial
9619 implicit merge of thms' signatures;
9621 * most internal names of constants changed due to qualified names;
9623 * changed Pure/Sequence interface (see Pure/seq.ML);
9626 *** General Changes ***
9628 * hierachically structured name spaces (for consts, types, axms, thms
9629 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9630 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9631 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9632 long_names for fully qualified output names; NOTE: ML programs
9633 (special tactics, packages etc.) referring to internal names may have
9634 to be adapted to cope with fully qualified names; in case of severe
9635 backward campatibility problems try setting 'global_names' at compile
9636 time to have enrything declared within a flat name space; one may also
9637 fine tune name declarations in theories via the 'global' and 'local'
9640 * reimplemented the implicit simpset and claset using the new anytype
9641 data filed in signatures; references simpset:simpset ref etc. are
9642 replaced by functions simpset:unit->simpset and
9643 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9644 to patch your ML files accordingly;
9646 * HTML output now includes theory graph data for display with Java
9647 applet or isatool browser; data generated automatically via isatool
9648 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9650 * defs may now be conditional; improved rewrite_goals_tac to handle
9651 conditional equations;
9653 * defs now admits additional type arguments, using TYPE('a) syntax;
9655 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9656 creates a new theory node; implicit merge of thms' signatures is
9657 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9658 transfer:theory->thm->thm in (rare) cases;
9660 * improved handling of draft signatures / theories; draft thms (and
9661 ctyps, cterms) are automatically promoted to real ones;
9663 * slightly changed interfaces for oracles: admit many per theory, named
9664 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9666 * print_goals: optional output of const types (set show_consts and
9669 * improved output of warnings (###) and errors (***);
9671 * subgoal_tac displays a warning if the new subgoal has type variables;
9673 * removed old README and Makefiles;
9675 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9677 * removed obsolete init_pps and init_database;
9679 * deleted the obsolete tactical STATE, which was declared by
9680 fun STATE tacfun st = tacfun st st;
9682 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9683 (which abbreviates $HOME);
9685 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9686 use isatool fixseq to adapt your ML programs (this works for fully
9687 qualified references to the Sequence structure only!);
9689 * use_thy no longer requires writable current directory; it always
9690 reloads .ML *and* .thy file, if either one is out of date;
9693 *** Classical Reasoner ***
9695 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9696 tactics that use classical reasoning to simplify a subgoal without
9697 splitting it into several subgoals;
9699 * Safe_tac: like safe_tac but uses the default claset;
9704 * added simplification meta rules:
9705 (asm_)(full_)simplify: simpset -> thm -> thm;
9707 * simplifier.ML no longer part of Pure -- has to be loaded by object
9710 * added prems argument to simplification procedures;
9712 * HOL, FOL, ZF: added infix function `addsplits':
9713 instead of `<simpset> setloop (split_tac <thms>)'
9714 you can simply write `<simpset> addsplits <thms>'
9719 * TYPE('a) syntax for type reflection terms;
9721 * no longer handles consts with name "" -- declare as 'syntax' instead;
9723 * pretty printer: changed order of mixfix annotation preference (again!);
9725 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9730 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9731 with `addloop' of the simplifier to faciliate case splitting in premises.
9733 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9735 * HOL/Auth: new protocol proofs including some for the Internet
9738 * HOL/Map: new theory of `maps' a la VDM;
9740 * HOL/simplifier: simplification procedures nat_cancel_sums for
9741 cancelling out common nat summands from =, <, <= (in)equalities, or
9742 differences; simplification procedures nat_cancel_factor for
9743 cancelling common factor from =, <, <= (in)equalities over natural
9744 sums; nat_cancel contains both kinds of procedures, it is installed by
9745 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9747 * HOL/simplifier: terms of the form
9748 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9750 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9751 and those of the form
9752 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9754 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9757 Each datatype `t' now comes with a theorem `split_t_case' of the form
9759 P(t_case f1 ... fn x) =
9760 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9762 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9765 and a theorem `split_t_case_asm' of the form
9767 P(t_case f1 ... fn x) =
9768 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9770 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9772 which can be added to a simpset via `addsplits'. The existing theorems
9773 expand_list_case and expand_option_case have been renamed to
9774 split_list_case and split_option_case.
9777 - `pred n' is automatically converted to `n-1'.
9778 Users are strongly encouraged not to use `pred' any longer,
9779 because it will disappear altogether at some point.
9780 - Users are strongly encouraged to write "0 < n" rather than
9781 "n ~= 0". Theorems and proof tools have been modified towards this
9785 the function "set_of_list" has been renamed "set" (and its theorems too);
9786 the function "nth" now takes its arguments in the reverse order and
9787 has acquired the infix notation "!" as in "xs!n".
9789 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9791 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9792 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9794 * HOL/record: extensible records with schematic structural subtyping
9795 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9796 still lacks various theorems and concrete record syntax;
9801 * removed "axioms" and "generated by" sections;
9803 * replaced "ops" section by extended "consts" section, which is capable of
9804 handling the continuous function space "->" directly;
9807 . proves theorems immediately and stores them in the theory,
9808 . creates hierachical name space,
9809 . now uses normal mixfix annotations (instead of cinfix...),
9810 . minor changes to some names and values (for consistency),
9811 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9812 . separator between mutual domain defs: changed "," to "and",
9813 . improved handling of sort constraints; now they have to
9814 appear on the left-hand side of the equations only;
9816 * fixed LAM <x,y,zs>.b syntax;
9818 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9819 adm (%x. P (t x)), where P is chainfinite and t continuous;
9824 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9825 with `addloop' of the simplifier to faciliate case splitting in premises.
9827 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9828 in HOL, they strip ALL and --> from proved theorems;
9832 New in Isabelle94-8 (May 1997)
9833 ------------------------------
9835 *** General Changes ***
9837 * new utilities to build / run / maintain Isabelle etc. (in parts
9838 still somewhat experimental); old Makefiles etc. still functional;
9840 * new 'Isabelle System Manual';
9842 * INSTALL text, together with ./configure and ./build scripts;
9844 * reimplemented type inference for greater efficiency, better error
9845 messages and clean internal interface;
9847 * prlim command for dealing with lots of subgoals (an easier way of
9848 setting goals_limit);
9853 * supports alternative (named) syntax tables (parser and pretty
9854 printer); internal interface is provided by add_modesyntax(_i);
9856 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9857 be used in conjunction with the Isabelle symbol font; uses the
9858 "symbols" syntax table;
9860 * added token_translation interface (may translate name tokens in
9861 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9862 the current print_mode); IMPORTANT: user print translation functions
9863 are responsible for marking newly introduced bounds
9864 (Syntax.mark_boundT);
9866 * token translations for modes "xterm" and "xterm_color" that display
9867 names in bold, underline etc. or colors (which requires a color
9870 * infixes may now be declared with names independent of their syntax;
9872 * added typed_print_translation (like print_translation, but may
9873 access type of constant);
9876 *** Classical Reasoner ***
9878 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9879 some limitations. Blast_tac...
9880 + ignores addss, addbefore, addafter; this restriction is intrinsic
9881 + ignores elimination rules that don't have the correct format
9882 (the conclusion MUST be a formula variable)
9883 + ignores types, which can make HOL proofs fail
9884 + rules must not require higher-order unification, e.g. apply_type in ZF
9885 [message "Function Var's argument not a bound variable" relates to this]
9886 + its proof strategy is more general but can actually be slower
9888 * substitution with equality assumptions no longer permutes other
9891 * minor changes in semantics of addafter (now called addaltern); renamed
9892 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9893 (and access functions for it);
9895 * improved combination of classical reasoner and simplifier:
9896 + functions for handling clasimpsets
9897 + improvement of addss: now the simplifier is called _after_ the
9899 + safe variant of addss called addSss: uses safe simplifications
9900 _during_ the safe steps. It is more complete as it allows multiple
9901 instantiations of unknowns (e.g. with slow_tac).
9905 * added interface for simplification procedures (functions that
9906 produce *proven* rewrite rules on the fly, depending on current
9909 * ordering on terms as parameter (used for ordered rewriting);
9911 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9913 * the solver is now split into a safe and an unsafe part.
9914 This should be invisible for the normal user, except that the
9915 functions setsolver and addsolver have been renamed to setSolver and
9916 addSolver; added safe_asm_full_simp_tac;
9921 * a generic induction tactic `induct_tac' which works for all datatypes and
9922 also for type `nat';
9924 * a generic case distinction tactic `exhaust_tac' which works for all
9925 datatypes and also for type `nat';
9927 * each datatype comes with a function `size';
9929 * patterns in case expressions allow tuple patterns as arguments to
9930 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
9932 * primrec now also works with type nat;
9934 * recdef: a new declaration form, allows general recursive functions to be
9935 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
9937 * the constant for negation has been renamed from "not" to "Not" to
9938 harmonize with FOL, ZF, LK, etc.;
9940 * HOL/ex/LFilter theory of a corecursive "filter" functional for
9943 * HOL/Modelcheck demonstrates invocation of model checker oracle;
9945 * HOL/ex/Ring.thy declares cring_simp, which solves equational
9946 problems in commutative rings, using axiomatic type classes for + and *;
9948 * more examples in HOL/MiniML and HOL/Auth;
9950 * more default rewrite rules for quantifiers, union/intersection;
9952 * a new constant `arbitrary == @x.False';
9954 * HOLCF/IOA replaces old HOL/IOA;
9956 * HOLCF changes: derived all rules and arities
9957 + axiomatic type classes instead of classes
9958 + typedef instead of faking type definitions
9959 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
9960 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
9961 + eliminated the types void, one, tr
9962 + use unit lift and bool lift (with translations) instead of one and tr
9963 + eliminated blift from Lift3.thy (use Def instead of blift)
9964 all eliminated rules are derived as theorems --> no visible changes ;
9969 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
9970 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
9971 as ZF_cs addSIs [equalityI];
9975 New in Isabelle94-7 (November 96)
9976 ---------------------------------
9978 * allowing negative levels (as offsets) in prlev and choplev;
9980 * super-linear speedup for large simplifications;
9982 * FOL, ZF and HOL now use miniscoping: rewriting pushes
9983 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
9984 FAIL); can suppress it using the command Delsimps (ex_simps @
9985 all_simps); De Morgan laws are also now included, by default;
9987 * improved printing of ==> : ~:
9989 * new object-logic "Sequents" adds linear logic, while replacing LK
9990 and Modal (thanks to Sara Kalvala);
9992 * HOL/Auth: correctness proofs for authentication protocols;
9994 * HOL: new auto_tac combines rewriting and classical reasoning (many
9995 examples on HOL/Auth);
9997 * HOL: new command AddIffs for declaring theorems of the form P=Q to
9998 the rewriter and classical reasoner simultaneously;
10000 * function uresult no longer returns theorems in "standard" format;
10001 regain previous version by: val uresult = standard o uresult;
10005 New in Isabelle94-6
10006 -------------------
10008 * oracles -- these establish an interface between Isabelle and trusted
10009 external reasoners, which may deliver results as theorems;
10011 * proof objects (in particular record all uses of oracles);
10013 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10015 * "constdefs" section in theory files;
10017 * "primrec" section (HOL) no longer requires names;
10019 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10023 New in Isabelle94-5
10024 -------------------
10026 * reduced space requirements;
10028 * automatic HTML generation from theories;
10030 * theory files no longer require "..." (quotes) around most types;
10032 * new examples, including two proofs of the Church-Rosser theorem;
10034 * non-curried (1994) version of HOL is no longer distributed;
10038 New in Isabelle94-4
10039 -------------------
10041 * greatly reduced space requirements;
10043 * theory files (.thy) no longer require \...\ escapes at line breaks;
10045 * searchable theorem database (see the section "Retrieving theorems" on
10046 page 8 of the Reference Manual);
10048 * new examples, including Grabczewski's monumental case study of the
10051 * The previous version of HOL renamed to Old_HOL;
10053 * The new version of HOL (previously called CHOL) uses a curried syntax
10054 for functions. Application looks like f a b instead of f(a,b);
10056 * Mutually recursive inductive definitions finally work in HOL;
10058 * In ZF, pattern-matching on tuples is now available in all abstractions and
10059 translates to the operator "split";
10063 New in Isabelle94-3
10064 -------------------
10066 * new infix operator, addss, allowing the classical reasoner to
10067 perform simplification at each step of its search. Example:
10068 fast_tac (cs addss ss)
10070 * a new logic, CHOL, the same as HOL, but with a curried syntax
10071 for functions. Application looks like f a b instead of f(a,b). Also pairs
10072 look like (a,b) instead of <a,b>;
10074 * PLEASE NOTE: CHOL will eventually replace HOL!
10076 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10077 It translates to the operator "split". A new theory of integers is available;
10079 * In ZF, integer numerals now denote two's-complement binary integers.
10080 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10082 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10083 of the Axiom of Choice;
10087 New in Isabelle94-2
10088 -------------------
10090 * Significantly faster resolution;
10092 * the different sections in a .thy file can now be mixed and repeated
10095 * Database of theorems for FOL, HOL and ZF. New
10096 commands including qed, qed_goal and bind_thm store theorems in the database.
10098 * Simple database queries: return a named theorem (get_thm) or all theorems of
10099 a given theory (thms_of), or find out what theory a theorem was proved in
10102 * Bugs fixed in the inductive definition and datatype packages;
10104 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10105 and HOL_dup_cs obsolete;
10107 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10110 * Simpler definition of function space in ZF;
10112 * new results about cardinal and ordinal arithmetic in ZF;
10114 * 'subtype' facility in HOL for introducing new types as subsets of existing
10117 :mode=text:wrap=hard:maxLineLen=72: