Hacker News
Aristotle Expands into Rust
conqrr
|next
|previous
[-]
tachim
|root
|parent
[-]
For Verilog which is another language we support, for hardware, we compile the SVA assertions deterministically into Lean theorem statements about the compiled Lean embedding of the Verilog.
remywang
|root
|parent
[-]
> Aristotle compiles the provided Rust code deterministically into our proprietary Lean formal model of Rust execution (onward: the embedding).
I was also wondering how readable the auto-formalized spec is, but “proprietary” suggests the formal spec is hidden?
As a user I’d much prefer looking at the formalization myself instead of trusting the auto-formalization from natural language.
jakob_harmonic
|root
|parent
[-]
remywang
|root
|parent
[-]
jakob_harmonic
|root
|parent
[-]
More documentation on Rust specifically can be found here: https://aristotle.harmonic.fun/docs/software/rust
scorchin
|next
|previous
[-]
OreganoTrail
|next
|previous
[-]
That's crazy, I haven't seen any other system that really tries to do that.
bryanlarsen
|root
|parent
|next
[-]
- cargo-anneal - VeriFast - RefinedRust - safety-tags - Verus
These 5 use very different mechanisms. This is still a very active research area.
bryanlarsen
|root
|parent
[-]
https://github.com/google/rust-skills/blob/main/unsafe_rust_...
expectfun
|next
|previous
[-]
tachim
|root
|parent
|next
[-]
pjmlp
|root
|parent
|next
|previous
[-]
You can already see this taking of on low code, no code tooling, reinvented as SaaS agentic runtimes.
Or check SIGPLAN papers on machine learning based compilers.
aw1621107
|root
|parent
[-]
Mind providing some examples? My (admittedly probably dated) understanding of how ML is used in compilers is for picking heuristics/thresholds/other things for which there's no known optimal "right" answer (e.g., pass order, inlining thresholds). Everything else was done in the "traditional" manner, which meant that the machine learning bits were, strictly speaking, completely optional. I haven't heard of compilers where ML techniques are integral to the process to the point where removing any ML bits would result in a nonfunctional compiler.
rafram
|root
|parent
|previous
[-]
(I qualify with “in a sane world” because obviously it could happen. In a truly sane world, JavaScript would never have happened, either!)
afavour
|root
|parent
|next
[-]
I’d counter with: as LLM driven coding becomes more and more common the PITA borrow checker is something individual developers interact with less than less. Garbage collection looks more and more like a waste when an LLM can examine memory allocations before the app is even built.
rafram
|root
|parent
|next
[-]
siscia
|root
|parent
[-]
rafram
|root
|parent
[-]
weinzierl
|root
|parent
|next
|previous
[-]
Just because they did in the past doesn't mean they will continue to do so in the future. If we are honest then Moore's Law ended a decade ago (the latest) and we've been picking the low hanging fruit we left alone during Moore's era since. This too will come to an end for sure, just not a pretty and well defined one.
So, my conclusion is the opposite. Garbage collected and DX optimized languages made sense while processors and memory got faster, the future will be elsewhere.
rafram
|root
|parent
[-]
ChadNauseam
|root
|parent
|next
|previous
[-]
nilkn
|root
|parent
|next
|previous
[-]
expectfun
|root
|parent
|next
|previous
[-]
And yeah, it feels a bit like JavaScript a while ago, that's a good comparison.
darksaints
|root
|parent
|next
|previous
[-]
1) most garbage collectors are pretty lame and can't even come close to the throughput/efficiency of manually managed memory, and
2) the vast majority of software does not even come close to the frontier of what is possible with software, and therefore the thing that matters most is correctness.
Rust does a better job at correctness than most languages because the type system is so robust, and it does a better job at memory management than most languages because most languages do garbage collection so poorly.
AlienRobot
|root
|parent
|next
|previous
[-]
rafram
|root
|parent
[-]
teiferer
|root
|parent
|next
|previous
[-]
Out of curiosity, what do you envision would have taken its place in frontend, in that sane world? (Honest question, no bad faith agenda.)
rafram
|root
|parent
|next
[-]
JavaScript’s biggest weakness IMO is its absolutely abysmal standard library, particularly in terms of data structures. (At least we have Map and Set now, but still no way to define a hash/equality function for a type…) The situation is so bad that essentially any other modern programming language would be an improvement.