xvm
konna
Our great sponsors
xvm | konna | |
---|---|---|
110 | 6 | |
189 | 11 | |
0.0% | - | |
9.8 | 0.0 | |
1 day ago | about 2 years ago | |
Java | Haskell | |
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:
konna
-
How did you choose the name for your programming language?
The second was called Konna. AFAIK it’s Finnish for “frog”, but sources seem to disagree? I don’t speak Finnish, I got the word from a Finnish video game. My third and current language is called Peridot. I’m pretty proud of this name, although it’s less searchable than the previous ones. The origin is pretty simple, I was just looking around at gemstones and thought peridot looked neat.
-
January 2022 monthly "What are you working on?" thread
Continuing work on Konna. I recently finished implementing dependent pattern matching, a pretty big feature! I figured now is the time to do some refactoring and rewriting - the elaborator is the first thing on my list. Once all this maintenance work is done I'll be implementing features like implicit arguments, overloading, and pattern matching on code values.
-
Konna, my programming language
Github repo: https://github.com/eashanhatti/konna
-
December 2021 monthly "What are you working on?" thread
Continuing work on my functional language Konna. The structured editor has progressed a whole lot recently - the most glaring bugs have been fixed and you can work with the entire language in it. The language itself is going well too, I'm currently thinking through:
-
September 2021 monthly "What are you working on?" thread
Working on a rewrite of Konna (formerly Clamn). After using Rust for a little over a year in the original implementation, I decided I wasn't enjoying it. I'm using Haskell for the rewrite - I'd always wanted to write a big project in Haskell anyway haha. Definitely enjoying the higher-level conveniences it offers. The rewrite has been underway for about two weeks now, and so far I've got basic dependent types and partial evaluation implemented.
-
March 2021 monthly "What are you working on?" thread
Continuing work on my functional systems language Clamn. I'd taken the last few weeks to fix a bunch of performance issues, but now it's finally back to implementing features: record types. I've got dependent types in my lang, which means I can get a bunch of more exciting features for free by implementing records, ADTs for instance.
What are some alternatives?
seed7 - Source code of Seed7
wotpp - A small macro language for producing and manipulating strings.
list-exp - Regular expression-like syntax for list operations [Moved to: https://github.com/phenax/elxr]
Cwerg - The best C-like language that can be implemented in 10kLOC.
kuroko - Dialect of Python with explicit variable declaration and block scoping, with a lightweight and easy-to-embed bytecode compiler and interpreter.
star - An experimental programming language that's made to be powerful, productive, and predictable
TablaM - The practical relational programing language for data-oriented applications
pen - The parallel, concurrent, and functional programming language for scalable software development
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).
pika - A WIP little dependently-typed systems language
RustScript2 - RustScript is a functional scripting language with as much relation to Rust as Javascript has to Java.
Bilobe - A New Programming Language To Introduce New Way To Code...