BQN
BQN is an APLfamily language designed primarily by Marshall Lochbaum. Although it maintains the concept of arraydriven computing and much of APL's array functionality, BQN discards all compatibility with other array languages and changes many fundamental concepts. It uses the based array model with dedicated array notation, distinguishes between data types and expression roles to give the language a contextfree grammar with firstclass functions, and uses a new set of glyphs with different primitive pairings. The language uses the leading axis model and tacit programming as core paradigms. Its implementation is largely selfhosted, with an arraybased compiler like Codfns.
Primitives
Functions
Glyph  Monadic  Dyadic 

+ 
Conjugate  Add 
 
Negate  Subtract 
× 
Sign  Multiply 
÷ 
Reciprocal  Divide 
⋆ 
Exponential  Power 
√ 
Square Root  Root 
⌊ 
Floor  Minimum 
⌈ 
Ceiling  Maximum 
∧ 
Sort Up  And 
∨ 
Sort Down  Or 
¬ 
Not  Span 
 
Absolute Value  Modulus 
≤ 
Less Than or Equal to  
< 
Enclose  Less Than 
> 
Merge  Greater Than 
≥ 
Greater Than or Equal to  
= 
Rank  Equals 
≠ 
Length  Not Equals 
≡ 
Depth  Match 
≢ 
Shape  Not Match 
⊣ 
Identity  Left 
⊢ 
Identity  Right 
⥊ 
Deshape  Reshape 
∾ 
Join  Join to 
≍ 
Solo  Couple 
↑ 
Prefixes  Take 
↓ 
Suffixes  Drop 
↕ 
Range  Windows 
» 
Nudge  Shift Before 
« 
Nudge Back  Shift After 
⌽ 
Reverse  Rotate 
⍉ 
Transpose  Reorder axes 
/ 
Indices  Replicate 
⍋ 
Grade Up  Bins Up 
⍒ 
Grade Down  Bins Down 
⊏ 
First Cell  Select 
⊑ 
First  Pick 
⊐ 
Classify  Index of 
⊒ 
Occurrence Count  Progressive Index of 
∊ 
Unique Mask  Member of 
⍷ 
Deduplicate  Find 
⊔ 
Group Indices  Group 
Modifiers
1modifiers in BQN use superscript symbols, while 2modifiers use symbols with a circle, but not one with a line through it like ⌽
and ⍉
.


Some modifiers are closely related, and some of their glyphs are intended to allude to this:
 The three 1modifers Cells (
𝔽˘
), Each (𝔽¨
), and Undo (𝔽⁼
) are equivalent to using a rightoperand of¯1
with the 2modifiers Rank (𝔽⎉¯1
), Depth (𝔽⚇¯1
), and Repeat (𝔽⍟¯1
). Therefore the 2modifiers are circled versions of the 1modifiers (except in the case of Undo/Repeat).  Under (
𝔽⌾𝔾
) is in principle equivalent to𝔾⁼∘𝔽○𝔾
. Therefore,⌾
is a combination of the glyphs∘
and○
.
References
APL dialects [edit]  

Maintained  APL+Win ∙ APL2 ∙ APL64 ∙ APL\iv ∙ Aplette ∙ April ∙ Codfns ∙ Dyalog APL ∙ dzaima/APL ∙ Extended Dyalog APL ∙ GNU APL ∙ KAP ∙ NARS2000 ∙ Pometo 
Historical  A Programming Language ∙ A+ (A) ∙ APL# ∙ APL\360 ∙ APL/700 ∙ APL\1130 ∙ APL\3000 ∙ APL.68000 ∙ APL*PLUS ∙ APL.jl ∙ APL.SV ∙ APLX ∙ Iverson notation ∙ IVSYS/7090 ∙ NARS ∙ ngn/apl ∙ openAPL ∙ PAT ∙ Rowan ∙ SAX ∙ SHARP APL ∙ Rationalized APL ∙ VisualAPL (APLNext) ∙ VS APL ∙ York APL 
Derivatives  AHPL ∙ BQN ∙ CoSy ∙ ELI ∙ Glee ∙ I ∙ Ivy ∙ J ∙ Jelly ∙ Jellyfish ∙ K (Q, KDB+) ∙ Nial ∙ RAD 
Overviews  Timeline of array languages ∙ Timeline of influential array languages ∙ Family tree of array languages 