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

Recursive non-equality comparison is slow/infinite #198

Open
MostAwesomeDude opened this issue Oct 26, 2017 · 0 comments
Open

Recursive non-equality comparison is slow/infinite #198

MostAwesomeDude opened this issue Oct 26, 2017 · 0 comments

Comments

@MostAwesomeDude
Copy link
Contributor

I haven't been able to get a stack overflow for some reason, but:

def x := [1, x]; x <=> x
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant