Live data from Hacker News

Viewing profile — gergo_barany

gergo_barany

HN member
Joined
Thu, Sep 07, 2017, 4:40 PM UTC
HN karma
124
Public activity
75 items

About gergo_barany

No profile information was provided.

Recent public activity

  1. comment
    Comment #42842283

    > You don't have to implicitly supply the "this" parameter to each "object" predicate if you don't want to [...] if you were really interested in that level of syntactic sugar. Giv…

  2. comment
    Comment #42832612

    Could you elaborate on all of these? For [1], you would either need to pass the AVL tree around or to have it as a global (which is not wanted), and instead pass the key (the "this…

  3. comment
    Comment #42822885

    If this is one of the main things you want to demonstrate, wouldn't it be better to focus on this one goal first, instead of the whole pipeline from a C preprocessor to directly li…

  4. comment
    Comment #42822227

    Also, for a different notion of "cruft", informally it seems to me like new SSA-based compilers tend to choose an SSA representation with basic block arguments instead of the tradi…

  5. comment
    Comment #42822142

    > a decent linear scan allocator which will eventually be replaced with graph coloring for optimized builds. Before setting out to implement 1980s-style graph coloring, I would sug…

  6. comment
    Comment #40960407

    What they're "alluding to" is a standard combinator that has existed under the name "paramorphism" for a long time. Here is Jeremy Gibbons's "Origami programming" https://www.cs.ox…

  7. comment
    Comment #40953867

    > let's drop the charade that everything is above board here. OK. Since you're opposed to merely alluding to things (your italics, which I find funny), could you please state expli…

  8. comment
    Comment #40948356

    The nodes are adjacent in sum1. The nodes are adjacent in sum2, and sum2 executes more instructions than sum1, and sum2 is faster than sum1. The nodes are adjacent in sum3, and sum…

  9. comment
    Comment #40948306

    The LLVM project has a tool called llvm-mca that does this. Example: https://gcc.godbolt.org/z/7zcova1ce The version in the Compiler Explorer wouldn't work on AArch64 without an -m…

  10. comment
    Comment #40930709

    I see, that's indeed an important distinction. Thanks!

  11. comment
    Comment #40896158

    This is similar to my symptoms. So far I haven't found any over the counter painkiller that helps me reliably. At least not in the doses you're supposed to take. A few years ago I …

  12. comment
    Comment #40865637

    What is "the above"? The context was ( https://news.ycombinator.com/item?id=40844208 ): > The one-sided pattern matching seems to be a peculiarity of Elixir. And Erlang. And Haskel…

  13. comment
    Comment #40865152

    You're right that you can't override __add__ for numbers, but the bytecode doesn't say this. The bytecode isn't specialized to numbers. It will call the __add__ operation on whatev…

  14. comment
    Comment #40864519

    > Because Picat is a research language it's a little weird with putting expressions inside structures. If we did $state(1 + 1) it would store it as literally $state(1 + 1), not sta…

  15. comment
    Comment #40849191

    What's not the same as what? Based on your examples it looks like you're saying that unification is not the same as pattern matching. But nobody said it was.

  16. comment
    Comment #40849132

    > I'd say that "pattern matching" is unification, where there are no free variables on the right side and the left side is the "pattern" to match. Plus the restriction that the lef…

  17. comment
    Comment #40849029

    > Now, unification is Turing-complete pattern matching No. First-order syntactic unification is not Turing complete. The combination of unification and resolution is Turing complet…

  18. comment
    Comment #40818932

    I don't see why it would be. The native image static analysis decides on the level of individual classes, methods, and even class fields what to include in the image and what not. …

  19. comment
    Comment #40792052

    WebAssembly fans might say that it's the kind of universal low-level but portable IR that you envision. It would certainly make sense for a Scheme compiler to consider a WebAssembl…

  20. comment
    Comment #40769463

    I was in Paris in March and had a ticket for this. I was at the museum an hour before my booked time slot. The square in front of the entrance was one gigantic queue, and when I as…

  21. comment
  22. comment
    Comment #40768329

    Unfortunately this doesn't answer the OP's question. OK, it may not result in better code. But in which cases, and for what reason? EDIT: And for that matter, does "not better" mea…

  23. comment
    Comment #40765863

    C has had fixed-size integers since C99: https://en.m.wikibooks.org/wiki/C_Programming/inttypes.h Targeting LLVM IR has the drawback that it is not platform independent: Details of…

  24. comment
    Comment #40753580

    You can build GraalVM native images from modularized code, but you can also build them from non-modularized code.

  25. comment
    Comment #40748657

    Yes, the kind of test case reduction that C-Reduce does is analogous to QuickCheck's shrinking. Some of C-Reduce's transformations are purely "on strings", e.g., "delete a physical…