cognate
BQN
cognate | BQN | |
---|---|---|
5 | 50 | |
204 | 843 | |
0.5% | - | |
7.2 | 8.7 | |
5 months ago | 14 days ago | |
C | KakouneScript | |
BSD 2-clause "Simplified" License | ISC 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.
cognate
-
Uiua: A minimal stack-based, array-based language
Reminds me a bit of Cognate(https://github.com/cognate-lang/cognate/blob/master/INTRODUC...)
Think I would like Uiua more if it require a space between terms. It wouldn’t be quite as tacit but it would be easier to read and more flexible — you could multi-symbol operators.
-
Two esoteric but maybe useful language ideas
Cognate happens to be a simple & readable polish-notation stack language that compiles to C.
-
Flow - a little language I've been working on
This reminds me a lot of Cognate.
-
July 2022 monthly "What are you working on?" thread
Since discovering and being inspired by Cognate, I've begun work on somewhat of a sister language called Adduce, with u/stavro-mueller-beta's blessing. It's honestly been kind of a whirlwind so far - over the course of about a week, I threw together a hacky Javascript interpreter to sketch out my ideas for the language, then rewrote it in Haskell for more permanent development. The language is currently in a mostly working state, though missing a lot of features; the biggest pain points so far have been mostly related to scoping and exception handling, since I'm implementing a dynamically typed, interpreted, mostly-procedural language in a language that is very much neither, and I'd give a tentative guess that just figuring out how to make the latter work at all took over half the development time of the Haskell version so far.
- Cognate - concatenative programming in English prose
BQN
-
Bare minimum atw-style K interpreter for learning purposes
I recommend checking BQN at https://mlochbaum.github.io/BQN/ and the YouTube channel code_report by Conor Hoekstra (and also "Composition Intuition by Conor Hoekstra | Lambda Days 2023"). It is well documented.
-
YAML Parser for Dyalog APL
I don't put a lot of stock in the "write-only" accusation. I think it's mostly used by those who don't know APL because, first, it's clever, and second, they can't read the code. However, if I remember I implemented something in J 10 years ago, I will definitely dig out the code because that's the fastest way by far for me to remember how it works.
This project specifically looks to be done in a flat array style similar to Co-dfns[0]. It's not a very common way to use APL. However, I've maintained an array-based compiler [1] for several years, and don't find that reading is a particular difficulty. Debugging is significantly easier than a scalar compiler, because the computation works on arrays drawn from the entire source code, and it's easy to inspect these and figure out what doesn't match expectations. I wrote most of [2] using a more traditional compiler architecture and it's easier to write and extend but feels about the same for reading and small tweaks. See also my review [3] of the denser compiler and precursor Co-dfns.
As for being read by others, short snippets are definitely fine. Taking some from the last week or so in the APL Farm, {⍵÷⍨+/|-/¯9 ¯11+.○?2⍵2⍴0} and {(⍸⍣¯1+\⎕IO,⍺)⊂[⎕IO]⍵} seemed to be easily understood. Forum links at [4]; the APL Orchard is viewable without signup and tends to have a lot of code discussion. There are APL codebases with many programmers, but they tend to be very verbose with long names. Something like the YAML parser here with no comments and single-letter names would be hard to get into. I can recognize, say, that c⌿¨⍨←(∨⍀∧∨⍀U⊖)∘(~⊢∊LF⍪WS⍨)¨c trims leading and trailing whitespace from each string in a few seconds, but in other places there are a lot of magic numbers so I get the "what" but not the "why". Eh, as I look over it things are starting to make sense, could probably get through this in an hour or so. But a lot of APLers don't have experience with the patterns used here.
[0] https://github.com/Co-dfns/Co-dfns
[1] https://github.com/mlochbaum/BQN/blob/master/src/c.bqn
[2] https://github.com/mlochbaum/Singeli/blob/master/singeli.bqn
[3] https://mlochbaum.github.io/BQN/implementation/codfns.html
[4] https://aplwiki.com/wiki/Chat_rooms_and_forums
- k on pdp11
-
Uiua: Weekly challenge 242
Uiua is an interesting new language. Strongly influenced by APL and BQN, it's array-oriented and stack-based. To explore it briefly, I will walk through my solutions to this week's Perl weekly challenge (242).
-
Ask HN: What are the best / most accessible languages for blind programmers?
https://mlochbaum.github.io/BQN/
Forth and Lisps tend to be fairly visual syntax free as well.
I'm just speculating though, looking for someone with experience to confirm or rebuke.
-
Uiua: A minimal stack-based, array-based language
> Are there any other languages that use glyphs so heavily?
APL (the first, invented in the 1960s): https://en.wikipedia.org/wiki/APL_(programming_language)
BQN (a modern APL, looks like an inspiration for Uiua though I don't know): https://mlochbaum.github.io/BQN/
Too many smaller esoteric languages to count.
-
Ask HN: Best APL Keyboards. Any Ideas?
There is no need to have a specific keyboard. The actual solution depends on what APL you're using, but the principle is the same. The various symbols are available on the regular keys, and you use some way to indicate that you want the APL symbol rather than the regular symbol.
Dyalog has two different IDE's the support this. Ride uses backquote by default, while the windows IDE uses control.
Kap uses backquote in all its interfaces. Here's what it looks like in the web version: https://kapdemo.dhsdevelopments.com/clientweb2/
Likewise, BQN does the same thing, but uses backslash: https://mlochbaum.github.io/BQN/
When using GNU APL there is an Emacs mode available (which I am the author of) that provides an input method.
So the long story short, you should be able to get going with any array language without getting any special keyboard.
-
Is there a programming language that will blow my mind?
Vouch for array programming, but also BQN. Modern, very good documentation, a bit less confusing than APL imo.
-
Suggestivity and Idioms in APL
For anyone looking to get into array programming, I'd recommend https://mlochbaum.github.io/BQN/. I'm no expert but I had a lot of fun using it for Advent of Code last year. I found it to be a lot more sensible and modern feeling than J (the only other one I've tried).
-
K: We need to talk about group
There’s also at least BQN, which I suspect is the language used in those comments:
https://mlochbaum.github.io/BQN/
What are some alternatives?
cane - A small MIDI sequencer DSL designed around vectors and euclidean rhythms
APL - another APL derivative
uiua - A stack-based array programming language
Co-dfns - High-performance, Reliable, and Parallel APL
peridot - A fast functional language based on two level type theory
sbcl - Mirror of Steel Bank Common Lisp (SBCL)'s official repository
comet - Comet is a lightweight, fast programming language (remember to star and fork!)
type-system-j - adds an optional type system to J language
Forth-in-Charm - An implementation of Forth in the Charm scripting language.
Kbd - Alternative unified APL keyboard layouts (AltGr, Backtick, Compositions)
hook - The Hook Programming Language
futhark - :boom::computer::boom: A data-parallel functional programming language