We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Support type synonyms, so we can write:
type Foo = Bar data Spam = Spam Foo
Possible implementation: expand type synonyms in Template Haskell frontend.
The text was updated successfully, but these errors were encountered:
Yes. that would be convenient for writing (documenting) constraint programs.
Implementation should be easy (and needs no expansion)?
Sorry, something went wrong.
you do type inference anyway
But type inference fails with type synonyms.
data Bool = False | True type Foo = Bool data Maybe = Just Foo | Nothing main x = case x of Just b -> b Nothing -> False
gives
No unifier found for 'Foo' and 'Bool'
Anyway, I implemented synonym expansion in TH frontend (cf. 60c8dba). It's supposed to work with both non-parametrized synonyms
type Foo = ....
and parametrized synonyms
type Foo x = ... x ....
No branches or pull requests
Support type synonyms, so we can write:
Possible implementation: expand type synonyms in Template Haskell frontend.
The text was updated successfully, but these errors were encountered: