## User login## Navigation |
## archives## 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 |
## Browse archives## Active forum topics |

## Recent comments

1 hour 35 min ago

2 hours 3 min ago

4 hours 23 min ago

1 day 2 hours ago

2 days 2 hours ago

2 days 8 hours ago

3 days 2 hours ago

3 days 10 hours ago

3 days 19 hours ago

4 days 14 hours ago