User loginNavigation 
Structural recursion on setsHi, I am not sure I am entirely happy with the usual structural recursion on sets approaches. They all look like a bit of cheating, i.e. using lists under covers, broadly speaking. I mean SRI/SRU/powerset/etc tricks (http://citeseer.ist.psu.edu/722866.html). E.g. in the SRI method (collection insertion representation), we can do matching using the insertion operator that 'disassembles' a nonempty set thereby maing it amenable to something like foldr. On the other hand, the 'choose' operator is criticised (elsewhere) as 'nondeterministic'. I am aware of various laws and such that make SRI 'work', I just have a feeling that the insertion operator is a kind of deus ex machina as much as 'choose' is ! Please comment. Thanks. By vc at 20080229 18:10  LtU Forum  previous forum topic  next forum topic  other blogs  3437 reads

Browse archivesActive forum topics 
Recent comments
5 hours 59 min ago
7 hours 56 min ago
15 hours 37 min ago
15 hours 40 min ago
16 hours 20 min ago
16 hours 39 min ago
1 day 58 min ago
1 day 3 hours ago
1 day 4 hours ago
1 day 5 hours ago