Ticket #25 (new task)
Investigate support for polymorphic recursion
|Reported by:||benl||Owned by:|
|Component:||Source Type Inferencer||Version:|
Manage this the same was as in Haskell, by requiring an explicit type signature. Do we need the whole signature, or can we get away with a partial one that only has quantifiers for the components that are used in the recursion?