Mon, 04 Nov 2013 17:25:36 +0100 blanchet careful with lists of different lengths
Mon, 04 Nov 2013 16:53:43 +0100 blanchet split 'primrec_new' and 'primcorec' code (to ease bootstrapping, e.g. dependency on datatype 'String' in 'primcorec')
Mon, 04 Nov 2013 15:44:43 +0100 blanchet better error handling
Mon, 04 Nov 2013 14:54:29 +0100 traytel more robust treatment of dead variables in n2m
Mon, 04 Nov 2013 14:46:38 +0100 blanchet more robust n2m w.r.t. 'let's
Mon, 04 Nov 2013 12:40:28 +0100 blanchet tuning
Mon, 04 Nov 2013 11:59:08 +0100 blanchet strengthened tactic
Mon, 04 Nov 2013 11:03:13 +0100 blanchet made n2m code more robust w.r.t. advanced constructs (e.g. lambdas)
Mon, 04 Nov 2013 10:52:41 +0100 blanchet handle constructor syntax in n2m primcorec
Mon, 04 Nov 2013 10:52:41 +0100 blanchet typo
Mon, 04 Nov 2013 10:52:41 +0100 blanchet made sugared 'coinduct' theorem construction n2m-proof
Mon, 04 Nov 2013 10:52:41 +0100 blanchet moved code around
Mon, 04 Nov 2013 10:52:41 +0100 blanchet tuning
Mon, 04 Nov 2013 10:52:41 +0100 blanchet make code more robust w.r.t. applied/unapplied map (primrec vs. primcorec)
Mon, 04 Nov 2013 10:52:41 +0100 blanchet conceal definition
Sat, 02 Nov 2013 17:50:28 +0100 nipkow more exercises
Sat, 02 Nov 2013 17:19:34 +0100 nipkow more exercises
Fri, 01 Nov 2013 18:51:14 +0100 haftmann more simplification rules on unary and binary minus
Thu, 31 Oct 2013 16:54:22 +0100 blanchet generate stable names for axioms
Thu, 31 Oct 2013 11:44:20 +0100 haftmann purely algebraic foundation for even/odd
Thu, 31 Oct 2013 11:44:20 +0100 haftmann moving generic lemmas out of theory parity, disregarding some unused auxiliary lemmas;
Thu, 31 Oct 2013 11:44:20 +0100 haftmann explicit type class for modelling even/odd parity
Thu, 31 Oct 2013 11:44:20 +0100 haftmann generalized of_bool conversion
Thu, 31 Oct 2013 11:44:20 +0100 haftmann separated bit operations on type bit from generic syntactic bit operations
Thu, 31 Oct 2013 11:44:20 +0100 haftmann restructed
Thu, 31 Oct 2013 11:44:20 +0100 haftmann generalised lemma
Thu, 31 Oct 2013 11:44:20 +0100 haftmann more lemmas on division
Thu, 31 Oct 2013 11:44:20 +0100 haftmann more convenient place for a theory in solitariness
Thu, 31 Oct 2013 11:44:20 +0100 haftmann consolidated clone theory
Thu, 31 Oct 2013 11:48:45 +0100 nipkow more exercises
Wed, 30 Oct 2013 17:20:59 +0100 nipkow tuned text
Tue, 29 Oct 2013 13:48:18 +0100 berghofe inst_lift now fully instantiates context to avoid problems with loose bound variables
Tue, 29 Oct 2013 12:13:00 +0100 panny include corecursive functions' arguments in callssss
Tue, 29 Oct 2013 08:06:08 +0100 nipkow more exercises
Mon, 28 Oct 2013 10:29:56 +0100 nipkow merged
Mon, 28 Oct 2013 10:29:43 +0100 nipkow more exercises
Sun, 27 Oct 2013 19:02:26 +0100 blanchet commented out vaporware
Sat, 26 Oct 2013 23:06:40 +0200 nipkow more exercises
Sat, 26 Oct 2013 13:01:41 +0200 blanchet tuning
Sat, 26 Oct 2013 13:00:55 +0200 blanchet tuning
Sat, 26 Oct 2013 12:57:17 +0200 blanchet tuned names (to make them independent from temporary naming convention used in characteristic theorems)
Sat, 26 Oct 2013 12:54:57 +0200 blanchet align 'primrec_new' on 'primcorec' (+ got rid of one more 'dummyT')
Sat, 26 Oct 2013 12:54:39 +0200 blanchet convenience: handle composition gracefully in map in 'primcorec', analogously to 'primrec_new'
Sat, 26 Oct 2013 12:54:21 +0200 blanchet tuned error message
Fri, 25 Oct 2013 16:20:54 +0200 nipkow more exercises
Thu, 24 Oct 2013 19:43:21 +0200 blanchet handle applied ctor arguments gracefully when computing 'callssss' (for recursion through functions)
Thu, 24 Oct 2013 18:50:59 +0200 blanchet tuning
Thu, 24 Oct 2013 18:37:54 +0200 blanchet more correct (!) types for recursive calls
Thu, 24 Oct 2013 15:56:03 +0200 blanchet watch out for 'case' constant canditates whose general type is 'a (e.g. 'undefined')
Thu, 24 Oct 2013 15:32:34 +0200 blanchet got rid of annoying duplicate rewrite rule warnings
Thu, 24 Oct 2013 12:43:33 +0200 blanchet use definitions for LEO-II as well -- this simplifies the code and matches some users' expectations
Thu, 24 Oct 2013 10:03:20 +0200 traytel refactored rtrancl_while; prove termination for finite rtrancl
Wed, 23 Oct 2013 21:12:20 +0200 nipkow more exercises
Wed, 23 Oct 2013 18:04:43 +0200 nipkow added exercises
Wed, 23 Oct 2013 14:53:36 +0200 blanchet added 'primcorec' examples
Wed, 23 Oct 2013 09:58:30 +0200 nipkow tuned
Tue, 22 Oct 2013 16:07:09 +0200 traytel removed junk
Tue, 22 Oct 2013 14:22:06 +0200 traytel update doc according to c0186a0d8cb3
Tue, 22 Oct 2013 14:17:12 +0200 traytel define a trivial nonemptiness witness if none is provided
Mon, 21 Oct 2013 23:45:27 +0200 blanchet made lower-level function available
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 tip