Wed, 07 Feb 2007 17:30:53 +0100 Theorems for converting between wf and wfP are now declared
berghofe [Wed, 07 Feb 2007 17:30:53 +0100] rev 22264
Theorems for converting between wf and wfP are now declared as hints.
Wed, 07 Feb 2007 17:29:41 +0100 - Adapted to new inductive definition package
berghofe [Wed, 07 Feb 2007 17:29:41 +0100] rev 22263
- Adapted to new inductive definition package - Predicate version of wellfoundedness
Wed, 07 Feb 2007 17:28:09 +0100 Adapted to new inductive definition package.
berghofe [Wed, 07 Feb 2007 17:28:09 +0100] rev 22262
Adapted to new inductive definition package.
Wed, 07 Feb 2007 17:26:49 +0100 Adapted to changes in Transitive_Closure theory.
berghofe [Wed, 07 Feb 2007 17:26:49 +0100] rev 22261
Adapted to changes in Transitive_Closure theory.
Wed, 07 Feb 2007 17:26:04 +0100 Added Predicate theory.
berghofe [Wed, 07 Feb 2007 17:26:04 +0100] rev 22260
Added Predicate theory.
Wed, 07 Feb 2007 17:25:39 +0100 New theory for converting between predicates and sets.
berghofe [Wed, 07 Feb 2007 17:25:39 +0100] rev 22259
New theory for converting between predicates and sets.
Wed, 07 Feb 2007 13:05:28 +0100 changes in lexicographic_order termination tactic
bulwahn [Wed, 07 Feb 2007 13:05:28 +0100] rev 22258
changes in lexicographic_order termination tactic
Wed, 07 Feb 2007 12:08:48 +0100 "prove" function now instantiates relation variable in order
berghofe [Wed, 07 Feb 2007 12:08:48 +0100] rev 22257
"prove" function now instantiates relation variable in order to avoid problems with higher-order unification. This allows relations to be encoded as binary predicates.
Wed, 07 Feb 2007 12:05:54 +0100 Made untabify function tail recursive.
berghofe [Wed, 07 Feb 2007 12:05:54 +0100] rev 22256
Made untabify function tail recursive.
Tue, 06 Feb 2007 19:32:32 +0100 tuned matches_subterm;
wenzelm [Tue, 06 Feb 2007 19:32:32 +0100] rev 22255
tuned matches_subterm;
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip