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

Browse archivesActive forum topics 
Recent comments
3 hours 14 min ago
8 hours 17 min ago
9 hours 31 min ago
11 hours 35 min ago
20 hours 27 min ago
1 day 2 hours ago
1 day 3 hours ago
1 day 5 hours ago
1 day 5 hours ago
1 day 9 hours ago