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

Question: what are compexity of map, ap and retract? #7

Closed
safareli opened this issue Nov 26, 2016 · 5 comments
Closed

Question: what are compexity of map, ap and retract? #7

safareli opened this issue Nov 26, 2016 · 5 comments

Comments

@safareli
Copy link
Contributor

I'm interested in what's complexity of map, ap and retract. Is the implementation in spirit of https://www.eyrie.org/~zednenem/2013/05/27/freeapp which uses DList like optimisation?

@ethul
Copy link
Owner

ethul commented Nov 26, 2016 via email

@safareli
Copy link
Contributor Author

I'm implementing Free Applicative in safareli/free#31, as I don't understand this implementation quite well, I wanted to know which one is better so that, I could base my port on that.

@ethul
Copy link
Owner

ethul commented Nov 26, 2016 via email

@ethul
Copy link
Owner

ethul commented Nov 26, 2016 via email

ethul added a commit that referenced this issue Nov 30, 2016
The goal of this implementation is to improve performance
characteristics of the operations of the free applicative functor in
PureScript.

Reference #7

Reference #8
@ethul
Copy link
Owner

ethul commented Dec 2, 2016

Added benchmarks in #9. Closing

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants