[Haskell-beginners] "type" declarations: utterly transparent synonyms?

Fri Jun 3 16:54:17 UTC 2016

it seems so.. different synonyms with similar "content" are substituted /
matched without errors:

data D = S String | I Int deriving (Eq,Ord)
type A = D
type B = D

compiler "won't mind" if
Set A
is replaced with
Set B

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/beginners/attachments/20160603/ff3f9e86/attachment.html>