Our great sponsors
xvm | starlight | |
---|---|---|
110 | 7 | |
189 | 491 | |
0.0% | 0.0% | |
9.8 | 1.8 | |
6 days ago | over 2 years ago | |
Java | Rust | |
GNU General Public License v3.0 or later | Mozilla Public License 2.0 |
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.
xvm
-
Implementing arrays (and hash tables and ..) in a minimal ML with a C API
Have a look at the ecstasy library for the language definitions of these types.
-
Polymorphic static members
2) Funky interfaces: This is an Ecstasy interface that declares abstract static members (e.g. functions), which can then be implemented on any class and overridden on any sub-class, such that they can be invoked by type (instead of this), and virtually resolved (late bound at runtime) based on the type known at compile time. The best known example, of course, is Hashable, because it has to guarantee that a type implements both equals() and hashCode() on the same class, and the implementation is tied to the type, and not to the this. (C# added a similar feature last year in version 11.)
-
How do you parse function calls?
I'm just going to warn you in advance that invocation is one of the hardest things in the compiler to make easy. In other words, the nicer your language's "developer experience" is around invocation, the more hell you're going to have to go through to get there. The AST nodes for Name( (NameExpression) and Invoke( (InvocationExpression) alone are 7kloc in the Ecstasy implementation, for example -- but the result is well worth it.
-
What are some important differences between the popular versions of OOP (e.g. Java, Python) vs. the purist's versions of OOP (e.g. Smalltalk)?
Ecstasy uses message passing automatically behind the scenes for asynchronous calls, but the message passing isn't visible at the language level (i.e. there is no "message object" or something like that visible). Basically, all Ecstasy code is executing on a fiber inside a service, and services are all running concurrently, so from any service realm to any service realm, the communication is by message.
-
Is your language solving a real world problem?
Regarding Ecstasy, we did not set out to build a new language; we actually set out to solve a real world problem. Specifically, we wanted to be able to dramatically improve the density of workloads in data centers, by at least two orders of magnitude in the case of lightly used applications. Our initial goal was to create a runtime design that would support 10,000 stateful application instances on a single server. Let's call it the "a10k" problem 🤣 ... a tribute to the c10k problem from 1999. We refer to our goal as "zero carbon compute", i.e. we want to push the power and hardware cost for an application to as close to zero as possible; you can't reach zero, but you can get close. If we succeed, we will help reduce the electricity used in data centers over the next few decades by a significant percentage.
-
How do you tokenize multi char tokens.
Generally, left to right, one character at a time. If you’re looking for example code, here’s a simple hand-built lexer.
-
Have you written your own language in itself yet?
Parts of Ecstasy are now implemented in Ecstasy. Here's the Lexer, for example.
-
Top programming languages created in the 2010's on GitHub by stars
Ecstasy
-
What languages have been created *specifically* for the purpose of being JIT-compiled?
Ecstasy and the xvm were designed assuming an adaptive runtime compiler (similar in concept to the Hotspot compiler for Java), but not necessarily using a JIT.
-
What are you doing about async programming models? Best? Worst? Strengths? Weaknesses?
A Future reference has the various capabilities that you'd imagine, taking lambdas for thenDo(), whenComplete(), etc. The reference, in the above example, is a local variable, so you just obtain it using the C-style & operator:
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 :)
What are some alternatives?
seed7 - Source code of Seed7
boa - Boa is an embeddable and experimental Javascript engine written in Rust. Currently, it has support for some of the language.
list-exp - Regular expression-like syntax for list operations [Moved to: https://github.com/phenax/elxr]
Matrix - Easy-to-use Scientific Computing library in/for C++ available for Linux and Windows.
kuroko - Dialect of Python with explicit variable declaration and block scoping, with a lightweight and easy-to-embed bytecode compiler and interpreter.
bluebird - A work-in-progess programming language modeled after Ada and C++
TablaM - The practical relational programing language for data-oriented applications
fastcode - A unique blend of C, Java, and Python tailored for those who desire a simple yet powerful programming language.
ghc - Mirror of the Glasgow Haskell Compiler. Please submit issues and patches to GHC's Gitlab instance (https://gitlab.haskell.org/ghc/ghc). First time contributors are encouraged to get started with the newcomers info (https://gitlab.haskell.org/ghc/ghc/wikis/contributing).
star - An experimental programming language that's made to be powerful, productive, and predictable
RustScript2 - RustScript is a functional scripting language with as much relation to Rust as Javascript has to Java.
firefly-boot - Bootstrap compiler for Firefly