gergo_barany

6 ms·

1.
by gergo_barany 2y ago
> 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. Given that the original "
2.
by gergo_barany 2y ago
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" context which is different for different mazes)
3.
by gergo_barany 2y ago
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 linked executables? Essentially, if you say that LLVM&#x2
4.
by gergo_barany 2y ago
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 traditional phi instructions. There are probably reason
5.
by gergo_barany 2y ago
> 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 suggest considering SSA-based register allocation instead:
6.
by gergo_barany 2y ago
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.ac.uk&#x
7.
by gergo_barany 2y ago
> 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 explicitly the misconduct you are alleging?
8.
by gergo_barany 2y ago
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 sum3 executes more instructions than sum1, and sum3 is faster t
9.
by gergo_barany 2y ago
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 -mcpu flag and I didn't know w
10.
by gergo_barany 2y ago
I see, that's indeed an important distinction. Thanks!
11.
by gergo_barany 2y ago
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 read something about a theory that migraines have
12.
by gergo_barany 2y ago
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 Haskell. And OCaml. And F#.
13.
by gergo_barany 2y ago
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 whatever object you give it. The interpreter w
14.
by gergo_barany 2y ago
> 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 state(2). > Also you have to use dollar signs for de
15.
by gergo_barany 2y ago
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.
by gergo_barany 2y ago
> 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 left hand side must be linear, that
17.
by gergo_barany 2y ago
> Now, unification is Turing-complete pattern matching No. First-order syntactic unification is not Turing complete. The combination of unification and resolution is Turing complete. > For instance, in Prolog, you can unify a variable
18.
by gergo_barany 2y ago
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. It doesn't compile entire packages or modules into
19.
by gergo_barany 2y ago
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 WebAssembly target.
20.
by gergo_barany 2y ago
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 asked at the front I was told that they were still processing
21.
by gergo_barany 2y ago
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" mean "neutral" or "actually
22.
by gergo_barany 2y ago
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 calling conventions must be mode
23.
by gergo_barany 2y ago
You can build GraalVM native images from modularized code, but you can also build them from non-modularized code.
24.
by gergo_barany 2y ago
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 line from the file", others a
25.
by gergo_barany 2y ago
That Coq proof is not "without computer assistance". No Coq proof is, as Coq is literally an "assistant" that runs on a computer. And those many jobXtoY.v and taskXtoY.v files sure look like they also do the same as the
26.
by gergo_barany 2y ago
Forths do have local variables. (Cue debates on what makes a stack-based Forth-like language a "Forth".) Here is the description of Gforth's support for its own extended locals and the Standard Forth locals: https:/&#x2
27.
by gergo_barany 2y ago
The main problem with the Pirate Party is that they're perceived by many as a one-issue party. Here is their actual common EU election program, which includes much more than "just digital rights": https://europea
28.
by gergo_barany 2y ago
The use case in the article here is for a single 8-byte (one size_t) popcount at a time. The comparison in your source is for when you want to compute many popcounts in parallel. The smallest size it compares is 32 bytes, where the scalar p
29.
by gergo_barany 2y ago
https://cdrdv2-public.intel.com/819723/325462-sdm-vol-1-2abc... , Vol. 2A page 3-598 (physical page 1191): "LEA—Load Effective Address" https://cdrdv2-public.intel.com/819723/325462-sdm-vo
30.
by gergo_barany 2y ago
https://www.felixcloutier.com/x86/lea : "LEA — Load Effective Address" https://www.felixcloutier.com/x86/mov-2 : "MOV — Move to/from Debug Registers ... At the opcode level, the

More ›