We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
combineList
sequence
Have a question about this project? # for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “#”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? # to your account
This chapter describes how to create combineList, then compares it to the more general sequence:
combineList :: forall f a. Applicative f => List (f a) -> f (List a) sequence :: forall a m. Applicative m => t (m a) -> m ( t a)
The connection would be more obvious though if the same type variables were used:
combineList :: forall a m. Applicative m => List (m a) -> m (List a) sequence :: forall a m. Applicative m => t (m a) -> m ( t a)
It's tempting to just replace f with m in combineList but then there's a disconnect with an earlier connection to Apply which uses f.
f
m
Apply
class Apply f <= Applicative f where pure :: forall a. a -> f a
So this seems like a bigger task of settling on a naming convention to use for type variables and then updating the libraries.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
This chapter describes how to create
combineList
, then compares it to the more generalsequence
:The connection would be more obvious though if the same type variables were used:
It's tempting to just replace
f
withm
incombineList
but then there's a disconnect with an earlier connection toApply
which usesf
.So this seems like a bigger task of settling on a naming convention to use for type variables and then updating the libraries.
The text was updated successfully, but these errors were encountered: