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

Browse archivesActive forum topics 
Recent comments
1 hour 51 min ago
3 hours 29 min ago
4 hours 17 min ago
4 hours 31 min ago
5 hours 29 min ago
5 hours 32 min ago
6 hours 36 min ago
10 hours 32 min ago
19 hours 59 min ago
23 hours 35 min ago