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

Browse archivesActive forum topics 
Recent comments
4 hours 32 min ago
4 hours 45 min ago
5 hours 35 min ago
6 hours 9 min ago
7 hours 20 min ago
8 hours 29 min ago
13 hours 55 sec ago
15 hours 11 min ago
1 day 4 hours ago
1 day 8 hours ago