never
durin
Our great sponsors
never | durin | |
---|---|---|
1 | 3 | |
401 | 13 | |
-0.5% | - | |
5.8 | 0.0 | |
5 months ago | about 2 years ago | |
C | Rust | |
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.
never
-
May 2021 monthly "What are you working on?" thread
Recently Never was extended with tuples. I hope to add documentation and examples soon. Also some bugs and improvements were removed and added. Now I am looking for ideas what to do next. Maybe you could suggest something?
durin
-
Are there any low level, cross platform assembly languages that allow jumping to non labels?
So I think I may be one of the few people in the world who has actually implemented a GC using LLVM's statepoint infrastructure. It's poorly documented and there are some gotchas, but I'd say it's definitely usable, and it works with basically any collector design, including moving collectors (I'm using Immix) and has no runtime bookkeeping overhead and allows LLVM to optimize the code without worrying about GC, which is nice. It's actually gotten a bit better with LLVM 13, too. If you're curious what a LLVM-based GC looks like, mine is in this folder. Of course, if you just want some sort of GC, you can also just link it with Boehm which is quite easy and has pretty good performance - this is what e.g. Crystal does, although they're talking about switching.
-
September 2021 monthly "What are you working on?" thread
I also fixed lots of bugs in the GC and backend, so it should be a lot more stable now.
-
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.
What are some alternatives?
ring - Simple and flexible programming language for applications development
c3c - Compiler for the C3 language
tailspin-v0 - A programming language with extreme data-pattern matching and data-declarative syntax, hopefully different enough to be interesting
bluebird - A work-in-progess programming language modeled after Ada and C++
nature - 🍀 The Nature Programming Language, may you be able to experience the joy of programming.
pika - A WIP little dependently-typed systems language
AFK-Script - A minimalist instruction language for automating user input at specified times
konna - A fast functional language based on two level type theory
Kong - Kong is an implementation of the Monkey interpreter in Java 8 from The Writing An Interpreter In Go books
imp - Imp is a statically typed and compiled scripting language with the goal of increasing programmer confidence.
hook - The Hook Programming Language
kesh - A simple little programming language that could one day compile to JavaScript.