pika
A WIP little dependently-typed systems language (by naalit)
tailspin-v0
A programming language with extreme data-pattern matching and data-declarative syntax, hopefully different enough to be interesting (by tobega)
pika | tailspin-v0 | |
---|---|---|
4 | 16 | |
35 | 34 | |
- | - | |
7.1 | 7.5 | |
about 1 month ago | 3 months ago | |
Rust | Java | |
GNU General Public License v3.0 or later | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
pika
Posts with mentions or reviews of pika.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-09-01.
-
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:
tailspin-v0
Posts with mentions or reviews of tailspin-v0.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-09.
- What languages have you learnt with AoC and now you love...or ended as "meh"?
-
Advent of Code 2023 in your language
I eventually tend to do all days in Tailspin. The ones I have done so far are in directories ending in "tt" (the others are in Pyret, just to get a feel for it) https://github.com/tobega/aoc2023/tree/main
-
I have great difficulties
As a general tip, it is often helpful to first try to think of how you would like to represent the data in your program. Then you need to parse the data into that structure. I'd recommend you to look at a PEG-parser, for example. Or if you like, look at my Tailspin programming language which has a very visual parser syntax and also very visual ways of creating data structures (if that should happen to be your mental affinity). Look at my day1 for example. Or if you're more mathematical, maybe a functional language (I also did day1 in Pyret)
-
An idea for a language focused around RxJs
My Tailspin language is based on processing streams of values, you might want to look at it https://github.com/tobega/tailspin-v0
-
[2022 Day 7] Solved in three different styles
Many people had trouble with the day 7 problem. Paradoxically, good developers probably had more trouble. Here some of the difficulties are explained and implementations are provided in imperative, functional and OO styles, written in the Tailspin programming language.
-
What codebases have the best or most educational unit/integration tests when implementing a programming language?
I test almost entirely from my language, that way the tests are independent of the implementation. Currently the tests are implemented in java because that fits the interpreter implementation https://github.com/tobega/tailspin-v0/tree/master/test/tailspin/samples
-
August 2022 monthly "What are you working on?" thread
Finished off the implementation of typed and offset array indices in Tailspin
-
March 2022 monthly "What are you working on?" thread
I ended up enabling left recursion in Tailspin's composer (parser) syntax. Much cleaner calculator example now.
-
Diamonds in the Rough : An Honest Trial for any Language
I think it's possible that Tailspin might be suitable for you.
-
Introducing Skiff, a gradually typed functional language written in Rust
I think gradual typing is definitely something worth exploring more. I thought it was a shame when Dart abandoned that path. Have you seen Shen ? I guess my small offering, Tailspin, is currently evolving to gradual typing as well.
What are some alternatives?
When comparing pika and tailspin-v0 you can also consider the following projects:
konna - A fast functional language based on two level type theory
Argon - Argon programming language
durin - the Dependent Unboxed higher-oRder Intermediate Notation
never - Never: statically typed, embeddable functional programming language.
bluebird - A work-in-progess programming language modeled after Ada and C++
boba - A general purpose statically-typed concatenative programming language.
rumi - The rumi compiler
starlight - JS engine in Rust
butter - A tasty language for building efficient software. WIP
c3c - Compiler for the C3 language
Odin - Odin Programming Language