User loginNavigation |
Optimization - Symmetric ReductionsI notice in stack based languages certain symmetric programs reduce to no-ops: f1 = [swap swap] = [] f2 = [dup pop] = [] f3 = [cons uncons] = [] f4 = [dup swap cons uncons swap pop] = [dup swap swap pop] = [dup pop] = [] So how much of this is blindingly obvious to the research community? It seems that this must be much harder to detect in non stack based languages. By cdiggins at 2006-05-11 02:09 | LtU Forum | previous forum topic | next forum topic | other blogs | 4470 reads
|
Browse archivesActive forum topics |
Recent comments
8 weeks 3 days ago
8 weeks 5 days ago
8 weeks 6 days ago
15 weeks 6 days ago
21 weeks 4 days ago
21 weeks 5 days ago
22 weeks 4 days ago
25 weeks 2 days ago
26 weeks 5 days ago
26 weeks 6 days ago