schmu
Vale
schmu | Vale | |
---|---|---|
3 | 64 | |
24 | 1,677 | |
- | 1.9% | |
9.5 | 6.8 | |
5 days ago | about 2 months ago | |
OCaml | Scala | |
European Union Public License 1.2 | Apache 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.
schmu
-
November 2022 monthly "What are you working on?" thread
Since the last time I posted, I finished implementing pattern matching for schmu. To make matching on multiple columns less confusing I also added a tuple syntax to the language (finally), which are treated as anonymous records in codegen. Since then, I'm trying to overhaul my memory management, as my RAII-like solution only worked for linear code. In my first big departure from OCaml semantics, I decided to implement mutable value semantics. The paper linked in the Val language introduction makes a strong case for value semantics and after watching a couple of talks by Dave Abrahams, I wanted to try see how it feels. By making mutability be transitive and explicit, it also fixes one of the (few) gripes I have with OCaml that an array can never be really const as it is a reference type (it's possible to enforce constness with modules, but that's not exactly lightweight, syntax wise). Implementing mutable value semantics was pretty straight forward on the typing side, but I'm still not completely done with the codegen. This is due to 1. Assumptions about immutability I made in a lot of places are now wrong, and I had to completely change the way I pass values to functions. 2. I had to implement reference counted arrays, which was more work than I thought it would be. There are still edge-cases coming up in testing from time to time. Yesterday I finally managed it work for tail recursion, yay! I'm looking forward to getting rid of unneeded reference count updates in the future, by moving them to compile time, at least for linear code, lobster style. That's also an excuse to read that Perceus paper again. For the rest of November, I want to enhance my module system a bit. In particular, I want to add signatures and allow locally abstract types. I hope to have this in place before December to do the Advent of Code in my language.
-
September 2022 monthly "What are you working on?" thread
I'm still working on my toy language schmu, an ML-inspired language which uses LLVM as backend.
-
May 2022 monthly "What are you working on?" thread
I spent the time off over the Easter break to write the first program in my language which is not an explicit test and ended up implementing Ray Tracing In One Weekend. It was very rewarding to see how usable the language is already.
Vale
-
Vala Programming Language
Not to be confused with Vale[0].
[0] https://vale.dev/
-
Is Something Bugging You?
The article says they created a deterministic hypervisor that runs all pseudorandom behavior from a starting seed to enable perfect re-playability.
But that's all we know so far. I'm assuming there'll be some sort of fuzz testing, and static analysis or some defining actions that your software can perform.
Honestly it sounds a lot like it has a lot of crossover with what the Vale language is trying to solve: https://vale.dev/, but focused on trying to get existing software to that state instead of creating a new language to make new software already be at that state by default.
- Odin Programming Language
-
D Programming Language
Why go through all the trouble when you can do this: https://www.hylo-lang.org/ and not spend a second thinking of lifetimes? No, copies will not be issued unless necessary.
Or why not keep exploring this idea as well? More research-oriented than the first one right now, though, so take it with a grain of salt: https://vale.dev/
- The Vale Programming Language
-
Flawless – Durable execution engine for Rust
Another relevant language might be Vale (https://vale.dev), which is aiming for "perfect replayability": https://verdagon.dev/blog/perfect-replayability-prototyped
-
Two Stories for "What Is CHERI?"
Interesting. Very low level though and C(++) centric. She there any thoughts on combining the hardware and OS features with rust or https://vale.dev ?
- Berry is a ultra-lightweight dynamically typed embedded scripting language
-
I've heard that "Rust's borrow checker is necessary to ensure memory safety without a GC" usually also implying it's the only way, but I've done the same without the borrow checker. Am I just clueless/confused?
Use a runtime memory management solution that's cheaper than garbage collection (see Vale)
-
Vale.sh – A Linter for Prose
This seems like a tool I'll be using, and this is an almost meaningless criticism, but why the name?
There's already the Vale programming language (https://vale.dev/), but moreover, I don't get the meaning of "vale". You could call it something like Englint which actually hints its purpose.
What are some alternatives?
Forscape - Scientific computing language
v - Simple, fast, safe, compiled language for developing maintainable software. Compiles itself in <1s with zero library dependencies. Supports automatic C => V translation. https://vlang.io
vult - Vult is a transcompiler well suited to write high-performance DSP code
Odin - Odin Programming Language
GLhf - OpenGL Application Abstraction
Beef - Beef Programming Language
peridot - A fast functional language based on two level type theory
awesome-low-level-programming-languages - A curated list of low level programming languages (i.e. suitable for OS and game programming)
carbon-lang - Carbon Language's main repository: documents, design, implementation, and related tools. (NOTE: Carbon Language is experimental; see README)
Cwerg - The best C-like language that can be implemented in 10kLOC.
awesome-programming-languages - The list of an awesome programming languages that you might be interested in