Carl Mäsak

> (Hm, another issue with the example code above: I want it to abort on EOF/^D and the like, but not on empty string.) Heh; it's even trickier than that;...

I really liked the simplicity of the "central logic for a Lisp metacircular evaluator" described in the Kernel thesis: ```scheme ($define! interpreter ($lambda () (rep-loop (make-initial-env)))) ($define! rep-loop ($lambda (env)...

> I should find a nice small example `dedup` is the only function that uses `foldl`; therefore, if `foldl` were redefined to always return `nil`, `dedup` should always return `nil`...

The problem is, right now, it actually works: ``` > (dedup '(a b c c b a c)) (a b c) > (def foldl (f base . args) nil) (lit...

In PR #313 (which has a `dedup` fastfunc), the problem now manifests: ``` > (dedup '(a b c c b a c)) (a b c) > (def foldl (f base...

> In PR #313 (which has a dedup fastfunc) [...] ...now merged, which means we have this problem on the `master` branch, too. Incidentally, it's not altogether different from #170,...

`breakc` is another good example; its dependency is `syntax`, a global variable.

Bit of a fuzzy issue as far as close-ability is concerned. But here's the thing: I think four seconds is quite long for any of these `.t` files to run;...

Just adding the latest four new contenders to the prize: ``` t/02-prim-rdb.t ................. ok 14377 ms ( 0.00 usr 0.00 sys + 14.30 cusr 0.09 csys = 14.39 CPU) t/fn-bel-sigerr.t...

Stating the obvious, we have a number of new slow tests that merit inclusion on this list: ``` [20:05:04] t/fn-readall.t .................. ok 53877 ms [19:51:15] t/fn-readas.t ................... ok 51826 ms...