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 topics |
Recent comments
1 week 5 days ago
42 weeks 9 hours ago
42 weeks 13 hours ago
42 weeks 13 hours ago
1 year 12 weeks ago
1 year 16 weeks ago
1 year 17 weeks ago
1 year 17 weeks ago
1 year 20 weeks ago
1 year 25 weeks ago