never
pika
never | pika | |
---|---|---|
1 | 4 | |
402 | 35 | |
0.2% | - | |
5.8 | 7.1 | |
5 months ago | 17 days 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?
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?
ring - Simple and flexible programming language for applications development
konna - A fast functional language based on two level type theory
durin - the Dependent Unboxed higher-oRder Intermediate Notation
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.
rumi - The rumi compiler
AFK-Script - A minimalist instruction language for automating user input at specified times
starlight - JS engine in Rust
hook - The Hook Programming Language
c3c - Compiler for the C3 language