Tue, 05 Nov 2013 13:23:27 +0100 fixed subtle name shadowing bug
blanchet [Tue, 05 Nov 2013 13:23:27 +0100] rev 54268
fixed subtle name shadowing bug
Tue, 05 Nov 2013 12:40:58 +0100 use right permutation in 'map2'
blanchet [Tue, 05 Nov 2013 12:40:58 +0100] rev 54267
use right permutation in 'map2'
Tue, 05 Nov 2013 11:55:45 +0100 stronger normalization, to increase n2m cache effectiveness
blanchet [Tue, 05 Nov 2013 11:55:45 +0100] rev 54266
stronger normalization, to increase n2m cache effectiveness
Tue, 05 Nov 2013 11:17:42 +0100 make local theory operations non-pervasive (makes more intuitive sense)
blanchet [Tue, 05 Nov 2013 11:17:42 +0100] rev 54265
make local theory operations non-pervasive (makes more intuitive sense)
Tue, 05 Nov 2013 09:45:03 +0100 NEWS
hoelzl [Tue, 05 Nov 2013 09:45:03 +0100] rev 54264
NEWS
Tue, 05 Nov 2013 09:45:02 +0100 move Lubs from HOL to HOL-Library (replaced by conditionally complete lattices)
hoelzl [Tue, 05 Nov 2013 09:45:02 +0100] rev 54263
move Lubs from HOL to HOL-Library (replaced by conditionally complete lattices)
Tue, 05 Nov 2013 09:45:00 +0100 generalize bdd_above/below_uminus to ordered_ab_group_add
hoelzl [Tue, 05 Nov 2013 09:45:00 +0100] rev 54262
generalize bdd_above/below_uminus to ordered_ab_group_add
Tue, 05 Nov 2013 09:45:00 +0100 restrict Limsup and Liminf to complete lattices
hoelzl [Tue, 05 Nov 2013 09:45:00 +0100] rev 54261
restrict Limsup and Liminf to complete lattices
Tue, 05 Nov 2013 09:44:59 +0100 use INF and SUP on conditionally complete lattices in multivariate analysis
hoelzl [Tue, 05 Nov 2013 09:44:59 +0100] rev 54260
use INF and SUP on conditionally complete lattices in multivariate analysis
Tue, 05 Nov 2013 09:44:59 +0100 add SUP and INF for conditionally complete lattices
hoelzl [Tue, 05 Nov 2013 09:44:59 +0100] rev 54259
add SUP and INF for conditionally complete lattices
Tue, 05 Nov 2013 09:44:58 +0100 use bdd_above and bdd_below for conditionally complete lattices
hoelzl [Tue, 05 Nov 2013 09:44:58 +0100] rev 54258
use bdd_above and bdd_below for conditionally complete lattices
Tue, 05 Nov 2013 09:44:57 +0100 generalize SUP and INF to the syntactic type classes Sup and Inf
hoelzl [Tue, 05 Nov 2013 09:44:57 +0100] rev 54257
generalize SUP and INF to the syntactic type classes Sup and Inf
Tue, 05 Nov 2013 05:48:08 +0100 added some N2M caching
blanchet [Tue, 05 Nov 2013 05:48:08 +0100] rev 54256
added some N2M caching
Tue, 05 Nov 2013 05:48:08 +0100 also generalize fixed types
blanchet [Tue, 05 Nov 2013 05:48:08 +0100] rev 54255
also generalize fixed types
Tue, 05 Nov 2013 05:48:08 +0100 generalize types when synthetizing n2m (co)recursors, to facilitate reuse
blanchet [Tue, 05 Nov 2013 05:48:08 +0100] rev 54254
generalize types when synthetizing n2m (co)recursors, to facilitate reuse
Tue, 05 Nov 2013 05:48:08 +0100 nicer error message in case of duplicates
blanchet [Tue, 05 Nov 2013 05:48:08 +0100] rev 54253
nicer error message in case of duplicates
Tue, 05 Nov 2013 15:30:53 +1100 use int example like in the rest of IMP (instead of nat)
kleing [Tue, 05 Nov 2013 15:30:53 +1100] rev 54252
use int example like in the rest of IMP (instead of nat)
Mon, 04 Nov 2013 20:10:10 +0100 dropped dead code
haftmann [Mon, 04 Nov 2013 20:10:10 +0100] rev 54251
dropped dead code
Mon, 04 Nov 2013 20:10:09 +0100 fact generalization and name consolidation
haftmann [Mon, 04 Nov 2013 20:10:09 +0100] rev 54250
fact generalization and name consolidation
Mon, 04 Nov 2013 20:10:06 +0100 streamlined setup of linear arithmetic
haftmann [Mon, 04 Nov 2013 20:10:06 +0100] rev 54249
streamlined setup of linear arithmetic
Mon, 04 Nov 2013 18:08:47 +0100 make 'try0' return faster when invoked as part of 'try'
blanchet [Mon, 04 Nov 2013 18:08:47 +0100] rev 54248
make 'try0' return faster when invoked as part of 'try'
Mon, 04 Nov 2013 17:25:36 +0100 careful with lists of different lengths
blanchet [Mon, 04 Nov 2013 17:25:36 +0100] rev 54247
careful with lists of different lengths
Mon, 04 Nov 2013 16:53:43 +0100 split 'primrec_new' and 'primcorec' code (to ease bootstrapping, e.g. dependency on datatype 'String' in 'primcorec')
blanchet [Mon, 04 Nov 2013 16:53:43 +0100] rev 54246
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 better error handling
blanchet [Mon, 04 Nov 2013 15:44:43 +0100] rev 54245
better error handling
Mon, 04 Nov 2013 14:54:29 +0100 more robust treatment of dead variables in n2m
traytel [Mon, 04 Nov 2013 14:54:29 +0100] rev 54244
more robust treatment of dead variables in n2m
Mon, 04 Nov 2013 14:46:38 +0100 more robust n2m w.r.t. 'let's
blanchet [Mon, 04 Nov 2013 14:46:38 +0100] rev 54243
more robust n2m w.r.t. 'let's
Mon, 04 Nov 2013 12:40:28 +0100 tuning
blanchet [Mon, 04 Nov 2013 12:40:28 +0100] rev 54242
tuning
Mon, 04 Nov 2013 11:59:08 +0100 strengthened tactic
blanchet [Mon, 04 Nov 2013 11:59:08 +0100] rev 54241
strengthened tactic
Mon, 04 Nov 2013 11:03:13 +0100 made n2m code more robust w.r.t. advanced constructs (e.g. lambdas)
blanchet [Mon, 04 Nov 2013 11:03:13 +0100] rev 54240
made n2m code more robust w.r.t. advanced constructs (e.g. lambdas)
Mon, 04 Nov 2013 10:52:41 +0100 handle constructor syntax in n2m primcorec
blanchet [Mon, 04 Nov 2013 10:52:41 +0100] rev 54239
handle constructor syntax in n2m primcorec
Mon, 04 Nov 2013 10:52:41 +0100 typo
blanchet [Mon, 04 Nov 2013 10:52:41 +0100] rev 54238
typo
Mon, 04 Nov 2013 10:52:41 +0100 made sugared 'coinduct' theorem construction n2m-proof
blanchet [Mon, 04 Nov 2013 10:52:41 +0100] rev 54237
made sugared 'coinduct' theorem construction n2m-proof
Mon, 04 Nov 2013 10:52:41 +0100 moved code around
blanchet [Mon, 04 Nov 2013 10:52:41 +0100] rev 54236
moved code around
Mon, 04 Nov 2013 10:52:41 +0100 tuning
blanchet [Mon, 04 Nov 2013 10:52:41 +0100] rev 54235
tuning
Mon, 04 Nov 2013 10:52:41 +0100 make code more robust w.r.t. applied/unapplied map (primrec vs. primcorec)
blanchet [Mon, 04 Nov 2013 10:52:41 +0100] rev 54234
make code more robust w.r.t. applied/unapplied map (primrec vs. primcorec)
Mon, 04 Nov 2013 10:52:41 +0100 conceal definition
blanchet [Mon, 04 Nov 2013 10:52:41 +0100] rev 54233
conceal definition
Sat, 02 Nov 2013 17:50:28 +0100 more exercises
nipkow [Sat, 02 Nov 2013 17:50:28 +0100] rev 54232
more exercises
Sat, 02 Nov 2013 17:19:34 +0100 more exercises
nipkow [Sat, 02 Nov 2013 17:19:34 +0100] rev 54231
more exercises
Fri, 01 Nov 2013 18:51:14 +0100 more simplification rules on unary and binary minus
haftmann [Fri, 01 Nov 2013 18:51:14 +0100] rev 54230
more simplification rules on unary and binary minus
Thu, 31 Oct 2013 16:54:22 +0100 generate stable names for axioms
blanchet [Thu, 31 Oct 2013 16:54:22 +0100] rev 54229
generate stable names for axioms
Thu, 31 Oct 2013 11:44:20 +0100 purely algebraic foundation for even/odd
haftmann [Thu, 31 Oct 2013 11:44:20 +0100] rev 54228
purely algebraic foundation for even/odd
Thu, 31 Oct 2013 11:44:20 +0100 moving generic lemmas out of theory parity, disregarding some unused auxiliary lemmas;
haftmann [Thu, 31 Oct 2013 11:44:20 +0100] rev 54227
moving generic lemmas out of theory parity, disregarding some unused auxiliary lemmas; tuned presburger
Thu, 31 Oct 2013 11:44:20 +0100 explicit type class for modelling even/odd parity
haftmann [Thu, 31 Oct 2013 11:44:20 +0100] rev 54226
explicit type class for modelling even/odd parity
Thu, 31 Oct 2013 11:44:20 +0100 generalized of_bool conversion
haftmann [Thu, 31 Oct 2013 11:44:20 +0100] rev 54225
generalized of_bool conversion
Thu, 31 Oct 2013 11:44:20 +0100 separated bit operations on type bit from generic syntactic bit operations
haftmann [Thu, 31 Oct 2013 11:44:20 +0100] rev 54224
separated bit operations on type bit from generic syntactic bit operations
Thu, 31 Oct 2013 11:44:20 +0100 restructed
haftmann [Thu, 31 Oct 2013 11:44:20 +0100] rev 54223
restructed
Thu, 31 Oct 2013 11:44:20 +0100 generalised lemma
haftmann [Thu, 31 Oct 2013 11:44:20 +0100] rev 54222
generalised lemma
Thu, 31 Oct 2013 11:44:20 +0100 more lemmas on division
haftmann [Thu, 31 Oct 2013 11:44:20 +0100] rev 54221
more lemmas on division
Thu, 31 Oct 2013 11:44:20 +0100 more convenient place for a theory in solitariness
haftmann [Thu, 31 Oct 2013 11:44:20 +0100] rev 54220
more convenient place for a theory in solitariness
Thu, 31 Oct 2013 11:44:20 +0100 consolidated clone theory
haftmann [Thu, 31 Oct 2013 11:44:20 +0100] rev 54219
consolidated clone theory
Thu, 31 Oct 2013 11:48:45 +0100 more exercises
nipkow [Thu, 31 Oct 2013 11:48:45 +0100] rev 54218
more exercises
Wed, 30 Oct 2013 17:20:59 +0100 tuned text
nipkow [Wed, 30 Oct 2013 17:20:59 +0100] rev 54217
tuned text
Tue, 29 Oct 2013 13:48:18 +0100 inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe [Tue, 29 Oct 2013 13:48:18 +0100] rev 54216
inst_lift now fully instantiates context to avoid problems with loose bound variables
Tue, 29 Oct 2013 12:13:00 +0100 include corecursive functions' arguments in callssss
panny [Tue, 29 Oct 2013 12:13:00 +0100] rev 54215
include corecursive functions' arguments in callssss
Tue, 29 Oct 2013 08:06:08 +0100 more exercises
nipkow [Tue, 29 Oct 2013 08:06:08 +0100] rev 54214
more exercises
Mon, 28 Oct 2013 10:29:56 +0100 merged
nipkow [Mon, 28 Oct 2013 10:29:56 +0100] rev 54213
merged
Mon, 28 Oct 2013 10:29:43 +0100 more exercises
nipkow [Mon, 28 Oct 2013 10:29:43 +0100] rev 54212
more exercises
Sun, 27 Oct 2013 19:02:26 +0100 commented out vaporware
blanchet [Sun, 27 Oct 2013 19:02:26 +0100] rev 54211
commented out vaporware
Sat, 26 Oct 2013 23:06:40 +0200 more exercises
nipkow [Sat, 26 Oct 2013 23:06:40 +0200] rev 54210
more exercises
Sat, 26 Oct 2013 13:01:41 +0200 tuning
blanchet [Sat, 26 Oct 2013 13:01:41 +0200] rev 54209
tuning
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 tip