User loginNavigation |
Unifying map and mapM through subtyping?In a Haskell-like language, could we unify It seems that such conversions aren't as problematic as a general subtyping system, since proving confluence isn't a problem. We'd have to do something to prevent the typechecker from looping indefinitely trying to unify Are there other difficulties that this approach might cause? What sort of trickery might be needed to convince an optimizer over a typed intermediate language that the Identity introduction and elimination functions should have no operational effect? (Furthermore, is it true that they should have no effect, or is there a useful distinction between By Douglas McClean at 2010-02-26 02:58 | LtU Forum | previous forum topic | next forum topic | other blogs | 4251 reads
|
Browse archivesActive forum topics |
Recent comments
3 hours 13 min ago
8 hours 3 min ago
15 hours 27 min ago
1 day 2 hours ago
1 day 8 hours ago
1 day 8 hours ago
1 day 9 hours ago
1 day 9 hours ago
1 day 10 hours ago
1 day 10 hours ago