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 2017-01-21 16:32 | LtU Forum | previous forum topic | next forum topic | other blogs | 5704 reads
|
Browse archives
Active forum topics |
Recent comments
5 days 1 hour ago
40 weeks 6 days ago
40 weeks 6 days ago
40 weeks 6 days ago
1 year 11 weeks ago
1 year 15 weeks ago
1 year 16 weeks ago
1 year 16 weeks ago
1 year 19 weeks ago
1 year 24 weeks ago