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
This was posted in the Haskell Slack:
you could model the free "whatever" [i.e. Free Monad, Free Applicative, etc.] generated by a given functor as: -- Using poly kinds' kind signatures here for clarity of idea type Free :: ((Type -> Type) -> Constraint) -> (Type -> Type) -> Type -> Type type Free c f a = forall g. c g => (f ~> g) -> g a
you could model the free "whatever" [i.e. Free Monad, Free Applicative, etc.] generated by a given functor as:
-- Using poly kinds' kind signatures here for clarity of idea type Free :: ((Type -> Type) -> Constraint) -> (Type -> Type) -> Type -> Type type Free c f a = forall g. c g => (f ~> g) -> g a
The text was updated successfully, but these errors were encountered:
No branches or pull requests
This was posted in the Haskell Slack:
The text was updated successfully, but these errors were encountered: