The bug is a mismatch between the optimizer and validator, where the
optimizer can see that `string-append` is applied to a string and will
definitely succeed, while the validator can't infer that behavior. The
fact by itself isn't the problem, but it allows a further inference in
the optimizer tha
Hey all,
I noticed that the following program fails to run, but only after its been
compiled (on 6.7, 6.6 and earlier don't seem to have this issue):
https://gist.github.com/LeifAndersen/dfad9a8f55ef671e4f3aa41b321ef7bf
#lang racket/base ;; ill-formed.rkt
(define ill
(let ((base (string-append
It's fixed. Thanks.
Gustavo
--
You received this message because you are subscribed to the Google Groups
"Racket Developers" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to racket-dev+unsubscr...@googlegroups.com.
To post to this group, send email to r
On Sun, 15 Jan 2017 14:50:25 -0600,
Gustavo Massaccesi wrote:
> - 58333903
> I like it, specially because it's the result of many intermediate
> steps, like 7c1cb1a2. But it's difficult to explain (specially because
> it depends on the knowledge that equal? is much slower than eq?). So I
> think it
