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  2979 reads

Browse archivesActive forum topics 
Recent comments
46 min 21 sec ago
3 hours 34 min ago
5 hours 33 min ago
6 hours 33 min ago
1 day 11 hours ago
1 day 14 hours ago
2 days 16 hours ago
2 days 23 hours ago
3 days 57 min ago
3 days 1 hour ago