BQN
CBQN
Our great sponsors
BQN | CBQN | |
---|---|---|
49 | 4 | |
831 | 292 | |
- | - | |
8.9 | 9.6 | |
14 days ago | 14 days ago | |
KakouneScript | C | |
ISC License | GNU General Public License v3.0 only |
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.
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
- k on pdp11
-
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.
-
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.
-
K: We need to talk about group
There’s also at least BQN, which I suspect is the language used in those comments:
- APL: An Array Oriented Programming Language (2018)
- Show HN: Glidesort, a new stable sort in Rust up to ~4x faster for random data
-
-🎄- 2022 Day 1 Solutions -🎄-
Well, a former Dyalog APL developer did go on to create his own language based on ideas from APL called BQN, which is touted as "an APL for your flying saucer"
-
I spent the last 2 months converting APL primitives into executable NumPy
The latest APL-INSPIRED and in my opinion, best array language, is BQN: https://github.com/mlochbaum/BQN
CBQN
-
Building a faster hash table for high performance SQL joins
Worth pointing out that this can depend a lot more on fiddly details than you might expect. In particular, you're dealing with a small fixed width allowing the hash to be stored in the table instead of the key. The article emphasizes variable-length keys, and I don't see any specialization on key sizes (if 4- and 8-byte keys aren't common then this makes sense; if they are then I'd expect dedicated table code for those sizes to be valuable). And set lookups are also just a bit different from value lookups. I think these cases are different enough that I have no idea if the results would carry over, although I can see how the bidirectional approach would reduce probing more than RH which seems good.
...and since I've done a lot of work with Robin Hood on small-key lookups, I can point out some little tweaks that have made a big difference for me. I have 8-byte lookups at just over 3ns/lookup[0], albeit at a very low load factor, typically <50%. A key step was to use the maximum possible hash as a sentinel value, handling it specially in case it shows up in the data. This way, instead of probing until finding an empty bucket or greater hash, probing just finds the first slot that's greater than or equal to the requested key's hash. So the lookup code[1] is very simple (the rest, not so much). The while loop is only needed on a hash collision, so at a low load factor a lookup is effectively branchless. However, these choices are specialized for a batched search where the number of insertions never has to be higher than the number of searches, and all the insertions can be done first. And focused on small-ish (under a million entries) tables.
[0] https://mlochbaum.github.io/bencharray/pages/search.html
[1] https://github.com/dzaima/CBQN/blob/5c7ab3f/src/singeli/src/...
-
Having trouble installing bqn into arch
It sounds like you might be trying to install the package manually from the AUR? Generally you should do this only once, for an AUR helper such as pacaur, so you can install with pacaur -S bqn. The instructions in the CBQN repository also work for installing without a package manager, which is the easiest way to enable replxx.
-
BQN Example
CBQN Source, and Install Instructions
What are some alternatives?
APL - another APL derivative
Co-dfns - High-performance, Reliable, and Parallel APL
sbcl - Mirror of Steel Bank Common Lisp (SBCL)'s official repository
Kbd - Alternative unified APL keyboard layouts (AltGr, Backtick, Compositions)
type-system-j - adds an optional type system to J language
TablaM - The practical relational programing language for data-oriented applications
futhark - :boom::computer::boom: A data-parallel functional programming language
j-prez
array - Simple array language written in kotlin
april - The APL programming language (a subset thereof) compiling to Common Lisp.
jelm - Extreme Learning Machine in J
pyret-lang - The Pyret language.