Live data from Hacker News

Viewing profile — slava_pestov

slava_pestov

HN member
Joined
Fri, Oct 19, 2007, 5:49 PM UTC
HN karma
52
Public activity
17 items

About slava_pestov

No profile information was provided.

Recent public activity

  1. comment
    Comment #1674436

    > I want to write Lisp for Factor. That would be a cool project. The Factor compiler enforces static stack effects for words, so mapping them to Lisp functions, and making the gene…

  2. comment
    Comment #1663840

    Each one is true for at least one of those platforms.

  3. comment
    Comment #1663290

    I should say, Unix in this context means any Unix-like system that Factor runs on (Linux, FreeBSD, OpenBSD, Mac OS X)

  4. comment
    Comment #1661908

    I don't see what the big deal is. It took me a few hours to update Factor's Twitter library for OAuth -- and that included writing the OAuth support library. The whole thing is onl…

  5. comment
    Comment #1625046

    Factor uses ahead of time compilation. When you load a source file at the REPL, all definitions in it are compiled immediately, and compiled code is saved in the image. So when you…

  6. comment
    Comment #1624028

    Under what circumstances does Visual C++ still emit x87 instructions? I'd think that other than legacy support, 80-bit long double arithmetic, and the 32-bit ABI (float return valu…

  7. comment
    Comment #1624018

    Unfortunately enough people have older CPUs that we still have to support x87 code generation; its just not used in the binary packages, you have to build the source to get it.

  8. comment
    Comment #1624013

    Factor supports machines without SSE2 if you compile it yourself. In this case it will use the x87 floating point. The binaries are built to use SSE2 for floating point since most …

  9. comment
    Comment #870494

    The JRuby developers have spent a lot of time doing performance measurements, implementing optimizations and trying out different approaches. You're just throwing in your two cents…

  10. comment
    Comment #866909

    > Does this mean that simple accessors (or at least getters) effectively have no method call overhead? Method inlining has nothing to do with escape analysis (other than enabling i…

  11. comment
    Comment #866868

    Actually, once you've figured out that you can stack allocate an object, you can stick its instance variables in registers. This can be a huge win.

  12. comment
    Comment #866515

    There's no theoretical difficulty with compiling tail calls to virtual methods; of course perhaps you meant that the JVM doesn't expose a bytecode for doing so, which is absolutely…

  13. comment
    Comment #866513

    tl;dr: No, it has to be built-in to the JVM. First of all, if a JVM were to attempt this optimization for tail calls using the ordinary method call bytecodes, it would break existi…

  14. comment
    Comment #821195

    http://en.wikipedia.org/wiki/Intel_80186

  15. comment
    Comment #792657

    So how does Ruby's performance on vector code compare with OpenCL?

  16. comment
    Comment #694911

    Here's a point-free version in Factor. It looks a bit different from the original formula but once you get used to it its very quick to read; I prefer it to the Lisp code since the…

  17. story