BQN documentation

Here is the documentation for BQN, describing what features BQN has, how to use them (with examples), and why they were chosen. As it is considerably more in-depth than the specification, the documentation is much less complete. The following pages are present now:

Overview:

• Syntax
• Types
• Primitives

Concepts:

• Based array theory
• Blocks (including function and modifier definition)
• Context-free grammar
• Control flow
• Functional programming
• Array indices
• The leading axis model
• Function trains

Primitives:

• Array depth (≡ and ⚇)
• Assert (!)
• Deshape and Reshape (⥊)
• Group (⊔)
• Join and Join To (∾)
• Logical functions (∧∨¬)
• Match (≡≢)
• Ordering functions (∧∨⍋⍒)
• Prefixes and Suffixes (↑↓)
• Self-comparison functions (⊐⊒∊⍷)
• Shift functions (»«)
• Solo, Couple, and Merge (≍>)
• Transpose (⍉)
• Windows (↕)

References:

• Glossary
• BQN-Dyalog dictionary
• BQN-J dictionary

Environment:

• Embedded BQN

Speculation:

• Possible language extensions