berghofe [Wed, 07 Feb 2007 18:03:18 +0100] rev 22279
Adapted to changes in Accessible_Part and Wellfounded_Recursion theories.
berghofe [Wed, 07 Feb 2007 18:01:40 +0100] rev 22278
Added split_rule attribute.
berghofe [Wed, 07 Feb 2007 18:00:38 +0100] rev 22277
Fixed bug in mk_AbsP.
berghofe [Wed, 07 Feb 2007 17:59:40 +0100] rev 22276
Introduction and elimination rules for <= on predicates
are now declared properly.
berghofe [Wed, 07 Feb 2007 17:58:50 +0100] rev 22275
- Improved handling of monotonicity rules involving <=
- ind_cases: variables to be generalized can now be
specified using "for" keyword
berghofe [Wed, 07 Feb 2007 17:51:38 +0100] rev 22274
Adapted to changes in Finite_Set theory.
berghofe [Wed, 07 Feb 2007 17:46:03 +0100] rev 22273
Adapted to changes in Finite_Set theory.
berghofe [Wed, 07 Feb 2007 17:45:03 +0100] rev 22272
- Adapted to new inductive definition package
- More elegant proof of eta postponement theorem inspired
by Andreas Abel
berghofe [Wed, 07 Feb 2007 17:44:07 +0100] rev 22271
Adapted to new inductive definition package.
berghofe [Wed, 07 Feb 2007 17:41:11 +0100] rev 22270
Converted to predicate notation.
berghofe [Wed, 07 Feb 2007 17:39:49 +0100] rev 22269
Adapted to changes in List theory.
berghofe [Wed, 07 Feb 2007 17:37:59 +0100] rev 22268
- wfP has been moved to theory Wellfounded_Recursion
- Accessible part now works on predicates, hence accP is
no longer needed
berghofe [Wed, 07 Feb 2007 17:35:28 +0100] rev 22267
Adapted to changes in Transitive_Closure theory.
berghofe [Wed, 07 Feb 2007 17:34:43 +0100] rev 22266
Adapted to new inductive definition package.
berghofe [Wed, 07 Feb 2007 17:32:52 +0100] rev 22265
Adapted to changes in Finite_Set theory.
berghofe [Wed, 07 Feb 2007 17:30:53 +0100] rev 22264
Theorems for converting between wf and wfP are now declared
as hints.
berghofe [Wed, 07 Feb 2007 17:29:41 +0100] rev 22263
- Adapted to new inductive definition package
- Predicate version of wellfoundedness
berghofe [Wed, 07 Feb 2007 17:28:09 +0100] rev 22262
Adapted to new inductive definition package.
berghofe [Wed, 07 Feb 2007 17:26:49 +0100] rev 22261
Adapted to changes in Transitive_Closure theory.
berghofe [Wed, 07 Feb 2007 17:26:04 +0100] rev 22260
Added Predicate theory.
berghofe [Wed, 07 Feb 2007 17:25:39 +0100] rev 22259
New theory for converting between predicates and sets.
bulwahn [Wed, 07 Feb 2007 13:05:28 +0100] rev 22258
changes in lexicographic_order termination tactic
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.
berghofe [Wed, 07 Feb 2007 12:05:54 +0100] rev 22256
Made untabify function tail recursive.
wenzelm [Tue, 06 Feb 2007 19:32:32 +0100] rev 22255
tuned matches_subterm;
wenzelm [Tue, 06 Feb 2007 19:32:31 +0100] rev 22254
trace/debug: avoid eager string concatenation;
wenzelm [Tue, 06 Feb 2007 18:02:28 +0100] rev 22253
cc: removed option -lstdc++, which seems to be unnecessry, but causes problems on some platforms;
wenzelm [Tue, 06 Feb 2007 17:20:14 +0100] rev 22252
pervasive exception Option;
fixed use_file;
wenzelm [Tue, 06 Feb 2007 17:06:44 +0100] rev 22251
added has_kind/get_kind;
tuned;
urbanc [Tue, 06 Feb 2007 15:12:18 +0100] rev 22250
fixed two stupid bugs of SML to do with the value restriction and missing type
information in records
aspinall [Tue, 06 Feb 2007 12:54:55 +0100] rev 22249
askids/qualified_thms_of_thy: version which returns names in domain of get_thm
haftmann [Tue, 06 Feb 2007 11:40:53 +0100] rev 22248
added eta expansion to imperative monad bind