1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
7 *** Prover IDE -- Isabelle/Scala/jEdit ***
9 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
10 Open text buffers take precedence over copies within the file-system.
15 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
18 * Fact generalization and consolidation:
19 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
22 * Purely algebraic definition of even. Fact generalization and consolidation:
23 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
24 even_zero_(nat|int) ~> even_zero
27 * Abolished neg_numeral.
28 * Canonical representation for minus one is "- 1".
29 * Canonical representation for other negative numbers is "- (numeral _)".
30 * When devising rule sets for number calculation, consider the
31 following canonical cases: 0, 1, numeral _, - 1, - numeral _.
32 * HOLogic.dest_number also recognizes numerals in non-canonical forms
33 like "numeral One", "- numeral One", "- 0" and even "- … - _".
34 * Syntax for negative numerals is mere input syntax.
37 * Elimination of fact duplicates:
38 equals_zero_I ~> minus_unique
39 diff_eq_0_iff_eq ~> right_minus_eq
40 nat_infinite ~> infinite_UNIV_nat
41 int_infinite ~> infinite_UNIV_int
44 * Fact name consolidation:
45 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
46 minus_le_self_iff ~> neg_less_eq_nonneg
47 le_minus_self_iff ~> less_eq_neg_nonpos
48 neg_less_nonneg ~> neg_less_pos
49 less_minus_self_iff ~> less_neg_neg [simp]
52 * More simplification rules on unary and binary minus:
53 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
54 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
55 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
56 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
57 minus_add_cancel, uminus_add_conv_diff. These correspondingly
58 have been taken away from fact collections algebra_simps and
59 field_simps. INCOMPATIBILITY.
61 To restore proofs, the following patterns are helpful:
63 a) Arbitrary failing proof not involving "diff_def":
64 Consider simplification with algebra_simps or field_simps.
66 b) Lifting rules from addition to subtraction:
67 Try with "using <rule for addition> of [… "- _" …]" by simp".
69 c) Simplification with "diff_def": just drop "diff_def".
70 Consider simplification with algebra_simps or field_simps;
72 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
74 * SUP and INF generalized to conditionally_complete_lattice
76 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
77 Conditionally_Complete_Lattices. INCOMPATIBILITY.
79 * Introduce bdd_above and bdd_below in Conditionally_Complete_Lattices, use them
80 instead of explicitly stating boundedness of sets.
85 * Toplevel function "use" refers to raw ML bootstrap environment,
86 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
87 Note that 'ML_file' is the canonical command to load ML files into the
92 New in Isabelle2013-1 (November 2013)
93 -------------------------------------
97 * Discontinued obsolete 'uses' within theory header. Note that
98 commands like 'ML_file' work without separate declaration of file
99 dependencies. Minor INCOMPATIBILITY.
101 * Discontinued redundant 'use' command, which was superseded by
102 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
104 * Simplified subscripts within identifiers, using plain \<^sub>
105 instead of the second copy \<^isub> and \<^isup>. Superscripts are
106 only for literal tokens within notation; explicit mixfix annotations
107 for consts or fixed variables may be used as fall-back for unusual
108 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
109 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
110 standardize symbols as a starting point for further manual cleanup.
111 The ML reference variable "legacy_isub_isup" may be set as temporary
112 workaround, to make the prover accept a subset of the old identifier
115 * Document antiquotations: term style "isub" has been renamed to
116 "sub". Minor INCOMPATIBILITY.
118 * Uniform management of "quick_and_dirty" as system option (see also
119 "isabelle options"), configuration option within the context (see also
120 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
121 INCOMPATIBILITY, need to use more official Isabelle means to access
122 quick_and_dirty, instead of historical poking into mutable reference.
124 * Renamed command 'print_configs' to 'print_options'. Minor
127 * Proper diagnostic command 'print_state'. Old 'pr' (with its
128 implicit change of some global references) is retained for now as
129 control command, e.g. for ProofGeneral 3.7.x.
131 * Discontinued 'print_drafts' command with its old-fashioned PS output
132 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
133 'display_drafts' instead and print via the regular document viewer.
135 * Updated and extended "isar-ref" and "implementation" manual,
136 eliminated old "ref" manual.
139 *** Prover IDE -- Isabelle/Scala/jEdit ***
141 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
144 * Dockable window "Documentation" provides access to Isabelle
147 * Dockable window "Find" provides query operations for formal entities
148 (GUI front-end to 'find_theorems' command).
150 * Dockable window "Sledgehammer" manages asynchronous / parallel
151 sledgehammer runs over existing document sources, independently of
152 normal editing and checking process.
154 * Dockable window "Timing" provides an overview of relevant command
155 timing information, depending on option jedit_timing_threshold. The
156 same timing information is shown in the extended tooltip of the
157 command keyword, when hovering the mouse over it while the CONTROL or
158 COMMAND modifier is pressed.
160 * Improved dockable window "Theories": Continuous checking of proof
161 document (visible and required parts) may be controlled explicitly,
162 using check box or shortcut "C+e ENTER". Individual theory nodes may
163 be marked explicitly as required and checked in full, using check box
164 or shortcut "C+e SPACE".
166 * Improved completion mechanism, which is now managed by the
167 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
168 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
170 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
171 isabelle.complete for explicit completion in Isabelle sources.
172 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
175 * Improved support of various "minor modes" for Isabelle NEWS,
176 options, session ROOT etc., with completion and SideKick tree view.
178 * Strictly monotonic document update, without premature cancellation of
179 running transactions that are still needed: avoid reset/restart of
180 such command executions while editing.
182 * Support for asynchronous print functions, as overlay to existing
185 * Support for automatic tools in HOL, which try to prove or disprove
186 toplevel theorem statements.
188 * Action isabelle.reset-font-size resets main text area font size
189 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
190 also "Plugin Options / Isabelle / General"). It can be bound to some
191 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
193 * File specifications in jEdit (e.g. file browser) may refer to
194 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
195 obsolete $ISABELLE_HOME_WINDOWS variable.
197 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
198 / Global Options / Appearance".
200 * Improved support of native Mac OS X functionality via "MacOSX"
201 plugin, which is now enabled by default.
206 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
207 In particular, 'interpretation' allows for non-persistent
208 interpretation within "context ... begin ... end" blocks offering a
209 light-weight alternative to 'sublocale'. See "isar-ref" manual for
212 * Improved locales diagnostic command 'print_dependencies'.
214 * Discontinued obsolete 'axioms' command, which has been marked as
215 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
216 instead, while observing its uniform scope for polymorphism.
218 * Discontinued empty name bindings in 'axiomatization'.
221 * System option "proofs" has been discontinued. Instead the global
222 state of Proofterm.proofs is persistently compiled into logic images
223 as required, notably HOL-Proofs. Users no longer need to change
224 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
226 * Syntax translation functions (print_translation etc.) always depend
227 on Proof.context. Discontinued former "(advanced)" option -- this is
228 now the default. Minor INCOMPATIBILITY.
230 * Former global reference trace_unify_fail is now available as
231 configuration option "unify_trace_failure" (global context only).
233 * SELECT_GOAL now retains the syntactic context of the overall goal
234 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
240 * Stronger precedence of syntax for big intersection and union on
241 sets, in accordance with corresponding lattice operations.
244 * Notation "{p:A. P}" now allows tuple patterns as well.
246 * Nested case expressions are now translated in a separate check phase
247 rather than during parsing. The data for case combinators is separated
248 from the datatype package. The declaration attribute
249 "case_translation" can be used to register new case combinators:
251 declare [[case_translation case_combinator constructor1 ... constructorN]]
254 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
256 - 'code_identifier' declares name hints for arbitrary identifiers in
257 generated code, subsuming 'code_modulename'.
259 See the isar-ref manual for syntax diagrams, and the HOL theories for
262 * Attibute 'code': 'code' now declares concrete and abstract code
263 equations uniformly. Use explicit 'code equation' and 'code abstract'
264 to distinguish both when desired.
266 * Discontinued theories Code_Integer and Efficient_Nat by a more
267 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
268 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
269 generation for details. INCOMPATIBILITY.
271 * Numeric types are mapped by default to target language numerals:
272 natural (replaces former code_numeral) and integer (replaces former
273 code_int). Conversions are available as integer_of_natural /
274 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
275 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
276 ML). INCOMPATIBILITY.
278 * Function package: For mutually recursive functions f and g, separate
279 cases rules f.cases and g.cases are generated instead of unusable
280 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
281 in the case that the unusable rule was used nevertheless.
283 * Function package: For each function f, new rules f.elims are
284 generated, which eliminate equalities of the form "f x = t".
286 * New command 'fun_cases' derives ad-hoc elimination rules for
287 function equations as simplified instances of f.elims, analogous to
288 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
291 - parametrized correspondence relations are now supported:
292 + parametricity theorems for the raw term can be specified in
293 the command lift_definition, which allow us to generate stronger
295 + setup_lifting generates stronger transfer rules if parametric
296 correspondence relation can be generated
297 + various new properties of the relator must be specified to support
299 + parametricity theorem for the Quotient relation can be specified
300 - setup_lifting generates domain rules for the Transfer package
301 - stronger reflexivity prover of respectfulness theorems for type
303 - ===> and --> are now local. The symbols can be introduced
304 by interpreting the locale lifting_syntax (typically in an
306 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
307 Main. Potential INCOMPATIBILITY
308 - new commands for restoring and deleting Lifting/Transfer context:
309 lifting_forget, lifting_update
310 - the command print_quotmaps was renamed to print_quot_maps.
314 - better support for domains in Transfer: replace Domainp T
315 by the actual invariant in a transferred goal
316 - transfer rules can have as assumptions other transfer rules
317 - Experimental support for transferring from the raw level to the
318 abstract level: Transfer.transferred attribute
319 - Attribute version of the transfer method: untransferred attribute
321 * Reification and reflection:
322 - Reification is now directly available in HOL-Main in structure
324 - Reflection now handles multiple lists with variables also.
325 - The whole reflection stack has been decomposed into conversions.
328 * Revised devices for recursive definitions over finite sets:
329 - Only one fundamental fold combinator on finite set remains:
330 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
331 This is now identity on infinite sets.
332 - Locales ("mini packages") for fundamental definitions with
333 Finite_Set.fold: folding, folding_idem.
334 - Locales comm_monoid_set, semilattice_order_set and
335 semilattice_neutr_order_set for big operators on sets.
336 See theory Big_Operators for canonical examples.
337 Note that foundational constants comm_monoid_set.F and
338 semilattice_set.F correspond to former combinators fold_image
339 and fold1 respectively. These are now gone. You may use
340 those foundational constants as substitutes, but it is
341 preferable to interpret the above locales accordingly.
342 - Dropped class ab_semigroup_idem_mult (special case of lattice,
343 no longer needed in connection with Finite_Set.fold etc.)
345 card.union_inter ~> card_Un_Int [symmetric]
346 card.union_disjoint ~> card_Un_disjoint
349 * Locale hierarchy for abstract orderings and (semi)lattices.
351 * Complete_Partial_Order.admissible is defined outside the type class
352 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
353 class predicate assumption or sort constraint when possible.
356 * Introduce type class "conditionally_complete_lattice": Like a
357 complete lattice but does not assume the existence of the top and
358 bottom elements. Allows to generalize some lemmas about reals and
359 extended reals. Removed SupInf and replaced it by the instantiation
360 of conditionally_complete_lattice for real. Renamed lemmas about
361 conditionally-complete lattice from Sup_... to cSup_... and from
362 Inf_... to cInf_... to avoid hidding of similar complete lattice
365 * Introduce type class linear_continuum as combination of
366 conditionally-complete lattices and inner dense linorders which have
367 more than one element. INCOMPATIBILITY.
369 * Introduced type classes order_top and order_bot. The old classes top
370 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
371 Rename bot -> order_bot, top -> order_top
373 * Introduce type classes "no_top" and "no_bot" for orderings without
374 top and bottom elements.
376 * Split dense_linorder into inner_dense_order and no_top, no_bot.
378 * Complex_Main: Unify and move various concepts from
379 HOL-Multivariate_Analysis to HOL-Complex_Main.
381 - Introduce type class (lin)order_topology and
382 linear_continuum_topology. Allows to generalize theorems about
383 limits and order. Instances are reals and extended reals.
385 - continuous and continuos_on from Multivariate_Analysis:
386 "continuous" is the continuity of a function at a filter. "isCont"
387 is now an abbrevitation: "isCont x f == continuous (at _) f".
389 Generalized continuity lemmas from isCont to continuous on an
392 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
393 compactness of closed intervals on reals. Continuous functions
394 attain infimum and supremum on compact sets. The inverse of a
395 continuous function is continuous, when the function is continuous
398 - connected from Multivariate_Analysis. Use it to prove the
399 intermediate value theorem. Show connectedness of intervals on
400 linear_continuum_topology).
402 - first_countable_topology from Multivariate_Analysis. Is used to
403 show equivalence of properties on the neighbourhood filter of x and
404 on all sequences converging to x.
406 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
407 theorems from Library/FDERIV.thy to Deriv.thy and base the
408 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
409 which are restricted to sets, i.e. to represent derivatives from
412 - Removed the within-filter. It is replaced by the principal filter:
414 F within X = inf F (principal X)
416 - Introduce "at x within U" as a single constant, "at x" is now an
417 abbreviation for "at x within UNIV"
419 - Introduce named theorem collections tendsto_intros,
420 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
421 in tendsto_intros (or FDERIV_intros) are also available as
422 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
423 is replaced by a congruence rule. This allows to apply them as
424 intro rules and then proving equivalence by the simplifier.
426 - Restructured theories in HOL-Complex_Main:
428 + Moved RealDef and RComplete into Real
430 + Introduced Topological_Spaces and moved theorems about
431 topological spaces, filters, limits and continuity to it
433 + Renamed RealVector to Real_Vector_Spaces
435 + Split Lim, SEQ, Series into Topological_Spaces,
436 Real_Vector_Spaces, and Limits
438 + Moved Ln and Log to Transcendental
440 + Moved theorems about continuity from Deriv to Topological_Spaces
442 - Remove various auxiliary lemmas.
448 - Reduce incidence of "too high arity" errors
452 isar_shrink ~> isar_compress
454 - Added options "isar_try0", "spy"
455 - Better support for "isar_proofs"
456 - MaSh has been fined-tuned and now runs as a local server
458 * Improved support for ad hoc overloading of constants (see also
459 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
461 * Library/Polynomial.thy:
462 - Use lifting for primitive definitions.
463 - Explicit conversions from and to lists of coefficients, used for
465 - Replaced recursion operator poly_rec by fold_coeffs.
466 - Prefer pre-existing gcd operation for gcd.
468 poly_eq_iff ~> poly_eq_poly_eq_iff
470 expand_poly_eq ~> poly_eq_iff
473 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
474 case_of_simps to convert function definitions between a list of
475 equations with patterns on the lhs and a single equation with case
476 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
478 * New Library/FSet.thy: type of finite sets defined as a subtype of
479 sets defined by Lifting/Transfer.
481 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
483 * Consolidation of library theories on product orders:
485 Product_Lattice ~> Product_Order -- pointwise order on products
486 Product_ord ~> Product_Lexorder -- lexicographic order on products
490 * Imperative-HOL: The MREC combinator is considered legacy and no
491 longer included by default. INCOMPATIBILITY, use partial_function
492 instead, or import theory Legacy_Mrec as a fallback.
494 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
495 ~~/src/HOL/Algebra/poly. Existing theories should be based on
496 ~~/src/HOL/Library/Polynomial instead. The latter provides
497 integration with HOL's type classes for rings. INCOMPATIBILITY.
500 - Various improvements to BNF-based (co)datatype package, including
501 new commands "primrec_new", "primcorec", and
502 "datatype_new_compat", as well as documentation. See
503 "datatypes.pdf" for details.
504 - New "coinduction" method to avoid some boilerplate (compared to
510 - Renamed many generated theorems, including
512 map_comp' ~> map_comp
522 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
523 "check_property" allows to check specifications of the form "ALL x y
524 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
525 Examples.thy in particular.
527 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
528 tracing output in the command transaction context instead of physical
529 stdout. See also Toplevel.debug, Toplevel.debugging and
530 ML_Compiler.exn_trace.
532 * ML type "theory" is now immutable, without any special treatment of
533 drafts or linear updates (which could lead to "stale theory" errors in
534 the past). Discontinued obsolete operations like Theory.copy,
535 Theory.checkpoint, and the auxiliary type theory_ref. Minor
538 * More uniform naming of goal functions for skipped proofs:
540 Skip_Proof.prove ~> Goal.prove_sorry
541 Skip_Proof.prove_global ~> Goal.prove_sorry_global
543 Minor INCOMPATIBILITY.
545 * Simplifier tactics and tools use proper Proof.context instead of
546 historic type simpset. Old-style declarations like addsimps,
547 addsimprocs etc. operate directly on Proof.context. Raw type simpset
548 retains its use as snapshot of the main Simplifier context, using
549 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
550 old tools by making them depend on (ctxt : Proof.context) instead of
551 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
553 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
554 operate on Proof.context instead of claset, for uniformity with addIs,
555 addEs, addDs etc. Note that claset_of and put_claset allow to manage
556 clasets separately from the context.
558 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
559 INCOMPATIBILITY, use @{context} instead.
561 * Antiquotation @{theory_context A} is similar to @{theory A}, but
562 presents the result as initial Proof.context.
567 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
568 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
570 * Discontinued obsolete isabelle-process options -f and -u (former
571 administrative aliases of option -e). Minor INCOMPATIBILITY.
573 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
576 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
577 document formats: dvi.gz, ps, ps.gz -- the default document format is
580 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
581 specify global resources of the JVM process run by isabelle build.
583 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
584 to run Isabelle/Scala source files as standalone programs.
586 * Improved "isabelle keywords" tool (for old-style ProofGeneral
587 keyword tables): use Isabelle/Scala operations, which inspect outer
588 syntax without requiring to build sessions first.
590 * Sessions may be organized via 'chapter' specifications in the ROOT
591 file, which determines a two-level hierarchy of browser info. The old
592 tree-like organization via implicit sub-session relation (with its
593 tendency towards erratic fluctuation of URLs) has been discontinued.
594 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
595 for HTML presentation of theories.
599 New in Isabelle2013 (February 2013)
600 -----------------------------------
604 * Theorem status about oracles and unfinished/failed future proofs is
605 no longer printed by default, since it is incompatible with
606 incremental / parallel checking of the persistent document model. ML
607 function Thm.peek_status may be used to inspect a snapshot of the
608 ongoing evaluation process. Note that in batch mode --- notably
609 isabelle build --- the system ensures that future proofs of all
610 accessible theorems in the theory context are finished (as before).
612 * Configuration option show_markup controls direct inlining of markup
613 into the printed representation of formal entities --- notably type
614 and sort constraints. This enables Prover IDE users to retrieve that
615 information via tooltips in the output window, for example.
617 * Command 'ML_file' evaluates ML text from a file directly within the
618 theory, without any predeclaration via 'uses' in the theory header.
620 * Old command 'use' command and corresponding keyword 'uses' in the
621 theory header are legacy features and will be discontinued soon.
622 Tools that load their additional source files may imitate the
623 'ML_file' implementation, such that the system can take care of
624 dependencies properly.
626 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
627 is called fastforce / fast_force_tac already since Isabelle2011-1.
629 * Updated and extended "isar-ref" and "implementation" manual, reduced
630 remaining material in old "ref" manual.
632 * Improved support for auxiliary contexts that indicate block structure
633 for specifications. Nesting of "context fixes ... context assumes ..."
634 and "class ... context ...".
636 * Attribute "consumes" allows a negative value as well, which is
637 interpreted relatively to the total number of premises of the rule in
638 the target context. This form of declaration is stable when exported
639 from a nested 'context' with additional assumptions. It is the
640 preferred form for definitional packages, notably cases/rules produced
641 in HOL/inductive and HOL/function.
643 * More informative error messages for Isar proof commands involving
644 lazy enumerations (method applications etc.).
646 * Refined 'help' command to retrieve outer syntax commands according
647 to name patterns (with clickable results).
650 *** Prover IDE -- Isabelle/Scala/jEdit ***
652 * Parallel terminal proofs ('by') are enabled by default, likewise
653 proofs that are built into packages like 'datatype', 'function'. This
654 allows to "run ahead" checking the theory specifications on the
655 surface, while the prover is still crunching on internal
656 justifications. Unfinished / cancelled proofs are restarted as
657 required to complete full proof checking eventually.
659 * Improved output panel with tooltips, hyperlinks etc. based on the
660 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
661 tooltips leads to some window that supports the same recursively,
662 which can lead to stacks of tooltips as the semantic document content
663 is explored. ESCAPE closes the whole stack, individual windows may be
664 closed separately, or detached to become independent jEdit dockables.
666 * Improved support for commands that produce graph output: the text
667 message contains a clickable area to open a new instance of the graph
670 * More robust incremental parsing of outer syntax (partial comments,
671 malformed symbols). Changing the balance of open/close quotes and
672 comment delimiters works more conveniently with unfinished situations
673 that frequently occur in user interaction.
675 * More efficient painting and improved reactivity when editing large
676 files. More scalable management of formal document content.
678 * Smarter handling of tracing messages: prover process pauses after
679 certain number of messages per command transaction, with some user
680 dialog to stop or continue. This avoids swamping the front-end with
681 potentially infinite message streams.
683 * More plugin options and preferences, based on Isabelle/Scala. The
684 jEdit plugin option panel provides access to some Isabelle/Scala
685 options, including tuning parameters for editor reactivity and color
688 * Dockable window "Symbols" provides some editing support for Isabelle
691 * Dockable window "Monitor" shows ML runtime statistics. Note that
692 continuous display of the chart slows down the system.
694 * Improved editing support for control styles: subscript, superscript,
695 bold, reset of style -- operating on single symbols or text
696 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
698 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
699 adjust the main text area font size, and its derivatives for output,
700 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
701 need to be adapted to local keyboard layouts.
703 * More reactive completion popup by default: use \t (TAB) instead of
704 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
705 also "Plugin Options / SideKick / General / Code Completion Options".
707 * Implicit check and build dialog of the specified logic session
708 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
709 demand, without bundling big platform-dependent heap images in the
710 Isabelle distribution.
712 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
713 from Oracle provide better multi-platform experience. This version is
714 now bundled exclusively with Isabelle.
719 * Code generation for Haskell: restrict unqualified imports from
720 Haskell Prelude to a small set of fundamental operations.
722 * Command 'export_code': relative file names are interpreted
723 relatively to master directory of current theory rather than the
724 rather arbitrary current working directory. INCOMPATIBILITY.
726 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
727 use regular rule composition via "OF" / "THEN", or explicit proof
728 structure instead. Note that Isabelle/ML provides a variety of
729 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
730 with some care where this is really required.
732 * Command 'typ' supports an additional variant with explicit sort
733 constraint, to infer and check the most general type conforming to a
734 given sort. Example (in HOL):
736 typ "_ * _ * bool * unit" :: finite
738 * Command 'locale_deps' visualizes all locales and their relations as
746 - Added MaSh relevance filter based on machine-learning; see the
747 Sledgehammer manual for details.
748 - Polished Isar proofs generated with "isar_proofs" option.
749 - Rationalized type encodings ("type_enc" option).
750 - Renamed "kill_provers" subcommand to "kill_all".
752 isar_proof ~> isar_proofs
753 isar_shrink_factor ~> isar_shrink
754 max_relevant ~> max_facts
755 relevance_thresholds ~> fact_thresholds
757 * Quickcheck: added an optimisation for equality premises. It is
758 switched on by default, and can be switched off by setting the
759 configuration quickcheck_optimise_equality to false.
761 * Quotient: only one quotient can be defined by quotient_type
765 - generation of an abstraction function equation in lift_definition
767 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
769 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
772 * Preprocessing of the code generator rewrites set comprehensions into
773 pointfree expressions.
775 * The SMT solver Z3 has now by default a restricted set of directly
776 supported features. For the full set of features (div/mod, nonlinear
777 arithmetic, datatypes/records) with potential proof reconstruction
778 failures, enable the configuration option "z3_with_extensions". Minor
781 * Simplified 'typedef' specifications: historical options for implicit
782 set definition and alternative name have been discontinued. The
783 former behavior of "typedef (open) t = A" is now the default, but
784 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
787 * Removed constant "chars"; prefer "Enum.enum" on type "char"
788 directly. INCOMPATIBILITY.
790 * Moved operation product, sublists and n_lists from theory Enum to
791 List. INCOMPATIBILITY.
793 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
795 * Class "comm_monoid_diff" formalises properties of bounded
796 subtraction, with natural numbers and multisets as typical instances.
798 * Added combinator "Option.these" with type "'a option set => 'a set".
800 * Theory "Transitive_Closure": renamed lemmas
802 reflcl_tranclp -> reflclp_tranclp
803 rtranclp_reflcl -> rtranclp_reflclp
807 * Theory "Rings": renamed lemmas (in class semiring)
809 left_distrib ~> distrib_right
810 right_distrib ~> distrib_left
814 * Generalized the definition of limits:
816 - Introduced the predicate filterlim (LIM x F. f x :> G) which
817 expresses that when the input values x converge to F then the
818 output f x converges to G.
820 - Added filters for convergence to positive (at_top) and negative
823 - Moved infinity in the norm (at_infinity) from
824 Multivariate_Analysis to Complex_Main.
826 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
831 * Theory "Library/Option_ord" provides instantiation of option type to
832 lattice type classes.
834 * Theory "Library/Multiset": renamed
836 constant fold_mset ~> Multiset.fold
837 fact fold_mset_commute ~> fold_mset_comm
841 * Renamed theory Library/List_Prefix to Library/Sublist, with related
844 - Renamed constants (and related lemmas)
847 strict_prefix ~> prefix
849 - Replaced constant "postfix" by "suffixeq" with swapped argument
850 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
851 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
852 Renamed lemmas accordingly.
854 - Added constant "list_hembeq" for homeomorphic embedding on
855 lists. Added abbreviation "sublisteq" for special case
856 "list_hembeq (op =)".
858 - Theory Library/Sublist no longer provides "order" and "bot" type
859 class instances for the prefix order (merely corresponding locale
860 interpretations). The type class instances are now in theory
861 Library/Prefix_Order.
863 - The sublist relation of theory Library/Sublist_Order is now based
864 on "Sublist.sublisteq". Renamed lemmas accordingly:
866 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
867 le_list_append_mono ~> Sublist.list_hembeq_append_mono
868 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
869 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
870 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
871 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
872 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
873 le_list_drop_many ~> Sublist.sublisteq_drop_many
874 le_list_filter_left ~> Sublist.sublisteq_filter_left
875 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
876 le_list_rev_take_iff ~> Sublist.sublisteq_append
877 le_list_same_length ~> Sublist.sublisteq_same_length
878 le_list_take_many_iff ~> Sublist.sublisteq_append'
879 less_eq_list.drop ~> less_eq_list_drop
880 less_eq_list.induct ~> less_eq_list_induct
881 not_le_list_length ~> Sublist.not_sublisteq_length
885 * New theory Library/Countable_Set.
887 * Theory Library/Debug and Library/Parallel provide debugging and
888 parallel execution for code generated towards Isabelle/ML.
890 * Theory Library/FuncSet: Extended support for Pi and extensional and
891 introduce the extensional dependent function space "PiE". Replaced
892 extensional_funcset by an abbreviation, and renamed lemmas from
893 extensional_funcset to PiE as follows:
895 extensional_empty ~> PiE_empty
896 extensional_funcset_empty_domain ~> PiE_empty_domain
897 extensional_funcset_empty_range ~> PiE_empty_range
898 extensional_funcset_arb ~> PiE_arb
899 extensional_funcset_mem ~> PiE_mem
900 extensional_funcset_extend_domainI ~> PiE_fun_upd
901 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
902 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
903 card_extensional_funcset ~> card_PiE
904 finite_extensional_funcset ~> finite_PiE
908 * Theory Library/FinFun: theory of almost everywhere constant
909 functions (supersedes the AFP entry "Code Generation for Functions as
912 * Theory Library/Phantom: generic phantom type to make a type
913 parameter appear in a constant's type. This alternative to adding
914 TYPE('a) as another parameter avoids unnecessary closures in generated
917 * Theory Library/RBT_Impl: efficient construction of red-black trees
918 from sorted associative lists. Merging two trees with rbt_union may
919 return a structurally different tree than before. Potential
922 * Theory Library/IArray: immutable arrays with code generation.
924 * Theory Library/Finite_Lattice: theory of finite lattices.
926 * HOL/Multivariate_Analysis: replaced
928 "basis :: 'a::euclidean_space => nat => real"
929 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
931 on euclidean spaces by using the inner product "_ \<bullet> _" with
932 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
933 "SUM i : Basis. f i * r i".
935 With this change the following constants are also changed or removed:
937 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
938 a $$ i ~> inner a i (where i : Basis)
940 \<pi>, \<pi>' removed
942 Theorems about these constants where removed.
946 component_le_norm ~> Basis_le_norm
947 euclidean_eq ~> euclidean_eq_iff
948 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
949 euclidean_simps ~> inner_simps
950 independent_basis ~> independent_Basis
951 span_basis ~> span_Basis
952 in_span_basis ~> in_span_Basis
953 norm_bound_component_le ~> norm_boound_Basis_le
954 norm_bound_component_lt ~> norm_boound_Basis_lt
955 component_le_infnorm ~> Basis_le_infnorm
961 - Added simproc "measurable" to automatically prove measurability.
963 - Added induction rules for sigma sets with disjoint union
964 (sigma_sets_induct_disjoint) and for Borel-measurable functions
965 (borel_measurable_induct).
967 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
970 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
971 AFP entry "Ordinals_and_Cardinals").
973 * HOL/BNF: New (co)datatype package based on bounded natural functors
974 with support for mixed, nested recursion and interesting non-free
977 * HOL/Finite_Set and Relation: added new set and relation operations
978 expressed by Finite_Set.fold.
980 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
981 trees for the code generator.
983 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
985 possible INCOMPATIBILITY.
987 * HOL/Set: renamed Set.project -> Set.filter
991 *** Document preparation ***
993 * Dropped legacy antiquotations "term_style" and "thm_style", since
994 styles may be given as arguments to "term" and "thm" already.
995 Discontinued legacy styles "prem1" .. "prem19".
997 * Default LaTeX rendering for \<euro> is now based on eurosym package,
998 instead of slightly exotic babel/greek.
1000 * Document variant NAME may use different LaTeX entry point
1001 document/root_NAME.tex if that file exists, instead of the common
1004 * Simplified custom document/build script, instead of old-style
1005 document/IsaMakefile. Minor INCOMPATIBILITY.
1010 * The default limit for maximum number of worker threads is now 8,
1011 instead of 4, in correspondence to capabilities of contemporary
1012 hardware and Poly/ML runtime system.
1014 * Type Seq.results and related operations support embedded error
1015 messages within lazy enumerations, and thus allow to provide
1016 informative errors in the absence of any usable results.
1018 * Renamed Position.str_of to Position.here to emphasize that this is a
1019 formal device to inline positions into message text, but not
1020 necessarily printing visible text.
1025 * Advanced support for Isabelle sessions and build management, see
1026 "system" manual for the chapter of that name, especially the "isabelle
1027 build" tool and its examples. The "isabelle mkroot" tool prepares
1028 session root directories for use with "isabelle build", similar to
1029 former "isabelle mkdir" for "isabelle usedir". Note that this affects
1030 document preparation as well. INCOMPATIBILITY, isabelle usedir /
1031 mkdir / make are rendered obsolete.
1033 * Discontinued obsolete Isabelle/build script, it is superseded by the
1034 regular isabelle build tool. For example:
1036 isabelle build -s -b HOL
1038 * Discontinued obsolete "isabelle makeall".
1040 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
1041 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
1042 provides some traditional targets that invoke "isabelle build". Note
1043 that this is inefficient! Applications of Isabelle/HOL involving
1044 "isabelle make" should be upgraded to use "isabelle build" directly.
1046 * The "isabelle options" tool prints Isabelle system options, as
1047 required for "isabelle build", for example.
1049 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
1050 Minor INCOMPATIBILITY in command-line options.
1052 * The "isabelle install" tool has now a simpler command-line. Minor
1055 * The "isabelle components" tool helps to resolve add-on components
1056 that are not bundled, or referenced from a bare-bones repository
1057 version of Isabelle.
1059 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
1060 platform family: "linux", "macos", "windows".
1062 * The ML system is configured as regular component, and no longer
1063 picked up from some surrounding directory. Potential INCOMPATIBILITY
1064 for home-made settings.
1066 * Improved ML runtime statistics (heap, threads, future tasks etc.).
1068 * Discontinued support for Poly/ML 5.2.1, which was the last version
1069 without exception positions and advanced ML compiler/toplevel
1072 * Discontinued special treatment of Proof General -- no longer guess
1073 PROOFGENERAL_HOME based on accidental file-system layout. Minor
1074 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
1075 settings manually, or use a Proof General version that has been
1076 bundled as Isabelle component.
1080 New in Isabelle2012 (May 2012)
1081 ------------------------------
1085 * Prover IDE (PIDE) improvements:
1087 - more robust Sledgehammer integration (as before the sledgehammer
1088 command-line needs to be typed into the source buffer)
1089 - markup for bound variables
1090 - markup for types of term variables (displayed as tooltips)
1091 - support for user-defined Isar commands within the running session
1092 - improved support for Unicode outside original 16bit range
1093 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
1095 * Forward declaration of outer syntax keywords within the theory
1096 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
1097 commands to be used in the same theory where defined.
1099 * Auxiliary contexts indicate block structure for specifications with
1100 additional parameters and assumptions. Such unnamed contexts may be
1101 nested within other targets, like 'theory', 'locale', 'class',
1102 'instantiation' etc. Results from the local context are generalized
1103 accordingly and applied to the enclosing target context. Example:
1107 assumes xy: "x = y" and yz: "y = z"
1110 lemma my_trans: "x = z" using xy yz by simp
1116 The most basic application is to factor-out context elements of
1117 several fixes/assumes/shows theorem statements, e.g. see
1118 ~~/src/HOL/Isar_Examples/Group_Context.thy
1120 Any other local theory specification element works within the "context
1121 ... begin ... end" block as well.
1123 * Bundled declarations associate attributed fact expressions with a
1124 given name in the context. These may be later included in other
1125 contexts. This allows to manage context extensions casually, without
1126 the logical dependencies of locales and locale interpretation. See
1127 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
1129 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
1130 declaration, and results are standardized before being stored. Thus
1131 old-style "standard" after instantiation or composition of facts
1132 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1133 indices of schematic variables.
1135 * Rule attributes in local theory declarations (e.g. locale or class)
1136 are now statically evaluated: the resulting theorem is stored instead
1137 of the original expression. INCOMPATIBILITY in rare situations, where
1138 the historic accident of dynamic re-evaluation in interpretations
1141 * New tutorial "Programming and Proving in Isabelle/HOL"
1142 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1143 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1144 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1145 Logic" as the recommended beginners tutorial, but does not cover all
1146 of the material of that old tutorial.
1148 * Updated and extended reference manuals: "isar-ref",
1149 "implementation", "system"; reduced remaining material in old "ref"
1155 * Command 'definition' no longer exports the foundational "raw_def"
1156 into the user context. Minor INCOMPATIBILITY, may use the regular
1157 "def" result with attribute "abs_def" to imitate the old version.
1159 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1160 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1161 expand it. This also works for object-logic equality. (Formerly
1162 undocumented feature.)
1164 * Sort constraints are now propagated in simultaneous statements, just
1165 like type constraints. INCOMPATIBILITY in rare situations, where
1166 distinct sorts used to be assigned accidentally. For example:
1168 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1170 lemma "P (x::'a)" and "Q (y::'a::bar)"
1171 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1173 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1174 tolerant against multiple unifiers, as long as the final result is
1175 unique. (As before, rules are composed in canonical right-to-left
1176 order to accommodate newly introduced premises.)
1178 * Renamed some inner syntax categories:
1184 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1185 "num_position" etc. are mainly used instead (which also include
1186 position information via constraints).
1188 * Simplified configuration options for syntax ambiguity: see
1189 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1190 manual. Minor INCOMPATIBILITY.
1192 * Discontinued configuration option "syntax_positions": atomic terms
1193 in parse trees are always annotated by position constraints.
1195 * Old code generator for SML and its commands 'code_module',
1196 'code_library', 'consts_code', 'types_code' have been discontinued.
1197 Use commands of the generic code generator instead. INCOMPATIBILITY.
1199 * Redundant attribute "code_inline" has been discontinued. Use
1200 "code_unfold" instead. INCOMPATIBILITY.
1202 * Dropped attribute "code_unfold_post" in favor of the its dual
1203 "code_abbrev", which yields a common pattern in definitions like
1205 definition [code_abbrev]: "f = t"
1209 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1210 instead. INCOMPATIBILITY.
1212 * Discontinued old "prems" fact, which used to refer to the accidental
1213 collection of foundational premises in the context (already marked as
1214 legacy since Isabelle2011).
1219 * Type 'a set is now a proper type constructor (just as before
1220 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1221 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1222 sets separate, it is often sufficient to rephrase some set S that has
1223 been accidentally used as predicates by "%x. x : S", and some
1224 predicate P that has been accidentally used as set by "{x. P x}".
1225 Corresponding proofs in a first step should be pruned from any
1226 tinkering with former theorems mem_def and Collect_def as far as
1229 For developments which deliberately mix predicates and sets, a
1230 planning step is necessary to determine what should become a predicate
1231 and what a set. It can be helpful to carry out that step in
1232 Isabelle2011-1 before jumping right into the current release.
1234 * Code generation by default implements sets as container type rather
1235 than predicates. INCOMPATIBILITY.
1237 * New type synonym 'a rel = ('a * 'a) set
1239 * The representation of numerals has changed. Datatype "num"
1240 represents strictly positive binary numerals, along with functions
1241 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1242 positive and negated numeric literals, respectively. See also
1243 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1244 user theories may require adaptations as follows:
1246 - Theorems with number_ring or number_semiring constraints: These
1247 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1249 - Theories defining numeric types: Remove number, number_semiring,
1250 and number_ring instances. Defer all theorems about numerals until
1251 after classes one and semigroup_add have been instantiated.
1253 - Numeral-only simp rules: Replace each rule having a "number_of v"
1254 pattern with two copies, one for numeral and one for neg_numeral.
1256 - Theorems about subclasses of semiring_1 or ring_1: These classes
1257 automatically support numerals now, so more simp rules and
1258 simprocs may now apply within the proof.
1260 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1261 Redefine using other integer operations.
1263 * Transfer: New package intended to generalize the existing
1264 "descending" method and related theorem attributes from the Quotient
1265 package. (Not all functionality is implemented yet, but future
1266 development will focus on Transfer as an eventual replacement for the
1267 corresponding parts of the Quotient package.)
1269 - transfer_rule attribute: Maintains a collection of transfer rules,
1270 which relate constants at two different types. Transfer rules may
1271 relate different type instances of the same polymorphic constant,
1272 or they may relate an operation on a raw type to a corresponding
1273 operation on an abstract type (quotient or subtype). For example:
1275 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1276 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1278 - transfer method: Replaces a subgoal on abstract types with an
1279 equivalent subgoal on the corresponding raw types. Constants are
1280 replaced with corresponding ones according to the transfer rules.
1281 Goals are generalized over all free variables by default; this is
1282 necessary for variables whose types change, but can be overridden
1283 for specific variables with e.g. "transfer fixing: x y z". The
1284 variant transfer' method allows replacing a subgoal with one that
1285 is logically stronger (rather than equivalent).
1287 - relator_eq attribute: Collects identity laws for relators of
1288 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1289 transfer method uses these lemmas to infer transfer rules for
1290 non-polymorphic constants on the fly.
1292 - transfer_prover method: Assists with proving a transfer rule for a
1293 new constant, provided the constant is defined in terms of other
1294 constants that already have transfer rules. It should be applied
1295 after unfolding the constant definitions.
1297 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1298 from type nat to type int.
1300 * Lifting: New package intended to generalize the quotient_definition
1301 facility of the Quotient package; designed to work with Transfer.
1303 - lift_definition command: Defines operations on an abstract type in
1304 terms of a corresponding operation on a representation
1305 type. Example syntax:
1307 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1310 Users must discharge a respectfulness proof obligation when each
1311 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1312 the proof is discharged automatically.) The obligation is
1313 presented in a user-friendly, readable form; a respectfulness
1314 theorem in the standard format and a transfer rule are generated
1317 - Integration with code_abstype: For typedefs (e.g. subtypes
1318 corresponding to a datatype invariant, such as dlist),
1319 lift_definition generates a code certificate theorem and sets up
1320 code generation for each constant.
1322 - setup_lifting command: Sets up the Lifting package to work with a
1323 user-defined type. The user must provide either a quotient theorem
1324 or a type_definition theorem. The package configures transfer
1325 rules for equality and quantifiers on the type, and sets up the
1326 lift_definition command to work with the type.
1328 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1329 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1330 Word/Word.thy and Library/Float.thy.
1334 - The 'quotient_type' command now supports a 'morphisms' option with
1335 rep and abs functions, similar to typedef.
1337 - 'quotient_type' sets up new types to work with the Lifting and
1338 Transfer packages, as with 'setup_lifting'.
1340 - The 'quotient_definition' command now requires the user to prove a
1341 respectfulness property at the point where the constant is
1342 defined, similar to lift_definition; INCOMPATIBILITY.
1344 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1345 accordingly, INCOMPATIBILITY.
1347 * New diagnostic command 'find_unused_assms' to find potentially
1348 superfluous assumptions in theorems using Quickcheck.
1352 - Quickcheck returns variable assignments as counterexamples, which
1353 allows to reveal the underspecification of functions under test.
1354 For example, refuting "hd xs = x", it presents the variable
1355 assignment xs = [] and x = a1 as a counterexample, assuming that
1356 any property is false whenever "hd []" occurs in it.
1358 These counterexample are marked as potentially spurious, as
1359 Quickcheck also returns "xs = []" as a counterexample to the
1360 obvious theorem "hd xs = hd xs".
1362 After finding a potentially spurious counterexample, Quickcheck
1363 continues searching for genuine ones.
1365 By default, Quickcheck shows potentially spurious and genuine
1366 counterexamples. The option "genuine_only" sets quickcheck to only
1367 show genuine counterexamples.
1369 - The command 'quickcheck_generator' creates random and exhaustive
1370 value generators for a given type and operations.
1372 It generates values by using the operations as if they were
1373 constructors of that type.
1375 - Support for multisets.
1377 - Added "use_subtype" options.
1379 - Added "quickcheck_locale" configuration to specify how to process
1380 conjectures in a locale context.
1382 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1383 and affecting 'rat' and 'real'.
1386 - Integrated more tightly with SPASS, as described in the ITP 2012
1387 paper "More SPASS with Isabelle".
1388 - Made it try "smt" as a fallback if "metis" fails or times out.
1389 - Added support for the following provers: Alt-Ergo (via Why3 and
1390 TFF1), iProver, iProver-Eq.
1391 - Sped up the minimizer.
1392 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1393 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1394 - Renamed "sound" option to "strict".
1396 * Metis: Added possibility to specify lambda translations scheme as a
1397 parenthesized argument (e.g., "by (metis (lifting) ...)").
1399 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1401 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1403 * New "case_product" attribute to generate a case rule doing multiple
1404 case distinctions at the same time. E.g.
1406 list.exhaust [case_product nat.exhaust]
1408 produces a rule which can be used to perform case distinction on both
1411 * New "eventually_elim" method as a generalized variant of the
1412 eventually_elim* rules. Supports structured proofs.
1414 * Typedef with implicit set definition is considered legacy. Use
1415 "typedef (open)" form instead, which will eventually become the
1418 * Record: code generation can be switched off manually with
1420 declare [[record_coden = false]] -- "default true"
1422 * Datatype: type parameters allow explicit sort constraints.
1424 * Concrete syntax for case expressions includes constraints for source
1425 positions, and thus produces Prover IDE markup for its bindings.
1426 INCOMPATIBILITY for old-style syntax translations that augment the
1427 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1430 * Clarified attribute "mono_set": pure declaration without modifying
1431 the result of the fact expression.
1433 * More default pred/set conversions on a couple of relation operations
1434 and predicates. Added powers of predicate relations. Consolidation
1435 of some relation theorems:
1437 converse_def ~> converse_unfold
1438 rel_comp_def ~> relcomp_unfold
1439 symp_def ~> (modified, use symp_def and sym_def instead)
1440 transp_def ~> transp_trans
1441 Domain_def ~> Domain_unfold
1442 Range_def ~> Domain_converse [symmetric]
1444 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1446 See theory "Relation" for examples for making use of pred/set
1447 conversions by means of attributes "to_set" and "to_pred".
1451 * Renamed facts about the power operation on relations, i.e., relpow
1452 to match the constant's name:
1454 rel_pow_1 ~> relpow_1
1455 rel_pow_0_I ~> relpow_0_I
1456 rel_pow_Suc_I ~> relpow_Suc_I
1457 rel_pow_Suc_I2 ~> relpow_Suc_I2
1458 rel_pow_0_E ~> relpow_0_E
1459 rel_pow_Suc_E ~> relpow_Suc_E
1460 rel_pow_E ~> relpow_E
1461 rel_pow_Suc_D2 ~> relpow_Suc_D2
1462 rel_pow_Suc_E2 ~> relpow_Suc_E2
1463 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1464 rel_pow_E2 ~> relpow_E2
1465 rel_pow_add ~> relpow_add
1466 rel_pow_commute ~> relpow
1467 rel_pow_empty ~> relpow_empty:
1468 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1469 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1470 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1471 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1472 rel_pow_fun_conv ~> relpow_fun_conv
1473 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1474 rel_pow_finite_bounded ~> relpow_finite_bounded
1475 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1476 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1477 single_valued_rel_pow ~> single_valued_relpow
1481 * Theory Relation: Consolidated constant name for relation composition
1482 and corresponding theorem names:
1484 - Renamed constant rel_comp to relcomp.
1486 - Dropped abbreviation pred_comp. Use relcompp instead.
1490 rel_compI ~> relcompI
1491 rel_compEpair ~> relcompEpair
1492 rel_compE ~> relcompE
1493 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1494 rel_comp_empty1 ~> relcomp_empty1
1495 rel_comp_mono ~> relcomp_mono
1496 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1497 rel_comp_distrib ~> relcomp_distrib
1498 rel_comp_distrib2 ~> relcomp_distrib2
1499 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1500 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1501 single_valued_rel_comp ~> single_valued_relcomp
1502 rel_comp_def ~> relcomp_unfold
1503 converse_rel_comp ~> converse_relcomp
1504 pred_compI ~> relcomppI
1505 pred_compE ~> relcomppE
1506 pred_comp_bot1 ~> relcompp_bot1
1507 pred_comp_bot2 ~> relcompp_bot2
1508 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1509 pred_comp_mono ~> relcompp_mono
1510 pred_comp_distrib ~> relcompp_distrib
1511 pred_comp_distrib2 ~> relcompp_distrib2
1512 converse_pred_comp ~> converse_relcompp
1514 finite_rel_comp ~> finite_relcomp
1516 set_rel_comp ~> set_relcomp
1520 * Theory Divides: Discontinued redundant theorems about div and mod.
1521 INCOMPATIBILITY, use the corresponding generic theorems instead.
1523 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1524 zdiv_self ~> div_self
1525 zmod_self ~> mod_self
1528 zdiv_zmod_equality ~> div_mod_equality2
1529 zdiv_zmod_equality2 ~> div_mod_equality
1530 zmod_zdiv_trivial ~> mod_div_trivial
1531 zdiv_zminus_zminus ~> div_minus_minus
1532 zmod_zminus_zminus ~> mod_minus_minus
1533 zdiv_zminus2 ~> div_minus_right
1534 zmod_zminus2 ~> mod_minus_right
1535 zdiv_minus1_right ~> div_minus1_right
1536 zmod_minus1_right ~> mod_minus1_right
1537 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1538 zmod_zmult1_eq ~> mod_mult_right_eq
1539 zpower_zmod ~> power_mod
1540 zdvd_zmod ~> dvd_mod
1541 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1542 mod_mult_distrib ~> mult_mod_left
1543 mod_mult_distrib2 ~> mult_mod_right
1545 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1546 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1548 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1550 * Consolidated theorem names concerning fold combinators:
1552 inf_INFI_fold_inf ~> inf_INF_fold_inf
1553 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1554 INFI_fold_inf ~> INF_fold_inf
1555 SUPR_fold_sup ~> SUP_fold_sup
1556 union_set ~> union_set_fold
1557 minus_set ~> minus_set_fold
1558 INFI_set_fold ~> INF_set_fold
1559 SUPR_set_fold ~> SUP_set_fold
1560 INF_code ~> INF_set_foldr
1561 SUP_code ~> SUP_set_foldr
1562 foldr.simps ~> foldr.simps (in point-free formulation)
1563 foldr_fold_rev ~> foldr_conv_fold
1564 foldl_fold ~> foldl_conv_fold
1565 foldr_foldr ~> foldr_conv_foldl
1566 foldl_foldr ~> foldl_conv_foldr
1567 fold_set_remdups ~> fold_set_fold_remdups
1568 fold_set ~> fold_set_fold
1569 fold1_set ~> fold1_set_fold
1573 * Dropped rarely useful theorems concerning fold combinators:
1574 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1575 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1576 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1577 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1578 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1579 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1580 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1581 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1582 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1583 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1585 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1586 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1587 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1588 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1589 lemmas over fold rather than foldr, or make use of lemmas
1590 fold_conv_foldr and fold_rev.
1592 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1593 through option types.
1595 * "Transitive_Closure.ntrancl": bounded transitive closure on
1598 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1600 * Theory Int: Discontinued many legacy theorems specific to type int.
1601 INCOMPATIBILITY, use the corresponding generic theorems instead.
1603 zminus_zminus ~> minus_minus
1604 zminus_0 ~> minus_zero
1605 zminus_zadd_distrib ~> minus_add_distrib
1606 zadd_commute ~> add_commute
1607 zadd_assoc ~> add_assoc
1608 zadd_left_commute ~> add_left_commute
1611 zadd_0 ~> add_0_left
1612 zadd_0_right ~> add_0_right
1613 zadd_zminus_inverse2 ~> left_minus
1614 zmult_zminus ~> mult_minus_left
1615 zmult_commute ~> mult_commute
1616 zmult_assoc ~> mult_assoc
1617 zadd_zmult_distrib ~> left_distrib
1618 zadd_zmult_distrib2 ~> right_distrib
1619 zdiff_zmult_distrib ~> left_diff_distrib
1620 zdiff_zmult_distrib2 ~> right_diff_distrib
1621 zmult_1 ~> mult_1_left
1622 zmult_1_right ~> mult_1_right
1623 zle_refl ~> order_refl
1624 zle_trans ~> order_trans
1625 zle_antisym ~> order_antisym
1626 zle_linear ~> linorder_linear
1627 zless_linear ~> linorder_less_linear
1628 zadd_left_mono ~> add_left_mono
1629 zadd_strict_right_mono ~> add_strict_right_mono
1630 zadd_zless_mono ~> add_less_le_mono
1631 int_0_less_1 ~> zero_less_one
1632 int_0_neq_1 ~> zero_neq_one
1634 zpower_zadd_distrib ~> power_add
1635 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1636 zero_le_zpower_abs ~> zero_le_power_abs
1638 * Theory Deriv: Renamed
1640 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1642 * Theory Library/Multiset: Improved code generation of multisets.
1644 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1645 are expressed via type classes again. The special syntax
1646 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1647 setsum_set, which is now subsumed by Big_Operators.setsum.
1650 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1651 use theory HOL/Library/Nat_Bijection instead.
1653 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1654 trees is now inside a type class context. Names of affected
1655 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1656 theories working directly with raw red-black trees, adapt the names as
1660 bulkload -> rbt_bulkload
1661 del_from_left -> rbt_del_from_left
1662 del_from_right -> rbt_del_from_right
1664 delete -> rbt_delete
1666 insert -> rbt_insert
1667 insertw -> rbt_insert_with
1668 insert_with_key -> rbt_insert_with_key
1669 map_entry -> rbt_map_entry
1670 lookup -> rbt_lookup
1671 sorted -> rbt_sorted
1672 tree_greater -> rbt_greater
1673 tree_less -> rbt_less
1674 tree_less_symbol -> rbt_less_symbol
1676 union_with -> rbt_union_with
1677 union_with_key -> rbt_union_with_key
1680 balance_left_sorted -> balance_left_rbt_sorted
1681 balance_left_tree_greater -> balance_left_rbt_greater
1682 balance_left_tree_less -> balance_left_rbt_less
1683 balance_right_sorted -> balance_right_rbt_sorted
1684 balance_right_tree_greater -> balance_right_rbt_greater
1685 balance_right_tree_less -> balance_right_rbt_less
1686 balance_sorted -> balance_rbt_sorted
1687 balance_tree_greater -> balance_rbt_greater
1688 balance_tree_less -> balance_rbt_less
1689 bulkload_is_rbt -> rbt_bulkload_is_rbt
1690 combine_sorted -> combine_rbt_sorted
1691 combine_tree_greater -> combine_rbt_greater
1692 combine_tree_less -> combine_rbt_less
1693 delete_in_tree -> rbt_delete_in_tree
1694 delete_is_rbt -> rbt_delete_is_rbt
1695 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1696 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1697 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1698 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1699 del_in_tree -> rbt_del_in_tree
1700 del_inv1_inv2 -> rbt_del_inv1_inv2
1701 del_sorted -> rbt_del_rbt_sorted
1702 del_tree_greater -> rbt_del_rbt_greater
1703 del_tree_less -> rbt_del_rbt_less
1704 dom_lookup_Branch -> dom_rbt_lookup_Branch
1705 entries_lookup -> entries_rbt_lookup
1706 finite_dom_lookup -> finite_dom_rbt_lookup
1707 insert_sorted -> rbt_insert_rbt_sorted
1708 insertw_is_rbt -> rbt_insertw_is_rbt
1709 insertwk_is_rbt -> rbt_insertwk_is_rbt
1710 insertwk_sorted -> rbt_insertwk_rbt_sorted
1711 insertw_sorted -> rbt_insertw_rbt_sorted
1712 ins_sorted -> ins_rbt_sorted
1713 ins_tree_greater -> ins_rbt_greater
1714 ins_tree_less -> ins_rbt_less
1715 is_rbt_sorted -> is_rbt_rbt_sorted
1716 lookup_balance -> rbt_lookup_balance
1717 lookup_bulkload -> rbt_lookup_rbt_bulkload
1718 lookup_delete -> rbt_lookup_rbt_delete
1719 lookup_Empty -> rbt_lookup_Empty
1720 lookup_from_in_tree -> rbt_lookup_from_in_tree
1721 lookup_in_tree -> rbt_lookup_in_tree
1722 lookup_ins -> rbt_lookup_ins
1723 lookup_insert -> rbt_lookup_rbt_insert
1724 lookup_insertw -> rbt_lookup_rbt_insertw
1725 lookup_insertwk -> rbt_lookup_rbt_insertwk
1726 lookup_keys -> rbt_lookup_keys
1727 lookup_map -> rbt_lookup_map
1728 lookup_map_entry -> rbt_lookup_rbt_map_entry
1729 lookup_tree_greater -> rbt_lookup_rbt_greater
1730 lookup_tree_less -> rbt_lookup_rbt_less
1731 lookup_union -> rbt_lookup_rbt_union
1732 map_entry_color_of -> rbt_map_entry_color_of
1733 map_entry_inv1 -> rbt_map_entry_inv1
1734 map_entry_inv2 -> rbt_map_entry_inv2
1735 map_entry_is_rbt -> rbt_map_entry_is_rbt
1736 map_entry_sorted -> rbt_map_entry_rbt_sorted
1737 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1738 map_entry_tree_less -> rbt_map_entry_rbt_less
1739 map_tree_greater -> map_rbt_greater
1740 map_tree_less -> map_rbt_less
1741 map_sorted -> map_rbt_sorted
1742 paint_sorted -> paint_rbt_sorted
1743 paint_lookup -> paint_rbt_lookup
1744 paint_tree_greater -> paint_rbt_greater
1745 paint_tree_less -> paint_rbt_less
1746 sorted_entries -> rbt_sorted_entries
1747 tree_greater_eq_trans -> rbt_greater_eq_trans
1748 tree_greater_nit -> rbt_greater_nit
1749 tree_greater_prop -> rbt_greater_prop
1750 tree_greater_simps -> rbt_greater_simps
1751 tree_greater_trans -> rbt_greater_trans
1752 tree_less_eq_trans -> rbt_less_eq_trans
1753 tree_less_nit -> rbt_less_nit
1754 tree_less_prop -> rbt_less_prop
1755 tree_less_simps -> rbt_less_simps
1756 tree_less_trans -> rbt_less_trans
1757 tree_ord_props -> rbt_ord_props
1758 union_Branch -> rbt_union_Branch
1759 union_is_rbt -> rbt_union_is_rbt
1760 unionw_is_rbt -> rbt_unionw_is_rbt
1761 unionwk_is_rbt -> rbt_unionwk_is_rbt
1762 unionwk_sorted -> rbt_unionwk_rbt_sorted
1764 * Theory HOL/Library/Float: Floating point numbers are now defined as
1765 a subset of the real numbers. All operations are defined using the
1766 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1773 round_down -> float_round_down
1774 round_up -> float_round_up
1778 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1781 abs_float_def -> Float.compute_float_abs
1782 bitlen_ge0 -> bitlen_nonneg
1783 bitlen.simps -> Float.compute_bitlen
1784 float_components -> Float_mantissa_exponent
1785 float_divl.simps -> Float.compute_float_divl
1786 float_divr.simps -> Float.compute_float_divr
1787 float_eq_odd -> mult_powr_eq_mult_powr_iff
1788 float_power -> real_of_float_power
1789 lapprox_posrat_def -> Float.compute_lapprox_posrat
1790 lapprox_rat.simps -> Float.compute_lapprox_rat
1791 le_float_def' -> Float.compute_float_le
1792 le_float_def -> less_eq_float.rep_eq
1793 less_float_def' -> Float.compute_float_less
1794 less_float_def -> less_float.rep_eq
1795 normfloat_def -> Float.compute_normfloat
1796 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1797 normfloat -> normfloat_def
1798 normfloat_unique -> use normfloat_def
1799 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1800 one_float_def -> Float.compute_float_one
1801 plus_float_def -> Float.compute_float_plus
1802 rapprox_posrat_def -> Float.compute_rapprox_posrat
1803 rapprox_rat.simps -> Float.compute_rapprox_rat
1804 real_of_float_0 -> zero_float.rep_eq
1805 real_of_float_1 -> one_float.rep_eq
1806 real_of_float_abs -> abs_float.rep_eq
1807 real_of_float_add -> plus_float.rep_eq
1808 real_of_float_minus -> uminus_float.rep_eq
1809 real_of_float_mult -> times_float.rep_eq
1810 real_of_float_simp -> Float.rep_eq
1811 real_of_float_sub -> minus_float.rep_eq
1812 round_down.simps -> Float.compute_float_round_down
1813 round_up.simps -> Float.compute_float_round_up
1814 times_float_def -> Float.compute_float_times
1815 uminus_float_def -> Float.compute_float_uminus
1816 zero_float_def -> Float.compute_float_zero
1818 Lemmas not necessary anymore, use the transfer method:
1819 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1820 float_divr, float_le_simp, float_less1_mantissa_bound,
1821 float_less_simp, float_less_zero, float_le_zero,
1822 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1823 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1824 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1825 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1826 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1827 round_up, zero_le_float, zero_less_float
1829 * New theory HOL/Library/DAList provides an abstract type for
1830 association lists with distinct keys.
1832 * Session HOL/IMP: Added new theory of abstract interpretation of
1835 * Session HOL-Import: Re-implementation from scratch is faster,
1836 simpler, and more scalable. Requires a proof bundle, which is
1837 available as an external component. Discontinued old (and mostly
1838 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1840 * Session HOL-Word: Discontinued many redundant theorems specific to
1841 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1844 word_sub_alt ~> word_sub_wi
1845 word_add_alt ~> word_add_def
1846 word_mult_alt ~> word_mult_def
1847 word_minus_alt ~> word_minus_def
1848 word_0_alt ~> word_0_wi
1849 word_1_alt ~> word_1_wi
1850 word_add_0 ~> add_0_left
1851 word_add_0_right ~> add_0_right
1852 word_mult_1 ~> mult_1_left
1853 word_mult_1_right ~> mult_1_right
1854 word_add_commute ~> add_commute
1855 word_add_assoc ~> add_assoc
1856 word_add_left_commute ~> add_left_commute
1857 word_mult_commute ~> mult_commute
1858 word_mult_assoc ~> mult_assoc
1859 word_mult_left_commute ~> mult_left_commute
1860 word_left_distrib ~> left_distrib
1861 word_right_distrib ~> right_distrib
1862 word_left_minus ~> left_minus
1863 word_diff_0_right ~> diff_0_right
1864 word_diff_self ~> diff_self
1865 word_sub_def ~> diff_minus
1866 word_diff_minus ~> diff_minus
1867 word_add_ac ~> add_ac
1868 word_mult_ac ~> mult_ac
1869 word_plus_ac0 ~> add_0_left add_0_right add_ac
1870 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1871 word_order_trans ~> order_trans
1872 word_order_refl ~> order_refl
1873 word_order_antisym ~> order_antisym
1874 word_order_linear ~> linorder_linear
1875 lenw1_zero_neq_one ~> zero_neq_one
1876 word_number_of_eq ~> number_of_eq
1877 word_of_int_add_hom ~> wi_hom_add
1878 word_of_int_sub_hom ~> wi_hom_sub
1879 word_of_int_mult_hom ~> wi_hom_mult
1880 word_of_int_minus_hom ~> wi_hom_neg
1881 word_of_int_succ_hom ~> wi_hom_succ
1882 word_of_int_pred_hom ~> wi_hom_pred
1883 word_of_int_0_hom ~> word_0_wi
1884 word_of_int_1_hom ~> word_1_wi
1886 * Session HOL-Word: New proof method "word_bitwise" for splitting
1887 machine word equalities and inequalities into logical circuits,
1888 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1889 multiplication, shifting by constants, bitwise operators and numeric
1890 constants. Requires fixed-length word types, not 'a word. Solves
1891 many standard word identities outright and converts more into first
1892 order problems amenable to blast or similar. See also examples in
1893 HOL/Word/Examples/WordExamples.thy.
1895 * Session HOL-Probability: Introduced the type "'a measure" to
1896 represent measures, this replaces the records 'a algebra and 'a
1897 measure_space. The locales based on subset_class now have two
1898 locale-parameters the space \<Omega> and the set of measurable sets M.
1899 The product of probability spaces uses now the same constant as the
1900 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1901 measure". Most constants are defined now outside of locales and gain
1902 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1903 Measure space constructions for distributions and densities now got
1904 their own constants distr and density. Instead of using locales to
1905 describe measure spaces with a finite space, the measure count_space
1906 and point_measure is introduced. INCOMPATIBILITY.
1910 finite_measure.\<mu>' -> measure
1911 product_algebra_generator -> prod_algebra
1912 product_prob_space.emb -> prod_emb
1913 product_prob_space.infprod_algebra -> PiM
1916 completeable_measure_space
1917 finite_measure_space
1919 finite_product_finite_prob_space
1920 finite_product_sigma_algebra
1921 finite_sigma_algebra
1923 pair_finite_prob_space
1924 pair_finite_sigma_algebra
1927 product_sigma_algebra
1931 distribution -> use distr measure, or distributed predicate
1933 joint_distribution -> use distr measure, or distributed predicate
1934 pair_measure_generator
1935 product_prob_space.infprod_algebra -> use PiM
1938 Replacement theorems:
1939 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1940 finite_measure.empty_measure -> measure_empty
1941 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1942 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1943 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1944 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1945 finite_measure.finite_measure -> finite_measure.emeasure_finite
1946 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1947 finite_measure.positive_measure' -> measure_nonneg
1948 finite_measure.real_measure -> finite_measure.emeasure_real
1949 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1950 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1951 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1952 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1953 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1954 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1955 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1956 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1957 information_space.entropy_commute -> information_space.entropy_commute_simple
1958 information_space.entropy_eq -> information_space.entropy_simple_distributed
1959 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1960 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1961 information_space.entropy_uniform_max -> information_space.entropy_uniform
1962 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1963 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1964 information_space.KL_ge_0 -> information_space.KL_nonneg
1965 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1966 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1967 Int_stable_cuboids -> Int_stable_atLeastAtMost
1968 Int_stable_product_algebra_generator -> positive_integral
1969 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1970 measure_space.additive -> emeasure_additive
1971 measure_space.AE_iff_null_set -> AE_iff_null
1972 measure_space.almost_everywhere_def -> eventually_ae_filter
1973 measure_space.almost_everywhere_vimage -> AE_distrD
1974 measure_space.continuity_from_above -> INF_emeasure_decseq
1975 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1976 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1977 measure_space.continuity_from_below -> SUP_emeasure_incseq
1978 measure_space_density -> emeasure_density
1979 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1980 measure_space.integrable_vimage -> integrable_distr
1981 measure_space.integral_translated_density -> integral_density
1982 measure_space.integral_vimage -> integral_distr
1983 measure_space.measure_additive -> plus_emeasure
1984 measure_space.measure_compl -> emeasure_compl
1985 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1986 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1987 measure_space.measure_decseq -> decseq_emeasure
1988 measure_space.measure_Diff -> emeasure_Diff
1989 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1990 measure_space.measure_eq_0 -> emeasure_eq_0
1991 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1992 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1993 measure_space.measure_incseq -> incseq_emeasure
1994 measure_space.measure_insert -> emeasure_insert
1995 measure_space.measure_mono -> emeasure_mono
1996 measure_space.measure_not_negative -> emeasure_not_MInf
1997 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1998 measure_space.measure_setsum -> setsum_emeasure
1999 measure_space.measure_setsum_split -> setsum_emeasure_cover
2000 measure_space.measure_space_vimage -> emeasure_distr
2001 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
2002 measure_space.measure_subadditive -> subadditive
2003 measure_space.measure_top -> emeasure_space
2004 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
2005 measure_space.measure_Un_null_set -> emeasure_Un_null_set
2006 measure_space.positive_integral_translated_density -> positive_integral_density
2007 measure_space.positive_integral_vimage -> positive_integral_distr
2008 measure_space.real_continuity_from_above -> Lim_measure_decseq
2009 measure_space.real_continuity_from_below -> Lim_measure_incseq
2010 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
2011 measure_space.real_measure_Diff -> measure_Diff
2012 measure_space.real_measure_finite_Union -> measure_finite_Union
2013 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
2014 measure_space.real_measure_subadditive -> measure_subadditive
2015 measure_space.real_measure_Union -> measure_Union
2016 measure_space.real_measure_UNION -> measure_UNION
2017 measure_space.simple_function_vimage -> simple_function_comp
2018 measure_space.simple_integral_vimage -> simple_integral_distr
2019 measure_space.simple_integral_vimage -> simple_integral_distr
2020 measure_unique_Int_stable -> measure_eqI_generator_eq
2021 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
2022 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
2023 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
2024 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
2025 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
2026 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
2027 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
2028 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
2029 pair_sigma_algebra.sets_swap -> sets_pair_swap
2030 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
2031 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
2032 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
2033 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
2034 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
2035 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
2036 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
2037 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
2038 prob_space.measure_space_1 -> prob_space.emeasure_space_1
2039 prob_space.prob_space_vimage -> prob_space_distr
2040 prob_space.random_variable_restrict -> measurable_restrict
2041 prob_space_unique_Int_stable -> measure_eqI_prob_space
2042 product_algebraE -> prod_algebraE_all
2043 product_algebra_generator_der -> prod_algebra_eq_finite
2044 product_algebra_generator_into_space -> prod_algebra_sets_into_space
2045 product_algebraI -> sets_PiM_I_finite
2046 product_measure_exists -> product_sigma_finite.sigma_finite
2047 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
2048 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
2049 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
2050 product_prob_space.measurable_component -> measurable_component_singleton
2051 product_prob_space.measurable_emb -> measurable_prod_emb
2052 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
2053 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
2054 product_prob_space.measure_emb -> emeasure_prod_emb
2055 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
2056 product_sigma_algebra.product_algebra_into_space -> space_closed
2057 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
2058 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
2059 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
2060 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
2061 sets_product_algebra -> sets_PiM
2062 sigma_algebra.measurable_sigma -> measurable_measure_of
2063 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
2064 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
2065 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
2066 space_product_algebra -> space_PiM
2068 * Session HOL-TPTP: support to parse and import TPTP problems (all
2069 languages) into Isabelle/HOL.
2074 * New "case_product" attribute (see HOL).
2079 * Greater support for structured proofs involving induction or case
2082 * Much greater use of mathematical symbols.
2084 * Removal of many ML theorem bindings. INCOMPATIBILITY.
2089 * Antiquotation @{keyword "name"} produces a parser for outer syntax
2090 from a minor keyword introduced via theory header declaration.
2092 * Antiquotation @{command_spec "name"} produces the
2093 Outer_Syntax.command_spec from a major keyword introduced via theory
2094 header declaration; it can be passed to Outer_Syntax.command etc.
2096 * Local_Theory.define no longer hard-wires default theorem name
2097 "foo_def", but retains the binding as given. If that is Binding.empty
2098 / Attrib.empty_binding, the result is not registered as user-level
2099 fact. The Local_Theory.define_internal variant allows to specify a
2100 non-empty name (used for the foundation in the background theory),
2101 while omitting the fact binding in the user-context. Potential
2102 INCOMPATIBILITY for derived definitional packages: need to specify
2103 naming policy for primitive definitions more explicitly.
2105 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2106 conformance with similar operations in structure Term and Logic.
2108 * Antiquotation @{attributes [...]} embeds attribute source
2109 representation into the ML text, which is particularly useful with
2110 declarations like Local_Theory.note.
2112 * Structure Proof_Context follows standard naming scheme. Old
2113 ProofContext has been discontinued. INCOMPATIBILITY.
2115 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
2116 change of semantics: update is applied to auxiliary local theory
2119 * Modernized some old-style infix operations:
2121 addeqcongs ~> Simplifier.add_eqcong
2122 deleqcongs ~> Simplifier.del_eqcong
2123 addcongs ~> Simplifier.add_cong
2124 delcongs ~> Simplifier.del_cong
2125 setmksimps ~> Simplifier.set_mksimps
2126 setmkcong ~> Simplifier.set_mkcong
2127 setmksym ~> Simplifier.set_mksym
2128 setmkeqTrue ~> Simplifier.set_mkeqTrue
2129 settermless ~> Simplifier.set_termless
2130 setsubgoaler ~> Simplifier.set_subgoaler
2131 addsplits ~> Splitter.add_split
2132 delsplits ~> Splitter.del_split
2137 * USER_HOME settings variable points to cross-platform user home
2138 directory, which coincides with HOME on POSIX systems only. Likewise,
2139 the Isabelle path specification "~" now expands to $USER_HOME, instead
2140 of former $HOME. A different default for USER_HOME may be set
2141 explicitly in shell environment, before Isabelle settings are
2142 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2143 the generic user home was intended.
2145 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2146 notation, which is useful for the jEdit file browser, for example.
2148 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2153 New in Isabelle2011-1 (October 2011)
2154 ------------------------------------
2158 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2159 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2161 - Management of multiple theory files directly from the editor
2162 buffer store -- bypassing the file-system (no requirement to save
2163 files for checking).
2165 - Markup of formal entities within the text buffer, with semantic
2166 highlighting, tooltips and hyperlinks to jump to defining source
2169 - Improved text rendering, with sub/superscripts in the source
2170 buffer (including support for copy/paste wrt. output panel, HTML
2171 theory output and other non-Isabelle text boxes).
2173 - Refined scheduling of proof checking and printing of results,
2174 based on interactive editor view. (Note: jEdit folding and
2175 narrowing allows to restrict buffer perspectives explicitly.)
2177 - Reduced CPU performance requirements, usable on machines with few
2180 - Reduced memory requirements due to pruning of unused document
2181 versions (garbage collection).
2183 See also ~~/src/Tools/jEdit/README.html for further information,
2184 including some remaining limitations.
2186 * Theory loader: source files are exclusively located via the master
2187 directory of each theory node (where the .thy file itself resides).
2188 The global load path (such as src/HOL/Library) has been discontinued.
2189 Note that the path element ~~ may be used to reference theories in the
2190 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2193 * Theory loader: source files are identified by content via SHA1
2194 digests. Discontinued former path/modtime identification and optional
2195 ISABELLE_FILE_IDENT plugin scripts.
2197 * Parallelization of nested Isar proofs is subject to
2198 Goal.parallel_proofs_threshold (default 100). See also isabelle
2201 * Name space: former unsynchronized references are now proper
2202 configuration options, with more conventional names:
2204 long_names ~> names_long
2205 short_names ~> names_short
2206 unique_names ~> names_unique
2208 Minor INCOMPATIBILITY, need to declare options in context like this:
2210 declare [[names_unique = false]]
2212 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2213 that the result needs to be unique, which means fact specifications
2214 may have to be refined after enriching a proof context.
2216 * Attribute "case_names" has been refined: the assumptions in each case
2217 can be named now by following the case name with [name1 name2 ...].
2219 * Isabelle/Isar reference manual has been updated and extended:
2220 - "Synopsis" provides a catalog of main Isar language concepts.
2221 - Formal references in syntax diagrams, via @{rail} antiquotation.
2222 - Updated material from classic "ref" manual, notably about
2223 "Classical Reasoner".
2228 * Class bot and top require underlying partial order rather than
2229 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2231 * Class complete_lattice: generalized a couple of lemmas from sets;
2232 generalized theorems INF_cong and SUP_cong. New type classes for
2233 complete boolean algebras and complete linear orders. Lemmas
2234 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2235 class complete_linorder.
2237 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2238 Sup_fun_def, Inf_apply, Sup_apply.
2240 Removed redundant lemmas (the right hand side gives hints how to
2241 replace them for (metis ...), or (simp only: ...) proofs):
2243 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2244 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2245 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2246 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2247 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2248 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2249 Inter_def ~> INF_def, image_def
2250 Union_def ~> SUP_def, image_def
2251 INT_eq ~> INF_def, and image_def
2252 UN_eq ~> SUP_def, and image_def
2253 INF_subset ~> INF_superset_mono [OF _ order_refl]
2255 More consistent and comprehensive names:
2257 INTER_eq_Inter_image ~> INF_def
2258 UNION_eq_Union_image ~> SUP_def
2261 INF_leI ~> INF_lower
2262 INF_leI2 ~> INF_lower2
2263 le_INFI ~> INF_greatest
2264 le_SUPI ~> SUP_upper
2265 le_SUPI2 ~> SUP_upper2
2266 SUP_leI ~> SUP_least
2267 INFI_bool_eq ~> INF_bool_eq
2268 SUPR_bool_eq ~> SUP_bool_eq
2269 INFI_apply ~> INF_apply
2270 SUPR_apply ~> SUP_apply
2271 INTER_def ~> INTER_eq
2272 UNION_def ~> UNION_eq
2276 * Renamed theory Complete_Lattice to Complete_Lattices.
2279 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2280 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2281 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2282 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2284 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2285 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2286 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2289 * Added syntactic classes "inf" and "sup" for the respective
2290 constants. INCOMPATIBILITY: Changes in the argument order of the
2291 (mostly internal) locale predicates for some derived classes.
2293 * Theorem collections ball_simps and bex_simps do not contain theorems
2294 referring to UNION any longer; these have been moved to collection
2295 UN_ball_bex_simps. INCOMPATIBILITY.
2297 * Theory Archimedean_Field: floor now is defined as parameter of a
2298 separate type class floor_ceiling.
2300 * Theory Finite_Set: more coherent development of fold_set locales:
2302 locale fun_left_comm ~> locale comp_fun_commute
2303 locale fun_left_comm_idem ~> locale comp_fun_idem
2305 Both use point-free characterization; interpretation proofs may need
2306 adjustment. INCOMPATIBILITY.
2308 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2309 accordance with standard mathematical terminology. INCOMPATIBILITY.
2311 * Theory Complex_Main: The locale interpretations for the
2312 bounded_linear and bounded_bilinear locales have been removed, in
2313 order to reduce the number of duplicate lemmas. Users must use the
2314 original names for distributivity theorems, potential INCOMPATIBILITY.
2316 divide.add ~> add_divide_distrib
2317 divide.diff ~> diff_divide_distrib
2318 divide.setsum ~> setsum_divide_distrib
2319 mult.add_right ~> right_distrib
2320 mult.diff_right ~> right_diff_distrib
2321 mult_right.setsum ~> setsum_right_distrib
2322 mult_left.diff ~> left_diff_distrib
2324 * Theory Complex_Main: Several redundant theorems have been removed or
2325 replaced by more general versions. INCOMPATIBILITY.
2327 real_diff_def ~> minus_real_def
2328 real_divide_def ~> divide_real_def
2329 real_less_def ~> less_le
2330 real_abs_def ~> abs_real_def
2331 real_sgn_def ~> sgn_real_def
2332 real_mult_commute ~> mult_commute
2333 real_mult_assoc ~> mult_assoc
2334 real_mult_1 ~> mult_1_left
2335 real_add_mult_distrib ~> left_distrib
2336 real_zero_not_eq_one ~> zero_neq_one
2337 real_mult_inverse_left ~> left_inverse
2338 INVERSE_ZERO ~> inverse_zero
2339 real_le_refl ~> order_refl
2340 real_le_antisym ~> order_antisym
2341 real_le_trans ~> order_trans
2342 real_le_linear ~> linear
2343 real_le_eq_diff ~> le_iff_diff_le_0
2344 real_add_left_mono ~> add_left_mono
2345 real_mult_order ~> mult_pos_pos
2346 real_mult_less_mono2 ~> mult_strict_left_mono
2347 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2348 real_0_le_divide_iff ~> zero_le_divide_iff
2349 realpow_two_disj ~> power2_eq_iff
2350 real_squared_diff_one_factored ~> square_diff_one_factored
2351 realpow_two_diff ~> square_diff_square_factored
2352 reals_complete2 ~> complete_real
2353 real_sum_squared_expand ~> power2_sum
2354 exp_ln_eq ~> ln_unique
2356 expi_zero ~> exp_zero
2357 lemma_DERIV_subst ~> DERIV_cong
2358 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2359 LIMSEQ_const ~> tendsto_const
2360 LIMSEQ_norm ~> tendsto_norm
2361 LIMSEQ_add ~> tendsto_add
2362 LIMSEQ_minus ~> tendsto_minus
2363 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2364 LIMSEQ_diff ~> tendsto_diff
2365 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2366 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2367 LIMSEQ_mult ~> tendsto_mult
2368 LIMSEQ_inverse ~> tendsto_inverse
2369 LIMSEQ_divide ~> tendsto_divide
2370 LIMSEQ_pow ~> tendsto_power
2371 LIMSEQ_setsum ~> tendsto_setsum
2372 LIMSEQ_setprod ~> tendsto_setprod
2373 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2374 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2375 LIMSEQ_imp_rabs ~> tendsto_rabs
2376 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2377 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2378 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2379 LIMSEQ_Complex ~> tendsto_Complex
2380 LIM_ident ~> tendsto_ident_at
2381 LIM_const ~> tendsto_const
2382 LIM_add ~> tendsto_add
2383 LIM_add_zero ~> tendsto_add_zero
2384 LIM_minus ~> tendsto_minus
2385 LIM_diff ~> tendsto_diff
2386 LIM_norm ~> tendsto_norm
2387 LIM_norm_zero ~> tendsto_norm_zero
2388 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2389 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2390 LIM_rabs ~> tendsto_rabs
2391 LIM_rabs_zero ~> tendsto_rabs_zero
2392 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2393 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2394 LIM_compose ~> tendsto_compose
2395 LIM_mult ~> tendsto_mult
2396 LIM_scaleR ~> tendsto_scaleR
2397 LIM_of_real ~> tendsto_of_real
2398 LIM_power ~> tendsto_power
2399 LIM_inverse ~> tendsto_inverse
2400 LIM_sgn ~> tendsto_sgn
2401 isCont_LIM_compose ~> isCont_tendsto_compose
2402 bounded_linear.LIM ~> bounded_linear.tendsto
2403 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2404 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2405 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2406 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2407 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2408 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2410 * Theory Complex_Main: The definition of infinite series was
2411 generalized. Now it is defined on the type class {topological_space,
2412 comm_monoid_add}. Hence it is useable also for extended real numbers.
2414 * Theory Complex_Main: The complex exponential function "expi" is now
2415 a type-constrained abbreviation for "exp :: complex => complex"; thus
2416 several polymorphic lemmas about "exp" are now applicable to "expi".
2420 - Theory Library/Code_Char_ord provides native ordering of
2421 characters in the target language.
2423 - Commands code_module and code_library are legacy, use export_code
2426 - Method "evaluation" is legacy, use method "eval" instead.
2428 - Legacy evaluator "SML" is deactivated by default. May be
2429 reactivated by the following theory command:
2431 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2433 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2435 * New proof method "induction" that gives induction hypotheses the
2436 name "IH", thus distinguishing them from further hypotheses that come
2437 from rule induction. The latter are still called "hyps". Method
2438 "induction" is a thin wrapper around "induct" and follows the same
2441 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2442 still available as a legacy feature for some time.
2445 - Added "need" and "total_consts" options.
2446 - Reintroduced "show_skolems" option by popular demand.
2447 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2451 - Use quasi-sound (and efficient) translations by default.
2452 - Added support for the following provers: E-ToFoF, LEO-II,
2453 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2454 - Automatically preplay and minimize proofs before showing them if
2455 this can be done within reasonable time.
2456 - sledgehammer available_provers ~> sledgehammer supported_provers.
2458 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2459 "max_mono_iters", and "max_new_mono_instances" options.
2460 - Removed "explicit_apply" and "full_types" options as well as "Full
2461 Types" Proof General menu item. INCOMPATIBILITY.
2464 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2465 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2469 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2470 "elim:" options. INCOMPATIBILITY.
2471 - Introduced 'try' that not only runs 'try_methods' but also
2472 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2475 - Added "eval" option to evaluate terms for the found counterexample
2476 (currently only supported by the default (exhaustive) tester).
2477 - Added post-processing of terms to obtain readable counterexamples
2478 (currently only supported by the default (exhaustive) tester).
2479 - New counterexample generator quickcheck[narrowing] enables
2480 narrowing-based testing. Requires the Glasgow Haskell compiler
2481 with its installation location defined in the Isabelle settings
2482 environment as ISABELLE_GHC.
2483 - Removed quickcheck tester "SML" based on the SML code generator
2484 (formly in HOL/Library).
2486 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2487 use 'partial_function' instead.
2489 * Theory Library/Extended_Reals replaces now the positive extended
2490 reals found in probability theory. This file is extended by
2491 Multivariate_Analysis/Extended_Real_Limits.
2493 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2494 from where it must be imported explicitly if it is really required.
2497 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2498 been moved here. INCOMPATIBILITY.
2500 * Theory Library/Saturated provides type of numbers with saturated
2503 * Theory Library/Product_Lattice defines a pointwise ordering for the
2504 product type 'a * 'b, and provides instance proofs for various order
2505 and lattice type classes.
2507 * Theory Library/Countable now provides the "countable_datatype" proof
2508 method for proving "countable" class instances for datatypes.
2510 * Theory Library/Cset_Monad allows do notation for computable sets
2511 (cset) via the generic monad ad-hoc overloading facility.
2513 * Library: Theories of common data structures are split into theories
2514 for implementation, an invariant-ensuring type, and connection to an
2515 abstract type. INCOMPATIBILITY.
2517 - RBT is split into RBT and RBT_Mapping.
2518 - AssocList is split and renamed into AList and AList_Mapping.
2519 - DList is split into DList_Impl, DList, and DList_Cset.
2520 - Cset is split into Cset and List_Cset.
2522 * Theory Library/Nat_Infinity has been renamed to
2523 Library/Extended_Nat, with name changes of the following types and
2526 type inat ~> type enat
2528 Infty ~> infinity (overloaded)
2532 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2533 been renamed accordingly. INCOMPATIBILITY.
2535 * Session Multivariate_Analysis: The euclidean_space type class now
2536 fixes a constant "Basis :: 'a set" consisting of the standard
2537 orthonormal basis for the type. Users now have the option of
2538 quantifying over this set instead of using the "basis" function, e.g.
2539 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2541 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2542 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2543 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2544 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2545 changed to match. Definition theorems for overloaded constants now use
2546 the standard "foo_vec_def" naming scheme. A few other theorems have
2547 been renamed as follows (INCOMPATIBILITY):
2549 Cart_eq ~> vec_eq_iff
2550 dist_nth_le_cart ~> dist_vec_nth_le
2551 tendsto_vector ~> vec_tendstoI
2552 Cauchy_vector ~> vec_CauchyI
2554 * Session Multivariate_Analysis: Several duplicate theorems have been
2555 removed, and other theorems have been renamed or replaced with more
2556 general versions. INCOMPATIBILITY.
2558 finite_choice ~> finite_set_choice
2559 eventually_conjI ~> eventually_conj
2560 eventually_and ~> eventually_conj_iff
2561 eventually_false ~> eventually_False
2562 setsum_norm ~> norm_setsum
2563 Lim_sequentially ~> LIMSEQ_def
2564 Lim_ident_at ~> LIM_ident
2565 Lim_const ~> tendsto_const
2566 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2567 Lim_neg ~> tendsto_minus
2568 Lim_add ~> tendsto_add
2569 Lim_sub ~> tendsto_diff
2570 Lim_mul ~> tendsto_scaleR
2571 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2572 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2573 Lim_linear ~> bounded_linear.tendsto
2574 Lim_component ~> tendsto_euclidean_component
2575 Lim_component_cart ~> tendsto_vec_nth
2576 Lim_inner ~> tendsto_inner [OF tendsto_const]
2577 dot_lsum ~> inner_setsum_left
2578 dot_rsum ~> inner_setsum_right
2579 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2580 continuous_neg ~> continuous_minus
2581 continuous_sub ~> continuous_diff
2582 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2583 continuous_mul ~> continuous_scaleR
2584 continuous_inv ~> continuous_inverse
2585 continuous_at_within_inv ~> continuous_at_within_inverse
2586 continuous_at_inv ~> continuous_at_inverse
2587 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2588 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2589 continuous_at_component ~> continuous_component [OF continuous_at_id]
2590 continuous_on_neg ~> continuous_on_minus
2591 continuous_on_sub ~> continuous_on_diff
2592 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2593 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2594 continuous_on_mul ~> continuous_on_scaleR
2595 continuous_on_mul_real ~> continuous_on_mult
2596 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2597 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2598 continuous_on_inverse ~> continuous_on_inv
2599 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2600 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2601 subset_interior ~> interior_mono
2602 subset_closure ~> closure_mono
2603 closure_univ ~> closure_UNIV
2604 real_arch_lt ~> reals_Archimedean2
2605 real_arch ~> reals_Archimedean3
2606 real_abs_norm ~> abs_norm_cancel
2607 real_abs_sub_norm ~> norm_triangle_ineq3
2608 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2610 * Session HOL-Probability:
2611 - Caratheodory's extension lemma is now proved for ring_of_sets.
2612 - Infinite products of probability measures are now available.
2613 - Sigma closure is independent, if the generator is independent
2614 - Use extended reals instead of positive extended
2615 reals. INCOMPATIBILITY.
2617 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2619 expand_fun_below ~> fun_below_iff
2620 below_fun_ext ~> fun_belowI
2621 expand_cfun_eq ~> cfun_eq_iff
2622 ext_cfun ~> cfun_eqI
2623 expand_cfun_below ~> cfun_below_iff
2624 below_cfun_ext ~> cfun_belowI
2625 monofun_fun_fun ~> fun_belowD
2626 monofun_fun_arg ~> monofunE
2627 monofun_lub_fun ~> adm_monofun [THEN admD]
2628 cont_lub_fun ~> adm_cont [THEN admD]
2629 cont2cont_Rep_CFun ~> cont2cont_APP
2630 cont_Rep_CFun_app ~> cont_APP_app
2631 cont_Rep_CFun_app_app ~> cont_APP_app_app
2632 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2633 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2634 contlub_cfun ~> lub_APP [symmetric]
2635 contlub_LAM ~> lub_LAM [symmetric]
2638 lift_distinct1 ~> lift.distinct(1)
2639 lift_distinct2 ~> lift.distinct(2)
2640 Def_not_UU ~> lift.distinct(2)
2641 Def_inject ~> lift.inject
2642 below_UU_iff ~> below_bottom_iff
2643 eq_UU_iff ~> eq_bottom_iff
2646 *** Document preparation ***
2648 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2649 isar-ref manual, both for description and actual application of the
2652 * Antiquotation @{value} evaluates the given term and presents its
2655 * Antiquotations: term style "isub" provides ad-hoc conversion of
2656 variables x1, y23 into subscripted form x\<^isub>1,
2657 y\<^isub>2\<^isub>3.
2659 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2660 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2662 * Localized \isabellestyle switch can be used within blocks or groups
2665 \isabellestyle{it} %preferred default
2666 {\isabellestylett @{text "typewriter stuff"}}
2668 * Discontinued special treatment of hard tabulators. Implicit
2669 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2675 * The inner syntax of sort/type/term/prop supports inlined YXML
2676 representations within quoted string tokens. By encoding logical
2677 entities via Term_XML (in ML or Scala) concrete syntax can be
2678 bypassed, which is particularly useful for producing bits of text
2679 under external program control.
2681 * Antiquotations for ML and document preparation are managed as theory
2682 data, which requires explicit setup.
2684 * Isabelle_Process.is_active allows tools to check if the official
2685 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2686 (better known as Proof General).
2688 * Structure Proof_Context follows standard naming scheme. Old
2689 ProofContext is still available for some time as legacy alias.
2691 * Structure Timing provides various operations for timing; supersedes
2692 former start_timing/end_timing etc.
2694 * Path.print is the official way to show file-system paths to users
2695 (including quotes etc.).
2697 * Inner syntax: identifiers in parse trees of generic categories
2698 "logic", "aprop", "idt" etc. carry position information (disguised as
2699 type constraints). Occasional INCOMPATIBILITY with non-compliant
2700 translations that choke on unexpected type constraints. Positions can
2701 be stripped in ML translations via Syntax.strip_positions /
2702 Syntax.strip_positions_ast, or via the syntax constant
2703 "_strip_positions" within parse trees. As last resort, positions can
2704 be disabled via the configuration option Syntax.positions, which is
2705 called "syntax_positions" in Isar attribute syntax.
2707 * Discontinued special status of various ML structures that contribute
2708 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2709 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2710 refer directly to Ast.Constant, Lexicon.is_identifier,
2711 Syntax_Trans.mk_binder_tr etc.
2713 * Typed print translation: discontinued show_sorts argument, which is
2714 already available via context of "advanced" translation.
2716 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2717 goal states; body tactic needs to address all subgoals uniformly.
2719 * Slightly more special eq_list/eq_set, with shortcut involving
2720 pointer equality (assumes that eq relation is reflexive).
2722 * Classical tactics use proper Proof.context instead of historic types
2723 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2724 operate directly on Proof.context. Raw type claset retains its use as
2725 snapshot of the classical context, which can be recovered via
2726 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2727 INCOMPATIBILITY, classical tactics and derived proof methods require
2728 proper Proof.context.
2733 * Discontinued support for Poly/ML 5.2, which was the last version
2734 without proper multithreading and TimeLimit implementation.
2736 * Discontinued old lib/scripts/polyml-platform, which has been
2737 obsolete since Isabelle2009-2.
2739 * Various optional external tools are referenced more robustly and
2740 uniformly by explicit Isabelle settings as follows:
2742 ISABELLE_CSDP (formerly CSDP_EXE)
2743 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2744 ISABELLE_OCAML (formerly EXEC_OCAML)
2745 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2746 ISABELLE_YAP (formerly EXEC_YAP)
2748 Note that automated detection from the file-system or search path has
2749 been discontinued. INCOMPATIBILITY.
2751 * Scala layer provides JVM method invocation service for static
2752 methods of type (String)String, see Invoke_Scala.method in ML. For
2755 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2757 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2758 this allows to pass structured values between ML and Scala.
2760 * The IsabelleText fonts includes some further glyphs to support the
2761 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2762 installed a local copy (which is normally *not* required) need to
2763 delete or update it from ~~/lib/fonts/.
2767 New in Isabelle2011 (January 2011)
2768 ----------------------------------
2772 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2773 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2774 useful tooltips and hyperlinks produced from its static analysis. The
2775 bundled component provides an executable Isabelle tool that can be run
2778 Isabelle2011/bin/isabelle jedit
2780 * Significantly improved Isabelle/Isar implementation manual.
2782 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2783 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2784 while the default heap location within that directory lacks that extra
2785 suffix. This isolates multiple Isabelle installations from each
2786 other, avoiding problems with old settings in new versions.
2787 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2789 * Source files are always encoded as UTF-8, instead of old-fashioned
2790 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2791 the following package declarations:
2793 \usepackage[utf8]{inputenc}
2794 \usepackage{textcomp}
2796 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2797 a Unicode character is treated as a single symbol, not a sequence of
2798 non-ASCII bytes as before. Since Isabelle/ML string literals may
2799 contain symbols without further backslash escapes, Unicode can now be
2800 used here as well. Recall that Symbol.explode in ML provides a
2801 consistent view on symbols, while raw explode (or String.explode)
2802 merely give a byte-oriented representation.
2804 * Theory loader: source files are primarily located via the master
2805 directory of each theory node (where the .thy file itself resides).
2806 The global load path is still partially available as legacy feature.
2807 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2808 explicit paths, relatively to the theory.
2810 * Special treatment of ML file names has been discontinued.
2811 Historically, optional extensions .ML or .sml were added on demand --
2812 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2813 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2815 * Various options that affect pretty printing etc. are now properly
2816 handled within the context via configuration options, instead of
2817 unsynchronized references or print modes. There are both ML Config.T
2818 entities and Isar declaration attributes to access these.
2820 ML (Config.T) Isar (attribute)
2822 eta_contract eta_contract
2823 show_brackets show_brackets
2824 show_sorts show_sorts
2825 show_types show_types
2826 show_question_marks show_question_marks
2827 show_consts show_consts
2828 show_abbrevs show_abbrevs
2830 Syntax.ast_trace syntax_ast_trace
2831 Syntax.ast_stat syntax_ast_stat
2832 Syntax.ambiguity_level syntax_ambiguity_level
2834 Goal_Display.goals_limit goals_limit
2835 Goal_Display.show_main_goal show_main_goal
2837 Method.rule_trace rule_trace
2839 Thy_Output.display thy_output_display
2840 Thy_Output.quotes thy_output_quotes
2841 Thy_Output.indent thy_output_indent
2842 Thy_Output.source thy_output_source
2843 Thy_Output.break thy_output_break
2845 Note that corresponding "..._default" references in ML may only be
2846 changed globally at the ROOT session setup, but *not* within a theory.
2847 The option "show_abbrevs" supersedes the former print mode
2848 "no_abbrevs" with inverted meaning.
2850 * More systematic naming of some configuration options.
2853 trace_simp ~> simp_trace
2854 debug_simp ~> simp_debug
2856 * Support for real valued configuration options, using simplistic
2857 floating-point notation that coincides with the inner syntax for
2860 * Support for real valued preferences (with approximative PGIP type):
2861 front-ends need to accept "pgint" values in float notation.
2864 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2867 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2872 * Command 'type_synonym' (with single argument) replaces somewhat
2873 outdated 'types', which is still available as legacy feature for some
2876 * Command 'nonterminal' (with 'and' separated list of arguments)
2877 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2879 * Command 'notepad' replaces former 'example_proof' for
2880 experimentation in Isar without any result. INCOMPATIBILITY.
2882 * Locale interpretation commands 'interpret' and 'sublocale' accept
2883 lists of equations to map definitions in a locale to appropriate
2884 entities in the context of the interpretation. The 'interpretation'
2885 command already provided this functionality.
2887 * Diagnostic command 'print_dependencies' prints the locale instances
2888 that would be activated if the specified expression was interpreted in
2889 the current context. Variant "print_dependencies!" assumes a context
2890 without interpretations.
2892 * Diagnostic command 'print_interps' prints interpretations in proofs
2893 in addition to interpretations in theories.
2895 * Discontinued obsolete 'global' and 'local' commands to manipulate
2896 the theory name space. Rare INCOMPATIBILITY. The ML functions
2897 Sign.root_path and Sign.local_path may be applied directly where this
2898 feature is still required for historical reasons.
2900 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2901 'definition' instead.
2903 * The "prems" fact, which refers to the accidental collection of
2904 foundational premises in the context, is now explicitly marked as
2905 legacy feature and will be discontinued soon. Consider using "assms"
2906 of the head statement or reference facts by explicit names.
2908 * Document antiquotations @{class} and @{type} print classes and type
2911 * Document antiquotation @{file} checks file/directory entries within
2912 the local file system.
2917 * Coercive subtyping: functions can be declared as coercions and type
2918 inference will add them as necessary upon input of a term. Theory
2919 Complex_Main declares real :: nat => real and real :: int => real as
2920 coercions. A coercion function f is declared like this:
2922 declare [[coercion f]]
2924 To lift coercions through type constructors (e.g. from nat => real to
2925 nat list => real list), map functions can be declared, e.g.
2927 declare [[coercion_map map]]
2929 Currently coercion inference is activated only in theories including
2930 real numbers, i.e. descendants of Complex_Main. This is controlled by
2931 the configuration option "coercion_enabled", e.g. it can be enabled in
2932 other theories like this:
2934 declare [[coercion_enabled]]
2936 * Command 'partial_function' provides basic support for recursive
2937 function definitions over complete partial orders. Concrete instances
2938 are provided for i) the option type, ii) tail recursion on arbitrary
2939 types, and iii) the heap monad of Imperative_HOL. See
2940 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2943 * Function package: f.psimps rules are no longer implicitly declared
2944 as [simp]. INCOMPATIBILITY.
2946 * Datatype package: theorems generated for executable equality (class
2947 "eq") carry proper names and are treated as default code equations.
2949 * Inductive package: now offers command 'inductive_simps' to
2950 automatically derive instantiated and simplified equations for
2951 inductive predicates, similar to 'inductive_cases'.
2953 * Command 'enriched_type' allows to register properties of the
2954 functorial structure of types.
2956 * Improved infrastructure for term evaluation using code generator
2957 techniques, in particular static evaluation conversions.
2959 * Code generator: Scala (2.8 or higher) has been added to the target
2962 * Code generator: globbing constant expressions "*" and "Theory.*"
2963 have been replaced by the more idiomatic "_" and "Theory._".
2966 * Code generator: export_code without explicit file declaration prints
2967 to standard output. INCOMPATIBILITY.
2969 * Code generator: do not print function definitions for case
2970 combinators any longer.
2972 * Code generator: simplification with rules determined with
2973 src/Tools/Code/code_simp.ML and method "code_simp".
2975 * Code generator for records: more idiomatic representation of record
2976 types. Warning: records are not covered by ancient SML code
2977 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2978 rep_datatype declaration helps to succeed then:
2982 rep_datatype foo_ext ...
2984 * Records: logical foundation type for records does not carry a
2985 '_type' suffix any longer (obsolete due to authentic syntax).
2988 * Quickcheck now by default uses exhaustive testing instead of random
2989 testing. Random testing can be invoked by "quickcheck [random]",
2990 exhaustive testing by "quickcheck [exhaustive]".
2992 * Quickcheck instantiates polymorphic types with small finite
2993 datatypes by default. This enables a simple execution mechanism to
2994 handle quantifiers and function equality over the finite datatypes.
2996 * Quickcheck random generator has been renamed from "code" to
2997 "random". INCOMPATIBILITY.
2999 * Quickcheck now has a configurable time limit which is set to 30
3000 seconds by default. This can be changed by adding [timeout = n] to the
3001 quickcheck command. The time limit for Auto Quickcheck is still set
3004 * Quickcheck in locales considers interpretations of that locale for
3005 counter example search.
3008 - Added "smt" and "remote_smt" provers based on the "smt" proof
3009 method. See the Sledgehammer manual for details ("isabelle doc
3012 sledgehammer atp_info ~> sledgehammer running_provers
3013 sledgehammer atp_kill ~> sledgehammer kill_provers
3014 sledgehammer available_atps ~> sledgehammer available_provers
3017 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
3018 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
3019 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
3020 (and "ms" and "min" are no longer supported)
3025 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
3026 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
3028 - Added support for partial quotient types.
3029 - Added local versions of the "Nitpick.register_xxx" functions.
3030 - Added "whack" option.
3031 - Allow registration of quotient types as codatatypes.
3032 - Improved "merge_type_vars" option to merge more types.
3033 - Removed unsound "fast_descrs" option.
3034 - Added custom symmetry breaking for datatypes, making it possible to reach
3035 higher cardinalities.
3036 - Prevent the expansion of too large definitions.
3038 * Proof methods "metis" and "meson" now have configuration options
3039 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
3040 to diagnose these tools. E.g.
3042 using [[metis_trace = true]]
3044 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
3045 manually as command 'solve_direct'.
3047 * The default SMT solver Z3 must be enabled explicitly (due to
3048 licensing issues) by setting the environment variable
3049 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
3050 commercial applications, the SMT solver CVC3 is provided as fall-back;
3051 changing the SMT solver is done via the configuration option
3054 * Remote SMT solvers need to be referred to by the "remote_" prefix,
3055 i.e. "remote_cvc3" and "remote_z3".
3057 * Added basic SMT support for datatypes, records, and typedefs using
3058 the oracle mode (no proofs). Direct support of pairs has been dropped
3059 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
3060 support for a similar behavior). Minor INCOMPATIBILITY.
3062 * Changed SMT configuration options:
3064 z3_proofs ~> smt_oracle (with inverted meaning)
3065 z3_trace_assms ~> smt_trace_used_facts
3078 * Boogie output files (.b2i files) need to be declared in the theory
3081 * Simplification procedure "list_to_set_comprehension" rewrites list
3082 comprehensions applied to List.set to set comprehensions. Occasional
3083 INCOMPATIBILITY, may be deactivated like this:
3085 declare [[simproc del: list_to_set_comprehension]]
3087 * Removed old version of primrec package. INCOMPATIBILITY.
3089 * Removed simplifier congruence rule of "prod_case", as has for long
3090 been the case with "split". INCOMPATIBILITY.
3092 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
3094 * Removed [split_format ... and ... and ...] version of
3095 [split_format]. Potential INCOMPATIBILITY.
3097 * Predicate "sorted" now defined inductively, with nice induction
3098 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
3100 * Constant "contents" renamed to "the_elem", to free the generic name
3101 contents for other uses. INCOMPATIBILITY.
3103 * Renamed class eq and constant eq (for code generation) to class
3104 equal and constant equal, plus renaming of related facts and various
3105 tuning. INCOMPATIBILITY.
3107 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
3109 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
3112 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
3113 avoid confusion with finite sets. INCOMPATIBILITY.
3115 * Abandoned locales equiv, congruent and congruent2 for equivalence
3116 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
3119 * Some previously unqualified names have been qualified:
3126 Trueprop ~> HOL.Trueprop
3131 op --> ~> HOL.implies
3143 Pair ~> Product_Type.Pair
3144 fst ~> Product_Type.fst
3145 snd ~> Product_Type.snd
3146 curry ~> Product_Type.curry
3148 Collect ~> Set.Collect
3152 * More canonical naming convention for some fundamental definitions:
3154 bot_bool_eq ~> bot_bool_def
3155 top_bool_eq ~> top_bool_def
3156 inf_bool_eq ~> inf_bool_def
3157 sup_bool_eq ~> sup_bool_def
3158 bot_fun_eq ~> bot_fun_def
3159 top_fun_eq ~> top_fun_def
3160 inf_fun_eq ~> inf_fun_def
3161 sup_fun_eq ~> sup_fun_def
3165 * More stylized fact names:
3167 expand_fun_eq ~> fun_eq_iff
3168 expand_set_eq ~> set_eq_iff
3170 nat_number ~> eval_nat_numeral
3174 * Refactoring of code-generation specific operations in theory List:
3180 mem_iff ~> member_def
3181 null_empty ~> null_def
3183 INCOMPATIBILITY. Note that these were not supposed to be used
3184 regularly unless for striking reasons; their main purpose was code
3187 Various operations from the Haskell prelude are used for generating
3190 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3191 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3192 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3194 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3195 "*" and "+" respectively. INCOMPATIBILITY.
3197 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3198 "Sum_Type.Plus" instead.
3200 * Constant "split" has been merged with constant "prod_case"; names of
3201 ML functions, facts etc. involving split have been retained so far,
3202 though. INCOMPATIBILITY.
3204 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3205 instead. INCOMPATIBILITY.
3207 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3210 * Former theory Library/Enum is now part of the HOL-Main image.
3211 INCOMPATIBILITY: all constants of the Enum theory now have to be
3212 referred to by its qualified name.
3215 nlists ~> Enum.nlists
3216 product ~> Enum.product
3218 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3219 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3222 * Theory Library/SetsAndFunctions has been split into
3223 Library/Function_Algebras and Library/Set_Algebras; canonical names
3224 for instance definitions for functions; various improvements.
3227 * Theory Library/Multiset provides stable quicksort implementation of
3230 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3233 * Session Multivariate_Analysis: introduced a type class for euclidean
3234 space. Most theorems are now stated in terms of euclidean spaces
3235 instead of finite cartesian products.
3238 real ^ 'n ~> 'a::real_vector
3239 ~> 'a::euclidean_space
3240 ~> 'a::ordered_euclidean_space
3241 (depends on your needs)
3245 \<chi> x. _ ~> \<chi>\<chi> x. _
3248 Also note that the indices are now natural numbers and not from some
3249 finite type. Finite cartesian products of euclidean spaces, products
3250 of euclidean spaces the real and complex numbers are instantiated to
3251 be euclidean_spaces. INCOMPATIBILITY.
3253 * Session Probability: introduced pextreal as positive extended real
3254 numbers. Use pextreal as value for measures. Introduce the
3255 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3256 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3257 the integral in Multivariate Analysis. INCOMPATIBILITY.
3259 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3262 * Session SPARK (with image HOL-SPARK) provides commands to load and
3263 prove verification conditions generated by the SPARK Ada program
3264 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3269 * Theorems for additive ring operations (locale abelian_monoid and
3270 descendants) are generated by interpretation from their multiplicative
3271 counterparts. Names (in particular theorem names) have the mandatory
3272 qualifier 'add'. Previous theorem names are redeclared for
3275 * Structure "int_ring" is now an abbreviation (previously a
3276 definition). This fits more natural with advanced interpretations.
3281 * The domain package now runs in definitional mode by default: The
3282 former command 'new_domain' is now called 'domain'. To use the domain
3283 package in its original axiomatic mode, use 'domain (unsafe)'.
3286 * The new class "domain" is now the default sort. Class "predomain"
3287 is an unpointed version of "domain". Theories can be updated by
3288 replacing sort annotations as shown below. INCOMPATIBILITY.
3290 'a::type ~> 'a::countable
3291 'a::cpo ~> 'a::predomain
3292 'a::pcpo ~> 'a::domain
3294 * The old type class "rep" has been superseded by class "domain".
3295 Accordingly, users of the definitional package must remove any
3296 "default_sort rep" declarations. INCOMPATIBILITY.
3298 * The domain package (definitional mode) now supports unpointed
3299 predomain argument types, as long as they are marked 'lazy'. (Strict
3300 arguments must be in class "domain".) For example, the following
3301 domain definition now works:
3303 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3305 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3306 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3307 'a option, and 'a list. Additionally, it configures fixrec and the
3308 domain package to work with these types. For example:
3310 fixrec isInl :: "('a + 'b) u -> tr"
3311 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3313 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3315 * The "(permissive)" option of fixrec has been replaced with a
3316 per-equation "(unchecked)" option. See
3317 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3319 * The "bifinite" class no longer fixes a constant "approx"; the class
3320 now just asserts that such a function exists. INCOMPATIBILITY.
3322 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3323 defines an embedding of type 'a defl into udom by default; instances
3324 of "bifinite" and "domain" classes are available in
3325 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3327 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3329 * The predicate "directed" has been removed. INCOMPATIBILITY.
3331 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3333 * The function "cprod_map" has been renamed to "prod_map".
3336 * The monadic bind operator on each powerdomain has new binder syntax
3337 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3338 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3340 * The infix syntax for binary union on each powerdomain has changed
3341 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3342 syntax. INCOMPATIBILITY.
3344 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3345 still supported as an input translation.
3347 * Renamed some theorems (the original names are also still available).
3349 expand_fun_below ~> fun_below_iff
3350 below_fun_ext ~> fun_belowI
3351 expand_cfun_eq ~> cfun_eq_iff
3352 ext_cfun ~> cfun_eqI
3353 expand_cfun_below ~> cfun_below_iff
3354 below_cfun_ext ~> cfun_belowI
3355 cont2cont_Rep_CFun ~> cont2cont_APP
3357 * The Abs and Rep functions for various types have changed names.
3358 Related theorem names have also changed to match. INCOMPATIBILITY.
3360 Rep_CFun ~> Rep_cfun
3361 Abs_CFun ~> Abs_cfun
3362 Rep_Sprod ~> Rep_sprod
3363 Abs_Sprod ~> Abs_sprod
3364 Rep_Ssum ~> Rep_ssum
3365 Abs_Ssum ~> Abs_ssum
3367 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3368 been renamed to *_bottom_iff. INCOMPATIBILITY.
3370 * Various changes to bisimulation/coinduction with domain package:
3372 - Definitions of "bisim" constants no longer mention definedness.
3373 - With mutual recursion, "bisim" predicate is now curried.
3374 - With mutual recursion, each type gets a separate coind theorem.
3375 - Variable names in bisim_def and coinduct rules have changed.
3379 * Case combinators generated by the domain package for type "foo" are
3380 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3382 * Several theorems have been renamed to more accurately reflect the
3383 names of constants and types involved. INCOMPATIBILITY.
3385 thelub_const ~> lub_const
3386 lub_const ~> is_lub_const
3388 is_lub_lub ~> is_lubD2
3390 unique_lub ~> is_lub_unique
3391 is_ub_lub ~> is_lub_rangeD1
3392 lub_bin_chain ~> is_lub_bin_chain
3393 lub_fun ~> is_lub_fun
3394 thelub_fun ~> lub_fun
3395 thelub_cfun ~> lub_cfun
3396 thelub_Pair ~> lub_Pair
3397 lub_cprod ~> is_lub_prod
3398 thelub_cprod ~> lub_prod
3399 minimal_cprod ~> minimal_prod
3400 inst_cprod_pcpo ~> inst_prod_pcpo
3402 compact_UU ~> compact_bottom
3403 deflation_UU ~> deflation_bottom
3404 finite_deflation_UU ~> finite_deflation_bottom
3406 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3408 sq_ord_less_eq_trans ~> below_eq_trans
3409 sq_ord_eq_less_trans ~> eq_below_trans
3410 refl_less ~> below_refl
3411 trans_less ~> below_trans
3412 antisym_less ~> below_antisym
3413 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3414 box_less ~> box_below
3415 rev_trans_less ~> rev_below_trans
3416 not_less2not_eq ~> not_below2not_eq
3417 less_UU_iff ~> below_UU_iff
3418 flat_less_iff ~> flat_below_iff
3419 adm_less ~> adm_below
3420 adm_not_less ~> adm_not_below
3421 adm_compact_not_less ~> adm_compact_not_below
3422 less_fun_def ~> below_fun_def
3423 expand_fun_less ~> fun_below_iff
3424 less_fun_ext ~> fun_belowI
3425 less_discr_def ~> below_discr_def
3426 discr_less_eq ~> discr_below_eq
3427 less_unit_def ~> below_unit_def
3428 less_cprod_def ~> below_prod_def
3429 prod_lessI ~> prod_belowI
3430 Pair_less_iff ~> Pair_below_iff
3431 fst_less_iff ~> fst_below_iff
3432 snd_less_iff ~> snd_below_iff
3433 expand_cfun_less ~> cfun_below_iff
3434 less_cfun_ext ~> cfun_belowI
3435 injection_less ~> injection_below
3436 less_up_def ~> below_up_def
3437 not_Iup_less ~> not_Iup_below
3438 Iup_less ~> Iup_below
3440 Def_inject_less_eq ~> Def_below_Def
3441 Def_less_is_eq ~> Def_below_iff
3442 spair_less_iff ~> spair_below_iff
3443 less_sprod ~> below_sprod
3444 spair_less ~> spair_below
3445 sfst_less_iff ~> sfst_below_iff
3446 ssnd_less_iff ~> ssnd_below_iff
3447 fix_least_less ~> fix_least_below
3448 dist_less_one ~> dist_below_one
3449 less_ONE ~> below_ONE
3450 ONE_less_iff ~> ONE_below_iff
3451 less_sinlD ~> below_sinlD
3452 less_sinrD ~> below_sinrD
3457 * All constant names are now qualified internally and use proper
3458 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3463 * Antiquotation @{assert} inlines a function bool -> unit that raises
3464 Fail if the argument is false. Due to inlining the source position of
3465 failed assertions is included in the error output.
3467 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3468 text is in practice always evaluated with a stable theory checkpoint.
3469 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3471 * Antiquotation @{theory A} refers to theory A from the ancestry of
3472 the current context, not any accidental theory loader state as before.
3473 Potential INCOMPATIBILITY, subtle change in semantics.
3475 * Syntax.pretty_priority (default 0) configures the required priority
3476 of pretty-printed output and thus affects insertion of parentheses.
3478 * Syntax.default_root (default "any") configures the inner syntax
3479 category (nonterminal symbol) for parsing of terms.
3481 * Former exception Library.UnequalLengths now coincides with
3482 ListPair.UnequalLengths.
3484 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3485 main functionality is provided by structure Simplifier.
3487 * Renamed raw "explode" function to "raw_explode" to emphasize its
3488 meaning. Note that internally to Isabelle, Symbol.explode is used in
3489 almost all situations.
3491 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3492 See implementation manual for further details on exceptions in
3495 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3498 * Renamed structure PureThy to Pure_Thy and moved most of its
3499 operations to structure Global_Theory, to emphasize that this is
3500 rarely-used global-only stuff.
3502 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3503 instead (or tracing for high-volume output).
3505 * Configuration option show_question_marks only affects regular pretty
3506 printing of types and terms, not raw Term.string_of_vname.
3508 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3509 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3510 @{thms} for most purposes.
3512 * ML structure Unsynchronized is never opened, not even in Isar
3513 interaction mode as before. Old Unsynchronized.set etc. have been
3514 discontinued -- use plain := instead. This should be *rare* anyway,
3515 since modern tools always work via official context data, notably
3516 configuration options.
3518 * Parallel and asynchronous execution requires special care concerning
3519 interrupts. Structure Exn provides some convenience functions that
3520 avoid working directly with raw Interrupt. User code must not absorb
3521 interrupts -- intermediate handling (for cleanup etc.) needs to be
3522 followed by re-raising of the original exception. Another common
3523 source of mistakes are "handle _" patterns, which make the meaning of
3524 the program subject to physical effects of the environment.
3528 New in Isabelle2009-2 (June 2010)
3529 ---------------------------------
3533 * Authentic syntax for *all* logical entities (type classes, type
3534 constructors, term constants): provides simple and robust
3535 correspondence between formal entities and concrete syntax. Within
3536 the parse tree / AST representations, "constants" are decorated by
3537 their category (class, type, const) and spelled out explicitly with
3538 their full internal name.
3540 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3541 and translations (translation rules and translation functions in ML).
3542 Some hints on upgrading:
3544 - Many existing uses of 'syntax' and 'translations' can be replaced
3545 by more modern 'type_notation', 'notation' and 'abbreviation',
3546 which are independent of this issue.
3548 - 'translations' require markup within the AST; the term syntax
3549 provides the following special forms:
3551 CONST c -- produces syntax version of constant c from context
3552 XCONST c -- literally c, checked as constant from context
3553 c -- literally c, if declared by 'syntax'
3555 Plain identifiers are treated as AST variables -- occasionally the
3556 system indicates accidental variables via the error "rhs contains
3559 Type classes and type constructors are marked according to their
3560 concrete syntax. Some old translations rules need to be written
3561 for the "type" category, using type constructor application
3562 instead of pseudo-term application of the default category
3565 - 'parse_translation' etc. in ML may use the following
3568 @{class_syntax c} -- type class c within parse tree / AST
3569 @{term_syntax c} -- type constructor c within parse tree / AST
3570 @{const_syntax c} -- ML version of "CONST c" above
3571 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3573 - Literal types within 'typed_print_translations', i.e. those *not*
3574 represented as pseudo-terms are represented verbatim. Use @{class
3575 c} or @{type_name c} here instead of the above syntax
3578 Note that old non-authentic syntax was based on unqualified base
3579 names, so all of the above "constant" names would coincide. Recall
3580 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3581 diagnose syntax problems.
3583 * Type constructors admit general mixfix syntax, not just infix.
3585 * Concrete syntax may be attached to local entities without a proof
3586 body, too. This works via regular mixfix annotations for 'fix',
3587 'def', 'obtain' etc. or via the explicit 'write' command, which is
3588 similar to the 'notation' command in theory specifications.
3590 * Discontinued unnamed infix syntax (legacy feature for many years) --
3591 need to specify constant name and syntax separately. Internal ML
3592 datatype constructors have been renamed from InfixName to Infix etc.
3593 Minor INCOMPATIBILITY.
3595 * Schematic theorem statements need to be explicitly markup as such,
3596 via commands 'schematic_lemma', 'schematic_theorem',
3597 'schematic_corollary'. Thus the relevance of the proof is made
3598 syntactically clear, which impacts performance in a parallel or
3599 asynchronous interactive environment. Minor INCOMPATIBILITY.
3601 * Use of cumulative prems via "!" in some proof methods has been
3602 discontinued (old legacy feature).
3604 * References 'trace_simp' and 'debug_simp' have been replaced by
3605 configuration options stored in the context. Enabling tracing (the
3606 case of debugging is similar) in proofs works via
3608 using [[trace_simp = true]]
3610 Tracing is then active for all invocations of the simplifier in
3611 subsequent goal refinement steps. Tracing may also still be enabled or
3612 disabled via the ProofGeneral settings menu.
3614 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3615 'hide_fact' replace the former 'hide' KIND command. Minor
3618 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3619 more efficient than combinations with -q1 or -q2.
3624 * Proofterms record type-class reasoning explicitly, using the
3625 "unconstrain" operation internally. This eliminates all sort
3626 constraints from a theorem and proof, introducing explicit
3627 OFCLASS-premises. On the proof term level, this operation is
3628 automatically applied at theorem boundaries, such that closed proofs
3629 are always free of sort constraints. INCOMPATIBILITY for tools that
3630 inspect proof terms.
3632 * Local theory specifications may depend on extra type variables that
3633 are not present in the result type -- arguments TYPE('a) :: 'a itself
3634 are added internally. For example:
3636 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3638 * Predicates of locales introduced by classes carry a mandatory
3639 "class" prefix. INCOMPATIBILITY.
3641 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3643 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3646 * Command 'code_reflect' allows to incorporate generated ML code into
3647 runtime environment; replaces immature code_datatype antiquotation.
3650 * Code generator: simple concept for abstract datatypes obeying
3653 * Code generator: details of internal data cache have no impact on the
3654 user space functionality any longer.
3656 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3657 subgoals. This is more appropriate for interpretations with 'where'.
3660 * Command 'example_proof' opens an empty proof body. This allows to
3661 experiment with Isar, without producing any persistent result.
3663 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3664 within a local theory context, with explicit checking of the
3665 constructors involved (in contrast to the raw 'syntax' versions).
3667 * Commands 'types' and 'typedecl' now work within a local theory
3668 context -- without introducing dependencies on parameters or
3669 assumptions, which is not possible in Isabelle/Pure.
3671 * Command 'defaultsort' has been renamed to 'default_sort', it works
3672 within a local theory context. Minor INCOMPATIBILITY.
3677 * Command 'typedef' now works within a local theory context -- without
3678 introducing dependencies on parameters or assumptions, which is not
3679 possible in Isabelle/Pure/HOL. Note that the logical environment may
3680 contain multiple interpretations of local typedefs (with different
3681 non-emptiness proofs), even in a global theory context.
3683 * New package for quotient types. Commands 'quotient_type' and
3684 'quotient_definition' may be used for defining types and constants by
3685 quotient constructions. An example is the type of integers created by
3686 quotienting pairs of natural numbers:
3689 intrel :: "(nat * nat) => (nat * nat) => bool"
3691 "intrel (x, y) (u, v) = (x + v = u + y)"
3693 quotient_type int = "nat * nat" / intrel
3694 by (auto simp add: equivp_def expand_fun_eq)
3697 "0::int" is "(0::nat, 0::nat)"
3699 The method "lifting" can be used to lift of theorems from the
3700 underlying "raw" type to the quotient type. The example
3701 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3702 construction and provides a reasoning infrastructure for finite sets.
3704 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3705 clash with new theory Quotient in Main HOL.
3707 * Moved the SMT binding into the main HOL session, eliminating
3708 separate HOL-SMT session.
3710 * List membership infix mem operation is only an input abbreviation.
3713 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3714 for future developements; former Library/Word.thy is still present in
3715 the AFP entry RSAPPS.
3717 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3718 longer shadowed. INCOMPATIBILITY.
3720 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3723 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3726 * Dropped normalizing_semiring etc; use the facts in semiring classes
3727 instead. INCOMPATIBILITY.
3729 * Dropped several real-specific versions of lemmas about floor and
3730 ceiling; use the generic lemmas from theory "Archimedean_Field"
3731 instead. INCOMPATIBILITY.
3733 floor_number_of_eq ~> floor_number_of
3734 le_floor_eq_number_of ~> number_of_le_floor
3735 le_floor_eq_zero ~> zero_le_floor
3736 le_floor_eq_one ~> one_le_floor
3737 floor_less_eq_number_of ~> floor_less_number_of
3738 floor_less_eq_zero ~> floor_less_zero
3739 floor_less_eq_one ~> floor_less_one
3740 less_floor_eq_number_of ~> number_of_less_floor
3741 less_floor_eq_zero ~> zero_less_floor
3742 less_floor_eq_one ~> one_less_floor
3743 floor_le_eq_number_of ~> floor_le_number_of
3744 floor_le_eq_zero ~> floor_le_zero
3745 floor_le_eq_one ~> floor_le_one
3746 floor_subtract_number_of ~> floor_diff_number_of
3747 floor_subtract_one ~> floor_diff_one
3748 ceiling_number_of_eq ~> ceiling_number_of
3749 ceiling_le_eq_number_of ~> ceiling_le_number_of
3750 ceiling_le_zero_eq ~> ceiling_le_zero
3751 ceiling_le_eq_one ~> ceiling_le_one
3752 less_ceiling_eq_number_of ~> number_of_less_ceiling
3753 less_ceiling_eq_zero ~> zero_less_ceiling
3754 less_ceiling_eq_one ~> one_less_ceiling
3755 ceiling_less_eq_number_of ~> ceiling_less_number_of
3756 ceiling_less_eq_zero ~> ceiling_less_zero
3757 ceiling_less_eq_one ~> ceiling_less_one
3758 le_ceiling_eq_number_of ~> number_of_le_ceiling
3759 le_ceiling_eq_zero ~> zero_le_ceiling
3760 le_ceiling_eq_one ~> one_le_ceiling
3761 ceiling_subtract_number_of ~> ceiling_diff_number_of
3762 ceiling_subtract_one ~> ceiling_diff_one
3764 * Theory "Finite_Set": various folding_XXX locales facilitate the
3765 application of the various fold combinators on finite sets.
3767 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3768 provides abstract red-black tree type which is backed by "RBT_Impl" as
3769 implementation. INCOMPATIBILTY.
3771 * Theory Library/Coinductive_List has been removed -- superseded by
3772 AFP/thys/Coinductive.
3774 * Theory PReal, including the type "preal" and related operations, has
3775 been removed. INCOMPATIBILITY.
3777 * Real: new development using Cauchy Sequences.
3779 * Split off theory "Big_Operators" containing setsum, setprod,
3780 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3782 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3783 "Int" etc. INCOMPATIBILITY.
3785 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3787 * New set of rules "ac_simps" provides combined assoc / commute
3788 rewrites for all interpretations of the appropriate generic locales.
3790 * Renamed theory "OrderedGroup" to "Groups" and split theory
3791 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3792 appropriate and more consistent names suitable for name prefixes
3793 within the HOL theories. INCOMPATIBILITY.
3795 * Some generic constants have been put to appropriate theories:
3796 - less_eq, less: Orderings
3797 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3798 - inverse, divide: Rings
3801 * More consistent naming of type classes involving orderings (and
3804 lower_semilattice ~> semilattice_inf
3805 upper_semilattice ~> semilattice_sup
3807 dense_linear_order ~> dense_linorder
3809 pordered_ab_group_add ~> ordered_ab_group_add
3810 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3811 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3812 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3813 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3814 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3815 pordered_cancel_semiring ~> ordered_cancel_semiring
3816 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3817 pordered_comm_ring ~> ordered_comm_ring
3818 pordered_comm_semiring ~> ordered_comm_semiring
3819 pordered_ring ~> ordered_ring
3820 pordered_ring_abs ~> ordered_ring_abs
3821 pordered_semiring ~> ordered_semiring
3823 ordered_ab_group_add ~> linordered_ab_group_add
3824 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3825 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3826 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3827 ordered_field ~> linordered_field
3828 ordered_field_no_lb ~> linordered_field_no_lb
3829 ordered_field_no_ub ~> linordered_field_no_ub
3830 ordered_field_dense_linear_order ~> dense_linordered_field
3831 ordered_idom ~> linordered_idom
3832 ordered_ring ~> linordered_ring
3833 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3834 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3835 ordered_ring_strict ~> linordered_ring_strict
3836 ordered_semidom ~> linordered_semidom
3837 ordered_semiring ~> linordered_semiring
3838 ordered_semiring_1 ~> linordered_semiring_1
3839 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3840 ordered_semiring_strict ~> linordered_semiring_strict
3842 The following slightly odd type classes have been moved to a
3843 separate theory Library/Lattice_Algebras:
3845 lordered_ab_group_add ~> lattice_ab_group_add
3846 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3847 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3848 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3849 lordered_ring ~> lattice_ring
3853 * Refined field classes:
3854 - classes division_ring_inverse_zero, field_inverse_zero,
3855 linordered_field_inverse_zero include rule inverse 0 = 0 --
3856 subsumes former division_by_zero class;
3857 - numerous lemmas have been ported from field to division_ring.
3860 * Refined algebra theorem collections:
3861 - dropped theorem group group_simps, use algebra_simps instead;
3862 - dropped theorem group ring_simps, use field_simps instead;
3863 - proper theorem collection field_simps subsumes former theorem
3864 groups field_eq_simps and field_simps;
3865 - dropped lemma eq_minus_self_iff which is a duplicate for
3869 * Theory Finite_Set and List: some lemmas have been generalized from
3872 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3873 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3874 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3875 union_Union_fold_union ~> sup_Sup_fold_sup
3876 Inter_fold_inter ~> Inf_fold_inf
3877 Union_fold_union ~> Sup_fold_sup
3878 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3879 union_UNION_fold_union ~> sup_SUPR_fold_sup
3880 INTER_fold_inter ~> INFI_fold_inf
3881 UNION_fold_union ~> SUPR_fold_sup
3883 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3884 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3885 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3886 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3887 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3888 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3890 * Reorganized theory Multiset: swapped notation of pointwise and
3893 - pointwise ordering is instance of class order with standard syntax
3895 - multiset ordering has syntax <=# and <#; partial order properties
3896 are provided by means of interpretation with prefix
3898 - less duplication, less historical organization of sections,
3899 conversion from associations lists to multisets, rudimentary code
3901 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3906 multiset_eq_conv_count_eq ~> multiset_ext_iff
3907 multi_count_ext ~> multiset_ext
3908 diff_union_inverse2 ~> diff_union_cancelR
3912 * Theory Permutation: replaced local "remove" by List.remove1.
3914 * Code generation: ML and OCaml code is decorated with signatures.
3916 * Theory List: added transpose.
3918 * Library/Nat_Bijection.thy is a collection of bijective functions
3919 between nat and other types, which supersedes the older libraries
3920 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3923 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3924 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3925 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3926 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3927 Countable.pair_encode ~> prod_encode
3928 NatIso.prod2nat ~> prod_encode
3929 NatIso.nat2prod ~> prod_decode
3930 NatIso.sum2nat ~> sum_encode
3931 NatIso.nat2sum ~> sum_decode
3932 NatIso.list2nat ~> list_encode
3933 NatIso.nat2list ~> list_decode
3934 NatIso.set2nat ~> set_encode
3935 NatIso.nat2set ~> set_decode
3938 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3939 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3940 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3941 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3942 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3943 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3944 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3945 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3946 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3947 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3948 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3949 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3950 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3953 - Renamed ATP commands:
3954 atp_info ~> sledgehammer running_atps
3955 atp_kill ~> sledgehammer kill_atps
3956 atp_messages ~> sledgehammer messages
3957 atp_minimize ~> sledgehammer minimize
3958 print_atps ~> sledgehammer available_atps
3960 - Added user's manual ("isabelle doc sledgehammer").
3961 - Added option syntax and "sledgehammer_params" to customize
3962 Sledgehammer's behavior. See the manual for details.
3963 - Modified the Isar proof reconstruction code so that it produces
3964 direct proofs rather than proofs by contradiction. (This feature
3965 is still experimental.)
3966 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3968 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3971 - Added and implemented "binary_ints" and "bits" options.
3972 - Added "std" option and implemented support for nonstandard models.
3973 - Added and implemented "finitize" option to improve the precision
3974 of infinite datatypes based on a monotonicity analysis.
3975 - Added support for quotient types.
3976 - Added support for "specification" and "ax_specification"
3978 - Added support for local definitions (for "function" and
3979 "termination" proofs).
3980 - Added support for term postprocessors.
3981 - Optimized "Multiset.multiset" and "FinFun.finfun".
3982 - Improved efficiency of "destroy_constrs" optimization.
3983 - Fixed soundness bugs related to "destroy_constrs" optimization and
3985 - Fixed soundness bug related to higher-order constructors.
3986 - Fixed soundness bug when "full_descrs" is enabled.
3987 - Improved precision of set constructs.
3988 - Added "atoms" option.
3989 - Added cache to speed up repeated Kodkod invocations on the same
3991 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3992 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3993 "SAT4J_Light". INCOMPATIBILITY.
3994 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3995 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3996 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3998 * Method "induct" now takes instantiations of the form t, where t is not
3999 a variable, as a shorthand for "x == t", where x is a fresh variable.
4000 If this is not intended, t has to be enclosed in parentheses.
4001 By default, the equalities generated by definitional instantiations
4002 are pre-simplified, which may cause parameters of inductive cases
4003 to disappear, or may even delete some of the inductive cases.
4004 Use "induct (no_simp)" instead of "induct" to restore the old
4005 behaviour. The (no_simp) option is also understood by the "cases"
4006 and "nominal_induct" methods, which now perform pre-simplification, too.
4012 * Variable names in lemmas generated by the domain package have
4013 changed; the naming scheme is now consistent with the HOL datatype
4014 package. Some proof scripts may be affected, INCOMPATIBILITY.
4016 * The domain package no longer defines the function "foo_copy" for
4017 recursive domain "foo". The reach lemma is now stated directly in
4018 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
4019 be reformulated in terms of "foo_take", INCOMPATIBILITY.
4021 * Most definedness lemmas generated by the domain package (previously
4022 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
4023 like "foo$x = UU <-> x = UU", which works better as a simp rule.
4024 Proofs that used definedness lemmas as intro rules may break,
4025 potential INCOMPATIBILITY.
4027 * Induction and casedist rules generated by the domain package now
4028 declare proper case_names (one called "bottom", and one named for each
4029 constructor). INCOMPATIBILITY.
4031 * For mutually-recursive domains, separate "reach" and "take_lemma"
4032 rules are generated for each domain, INCOMPATIBILITY.
4034 foo_bar.reach ~> foo.reach bar.reach
4035 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
4037 * Some lemmas generated by the domain package have been renamed for
4038 consistency with the datatype package, INCOMPATIBILITY.
4040 foo.ind ~> foo.induct
4041 foo.finite_ind ~> foo.finite_induct
4042 foo.coind ~> foo.coinduct
4043 foo.casedist ~> foo.exhaust
4044 foo.exhaust ~> foo.nchotomy
4046 * For consistency with other definition packages, the fixrec package
4047 now generates qualified theorem names, INCOMPATIBILITY.
4049 foo_simps ~> foo.simps
4050 foo_unfold ~> foo.unfold
4051 foo_induct ~> foo.induct
4053 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
4054 method and internal fixrec proofs now use the default simpset instead.
4057 * The "contlub" predicate has been removed. Proof scripts should use
4058 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
4060 * The "admw" predicate has been removed, INCOMPATIBILITY.
4062 * The constants cpair, cfst, and csnd have been removed in favor of
4063 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
4068 * Antiquotations for basic formal entities:
4070 @{class NAME} -- type class
4071 @{class_syntax NAME} -- syntax representation of the above
4073 @{type_name NAME} -- logical type
4074 @{type_abbrev NAME} -- type abbreviation
4075 @{nonterminal NAME} -- type of concrete syntactic category
4076 @{type_syntax NAME} -- syntax representation of any of the above
4078 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
4079 @{const_abbrev NAME} -- abbreviated constant
4080 @{const_syntax NAME} -- syntax representation of any of the above
4082 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
4083 syntax constant (cf. 'syntax' command).
4085 * Antiquotation @{make_string} inlines a function to print arbitrary
4086 values similar to the ML toplevel. The result is compiler dependent
4087 and may fall back on "?" in certain situations.
4089 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
4090 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
4091 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
4092 not work with the asynchronous Isar document model.
4094 * Configuration options now admit dynamic default values, depending on
4095 the context or even global references.
4097 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
4098 uses an efficient external library if available (for Poly/ML).
4100 * Renamed some important ML structures, while keeping the old names
4101 for some time as aliases within the structure Legacy:
4103 OuterKeyword ~> Keyword
4106 OuterSyntax ~> Outer_Syntax
4107 PrintMode ~> Print_Mode
4108 SpecParse ~> Parse_Spec
4111 ThyOutput ~> Thy_Output
4112 TypeInfer ~> Type_Infer
4114 Note that "open Legacy" simplifies porting of sources, but forgetting
4115 to remove it again will complicate porting again in the future.
4117 * Most operations that refer to a global context are named
4118 accordingly, e.g. Simplifier.global_context or
4119 ProofContext.init_global. There are some situations where a global
4120 context actually works, but under normal circumstances one needs to
4121 pass the proper local context through the code!
4123 * Discontinued old TheoryDataFun with its copy/init operation -- data
4124 needs to be pure. Functor Theory_Data_PP retains the traditional
4125 Pretty.pp argument to merge, which is absent in the standard
4126 Theory_Data version.
4128 * Sorts.certify_sort and derived "cert" operations for types and terms
4129 no longer minimize sorts. Thus certification at the boundary of the
4130 inference kernel becomes invariant under addition of class relations,
4131 which is an important monotonicity principle. Sorts are now minimized
4132 in the syntax layer only, at the boundary between the end-user and the
4133 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4134 explicitly in rare situations.
4136 * Renamed old-style Drule.standard to Drule.export_without_context, to
4137 emphasize that this is in no way a standard operation.
4140 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4141 usual for resolution. Rare INCOMPATIBILITY.
4143 * Renamed varify/unvarify operations to varify_global/unvarify_global
4144 to emphasize that these only work in a global situation (which is
4147 * Curried take and drop in library.ML; negative length is interpreted
4148 as infinity (as in chop). Subtle INCOMPATIBILITY.
4150 * Proof terms: type substitutions on proof constants now use canonical
4151 order of type variables. INCOMPATIBILITY for tools working with proof
4154 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4155 may no longer carry premises. User-level specifications are
4156 transformed accordingly by Thm.add_axiom/add_def.
4161 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4162 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4163 proof terms are enabled unconditionally in the new HOL-Proofs image.
4165 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4166 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4169 * Old lib/scripts/polyml-platform is superseded by the
4170 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4171 variant, even on a 64 bit machine. The following example setting
4172 prefers 64 bit if available:
4174 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4176 * The preliminary Isabelle/jEdit application demonstrates the emerging
4177 Isabelle/Scala layer for advanced prover interaction and integration.
4178 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4181 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4182 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4183 similar to the default assignment of the document preparation system
4184 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4185 provides some operations for direct access to the font without asking
4186 the user for manual installation.
4190 New in Isabelle2009-1 (December 2009)
4191 -------------------------------------
4195 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4196 one backslash should be used, even in ML sources.
4201 * Locale interpretation propagates mixins along the locale hierarchy.
4202 The currently only available mixins are the equations used to map
4203 local definitions to terms of the target domain of an interpretation.
4205 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4206 loc" to print all interpretations of locale "loc" in the theory.
4207 Interpretations in proofs are not shown.
4209 * Thoroughly revised locales tutorial. New section on conditional
4212 * On instantiation of classes, remaining undefined class parameters
4213 are formally declared. INCOMPATIBILITY.
4216 *** Document preparation ***
4218 * New generalized style concept for printing terms: @{foo (style) ...}
4219 instead of @{foo_style style ...} (old form is still retained for
4220 backward compatibility). Styles can be also applied for
4221 antiquotations prop, term_type and typeof.
4226 * New proof method "smt" for a combination of first-order logic with
4227 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4228 fixed-size bitvectors; there is also basic support for higher-order
4229 features (esp. lambda abstractions). It is an incomplete decision
4230 procedure based on external SMT solvers using the oracle mechanism;
4231 for the SMT solver Z3, this method is proof-producing. Certificates
4232 are provided to avoid calling the external solvers solely for
4233 re-checking proofs. Due to a remote SMT service there is no need for
4234 installing SMT solvers locally. See src/HOL/SMT.
4236 * New commands to load and prove verification conditions generated by
4237 the Boogie program verifier or derived systems (e.g. the Verifying C
4238 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4240 * New counterexample generator tool 'nitpick' based on the Kodkod
4241 relational model finder. See src/HOL/Tools/Nitpick and
4242 src/HOL/Nitpick_Examples.
4244 * New commands 'code_pred' and 'values' to invoke the predicate
4245 compiler and to enumerate values of inductive predicates.
4247 * A tabled implementation of the reflexive transitive closure.
4249 * New implementation of quickcheck uses generic code generator;
4250 default generators are provided for all suitable HOL types, records
4251 and datatypes. Old quickcheck can be re-activated importing theory
4252 Library/SML_Quickcheck.
4254 * New testing tool Mirabelle for automated proof tools. Applies
4255 several tools and tactics like sledgehammer, metis, or quickcheck, to
4256 every proof step in a theory. To be used in batch mode via the
4257 "mirabelle" utility.
4259 * New proof method "sos" (sum of squares) for nonlinear real
4260 arithmetic (originally due to John Harison). It requires theory
4261 Library/Sum_Of_Squares. It is not a complete decision procedure but
4262 works well in practice on quantifier-free real arithmetic with +, -,
4263 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4264 inequalities between polynomials. It makes use of external
4265 semidefinite programming solvers. Method "sos" generates a
4266 certificate that can be pasted into the proof thus avoiding the need
4267 to call an external tool every time the proof is checked. See
4268 src/HOL/Library/Sum_Of_Squares.
4270 * New method "linarith" invokes existing linear arithmetic decision
4273 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4275 * New Sledgehammer option "Full Types" in Proof General settings menu.
4276 Causes full type information to be output to the ATPs. This slows
4277 ATPs down considerably but eliminates a source of unsound "proofs"
4280 * New method "metisFT": A version of metis that uses full type
4281 information in order to avoid failures of proof reconstruction.
4283 * New evaluator "approximate" approximates an real valued term using
4284 the same method as the approximation method.
4286 * Method "approximate" now supports arithmetic expressions as
4287 boundaries of intervals and implements interval splitting and Taylor
4290 * ML antiquotation @{code_datatype} inserts definition of a datatype
4291 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4293 * New theory SupInf of the supremum and infimum operators for sets of
4296 * New theory Probability, which contains a development of measure
4297 theory, eventually leading to Lebesgue integration and probability.
4299 * Extended Multivariate Analysis to include derivation and Brouwer's
4302 * Reorganization of number theory, INCOMPATIBILITY:
4303 - new number theory development for nat and int, in theories Divides
4304 and GCD as well as in new session Number_Theory
4305 - some constants and facts now suffixed with _nat and _int
4307 - former session NumberTheory now named Old_Number_Theory, including
4308 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4309 - moved theory Pocklington from src/HOL/Library to
4310 src/HOL/Old_Number_Theory
4312 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4313 lcm of finite and infinite sets. It is shown that they form a complete
4316 * Class semiring_div requires superclass no_zero_divisors and proof of
4317 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4318 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4319 generalized to class semiring_div, subsuming former theorems
4320 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4321 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4324 * Refinements to lattice classes and sets:
4325 - less default intro/elim rules in locale variant, more default
4326 intro/elim rules in class variant: more uniformity
4327 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4329 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4331 - renamed ACI to inf_sup_aci
4332 - new class "boolean_algebra"
4333 - class "complete_lattice" moved to separate theory
4334 "Complete_Lattice"; corresponding constants (and abbreviations)
4335 renamed and with authentic syntax:
4336 Set.Inf ~> Complete_Lattice.Inf
4337 Set.Sup ~> Complete_Lattice.Sup
4338 Set.INFI ~> Complete_Lattice.INFI
4339 Set.SUPR ~> Complete_Lattice.SUPR
4340 Set.Inter ~> Complete_Lattice.Inter
4341 Set.Union ~> Complete_Lattice.Union
4342 Set.INTER ~> Complete_Lattice.INTER
4343 Set.UNION ~> Complete_Lattice.UNION
4344 - authentic syntax for
4347 - mere abbreviations:
4350 Set.inter (for inf, formerly Set.Int)
4351 Set.union (for sup, formerly Set.Un)
4352 Complete_Lattice.Inter (for Inf)
4353 Complete_Lattice.Union (for Sup)
4354 Complete_Lattice.INTER (for INFI)
4355 Complete_Lattice.UNION (for SUPR)
4356 - object-logic definitions as far as appropriate
4358 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4359 Un_subset_iff are explicitly deleted as default simp rules; then also
4360 their lattice counterparts le_inf_iff and le_sup_iff have to be
4361 deleted to achieve the desired effect.
4363 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4364 rules by default any longer; the same applies to min_max.inf_absorb1
4365 etc. INCOMPATIBILITY.
4367 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4368 pred_set_conv by default. INCOMPATIBILITY.
4370 * Power operations on relations and functions are now one dedicated
4371 constant "compow" with infix syntax "^^". Power operation on
4372 multiplicative monoids retains syntax "^" and is now defined generic
4373 in class power. INCOMPATIBILITY.
4375 * Relation composition "R O S" now has a more standard argument order:
4376 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4377 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4378 break, since the O_assoc rule was not rewritten like this. Fix using
4379 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4381 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4382 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4385 * Most rules produced by inductive and datatype package have mandatory
4386 prefixes. INCOMPATIBILITY.
4388 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4389 the attribute of the same name. Each of the theorems in the list
4390 DERIV_intros assumes composition with an additional function and
4391 matches a variable to the derivative, which has to be solved by the
4392 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4393 of most elementary terms. Former Maclauren.DERIV_tac and
4394 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4397 * Code generator attributes follow the usual underscore convention:
4398 code_unfold replaces code unfold
4399 code_post replaces code post
4404 sizechange -> size_change
4405 induct_scheme -> induction_schema
4408 * Discontinued abbreviation "arbitrary" of constant "undefined".
4409 INCOMPATIBILITY, use "undefined" directly.
4412 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4413 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4414 Suc_plus1 -> Suc_eq_plus1
4415 *anti_sym -> *antisym*
4416 vector_less_eq_def -> vector_le_def
4419 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4422 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4428 * Theory Representable defines a class "rep" of domains that are
4429 representable (via an ep-pair) in the universal domain type "udom".
4430 Instances are provided for all type constructors defined in HOLCF.
4432 * The 'new_domain' command is a purely definitional version of the
4433 domain package, for representable domains. Syntax is identical to the
4434 old domain package. The 'new_domain' package also supports indirect
4435 recursion using previously-defined type constructors. See
4436 src/HOLCF/ex/New_Domain.thy for examples.
4438 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4439 on the left-hand side of an equation, and then performs
4440 simplification. Rewriting is done using rules declared with the
4441 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4442 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4444 * The pattern-match compiler in 'fixrec' can now handle constructors
4445 with HOL function types. Pattern-match combinators for the Pair
4446 constructor are pre-configured.
4448 * The 'fixrec' package now produces better fixed-point induction rules
4449 for mutually-recursive definitions: Induction rules have conclusions
4450 of the form "P foo bar" instead of "P <foo, bar>".
4452 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4453 been renamed to "below". The name "below" now replaces "less" in many
4454 theorem names. (Legacy theorem names using "less" are still supported
4457 * The 'fixrec' package now supports "bottom patterns". Bottom
4458 patterns can be used to generate strictness rules, or to make
4459 functions more strict (much like the bang-patterns supported by the
4460 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4466 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4467 errors and run-time exceptions, including detailed source positions.
4469 * Structure Name_Space (formerly NameSpace) now manages uniquely
4470 identified entries, with some additional information such as source
4471 position, logical grouping etc.
4473 * Theory and context data is now introduced by the simplified and
4474 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4475 to be pure, but the old TheoryDataFun for mutable data (with explicit
4476 copy operation) is still available for some time.
4478 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4479 provides a high-level programming interface to synchronized state
4480 variables with atomic update. This works via pure function
4481 application within a critical section -- its runtime should be as
4482 short as possible; beware of deadlocks if critical code is nested,
4483 either directly or indirectly via other synchronized variables!
4485 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4486 wraps raw ML references, explicitly indicating their non-thread-safe
4487 behaviour. The Isar toplevel keeps this structure open, to
4488 accommodate Proof General as well as quick and dirty interactive
4489 experiments with references.
4491 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4492 parallel tactical reasoning.
4494 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4495 are similar to SUBPROOF, but are slightly more flexible: only the
4496 specified parts of the subgoal are imported into the context, and the
4497 body tactic may introduce new subgoals and schematic variables.
4499 * Old tactical METAHYPS, which does not observe the proof context, has
4500 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4501 or Subgoal.FOCUS etc.
4503 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4504 functors have their own ML name space there is no point to mark them
4505 separately.) Minor INCOMPATIBILITY.
4507 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4509 * Renamed several structures FooBar to Foo_Bar. Occasional,
4512 * Operations of structure Skip_Proof no longer require quick_and_dirty
4513 mode, which avoids critical setmp.
4515 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4516 combinators for "args". INCOMPATIBILITY, need to use simplified
4517 Attrib/Method.setup introduced in Isabelle2009.
4519 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4520 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4521 last resort. INCOMPATIBILITY.
4523 * Display.pretty_thm now requires a proper context (cf. former
4524 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4525 or even Display.pretty_thm_without_context as last resort.
4528 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4529 Syntax.pretty_typ/term directly, preferably with proper context
4530 instead of global theory.
4535 * Further fine tuning of parallel proof checking, scales up to 8 cores
4536 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4539 * Support for additional "Isabelle components" via etc/components, see
4540 also the system manual.
4542 * The isabelle makeall tool now operates on all components with
4543 IsaMakefile, not just hardwired "logics".
4545 * Removed "compress" option from isabelle-process and isabelle usedir;
4546 this is always enabled.
4548 * Discontinued support for Poly/ML 4.x versions.
4550 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4551 on a given logic image. This requires the lighttpd webserver and is
4552 currently supported on Linux only.
4556 New in Isabelle2009 (April 2009)
4557 --------------------------------
4561 * Simplified main Isabelle executables, with less surprises on
4562 case-insensitive file-systems (such as Mac OS).
4564 - The main Isabelle tool wrapper is now called "isabelle" instead of
4567 - The former "isabelle" alias for "isabelle-process" has been
4568 removed (should rarely occur to regular users).
4570 - The former "isabelle-interface" and its alias "Isabelle" have been
4571 removed (interfaces are now regular Isabelle tools).
4573 Within scripts and make files, the Isabelle environment variables
4574 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4575 respectively. (The latter are still available as legacy feature.)
4577 The old isabelle-interface wrapper could react in confusing ways if
4578 the interface was uninstalled or changed otherwise. Individual
4579 interface tool configuration is now more explicit, see also the
4580 Isabelle system manual. In particular, Proof General is now available
4581 via "isabelle emacs".
4583 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4584 purge installed copies of Isabelle executables and re-run "isabelle
4585 install -p ...", or use symlinks.
4587 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4588 old ~/isabelle, which was slightly non-standard and apt to cause
4589 surprises on case-insensitive file-systems (such as Mac OS).
4591 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4592 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4593 care is required when using older releases of Isabelle. Note that
4594 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4595 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4597 * Proofs of fully specified statements are run in parallel on
4598 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4599 a regular 4-core machine, if the initial heap space is made reasonably
4600 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4602 * The main reference manuals ("isar-ref", "implementation", and
4603 "system") have been updated and extended. Formally checked references
4604 as hyperlinks are now available uniformly.
4609 * Complete re-implementation of locales. INCOMPATIBILITY in several
4610 respects. The most important changes are listed below. See the
4611 Tutorial on Locales ("locales" manual) for details.
4613 - In locale expressions, instantiation replaces renaming. Parameters
4614 must be declared in a for clause. To aid compatibility with previous
4615 parameter inheritance, in locale declarations, parameters that are not
4616 'touched' (instantiation position "_" or omitted) are implicitly added
4617 with their syntax at the beginning of the for clause.
4619 - Syntax from abbreviations and definitions in locales is available in
4620 locale expressions and context elements. The latter is particularly
4621 useful in locale declarations.
4623 - More flexible mechanisms to qualify names generated by locale
4624 expressions. Qualifiers (prefixes) may be specified in locale
4625 expressions, and can be marked as mandatory (syntax: "name!:") or
4626 optional (syntax "name?:"). The default depends for plain "name:"
4627 depends on the situation where a locale expression is used: in
4628 commands 'locale' and 'sublocale' prefixes are optional, in
4629 'interpretation' and 'interpret' prefixes are mandatory. The old
4630 implicit qualifiers derived from the parameter names of a locale are
4631 no longer generated.
4633 - Command "sublocale l < e" replaces "interpretation l < e". The
4634 instantiation clause in "interpretation" and "interpret" (square
4635 brackets) is no longer available. Use locale expressions.
4637 - When converting proof scripts, mandatory qualifiers in
4638 'interpretation' and 'interpret' should be retained by default, even
4639 if this is an INCOMPATIBILITY compared to former behavior. In the
4640 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4641 in locale expressions range over a single locale instance only.
4643 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4644 In existing theorem specifications replace the includes element by the
4645 respective context elements of the included locale, omitting those
4646 that are already present in the theorem specification. Multiple
4647 assume elements of a locale should be replaced by a single one
4648 involving the locale predicate. In the proof body, declarations (most
4649 notably theorems) may be regained by interpreting the respective
4650 locales in the proof context as required (command "interpret").
4652 If using "includes" in replacement of a target solely because the
4653 parameter types in the theorem are not as general as in the target,
4654 consider declaring a new locale with additional type constraints on
4655 the parameters (context element "constrains").
4657 - Discontinued "locale (open)". INCOMPATIBILITY.
4659 - Locale interpretation commands no longer attempt to simplify goal.
4660 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4661 methods intro_locales and unfold_locales to clarify.
4663 - Locale interpretation commands no longer accept interpretation
4664 attributes. INCOMPATIBILITY.
4666 * Class declaration: so-called "base sort" must not be given in import
4667 list any longer, but is inferred from the specification. Particularly
4674 class foo = type + ...
4676 * Class target: global versions of theorems stemming do not carry a
4677 parameter prefix any longer. INCOMPATIBILITY.
4679 * Class 'instance' command no longer accepts attached definitions.
4680 INCOMPATIBILITY, use proper 'instantiation' target instead.
4682 * Recovered hiding of consts, which was accidentally broken in
4683 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4684 makes c inaccessible; consider using ``hide (open) const c'' instead.
4686 * Slightly more coherent Pure syntax, with updated documentation in
4687 isar-ref manual. Removed locales meta_term_syntax and
4688 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4689 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4690 directly in regular applications.
4692 * There is a new syntactic category "float_const" for signed decimal
4693 fractions (e.g. 123.45 or -123.45).
4695 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4696 interface with 'setup' command instead.
4698 * Command 'local_setup' is similar to 'setup', but operates on a local
4701 * The 'axiomatization' command now only works within a global theory
4702 context. INCOMPATIBILITY.
4704 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4705 hypotheses. Sorts required in the course of reasoning need to be
4706 covered by the constraints in the initial statement, completed by the
4707 type instance information of the background theory. Non-trivial sort
4708 hypotheses, which rarely occur in practice, may be specified via
4709 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4711 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4713 The result contains an implicit sort hypotheses as before --
4714 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4717 * Generalized Isar history, with support for linear undo, direct state
4720 * Changed defaults for unify configuration options:
4722 unify_trace_bound = 50 (formerly 25)
4723 unify_search_bound = 60 (formerly 30)
4725 * Different bookkeeping for code equations (INCOMPATIBILITY):
4727 a) On theory merge, the last set of code equations for a particular
4728 constant is taken (in accordance with the policy applied by other
4729 parts of the code generator framework).
4731 b) Code equations stemming from explicit declarations (e.g. code
4732 attribute) gain priority over default code equations stemming
4733 from definition, primrec, fun etc.
4735 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4737 * Unified theorem tables for both code generators. Thus [code
4738 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4740 * Command 'find_consts' searches for constants based on type and name
4743 find_consts "_ => bool"
4745 By default, matching is against subtypes, but it may be restricted to
4746 the whole type. Searching by name is possible. Multiple queries are
4747 conjunctive and queries may be negated by prefixing them with a
4750 find_consts strict: "_ => bool" name: "Int" -"int => int"
4752 * New 'find_theorems' criterion "solves" matches theorems that
4753 directly solve the current goal (modulo higher-order unification).
4755 * Auto solve feature for main theorem statements: whenever a new goal
4756 is stated, "find_theorems solves" is called; any theorems that could
4757 solve the lemma directly are listed as part of the goal state.
4758 Cf. associated options in Proof General Isabelle settings menu,
4759 enabled by default, with reasonable timeout for pathological cases of
4760 higher-order unification.
4763 *** Document preparation ***
4765 * Antiquotation @{lemma} now imitates a regular terminal proof,
4766 demanding keyword 'by' and supporting the full method expression
4767 syntax just like the Isar command 'by'.
4772 * Integrated main parts of former image HOL-Complex with HOL. Entry
4773 points Main and Complex_Main remain as before.
4775 * Logic image HOL-Plain provides a minimal HOL with the most important
4776 tools available (inductive, datatype, primrec, ...). This facilitates
4777 experimentation and tool development. Note that user applications
4778 (and library theories) should never refer to anything below theory
4781 * Logic image HOL-Main stops at theory Main, and thus facilitates
4782 experimentation due to shorter build times.
4784 * Logic image HOL-NSA contains theories of nonstandard analysis which
4785 were previously part of former HOL-Complex. Entry point Hyperreal
4786 remains valid, but theories formerly using Complex_Main should now use
4787 new entry point Hypercomplex.
4789 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4790 Posix processes. Avoids potentially expensive forking of the ML
4791 process. New thread-based implementation also works on non-Unix
4792 platforms (Cygwin). Provers are no longer hardwired, but defined
4793 within the theory via plain ML wrapper functions. Basic Sledgehammer
4794 commands are covered in the isar-ref manual.
4796 * Wrapper scripts for remote SystemOnTPTP service allows to use
4797 sledgehammer without local ATP installation (Vampire etc.). Other
4798 provers may be included via suitable ML wrappers, see also
4799 src/HOL/ATP_Linkup.thy.
4801 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4804 * The metis method no longer fails because the theorem is too trivial
4805 (contains the empty clause).
4807 * The metis method now fails in the usual manner, rather than raising
4808 an exception, if it determines that it cannot prove the theorem.
4810 * Method "coherent" implements a prover for coherent logic (see also
4811 src/Tools/coherent.ML).
4813 * Constants "undefined" and "default" replace "arbitrary". Usually
4814 "undefined" is the right choice to replace "arbitrary", though
4815 logically there is no difference. INCOMPATIBILITY.
4817 * Command "value" now integrates different evaluation mechanisms. The
4818 result of the first successful evaluation mechanism is printed. In
4819 square brackets a particular named evaluation mechanisms may be
4820 specified (currently, [SML], [code] or [nbe]). See further
4821 src/HOL/ex/Eval_Examples.thy.
4823 * Normalization by evaluation now allows non-leftlinear equations.
4824 Declare with attribute [code nbe].
4826 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4827 as the structured Isar versions "cases" and "induct", cf. the
4828 corresponding "cases" and "induct" attributes. Mutual induction rules
4829 are now presented as a list of individual projections
4830 (e.g. foo_bar.inducts for types foo and bar); the old format with
4831 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4832 rare situations a different rule is selected --- notably nested tuple
4833 elimination instead of former prod.exhaust: use explicit (case_tac t
4834 rule: prod.exhaust) here.
4836 * Attributes "cases", "induct", "coinduct" support "del" option.
4838 * Removed fact "case_split_thm", which duplicates "case_split".
4840 * The option datatype has been moved to a new theory Option. Renamed
4841 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4843 * New predicate "strict_mono" classifies strict functions on partial
4844 orders. With strict functions on linear orders, reasoning about
4845 (in)equalities is facilitated by theorems "strict_mono_eq",
4846 "strict_mono_less_eq" and "strict_mono_less".
4848 * Some set operations are now proper qualified constants with
4849 authentic syntax. INCOMPATIBILITY:
4860 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4863 * Auxiliary class "itself" has disappeared -- classes without any
4864 parameter are treated as expected by the 'class' command.
4866 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4868 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4869 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4871 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4872 method "approximation". It proves formulas on real values by using
4873 interval arithmetic. In the formulas are also the transcendental
4874 functions sin, cos, tan, atan, ln, exp and the constant pi are
4875 allowed. For examples see
4876 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4878 * Theory "Reflection" now resides in HOL/Library.
4880 * Entry point to Word library now simply named "Word".
4883 * Made source layout more coherent with logical distribution
4886 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4887 src/HOL/Library/Code_Message.thy ~> src/HOL/
4888 src/HOL/Library/GCD.thy ~> src/HOL/
4889 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4890 src/HOL/Library/Parity.thy ~> src/HOL/
4891 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4892 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4893 src/HOL/Real/Lubs.thy ~> src/HOL/
4894 src/HOL/Real/PReal.thy ~> src/HOL/
4895 src/HOL/Real/Rational.thy ~> src/HOL/
4896 src/HOL/Real/RComplete.thy ~> src/HOL/
4897 src/HOL/Real/RealDef.thy ~> src/HOL/
4898 src/HOL/Real/RealPow.thy ~> src/HOL/
4899 src/HOL/Real/Real.thy ~> src/HOL/
4900 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4901 src/HOL/Complex/Complex.thy ~> src/HOL/
4902 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4903 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4904 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4905 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4906 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4907 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4908 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4909 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4910 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4911 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4912 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4913 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4914 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4915 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4916 src/HOL/Real/Float ~> src/HOL/Library/
4917 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4918 src/HOL/Real/RealVector.thy ~> src/HOL/
4920 src/HOL/arith_data.ML ~> src/HOL/Tools
4921 src/HOL/hologic.ML ~> src/HOL/Tools
4922 src/HOL/simpdata.ML ~> src/HOL/Tools
4923 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4924 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4925 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4926 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4927 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4928 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4929 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4931 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4932 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4933 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4934 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4935 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4936 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4938 * If methods "eval" and "evaluation" encounter a structured proof
4939 state with !!/==>, only the conclusion is evaluated to True (if
4940 possible), avoiding strange error messages.
4942 * Method "sizechange" automates termination proofs using (a
4943 modification of) the size-change principle. Requires SAT solver. See
4944 src/HOL/ex/Termination.thy for examples.
4946 * Simplifier: simproc for let expressions now unfolds if bound
4947 variable occurs at most once in let expression body. INCOMPATIBILITY.
4949 * Method "arith": Linear arithmetic now ignores all inequalities when
4950 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4952 * New attribute "arith" for facts that should always be used
4953 automatically by arithmetic. It is intended to be used locally in
4956 assumes [arith]: "x > 0"
4958 Global usage is discouraged because of possible performance impact.
4960 * New classes "top" and "bot" with corresponding operations "top" and
4961 "bot" in theory Orderings; instantiation of class "complete_lattice"
4962 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4964 * Changed definition lemma "less_fun_def" in order to provide an
4965 instance for preorders on functions; use lemma "less_le" instead.
4968 * Theory Orderings: class "wellorder" moved here, with explicit
4969 induction rule "less_induct" as assumption. For instantiation of
4970 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4973 * Theory Orderings: added class "preorder" as superclass of "order".
4974 INCOMPATIBILITY: Instantiation proofs for order, linorder
4975 etc. slightly changed. Some theorems named order_class.* now named
4978 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4981 * Theory Finite_Set: added a new fold combinator of type
4983 ('a => 'b => 'b) => 'b => 'a set => 'b
4985 Occasionally this is more convenient than the old fold combinator
4986 which is now defined in terms of the new one and renamed to
4989 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4990 and "ring_simps" have been replaced by "algebra_simps" (which can be
4991 extended with further lemmas!). At the moment both still exist but
4992 the former will disappear at some point.
4994 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4995 class recpower. Type-specific simp rules for various recpower types
4996 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4998 rat_power_0 -> power_0
4999 rat_power_Suc -> power_Suc
5000 realpow_0 -> power_0
5001 realpow_Suc -> power_Suc
5002 complexpow_0 -> power_0
5003 complexpow_Suc -> power_Suc
5004 power_poly_0 -> power_0
5005 power_poly_Suc -> power_Suc
5007 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
5008 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
5009 dvd has been generalized to class comm_semiring_1. Likewise a bunch
5010 of lemmas from Divides has been generalized from nat to class
5011 semiring_div. INCOMPATIBILITY. This involves the following theorem
5012 renames resulting from duplicate elimination:
5014 dvd_def_mod ~> dvd_eq_mod_eq_0
5015 zero_dvd_iff ~> dvd_0_left_iff
5016 dvd_0 ~> dvd_0_right
5017 DIVISION_BY_ZERO_DIV ~> div_by_0
5018 DIVISION_BY_ZERO_MOD ~> mod_by_0
5019 mult_div ~> div_mult_self2_is_id
5020 mult_mod ~> mod_mult_self2_is_0
5022 * Theory IntDiv: removed many lemmas that are instances of class-based
5023 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
5024 rename old lemmas as follows:
5026 dvd_diff -> nat_dvd_diff
5027 dvd_zminus_iff -> dvd_minus_iff
5028 mod_add1_eq -> mod_add_eq
5029 mod_mult1_eq -> mod_mult_right_eq
5030 mod_mult1_eq' -> mod_mult_left_eq
5031 mod_mult_distrib_mod -> mod_mult_eq
5032 nat_mod_add_left_eq -> mod_add_left_eq
5033 nat_mod_add_right_eq -> mod_add_right_eq
5034 nat_mod_div_trivial -> mod_div_trivial
5035 nat_mod_mod_trivial -> mod_mod_trivial
5036 zdiv_zadd_self1 -> div_add_self1
5037 zdiv_zadd_self2 -> div_add_self2
5038 zdiv_zmult_self1 -> div_mult_self2_is_id
5039 zdiv_zmult_self2 -> div_mult_self1_is_id
5040 zdvd_triv_left -> dvd_triv_left
5041 zdvd_triv_right -> dvd_triv_right
5042 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
5043 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
5044 zmod_zadd_left_eq -> mod_add_left_eq
5045 zmod_zadd_right_eq -> mod_add_right_eq
5046 zmod_zadd_self1 -> mod_add_self1
5047 zmod_zadd_self2 -> mod_add_self2
5048 zmod_zadd1_eq -> mod_add_eq
5049 zmod_zdiff1_eq -> mod_diff_eq
5050 zmod_zdvd_zmod -> mod_mod_cancel
5051 zmod_zmod_cancel -> mod_mod_cancel
5052 zmod_zmult_self1 -> mod_mult_self2_is_0
5053 zmod_zmult_self2 -> mod_mult_self1_is_0
5056 zdvd_abs1 -> abs_dvd_iff
5057 zdvd_abs2 -> dvd_abs_iff
5058 zdvd_refl -> dvd_refl
5059 zdvd_trans -> dvd_trans
5060 zdvd_zadd -> dvd_add
5061 zdvd_zdiff -> dvd_diff
5062 zdvd_zminus_iff -> dvd_minus_iff
5063 zdvd_zminus2_iff -> minus_dvd_iff
5064 zdvd_zmultD -> dvd_mult_right
5065 zdvd_zmultD2 -> dvd_mult_left
5066 zdvd_zmult_mono -> mult_dvd_mono
5067 zdvd_0_right -> dvd_0_right
5068 zdvd_0_left -> dvd_0_left_iff
5069 zdvd_1_left -> one_dvd
5070 zminus_dvd_iff -> minus_dvd_iff
5072 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
5074 * The real numbers offer decimal input syntax: 12.34 is translated
5075 into 1234/10^2. This translation is not reversed upon output.
5077 * Theory Library/Polynomial defines an abstract type 'a poly of
5078 univariate polynomials with coefficients of type 'a. In addition to
5079 the standard ring operations, it also supports div and mod. Code
5080 generation is also supported, using list-style constructors.
5082 * Theory Library/Inner_Product defines a class of real_inner for real
5083 inner product spaces, with an overloaded operation inner :: 'a => 'a
5084 => real. Class real_inner is a subclass of real_normed_vector from
5087 * Theory Library/Product_Vector provides instances for the product
5088 type 'a * 'b of several classes from RealVector and Inner_Product.
5089 Definitions of addition, subtraction, scalar multiplication, norms,
5090 and inner products are included.
5092 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
5093 addition to the field operations, numerals and case syntax are also
5096 * Theory Library/Diagonalize provides constructive version of Cantor's
5097 first diagonalization argument.
5099 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
5100 zlcm (for int); carried together from various gcd/lcm developements in
5101 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5102 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5103 may recover tupled syntax as follows:
5105 hide (open) const gcd
5106 abbreviation gcd where
5107 "gcd == (%(a, b). GCD.gcd a b)"
5109 GCD.gcd ("gcd '(_, _')")
5111 The same works for lcm, zgcd, zlcm.
5113 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
5114 instantiations for algebraic structures. Removed some duplicate
5115 theorems. Changes in simp rules. INCOMPATIBILITY.
5117 * ML antiquotation @{code} takes a constant as argument and generates
5118 corresponding code in background and inserts name of the corresponding
5119 resulting ML value/function/datatype constructor binding in place.
5120 All occurrences of @{code} with a single ML block are generated
5121 simultaneously. Provides a generic and safe interface for
5122 instrumentalizing code generation. See
5123 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
5124 In future you ought to refrain from ad-hoc compiling generated SML
5125 code on the ML toplevel. Note that (for technical reasons) @{code}
5126 cannot refer to constants for which user-defined serializations are
5127 set. Refer to the corresponding ML counterpart directly in that
5130 * Command 'rep_datatype': instead of theorem names the command now
5131 takes a list of terms denoting the constructors of the type to be
5132 represented as datatype. The characteristic theorems have to be
5133 proven. INCOMPATIBILITY. Also observe that the following theorems
5134 have disappeared in favour of existing ones:
5136 unit_induct ~> unit.induct
5137 prod_induct ~> prod.induct
5138 sum_induct ~> sum.induct
5139 Suc_Suc_eq ~> nat.inject
5140 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5145 * New locales for orders and lattices where the equivalence relation
5146 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5147 locales use a record structure with field eq for the equivalence.
5149 * New theory of factorial domains.
5151 * Units_l_inv and Units_r_inv are now simp rules by default.
5152 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5153 and/or r_inv will now also require deletion of these lemmas.
5155 * Renamed the following theorems, INCOMPATIBILITY:
5157 UpperD ~> Upper_memD
5158 LowerD ~> Lower_memD
5159 least_carrier ~> least_closed
5160 greatest_carrier ~> greatest_closed
5161 greatest_Lower_above ~> greatest_Lower_below
5162 one_zero ~> carrier_one_zero
5163 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5168 * Nominal datatypes can now contain type-variables.
5170 * Commands 'nominal_inductive' and 'equivariance' work with local
5173 * Nominal primrec can now works with local theory targets and its
5174 specification syntax now conforms to the general format as seen in
5177 * Method "perm_simp" honours the standard simplifier attributes
5178 (no_asm), (no_asm_use) etc.
5180 * The new predicate #* is defined like freshness, except that on the
5181 left hand side can be a set or list of atoms.
5183 * Experimental command 'nominal_inductive2' derives strong induction
5184 principles for inductive definitions. In contrast to
5185 'nominal_inductive', which can only deal with a fixed number of
5186 binders, it can deal with arbitrary expressions standing for sets of
5187 atoms to be avoided. The only inductive definition we have at the
5188 moment that needs this generalisation is the typing rule for Lets in
5191 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5192 -----------------------------------------------------------------
5193 Gamma |- Let x be t1 in t2 : T2
5195 In this rule one wants to avoid all the binders that are introduced by
5196 "close Gamma T1". We are looking for other examples where this
5197 feature might be useful. Please let us know.
5202 * Reimplemented the simplification procedure for proving continuity
5203 subgoals. The new simproc is extensible; users can declare additional
5204 continuity introduction rules with the attribute [cont2cont].
5206 * The continuity simproc now uses a different introduction rule for
5207 solving continuity subgoals on terms with lambda abstractions. In
5208 some rare cases the new simproc may fail to solve subgoals that the
5209 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5210 Potential INCOMPATIBILITY.
5212 * Command 'fixrec': specification syntax now conforms to the general
5213 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5214 examples. INCOMPATIBILITY.
5219 * Proof of Zorn's Lemma for partial orders.
5224 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5225 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5226 depends on multithreading, so timouts will not work before Poly/ML
5229 * High-level support for concurrent ML programming, see
5230 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5231 particularly convenient to organize independent functional
5232 computations. The concept of "synchronized variables" provides a
5233 higher-order interface for components with shared state, avoiding the
5234 delicate details of mutexes and condition variables. (Requires
5235 Poly/ML 5.2.1 or later.)
5237 * ML bindings produced via Isar commands are stored within the Isar
5238 context (theory or proof). Consequently, commands like 'use' and 'ML'
5239 become thread-safe and work with undo as expected (concerning
5240 top-level bindings, not side-effects on global references).
5241 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5242 compiler at runtime; really global bindings need to be given outside a
5243 theory. (Requires Poly/ML 5.2 or later.)
5245 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5246 context. Top-level ML bindings are stored within the proof context in
5247 a purely sequential fashion, disregarding the nested proof structure.
5248 ML bindings introduced by 'ML_prf' are discarded at the end of the
5249 proof. (Requires Poly/ML 5.2 or later.)
5251 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5252 and Method.setup, as well as Isar commands 'attribute_setup' and
5253 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5254 existing code accordingly, or use plain 'setup' together with old
5257 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5258 to 'a -> thm, while results are always tagged with an authentic oracle
5259 name. The Isar command 'oracle' is now polymorphic, no argument type
5260 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5261 accordingly. Note that extra performance may be gained by producing
5262 the cterm carefully, avoiding slow Thm.cterm_of.
5264 * Simplified interface for defining document antiquotations via
5265 ThyOutput.antiquotation, ThyOutput.output, and optionally
5266 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5267 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5270 * More systematic treatment of long names, abstract name bindings, and
5271 name space operations. Basic operations on qualified names have been
5272 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5273 Long_Name.append. Old type bstring has been mostly replaced by
5274 abstract type binding (see structure Binding), which supports precise
5275 qualification by packages and local theory targets, as well as proper
5276 tracking of source positions. INCOMPATIBILITY, need to wrap old
5277 bstring values into Binding.name, or better pass through abstract
5278 bindings everywhere. See further src/Pure/General/long_name.ML,
5279 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5281 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5282 LocalTheory.note etc.) now refer to the *full* internal name, not the
5283 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5285 * Disposed old type and term read functions (Sign.read_def_typ,
5286 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5287 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5288 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5289 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5290 resort for legacy applications.
5292 * Disposed old declarations, tactics, tactic combinators that refer to
5293 the simpset or claset of an implicit theory (such as Addsimps,
5294 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5295 embedded ML text, or local_simpset_of with a proper context passed as
5296 explicit runtime argument.
5298 * Rules and tactics that read instantiations (read_instantiate,
5299 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5300 context, which is required for parsing and type-checking. Moreover,
5301 the variables are specified as plain indexnames, not string encodings
5302 thereof. INCOMPATIBILITY.
5304 * Generic Toplevel.add_hook interface allows to analyze the result of
5305 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5306 for theorem dependency output of transactions resulting in a new
5309 * ML antiquotations: block-structured compilation context indicated by
5310 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5312 @{binding name} - basic name binding
5313 @{let ?pat = term} - term abbreviation (HO matching)
5314 @{note name = fact} - fact abbreviation
5315 @{thm fact} - singleton fact (with attributes)
5316 @{thms fact} - general fact (with attributes)
5317 @{lemma prop by method} - singleton goal
5318 @{lemma prop by meth1 meth2} - singleton goal
5319 @{lemma prop1 ... propN by method} - general goal
5320 @{lemma prop1 ... propN by meth1 meth2} - general goal
5321 @{lemma (open) ...} - open derivation
5326 * The Isabelle "emacs" tool provides a specific interface to invoke
5327 Proof General / Emacs, with more explicit failure if that is not
5328 installed (the old isabelle-interface script silently falls back on
5329 isabelle-process). The PROOFGENERAL_HOME setting determines the
5330 installation location of the Proof General distribution.
5332 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5333 the Isabelle process into a JVM/Scala application. See
5334 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5335 process wrapper has been discontinued.)
5337 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5339 * Various status messages (with exact source position information) are
5340 emitted, if proper markup print mode is enabled. This allows
5341 user-interface components to provide detailed feedback on internal
5346 New in Isabelle2008 (June 2008)
5347 -------------------------------
5351 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5352 and updated, with formally checked references as hyperlinks.
5354 * Theory loader: use_thy (and similar operations) no longer set the
5355 implicit ML context, which was occasionally hard to predict and in
5356 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5357 provides a proper context already.
5359 * Theory loader: old-style ML proof scripts being *attached* to a thy
5360 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5361 'use' within a theory file will do the job.
5363 * Name space merge now observes canonical order, i.e. the second space
5364 is inserted into the first one, while existing entries in the first
5365 space take precedence. INCOMPATIBILITY in rare situations, may try to
5366 swap theory imports.
5368 * Syntax: symbol \<chi> is now considered a letter. Potential
5369 INCOMPATIBILITY in identifier syntax etc.
5371 * Outer syntax: string tokens no longer admit escaped white space,
5372 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5373 white space without escapes.
5375 * Outer syntax: string tokens may contain arbitrary character codes
5376 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5382 * Context-dependent token translations. Default setup reverts locally
5383 fixed variables, and adds hilite markup for undeclared frees.
5385 * Unused theorems can be found using the new command 'unused_thms'.
5386 There are three ways of invoking it:
5389 Only finds unused theorems in the current theory.
5391 (2) unused_thms thy_1 ... thy_n -
5392 Finds unused theorems in the current theory and all of its ancestors,
5393 excluding the theories thy_1 ... thy_n and all of their ancestors.
5395 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5396 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5397 their ancestors, excluding the theories thy_1 ... thy_n and all of
5400 In order to increase the readability of the list produced by
5401 unused_thms, theorems that have been created by a particular instance
5402 of a theory command such as 'inductive' or 'function' are considered
5403 to belong to the same "group", meaning that if at least one theorem in
5404 this group is used, the other theorems in the same group are no longer
5405 reported as unused. Moreover, if all theorems in the group are
5406 unused, only one theorem in the group is displayed.
5408 Note that proof objects have to be switched on in order for
5409 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5410 usually the case when using Proof General with the default settings).
5412 * Authentic naming of facts disallows ad-hoc overwriting of previous
5413 theorems within the same name space. INCOMPATIBILITY, need to remove
5414 duplicate fact bindings, or even accidental fact duplications. Note
5415 that tools may maintain dynamically scoped facts systematically, using
5416 PureThy.add_thms_dynamic.
5418 * Command 'hide' now allows to hide from "fact" name space as well.
5420 * Eliminated destructive theorem database, simpset, claset, and
5421 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5422 update of theories within ML code.
5424 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5425 INCOMPATIBILITY, object-logics depending on former Pure require
5426 additional setup PureThy.old_appl_syntax_setup; object-logics
5427 depending on former CPure need to refer to Pure.
5429 * Commands 'use' and 'ML' are now purely functional, operating on
5430 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5431 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5434 * Command 'setup': discontinued implicit version with ML reference.
5436 * Instantiation target allows for simultaneous specification of class
5437 instance operations together with an instantiation proof.
5438 Type-checking phase allows to refer to class operations uniformly.
5439 See src/HOL/Complex/Complex.thy for an Isar example and
5440 src/HOL/Library/Eval.thy for an ML example.
5442 * Indexing of literal facts: be more serious about including only
5443 facts from the visible specification/proof context, but not the
5444 background context (locale etc.). Affects `prop` notation and method
5445 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5448 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5449 "(open)" option, which used to expose internal bound variables to the
5452 * Isar statements: removed obsolete case "rule_context".
5453 INCOMPATIBILITY, better use explicit fixes/assumes.
5455 * Locale proofs: default proof step now includes 'unfold_locales';
5456 hence 'proof' without argument may be used to unfold locale
5460 *** Document preparation ***
5462 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5463 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5464 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5465 spot); renamed link color from "darkblue" to "linkcolor" (default
5466 value unchanged, can be redefined via \definecolor); no longer sets
5467 "a4paper" option (unnecessary or even intrusive).
5469 * Antiquotation @{lemma A method} proves proposition A by the given
5470 method (either a method name or a method name plus (optional) method
5471 arguments in parentheses) and prints A just like @{prop A}.
5476 * New primrec package. Specification syntax conforms in style to
5477 definition/function/.... No separate induction rule is provided. The
5478 "primrec" command distinguishes old-style and new-style specifications
5479 by syntax. The former primrec package is now named OldPrimrecPackage.
5480 When adjusting theories, beware: constants stemming from new-style
5481 primrec specifications have authentic syntax.
5483 * Metis prover is now an order of magnitude faster, and also works
5484 with multithreading.
5486 * Metis: the maximum number of clauses that can be produced from a
5487 theorem is now given by the attribute max_clauses. Theorems that
5488 exceed this number are ignored, with a warning printed.
5490 * Sledgehammer no longer produces structured proofs by default. To
5491 enable, declare [[sledgehammer_full = true]]. Attributes
5492 reconstruction_modulus, reconstruction_sorts renamed
5493 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5495 * Method "induct_scheme" derives user-specified induction rules
5496 from well-founded induction and completeness of patterns. This factors
5497 out some operations that are done internally by the function package
5498 and makes them available separately. See
5499 src/HOL/ex/Induction_Scheme.thy for examples.
5501 * More flexible generation of measure functions for termination
5502 proofs: Measure functions can be declared by proving a rule of the
5503 form "is_measure f" and giving it the [measure_function] attribute.
5504 The "is_measure" predicate is logically meaningless (always true), and
5505 just guides the heuristic. To find suitable measure functions, the
5506 termination prover sets up the goal "is_measure ?f" of the appropriate
5507 type and generates all solutions by prolog-style backwards proof using
5510 This setup also deals with rules like
5512 "is_measure f ==> is_measure (list_size f)"
5514 which accommodates nested datatypes that recurse through lists.
5515 Similar rules are predeclared for products and option types.
5517 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5521 - Definitions of overloaded constants on sets have to be replaced by
5522 definitions on => and bool.
5524 - Some definitions of overloaded operators on sets can now be proved
5525 using the definitions of the operators on => and bool. Therefore,
5526 the following theorems have been renamed:
5528 subset_def -> subset_eq
5529 psubset_def -> psubset_eq
5530 set_diff_def -> set_diff_eq
5531 Compl_def -> Compl_eq
5532 Sup_set_def -> Sup_set_eq
5533 Inf_set_def -> Inf_set_eq
5534 sup_set_def -> sup_set_eq
5535 inf_set_def -> inf_set_eq
5537 - Due to the incompleteness of the HO unification algorithm, some
5538 rules such as subst may require manual instantiation, if some of
5539 the unknowns in the rule is a set.
5541 - Higher order unification and forward proofs:
5544 have "P (S::'a set)" <...>
5545 then have "EX S. P S" ..
5547 no longer works (due to the incompleteness of the HO unification
5548 algorithm) and must be replaced by the pattern
5555 - Calculational reasoning with subst (or similar rules):
5558 have "P (S::'a set)" <...>
5559 also have "S = T" <...>
5560 finally have "P T" .
5562 no longer works (for similar reasons as the previous example) and
5563 must be replaced by something like
5565 have "P (S::'a set)" <...>
5566 moreover have "S = T" <...>
5567 ultimately have "P T" by simp
5569 - Tactics or packages written in ML code:
5570 Code performing pattern matching on types via
5572 Type ("set", [T]) => ...
5574 must be rewritten. Moreover, functions like strip_type or
5575 binder_types no longer return the right value when applied to a
5578 T1 => ... => Tn => U => bool
5582 T1 => ... => Tn => U set
5584 * Merged theories Wellfounded_Recursion, Accessible_Part and
5585 Wellfounded_Relations to theory Wellfounded.
5587 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5589 * Class finite no longer treats UNIV as class parameter. Use class
5590 enum from theory Library/Enum instead to achieve a similar effect.
5593 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5594 and "Cons". INCOMPATIBILITY.
5596 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5597 Potential INCOMPATIBILITY.
5599 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5600 injective_fst_snd removed, use split_eta and prod_eqI instead.
5601 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5603 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5604 the same name in theory Orderings:
5614 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5615 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5616 and different variable names.
5618 * Library/Option_ord.thy: Canonical order on option type.
5620 * Library/RBT.thy: Red-black trees, an efficient implementation of
5623 * Library/Countable.thy: Type class for countable types.
5625 * Theory Int: The representation of numerals has changed. The infix
5626 operator BIT and the bit datatype with constructors B0 and B1 have
5627 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5628 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5629 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5632 * Theory Nat: definition of <= and < on natural numbers no longer
5633 depend on well-founded relations. INCOMPATIBILITY. Definitions
5634 le_def and less_def have disappeared. Consider lemmas not_less
5635 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5637 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5638 (whose purpose mainly is for various fold_set functionals) have been
5639 abandoned in favor of the existing algebraic classes
5640 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5641 lower_semilattice (resp. upper_semilattice) and linorder.
5644 * Theory Transitive_Closure: induct and cases rules now declare proper
5645 case_names ("base" and "step"). INCOMPATIBILITY.
5647 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5648 lattices. The form set-specific version is available as
5649 Inductive.lfp_ordinal_induct_set.
5651 * Renamed theorems "power.simps" to "power_int.simps".
5654 * Class semiring_div provides basic abstract properties of semirings
5655 with division and modulo operations. Subsumes former class dvd_mod.
5657 * Merged theories IntDef, Numeral and IntArith into unified theory
5658 Int. INCOMPATIBILITY.
5660 * Theory Library/Code_Index: type "index" now represents natural
5661 numbers rather than integers. INCOMPATIBILITY.
5663 * New class "uminus" with operation "uminus" (split of from class
5664 "minus" which now only has operation "minus", binary).
5667 * Constants "card", "internal_split", "option_map" now with authentic
5668 syntax. INCOMPATIBILITY.
5670 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5671 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5672 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5673 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5674 Sup_set_def, le_def, less_def, option_map_def now with object
5675 equality. INCOMPATIBILITY.
5677 * Records. Removed K_record, and replaced it by pure lambda term
5678 %x. c. The simplifier setup is now more robust against eta expansion.
5679 INCOMPATIBILITY: in cases explicitly referring to K_record.
5681 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5683 * Library/ListVector: new theory of arithmetic vector operations.
5685 * Library/Order_Relation: new theory of various orderings as sets of
5686 pairs. Defines preorders, partial orders, linear orders and
5687 well-orders on sets and on types.
5692 * Renamed some theories to allow to loading both ZF and HOL in the
5695 Datatype -> Datatype_ZF
5696 Inductive -> Inductive_ZF
5703 INCOMPATIBILITY: ZF theories that import individual theories below
5704 Main might need to be adapted. Regular theory Main is still
5705 available, as trivial extension of Main_ZF.
5710 * ML within Isar: antiquotation @{const name} or @{const
5711 name(typargs)} produces statically-checked Const term.
5713 * Functor NamedThmsFun: data is available to the user as dynamic fact
5714 (of the same name). Removed obsolete print command.
5716 * Removed obsolete "use_legacy_bindings" function.
5718 * The ``print mode'' is now a thread-local value derived from a global
5719 template (the former print_mode reference), thus access becomes
5720 non-critical. The global print_mode reference is for session
5721 management only; user-code should use print_mode_value,
5722 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5724 * Functions system/system_out provide a robust way to invoke external
5725 shell commands, with propagation of interrupts (requires Poly/ML
5726 5.2.1). Do not use OS.Process.system etc. from the basis library!
5731 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5732 in accordance with Proof General 3.7, which prefers GNU emacs.
5734 * isatool tty runs Isabelle process with plain tty interaction;
5735 optional line editor may be specified via ISABELLE_LINE_EDITOR
5736 setting, the default settings attempt to locate "ledit" and "rlwrap".
5738 * isatool browser now works with Cygwin as well, using general
5739 "javapath" function defined in Isabelle process environment.
5741 * YXML notation provides a simple and efficient alternative to
5742 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5743 isatool yxml as described in the Isabelle system manual.
5745 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5746 provides general wrapper for managing an Isabelle process in a robust
5747 fashion, with ``cooked'' output from stdin/stderr.
5749 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5750 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5752 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5753 way of changing the user's settings is via
5754 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5757 * Multithreading.max_threads := 0 refers to the number of actual CPU
5758 cores of the underlying machine, which is a good starting point for
5759 optimal performance tuning. The corresponding usedir option -M allows
5760 "max" as an alias for "0". WARNING: does not work on certain versions
5761 of Mac OS (with Poly/ML 5.1).
5763 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5764 adverse effect of Isabelle flooding interactive front-ends (notably
5765 ProofGeneral / XEmacs).
5769 New in Isabelle2007 (November 2007)
5770 -----------------------------------
5774 * More uniform information about legacy features, notably a
5775 warning/error of "Legacy feature: ...", depending on the state of the
5776 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5777 legacy features will disappear eventually.
5779 * Theory syntax: the header format ``theory A = B + C:'' has been
5780 discontinued in favour of ``theory A imports B C begin''. Use isatool
5781 fixheaders to convert existing theory files. INCOMPATIBILITY.
5783 * Theory syntax: the old non-Isar theory file format has been
5784 discontinued altogether. Note that ML proof scripts may still be used
5785 with Isar theories; migration is usually quite simple with the ML
5786 function use_legacy_bindings. INCOMPATIBILITY.
5788 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5789 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5792 * Theory loader: be more serious about observing the static theory
5793 header specifications (including optional directories), but not the
5794 accidental file locations of previously successful loads. The strict
5795 update policy of former update_thy is now already performed by
5796 use_thy, so the former has been removed; use_thys updates several
5797 theories simultaneously, just as 'imports' within a theory header
5798 specification, but without merging the results. Potential
5799 INCOMPATIBILITY: may need to refine theory headers and commands
5800 ROOT.ML which depend on load order.
5802 * Theory loader: optional support for content-based file
5803 identification, instead of the traditional scheme of full physical
5804 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5805 (cf. the system manual). The new scheme allows to work with
5806 non-finished theories in persistent session images, such that source
5807 files may be moved later on without requiring reloads.
5809 * Theory loader: old-style ML proof scripts being *attached* to a thy
5810 file (with the same base name as the theory) are considered a legacy
5811 feature, which will disappear eventually. Even now, the theory loader
5812 no longer maintains dependencies on such files.
5814 * Syntax: the scope for resolving ambiguities via type-inference is
5815 now limited to individual terms, instead of whole simultaneous
5816 specifications as before. This greatly reduces the complexity of the
5817 syntax module and improves flexibility by separating parsing and
5818 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5819 'fixes' etc.) are required in rare situations.
5821 * Syntax: constants introduced by new-style packages ('definition',
5822 'abbreviation' etc.) are passed through the syntax module in
5823 ``authentic mode''. This means that associated mixfix annotations
5824 really stick to such constants, independently of potential name space
5825 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5826 trees are represented slightly differently, may need to adapt syntax
5827 translations accordingly. Use CONST marker in 'translations' and
5828 @{const_syntax} antiquotation in 'parse_translation' etc.
5830 * Legacy goal package: reduced interface to the bare minimum required
5831 to keep existing proof scripts running. Most other user-level
5832 functions are now part of the OldGoals structure, which is *not* open
5833 by default (consider isatool expandshort before open OldGoals).
5834 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5835 these tend to cause confusion about the actual goal (!) context being
5836 used here, which is not necessarily the same as the_context().
5838 * Command 'find_theorems': supports "*" wild-card in "name:"
5839 criterion; "with_dups" option. Certain ProofGeneral versions might
5840 support a specific search form (see ProofGeneral/CHANGES).
5842 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5843 by default, which means that "prems" (and also "fixed variables") are
5844 suppressed from proof state output. Note that the ProofGeneral
5845 settings mechanism allows to change and save options persistently, but
5846 older versions of Isabelle will fail to start up if a negative prems
5849 * Local theory targets may be specified by non-nested blocks of
5850 ``context/locale/class ... begin'' followed by ``end''. The body may
5851 contain definitions, theorems etc., including any derived mechanism
5852 that has been implemented on top of these primitives. This concept
5853 generalizes the existing ``theorem (in ...)'' towards more versatility
5856 * Proof General interface: proper undo of final 'end' command;
5857 discontinued Isabelle/classic mode (ML proof scripts).
5860 *** Document preparation ***
5862 * Added antiquotation @{theory name} which prints the given name,
5863 after checking that it refers to a valid ancestor theory in the
5866 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5867 check the given source text as ML type/structure, printing verbatim.
5869 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5870 "c args == rhs" given in the current context. (Any number of
5871 arguments may be given on the LHS.)
5876 * The 'class' package offers a combination of axclass and locale to
5877 achieve Haskell-like type classes in Isabelle. Definitions and
5878 theorems within a class context produce both relative results (with
5879 implicit parameters according to the locale context), and polymorphic
5880 constants with qualified polymorphism (according to the class
5881 context). Within the body context of a 'class' target, a separate
5882 syntax layer ("user space type system") takes care of converting
5883 between global polymorphic consts and internal locale representation.
5884 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5885 "isatool doc classes" provides a tutorial.
5887 * Generic code generator framework allows to generate executable
5888 code for ML and Haskell (including Isabelle classes). A short usage
5891 internal compilation:
5892 export_code <list of constants (term syntax)> in SML
5893 writing SML code to a file:
5894 export_code <list of constants (term syntax)> in SML <filename>
5895 writing OCaml code to a file:
5896 export_code <list of constants (term syntax)> in OCaml <filename>
5897 writing Haskell code to a bunch of files:
5898 export_code <list of constants (term syntax)> in Haskell <filename>
5900 evaluating closed propositions to True/False using code generation:
5903 Reasonable default setup of framework in HOL.
5905 Theorem attributs for selecting and transforming function equations theorems:
5907 [code fun]: select a theorem as function equation for a specific constant
5908 [code fun del]: deselect a theorem as function equation for a specific constant
5909 [code inline]: select an equation theorem for unfolding (inlining) in place
5910 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5912 User-defined serializations (target in {SML, OCaml, Haskell}):
5914 code_const <and-list of constants (term syntax)>
5915 {(target) <and-list of const target syntax>}+
5917 code_type <and-list of type constructors>
5918 {(target) <and-list of type target syntax>}+
5920 code_instance <and-list of instances>
5922 where instance ::= <type constructor> :: <class>
5924 code_class <and_list of classes>
5925 {(target) <and-list of class target syntax>}+
5926 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5928 code_instance and code_class only are effective to target Haskell.
5930 For example usage see src/HOL/ex/Codegenerator.thy and
5931 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5932 generation from Isabelle/HOL theories is available via "isatool doc
5935 * Code generator: consts in 'consts_code' Isar commands are now
5936 referred to by usual term syntax (including optional type
5939 * Command 'no_translations' removes translation rules from theory
5942 * Overloaded definitions are now actually checked for acyclic
5943 dependencies. The overloading scheme is slightly more general than
5944 that of Haskell98, although Isabelle does not demand an exact
5945 correspondence to type class and instance declarations.
5946 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5947 exotic versions of overloading -- at the discretion of the user!
5949 Polymorphic constants are represented via type arguments, i.e. the
5950 instantiation that matches an instance against the most general
5951 declaration given in the signature. For example, with the declaration
5952 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5953 as c(nat). Overloading is essentially simultaneous structural
5954 recursion over such type arguments. Incomplete specification patterns
5955 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5956 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5957 Command 'print_theory' outputs the normalized system of recursive
5958 equations, see section "definitions".
5960 * Configuration options are maintained within the theory or proof
5961 context (with name and type bool/int/string), providing a very simple
5962 interface to a poor-man's version of general context data. Tools may
5963 declare options in ML (e.g. using Attrib.config_int) and then refer to
5964 these values using Config.get etc. Users may change options via an
5965 associated attribute of the same name. This form of context
5966 declaration works particularly well with commands 'declare' or
5967 'using', for example ``declare [[foo = 42]]''. Thus it has become
5968 very easy to avoid global references, which would not observe Isar
5969 toplevel undo/redo and fail to work with multithreading.
5971 Various global ML references of Pure and HOL have been turned into
5972 configuration options:
5974 Unify.search_bound unify_search_bound
5975 Unify.trace_bound unify_trace_bound
5976 Unify.trace_simp unify_trace_simp
5977 Unify.trace_types unify_trace_types
5978 Simplifier.simp_depth_limit simp_depth_limit
5979 Blast.depth_limit blast_depth_limit
5980 DatatypeProp.dtK datatype_distinctness_limit
5981 fast_arith_neq_limit fast_arith_neq_limit
5982 fast_arith_split_limit fast_arith_split_limit
5984 * Named collections of theorems may be easily installed as context
5985 data using the functor NamedThmsFun (see also
5986 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5987 attributes; there is also a toplevel print command. This facility is
5988 just a common case of general context data, which is the preferred way
5989 for anything more complex than just a list of facts in canonical
5992 * Isar: command 'declaration' augments a local theory by generic
5993 declaration functions written in ML. This enables arbitrary content
5994 being added to the context, depending on a morphism that tells the
5995 difference of the original declaration context wrt. the application
5996 context encountered later on.
5998 * Isar: proper interfaces for simplification procedures. Command
5999 'simproc_setup' declares named simprocs (with match patterns, and body
6000 text in ML). Attribute "simproc" adds/deletes simprocs in the current
6001 context. ML antiquotation @{simproc name} retrieves named simprocs.
6003 * Isar: an extra pair of brackets around attribute declarations
6004 abbreviates a theorem reference involving an internal dummy fact,
6005 which will be ignored later --- only the effect of the attribute on
6006 the background context will persist. This form of in-place
6007 declarations is particularly useful with commands like 'declare' and
6008 'using', for example ``have A using [[simproc a]] by simp''.
6010 * Isar: method "assumption" (and implicit closing of subproofs) now
6011 takes simple non-atomic goal assumptions into account: after applying
6012 an assumption as a rule the resulting subgoals are solved by atomic
6013 assumption steps. This is particularly useful to finish 'obtain'
6014 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
6015 without referring to the original premise "!!x. P x ==> thesis" in the
6016 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
6019 * Isar: implicit use of prems from the Isar proof context is
6020 considered a legacy feature. Common applications like ``have A .''
6021 may be replaced by ``have A by fact'' or ``note `A`''. In general,
6022 referencing facts explicitly here improves readability and
6023 maintainability of proof texts.
6025 * Isar: improper proof element 'guess' is like 'obtain', but derives
6026 the obtained context from the course of reasoning! For example:
6028 assume "EX x y. A x & B y" -- "any previous fact"
6029 then guess x and y by clarify
6031 This technique is potentially adventurous, depending on the facts and
6032 proof tools being involved here.
6034 * Isar: known facts from the proof context may be specified as literal
6035 propositions, using ASCII back-quote syntax. This works wherever
6036 named facts used to be allowed so far, in proof commands, proof
6037 methods, attributes etc. Literal facts are retrieved from the context
6038 according to unification of type and term parameters. For example,
6039 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
6040 theorems in the current context, then these are valid literal facts:
6041 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
6043 There is also a proof method "fact" which does the same composition
6044 for explicit goal states, e.g. the following proof texts coincide with
6045 certain special cases of literal facts:
6047 have "A" by fact == note `A`
6048 have "A ==> B" by fact == note `A ==> B`
6049 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
6050 have "P a ==> Q a" by fact == note `P a ==> Q a`
6052 * Isar: ":" (colon) is no longer a symbolic identifier character in
6053 outer syntax. Thus symbolic identifiers may be used without
6054 additional white space in declarations like this: ``assume *: A''.
6056 * Isar: 'print_facts' prints all local facts of the current context,
6057 both named and unnamed ones.
6059 * Isar: 'def' now admits simultaneous definitions, e.g.:
6061 def x == "t" and y == "u"
6063 * Isar: added command 'unfolding', which is structurally similar to
6064 'using', but affects both the goal state and facts by unfolding given
6065 rewrite rules. Thus many occurrences of the 'unfold' method or
6066 'unfolded' attribute may be replaced by first-class proof text.
6068 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
6069 and command 'unfolding' now all support object-level equalities
6070 (potentially conditional). The underlying notion of rewrite rule is
6071 analogous to the 'rule_format' attribute, but *not* that of the
6072 Simplifier (which is usually more generous).
6074 * Isar: the new attribute [rotated n] (default n = 1) rotates the
6075 premises of a theorem by n. Useful in conjunction with drule.
6077 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
6078 method expression within a sandbox consisting of the first N
6079 sub-goals, which need to exist. For example, ``simp_all [3]''
6080 simplifies the first three sub-goals, while (rule foo, simp_all)[]
6081 simplifies all new goals that emerge from applying rule foo to the
6082 originally first one.
6084 * Isar: schematic goals are no longer restricted to higher-order
6085 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
6088 * Isar: the conclusion of a long theorem statement is now either
6089 'shows' (a simultaneous conjunction, as before), or 'obtains'
6090 (essentially a disjunction of cases with local parameters and
6091 assumptions). The latter allows to express general elimination rules
6092 adequately; in this notation common elimination rules look like this:
6094 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
6096 obtains x where "P x"
6098 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6102 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
6108 The subsequent classical rules even refer to the formal "thesis"
6111 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
6114 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
6115 obtains "thesis ==> something"
6117 The actual proof of an 'obtains' statement is analogous to that of the
6118 Isar proof element 'obtain', only that there may be several cases.
6119 Optional case names may be specified in parentheses; these will be
6120 available both in the present proof and as annotations in the
6121 resulting rule, for later use with the 'cases' method (cf. attribute
6124 * Isar: the assumptions of a long theorem statement are available as
6125 "assms" fact in the proof context. This is more appropriate than the
6126 (historical) "prems", which refers to all assumptions of the current
6127 context, including those from the target locale, proof body etc.
6129 * Isar: 'print_statement' prints theorems from the current theory or
6130 proof context in long statement form, according to the syntax of a
6133 * Isar: 'obtain' takes an optional case name for the local context
6134 introduction rule (default "that").
6136 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6137 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6140 * Pure: syntax "CONST name" produces a fully internalized constant
6141 according to the current context. This is particularly useful for
6142 syntax translations that should refer to internal constant
6143 representations independently of name spaces.
6145 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6146 instead of "FOO ". This allows multiple binder declarations to coexist
6147 in the same context. INCOMPATIBILITY.
6149 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6150 primitive that also works in a locale context (both for constants and
6151 fixed variables). Type declaration and internal syntactic representation
6152 of given constants retrieved from the context. Likewise, the
6153 'no_notation' command allows to remove given syntax annotations from the
6156 * Isar/locales: new derived specification elements 'axiomatization',
6157 'definition', 'abbreviation', which support type-inference, admit
6158 object-level specifications (equality, equivalence). See also the
6159 isar-ref manual. Examples:
6162 eq (infix "===" 50) where
6163 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6165 definition "f x y = x + y + 1"
6166 definition g where "g x = f x x"
6169 neq (infix "=!=" 50) where
6170 "x =!= y == ~ (x === y)"
6172 These specifications may be also used in a locale context. Then the
6173 constants being introduced depend on certain fixed parameters, and the
6174 constant name is qualified by the locale base name. An internal
6175 abbreviation takes care for convenient input and output, making the
6176 parameters implicit and using the original short name. See also
6177 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6178 entities from a monomorphic theory.
6180 Presently, abbreviations are only available 'in' a target locale, but
6181 not inherited by general import expressions. Also note that
6182 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6183 'translations' in common applications. The "no_abbrevs" print mode
6184 prevents folding of abbreviations in term output.
6186 Concrete syntax is attached to specified constants in internal form,
6187 independently of name spaces. The parse tree representation is
6188 slightly different -- use 'notation' instead of raw 'syntax', and
6189 'translations' with explicit "CONST" markup to accommodate this.
6191 * Pure/Isar: unified syntax for new-style specification mechanisms
6192 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6193 full type inference and dummy patterns ("_"). For example:
6195 definition "K x _ = x"
6197 inductive conj for A B
6198 where "A ==> B ==> conj A B"
6200 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6201 the current context. Print mode "no_abbrevs" prevents inversion of
6202 abbreviations on output.
6204 * Isar/locales: improved parameter handling: use of locales "var" and
6205 "struct" no longer necessary; - parameter renamings are no longer
6206 required to be injective. For example, this allows to define
6207 endomorphisms as locale endom = homom mult mult h.
6209 * Isar/locales: changed the way locales with predicates are defined.
6210 Instead of accumulating the specification, the imported expression is
6211 now an interpretation. INCOMPATIBILITY: different normal form of
6212 locale expressions. In particular, in interpretations of locales with
6213 predicates, goals repesenting already interpreted fragments are not
6214 removed automatically. Use methods `intro_locales' and
6215 `unfold_locales'; see below.
6217 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6218 provide backward reasoning on locales predicates. The methods are
6219 aware of interpretations and discharge corresponding goals.
6220 `intro_locales' is less aggressive then `unfold_locales' and does not
6221 unfold predicates to assumptions.
6223 * Isar/locales: the order in which locale fragments are accumulated
6224 has changed. This enables to override declarations from fragments due
6225 to interpretations -- for example, unwanted simp rules.
6227 * Isar/locales: interpretation in theories and proof contexts has been
6228 extended. One may now specify (and prove) equations, which are
6229 unfolded in interpreted theorems. This is useful for replacing
6230 defined concepts (constants depending on locale parameters) by
6231 concepts already existing in the target context. Example:
6233 interpretation partial_order ["op <= :: [int, int] => bool"]
6234 where "partial_order.less (op <=) (x::int) y = (x < y)"
6236 Typically, the constant `partial_order.less' is created by a
6237 definition specification element in the context of locale
6240 * Method "induct": improved internal context management to support
6241 local fixes and defines on-the-fly. Thus explicit meta-level
6242 connectives !! and ==> are rarely required anymore in inductive goals
6243 (using object-logic connectives for this purpose has been long
6244 obsolete anyway). Common proof patterns are explained in
6245 src/HOL/Induct/Common_Patterns.thy, see also
6246 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6249 * Method "induct": improved handling of simultaneous goals. Instead of
6250 introducing object-level conjunction, the statement is now split into
6251 several conclusions, while the corresponding symbolic cases are nested
6252 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6253 see src/HOL/Induct/Common_Patterns.thy, for example.
6255 * Method "induct": mutual induction rules are now specified as a list
6256 of rule sharing the same induction cases. HOL packages usually provide
6257 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6258 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6259 mutual induction rules differently, i.e. like this:
6261 (induct rule: foo_bar.inducts)
6262 (induct set: foo bar)
6263 (induct pred: foo bar)
6264 (induct type: foo bar)
6266 The ML function ProjectRule.projections turns old-style rules into the
6269 * Method "coinduct": dual of induction, see
6270 src/HOL/Library/Coinductive_List.thy for various examples.
6272 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6273 considered a legacy feature.
6275 * Attribute "symmetric" produces result with standardized schematic
6276 variables (index 0). Potential INCOMPATIBILITY.
6278 * Simplifier: by default the simplifier trace only shows top level
6279 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6280 default. Thus there is less danger of being flooded by the trace. The
6281 trace indicates where parts have been suppressed.
6283 * Provers/classical: removed obsolete classical version of elim_format
6284 attribute; classical elim/dest rules are now treated uniformly when
6285 manipulating the claset.
6287 * Provers/classical: stricter checks to ensure that supplied intro,
6288 dest and elim rules are well-formed; dest and elim rules must have at
6291 * Provers/classical: attributes dest/elim/intro take an optional
6292 weight argument for the rule (just as the Pure versions). Weights are
6293 ignored by automated tools, but determine the search order of single
6296 * Syntax: input syntax now supports dummy variable binding "%_. b",
6297 where the body does not mention the bound variable. Note that dummy
6298 patterns implicitly depend on their context of bounds, which makes
6299 "{_. _}" match any set comprehension as expected. Potential
6300 INCOMPATIBILITY -- parse translations need to cope with syntactic
6301 constant "_idtdummy" in the binding position.
6303 * Syntax: removed obsolete syntactic constant "_K" and its associated
6304 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6305 for example "A -> B" => "Pi A (%_. B)".
6307 * Pure: 'class_deps' command visualizes the subclass relation, using
6308 the graph browser tool.
6310 * Pure: 'print_theory' now suppresses certain internal declarations by
6311 default; use '!' option for full details.
6316 * Method "metis" proves goals by applying the Metis general-purpose
6317 resolution prover (see also http://gilith.com/software/metis/).
6318 Examples are in the directory MetisExamples. WARNING: the
6319 Isabelle/HOL-Metis integration does not yet work properly with
6322 * Command 'sledgehammer' invokes external automatic theorem provers as
6323 background processes. It generates calls to the "metis" method if
6324 successful. These can be pasted into the proof. Users do not have to
6325 wait for the automatic provers to return. WARNING: does not really
6326 work with multi-threading.
6328 * New "auto_quickcheck" feature tests outermost goal statements for
6329 potential counter-examples. Controlled by ML references
6330 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6331 5000 milliseconds). Fails silently if statements is outside of
6332 executable fragment, or any other codgenerator problem occurs.
6334 * New constant "undefined" with axiom "undefined x = undefined".
6336 * Added class "HOL.eq", allowing for code generation with polymorphic
6339 * Some renaming of class constants due to canonical name prefixing in
6340 the new 'class' package:
6342 HOL.abs ~> HOL.abs_class.abs
6343 HOL.divide ~> HOL.divide_class.divide
6344 0 ~> HOL.zero_class.zero
6345 1 ~> HOL.one_class.one
6346 op + ~> HOL.plus_class.plus
6347 op - ~> HOL.minus_class.minus
6348 uminus ~> HOL.minus_class.uminus
6349 op * ~> HOL.times_class.times
6350 op < ~> HOL.ord_class.less
6351 op <= > HOL.ord_class.less_eq
6352 Nat.power ~> Power.power_class.power
6353 Nat.size ~> Nat.size_class.size
6354 Numeral.number_of ~> Numeral.number_class.number_of
6355 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6356 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6357 Orderings.min ~> Orderings.ord_class.min
6358 Orderings.max ~> Orderings.ord_class.max
6359 Divides.op div ~> Divides.div_class.div
6360 Divides.op mod ~> Divides.div_class.mod
6361 Divides.op dvd ~> Divides.div_class.dvd
6363 INCOMPATIBILITY. Adaptions may be required in the following cases:
6365 a) User-defined constants using any of the names "plus", "minus",
6366 "times", "less" or "less_eq". The standard syntax translations for
6367 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6370 b) Variables named "plus", "minus", "times", "less", "less_eq"
6371 INCOMPATIBILITY: use more specific names.
6373 c) Permutative equations (e.g. "a + b = b + a")
6374 Since the change of names also changes the order of terms, permutative
6375 rewrite rules may get applied in a different order. Experience shows
6376 that this is rarely the case (only two adaptions in the whole Isabelle
6377 distribution). INCOMPATIBILITY: rewrite proofs
6379 d) ML code directly refering to constant names
6380 This in general only affects hand-written proof tactics, simprocs and
6381 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6382 Consider using @{const_name} antiquotation.
6384 * New class "default" with associated constant "default".
6386 * Function "sgn" is now overloaded and available on int, real, complex
6387 (and other numeric types), using class "sgn". Two possible defs of
6388 sgn are given as equational assumptions in the classes sgn_if and
6389 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6392 * Locale "partial_order" now unified with class "order" (cf. theory
6393 Orderings), added parameter "less". INCOMPATIBILITY.
6395 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6396 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6397 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6399 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6400 changed order of proof goals in instance proofs.
6402 * The transitivity reasoner for partial and linear orders is set up
6403 for classes "order" and "linorder". Instances of the reasoner are available
6404 in all contexts importing or interpreting the corresponding locales.
6405 Method "order" invokes the reasoner separately; the reasoner
6406 is also integrated with the Simplifier as a solver. Diagnostic
6407 command 'print_orders' shows the available instances of the reasoner
6408 in the current context.
6410 * Localized monotonicity predicate in theory "Orderings"; integrated
6411 lemmas max_of_mono and min_of_mono with this predicate.
6414 * Formulation of theorem "dense" changed slightly due to integration
6415 with new class dense_linear_order.
6417 * Uniform lattice theory development in HOL.
6419 constants "meet" and "join" now named "inf" and "sup"
6420 constant "Meet" now named "Inf"
6422 classes "meet_semilorder" and "join_semilorder" now named
6423 "lower_semilattice" and "upper_semilattice"
6424 class "lorder" now named "lattice"
6425 class "comp_lat" now named "complete_lattice"
6427 Instantiation of lattice classes allows explicit definitions
6428 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6430 INCOMPATIBILITY. Theorem renames:
6432 meet_left_le ~> inf_le1
6433 meet_right_le ~> inf_le2
6434 join_left_le ~> sup_ge1
6435 join_right_le ~> sup_ge2
6436 meet_join_le ~> inf_sup_ord
6439 le_meet ~> le_inf_iff
6440 le_join ~> ge_sup_conv
6441 meet_idempotent ~> inf_idem
6442 join_idempotent ~> sup_idem
6443 meet_comm ~> inf_commute
6444 join_comm ~> sup_commute
6445 meet_leI1 ~> le_infI1
6446 meet_leI2 ~> le_infI2
6447 le_joinI1 ~> le_supI1
6448 le_joinI2 ~> le_supI2
6449 meet_assoc ~> inf_assoc
6450 join_assoc ~> sup_assoc
6451 meet_left_comm ~> inf_left_commute
6452 meet_left_idempotent ~> inf_left_idem
6453 join_left_comm ~> sup_left_commute
6454 join_left_idempotent ~> sup_left_idem
6457 le_def_meet ~> le_iff_inf
6458 le_def_join ~> le_iff_sup
6459 join_absorp2 ~> sup_absorb2
6460 join_absorp1 ~> sup_absorb1
6461 meet_absorp1 ~> inf_absorb1
6462 meet_absorp2 ~> inf_absorb2
6463 meet_join_absorp ~> inf_sup_absorb
6464 join_meet_absorp ~> sup_inf_absorb
6465 distrib_join_le ~> distrib_sup_le
6466 distrib_meet_le ~> distrib_inf_le
6468 add_meet_distrib_left ~> add_inf_distrib_left
6469 add_join_distrib_left ~> add_sup_distrib_left
6470 is_join_neg_meet ~> is_join_neg_inf
6471 is_meet_neg_join ~> is_meet_neg_sup
6472 add_meet_distrib_right ~> add_inf_distrib_right
6473 add_join_distrib_right ~> add_sup_distrib_right
6474 add_meet_join_distribs ~> add_sup_inf_distribs
6475 join_eq_neg_meet ~> sup_eq_neg_inf
6476 meet_eq_neg_join ~> inf_eq_neg_sup
6477 add_eq_meet_join ~> add_eq_inf_sup
6478 meet_0_imp_0 ~> inf_0_imp_0
6479 join_0_imp_0 ~> sup_0_imp_0
6480 meet_0_eq_0 ~> inf_0_eq_0
6481 join_0_eq_0 ~> sup_0_eq_0
6482 neg_meet_eq_join ~> neg_inf_eq_sup
6483 neg_join_eq_meet ~> neg_sup_eq_inf
6484 join_eq_if ~> sup_eq_if
6486 mono_meet ~> mono_inf
6487 mono_join ~> mono_sup
6488 meet_bool_eq ~> inf_bool_eq
6489 join_bool_eq ~> sup_bool_eq
6490 meet_fun_eq ~> inf_fun_eq
6491 join_fun_eq ~> sup_fun_eq
6492 meet_set_eq ~> inf_set_eq
6493 join_set_eq ~> sup_set_eq
6494 meet1_iff ~> inf1_iff
6495 meet2_iff ~> inf2_iff
6504 join1_iff ~> sup1_iff
6505 join2_iff ~> sup2_iff
6515 is_meet_Meet ~> is_meet_Inf
6516 Meet_bool_def ~> Inf_bool_def
6517 Meet_fun_def ~> Inf_fun_def
6518 Meet_greatest ~> Inf_greatest
6519 Meet_lower ~> Inf_lower
6520 Meet_set_def ~> Inf_set_def
6523 Sup_bool_eq ~> Sup_bool_def
6524 Sup_fun_eq ~> Sup_fun_def
6525 Sup_set_eq ~> Sup_set_def
6527 listsp_meetI ~> listsp_infI
6528 listsp_meet_eq ~> listsp_inf_eq
6533 * Added syntactic class "size"; overloaded constant "size" now has
6534 type "'a::size ==> bool"
6536 * Internal reorganisation of `size' of datatypes: size theorems
6537 "foo.size" are no longer subsumed by "foo.simps" (but are still
6538 simplification rules by default!); theorems "prod.size" now named
6541 * Class "div" now inherits from class "times" rather than "type".
6544 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6545 Linorder etc. have disappeared; operations defined in terms of
6546 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6548 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6550 * HOL-Word: New extensive library and type for generic, fixed size
6551 machine words, with arithmetic, bit-wise, shifting and rotating
6552 operations, reflection into int, nat, and bool lists, automation for
6553 linear arithmetic (by automatic reflection into nat or int), including
6554 lemmas on overflow and monotonicity. Instantiated to all appropriate
6555 arithmetic type classes, supporting automatic simplification of
6556 numerals on all operations.
6558 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6560 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6562 * Code generator library theories:
6563 - Code_Integer represents HOL integers by big integer literals in target
6565 - Code_Char represents HOL characters by character literals in target
6567 - Code_Char_chr like Code_Char, but also offers treatment of character
6568 codes; includes Code_Integer.
6569 - Executable_Set allows to generate code for finite sets using lists.
6570 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6572 - Executable_Real implements a subset of real numbers, namly those
6573 representable by rational numbers.
6574 - Efficient_Nat implements natural numbers by integers, which in general will
6575 result in higher efficency; pattern matching with 0/Suc is eliminated;
6576 includes Code_Integer.
6577 - Code_Index provides an additional datatype index which is mapped to
6578 target-language built-in integers.
6579 - Code_Message provides an additional datatype message_string which is isomorphic to
6580 strings; messages are mapped to target-language strings.
6582 * New package for inductive predicates
6584 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6587 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6588 for z_1 :: U_1 and ... and z_n :: U_m
6590 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6593 with full support for type-inference, rather than
6595 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6597 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6598 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6600 inductive "s z_1 ... z_m"
6602 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6605 For backward compatibility, there is a wrapper allowing inductive
6606 sets to be defined with the new package via
6609 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6610 for z_1 :: U_1 and ... and z_n :: U_m
6612 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6618 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6619 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6620 for z_1 :: U_1 and ... and z_n :: U_m
6622 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6623 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6626 if the additional syntax "p ..." is required.
6628 Numerous examples can be found in the subdirectories src/HOL/Auth,
6629 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6633 - Since declaration and definition of inductive sets or predicates
6634 is no longer separated, abbreviations involving the newly
6635 introduced sets or predicates must be specified together with the
6636 introduction rules after the 'where' keyword (see above), rather
6637 than before the actual inductive definition.
6639 - The variables in induction and elimination rules are now
6640 quantified in the order of their occurrence in the introduction
6641 rules, rather than in alphabetical order. Since this may break
6642 some proofs, these proofs either have to be repaired, e.g. by
6643 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6644 statements of the form
6646 case (rule_i a_i_1 ... a_i_{k_i})
6648 or the old order of quantification has to be restored by explicitly adding
6649 meta-level quantifiers in the introduction rules, i.e.
6651 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6653 - The format of the elimination rules is now
6655 p z_1 ... z_m x_1 ... x_n ==>
6656 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6661 (x_1, ..., x_n) : s z_1 ... z_m ==>
6662 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6665 for sets rather than
6667 x : s z_1 ... z_m ==>
6668 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6671 This may require terms in goals to be expanded to n-tuples
6672 (e.g. using case_tac or simplification with the split_paired_all
6673 rule) before the above elimination rule is applicable.
6675 - The elimination or case analysis rules for (mutually) inductive
6676 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6677 list of rules "p_1_..._p_k.elims" is no longer available.
6679 * New package "function"/"fun" for general recursive functions,
6680 supporting mutual and nested recursion, definitions in local contexts,
6681 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6682 for small examples, and the separate tutorial on the function
6683 package. The old recdef "package" is still available as before, but
6684 users are encouraged to use the new package.
6686 * Method "lexicographic_order" automatically synthesizes termination
6687 relations as lexicographic combinations of size measures.
6689 * Case-expressions allow arbitrary constructor-patterns (including
6690 "_") and take their order into account, like in functional
6691 programming. Internally, this is translated into nested
6692 case-expressions; missing cases are added and mapped to the predefined
6693 constant "undefined". In complicated cases printing may no longer show
6694 the original input but the internal form. Lambda-abstractions allow
6695 the same form of pattern matching: "% pat1 => e1 | ..." is an
6696 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6699 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6700 is an abbreviation for "of_nat :: nat => int". The simplification
6701 rules for "of_nat" have been changed to work like "int" did
6702 previously. Potential INCOMPATIBILITY:
6703 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6704 - of_nat_diff and of_nat_mult are no longer default simp rules
6706 * Method "algebra" solves polynomial equations over (semi)rings using
6707 Groebner bases. The (semi)ring structure is defined by locales and the
6708 tool setup depends on that generic context. Installing the method for
6709 a specific type involves instantiating the locale and possibly adding
6710 declarations for computation on the coefficients. The method is
6711 already instantiated for natural numbers and for the axiomatic class
6712 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6713 CALCULEMUS 2007 for the general principles underlying this
6714 architecture of context-aware proof-tools.
6716 * Method "ferrack" implements quantifier elimination over
6717 special-purpose dense linear orders using locales (analogous to
6718 "algebra"). The method is already installed for class
6719 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6722 * Former constant "List.op @" now named "List.append". Use ML
6723 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6724 circumvent possible incompatibilities when working on ML level.
6726 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6728 * New function listsum :: 'a list => 'a for arbitrary monoids.
6729 Special syntax: "SUM x <- xs. f x" (and latex variants)
6731 * New syntax for Haskell-like list comprehension (input only), eg.
6732 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6734 * The special syntax for function "filter" has changed from [x :
6735 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6736 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6738 * [a..b] is now defined for arbitrary linear orders. It used to be
6739 defined on nat only, as an abbreviation for [a..<Suc b]
6742 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6744 * New functions "sorted" and "sort" in src/HOL/List.thy.
6746 * New lemma collection field_simps (an extension of ring_simps) for
6747 manipulating (in)equations involving division. Multiplies with all
6748 denominators that can be proved to be non-zero (in equations) or
6749 positive/negative (in inequations).
6751 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6752 have been improved and renamed to ring_simps, group_simps and
6753 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6754 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6756 * Theory Library/Commutative_Ring: switched from recdef to function
6757 package; constants add, mul, pow now curried. Infix syntax for
6758 algebraic operations.
6760 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6763 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6766 * HOL/records: generalised field-update to take a function on the
6767 field rather than the new value: r(|A := x|) is translated to A_update
6768 (K x) r The K-combinator that is internally used is called K_record.
6769 INCOMPATIBILITY: Usage of the plain update functions has to be
6772 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6773 * x = 0, which are required for a semiring. Richer structures do not
6774 inherit from semiring_0 anymore, because this property is a theorem
6775 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6776 there is more to prove, but this is mostly trivial.
6778 * Class "recpower" is generalized to arbitrary monoids, not just
6779 commutative semirings. INCOMPATIBILITY: may need to incorporate
6780 commutativity or semiring properties additionally.
6782 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6783 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6784 better use 'abbreviation'.
6786 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6788 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6789 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6790 significant changes for setting up numeral syntax for types:
6791 - New constants Numeral.pred and Numeral.succ instead
6792 of former Numeral.bin_pred and Numeral.bin_succ.
6793 - Use integer operations instead of bin_add, bin_mult and so on.
6794 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6795 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6797 See src/HOL/Integ/IntArith.thy for an example setup.
6799 * Command 'normal_form' computes the normal form of a term that may
6800 contain free variables. For example ``normal_form "rev [a, b, c]"''
6801 produces ``[b, c, a]'' (without proof). This command is suitable for
6802 heavy-duty computations because the functions are compiled to ML
6803 first. Correspondingly, a method "normalization" is provided. See
6804 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6806 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6807 25 like -->); output depends on the "iff" print_mode, the default is
6808 "A = B" (with priority 50).
6810 * Relations less (<) and less_eq (<=) are also available on type bool.
6811 Modified syntax to disallow nesting without explicit parentheses,
6812 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6815 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6817 * Relation composition operator "op O" now has precedence 75 and binds
6818 stronger than union and intersection. INCOMPATIBILITY.
6820 * The old set interval syntax "{m..n(}" (and relatives) has been
6821 removed. Use "{m..<n}" (and relatives) instead.
6823 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6824 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6825 ``declare [[simproc del: neq]]''.
6827 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6830 * Theorem Cons_eq_map_conv no longer declared as "simp".
6832 * Theorem setsum_mult renamed to setsum_right_distrib.
6834 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6837 * Reimplemented methods "sat" and "satx", with several improvements:
6838 goals no longer need to be stated as "<prems> ==> False", equivalences
6839 (i.e. "=" on type bool) are handled, variable names of the form
6840 "lit_<n>" are no longer reserved, significant speedup.
6842 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6843 zChaff is still supported as well.
6845 * 'inductive' and 'datatype': provide projections of mutual rules,
6846 bundled as foo_bar.inducts;
6848 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6851 * Library: moved theory Accessible_Part to main HOL.
6853 * Library: added theory Coinductive_List of potentially infinite lists
6854 as greatest fixed-point.
6856 * Library: added theory AssocList which implements (finite) maps as
6859 * Method "evaluation" solves goals (i.e. a boolean expression)
6860 efficiently by compiling it to ML. The goal is "proved" (via an
6861 oracle) if it evaluates to True.
6863 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6864 also when invoked by the simplifier. This results in the Simplifier
6865 being more powerful on arithmetic goals. INCOMPATIBILITY.
6866 Configuration option fast_arith_split_limit=0 recovers the old
6869 * Support for hex (0x20) and binary (0b1001) numerals.
6871 * New method: reify eqs (t), where eqs are equations for an
6872 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6873 parameter, computes a term s::'b and a list xs::'a list and proves the
6874 theorem I xs s = t. This is also known as reification or quoting. The
6875 resulting theorem is applied to the subgoal to substitute t with I xs
6876 s. If t is omitted, the subgoal itself is reified.
6878 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6879 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6880 where f is supposed to be a computable function (in the sense of code
6881 generattion). The method uses reify to compute s and xs as above then
6882 applies corr_thm and uses normalization by evaluation to "prove" f s =
6883 r and finally gets the theorem t = r, which is again applied to the
6884 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6886 * Reflection: Automatic reification now handels binding, an example is
6887 available in src/HOL/ex/ReflectionEx.thy
6889 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6890 command 'statespace' that is similar to 'record', but introduces an
6891 abstract specification based on the locale infrastructure instead of
6892 HOL types. This leads to extra flexibility in composing state spaces,
6893 in particular multiple inheritance and renaming of components.
6898 * Hyperreal: Functions root and sqrt are now defined on negative real
6899 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6900 Nonnegativity side conditions have been removed from many lemmas, so
6901 that more subgoals may now be solved by simplification; potential
6904 * Real: new type classes formalize real normed vector spaces and
6905 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6906 and norm :: 'a => real.
6908 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6909 reals into other types. The overloaded constant Reals :: 'a set is now
6910 defined as range of_real; potential INCOMPATIBILITY.
6912 * Real: proper support for ML code generation, including 'quickcheck'.
6913 Reals are implemented as arbitrary precision rationals.
6915 * Hyperreal: Several constants that previously worked only for the
6916 reals have been generalized, so they now work over arbitrary vector
6917 spaces. Type annotations may need to be added in some cases; potential
6920 Infinitesimal :: ('a::real_normed_vector) star set
6921 HFinite :: ('a::real_normed_vector) star set
6922 HInfinite :: ('a::real_normed_vector) star set
6923 approx :: ('a::real_normed_vector) star => 'a star => bool
6924 monad :: ('a::real_normed_vector) star => 'a star set
6925 galaxy :: ('a::real_normed_vector) star => 'a star set
6926 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6927 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6928 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6929 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6930 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6931 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6932 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6933 sgn :: 'a::real_normed_vector => 'a
6934 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6936 * Complex: Some complex-specific constants are now abbreviations for
6937 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6938 hnorm. Other constants have been entirely removed in favor of the
6939 polymorphic versions (INCOMPATIBILITY):
6943 HInfinite <-- CInfinite
6944 Infinitesimal <-- CInfinitesimal
6947 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6948 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6949 (ns)deriv <-- (ns)cderiv
6954 * Formalisation of ideals and the quotient construction over rings.
6956 * Order and lattice theory no longer based on records.
6959 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6960 greatest_closed. INCOMPATIBILITY.
6962 * Method algebra is now set up via an attribute. For examples see
6963 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6964 of algebraic structures.
6966 * Renamed theory CRing to Ring.
6971 * Substantial, yet incomplete support for nominal datatypes (binding
6972 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6973 src/HOL/Nominal/Examples. Prospective users should consult
6974 http://isabelle.in.tum.de/nominal/
6979 * ML basics: just one true type int, which coincides with IntInf.int
6982 * ML within Isar: antiquotations allow to embed statically-checked
6983 formal entities in the source, referring to the context available at
6984 compile-time. For example:
6986 ML {* @{sort "{zero,one}"} *}
6987 ML {* @{typ "'a => 'b"} *}
6988 ML {* @{term "%x. x"} *}
6989 ML {* @{prop "x == y"} *}
6990 ML {* @{ctyp "'a => 'b"} *}
6991 ML {* @{cterm "%x. x"} *}
6992 ML {* @{cprop "x == y"} *}
6993 ML {* @{thm asm_rl} *}
6994 ML {* @{thms asm_rl} *}
6995 ML {* @{type_name c} *}
6996 ML {* @{type_syntax c} *}
6997 ML {* @{const_name c} *}
6998 ML {* @{const_syntax c} *}
7001 ML {* @{theory Pure} *}
7002 ML {* @{theory_ref} *}
7003 ML {* @{theory_ref Pure} *}
7006 ML {* @{clasimpset} *}
7008 The same works for sources being ``used'' within an Isar context.
7010 * ML in Isar: improved error reporting; extra verbosity with
7011 ML_Context.trace enabled.
7013 * Pure/General/table.ML: the join operations now works via exceptions
7014 DUP/SAME instead of type option. This is simpler in simple cases, and
7015 admits slightly more efficient complex applications.
7017 * Pure: 'advanced' translation functions (parse_translation etc.) now
7018 use Context.generic instead of just theory.
7020 * Pure: datatype Context.generic joins theory/Proof.context and
7021 provides some facilities for code that works in either kind of
7022 context, notably GenericDataFun for uniform theory and proof data.
7024 * Pure: simplified internal attribute type, which is now always
7025 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
7026 local (Proof.context) attributes have been discontinued, while
7027 minimizing code duplication. Thm.rule_attribute and
7028 Thm.declaration_attribute build canonical attributes; see also structure
7029 Context for further operations on Context.generic, notably
7030 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
7031 declarations and definitions.
7033 * Context data interfaces (Theory/Proof/GenericDataFun): removed
7034 name/print, uninitialized data defaults to ad-hoc copy of empty value,
7035 init only required for impure data. INCOMPATIBILITY: empty really need
7036 to be empty (no dependencies on theory content!)
7038 * Pure/kernel: consts certification ignores sort constraints given in
7039 signature declarations. (This information is not relevant to the
7040 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
7041 potential INCOMPATIBILITY.
7043 * Pure: axiomatic type classes are now purely definitional, with
7044 explicit proofs of class axioms and super class relations performed
7045 internally. See Pure/axclass.ML for the main internal interfaces --
7046 notably AxClass.define_class supercedes AxClass.add_axclass, and
7047 AxClass.axiomatize_class/classrel/arity supersede
7048 Sign.add_classes/classrel/arities.
7050 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
7051 global/local versions on theory vs. Proof.context have been
7052 discontinued; Attrib.syntax and Method.syntax have been adapted
7053 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
7054 attributes, methods, etc.
7056 * Pure: several functions of signature "... -> theory -> theory * ..."
7057 have been reoriented to "... -> theory -> ... * theory" in order to
7058 allow natural usage in combination with the ||>, ||>>, |-> and
7059 fold_map combinators.
7061 * Pure: official theorem names (closed derivations) and additional
7062 comments (tags) are now strictly separate. Name hints -- which are
7063 maintained as tags -- may be attached any time without affecting the
7066 * Pure: primitive rule lift_rule now takes goal cterm instead of an
7067 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
7068 achieve the old behaviour.
7070 * Pure: the "Goal" constant is now called "prop", supporting a
7071 slightly more general idea of ``protecting'' meta-level rule
7074 * Pure: Logic.(un)varify only works in a global context, which is now
7075 enforced instead of silently assumed. INCOMPATIBILITY, may use
7076 Logic.legacy_(un)varify as temporary workaround.
7078 * Pure: structure Name provides scalable operations for generating
7079 internal variable names, notably Name.variants etc. This replaces
7080 some popular functions from term.ML:
7082 Term.variant -> Name.variant
7083 Term.variantlist -> Name.variant_list
7084 Term.invent_names -> Name.invent_list
7086 Note that low-level renaming rarely occurs in new code -- operations
7087 from structure Variable are used instead (see below).
7089 * Pure: structure Variable provides fundamental operations for proper
7090 treatment of fixed/schematic variables in a context. For example,
7091 Variable.import introduces fixes for schematics of given facts and
7092 Variable.export reverses the effect (up to renaming) -- this replaces
7093 various freeze_thaw operations.
7095 * Pure: structure Goal provides simple interfaces for
7096 init/conclude/finish and tactical prove operations (replacing former
7097 Tactic.prove). Goal.prove is the canonical way to prove results
7098 within a given context; Goal.prove_global is a degraded version for
7099 theory level goals, including a global Drule.standard. Note that
7100 OldGoals.prove_goalw_cterm has long been obsolete, since it is
7101 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7102 in a locale context).
7104 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7105 and type checking (Syntax.check_term etc.), with common combinations
7106 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
7107 which are considered legacy and await removal.
7109 * Pure/Syntax: generic interfaces for type unchecking
7110 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
7111 with common combinations (Syntax.pretty_term, Syntax.string_of_term
7112 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
7113 available for convenience, but refer to the very same operations using
7114 a mere theory instead of a full context.
7116 * Isar: simplified treatment of user-level errors, using exception
7117 ERROR of string uniformly. Function error now merely raises ERROR,
7118 without any side effect on output channels. The Isar toplevel takes
7119 care of proper display of ERROR exceptions. ML code may use plain
7120 handle/can/try; cat_error may be used to concatenate errors like this:
7122 ... handle ERROR msg => cat_error msg "..."
7124 Toplevel ML code (run directly or through the Isar toplevel) may be
7125 embedded into the Isar toplevel with exception display/debug like
7128 Isar.toplevel (fn () => ...)
7130 INCOMPATIBILITY, removed special transform_error facilities, removed
7131 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7132 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7133 -- use plain ERROR instead.
7135 * Isar: theory setup now has type (theory -> theory), instead of a
7136 list. INCOMPATIBILITY, may use #> to compose setup functions.
7138 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7139 ProofContext.debug/verbose flags.
7141 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7142 theory before entering a proof state. Transactions now always see a
7143 quasi-functional intermediate checkpoint, both in interactive and
7146 * Isar: simplified interfaces for outer syntax. Renamed
7147 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7148 OuterSyntax.add_parsers -- this functionality is now included in
7149 OuterSyntax.command etc. INCOMPATIBILITY.
7151 * Simplifier: the simpset of a running simplification process now
7152 contains a proof context (cf. Simplifier.the_context), which is the
7153 very context that the initial simpset has been retrieved from (by
7154 simpset_of/local_simpset_of). Consequently, all plug-in components
7155 (solver, looper etc.) may depend on arbitrary proof data.
7157 * Simplifier.inherit_context inherits the proof context (plus the
7158 local bounds) of the current simplification process; any simproc
7159 etc. that calls the Simplifier recursively should do this! Removed
7160 former Simplifier.inherit_bounds, which is already included here --
7161 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7162 specify an explicit context using Simplifier.context/theory_context.
7164 * Simplifier/Classical Reasoner: more abstract interfaces
7165 change_simpset/claset for modifying the simpset/claset reference of a
7166 theory; raw versions simpset/claset_ref etc. have been discontinued --
7169 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7175 * settings: the default heap location within ISABELLE_HOME_USER now
7176 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7177 Isabelle installations.
7179 * isabelle-process: option -S (secure mode) disables some critical
7180 operations, notably runtime compilation and evaluation of ML source
7183 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7185 * Support for parallel execution, using native multicore support of
7186 Poly/ML 5.1. The theory loader exploits parallelism when processing
7187 independent theories, according to the given theory header
7188 specifications. The maximum number of worker threads is specified via
7189 usedir option -M or the "max-threads" setting in Proof General. A
7190 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7191 to 6 on a 8-core machine. User-code needs to observe certain
7192 guidelines for thread-safe programming, see appendix A in the Isar
7193 Implementation manual.
7197 New in Isabelle2005 (October 2005)
7198 ----------------------------------
7202 * Theory headers: the new header syntax for Isar theories is
7205 imports <theory1> ... <theoryN>
7206 uses <file1> ... <fileM>
7209 where the 'uses' part is optional. The previous syntax
7211 theory <name> = <theory1> + ... + <theoryN>:
7213 will disappear in the next release. Use isatool fixheaders to convert
7214 existing theory files. Note that there is no change in ancient
7215 non-Isar theories now, but these will disappear soon.
7217 * Theory loader: parent theories can now also be referred to via
7218 relative and absolute paths.
7220 * Command 'find_theorems' searches for a list of criteria instead of a
7221 list of constants. Known criteria are: intro, elim, dest, name:string,
7222 simp:term, and any term. Criteria can be preceded by '-' to select
7223 theorems that do not match. Intro, elim, dest select theorems that
7224 match the current goal, name:s selects theorems whose fully qualified
7225 name contain s, and simp:term selects all simplification rules whose
7226 lhs match term. Any other term is interpreted as pattern and selects
7227 all theorems matching the pattern. Available in ProofGeneral under
7228 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7230 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7232 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7233 matching the current goal as introduction rule and not having "HOL."
7234 in their name (i.e. not being defined in theory HOL).
7236 * Command 'thms_containing' has been discontinued in favour of
7237 'find_theorems'; INCOMPATIBILITY.
7239 * Communication with Proof General is now 8bit clean, which means that
7240 Unicode text in UTF-8 encoding may be used within theory texts (both
7241 formal and informal parts). Cf. option -U of the Isabelle Proof
7242 General interface. Here are some simple examples (cf. src/HOL/ex):
7244 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7245 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7247 * Improved efficiency of the Simplifier and, to a lesser degree, the
7248 Classical Reasoner. Typical big applications run around 2 times
7252 *** Document preparation ***
7254 * Commands 'display_drafts' and 'print_drafts' perform simple output
7255 of raw sources. Only those symbols that do not require additional
7256 LaTeX packages (depending on comments in isabellesym.sty) are
7257 displayed properly, everything else is left verbatim. isatool display
7258 and isatool print are used as front ends (these are subject to the
7259 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7261 * Command tags control specific markup of certain regions of text,
7262 notably folding and hiding. Predefined tags include "theory" (for
7263 theory begin and end), "proof" for proof commands, and "ML" for
7264 commands involving ML code; the additional tags "visible" and
7265 "invisible" are unused by default. Users may give explicit tag
7266 specifications in the text, e.g. ''by %invisible (auto)''. The
7267 interpretation of tags is determined by the LaTeX job during document
7268 preparation: see option -V of isatool usedir, or options -n and -t of
7269 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7272 Several document versions may be produced at the same time via isatool
7273 usedir (the generated index.html will link all of them). Typical
7274 specifications include ''-V document=theory,proof,ML'' to present
7275 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7276 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7277 these parts without any formal replacement text. The Isabelle site
7278 default settings produce ''document'' and ''outline'' versions as
7281 * Several new antiquotations:
7283 @{term_type term} prints a term with its type annotated;
7285 @{typeof term} prints the type of a term;
7287 @{const const} is the same as @{term const}, but checks that the
7288 argument is a known logical constant;
7290 @{term_style style term} and @{thm_style style thm} print a term or
7291 theorem applying a "style" to it
7295 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7296 definitions, equations, inequations etc., 'concl' printing only the
7297 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7298 to print the specified premise. TermStyle.add_style provides an ML
7299 interface for introducing further styles. See also the "LaTeX Sugar"
7300 document practical applications. The ML antiquotation prints
7301 type-checked ML expressions verbatim.
7303 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7304 and 'text' support optional locale specification '(in loc)', which
7305 specifies the default context for interpreting antiquotations. For
7306 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7308 * Option 'locale=NAME' of antiquotations specifies an alternative
7309 context interpreting the subsequent argument. For example: @{thm
7310 [locale=lattice] inf_assoc}.
7312 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7315 * Proper output of antiquotations for theory commands involving a
7316 proof context (such as 'locale' or 'theorem (in loc) ...').
7318 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7319 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7321 * isatool usedir: new option -C (default true) controls whether option
7322 -D should include a copy of the original document directory; -C false
7323 prevents unwanted effects such as copying of administrative CVS data.
7328 * Considerably improved version of 'constdefs' command. Now performs
7329 automatic type-inference of declared constants; additional support for
7330 local structure declarations (cf. locales and HOL records), see also
7331 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7332 sequential dependencies of definitions within a single 'constdefs'
7333 section; moreover, the declared name needs to be an identifier. If
7334 all fails, consider to fall back on 'consts' and 'defs' separately.
7336 * Improved indexed syntax and implicit structures. First of all,
7337 indexed syntax provides a notational device for subscripted
7338 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7339 expressions. Secondly, in a local context with structure
7340 declarations, number indexes \<^sub>n or the empty index (default
7341 number 1) refer to a certain fixed variable implicitly; option
7342 show_structs controls printing of implicit structures. Typical
7343 applications of these concepts involve record types and locales.
7345 * New command 'no_syntax' removes grammar declarations (and
7346 translations) resulting from the given syntax specification, which is
7347 interpreted in the same manner as for the 'syntax' command.
7349 * 'Advanced' translation functions (parse_translation etc.) may depend
7350 on the signature of the theory context being presently used for
7351 parsing/printing, see also isar-ref manual.
7353 * Improved 'oracle' command provides a type-safe interface to turn an
7354 ML expression of type theory -> T -> term into a primitive rule of
7355 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7356 is already included here); see also FOL/ex/IffExample.thy;
7359 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7360 before); "cI" is no longer bound, use "c.intro" instead.
7361 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7362 axclasses vs. locales.
7364 * Improved internal renaming of symbolic identifiers -- attach primes
7365 instead of base 26 numbers.
7367 * New flag show_question_marks controls printing of leading question
7368 marks in schematic variable names.
7370 * In schematic variable names, *any* symbol following \<^isub> or
7371 \<^isup> is now treated as part of the base name. For example, the
7372 following works without printing of awkward ".0" indexes:
7374 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7377 * Inner syntax includes (*(*nested*) comments*).
7379 * Pretty printer now supports unbreakable blocks, specified in mixfix
7380 annotations as "(00...)".
7382 * Clear separation of logical types and nonterminals, where the latter
7383 may only occur in 'syntax' specifications or type abbreviations.
7384 Before that distinction was only partially implemented via type class
7385 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7386 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7387 exotic syntax specifications may require further adaption
7388 (e.g. Cube/Cube.thy).
7390 * Removed obsolete type class "logic", use the top sort {} instead.
7391 Note that non-logical types should be declared as 'nonterminals'
7392 rather than 'types'. INCOMPATIBILITY for new object-logic
7395 * Attributes 'induct' and 'cases': type or set names may now be
7396 locally fixed variables as well.
7398 * Simplifier: can now control the depth to which conditional rewriting
7399 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7402 * Simplifier: simplification procedures may now take the current
7403 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7404 interface), which is very useful for calling the Simplifier
7405 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7406 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7407 low-level mk_simproc no longer applies Logic.varify internally, to
7408 allow for use in a context of fixed variables.
7410 * thin_tac now works even if the assumption being deleted contains !!
7411 or ==>. More generally, erule now works even if the major premise of
7412 the elimination rule contains !! or ==>.
7414 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7416 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7417 from Pure, which contains all common declarations already. Both
7418 theories are defined via plain Isabelle/Isar .thy files.
7419 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7420 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7421 use isatool fixcpure to adapt your theory and ML sources.
7423 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7424 selections of theorems in named facts via index ranges.
7426 * 'print_theorems': in theory mode, really print the difference
7427 wrt. the last state (works for interactive theory development only),
7428 in proof mode print all local facts (cf. 'print_facts');
7430 * 'hide': option '(open)' hides only base names.
7432 * More efficient treatment of intermediate checkpoints in interactive
7435 * Code generator is now invoked via code_module (incremental code
7436 generation) and code_library (modular code generation, ML structures
7437 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7438 must be quoted when used as identifiers.
7440 * New 'value' command for reading, evaluating and printing terms using
7441 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7442 quoted when used as identifier.
7447 * New commands for the interpretation of locale expressions in
7448 theories (1), locales (2) and proof contexts (3). These generate
7449 proof obligations from the expression specification. After the
7450 obligations have been discharged, theorems of the expression are added
7451 to the theory, target locale or proof context. The synopsis of the
7452 commands is a follows:
7454 (1) interpretation expr inst
7455 (2) interpretation target < expr
7456 (3) interpret expr inst
7458 Interpretation in theories and proof contexts require a parameter
7459 instantiation of terms from the current context. This is applied to
7460 specifications and theorems of the interpreted expression.
7461 Interpretation in locales only permits parameter renaming through the
7462 locale expression. Interpretation is smart in that interpretations
7463 that are active already do not occur in proof obligations, neither are
7464 instantiated theorems stored in duplicate. Use 'print_interps' to
7465 inspect active interpretations of a particular locale. For details,
7466 see the Isar Reference manual. Examples can be found in
7467 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7469 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7470 'interpret' instead.
7472 * New context element 'constrains' for adding type constraints to
7475 * Context expressions: renaming of parameters with syntax
7478 * Locale declaration: 'includes' disallowed.
7480 * Proper static binding of attribute syntax -- i.e. types / terms /
7481 facts mentioned as arguments are always those of the locale definition
7482 context, independently of the context of later invocations. Moreover,
7483 locale operations (renaming and type / term instantiation) are applied
7484 to attribute arguments as expected.
7486 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7487 actual attributes; rare situations may require Attrib.attribute to
7488 embed those attributes into Attrib.src that lack concrete syntax.
7489 Attribute implementations need to cooperate properly with the static
7490 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7491 Attrib.XXX_thm etc. already do the right thing without further
7492 intervention. Only unusual applications -- such as "where" or "of"
7493 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7494 on the context and the facts involved -- may have to assign parsed
7495 values to argument tokens explicitly.
7497 * Changed parameter management in theorem generation for long goal
7498 statements with 'includes'. INCOMPATIBILITY: produces a different
7499 theorem statement in rare situations.
7501 * Locale inspection command 'print_locale' omits notes elements. Use
7502 'print_locale!' to have them included in the output.
7507 * Provers/hypsubst.ML: improved version of the subst method, for
7508 single-step rewriting: it now works in bound variable contexts. New is
7509 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7510 rewrite a different subterm than the original subst method, which is
7511 still available as 'simplesubst'.
7513 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7516 * Provers/trancl.ML: new transitivity reasoner for transitive and
7517 reflexive-transitive closure of relations.
7519 * Provers/blast.ML: new reference depth_limit to make blast's depth
7520 limit (previously hard-coded with a value of 20) user-definable.
7522 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7523 is peformed already. Object-logics merely need to finish their
7524 initial simpset configuration as before. INCOMPATIBILITY.
7529 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7532 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7534 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7535 and x-symbol; use option '-m epsilon' to get it actually printed.
7536 Moreover, the mathematically important symbolic identifier \<epsilon>
7537 becomes available as variable, constant etc. INCOMPATIBILITY,
7539 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7540 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7541 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7542 support corresponding Isar calculations.
7544 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7547 * theory SetInterval: changed the syntax for open intervals:
7556 The old syntax is still supported but will disappear in the next
7557 release. For conversion use the following Emacs search and replace
7558 patterns (these are not perfect but work quite well):
7560 {)\([^\.]*\)\.\. -> {\1<\.\.}
7561 \.\.\([^(}]*\)(} -> \.\.<\1}
7563 * Theory Commutative_Ring (in Library): method comm_ring for proving
7564 equalities in commutative rings; method 'algebra' provides a generic
7567 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7568 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7569 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7572 Some new syntax forms are available:
7574 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7575 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7576 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7577 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7579 The latter form "\<Sum>x < k. e" used to be based on a separate
7580 function "Summation", which has been discontinued.
7582 * theory Finite_Set: in structured induction proofs, the insert case
7583 is now 'case (insert x F)' instead of the old counterintuitive 'case
7586 * The 'refute' command has been extended to support a much larger
7587 fragment of HOL, including axiomatic type classes, constdefs and
7588 typedefs, inductive datatypes and recursion.
7590 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7591 Requires zChaff with proof generation to be installed. See
7592 HOL/ex/SAT_Examples.thy for examples.
7594 * Datatype induction via method 'induct' now preserves the name of the
7595 induction variable. For example, when proving P(xs::'a list) by
7596 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7597 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7598 in unstructured proof scripts.
7600 * Reworked implementation of records. Improved scalability for
7601 records with many fields, avoiding performance problems for type
7602 inference. Records are no longer composed of nested field types, but
7603 of nested extension types. Therefore the record type only grows linear
7604 in the number of extensions and not in the number of fields. The
7605 top-level (users) view on records is preserved. Potential
7606 INCOMPATIBILITY only in strange cases, where the theory depends on the
7607 old record representation. The type generated for a record is called
7608 <record_name>_ext_type.
7610 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7611 proofs triggered by a record definition or a simproc (if
7612 quick_and_dirty is enabled). Definitions of large records can take
7615 New simproc record_upd_simproc for simplification of multiple record
7616 updates enabled by default. Moreover, trivial updates are also
7617 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7618 occasionally, since simplification is more powerful by default.
7620 * typedef: proper support for polymorphic sets, which contain extra
7621 type-variables in the term.
7623 * Simplifier: automatically reasons about transitivity chains
7624 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7625 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7626 old proofs break occasionally as simplification may now solve more
7627 goals than previously.
7629 * Simplifier: converts x <= y into x = y if assumption y <= x is
7630 present. Works for all partial orders (class "order"), in particular
7631 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7634 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7635 bound variable or a constant then the let is unfolded. Otherwise
7636 first a is simplified to b, and then f b is simplified to g. If
7637 possible we abstract b from g arriving at "let x = b in h x",
7638 otherwise we unfold the let and arrive at g. The simproc can be
7639 enabled/disabled by the reference use_let_simproc. Potential
7640 INCOMPATIBILITY since simplification is more powerful by default.
7642 * Classical reasoning: the meson method now accepts theorems as arguments.
7644 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7645 jobs to provide advice on the provability of subgoals.
7647 * Theory OrderedGroup and Ring_and_Field: various additions and
7648 improvements to faciliate calculations involving equalities and
7651 The following theorems have been eliminated or modified
7654 abs_eq now named abs_of_nonneg
7655 abs_of_ge_0 now named abs_of_nonneg
7656 abs_minus_eq now named abs_of_nonpos
7657 imp_abs_id now named abs_of_nonneg
7658 imp_abs_neg_id now named abs_of_nonpos
7659 mult_pos now named mult_pos_pos
7660 mult_pos_le now named mult_nonneg_nonneg
7661 mult_pos_neg_le now named mult_nonneg_nonpos
7662 mult_pos_neg2_le now named mult_nonneg_nonpos2
7663 mult_neg now named mult_neg_neg
7664 mult_neg_le now named mult_nonpos_nonpos
7666 * The following lemmas in Ring_and_Field have been added to the simplifier:
7669 not_square_less_zero
7671 The following lemmas have been deleted from Real/RealPow:
7681 * Theory Parity: added rules for simplifying exponents.
7685 The following theorems have been eliminated or modified
7688 list_all_Nil now named list_all.simps(1)
7689 list_all_Cons now named list_all.simps(2)
7690 list_all_conv now named list_all_iff
7691 set_mem_eq now named mem_iff
7693 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7694 asymptotic "big O" calculations. See the notes in BigO.thy.
7699 * Theory RealDef: better support for embedding natural numbers and
7700 integers in the reals.
7702 The following theorems have been eliminated or modified
7705 exp_ge_add_one_self now requires no hypotheses
7706 real_of_int_add reversed direction of equality (use [symmetric])
7707 real_of_int_minus reversed direction of equality (use [symmetric])
7708 real_of_int_diff reversed direction of equality (use [symmetric])
7709 real_of_int_mult reversed direction of equality (use [symmetric])
7711 * Theory RComplete: expanded support for floor and ceiling functions.
7713 * Theory Ln is new, with properties of the natural logarithm
7715 * Hyperreal: There is a new type constructor "star" for making
7716 nonstandard types. The old type names are now type synonyms:
7720 hcomplex = complex star
7722 * Hyperreal: Many groups of similarly-defined constants have been
7723 replaced by polymorphic versions (INCOMPATIBILITY):
7725 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7727 starset <-- starsetNat, starsetC
7728 *s* <-- *sNat*, *sc*
7729 starset_n <-- starsetNat_n, starsetC_n
7730 *sn* <-- *sNatn*, *scn*
7731 InternalSets <-- InternalNatSets, InternalCSets
7733 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7734 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7735 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7736 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7737 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7739 * Hyperreal: Many type-specific theorems have been removed in favor of
7740 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7742 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7743 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7744 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7745 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7746 right_minus <-- hypreal_add_minus
7747 left_minus <-- {hypreal,hcomplex}_add_minus_left
7748 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7749 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7750 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7751 mult_1_right <-- hcomplex_mult_one_right
7752 mult_zero_left <-- hcomplex_mult_zero_left
7753 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7754 right_distrib <-- hypnat_add_mult_distrib2
7755 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7756 right_inverse <-- hypreal_mult_inverse
7757 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7758 order_refl <-- {hypreal,hypnat}_le_refl
7759 order_trans <-- {hypreal,hypnat}_le_trans
7760 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7761 order_less_le <-- {hypreal,hypnat}_less_le
7762 linorder_linear <-- {hypreal,hypnat}_le_linear
7763 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7764 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7765 add_nonneg_nonneg <-- hypreal_le_add_order
7767 * Hyperreal: Separate theorems having to do with type-specific
7768 versions of constants have been merged into theorems that apply to the
7769 new polymorphic constants (INCOMPATIBILITY):
7771 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7772 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7773 STAR_Un <-- {STAR,NatStar,STARC}_Un
7774 STAR_Int <-- {STAR,NatStar,STARC}_Int
7775 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7776 STAR_subset <-- {STAR,NatStar,STARC}_subset
7777 STAR_mem <-- {STAR,NatStar,STARC}_mem
7778 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7779 STAR_diff <-- {STAR,STARC}_diff
7780 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7781 STARC_hcomplex_of_complex}_image_subset
7782 starset_n_Un <-- starset{Nat,C}_n_Un
7783 starset_n_Int <-- starset{Nat,C}_n_Int
7784 starset_n_Compl <-- starset{Nat,C}_n_Compl
7785 starset_n_diff <-- starset{Nat,C}_n_diff
7786 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7787 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7788 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7789 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7790 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7791 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7792 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7793 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7794 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7795 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7796 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7797 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7798 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7799 starfun_diff <-- starfun{C,RC,CR}_diff
7800 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7801 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7802 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7803 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7804 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7805 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7806 starfun_Id <-- starfunC_Id
7807 starfun_approx <-- starfun{Nat,CR}_approx
7808 starfun_capprox <-- starfun{C,RC}_capprox
7809 starfun_abs <-- starfunNat_rabs
7810 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7811 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7812 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7813 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7814 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7815 starfun_add_approx <-- starfunCR_add_approx
7816 starfun_inverse_inverse <-- starfunC_inverse_inverse
7817 starfun_divide <-- starfun{C,CR,RC}_divide
7818 starfun_n <-- starfun{Nat,C}_n
7819 starfun_n_mult <-- starfun{Nat,C}_n_mult
7820 starfun_n_add <-- starfun{Nat,C}_n_add
7821 starfun_n_add_minus <-- starfunNat_n_add_minus
7822 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7823 starfun_n_minus <-- starfun{Nat,C}_n_minus
7824 starfun_n_eq <-- starfun{Nat,C}_n_eq
7826 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7827 star_n_minus <-- {hypreal,hcomplex}_minus
7828 star_n_diff <-- {hypreal,hcomplex}_diff
7829 star_n_mult <-- {hypreal,hcomplex}_mult
7830 star_n_inverse <-- {hypreal,hcomplex}_inverse
7831 star_n_le <-- {hypreal,hypnat}_le
7832 star_n_less <-- {hypreal,hypnat}_less
7833 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7834 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7835 star_n_abs <-- hypreal_hrabs
7836 star_n_divide <-- hcomplex_divide
7838 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7839 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7840 star_of_diff <-- hypreal_of_real_diff
7841 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7842 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7843 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7844 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7845 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7846 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7847 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7848 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7849 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7850 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7851 star_of_number_of <-- {hypreal,hcomplex}_number_of
7852 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7853 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7854 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7855 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7856 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7857 star_of_power <-- hypreal_of_real_power
7858 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7860 * Hyperreal: new method "transfer" that implements the transfer
7861 principle of nonstandard analysis. With a subgoal that mentions
7862 nonstandard types like "'a star", the command "apply transfer"
7863 replaces it with an equivalent one that mentions only standard types.
7864 To be successful, all free variables must have standard types; non-
7865 standard variables must have explicit universal quantifiers.
7867 * Hyperreal: A theory of Taylor series.
7872 * Discontinued special version of 'constdefs' (which used to support
7873 continuous functions) in favor of the general Pure one with full
7876 * New simplification procedure for solving continuity conditions; it
7877 is much faster on terms with many nested lambda abstractions (cubic
7878 instead of exponential time).
7880 * New syntax for domain package: selector names are now optional.
7881 Parentheses should be omitted unless argument is lazy, for example:
7883 domain 'a stream = cons "'a" (lazy "'a stream")
7885 * New command 'fixrec' for defining recursive functions with pattern
7886 matching; defining multiple functions with mutual recursion is also
7887 supported. Patterns may include the constants cpair, spair, up, sinl,
7888 sinr, or any data constructor defined by the domain package. The given
7889 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7890 syntax and examples.
7892 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7893 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7894 but the proof obligation additionally includes an admissibility
7895 requirement. The packages generate instances of class cpo or pcpo,
7896 with continuity and strictness theorems for Rep and Abs.
7898 * HOLCF: Many theorems have been renamed according to a more standard naming
7899 scheme (INCOMPATIBILITY):
7901 foo_inject: "foo$x = foo$y ==> x = y"
7902 foo_eq: "(foo$x = foo$y) = (x = y)"
7903 foo_less: "(foo$x << foo$y) = (x << y)"
7904 foo_strict: "foo$UU = UU"
7905 foo_defined: "... ==> foo$x ~= UU"
7906 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7911 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7912 including the First Isomorphism Theorem (on quotienting by the kernel
7915 * ZF/Simplifier: install second copy of type solver that actually
7916 makes use of TC rules declared to Isar proof contexts (or locales);
7917 the old version is still required for ML proof scripts.
7922 * Converted to Isar theory format; use locales instead of axiomatic
7928 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7931 * Pure/library.ML no longer defines its own option datatype, but uses
7932 that of the SML basis, which has constructors NONE and SOME instead of
7933 None and Some, as well as exception Option.Option instead of OPTION.
7934 The functions the, if_none, is_some, is_none have been adapted
7935 accordingly, while Option.map replaces apsome.
7937 * Pure/library.ML: the exception LIST has been given up in favour of
7938 the standard exceptions Empty and Subscript, as well as
7939 Library.UnequalLengths. Function like Library.hd and Library.tl are
7940 superceded by the standard hd and tl functions etc.
7942 A number of basic list functions are no longer exported to the ML
7943 toplevel, as they are variants of predefined functions. The following
7944 suggests how one can translate existing code:
7946 rev_append xs ys = List.revAppend (xs, ys)
7947 nth_elem (i, xs) = List.nth (xs, i)
7948 last_elem xs = List.last xs
7949 flat xss = List.concat xss
7950 seq fs = List.app fs
7951 partition P xs = List.partition P xs
7952 mapfilter f xs = List.mapPartial f xs
7954 * Pure/library.ML: several combinators for linear functional
7955 transformations, notably reverse application and composition:
7958 (x, y) |-> f f #-> g
7960 * Pure/library.ML: introduced/changed precedence of infix operators:
7962 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7964 infix 3 o oo ooo oooo;
7965 infix 4 ~~ upto downto;
7967 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7970 * Pure/library.ML: natural list combinators fold, fold_rev, and
7971 fold_map support linear functional transformations and nesting. For
7974 fold f [x1, ..., xN] y =
7975 y |> f x1 |> ... |> f xN
7977 (fold o fold) f [xs1, ..., xsN] y =
7978 y |> fold f xs1 |> ... |> fold f xsN
7980 fold f [x1, ..., xN] =
7983 (fold o fold) f [xs1, ..., xsN] =
7984 fold f xs1 #> ... #> fold f xsN
7986 * Pure/library.ML: the following selectors on type 'a option are
7989 the: 'a option -> 'a (*partial*)
7990 these: 'a option -> 'a where 'a = 'b list
7991 the_default: 'a -> 'a option -> 'a
7992 the_list: 'a option -> 'a list
7994 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7995 basic operations for association lists, following natural argument
7996 order; moreover the explicit equality predicate passed here avoids
7997 potentially expensive polymorphic runtime equality checks.
7998 The old functions may be expressed as follows:
8000 assoc = uncurry (AList.lookup (op =))
8001 assocs = these oo AList.lookup (op =)
8002 overwrite = uncurry (AList.update (op =)) o swap
8004 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8006 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
8007 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
8009 replacing make_keylist and keyfilter (occassionally used)
8012 make_keylist = AList.make
8013 keyfilter = AList.find (op =)
8015 * eq_fst and eq_snd now take explicit equality parameter, thus
8016 avoiding eqtypes. Naive rewrites:
8018 eq_fst = eq_fst (op =)
8019 eq_snd = eq_snd (op =)
8021 * Removed deprecated apl and apr (rarely used).
8024 apl (n, op) =>>= curry op n
8025 apr (op, m) =>>= fn n => op (n, m)
8027 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
8028 provides a reasonably efficient light-weight implementation of sets as
8031 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
8032 few new operations; existing lookup and update are now curried to
8033 follow natural argument order (for use with fold etc.);
8034 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
8036 * Pure/General: output via the Isabelle channels of
8037 writeln/warning/error etc. is now passed through Output.output, with a
8038 hook for arbitrary transformations depending on the print_mode
8039 (cf. Output.add_mode -- the first active mode that provides a output
8040 function wins). Already formatted output may be embedded into further
8041 text via Output.raw; the result of Pretty.string_of/str_of and derived
8042 functions (string_of_term/cterm/thm etc.) is already marked raw to
8043 accommodate easy composition of diagnostic messages etc. Programmers
8044 rarely need to care about Output.output or Output.raw at all, with
8045 some notable exceptions: Output.output is required when bypassing the
8046 standard channels (writeln etc.), or in token translations to produce
8047 properly formatted results; Output.raw is required when capturing
8048 already output material that will eventually be presented to the user
8049 a second time. For the default print mode, both Output.output and
8050 Output.raw have no effect.
8052 * Pure/General: Output.time_accumulator NAME creates an operator ('a
8053 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
8054 cumulative results are displayed at the end of a batch session.
8056 * Pure/General: File.sysify_path and File.quote_sysify path have been
8057 replaced by File.platform_path and File.shell_path (with appropriate
8058 hooks). This provides a clean interface for unusual systems where the
8059 internal and external process view of file names are different.
8061 * Pure: more efficient orders for basic syntactic entities: added
8062 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
8063 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
8064 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
8065 orders now -- potential INCOMPATIBILITY for code that depends on a
8066 particular order for Symtab.keys, Symtab.dest, etc. (consider using
8067 Library.sort_strings on result).
8069 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
8070 fold_types traverse types/terms from left to right, observing natural
8071 argument order. Supercedes previous foldl_XXX versions, add_frees,
8072 add_vars etc. have been adapted as well: INCOMPATIBILITY.
8074 * Pure: name spaces have been refined, with significant changes of the
8075 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
8076 to extern(_table). The plain name entry path is superceded by a
8077 general 'naming' context, which also includes the 'policy' to produce
8078 a fully qualified name and external accesses of a fully qualified
8079 name; NameSpace.extend is superceded by context dependent
8080 Sign.declare_name. Several theory and proof context operations modify
8081 the naming context. Especially note Theory.restore_naming and
8082 ProofContext.restore_naming to get back to a sane state; note that
8083 Theory.add_path is no longer sufficient to recover from
8084 Theory.absolute_path in particular.
8086 * Pure: new flags short_names (default false) and unique_names
8087 (default true) for controlling output of qualified names. If
8088 short_names is set, names are printed unqualified. If unique_names is
8089 reset, the name prefix is reduced to the minimum required to achieve
8090 the original result when interning again, even if there is an overlap
8091 with earlier declarations.
8093 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
8094 now 'extend', and 'merge' gets an additional Pretty.pp argument
8095 (useful for printing error messages). INCOMPATIBILITY.
8097 * Pure: major reorganization of the theory context. Type Sign.sg and
8098 Theory.theory are now identified, referring to the universal
8099 Context.theory (see Pure/context.ML). Actual signature and theory
8100 content is managed as theory data. The old code and interfaces were
8101 spread over many files and structures; the new arrangement introduces
8102 considerable INCOMPATIBILITY to gain more clarity:
8104 Context -- theory management operations (name, identity, inclusion,
8105 parents, ancestors, merge, etc.), plus generic theory data;
8107 Sign -- logical signature and syntax operations (declaring consts,
8108 types, etc.), plus certify/read for common entities;
8110 Theory -- logical theory operations (stating axioms, definitions,
8111 oracles), plus a copy of logical signature operations (consts,
8112 types, etc.); also a few basic management operations (Theory.copy,
8115 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
8116 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
8117 for convenience -- they merely return the theory.
8119 * Pure: type Type.tsig is superceded by theory in most interfaces.
8121 * Pure: the Isar proof context type is already defined early in Pure
8122 as Context.proof (note that ProofContext.context and Proof.context are
8123 aliases, where the latter is the preferred name). This enables other
8124 Isabelle components to refer to that type even before Isar is present.
8126 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
8127 typeK, constK, axiomK, oracleK), but provide explicit operations for
8128 any of these kinds. For example, Sign.intern typeK is now
8129 Sign.intern_type, Theory.hide_space Sign.typeK is now
8130 Theory.hide_types. Also note that former
8131 Theory.hide_classes/types/consts are now
8132 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8133 internalize their arguments! INCOMPATIBILITY.
8135 * Pure: get_thm interface (of PureThy and ProofContext) expects
8136 datatype thmref (with constructors Name and NameSelection) instead of
8137 plain string -- INCOMPATIBILITY;
8139 * Pure: cases produced by proof methods specify options, where NONE
8140 means to remove case bindings -- INCOMPATIBILITY in
8143 * Pure: the following operations retrieve axioms or theorems from a
8144 theory node or theory hierarchy, respectively:
8146 Theory.axioms_of: theory -> (string * term) list
8147 Theory.all_axioms_of: theory -> (string * term) list
8148 PureThy.thms_of: theory -> (string * thm) list
8149 PureThy.all_thms_of: theory -> (string * thm) list
8151 * Pure: print_tac now outputs the goal through the trace channel.
8153 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8154 Reference Toplevel.debug (default false) controls detailed printing
8155 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8156 controls execution profiling -- set to 1 for time and 2 for space
8157 (both increase the runtime).
8159 * Isar session: The initial use of ROOT.ML is now always timed,
8160 i.e. the log will show the actual process times, in contrast to the
8161 elapsed wall-clock time that the outer shell wrapper produces.
8163 * Simplifier: improved handling of bound variables (nameless
8164 representation, avoid allocating new strings). Simprocs that invoke
8165 the Simplifier recursively should use Simplifier.inherit_bounds to
8166 avoid local name clashes. Failure to do so produces warnings
8167 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8168 for further details.
8170 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8171 bindings for all theorems stored within a given theory; this may help
8172 in porting non-Isar theories to Isar ones, while keeping ML proof
8173 scripts for the time being.
8175 * ML operator HTML.with_charset specifies the charset begin used for
8176 generated HTML files. For example:
8178 HTML.with_charset "utf-8" use_thy "Hebrew";
8179 HTML.with_charset "utf-8" use_thy "Chinese";
8184 * Allow symlinks to all proper Isabelle executables (Isabelle,
8185 isabelle, isatool etc.).
8187 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8188 isatool doc, isatool mkdir, display_drafts etc.).
8190 * isatool usedir: option -f allows specification of the ML file to be
8191 used by Isabelle; default is ROOT.ML.
8193 * New isatool version outputs the version identifier of the Isabelle
8194 distribution being used.
8196 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8197 (containing Boolean satisfiability problems) into Isabelle/HOL
8202 New in Isabelle2004 (April 2004)
8203 --------------------------------
8207 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8208 Replaces linorder.ML.
8210 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8211 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8212 (\<a>...\<z>), are now considered normal letters, and can therefore
8213 be used anywhere where an ASCII letter (a...zA...Z) has until
8214 now. COMPATIBILITY: This obviously changes the parsing of some
8215 terms, especially where a symbol has been used as a binder, say
8216 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8217 as an identifier. Fix it by inserting a space around former
8218 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8219 existing theory and ML files.
8221 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8223 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8224 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8225 a normal (but invisible) letter. For multiple letter subscripts repeat
8226 \<^isub> like this: x\<^isub>1\<^isub>2.
8228 * Pure: There are now sub-/superscripts that can span more than one
8229 character. Text between \<^bsub> and \<^esub> is set in subscript in
8230 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8231 superscript. The new control characters are not identifier parts.
8233 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8234 content of "..." to the latex file instead of \isacntrl... . The "..."
8235 may consist of any printable characters excluding the end bracket >.
8237 * Pure: Using new Isar command "finalconsts" (or the ML functions
8238 Theory.add_finals or Theory.add_finals_i) it is now possible to
8239 declare constants "final", which prevents their being given a definition
8240 later. It is useful for constants whose behaviour is fixed axiomatically
8241 rather than definitionally, such as the meta-logic connectives.
8243 * Pure: 'instance' now handles general arities with general sorts
8244 (i.e. intersections of classes),
8246 * Presentation: generated HTML now uses a CSS style sheet to make layout
8247 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8248 It can be changed to alter the colors/layout of generated pages.
8253 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8254 cut_tac, subgoal_tac and thin_tac:
8255 - Now understand static (Isar) contexts. As a consequence, users of Isar
8256 locales are no longer forced to write Isar proof scripts.
8257 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8259 - INCOMPATIBILITY: names of variables to be instantiated may no
8260 longer be enclosed in quotes. Instead, precede variable name with `?'.
8261 This is consistent with the instantiation attribute "where".
8263 * Attributes "where" and "of":
8264 - Now take type variables of instantiated theorem into account when reading
8265 the instantiation string. This fixes a bug that caused instantiated
8266 theorems to have too special types in some circumstances.
8267 - "where" permits explicit instantiations of type variables.
8269 * Calculation commands "moreover" and "also" no longer interfere with
8270 current facts ("this"), admitting arbitrary combinations with "then"
8274 - Goal statements involving the context element "includes" no longer
8275 generate theorems with internal delta predicates (those ending on
8276 "_axioms") in the premise.
8277 Resolve particular premise with <locale>.intro to obtain old form.
8278 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8279 specification and "includes" elements in goal statement.
8280 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8281 [intro?] and [elim?] (respectively) by default.
8282 - Experimental command for instantiation of locales in proof contexts:
8283 instantiate <label>[<attrs>]: <loc>
8284 Instantiates locale <loc> and adds all its theorems to the current context
8285 taking into account their attributes. Label and attrs are optional
8286 modifiers, like in theorem declarations. If present, names of
8287 instantiated theorems are qualified with <label>, and the attributes
8288 <attrs> are applied after any attributes these theorems might have already.
8289 If the locale has assumptions, a chained fact of the form
8290 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8291 are derived. The command does not support old-style locales declared
8292 with "locale (open)".
8293 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8295 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8301 * Proof import: new image HOL4 contains the imported library from
8302 the HOL4 system with about 2500 theorems. It is imported by
8303 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8304 can be used like any other Isabelle image. See
8305 HOL/Import/HOL/README for more information.
8308 - Much improved handling of linear and partial orders.
8309 Reasoners for linear and partial orders are set up for type classes
8310 "linorder" and "order" respectively, and are added to the default simpset
8311 as solvers. This means that the simplifier can build transitivity chains
8312 to solve goals from the assumptions.
8313 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8314 of blast or auto after simplification become unnecessary because the goal
8315 is solved by simplification already.
8317 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8318 all proved in axiomatic type classes for semirings, rings and fields.
8321 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8322 now formalized using the Ring_and_Field theory mentioned above.
8323 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8324 than before, because now they are set up once in a generic manner.
8325 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8326 Look for the general versions in Ring_and_Field (and Power if they concern
8329 * Type "rat" of the rational numbers is now available in HOL-Complex.
8332 - Record types are now by default printed with their type abbreviation
8333 instead of the list of all field types. This can be configured via
8334 the reference "print_record_type_abbr".
8335 - Simproc "record_upd_simproc" for simplification of multiple updates added
8336 (not enabled by default).
8337 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8338 EX x. x = sel r to True (not enabled by default).
8339 - Tactic "record_split_simp_tac" to split and simplify records added.
8341 * 'specification' command added, allowing for definition by
8342 specification. There is also an 'ax_specification' command that
8343 introduces the new constants axiomatically.
8345 * arith(_tac) is now able to generate counterexamples for reals as well.
8347 * HOL-Algebra: new locale "ring" for non-commutative rings.
8349 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8350 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8352 * HOL-Matrix: a first theory for matrices in HOL with an application of
8353 matrix theory to linear programming.
8355 * Unions and Intersections:
8356 The latex output syntax of UN and INT has been changed
8357 from "\Union x \in A. B" to "\Union_{x \in A} B"
8358 i.e. the index formulae has become a subscript.
8359 Similarly for "\Union x. B", and for \Inter instead of \Union.
8361 * Unions and Intersections over Intervals:
8362 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8363 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8364 like in normal math, and corresponding versions for < and for intersection.
8366 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8367 lexicographic dictonary ordering has been added as "lexord".
8369 * ML: the legacy theory structures Int and List have been removed. They had
8370 conflicted with ML Basis Library structures having the same names.
8372 * 'refute' command added to search for (finite) countermodels. Only works
8373 for a fragment of HOL. The installation of an external SAT solver is
8374 highly recommended. See "HOL/Refute.thy" for details.
8376 * 'quickcheck' command: Allows to find counterexamples by evaluating
8377 formulae under an assignment of free variables to random values.
8378 In contrast to 'refute', it can deal with inductive datatypes,
8379 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8385 * Streams now come with concatenation and are part of the HOLCF image
8389 New in Isabelle2003 (May 2003)
8390 ------------------------------
8394 * Provers/simplifier:
8396 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8397 Assumptions are now subject to complete mutual simplification,
8398 not just from left to right. The simplifier now preserves
8399 the order of assumptions.
8401 Potential INCOMPATIBILITY:
8403 -- simp sometimes diverges where the old version did
8404 not, e.g. invoking simp on the goal
8406 [| P (f x); y = x; f x = f y |] ==> Q
8408 now gives rise to the infinite reduction sequence
8410 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8412 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8415 -- Tactics combining classical reasoner and simplification (such as auto)
8416 are also affected by this change, because many of them rely on
8417 simp. They may sometimes diverge as well or yield a different numbers
8418 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8419 in case of problems. Sometimes subsequent calls to the classical
8420 reasoner will fail because a preceeding call to the simplifier too
8421 eagerly simplified the goal, e.g. deleted redundant premises.
8423 - The simplifier trace now shows the names of the applied rewrite rules
8425 - You can limit the number of recursive invocations of the simplifier
8426 during conditional rewriting (where the simplifie tries to solve the
8427 conditions before applying the rewrite rule):
8428 ML "simp_depth_limit := n"
8429 where n is an integer. Thus you can force termination where previously
8430 the simplifier would diverge.
8432 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8434 - No longer aborts on failed congruence proof. Instead, the
8435 congruence is ignored.
8437 * Pure: New generic framework for extracting programs from constructive
8438 proofs. See HOL/Extraction.thy for an example instantiation, as well
8439 as HOL/Extraction for some case studies.
8441 * Pure: The main goal of the proof state is no longer shown by default, only
8442 the subgoals. This behaviour is controlled by a new flag.
8443 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8444 (ML: Proof.show_main_goal).
8446 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8447 rules whose conclusion matches subgoal 1:
8448 PG menu: Isabelle/Isar -> Show me -> matching rules
8449 The rules are ordered by how closely they match the subgoal.
8450 In particular, rules that solve a subgoal outright are displayed first
8451 (or rather last, the way they are printed).
8452 (ML: ProofGeneral.print_intros())
8454 * Pure: New flag trace_unify_fail causes unification to print
8455 diagnostic information (PG: in trace buffer) when it fails. This is
8456 useful for figuring out why single step proofs like rule, erule or
8459 * Pure: Locale specifications now produce predicate definitions
8460 according to the body of text (covering assumptions modulo local
8461 definitions); predicate "loc_axioms" covers newly introduced text,
8462 while "loc" is cumulative wrt. all included locale expressions; the
8463 latter view is presented only on export into the global theory
8464 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8465 on the old view without predicates;
8467 * Pure: predefined locales "var" and "struct" are useful for sharing
8468 parameters (as in CASL, for example); just specify something like
8469 ``var x + var y + struct M'' as import;
8471 * Pure: improved thms_containing: proper indexing of facts instead of
8472 raw theorems; check validity of results wrt. current name space;
8473 include local facts of proof configuration (also covers active
8474 locales), cover fixed variables in index; may use "_" in term
8475 specification; an optional limit for the number of printed facts may
8476 be given (the default is 40);
8478 * Pure: disallow duplicate fact bindings within new-style theory files
8481 * Provers: improved induct method: assumptions introduced by case
8482 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8483 the goal statement); "foo" still refers to all facts collectively;
8485 * Provers: the function blast.overloaded has been removed: all constants
8486 are regarded as potentially overloaded, which improves robustness in exchange
8487 for slight decrease in efficiency;
8489 * Provers/linorder: New generic prover for transitivity reasoning over
8490 linear orders. Note: this prover is not efficient!
8492 * Isar: preview of problems to finish 'show' now produce an error
8493 rather than just a warning (in interactive mode);
8500 - Produces a counter example if it cannot prove a goal.
8501 Note that the counter example may be spurious if the goal is not a formula
8502 of quantifier-free linear arithmetic.
8503 In ProofGeneral the counter example appears in the trace buffer.
8505 - Knows about div k and mod k where k is a numeral of type nat or int.
8507 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8508 linear arithmetic fails. This takes account of quantifiers and divisibility.
8509 Presburger arithmetic can also be called explicitly via presburger(_tac).
8511 * simp's arithmetic capabilities have been enhanced a bit: it now
8512 takes ~= in premises into account (by performing a case split);
8514 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8515 are distributed over a sum of terms;
8517 * New tactic "trans_tac" and method "trans" instantiate
8518 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8521 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8522 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8524 * 'typedef' command has new option "open" to suppress the set
8527 * functions Min and Max on finite sets have been introduced (theory
8530 * attribute [symmetric] now works for relations as well; it turns
8531 (x,y) : R^-1 into (y,x) : R, and vice versa;
8533 * induct over a !!-quantified statement (say !!x1..xn):
8534 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8536 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8537 %x. None. Warning: empty_def now refers to the previously hidden definition
8540 * Algebra: formalization of classical algebra. Intended as base for
8541 any algebraic development in Isabelle. Currently covers group theory
8542 (up to Sylow's theorem) and ring theory (Universal Property of
8543 Univariate Polynomials). Contributions welcome;
8545 * GroupTheory: deleted, since its material has been moved to Algebra;
8547 * Complex: new directory of the complex numbers with numeric constants,
8548 nonstandard complex numbers, and some complex analysis, standard and
8549 nonstandard (Jacques Fleuriot);
8551 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8553 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8556 * Real/HahnBanach: updated and adapted to locales;
8558 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8561 * UNITY: added the Meier-Sanders theory of progress sets;
8563 * MicroJava: bytecode verifier and lightweight bytecode verifier
8564 as abstract algorithms, instantiated to the JVM;
8566 * Bali: Java source language formalization. Type system, operational
8567 semantics, axiomatic semantics. Supported language features:
8568 classes, interfaces, objects,virtual methods, static methods,
8569 static/instance fields, arrays, access modifiers, definite
8570 assignment, exceptions.
8575 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8578 * Main ZF: virtually all theories converted to new-style format;
8583 * Pure: Tactic.prove provides sane interface for internal proofs;
8584 omits the infamous "standard" operation, so this is more appropriate
8585 than prove_goalw_cterm in many situations (e.g. in simprocs);
8587 * Pure: improved error reporting of simprocs;
8589 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8593 *** Document preparation ***
8595 * uses \par instead of \\ for line breaks in theory text. This may
8596 shift some page breaks in large documents. To get the old behaviour
8597 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8599 * minimized dependencies of isabelle.sty and isabellesym.sty on
8602 * \<euro> now needs package babel/greek instead of marvosym (which
8605 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8610 New in Isabelle2002 (March 2002)
8611 --------------------------------
8613 *** Document preparation ***
8615 * greatly simplified document preparation setup, including more
8616 graceful interpretation of isatool usedir -i/-d/-D options, and more
8617 instructive isatool mkdir; users should basically be able to get
8618 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8619 users may run a separate document processing stage manually like this:
8620 "isatool usedir -D output HOL Test && isatool document Test/output";
8622 * theory dependency graph may now be incorporated into documents;
8623 isatool usedir -g true will produce session_graph.eps/.pdf for use
8624 with \includegraphics of LaTeX;
8626 * proper spacing of consecutive markup elements, especially text
8627 blocks after section headings;
8629 * support bold style (for single symbols only), input syntax is like
8630 this: "\<^bold>\<alpha>" or "\<^bold>A";
8632 * \<bullet> is now output as bold \cdot by default, which looks much
8633 better in printed text;
8635 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8636 note that these symbols are currently unavailable in Proof General /
8637 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8639 * isatool latex no longer depends on changed TEXINPUTS, instead
8640 isatool document copies the Isabelle style files to the target
8646 * Pure/Provers: improved proof by cases and induction;
8647 - 'case' command admits impromptu naming of parameters (such as
8649 - 'induct' method divinates rule instantiation from the inductive
8650 claim; no longer requires excessive ?P bindings for proper
8651 instantiation of cases;
8652 - 'induct' method properly enumerates all possibilities of set/type
8653 rules; as a consequence facts may be also passed through *type*
8654 rules without further ado;
8655 - 'induct' method now derives symbolic cases from the *rulified*
8656 rule (before it used to rulify cases stemming from the internal
8657 atomized version); this means that the context of a non-atomic
8658 statement becomes is included in the hypothesis, avoiding the
8659 slightly cumbersome show "PROP ?case" form;
8660 - 'induct' may now use elim-style induction rules without chaining
8661 facts, using ``missing'' premises from the goal state; this allows
8662 rules stemming from inductive sets to be applied in unstructured
8663 scripts, while still benefitting from proper handling of non-atomic
8664 statements; NB: major inductive premises need to be put first, all
8665 the rest of the goal is passed through the induction;
8666 - 'induct' proper support for mutual induction involving non-atomic
8667 rule statements (uses the new concept of simultaneous goals, see
8669 - append all possible rule selections, but only use the first
8670 success (no backtracking);
8671 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8672 - undeclared rule case names default to numbers 1, 2, 3, ...;
8673 - added 'print_induct_rules' (covered by help item in recent Proof
8675 - moved induct/cases attributes to Pure, methods to Provers;
8676 - generic method setup instantiated for FOL and HOL;
8678 * Pure: support multiple simultaneous goal statements, for example
8679 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8680 meta-level mechanism, this acts as if several individual goals had
8681 been stated separately; in particular common proof methods need to be
8682 repeated in order to cover all claims; note that a single elimination
8683 step is *not* sufficient to establish the two conjunctions, so this
8686 assume "A & B" then have A and B .. (*".." fails*)
8688 better use "obtain" in situations as above; alternative refer to
8689 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8691 * Pure: proper integration with ``locales''; unlike the original
8692 version by Florian Kammller, Isar locales package high-level proof
8693 contexts rather than raw logical ones (e.g. we admit to include
8694 attributes everywhere); operations on locales include merge and
8695 rename; support for implicit arguments (``structures''); simultaneous
8696 type-inference over imports and text; see also HOL/ex/Locales.thy for
8699 * Pure: the following commands have been ``localized'', supporting a
8700 target locale specification "(in name)": 'lemma', 'theorem',
8701 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8702 stored both within the locale and at the theory level (exported and
8703 qualified by the locale name);
8705 * Pure: theory goals may now be specified in ``long'' form, with
8706 ad-hoc contexts consisting of arbitrary locale elements. for example
8707 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8708 definitions may be given, too); the result is a meta-level rule with
8709 the context elements being discharged in the obvious way;
8711 * Pure: new proof command 'using' allows to augment currently used
8712 facts after a goal statement ('using' is syntactically analogous to
8713 'apply', but acts on the goal's facts only); this allows chained facts
8714 to be separated into parts given before and after a claim, as in
8715 ``from a and b have C using d and e <proof>'';
8717 * Pure: renamed "antecedent" case to "rule_context";
8719 * Pure: new 'judgment' command records explicit information about the
8720 object-logic embedding (used by several tools internally); no longer
8721 use hard-wired "Trueprop";
8723 * Pure: added 'corollary' command;
8725 * Pure: fixed 'token_translation' command;
8727 * Pure: removed obsolete 'exported' attribute;
8729 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8730 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8731 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8733 * Pure: method 'atomize' presents local goal premises as object-level
8734 statements (atomic meta-level propositions); setup controlled via
8735 rewrite rules declarations of 'atomize' attribute; example
8736 application: 'induct' method with proper rule statements in improper
8739 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8740 now consider the syntactic context of assumptions, giving a better
8741 chance to get type-inference of the arguments right (this is
8742 especially important for locales);
8744 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8747 * Pure/obtain: the formal conclusion "thesis", being marked as
8748 ``internal'', may no longer be reference directly in the text;
8749 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8752 * Pure: generic 'sym' attribute which declares a rule both as pure
8753 'elim?' and for the 'symmetric' operation;
8755 * Pure: marginal comments ``--'' may now occur just anywhere in the
8756 text; the fixed correlation with particular command syntax has been
8759 * Pure: new method 'rules' is particularly well-suited for proof
8760 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8761 but often produces more compact proof terms with less detours;
8763 * Pure/Provers/classical: simplified integration with pure rule
8764 attributes and methods; the classical "intro?/elim?/dest?"
8765 declarations coincide with the pure ones; the "rule" method no longer
8766 includes classically swapped intros; "intro" and "elim" methods no
8767 longer pick rules from the context; also got rid of ML declarations
8768 AddXIs/AddXEs/AddXDs; all of this has some potential for
8771 * Provers/classical: attribute 'swapped' produces classical inversions
8772 of introduction rules;
8774 * Provers/simplifier: 'simplified' attribute may refer to explicit
8775 rules instead of full simplifier context; 'iff' attribute handles
8778 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8780 * HOL: 'recdef' now fails on unfinished automated proofs, use
8781 "(permissive)" option to recover old behavior;
8783 * HOL: 'inductive' no longer features separate (collective) attributes
8784 for 'intros' (was found too confusing);
8786 * HOL: properly declared induction rules less_induct and
8792 * HOL: moved over to sane numeral syntax; the new policy is as
8795 - 0 and 1 are polymorphic constants, which are defined on any
8796 numeric type (nat, int, real etc.);
8798 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8799 binary representation internally;
8801 - type nat has special constructor Suc, and generally prefers Suc 0
8802 over 1::nat and Suc (Suc 0) over 2::nat;
8804 This change may cause significant problems of INCOMPATIBILITY; here
8805 are some hints on converting existing sources:
8807 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8808 entities, so expressions involving "-" (unary or binary minus) need
8809 to be spaced properly;
8811 - existing occurrences of "1" may need to be constraint "1::nat" or
8812 even replaced by Suc 0; similar for old "2";
8814 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8816 - remove all special provisions on numerals in proofs;
8818 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8819 representation (depends on bin_arith_simps in the default context);
8821 * HOL: symbolic syntax for x^2 (numeral 2);
8823 * HOL: the class of all HOL types is now called "type" rather than
8824 "term"; INCOMPATIBILITY, need to adapt references to this type class
8825 in axclass/classes, instance/arities, and (usually rare) occurrences
8826 in typings (of consts etc.); internally the class is called
8827 "HOL.type", ML programs should refer to HOLogic.typeS;
8829 * HOL/record package improvements:
8830 - new derived operations "fields" to build a partial record section,
8831 "extend" to promote a fixed record to a record scheme, and
8832 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8833 declared as simp by default;
8834 - shared operations ("more", "fields", etc.) now need to be always
8835 qualified) --- potential INCOMPATIBILITY;
8836 - removed "make_scheme" operations (use "make" with "extend") --
8838 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8839 - provides cases/induct rules for use with corresponding Isar
8840 methods (for concrete records, record schemes, concrete more
8841 parts, and schematic more parts -- in that order);
8842 - internal definitions directly based on a light-weight abstract
8843 theory of product types over typedef rather than datatype;
8845 * HOL: generic code generator for generating executable ML code from
8846 specifications; specific support for HOL constructs such as inductive
8847 datatypes and sets, as well as recursive functions; can be invoked
8848 via 'generate_code' theory section;
8850 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8852 * HOL: consolidated and renamed several theories. In particular:
8853 Ord.thy has been absorbed into HOL.thy
8854 String.thy has been absorbed into List.thy
8856 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8857 (beware of argument permutation!);
8859 * HOL: linorder_less_split superseded by linorder_cases;
8861 * HOL/List: "nodups" renamed to "distinct";
8863 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8864 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8865 - Ex_def has changed, now need to use some_eq_ex
8867 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8868 in this (rare) case use:
8870 delSWrapper "split_all_tac"
8871 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8873 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8876 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8877 Isabelle's type classes, ^ on functions and relations has too general
8878 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8879 necessary to attach explicit type constraints;
8881 * HOL/Relation: the prefix name of the infix "O" has been changed from
8882 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8883 renamed accordingly (eg "compI" -> "rel_compI").
8885 * HOL: syntax translations now work properly with numerals and records
8888 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8889 of "lam" -- INCOMPATIBILITY;
8891 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8892 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8893 renamed "Product_Type.unit";
8895 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8897 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8898 the "cases" method);
8900 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8903 * HOL/IMP: updated and converted to new-style theory format; several
8904 parts turned into readable document, with proper Isar proof texts and
8905 some explanations (by Gerwin Klein);
8907 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8909 * HOL-Hyperreal is now a logic image;
8914 * Isar: consts/constdefs supports mixfix syntax for continuous
8917 * Isar: domain package adapted to new-style theory format, e.g. see
8920 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8921 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8922 lift.induct_tac, always use UU instead of Undef;
8924 * HOLCF/IMP: updated and converted to new-style theory;
8929 * Isar: proper integration of logic-specific tools and packages,
8930 including theory commands '(co)inductive', '(co)datatype',
8931 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8932 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8934 * theory Main no longer includes AC; for the Axiom of Choice, base
8935 your theory on Main_ZFC;
8937 * the integer library now covers quotients and remainders, with many
8938 laws relating division to addition, multiplication, etc.;
8940 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8941 typeless version of the formalism;
8943 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8946 * ZF/Induct: new directory for examples of inductive definitions,
8947 including theory Multiset for multiset orderings; converted to
8948 new-style theory format;
8950 * ZF: many new theorems about lists, ordinals, etc.;
8955 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8956 variable proof controls level of detail: 0 = no proofs (only oracle
8957 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8958 also ref manual for further ML interfaces;
8960 * Pure/axclass: removed obsolete ML interface
8961 goal_subclass/goal_arity;
8963 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8964 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8965 separate tokens, so expressions involving minus need to be spaced
8968 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8969 rather than "infixl" or "infixr";
8971 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8972 sort constraint specifications in type inference; e.g. "x::_::foo"
8973 ensures that the type of "x" is of sort "foo" (but not necessarily a
8976 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8977 control output of nested => (types); the default behavior is
8980 * Pure/syntax: builtin parse translation for "_constify" turns valued
8981 tokens into AST constants;
8983 * Pure/syntax: prefer later declarations of translations and print
8984 translation functions; potential INCOMPATIBILITY: need to reverse
8985 multiple declarations for same syntax element constant;
8987 * Pure/show_hyps reset by default (in accordance to existing Isar
8990 * Provers/classical: renamed addaltern to addafter, addSaltern to
8993 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8996 * system: tested support for MacOS X; should be able to get Isabelle +
8997 Proof General to work in a plain Terminal after installing Poly/ML
8998 (e.g. from the Isabelle distribution area) and GNU bash alone
8999 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
9000 support requires further installations, e.g. from
9001 http://fink.sourceforge.net/);
9003 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
9005 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
9006 of 40 MB), cf. ML_OPTIONS;
9008 * system: Proof General keywords specification is now part of the
9009 Isabelle distribution (see etc/isar-keywords.el);
9011 * system: support for persistent Proof General sessions (refrain from
9012 outdating all loaded theories on startup); user may create writable
9013 logic images like this: ``isabelle -q HOL Test'';
9015 * system: smart selection of Isabelle process versus Isabelle
9016 interface, accommodates case-insensitive file systems (e.g. HFS+); may
9017 run both "isabelle" and "Isabelle" even if file names are badly
9018 damaged (executable inspects the case of the first letter of its own
9019 name); added separate "isabelle-process" and "isabelle-interface";
9021 * system: refrain from any attempt at filtering input streams; no
9022 longer support ``8bit'' encoding of old isabelle font, instead proper
9023 iso-latin characters may now be used; the related isatools
9024 "symbolinput" and "nonascii" have disappeared as well;
9026 * system: removed old "xterm" interface (the print modes "xterm" and
9027 "xterm_color" are still available for direct use in a suitable
9032 New in Isabelle99-2 (February 2001)
9033 -----------------------------------
9035 *** Overview of INCOMPATIBILITIES ***
9037 * HOL: please note that theories in the Library and elsewhere often use the
9038 new-style (Isar) format; to refer to their theorems in an ML script you must
9039 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
9041 * HOL: inductive package no longer splits induction rule aggressively,
9042 but only as far as specified by the introductions given; the old
9043 format may be recovered via ML function complete_split_rule or attribute
9044 'split_rule (complete)';
9046 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
9047 gfp_Tarski to gfp_unfold;
9049 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
9051 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
9052 relation); infix "^^" has been renamed "``"; infix "``" has been
9053 renamed "`"; "univalent" has been renamed "single_valued";
9055 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
9058 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
9060 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
9062 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
9063 consequence, it is no longer monotonic wrt. the local goal context
9064 (which is now passed through the inductive cases);
9066 * Document preparation: renamed standard symbols \<ll> to \<lless> and
9067 \<gg> to \<ggreater>;
9070 *** Document preparation ***
9072 * \isabellestyle{NAME} selects version of Isabelle output (currently
9073 available: are "it" for near math-mode best-style output, "sl" for
9074 slanted text style, and "tt" for plain type-writer; if no
9075 \isabellestyle command is given, output is according to slanted
9078 * support sub/super scripts (for single symbols only), input syntax is
9079 like this: "A\<^sup>*" or "A\<^sup>\<star>";
9081 * some more standard symbols; see Appendix A of the system manual for
9082 the complete list of symbols defined in isabellesym.sty;
9084 * improved isabelle style files; more abstract symbol implementation
9085 (should now use \isamath{...} and \isatext{...} in custom symbol
9088 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
9089 state; Note that presentation of goal states does not conform to
9090 actual human-readable proof documents. Please do not include goal
9091 states into document output unless you really know what you are doing!
9093 * proper indentation of antiquoted output with proportional LaTeX
9096 * no_document ML operator temporarily disables LaTeX document
9099 * isatool unsymbolize tunes sources for plain ASCII communication;
9104 * Pure: Isar now suffers initial goal statements to contain unbound
9105 schematic variables (this does not conform to actual readable proof
9106 documents, due to unpredictable outcome and non-compositional proof
9107 checking); users who know what they are doing may use schematic goals
9108 for Prolog-style synthesis of proven results;
9110 * Pure: assumption method (an implicit finishing) now handles actual
9113 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
9114 initial goal, declare "that" only as Pure intro (only for single
9115 steps); the "that" rule assumption may now be involved in implicit
9116 finishing, thus ".." becomes a feasible for trivial obtains;
9118 * Pure: default proof step now includes 'intro_classes'; thus trivial
9119 instance proofs may be performed by "..";
9121 * Pure: ?thesis / ?this / "..." now work for pure meta-level
9124 * Pure: more robust selection of calculational rules;
9126 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
9127 rule (as well as the assumption rule);
9129 * Pure: 'thm_deps' command visualizes dependencies of theorems and
9130 lemmas, using the graph browser tool;
9132 * Pure: predict failure of "show" in interactive mode;
9134 * Pure: 'thms_containing' now takes actual terms as arguments;
9136 * HOL: improved method 'induct' --- now handles non-atomic goals
9137 (potential INCOMPATIBILITY); tuned error handling;
9139 * HOL: cases and induct rules now provide explicit hints about the
9140 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9141 any remaining facts are inserted into the goal verbatim;
9143 * HOL: local contexts (aka cases) may now contain term bindings as
9144 well; the 'cases' and 'induct' methods new provide a ?case binding for
9145 the result to be shown in each case;
9147 * HOL: added 'recdef_tc' command;
9149 * isatool convert assists in eliminating legacy ML scripts;
9154 * HOL/Library: a collection of generic theories to be used together
9155 with main HOL; the theory loader path already includes this directory
9156 by default; the following existing theories have been moved here:
9157 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9158 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9160 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9161 modelling and verification task performed in Isabelle/HOL +
9162 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9164 * HOL/Algebra: special summation operator SUM no longer exists, it has
9165 been replaced by setsum; infix 'assoc' now has priority 50 (like
9166 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9167 'domain', this makes the theory consistent with mathematical
9170 * HOL basics: added overloaded operations "inverse" and "divide"
9171 (infix "/"), syntax for generic "abs" operation, generic summation
9174 * HOL/typedef: simplified package, provide more useful rules (see also
9177 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9178 now expressed as a proper nested rule (old-style tactic scripts may
9179 require atomize_strip_tac to cope with non-atomic premises);
9181 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9182 to "split_conv" (old name still available for compatibility);
9184 * HOL: improved concrete syntax for strings (e.g. allows translation
9185 rules with string literals);
9187 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9188 and Fleuriot's mechanization of analysis, including the transcendental
9189 functions for the reals;
9191 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9196 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9197 "lam" is displayed as TWO lambda-symbols
9199 * CTT: theory Main now available, containing everything (that is, Bool
9205 * Pure: the Simplifier has been implemented properly as a derived rule
9206 outside of the actual kernel (at last!); the overall performance
9207 penalty in practical applications is about 50%, while reliability of
9208 the Isabelle inference kernel has been greatly improved;
9210 * print modes "brackets" and "no_brackets" control output of nested =>
9211 (types) and ==> (props); the default behaviour is "brackets";
9213 * Provers: fast_tac (and friends) now handle actual object-logic rules
9214 as assumptions as well;
9216 * system: support Poly/ML 4.0;
9218 * system: isatool install handles KDE version 1 or 2;
9222 New in Isabelle99-1 (October 2000)
9223 ----------------------------------
9225 *** Overview of INCOMPATIBILITIES ***
9227 * HOL: simplification of natural numbers is much changed; to partly
9228 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9229 issue the following ML commands:
9231 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9232 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9234 * HOL: simplification no longer dives into case-expressions; this is
9235 controlled by "t.weak_case_cong" for each datatype t;
9237 * HOL: nat_less_induct renamed to less_induct;
9239 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9240 fixsome to patch .thy and .ML sources automatically;
9242 select_equality -> some_equality
9243 select_eq_Ex -> some_eq_ex
9244 selectI2EX -> someI2_ex
9247 select1_equality -> some1_equality
9248 Eps_sym_eq -> some_sym_eq_trivial
9249 Eps_eq -> some_eq_trivial
9251 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9253 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9256 * HOL: the recursion equations generated by 'recdef' are now called
9257 f.simps instead of f.rules;
9259 * HOL: qed_spec_mp now also handles bounded ALL as well;
9261 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9262 sometimes be needed;
9264 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9266 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9268 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9269 product is now "<*>" instead of "Times"; the lexicographic product is
9270 now "<*lex*>" instead of "**";
9272 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9273 of main HOL, but was unused); better use HOL's datatype package;
9275 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9276 the old syntax may be recovered as follows:
9279 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9280 (infixl "\\<oplus>" 100)
9282 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9284 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9285 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9288 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9289 changed from A/r to A//r;
9291 * ZF: new treatment of arithmetic (nat & int) may break some old
9294 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9295 rulify -> rule_format, elimify -> elim_format, ...);
9297 * Isar/Provers: intro/elim/dest attributes changed; renamed
9298 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9299 should have to change intro!! to intro? only); replaced "delrule" by
9302 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9304 * Provers: strengthened force_tac by using new first_best_tac;
9306 * LaTeX document preparation: several changes of isabelle.sty (see
9310 *** Document preparation ***
9312 * formal comments (text blocks etc.) in new-style theories may now
9313 contain antiquotations of thm/prop/term/typ/text to be presented
9314 according to latex print mode; concrete syntax is like this:
9315 @{term[show_types] "f(x) = a + x"};
9317 * isatool mkdir provides easy setup of Isabelle session directories,
9318 including proper document sources;
9320 * generated LaTeX sources are now deleted after successful run
9321 (isatool document -c); may retain a copy somewhere else via -D option
9324 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9325 style files, achieving self-contained LaTeX sources and simplifying
9328 * old-style theories now produce (crude) LaTeX output as well;
9330 * browser info session directories are now self-contained (may be put
9331 on WWW server seperately); improved graphs of nested sessions; removed
9332 graph for 'all sessions';
9334 * several improvements in isabelle style files; \isabellestyle{it}
9335 produces fake math mode output; \isamarkupheader is now \section by
9336 default; see lib/texinputs/isabelle.sty etc.;
9341 * Isar/Pure: local results and corresponding term bindings are now
9342 subject to Hindley-Milner polymorphism (similar to ML); this
9343 accommodates incremental type-inference very nicely;
9345 * Isar/Pure: new derived language element 'obtain' supports
9346 generalized existence reasoning;
9348 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9349 support accumulation of results, without applying any rules yet;
9350 useful to collect intermediate results without explicit name
9351 references, and for use with transitivity rules with more than 2
9354 * Isar/Pure: scalable support for case-analysis type proofs: new
9355 'case' language element refers to local contexts symbolically, as
9356 produced by certain proof methods; internally, case names are attached
9357 to theorems as "tags";
9359 * Isar/Pure: theory command 'hide' removes declarations from
9360 class/type/const name spaces;
9362 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9363 indicate potential overloading;
9365 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9367 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9368 "{a,b,c}" instead of {a,b,c};
9370 * Isar/Pure now provides its own version of intro/elim/dest
9371 attributes; useful for building new logics, but beware of confusion
9372 with the version in Provers/classical;
9374 * Isar/Pure: the local context of (non-atomic) goals is provided via
9375 case name 'antecedent';
9377 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9378 to the current context is now done automatically);
9380 * Isar/Pure: theory command 'method_setup' provides a simple interface
9381 for definining proof methods in ML;
9383 * Isar/Provers: intro/elim/dest attributes changed; renamed
9384 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9385 most cases, one should have to change intro!! to intro? only);
9386 replaced "delrule" by "rule del";
9388 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9389 'symmetric' attribute (the latter supercedes [RS sym]);
9391 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9392 method modifier); 'simp' method: 'only:' modifier removes loopers as
9393 well (including splits);
9395 * Isar/Provers: Simplifier and Classical methods now support all kind
9396 of modifiers used in the past, including 'cong', 'iff', etc.
9398 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9399 of Simplifier and Classical reasoner);
9401 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9402 now support named cases; major packages (inductive, datatype, primrec,
9403 recdef) support case names and properly name parameters;
9405 * Isar/HOL: new transitivity rules for substitution in inequalities --
9406 monotonicity conditions are extracted to be proven at end of
9409 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9412 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9413 split_if split_if_asm; datatype package provides theorems foo.splits =
9414 foo.split foo.split_asm for each datatype;
9416 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9417 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9418 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9419 use "(cases (simplified))" method in proper proof texts);
9421 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9423 * Isar: names of theorems etc. may be natural numbers as well;
9425 * Isar: 'pr' command: optional arguments for goals_limit and
9426 ProofContext.prems_limit; no longer prints theory contexts, but only
9429 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9430 additional print modes to be specified; e.g. "pr(latex)" will print
9431 proof state according to the Isabelle LaTeX style;
9433 * Isar: improved support for emulating tactic scripts, including proof
9434 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9435 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9436 (for HOL datatypes);
9438 * Isar: simplified (more robust) goal selection of proof methods: 1st
9439 goal, all goals, or explicit goal specifier (tactic emulation); thus
9440 'proof method scripts' have to be in depth-first order;
9442 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9444 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9445 should instead use individual commands for printing items
9446 (print_commands, print_methods etc.);
9448 * Isar: added 'nothing' --- the empty list of theorems;
9453 * HOL/MicroJava: formalization of a fragment of Java, together with a
9454 corresponding virtual machine and a specification of its bytecode
9455 verifier and a lightweight bytecode verifier, including proofs of
9456 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9457 Cornelia Pusch (see also the homepage of project Bali at
9458 http://isabelle.in.tum.de/Bali/);
9460 * HOL/Algebra: new theory of rings and univariate polynomials, by
9463 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9464 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9467 * HOL/Lattice: fundamental concepts of lattice theory and order
9468 structures, including duals, properties of bounds versus algebraic
9469 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9470 Theorem for complete lattices etc.; may also serve as a demonstration
9471 for abstract algebraic reasoning using axiomatic type classes, and
9472 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9474 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9477 * HOL/IMPP: extension of IMP with local variables and mutually
9478 recursive procedures, by David von Oheimb;
9480 * HOL/Lambda: converted into new-style theory and document;
9482 * HOL/ex/Multiquote: example of multiple nested quotations and
9483 anti-quotations -- basically a generalized version of de-Bruijn
9484 representation; very useful in avoiding lifting of operations;
9486 * HOL/record: added general record equality rule to simpset; fixed
9487 select-update simplification procedure to handle extended records as
9488 well; admit "r" as field name;
9490 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9491 other numeric types and also as the identity of groups, rings, etc.;
9493 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9494 Types nat and int belong to this axclass;
9496 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9497 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9498 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9499 two terms #m*u and #n*u are replaced by #(m+n)*u
9500 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9501 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9502 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9504 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9505 powerful prover for predicate logic but knows nothing of clasets; see
9506 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9508 * HOL: new version of "case_tac" subsumes both boolean case split and
9509 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9510 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9512 * HOL: simplification no longer dives into case-expressions: only the
9513 selector expression is simplified, but not the remaining arms; to
9514 enable full simplification of case-expressions for datatype t, you may
9515 remove t.weak_case_cong from the simpset, either globally (Delcongs
9516 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9518 * HOL/recdef: the recursion equations generated by 'recdef' for
9519 function 'f' are now called f.simps instead of f.rules; if all
9520 termination conditions are proved automatically, these simplification
9521 rules are added to the simpset, as in primrec; rules may be named
9522 individually as well, resulting in a separate list of theorems for
9525 * HOL/While is a new theory that provides a while-combinator. It
9526 permits the definition of tail-recursive functions without the
9527 provision of a termination measure. The latter is necessary once the
9528 invariant proof rule for while is applied.
9530 * HOL: new (overloaded) notation for the set of elements below/above
9531 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9533 * HOL: theorems impI, allI, ballI bound as "strip";
9535 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9536 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9537 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9539 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9541 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9542 main HOL, but was unused);
9544 * HOL: fewer consts declared as global (e.g. have to refer to
9545 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9547 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9548 in case of overlap with user translations (e.g. judgements over
9549 tuples); (note that the underlying logical represenation is still
9555 * ZF: simplification automatically cancels common terms in arithmetic
9556 expressions over nat and int;
9558 * ZF: new treatment of nat to minimize type-checking: all operators
9559 coerce their operands to a natural number using the function natify,
9560 making the algebraic laws unconditional;
9562 * ZF: as above, for int: operators coerce their operands to an integer
9563 using the function intify;
9565 * ZF: the integer library now contains many of the usual laws for the
9566 orderings, including $<=, and monotonicity laws for $+ and $*;
9568 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9571 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9572 to the simplifier and classical reasoner simultaneously;
9577 * Provers: blast_tac now handles actual object-logic rules as
9578 assumptions; note that auto_tac uses blast_tac internally as well;
9580 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9581 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9583 * Provers: delrules now handles destruct rules as well (no longer need
9584 explicit make_elim);
9586 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9587 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9588 use instead the strong form,
9589 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9590 in HOL, FOL and ZF the function cla_make_elim will create such rules
9591 from destruct-rules;
9593 * Provers: Simplifier.easy_setup provides a fast path to basic
9594 Simplifier setup for new object-logics;
9596 * Pure: AST translation rules no longer require constant head on LHS;
9598 * Pure: improved name spaces: ambiguous output is qualified; support
9599 for hiding of names;
9601 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9602 XSYMBOL_HOME; no longer need to do manual configuration in most
9605 * system: compression of ML heaps images may now be controlled via -c
9606 option of isabelle and isatool usedir (currently only observed by
9609 * system: isatool installfonts may handle X-Symbol fonts as well (very
9610 useful for remote X11);
9612 * system: provide TAGS file for Isabelle sources;
9614 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9617 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9618 timing flag supersedes proof_timing and Toplevel.trace;
9620 * ML: new combinators |>> and |>>> for incremental transformations
9621 with secondary results (e.g. certain theory extensions):
9623 * ML: PureThy.add_defs gets additional argument to indicate potential
9624 overloading (usually false);
9626 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9631 New in Isabelle99 (October 1999)
9632 --------------------------------
9634 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9636 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9637 are no longer simplified. (This allows the simplifier to unfold recursive
9638 functional programs.) To restore the old behaviour, declare
9640 Delcongs [if_weak_cong];
9642 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9645 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9647 * HOL/datatype: mutual_induct_tac no longer exists --
9648 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9650 * HOL/typedef: fixed type inference for representing set; type
9651 arguments now have to occur explicitly on the rhs as type constraints;
9653 * ZF: The con_defs part of an inductive definition may no longer refer
9654 to constants declared in the same theory;
9656 * HOL, ZF: the function mk_cases, generated by the inductive
9657 definition package, has lost an argument. To simplify its result, it
9658 uses the default simpset instead of a supplied list of theorems.
9660 * HOL/List: the constructors of type list are now Nil and Cons;
9662 * Simplifier: the type of the infix ML functions
9663 setSSolver addSSolver setSolver addSolver
9664 is now simpset * solver -> simpset where `solver' is a new abstract type
9665 for packaging solvers. A solver is created via
9666 mk_solver: string -> (thm list -> int -> tactic) -> solver
9667 where the string argument is only a comment.
9672 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9673 decision procedure for linear arithmetic. Currently it is used for
9674 types `nat', `int', and `real' in HOL (see below); it can, should and
9675 will be instantiated for other types and logics as well.
9677 * The simplifier now accepts rewrite rules with flexible heads, eg
9678 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9679 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9685 * New Isabelle/Isar subsystem provides an alternative to traditional
9686 tactical theorem proving; together with the ProofGeneral/isar user
9687 interface it offers an interactive environment for developing human
9688 readable proof documents (Isar == Intelligible semi-automated
9689 reasoning); for further information see isatool doc isar-ref,
9690 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9692 * improved and simplified presentation of theories: better HTML markup
9693 (including colors), graph views in several sizes; isatool usedir now
9694 provides a proper interface for user theories (via -P option); actual
9695 document preparation based on (PDF)LaTeX is available as well (for
9696 new-style theories only); see isatool doc system for more information;
9698 * native support for Proof General, both for classic Isabelle and
9701 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9702 using the graph browser tool;
9704 * Isabelle manuals now also available as PDF;
9706 * theory loader rewritten from scratch (may not be fully
9707 bug-compatible); old loadpath variable has been replaced by show_path,
9708 add_path, del_path, reset_path functions; new operations such as
9709 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9712 * improved isatool install: option -k creates KDE application icon,
9713 option -p DIR installs standalone binaries;
9715 * added ML_PLATFORM setting (useful for cross-platform installations);
9716 more robust handling of platform specific ML images for SML/NJ;
9718 * the settings environment is now statically scoped, i.e. it is never
9719 created again in sub-processes invoked from isabelle, isatool, or
9722 * path element specification '~~' refers to '$ISABELLE_HOME';
9724 * in locales, the "assumes" and "defines" parts may be omitted if
9727 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9730 * new print_mode "HTML";
9732 * new flag show_tags controls display of tags of theorems (which are
9733 basically just comments that may be attached by some tools);
9735 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9736 mode and goal output format:
9738 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9740 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9742 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9743 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9745 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9747 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9749 * function bind_thms stores lists of theorems (cf. bind_thm);
9751 * new shorthand tactics ftac, eatac, datac, fatac;
9753 * qed (and friends) now accept "" as result name; in that case the
9754 theorem is not stored, but proper checks and presentation of the
9757 * theorem database now also indexes constants "Trueprop", "all",
9758 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9763 ** HOL arithmetic **
9765 * There are now decision procedures for linear arithmetic over nat and
9768 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9769 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9770 are treated as atomic; subformulae not involving type `nat' or `int'
9771 are ignored; quantified subformulae are ignored unless they are
9772 positive universal or negative existential. The tactic has to be
9773 invoked by hand and can be a little bit slow. In particular, the
9774 running time is exponential in the number of occurrences of `min' and
9775 `max', and `-' on `nat'.
9777 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9778 (negated) (in)equalities among the premises and the conclusion into
9779 account (i.e. no compound formulae) and does not know about `min' and
9780 `max', and `-' on `nat'. It is fast and is used automatically by the
9783 NB: At the moment, these decision procedures do not cope with mixed
9784 nat/int formulae where the two parts interact, such as `m < n ==>
9787 * HOL/Numeral provides a generic theory of numerals (encoded
9788 efficiently as bit strings); setup for types nat/int/real is in place;
9789 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9790 int, existing theories and proof scripts may require a few additional
9793 * integer division and remainder can now be performed on constant
9796 * many properties of integer multiplication, division and remainder
9799 * An interface to the Stanford Validity Checker (SVC) is available through the
9800 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9801 are proved automatically. SVC must be installed separately, and its results
9802 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9803 invocation of the underlying oracle). For SVC see
9804 http://verify.stanford.edu/SVC
9806 * IsaMakefile: the HOL-Real target now builds an actual image;
9811 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9812 (in Isabelle/Isar) -- by Gertrud Bauer;
9814 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9815 analysis for assembly languages with subtypes;
9817 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9818 -- avoids syntactic ambiguities and treats state, transition, and
9819 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9820 changed syntax and (many) tactics;
9822 * HOL/inductive: Now also handles more general introduction rules such
9823 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9824 theorems are now maintained within the theory (maintained via the
9827 * HOL/datatype: Now also handles arbitrarily branching datatypes
9828 (using function types) such as
9830 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9832 * HOL/record: record_simproc (part of the default simpset) takes care
9833 of selectors applied to updated records; record_split_tac is no longer
9834 part of the default claset; update_defs may now be removed from the
9835 simpset in many cases; COMPATIBILITY: old behavior achieved by
9837 claset_ref () := claset() addSWrapper record_split_wrapper;
9838 Delsimprocs [record_simproc]
9840 * HOL/typedef: fixed type inference for representing set; type
9841 arguments now have to occur explicitly on the rhs as type constraints;
9843 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9844 names rather than an ML expression;
9846 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9847 supplied later. Program schemes can be defined, such as
9848 "While B C s = (if B s then While B C (C s) else s)"
9849 where the well-founded relation can be chosen after B and C have been given.
9851 * HOL/List: the constructors of type list are now Nil and Cons;
9852 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9853 course, ML tools referring to List.list.op # etc. have to be adapted;
9855 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9856 disabled by default; run isabelle with option -m HOL to get back to
9857 the original Gordon/HOL-style output;
9859 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9860 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9862 * HOL basic syntax simplified (more orthogonal): all variants of
9863 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9864 Eps operator is provided as well: "SOME x. P[x]";
9866 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9868 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9869 thus available for user theories;
9871 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9872 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9875 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9876 several times and then mp;
9881 * the notation <<...>> is now available as a notation for sequences of
9884 * the simplifier is now installed
9886 * the axiom system has been generalized (thanks to Soren Heilmann)
9888 * the classical reasoner now has a default rule database
9893 * new primrec section allows primitive recursive functions to be given
9894 directly (as in HOL) over datatypes and the natural numbers;
9896 * new tactics induct_tac and exhaust_tac for induction (or case
9897 analysis) over datatypes and the natural numbers;
9899 * the datatype declaration of type T now defines the recursor T_rec;
9901 * simplification automatically does freeness reasoning for datatype
9904 * automatic type-inference, with AddTCs command to insert new
9905 type-checking rules;
9907 * datatype introduction rules are now added as Safe Introduction rules
9910 * the syntax "if P then x else y" is now available in addition to
9914 *** Internal programming interfaces ***
9916 * tuned simplifier trace output; new flag debug_simp;
9918 * structures Vartab / Termtab (instances of TableFun) offer efficient
9919 tables indexed by indexname_ord / term_ord (compatible with aconv);
9921 * AxClass.axclass_tac lost the theory argument;
9923 * tuned current_goals_markers semantics: begin / end goal avoids
9924 printing empty lines;
9926 * removed prs and prs_fn hook, which was broken because it did not
9927 include \n in its semantics, forcing writeln to add one
9928 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9929 string -> unit if you really want to output text without newline;
9931 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9932 plain output, interface builders may have to enable 'isabelle_font'
9933 mode to get Isabelle font glyphs as before;
9935 * refined token_translation interface; INCOMPATIBILITY: output length
9936 now of type real instead of int;
9938 * theory loader actions may be traced via new ThyInfo.add_hook
9939 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9940 your own database of information attached to *whole* theories -- as
9941 opposed to intra-theory data slots offered via TheoryDataFun;
9943 * proper handling of dangling sort hypotheses (at last!);
9944 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9945 extra sort hypotheses that can be witnessed from the type signature;
9946 the force_strip_shyps flag is gone, any remaining shyps are simply
9947 left in the theorem (with a warning issued by strip_shyps_warning);
9951 New in Isabelle98-1 (October 1998)
9952 ----------------------------------
9954 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9956 * several changes of automated proof tools;
9958 * HOL: major changes to the inductive and datatype packages, including
9959 some minor incompatibilities of theory syntax;
9961 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9964 * HOL: removed duplicate thms in Arith:
9965 less_imp_add_less should be replaced by trans_less_add1
9966 le_imp_add_le should be replaced by trans_le_add1
9968 * HOL: unary minus is now overloaded (new type constraints may be
9971 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9972 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9973 now taken as an integer constant.
9975 * Pure: ML function 'theory_of' renamed to 'theory';
9981 1. Asm_full_simp_tac is now more aggressive.
9982 1. It will sometimes reorient premises if that increases their power to
9984 2. It does no longer proceed strictly from left to right but may also
9985 rotate premises to achieve further simplification.
9986 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9987 old Asm_full_simp_tac in that it does not rotate premises.
9988 2. The simplifier now knows a little bit about nat-arithmetic.
9990 * Classical reasoner: wrapper mechanism for the classical reasoner now
9991 allows for selected deletion of wrappers, by introduction of names for
9992 wrapper functionals. This implies that addbefore, addSbefore,
9993 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9994 and that adding two tactics with the same name overwrites the first
9995 one (emitting a warning).
9996 type wrapper = (int -> tactic) -> (int -> tactic)
9997 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9998 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9999 delWrapper, delSWrapper: claset * string -> claset
10000 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
10002 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
10003 semantics; addbefore now affects only the unsafe part of step_tac
10004 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
10005 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
10008 * Classical reasoner: setwrapper to setWrapper and compwrapper to
10009 compWrapper; added safe wrapper (and access functions for it);
10011 * HOL/split_all_tac is now much faster and fails if there is nothing
10012 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
10013 and the names of the automatically generated variables have changed.
10014 split_all_tac has moved within claset() from unsafe wrappers to safe
10015 wrappers, which means that !!-bound variables are split much more
10016 aggressively, and safe_tac and clarify_tac now split such variables.
10017 If this splitting is not appropriate, use delSWrapper "split_all_tac".
10018 Note: the same holds for record_split_tac, which does the job of
10019 split_all_tac for record fields.
10021 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
10022 permanently to the default simpset using Addsplits just like
10023 Addsimps. They can be removed via Delsplits just like
10024 Delsimps. Lower-case versions are also available.
10026 * HOL/Simplifier: The rule split_if is now part of the default
10027 simpset. This means that the simplifier will eliminate all occurrences
10028 of if-then-else in the conclusion of a goal. To prevent this, you can
10029 either remove split_if completely from the default simpset by
10030 `Delsplits [split_if]' or remove it in a specific call of the
10031 simplifier using `... delsplits [split_if]'. You can also add/delete
10032 other case splitting rules to/from the default simpset: every datatype
10033 generates suitable rules `split_t_case' and `split_t_case_asm' (where
10034 t is the name of the datatype).
10036 * Classical reasoner / Simplifier combination: new force_tac (and
10037 derivatives Force_tac, force) combines rewriting and classical
10038 reasoning (and whatever other tools) similarly to auto_tac, but is
10039 aimed to solve the given subgoal completely.
10044 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
10045 and `goalw': the theory is no longer needed as an explicit argument -
10046 the current theory context is used; assumptions are no longer returned
10047 at the ML-level unless one of them starts with ==> or !!; it is
10048 recommended to convert to these new commands using isatool fixgoal
10049 (backup your sources first!);
10051 * new top-level commands 'thm' and 'thms' for retrieving theorems from
10052 the current theory context, and 'theory' to lookup stored theories;
10054 * new theory section 'locale' for declaring constants, assumptions and
10055 definitions that have local scope;
10057 * new theory section 'nonterminals' for purely syntactic types;
10059 * new theory section 'setup' for generic ML setup functions
10060 (e.g. package initialization);
10062 * the distribution now includes Isabelle icons: see
10063 lib/logo/isabelle-{small,tiny}.xpm;
10065 * isatool install - install binaries with absolute references to
10068 * isatool logo -- create instances of the Isabelle logo (as EPS);
10070 * print mode 'emacs' reserved for Isamode;
10072 * support multiple print (ast) translations per constant name;
10074 * theorems involving oracles are now printed with a suffixed [!];
10079 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
10081 * HOL/inductive package reorganized and improved: now supports mutual
10082 definitions such as
10087 oddI "n : EVEN ==> Suc n : ODD"
10088 evenI "n : ODD ==> Suc n : EVEN"
10090 new theorem list "elims" contains an elimination rule for each of the
10091 recursive sets; inductive definitions now handle disjunctive premises
10092 correctly (also ZF);
10094 INCOMPATIBILITIES: requires Inductive as an ancestor; component
10095 "mutual_induct" no longer exists - the induction rule is always
10096 contained in "induct";
10099 * HOL/datatype package re-implemented and greatly improved: now
10100 supports mutually recursive datatypes such as
10103 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10104 | SUM ('a aexp) ('a aexp)
10105 | DIFF ('a aexp) ('a aexp)
10108 'a bexp = LESS ('a aexp) ('a aexp)
10109 | AND ('a bexp) ('a bexp)
10110 | OR ('a bexp) ('a bexp)
10112 as well as indirectly recursive datatypes such as
10115 ('a, 'b) term = Var 'a
10116 | App 'b ((('a, 'b) term) list)
10118 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
10119 induction on mutually / indirectly recursive datatypes.
10121 Primrec equations are now stored in theory and can be accessed via
10122 <function_name>.simps.
10126 - Theories using datatypes must now have theory Datatype as an
10128 - The specific <typename>.induct_tac no longer exists - use the
10129 generic induct_tac instead.
10130 - natE has been renamed to nat.exhaust - use exhaust_tac
10131 instead of res_inst_tac ... natE. Note that the variable
10132 names in nat.exhaust differ from the names in natE, this
10133 may cause some "fragile" proofs to fail.
10134 - The theorems split_<typename>_case and split_<typename>_case_asm
10135 have been renamed to <typename>.split and <typename>.split_asm.
10136 - Since default sorts of type variables are now handled correctly,
10137 some datatype definitions may have to be annotated with explicit
10139 - Primrec definitions no longer require function name and type
10140 of recursive argument.
10142 Consider using isatool fixdatatype to adapt your theories and proof
10143 scripts to the new package (backup your sources first!).
10146 * HOL/record package: considerably improved implementation; now
10147 includes concrete syntax for record types, terms, updates; theorems
10148 for surjective pairing and splitting !!-bound record variables; proof
10149 support is as follows:
10151 1) standard conversions (selectors or updates applied to record
10152 constructor terms) are part of the standard simpset;
10154 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10155 made part of standard simpset and claset via addIffs;
10157 3) a tactic for record field splitting (record_split_tac) is part of
10158 the standard claset (addSWrapper);
10160 To get a better idea about these rules you may retrieve them via
10161 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10162 the name of your record type.
10164 The split tactic 3) conceptually simplifies by the following rule:
10166 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10168 Thus any record variable that is bound by meta-all will automatically
10169 blow up into some record constructor term, consequently the
10170 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10171 solve record problems automatically.
10174 * reorganized the main HOL image: HOL/Integ and String loaded by
10175 default; theory Main includes everything;
10177 * automatic simplification of integer sums and comparisons, using cancellation;
10179 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10181 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10183 * many new identities for unions, intersections, set difference, etc.;
10185 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10186 called split_if, split_split, split_sum_case and split_nat_case (to go
10187 with add/delsplits);
10189 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10190 (?x::unit) = (); this is made part of the default simpset, which COULD
10191 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10192 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10193 unit_abs_eta_conv is added in order to counter the effect of
10194 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10197 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10200 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10201 It and 'sym RS equals0D' are now in the default claset, giving automatic
10202 disjointness reasoning but breaking a few old proofs.
10204 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10205 to 'converse' from 'inverse' (for compatibility with ZF and some
10208 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10209 the well-founded relation;
10211 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10212 Compl A. The "Compl" syntax remains available as input syntax for this
10215 * HOL/Update: new theory of function updates:
10216 f(a:=b) == %x. if x=a then b else f x
10217 may also be iterated as in f(a:=b,c:=d,...);
10219 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10222 - new function list_update written xs[i:=v] that updates the i-th
10223 list position. May also be iterated as in xs[i:=a,j:=b,...].
10224 - new function `upt' written [i..j(] which generates the list
10225 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10226 bound write [i..j], which is a shorthand for [i..j+1(].
10227 - new lexicographic orderings and corresponding wellfoundedness theorems.
10230 - removed 'pred' (predecessor) function;
10231 - generalized some theorems about n-1;
10232 - many new laws about "div" and "mod";
10233 - new laws about greatest common divisors (see theory ex/Primes);
10235 * HOL/Relation: renamed the relational operator r^-1 "converse"
10236 instead of "inverse";
10238 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10239 of the multiset ordering;
10241 * directory HOL/Real: a construction of the reals using Dedekind cuts
10242 (not included by default);
10244 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10246 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10247 programs, i.e. different program variables may have different types.
10249 * calling (stac rew i) now fails if "rew" has no effect on the goal
10250 [previously, this check worked only if the rewrite rule was unconditional]
10251 Now rew can involve either definitions or equalities (either == or =).
10256 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10257 only the theorems proved on ZF.ML;
10259 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10260 It and 'sym RS equals0D' are now in the default claset, giving automatic
10261 disjointness reasoning but breaking a few old proofs.
10263 * ZF/Update: new theory of function updates
10264 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10265 may also be iterated as in f(a:=b,c:=d,...);
10267 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10269 * calling (stac rew i) now fails if "rew" has no effect on the goal
10270 [previously, this check worked only if the rewrite rule was unconditional]
10271 Now rew can involve either definitions or equalities (either == or =).
10273 * case_tac provided for compatibility with HOL
10274 (like the old excluded_middle_tac, but with subgoals swapped)
10277 *** Internal programming interfaces ***
10279 * Pure: several new basic modules made available for general use, see
10280 also src/Pure/README;
10282 * improved the theory data mechanism to support encapsulation (data
10283 kind name replaced by private Object.kind, acting as authorization
10284 key); new type-safe user interface via functor TheoryDataFun; generic
10285 print_data function becomes basically useless;
10287 * removed global_names compatibility flag -- all theory declarations
10288 are qualified by default;
10290 * module Pure/Syntax now offers quote / antiquote translation
10291 functions (useful for Hoare logic etc. with implicit dependencies);
10292 see HOL/ex/Antiquote for an example use;
10294 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10297 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10300 * Display.print_goals function moved to Locale.print_goals;
10302 * standard print function for goals supports current_goals_markers
10303 variable for marking begin of proof, end of proof, start of goal; the
10304 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10305 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10310 New in Isabelle98 (January 1998)
10311 --------------------------------
10313 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10315 * changed lexical syntax of terms / types: dots made part of long
10316 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10318 * simpset (and claset) reference variable replaced by functions
10319 simpset / simpset_ref;
10321 * no longer supports theory aliases (via merge) and non-trivial
10322 implicit merge of thms' signatures;
10324 * most internal names of constants changed due to qualified names;
10326 * changed Pure/Sequence interface (see Pure/seq.ML);
10329 *** General Changes ***
10331 * hierachically structured name spaces (for consts, types, axms, thms
10332 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10333 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10334 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10335 long_names for fully qualified output names; NOTE: ML programs
10336 (special tactics, packages etc.) referring to internal names may have
10337 to be adapted to cope with fully qualified names; in case of severe
10338 backward campatibility problems try setting 'global_names' at compile
10339 time to have enrything declared within a flat name space; one may also
10340 fine tune name declarations in theories via the 'global' and 'local'
10343 * reimplemented the implicit simpset and claset using the new anytype
10344 data filed in signatures; references simpset:simpset ref etc. are
10345 replaced by functions simpset:unit->simpset and
10346 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10347 to patch your ML files accordingly;
10349 * HTML output now includes theory graph data for display with Java
10350 applet or isatool browser; data generated automatically via isatool
10351 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10353 * defs may now be conditional; improved rewrite_goals_tac to handle
10354 conditional equations;
10356 * defs now admits additional type arguments, using TYPE('a) syntax;
10358 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10359 creates a new theory node; implicit merge of thms' signatures is
10360 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10361 transfer:theory->thm->thm in (rare) cases;
10363 * improved handling of draft signatures / theories; draft thms (and
10364 ctyps, cterms) are automatically promoted to real ones;
10366 * slightly changed interfaces for oracles: admit many per theory, named
10367 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10369 * print_goals: optional output of const types (set show_consts and
10372 * improved output of warnings (###) and errors (***);
10374 * subgoal_tac displays a warning if the new subgoal has type variables;
10376 * removed old README and Makefiles;
10378 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10380 * removed obsolete init_pps and init_database;
10382 * deleted the obsolete tactical STATE, which was declared by
10383 fun STATE tacfun st = tacfun st st;
10385 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10386 (which abbreviates $HOME);
10388 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10389 use isatool fixseq to adapt your ML programs (this works for fully
10390 qualified references to the Sequence structure only!);
10392 * use_thy no longer requires writable current directory; it always
10393 reloads .ML *and* .thy file, if either one is out of date;
10396 *** Classical Reasoner ***
10398 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10399 tactics that use classical reasoning to simplify a subgoal without
10400 splitting it into several subgoals;
10402 * Safe_tac: like safe_tac but uses the default claset;
10407 * added simplification meta rules:
10408 (asm_)(full_)simplify: simpset -> thm -> thm;
10410 * simplifier.ML no longer part of Pure -- has to be loaded by object
10413 * added prems argument to simplification procedures;
10415 * HOL, FOL, ZF: added infix function `addsplits':
10416 instead of `<simpset> setloop (split_tac <thms>)'
10417 you can simply write `<simpset> addsplits <thms>'
10422 * TYPE('a) syntax for type reflection terms;
10424 * no longer handles consts with name "" -- declare as 'syntax' instead;
10426 * pretty printer: changed order of mixfix annotation preference (again!);
10428 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10433 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10434 with `addloop' of the simplifier to faciliate case splitting in premises.
10436 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10438 * HOL/Auth: new protocol proofs including some for the Internet
10441 * HOL/Map: new theory of `maps' a la VDM;
10443 * HOL/simplifier: simplification procedures nat_cancel_sums for
10444 cancelling out common nat summands from =, <, <= (in)equalities, or
10445 differences; simplification procedures nat_cancel_factor for
10446 cancelling common factor from =, <, <= (in)equalities over natural
10447 sums; nat_cancel contains both kinds of procedures, it is installed by
10448 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10450 * HOL/simplifier: terms of the form
10451 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10453 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10454 and those of the form
10455 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10457 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10460 Each datatype `t' now comes with a theorem `split_t_case' of the form
10462 P(t_case f1 ... fn x) =
10463 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10465 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10468 and a theorem `split_t_case_asm' of the form
10470 P(t_case f1 ... fn x) =
10471 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10473 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10475 which can be added to a simpset via `addsplits'. The existing theorems
10476 expand_list_case and expand_option_case have been renamed to
10477 split_list_case and split_option_case.
10480 - `pred n' is automatically converted to `n-1'.
10481 Users are strongly encouraged not to use `pred' any longer,
10482 because it will disappear altogether at some point.
10483 - Users are strongly encouraged to write "0 < n" rather than
10484 "n ~= 0". Theorems and proof tools have been modified towards this
10488 the function "set_of_list" has been renamed "set" (and its theorems too);
10489 the function "nth" now takes its arguments in the reverse order and
10490 has acquired the infix notation "!" as in "xs!n".
10492 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10494 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10495 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10497 * HOL/record: extensible records with schematic structural subtyping
10498 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10499 still lacks various theorems and concrete record syntax;
10504 * removed "axioms" and "generated by" sections;
10506 * replaced "ops" section by extended "consts" section, which is capable of
10507 handling the continuous function space "->" directly;
10510 . proves theorems immediately and stores them in the theory,
10511 . creates hierachical name space,
10512 . now uses normal mixfix annotations (instead of cinfix...),
10513 . minor changes to some names and values (for consistency),
10514 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10515 . separator between mutual domain defs: changed "," to "and",
10516 . improved handling of sort constraints; now they have to
10517 appear on the left-hand side of the equations only;
10519 * fixed LAM <x,y,zs>.b syntax;
10521 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10522 adm (%x. P (t x)), where P is chainfinite and t continuous;
10527 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10528 with `addloop' of the simplifier to faciliate case splitting in premises.
10530 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10531 in HOL, they strip ALL and --> from proved theorems;
10535 New in Isabelle94-8 (May 1997)
10536 ------------------------------
10538 *** General Changes ***
10540 * new utilities to build / run / maintain Isabelle etc. (in parts
10541 still somewhat experimental); old Makefiles etc. still functional;
10543 * new 'Isabelle System Manual';
10545 * INSTALL text, together with ./configure and ./build scripts;
10547 * reimplemented type inference for greater efficiency, better error
10548 messages and clean internal interface;
10550 * prlim command for dealing with lots of subgoals (an easier way of
10551 setting goals_limit);
10556 * supports alternative (named) syntax tables (parser and pretty
10557 printer); internal interface is provided by add_modesyntax(_i);
10559 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10560 be used in conjunction with the Isabelle symbol font; uses the
10561 "symbols" syntax table;
10563 * added token_translation interface (may translate name tokens in
10564 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10565 the current print_mode); IMPORTANT: user print translation functions
10566 are responsible for marking newly introduced bounds
10567 (Syntax.mark_boundT);
10569 * token translations for modes "xterm" and "xterm_color" that display
10570 names in bold, underline etc. or colors (which requires a color
10573 * infixes may now be declared with names independent of their syntax;
10575 * added typed_print_translation (like print_translation, but may
10576 access type of constant);
10579 *** Classical Reasoner ***
10581 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10582 some limitations. Blast_tac...
10583 + ignores addss, addbefore, addafter; this restriction is intrinsic
10584 + ignores elimination rules that don't have the correct format
10585 (the conclusion MUST be a formula variable)
10586 + ignores types, which can make HOL proofs fail
10587 + rules must not require higher-order unification, e.g. apply_type in ZF
10588 [message "Function Var's argument not a bound variable" relates to this]
10589 + its proof strategy is more general but can actually be slower
10591 * substitution with equality assumptions no longer permutes other
10594 * minor changes in semantics of addafter (now called addaltern); renamed
10595 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10596 (and access functions for it);
10598 * improved combination of classical reasoner and simplifier:
10599 + functions for handling clasimpsets
10600 + improvement of addss: now the simplifier is called _after_ the
10602 + safe variant of addss called addSss: uses safe simplifications
10603 _during_ the safe steps. It is more complete as it allows multiple
10604 instantiations of unknowns (e.g. with slow_tac).
10608 * added interface for simplification procedures (functions that
10609 produce *proven* rewrite rules on the fly, depending on current
10612 * ordering on terms as parameter (used for ordered rewriting);
10614 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10616 * the solver is now split into a safe and an unsafe part.
10617 This should be invisible for the normal user, except that the
10618 functions setsolver and addsolver have been renamed to setSolver and
10619 addSolver; added safe_asm_full_simp_tac;
10624 * a generic induction tactic `induct_tac' which works for all datatypes and
10625 also for type `nat';
10627 * a generic case distinction tactic `exhaust_tac' which works for all
10628 datatypes and also for type `nat';
10630 * each datatype comes with a function `size';
10632 * patterns in case expressions allow tuple patterns as arguments to
10633 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10635 * primrec now also works with type nat;
10637 * recdef: a new declaration form, allows general recursive functions to be
10638 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10640 * the constant for negation has been renamed from "not" to "Not" to
10641 harmonize with FOL, ZF, LK, etc.;
10643 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10646 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10648 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10649 problems in commutative rings, using axiomatic type classes for + and *;
10651 * more examples in HOL/MiniML and HOL/Auth;
10653 * more default rewrite rules for quantifiers, union/intersection;
10655 * a new constant `arbitrary == @x.False';
10657 * HOLCF/IOA replaces old HOL/IOA;
10659 * HOLCF changes: derived all rules and arities
10660 + axiomatic type classes instead of classes
10661 + typedef instead of faking type definitions
10662 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10663 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10664 + eliminated the types void, one, tr
10665 + use unit lift and bool lift (with translations) instead of one and tr
10666 + eliminated blift from Lift3.thy (use Def instead of blift)
10667 all eliminated rules are derived as theorems --> no visible changes ;
10672 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10673 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10674 as ZF_cs addSIs [equalityI];
10678 New in Isabelle94-7 (November 96)
10679 ---------------------------------
10681 * allowing negative levels (as offsets) in prlev and choplev;
10683 * super-linear speedup for large simplifications;
10685 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10686 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10687 FAIL); can suppress it using the command Delsimps (ex_simps @
10688 all_simps); De Morgan laws are also now included, by default;
10690 * improved printing of ==> : ~:
10692 * new object-logic "Sequents" adds linear logic, while replacing LK
10693 and Modal (thanks to Sara Kalvala);
10695 * HOL/Auth: correctness proofs for authentication protocols;
10697 * HOL: new auto_tac combines rewriting and classical reasoning (many
10698 examples on HOL/Auth);
10700 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10701 the rewriter and classical reasoner simultaneously;
10703 * function uresult no longer returns theorems in "standard" format;
10704 regain previous version by: val uresult = standard o uresult;
10708 New in Isabelle94-6
10709 -------------------
10711 * oracles -- these establish an interface between Isabelle and trusted
10712 external reasoners, which may deliver results as theorems;
10714 * proof objects (in particular record all uses of oracles);
10716 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10718 * "constdefs" section in theory files;
10720 * "primrec" section (HOL) no longer requires names;
10722 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10726 New in Isabelle94-5
10727 -------------------
10729 * reduced space requirements;
10731 * automatic HTML generation from theories;
10733 * theory files no longer require "..." (quotes) around most types;
10735 * new examples, including two proofs of the Church-Rosser theorem;
10737 * non-curried (1994) version of HOL is no longer distributed;
10741 New in Isabelle94-4
10742 -------------------
10744 * greatly reduced space requirements;
10746 * theory files (.thy) no longer require \...\ escapes at line breaks;
10748 * searchable theorem database (see the section "Retrieving theorems" on
10749 page 8 of the Reference Manual);
10751 * new examples, including Grabczewski's monumental case study of the
10754 * The previous version of HOL renamed to Old_HOL;
10756 * The new version of HOL (previously called CHOL) uses a curried syntax
10757 for functions. Application looks like f a b instead of f(a,b);
10759 * Mutually recursive inductive definitions finally work in HOL;
10761 * In ZF, pattern-matching on tuples is now available in all abstractions and
10762 translates to the operator "split";
10766 New in Isabelle94-3
10767 -------------------
10769 * new infix operator, addss, allowing the classical reasoner to
10770 perform simplification at each step of its search. Example:
10771 fast_tac (cs addss ss)
10773 * a new logic, CHOL, the same as HOL, but with a curried syntax
10774 for functions. Application looks like f a b instead of f(a,b). Also pairs
10775 look like (a,b) instead of <a,b>;
10777 * PLEASE NOTE: CHOL will eventually replace HOL!
10779 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10780 It translates to the operator "split". A new theory of integers is available;
10782 * In ZF, integer numerals now denote two's-complement binary integers.
10783 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10785 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10786 of the Axiom of Choice;
10790 New in Isabelle94-2
10791 -------------------
10793 * Significantly faster resolution;
10795 * the different sections in a .thy file can now be mixed and repeated
10798 * Database of theorems for FOL, HOL and ZF. New
10799 commands including qed, qed_goal and bind_thm store theorems in the database.
10801 * Simple database queries: return a named theorem (get_thm) or all theorems of
10802 a given theory (thms_of), or find out what theory a theorem was proved in
10805 * Bugs fixed in the inductive definition and datatype packages;
10807 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10808 and HOL_dup_cs obsolete;
10810 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10813 * Simpler definition of function space in ZF;
10815 * new results about cardinal and ordinal arithmetic in ZF;
10817 * 'subtype' facility in HOL for introducing new types as subsets of existing
10820 :mode=isabelle-news:wrap=hard:maxLineLen=72: