tailspin-v0
boba
Our great sponsors
tailspin-v0 | boba | |
---|---|---|
16 | 9 | |
31 | 48 | |
- | - | |
7.5 | 2.3 | |
2 months ago | 12 months ago | |
Java | F# | |
MIT License | MIT License |
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.
tailspin-v0
- 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.
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.
What are some alternatives?
Argon - Argon programming language
Forscape - Scientific computing language
never - Never: statically typed, embeddable functional programming language.
wort - A core concatenative programming language with variables and first-rank polymorphic type inference
bluebird - A work-in-progess programming language modeled after Ada and C++
butter - A tasty language for building efficient software. WIP
Odin - Odin Programming Language
xvm - Ecstasy and XVM
frozen - a header-only, constexpr alternative to gperf for C++14 users
awesome-low-level-programming-languages - A curated list of low level programming languages (i.e. suitable for OS and game programming)
mlscript - The MLscript programming language. Functional and object-oriented; structurally typed and sound; with powerful type inference. Soon to have full interop with TypeScript!