Sam Tobin-Hochstadt

Ah, so it's the _combination_ of `parameter/c` in the untyped code and the contract generated by Typed Racket that makes things slow? If that's the case, then two uses of...

Where can I get `typed/sicp-pict` so that I can run the code?

Also, the code provided in this issue doesn't actually run -- it has a bunch of missing requires, various syntax errors. Do you have the version of the code you...

Ok, I don't think this has anything to do with `parameter/c`. If I change `(parameter/c ...)` in `sicp/sicp-pict/main.rkt` to `any/c`, the program is still slow. So the problem is just...

Further investigation suggests that it's the `current-dc` contract that is very slow. Having a contract on `current-bm` doesn't impose much overhead (which is unsurprising, it isn't used much in the...

Further investigation: 1. Running the program with the `info` log level prints an almost-endless stream of `collapsible-value-bailout: arrow: can't prove single-return-value`, suggesting that some contract internal things are happening in...

I just used the branch referenced by @NoahStoryM above.

Just to understand the current situation, the O(n^2) behavior is still there, but now much less likely to be a problem because many fewer elements are in the list now....

That makes sense. Maybe I should put a log statement in there for when it gets over 5.

It seems like there are three things being requested here: 1. Type argument inference for nested `All`, as in your `(CONS 'hello "world")` example. 2. Automatic uncurrying of nested `All`,...