User loginNavigation 
Inference of Polymorphic RecursionIn the following (Haskell) example, the type annotation on f :: a > (Int, a) f x = (g True, x) g True = 0 g False = fst (f 'a') + fst (f 0) main = do print (fst (f True))
I can understand why in general, but I wonder if we could just decide to generalize arbitrarily in the order that declarations appear so that in this case the type of Thanks By Matt M at 20170121 16:32  LtU Forum  previous forum topic  next forum topic  other blogs  3231 reads

Browse archivesActive forum topics 
Recent comments
2 days 13 hours ago
3 days 13 hours ago
3 days 15 hours ago
3 days 15 hours ago
4 days 21 hours ago
4 days 22 hours ago
5 days 16 hours ago
5 days 18 hours ago
5 days 18 hours ago
6 days 10 hours ago