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.

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

"Free" cheatsheet #458

Open
JordanMartinez opened this issue Mar 27, 2020 · 0 comments
Open

"Free" cheatsheet #458

JordanMartinez opened this issue Mar 27, 2020 · 0 comments
Labels
enhancement New feature or request ToResearch Something I want to look into more. It might appear in this repo later or not.

Comments

@JordanMartinez
Copy link
Owner

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
@JordanMartinez JordanMartinez added enhancement New feature or request ToResearch Something I want to look into more. It might appear in this repo later or not. labels Mar 27, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request ToResearch Something I want to look into more. It might appear in this repo later or not.
Projects
None yet
Development

No branches or pull requests

1 participant