HN user
Thanks for the interest! The work is by Francesco, a very good student of mine.
I linked a preprint of the paper that presents it and that we’ve got recently accepted at SAC2025 because it details both the theory and the Rust implementation. The paper also includes the link to the repository, but it makes sense to report it here https://github.com/frengor/rust-cc
Since it seems on topic, I link a related project by an undergraduate at the University of Bologna https://saveriogiallorenzo.com/publications/sac2025a/sac2025...
Essentially, it’s a refinement of Bacon-Rajan’s cycle collector (sequential) that does not require auxiliary heap memory and handles failures when tracing complex object graphs because it uses a breadth-first technique that fundamentally prevents stack overflow scenarios.
What's particularly compelling is the Rust implementation, which weaves the type system and borrow checker into the algorithm's design. When dealing with garbage cycles, the algorithm doesn't just match current Rust GC alternatives, it outperforms them.
The website is published under creative commons and GPL (code examples) but the Jolie codebase is published under LGPL.
I recently posted here[1] a tutorial on how to implement quicksort as a service in Jolie. I think it could be a good starting point to learn some of the main features of the language.
You can find a good deal of examples also in the official documentation [2].
[1] https://news.ycombinator.com/submitted?id=thesave [2] http://docs.jolie-lang.org
Like marktangotango wrote, the official repository is at [1]
May I ask why you prefer git? For cloning/forking the project?