23 Jan
2006
23 Jan
'06
12:48 p.m.
On 1/21/06, Philippa Cowderoy
Would it be possibly to support a 'wildcard' type (probably written "_" to match the pattern-matching syntax) that matched any inferred type without requiring any actual degree of polymorphism the way a type variable would?
If one had a type annotation, say:
f :: a -> _ -> Constr a Int _
would this be unification-equivalent to:
f :: exists b c. a -> b -> Constr a Int c
--
Taral