We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Earlier today, I noticed a bug when I inputted the following forms in the REPL:
(import (scheme base)) (equal? '#1=(#1# . #1#) '#2=(#2# . #2#))
Instead of this halting as expected and required by R7RS, it instead goes into an infinite loop.
The text was updated successfully, but these errors were encountered:
This isn't related to equal?, it's the compiler not supporting raw cyclic literals in the source:
equal?
This hangs as well:
((lambda (a b) #t) '#1=(#1# . #1#) '#2=(#2# . #2#))
and supporting that is a very low priority. This, however, currently gives me a segfault:
(let ((a (cons 1 2)) (b (cons 3 4))) (set-car! a a) (set-cdr! a a) (set-car! b b) (set-cdr! b b) (equal? a b))
will take a look.
Sorry, something went wrong.
We were blowing the stack, reduced the bound in 045bb18.
No branches or pull requests
Earlier today, I noticed a bug when I inputted the following forms in the REPL:
Instead of this halting as expected and required by R7RS, it instead goes into an infinite loop.
The text was updated successfully, but these errors were encountered: