New issue

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

Jump to bottom

Hoogle can't find bisequence unless type constraints are specified #398

Open

Des333 opened this issue Jan 17, 2023 · 0 comments

Des333 commented Jan 17, 2023 •

edited

Loading

I searched for t (f a) (f b) -> f (t a b) and got:

No results found

If I add type constraints then everything works fine.
For (Bitraversable t, Applicative f) => t (f a) (f b) -> f (t a b) result is:

bisequenceA :: (Bitraversable t, Applicative f) => t (f a) (f b) -> f (t a b)
bisequence :: (Bitraversable t, Applicative f) => t (f a) (f b) -> f (t a b)

However such search request (without type constraints!) t a b -> (a -> f c) -> (b -> f d) -> f (t c d) gives expected result:

bifor :: (Bitraversable t, Applicative f) => t a b -> (a -> f c) -> (b -> f d) -> f (t c d)
biforM :: (Bitraversable t, Applicative f) => t a b -> (a -> f c) -> (b -> f d) -> f (t c d)

It seems that everything breaks here -- t (f a) (f b)

The text was updated successfully, but these errors were encountered:

# for free to join this conversation on GitHub. Already have an account? # to comment