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

2 weeks 3 days ago

2 weeks 3 days ago

2 weeks 4 days ago

2 weeks 4 days ago

2 weeks 4 days ago

2 weeks 4 days ago

2 weeks 6 days ago

3 weeks 20 hours ago

3 weeks 5 days ago

3 weeks 6 days ago