On 1/21/06, Philippa Cowderoy <[EMAIL PROTECTED]> wrote:
> 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 <[EMAIL PROTECTED]>
"Computer science is no more about computers than astronomy is about
telescopes."
-- Edsger Dijkstra
_______________________________________________
Haskell-prime mailing list
[EMAIL PROTECTED]
http://haskell.org/mailman/listinfo/haskell-prime
