Viewing profile — sabauma
sabauma
HN member- Joined
- Thu, Apr 16, 2015, 3:50 PM UTC
- HN karma
- 52
- Public activity
- 21 items
- HN profile
- View on Hacker News ↗
About sabauma
No profile information was provided.
Recent public activity
-
comment
Comment #29003029
The cost for the connect plans is what confuses me. For what you get, $5-$8 per month seems oddly expensive. I don't really use any of the features in the full connect plan. The cl…
-
comment
Comment #28606892
I've replaced my Kindle with a Remarkable 2 and am generally pleased with the overall experience. The larger screen is nice, as is the ability to read/annotate academic papers on t…
-
comment
Comment #27515763
I find rmapi + fzf to be the easiest way to send ebooks in my Calibre library to my rM2. Its probably possible to create a Calibre addon to do this, but its already makes syncing p…
-
comment
Comment #18009839
This is indeed a consequence of tracing. The problem is that traces are associated to loops in the program, and since the map function contains only one loop, all traces for map ar…
-
comment
Comment #18006770
I haven't checked in on the development of Pycket in a bit, but much of the recent work has gone into supporting linklets. Last I checked, the performance story for the Scheme and …
-
comment
Comment #16133940
There has been some discussion of Meltdown and Spectre on the Mill forums: https://millcomputing.com/topic/meltdown-and-spectre/
-
comment
Comment #14436719
The REPL essentially operates at the global scope, which is represented as a dictionary. Variables local to a function are not stored in a dictionary, however: def main(): a = 1 d …
-
comment
Comment #13792433
Chez is an AOT compiler. I am not sure how the REPL operates, but I believe it just compiles expression on the fly before executing them. I suppose you could characterize that as J…
-
comment
Comment #13792323
Chez is pretty tough to compete with in terms of Scheme performance. On the benchmarks presented in the paper, Chez averages faster than all the systems presented, even Pycket post…
-
comment
Comment #13485977
You can find simple decorators which try to provide space efficient tail recursion. Usually they work by trampolining the function. I've seen one example where a decorator rewrites…
-
comment
Comment #13485594
That depends on how you run Pixie. There are 2 possible cases. 1. Run Pixie atop the Python VM: this is quite slow as there are 2 levels of interpretation. This is mostly used for …
-
comment
Comment #13485530
> The thing is, tail calls aren't _just_ about emulating iteration via recursion: I completely agree, but there is also no need to perform TCO to make code like this safely runnabl…
-
comment
Comment #13483148
Probably because many tail-recursive functions _rely_ on tail-call elimination working reliably. Without also having an unbounded call stack, disabling tail-call elimination will l…
-
comment
Comment #13483077
The notion that not having proper tail calls aids debugging always seemed like a post-hoc justification. The stack trace of an iterative function will lack exactly the same interme…
-
comment
Comment #13447280
It would be interesting to see how well PyPy optimizes the code generated by the Phorth compiler, but it looks like this needs some hacks via the CPython C API to work. Even if it …
-
comment
Comment #13447204
While Pixie is implemented in RPython, Pixie code does not run on the Python VM. You can run the Pixie _interpreter_ in the Python VM, since it is valid Python code, but that is ma…
-
comment
Comment #13427930
Much of the data in that repo is old/outdated. This ( https://github.com/pycket/pycket-bench/blob/master/output/20... ) figure was the one used in the paper, which includes Gambit.…
-
comment
Comment #13427397
Pycket has different performance characteristics from many of the AOT systems we compared against. On average Pycket is ~2x faster than the Racket VM, ranging from ~3x slower to ~3…
-
comment
Comment #13423542
Its worth noting that the design of the RPython JIT will always result in a large amount of static data in the resulting binary. The RPython translator basically generates a byteco…
-
comment
Comment #13423425
Yes. It is for the Racket language.
-
comment
Comment #13421359
The RPython translator generates views of the Mandelbrot set by default, presumably to give you something to look at during the long wait.