Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

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

Jump to bottom

Generalise parallely from list to recursion-schemes #312

Open
turion opened this issue May 13, 2024 · 0 comments
Open

Generalise parallely from list to recursion-schemes #312

turion opened this issue May 13, 2024 · 0 comments
Labels
automaton

Comments

@turion
Copy link
Owner

turion commented May 13, 2024

I believe that parallely :: (Applicative m) => Automaton m a b -> Automaton m [a] [b] can be generalised to something like:

parallely :: (Applicative m, Recursive t, Corecursive t) => Automaton m a b -> Automaton m (t a) (t b)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
automaton
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@turion