User loginNavigation 
archivesInference 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 
Browse archivesActive forum topicsNew forum topics

Recent comments
9 hours 28 min ago
10 hours 47 min ago
11 hours 9 min ago
14 hours 40 min ago
20 hours 32 min ago
20 hours 38 min ago
22 hours 33 min ago
1 day 7 hours ago
2 days 4 hours ago
2 days 13 hours ago