On Wed, Dec 11, 2013 at 7:25 PM, John Clements
wrote:
>
> Wow! I had no idea TR was that fast.
In fairness, much of this is that Racket is that fast -- Matthew's put
a lot of work into the JIT over the last few years.
> Related question: how hard is it to reason about the GC behavior of TR code?
On Dec 11, 2013, at 4:18 PM, Neil Toronto wrote:
> On 12/11/2013 02:49 PM, Neil Toronto wrote:
>> On 12/11/2013 01:55 PM, Stephen Bloch wrote:
On Dec 11, 2013, at 2:36 PM, Neil Toronto wrote:
> numeric primitives implemented in Typed Racket are faster than the
> same primitives
2 matches
Mail list logo