Skip to content
This repository has been archived by the owner on Aug 23, 2018. It is now read-only.

Recursive anonymous functions in List fold consume all CPU #188

Closed
jwbrew opened this issue Feb 24, 2018 · 2 comments
Closed

Recursive anonymous functions in List fold consume all CPU #188

jwbrew opened this issue Feb 24, 2018 · 2 comments

Comments

@jwbrew
Copy link

jwbrew commented Feb 24, 2018

List.foldl (\a b -> b a) () [] does not generate a compiler error and instead spawns multiple processes and consumes all the CPU.

I assume It has something to do with the fact that the type definition for the anonymous function is recursive, a -> b -> (a -> (a -> (a -> ....

@process-bot
Copy link

Thanks for the issue! Make sure it satisfies this checklist. My human colleagues will appreciate it!

Here is what to expect next, and if anyone wants to comment, keep these things in mind.

@zwilias
Copy link
Member

zwilias commented Feb 24, 2018

Thanks for the report, @jwbrew. Looks like this will be fixed when 0.19 is released :)

@zwilias zwilias closed this as completed Feb 24, 2018
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants