Tue, 05 Nov 2013 16:53:40 +0100 blanchet avoid subtle failure in the presence of top sort
Tue, 05 Nov 2013 16:47:10 +0100 blanchet tuning
Tue, 05 Nov 2013 16:47:10 +0100 blanchet get mutually recursive maps as well
Tue, 05 Nov 2013 15:10:59 +0100 hoelzl tuned proofs in Approximation
Tue, 05 Nov 2013 13:23:27 +0100 blanchet fixed subtle name shadowing bug
Tue, 05 Nov 2013 12:40:58 +0100 blanchet use right permutation in 'map2'
Tue, 05 Nov 2013 11:55:45 +0100 blanchet stronger normalization, to increase n2m cache effectiveness
Tue, 05 Nov 2013 11:17:42 +0100 blanchet make local theory operations non-pervasive (makes more intuitive sense)
Tue, 05 Nov 2013 09:45:03 +0100 hoelzl NEWS
Tue, 05 Nov 2013 09:45:02 +0100 hoelzl move Lubs from HOL to HOL-Library (replaced by conditionally complete lattices)
Tue, 05 Nov 2013 09:45:00 +0100 hoelzl generalize bdd_above/below_uminus to ordered_ab_group_add
Tue, 05 Nov 2013 09:45:00 +0100 hoelzl restrict Limsup and Liminf to complete lattices
Tue, 05 Nov 2013 09:44:59 +0100 hoelzl use INF and SUP on conditionally complete lattices in multivariate analysis
Tue, 05 Nov 2013 09:44:59 +0100 hoelzl add SUP and INF for conditionally complete lattices
Tue, 05 Nov 2013 09:44:58 +0100 hoelzl use bdd_above and bdd_below for conditionally complete lattices
Tue, 05 Nov 2013 09:44:57 +0100 hoelzl generalize SUP and INF to the syntactic type classes Sup and Inf
Tue, 05 Nov 2013 05:48:08 +0100 blanchet added some N2M caching
Tue, 05 Nov 2013 05:48:08 +0100 blanchet also generalize fixed types
Tue, 05 Nov 2013 05:48:08 +0100 blanchet generalize types when synthetizing n2m (co)recursors, to facilitate reuse
Tue, 05 Nov 2013 05:48:08 +0100 blanchet nicer error message in case of duplicates
Tue, 05 Nov 2013 15:30:53 +1100 kleing use int example like in the rest of IMP (instead of nat)
Mon, 04 Nov 2013 20:10:10 +0100 haftmann dropped dead code
Mon, 04 Nov 2013 20:10:09 +0100 haftmann fact generalization and name consolidation
Mon, 04 Nov 2013 20:10:06 +0100 haftmann streamlined setup of linear arithmetic
Mon, 04 Nov 2013 18:08:47 +0100 blanchet make 'try0' return faster when invoked as part of 'try'
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
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 tip