starlight
pika
starlight | pika | |
---|---|---|
7 | 4 | |
500 | 35 | |
1.8% | - | |
1.8 | 7.1 | |
over 2 years ago | 18 days ago | |
Rust | Rust | |
Mozilla Public License 2.0 | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
starlight
-
Really it have to be some kind of virus that spreads sneakly
I have great news
-
gc-shadowstack: Implementation of shadow stack algorithm to track GC rooted objects.
Hello to all! This crate implements Shadow Stack algorithm which allows to track GC objects on stack with almost zero overhead! This algorithm is used inside Restricted Python and seems to work very well. This crate soon will replace DIY shadow stack implementation in starlight(JS engine in Rust) too.
-
March 2021 monthly "What are you working on?" thread
Working on startup snapshots in starlight. I already have very basic implementation which allows to initialize runtime in just 17 microseconds from snapshot vs 23 microseconds without snapshot when every builtin is created from scratch. Future work is aimed mostly on making deserialization faster
-
Reference counting GC vs tracing GC and JITs
Hi to all! I'm working on starlight (JS engine in Rust) and I can't choose memory management technique: Right now I have conservative on stack precise on heap GC which somehow manages to work but still has segfaults and I'm also working on rcgc feature which will use RC as GC algorithm but my main question: is it worth using RC over tracing cycle and how hard it will be to implement JIT when RC is used? I've never seen any runtimes that use RC and implement JIT.
-
Starlight: JS engine focused on performance in Rust.
There's test262_passed file in repo, you can take a look at what tests pass :)
pika
-
September 2021 monthly "What are you working on?" thread
I just switched Pika to using significant indentation. This is mostly because of how annoying line continuation is in a ML-style language (so f a b syntax) without significant indentation or required semicolons, but you can read more about the reasons for that decision in this section of the README.
-
May 2021 monthly "What are you working on?" thread
Recently, I've been working on adding garbage collection to Pika. I've successfully written an Immix-based garbage collector that works with the LLVM GC support infrastructure, and I'm currently working on integrating the GC with Pika, or really Durin, the dependently-typed intermediate representation that Pika compiles to. Because types are passed around at runtime, objects of unknown type and size can be stored unboxed in polymorphic data structures; but that makes keeping track of type information for heap allocations somewhat harder, because type information needs to be allocated and constructed at runtime in some cases. It's an interesting design problem, because you want constructing type information to be fast; but the GC will run much more often, so maximizing tracing speed by avoiding e.g. indirection in type information is important; and you also want to construct as much type information as possible at compile time and embed it as constants.
-
March 2021 monthly "What are you working on?" thread
I've been working on adding algebraic effects to Pika during the past month. It's turned out to be harder than I thought it would, but I'm almost done - performing and catching one effect at a time works, and the compilation strategy I'm using now (I reimplemented the whole thing after realizing the strategy I was using wouldn't actually work) should be enough to handle multiple effects at once and also effect polymorphism, I just have to get those working in the elaborator.
-
February 2021 monthly "What are you working on?" thread
After taking a break from Pika, my dependently-typed ML for systems programming, during the month of January, I've started working on it again by getting recursion to work properly. I'm planning on starting to implement algebraic effects next, and an Immix-based garbage collector for boxed values after that. Here's what my current plan for algebraic effects looks like:
What are some alternatives?
boa - Boa is an embeddable and experimental Javascript engine written in Rust. Currently, it has support for some of the language.
konna - A fast functional language based on two level type theory
Matrix - Easy-to-use Scientific Computing library in/for C++ available for Linux and Windows.
durin - the Dependent Unboxed higher-oRder Intermediate Notation
bluebird - A work-in-progess programming language modeled after Ada and C++
fastcode - A unique blend of C, Java, and Python tailored for those who desire a simple yet powerful programming language.
rumi - The rumi compiler
star - An experimental programming language that's made to be powerful, productive, and predictable
c3c - Compiler for the C3 language
firefly-boot - Bootstrap compiler for Firefly