Hirrolot

6 ms·

1.
Cc1(gcc-newbies-guide.readthedocs.io)
3 points by Hirrolot 2y ago|0 comments
2.
Abstract Interpretation: From 0, 1, To ∞ [pdf](cs.nyu.edu)
6 points by Hirrolot 2y ago|0 comments
3.
by Hirrolot 2y ago
Thanks for commenting! Yes, automatically predicting whether it's beneficial to specialize a function is not implemented. It's under the section "Further research" to find suitable heuristics to automatically emit annota
4.
by Hirrolot 2y ago
Thanks, I'm glad the explanations were helpful.
5.
by Hirrolot 2y ago
Checking for blowup sort of works; for example, this paper [1] suggests exactly this approach. However, I'm not leaning to it due to the following reasons: 1. The approach involves magic numbers to implement heuristics. They worked for
6.
by Hirrolot 2y ago
The name was inspired by Transcendental Étude No. 4 [1], as correctly suggested by the other comment. [1] https://www.youtube.com/watch?v=MYSFTtYc4P4
7.
Show HN: Rust-ontologist – A tool for visualizing Rust codebases in seconds(github.com)
4 points by Hirrolot 2y ago|0 comments
8.
Comefrom(en.wikipedia.org)
3 points by Hirrolot 2y ago|0 comments
9.
by Hirrolot 2y ago
I used to define `Maybe` in C as a macro over a tagged union. It really unveiled a number of logic errors at compile-time, but the issue of course is to use this kind of metaprogramming sanely. E.g., instantiating `Maybe` to some other macr
10.
Artificial Intelligence Prepares for 2001 (1983)(ojs.aaai.org)
1 points by Hirrolot 2y ago|0 comments
11.
by Hirrolot 2y ago
Is there any reason to use SML instead of OCaml in 2024?
12.
Abstract Interpretation as a Programming Language (2013)(arxiv.org)
68 points by Hirrolot 2y ago|6 comments
13.
Framework for lifting x86, amd64, aarch64, sparc32, and sparc64 to LLVM bitcode(github.com)
5 points by Hirrolot 2y ago|1 comments
14.
A multi-level tensor algebra superoptimizer(github.com)
2 points by Hirrolot 2y ago|0 comments
15.
by Hirrolot 2y ago
Yes, features that are easy to use will be more often used, while inconvenient features will be less used. I don't quite see any controversy with my comment.
16.
by Hirrolot 2y ago
Typing features affect the way we design APIs. Libraries written in languages with type classes and without them can have completely different designs. If nested pattern matching is not available, this will not affect the APIs, only the fun
17.
by Hirrolot 2y ago
In programming language design, we tend to distinguish between global and local analysis. While type checking and elaboration is an example of global analysis, desugaring is inherently local to some piece of code. Therefore, "power&quo
18.
by Hirrolot 2y ago
I have a star on your repository, so it seems I was looking into it while designing Datatype99 :)
19.
by Hirrolot 2y ago
This is more of syntax sugar than power and generality, since nested pattern matching can be mechanically translated into "top-level" matching (e.g., see [1] and [2]). [1] L. Augustsson. Compiling Pattern Matching. In Functional P
20.
by Hirrolot 2y ago
The technique you describe requires us to predict what data should be partially applied (before actually using it), and what data should be applied and used immediately. In contrast, currying/partial application doesn't require th
21.
by Hirrolot 2y ago
Currying and partial application are dualities (think of them as function introduction/function elimination), so neither subsumes the other one. However, I agree with the wording of the original comment: when you _pass_ some arguments
22.
Size Optimization Tricks(justine.lol)
1 points by Hirrolot 2y ago|0 comments
23.
The syntax of C in Backus-Naur Form(cs.wmich.edu)
2 points by Hirrolot 3y ago|0 comments
24.
The Principle of Categorical Harmony(ebrary.net)
1 points by Hirrolot 3y ago|0 comments
25.
by Hirrolot 3y ago
Supercompilation acts as global program optimization. As far as I'm aware, there were no attempts to supercompile separate libraries. In fact, supercompilation subsumes many common optimizations, such as function inlining, constant pro
26.
by Hirrolot 3y ago
Haha, awesome!
27.
by Hirrolot 3y ago
There are currently no production-grade compilers that make use of supercompilation in the functional world. Memoization is about caching results of pure functions; supercompilation is about deep program transformation.
28.
by Hirrolot 3y ago
The solution has exponential time and space complexity, which I noted in the blog post. It is only interesting for its simplicity and as a stress test for supercompilers.
29.
Solving SAT via Positive Supercompilation(hirrolot.github.io)
153 points by Hirrolot 3y ago|38 comments
30.
by Hirrolot 3y ago
Downvoted your comment because of spelling. Consider learning some English grammar.

More ›