## 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

10 hours 36 min ago

11 hours 49 min ago

12 hours 15 sec ago

12 hours 14 min ago

12 hours 42 min ago

22 hours 17 min ago

1 day 1 hour ago

1 day 23 hours ago

3 days 21 hours ago

3 days 21 hours ago