Ascent
use ascent::ascent; ascent! { relation edge(i32, i32); relation path(i32, i32); path(x, y) <-- edge(x, y); path(x, z) <-- edge(x, y), path(y, z); } fn main() { let mut prog = AscentProgram::default(); prog.edge = vec![(1, 2), (2, 3)]; prog.run(); println!("path: {:?}", prog.path); } Features Lattices Ascent supports computing fixed points of user-defined lattices. The lattice keyword defines a lat
Unification in Chalk, part 2 · baby steps
This blog is where I post up various half-baked ideas that I have. All PostsCategoriesGitHubTwitterRSS/Atom feedsSelected posts: The borrow checker withinEmpathy in open source: be gentle with each other In my previous post, I talked over the basics of how unification works and showed how that “mathematical version” winds up being expressed in chalk. I want to go a bit further now and extend that
Negative reasoning in Chalk · Aaron Turon
I’ve had the pleasure in recent weeks of working on Chalk, the project that Niko’s been blogging about: Lowering Rust traits to logic Unification in Chalk, part 1 Unification in Chalk, part 2 The project has a few goals: Recast Rust’s trait system explicitly in terms of logic programming, by “lowering” Rust code into a kind of logic program we can then execute queries against. Provide a prototype
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
blog/posts/2025-06-03.md at master · frankmcsherry/blog
Hilbert's rusty hotel – The If Works
