Thu, 01 Dec 2005 22:03:01 +0100 wenzelm unfold_tac: static evaluation of simpset;
Thu, 01 Dec 2005 18:45:24 +0100 wenzelm superceded by timestart|stop.bash;
Thu, 01 Dec 2005 18:44:47 +0100 wenzelm cpu time = user + system;
Thu, 01 Dec 2005 18:41:46 +0100 wenzelm replaced lib/scripts/showtime by more advanced lib/scripts/timestart|stop.bash;
Thu, 01 Dec 2005 18:41:44 +0100 berghofe assoc_consts and assoc_types now check number of arguments in template.
Thu, 01 Dec 2005 18:39:08 +0100 berghofe Added new component "sorts" to record datatype_info.
Thu, 01 Dec 2005 18:37:39 +0100 wenzelm timestop - report timing based on environment (cf. timestart.bash);
Thu, 01 Dec 2005 18:37:22 +0100 wenzelm timestart - setup bash environment for timing;
Thu, 01 Dec 2005 17:07:50 +0100 berghofe Improved norm_proof to handle proofs containing term (type) variables
Thu, 01 Dec 2005 15:45:54 +0100 paulson restoring the old status of subset_refl
Thu, 01 Dec 2005 08:28:02 +0100 haftmann oriented pairs theory * 'a to 'a * theory
Thu, 01 Dec 2005 06:28:41 +0100 urbanc initial cleanup to use the new induction method
Thu, 01 Dec 2005 05:20:13 +0100 urbanc cleaned up further the proofs (diamond still needs work);
Thu, 01 Dec 2005 04:46:17 +0100 urbanc changed "fresh:" to "avoiding:" and cleaned up the weakening example
Wed, 30 Nov 2005 22:52:50 +0100 wenzelm match_bind(_i): return terms;
Wed, 30 Nov 2005 22:52:49 +0100 wenzelm method 'fact': SIMPLE_METHOD, i.e. insert facts;
Wed, 30 Nov 2005 22:52:46 +0100 wenzelm simulaneous 'def';
Wed, 30 Nov 2005 21:51:23 +0100 urbanc added facilities to prove the pt and fs instances
Wed, 30 Nov 2005 19:08:51 +0100 urbanc started to change the transitivity/narrowing case:
Wed, 30 Nov 2005 18:37:12 +0100 urbanc changed everything until the interesting transitivity_narrowing
Wed, 30 Nov 2005 18:13:31 +0100 haftmann minor improvements
Wed, 30 Nov 2005 17:56:08 +0100 urbanc modified almost everything for the new nominal_induct
Wed, 30 Nov 2005 16:59:19 +0100 berghofe Changed order of predicate arguments and quantifiers in strong induction rule.
Wed, 30 Nov 2005 15:30:08 +0100 urbanc fixed the lemma where the new names generated by nominal_induct
Wed, 30 Nov 2005 15:27:30 +0100 urbanc added one clause for substitution in the lambda-case and
Wed, 30 Nov 2005 15:24:32 +0100 wenzelm added rename_params_rule: recover orginal fresh names in subgoals/cases;
Wed, 30 Nov 2005 15:03:15 +0100 urbanc changed induction principle and everything to conform with the
Wed, 30 Nov 2005 14:27:50 +0100 wenzelm fresh: frees instead of terms, rename corresponding params in rule;
Wed, 30 Nov 2005 14:27:09 +0100 urbanc adapted to the new nominal_induction
Wed, 30 Nov 2005 12:28:47 +0100 urbanc changed \<sim> of permutation equality to \<triangleq>
Wed, 30 Nov 2005 12:23:35 +0100 wenzelm fresh_unit_elim and fresh_prod_elim -- for nominal_induct;
Wed, 30 Nov 2005 01:01:15 +0100 huffman reimplement Case expression pattern matching to support lazy patterns
Wed, 30 Nov 2005 00:59:04 +0100 huffman add definitions as defs, not axioms
Wed, 30 Nov 2005 00:56:01 +0100 huffman changed section names
Wed, 30 Nov 2005 00:55:24 +0100 huffman add xsymbol syntax for u type constructor
Wed, 30 Nov 2005 00:53:30 +0100 huffman add constant unit_when
Wed, 30 Nov 2005 00:46:08 +0100 wenzelm proper treatment of tuple/tuple_fun -- nest to the left!
Tue, 29 Nov 2005 23:00:20 +0100 wenzelm moved nth_list to Pure/library.ML;
Tue, 29 Nov 2005 23:00:03 +0100 wenzelm added nth_list;
Tue, 29 Nov 2005 22:52:19 +0100 wenzelm added mk_split;
Tue, 29 Nov 2005 19:26:38 +0100 urbanc changed the order of the induction variable and the context
Tue, 29 Nov 2005 18:09:12 +0100 wenzelm reworked version with proper support for defs, fixes, fresh specification;
Tue, 29 Nov 2005 16:05:10 +0100 haftmann added haskell serializer
Tue, 29 Nov 2005 16:04:57 +0100 haftmann exported customized syntax interface
Tue, 29 Nov 2005 12:26:22 +0100 berghofe Corrected atom class constraints in strong induction rule.
Tue, 29 Nov 2005 01:37:01 +0100 urbanc made some of the theorem look-ups static (by using
Mon, 28 Nov 2005 13:43:56 +0100 haftmann added (curried) fold2
Mon, 28 Nov 2005 10:58:40 +0100 wenzelm added proof of measure_induct_rule;
Mon, 28 Nov 2005 07:17:07 +0100 mengj Added flags for setting and detecting whether a problem needs combinators.
Mon, 28 Nov 2005 07:16:16 +0100 mengj Only output types if !keep_types is true.
Mon, 28 Nov 2005 07:15:38 +0100 mengj Added two functions for CNF translation, used by other files.
Mon, 28 Nov 2005 07:15:13 +0100 mengj Added in four control flags for HOL and FOL translations.
Mon, 28 Nov 2005 07:14:12 +0100 mengj Slight modification to trace information.
Mon, 28 Nov 2005 07:13:43 +0100 mengj Added two methods "vampire" and "eprover" that handle both HOL and FOL proofs.
Mon, 28 Nov 2005 07:12:01 +0100 mengj Only output arities and class relations if !ResClause.keep_types is true.
Mon, 28 Nov 2005 05:03:00 +0100 urbanc some small tuning
Mon, 28 Nov 2005 00:25:43 +0100 urbanc ISAR-fied two proofs about equality for abstraction functions.
Sun, 27 Nov 2005 20:06:24 +0100 wenzelm * Provers/induct: obtain pattern;
Sun, 27 Nov 2005 06:01:11 +0100 urbanc added an authors section (please let me know if somebody is left out or unhappy)
Sun, 27 Nov 2005 05:09:43 +0100 urbanc some minor tunings
(0) -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip