boba
xvm
Our great sponsors
boba | xvm | |
---|---|---|
9 | 110 | |
48 | 189 | |
- | 0.0% | |
2.3 | 9.8 | |
12 months ago | 7 days ago | |
F# | Java | |
MIT License | 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.
boba
-
AG unification is the solution for type inference with scientific units
I've done a small implementation, used in type inference, in my language Boba. And you are correct, I used the linear equation solving method.
-
November 2022 monthly "What are you working on?" thread
The vast majority of October's improvements on Boba were type system and runtime bug fixes. In particular, the effect handler/delimited continuation semantics were hopelessly busted beyond a few simple examples I'd fixated on.
-
October 2022 monthly "What are you working on?" thread
September was another productive month for Boba, which is starting to get more 'quality of life' improvements rather than broad new features. That doesn't make the work less important: one of the bug fixes to the type inference engine last month caught a previously unseen bug in the core Boba libraries!
-
Unit Type System
Also worth checking out is Adam Gundry's work on type inference for UoM types. Or, if you want an example implementation of the Abelian unification used in standard type inference extended with UoM types, you can reference my implementation, based on solving linear equations.
-
September 2022 monthly "What are you working on?" thread
August was a surprisingly productive month for the Boba compiler. A few highlights:
-
August 2022 monthly "What are you working on?" thread
The next large feature for Boba (a general-purpose concatenative language) is language integrated property tests.
-
Soft-launch Boba: a statically-typed concatenative programming language
That's a good question! I wrote up some of my thoughts on the benefits of Go as a backend, but there's also a historical component here. The first backend I was experimenting with was compile-to-C plus a C-based runtime. Go was closer to C than C# for what I needed at the time and I thought had a nicer concurrency story as a backend.
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:
What are some alternatives?
Forscape - Scientific computing language
seed7 - Source code of Seed7
wort - A core concatenative programming language with variables and first-rank polymorphic type inference
list-exp - Regular expression-like syntax for list operations [Moved to: https://github.com/phenax/elxr]
butter - A tasty language for building efficient software. WIP
kuroko - Dialect of Python with explicit variable declaration and block scoping, with a lightweight and easy-to-embed bytecode compiler and interpreter.
awesome-low-level-programming-languages - A curated list of low level programming languages (i.e. suitable for OS and game programming)
TablaM - The practical relational programing language for data-oriented applications
ShnooTalk - ShnooTalk is a new 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).
mlscript - The MLscript programming language. Functional and object-oriented; structurally typed and sound; with powerful type inference. Soon to have full interop with TypeScript!
RustScript2 - RustScript is a functional scripting language with as much relation to Rust as Javascript has to Java.