Sun, 29 Jan 2012 10:34:02 +0100 merged
nipkow [Sun, 29 Jan 2012 10:34:02 +0100] rev 46354
merged
Sun, 29 Jan 2012 10:33:54 +0100 tuned
nipkow [Sun, 29 Jan 2012 10:33:54 +0100] rev 46353
tuned
Sat, 28 Jan 2012 12:05:26 +0100 an executable version of accessible part (only for finite types yet)
bulwahn [Sat, 28 Jan 2012 12:05:26 +0100] rev 46352
an executable version of accessible part (only for finite types yet)
Sat, 28 Jan 2012 10:35:52 +0100 adding yet another induction rule on natural numbers
bulwahn [Sat, 28 Jan 2012 10:35:52 +0100] rev 46351
adding yet another induction rule on natural numbers
Sat, 28 Jan 2012 10:22:46 +0100 moving declarations back to the section they seem to belong to (cf. afffe1f72143)
bulwahn [Sat, 28 Jan 2012 10:22:46 +0100] rev 46350
moving declarations back to the section they seem to belong to (cf. afffe1f72143)
Sat, 28 Jan 2012 06:13:03 +0100 reverting 46c2c96f5d92 as it only provides mostly non-terminating executions for generated code
bulwahn [Sat, 28 Jan 2012 06:13:03 +0100] rev 46349
reverting 46c2c96f5d92 as it only provides mostly non-terminating executions for generated code
Fri, 27 Jan 2012 19:08:48 +0100 adding some more examples for quickcheck; replaced FIXME comments
bulwahn [Fri, 27 Jan 2012 19:08:48 +0100] rev 46348
adding some more examples for quickcheck; replaced FIXME comments
Fri, 27 Jan 2012 17:22:05 +0100 new code equation for ntrancl that allows computation of the transitive closure of sets on infinite types as well
bulwahn [Fri, 27 Jan 2012 17:22:05 +0100] rev 46347
new code equation for ntrancl that allows computation of the transitive closure of sets on infinite types as well
Fri, 27 Jan 2012 17:02:08 +0100 removed duplicate definitions that made locale inconsistent
nipkow [Fri, 27 Jan 2012 17:02:08 +0100] rev 46346
removed duplicate definitions that made locale inconsistent
Fri, 27 Jan 2012 14:30:44 +0100 added parity analysis
nipkow [Fri, 27 Jan 2012 14:30:44 +0100] rev 46345
added parity analysis
Fri, 27 Jan 2012 10:31:31 +0100 corrected expectation; added an example for quickcheck
bulwahn [Fri, 27 Jan 2012 10:31:31 +0100] rev 46344
corrected expectation; added an example for quickcheck
Fri, 27 Jan 2012 10:31:30 +0100 adding some basic handling that unfolds a conjecture in a locale before testing it with quickcheck
bulwahn [Fri, 27 Jan 2012 10:31:30 +0100] rev 46343
adding some basic handling that unfolds a conjecture in a locale before testing it with quickcheck
Fri, 27 Jan 2012 10:19:55 +0100 made SML/NJ happy
blanchet [Fri, 27 Jan 2012 10:19:55 +0100] rev 46342
made SML/NJ happy
Thu, 26 Jan 2012 20:49:54 +0100 even more lr tags for SPASS -- anything that is considered an "equational rule spec" is relevant
blanchet [Thu, 26 Jan 2012 20:49:54 +0100] rev 46341
even more lr tags for SPASS -- anything that is considered an "equational rule spec" is relevant
Thu, 26 Jan 2012 20:49:54 +0100 separate orthogonal components
blanchet [Thu, 26 Jan 2012 20:49:54 +0100] rev 46340
separate orthogonal components
Thu, 26 Jan 2012 20:49:54 +0100 generate left-to-right rewrite tag for combinator helpers for SPASS 3.8
blanchet [Thu, 26 Jan 2012 20:49:54 +0100] rev 46339
generate left-to-right rewrite tag for combinator helpers for SPASS 3.8
Thu, 26 Jan 2012 20:49:54 +0100 better handling of individual type for DFG format (SPASS)
blanchet [Thu, 26 Jan 2012 20:49:54 +0100] rev 46338
better handling of individual type for DFG format (SPASS)
Thu, 26 Jan 2012 12:04:05 +0100 adding quickcheck example with THE
bulwahn [Thu, 26 Jan 2012 12:04:05 +0100] rev 46337
adding quickcheck example with THE
Thu, 26 Jan 2012 12:03:35 +0100 evaluation of THE with a non-singleton set raises a Match exception during the evaluation to yield a potential counterexample in quickcheck.
bulwahn [Thu, 26 Jan 2012 12:03:35 +0100] rev 46336
evaluation of THE with a non-singleton set raises a Match exception during the evaluation to yield a potential counterexample in quickcheck.
Thu, 26 Jan 2012 10:59:47 +0100 using fully qualified module names in Haskell source, which seems to be required by GHC 7.0.4
bulwahn [Thu, 26 Jan 2012 10:59:47 +0100] rev 46335
using fully qualified module names in Haskell source, which seems to be required by GHC 7.0.4
Thu, 26 Jan 2012 09:52:47 +0100 tuned
nipkow [Thu, 26 Jan 2012 09:52:47 +0100] rev 46334
tuned
Wed, 25 Jan 2012 16:07:48 +0100 adding very basic code generation to Wellfounded theory
bulwahn [Wed, 25 Jan 2012 16:07:48 +0100] rev 46333
adding very basic code generation to Wellfounded theory
Wed, 25 Jan 2012 16:07:41 +0100 removing dead code from Mutabelle; tuned
bulwahn [Wed, 25 Jan 2012 16:07:41 +0100] rev 46332
removing dead code from Mutabelle; tuned
Wed, 25 Jan 2012 15:19:04 +0100 generalizing check if size matters because it is different for random and exhaustive testing
bulwahn [Wed, 25 Jan 2012 15:19:04 +0100] rev 46331
generalizing check if size matters because it is different for random and exhaustive testing
Wed, 25 Jan 2012 09:50:34 +0100 merged
bulwahn [Wed, 25 Jan 2012 09:50:34 +0100] rev 46330
merged
Wed, 25 Jan 2012 09:32:23 +0100 adding code equation for Collect on finite types
bulwahn [Wed, 25 Jan 2012 09:32:23 +0100] rev 46329
adding code equation for Collect on finite types
Tue, 24 Jan 2012 16:00:51 +0100 Use lookup_size rather than Datatype.get_info in is_poly to avoid
berghofe [Tue, 24 Jan 2012 16:00:51 +0100] rev 46328
Use lookup_size rather than Datatype.get_info in is_poly to avoid incorrect results for datatypes on which no size function is defined
Tue, 24 Jan 2012 09:13:24 +0100 adding some rules to quickcheck's preprocessing
bulwahn [Tue, 24 Jan 2012 09:13:24 +0100] rev 46327
adding some rules to quickcheck's preprocessing
Tue, 24 Jan 2012 09:12:29 +0100 some more constants on mutabelle's blacklist
bulwahn [Tue, 24 Jan 2012 09:12:29 +0100] rev 46326
some more constants on mutabelle's blacklist
Mon, 23 Jan 2012 17:40:32 +0100 implemented "tptp_refute" tool
blanchet [Mon, 23 Jan 2012 17:40:32 +0100] rev 46325
implemented "tptp_refute" tool
(0) -30000 -10000 -3000 -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 tip