https://mlochbaum.github.io/BQN/

TODO

  1. https://mlochbaum.github.io/BQN/doc/quick.html

  2. BQN documentation

  3. https://mlochbaum.github.io/BQN/doc/fold.html

  4. https://mlochbaum.github.io/bqncrate/

  5. https://mlochbaum.github.io/BQN/tutorial/expression.html

    • Compound expressions are evaluated from right to left.

Motivation

Conor’s Running Product Exercise
But basically you’re given an array of numbers. So for instance we’ll call it 1 2 3 4 and you want to return another array of numbers which is equal to the product of each of them, but where you have removed one element each time.
— https://www.arraycast.com/episode-15-transcript
Solution 
×´⊸÷ 1‿2‿3‿4
# ⟨ 24 12 8 6 ⟩
Remove duplicate spaces, turning each sequence of spaces into one
(1⊸»⊸∨' '⊸≠)⊸/d1

 — https://mlochbaum.github.io/bqncrate/

Try BQN Online

Primitives

Table 1. Functions
Glyph Monadic Dyadic

×

Sign

Multiply

÷

Reciprocal

Divide
Table 2. Modifiers
Glyph Name(s) Definition Description

⊸

Before/Bind

{(𝔽 𝕨 ⊣ 𝕩)𝔾 𝕩}

𝔾’s left argument comes from 𝔽
Table 3. Array traversal and iteration control modifiers
1-Modifier Name 2-Modifier Name

´

Fold

Blocks

In BQN, a block is any piece of code surrounded with curly braces {}.
— https://mlochbaum.github.io/BQN/doc/block.html
Table 4. Special Names
Lowercase Uppercase Meaning

𝕩

𝕏

Right argument

𝕨

𝕎

Left argument, or Nothing (·)

𝕤

𝕊

Function self-reference

𝕗

𝔽

Left operand

𝕘

𝔾

Right operand

𝕣

none

Modifier self-reference