Category:BQN: Difference between revisions
Content added Content deleted
(absolute dating) |
No edit summary |
||
| Line 3: | Line 3: | ||
|exec=bytecode |
|exec=bytecode |
||
|gc=yes |
|gc=yes |
||
|site=https://mlochbaum.github.io/BQN |
|site=https://mlochbaum.github.io/BQN/ |
||
|parampass=value |
|parampass=value |
||
|safety=safe |
|safety=safe |
||
| Line 10: | Line 10: | ||
BQN is a new (initially released 2020) [[wp:Array programming|array oriented]], [[functional_programming|functional]] programming language in the [[APL]] lineage, which aims to remove irregular and burdensome aspects of the APL tradition and put the great ideas on a firmer footing. While its use demands a solid understanding of functions and multidimensional arrays, BQN's focus on providing simple, consistent, and powerful array operations (and documentation!) makes it a good language for learning array programming and building stronger array intuition. |
BQN is a new (initially released 2020) [[wp:Array programming|array oriented]], [[functional_programming|functional]] programming language in the [[APL]] lineage, which aims to remove irregular and burdensome aspects of the APL tradition and put the great ideas on a firmer footing. While its use demands a solid understanding of functions and multidimensional arrays, BQN's focus on providing simple, consistent, and powerful array operations (and documentation!) makes it a good language for learning array programming and building stronger array intuition. |
||
Documentation can be found at https://mlochbaum.github.io/BQN. |
Documentation can be found at https://mlochbaum.github.io/BQN/doc/. |
||
==Todo== |
|||
[[Tasks_not_implemented_in_BQN]] |
|||
Latest revision as of 12:06, 13 November 2023
This programming language may be used to instruct a computer to perform a task.
| Official website |
|---|
| Execution method: | Compiled (bytecode) |
|---|---|
| Garbage collected: | Yes |
| Parameter passing methods: | By value |
| Type safety: | Safe |
| Type checking: | Dynamic |
| See Also: |
BQN is a new (initially released 2020) array oriented, functional programming language in the APL lineage, which aims to remove irregular and burdensome aspects of the APL tradition and put the great ideas on a firmer footing. While its use demands a solid understanding of functions and multidimensional arrays, BQN's focus on providing simple, consistent, and powerful array operations (and documentation!) makes it a good language for learning array programming and building stronger array intuition.
Documentation can be found at https://mlochbaum.github.io/BQN/doc/.
Todo
Pages in category "BQN"
The following 200 pages are in this category, out of 272 total.
(previous page) (next page)2
A
- A+B
- Abbreviations, automatic
- ABC problem
- Abelian sandpile model
- Accumulator factory
- Ackermann function
- Align columns
- Anagrams
- Angle difference between two bearings
- Anonymous recursion
- Apply a callback to an array
- Archimedean spiral
- Arithmetic-geometric mean
- Arithmetic/Integer
- Array concatenation
- Array length
- Arrays
- Assertions
- Averages/Arithmetic mean
- Averages/Median
- Averages/Mode
- Averages/Pythagorean means
- Averages/Root mean square
- Averages/Simple moving average
B
C
- Caesar cipher
- Calculating the value of e
- Calkin-Wilf sequence
- Call a function
- Cantor set
- Catalan numbers
- Catamorphism
- Character codes
- Check that file exists
- Chinese remainder theorem
- Classes
- Code Golf: Code Golf
- Collect and sort square numbers in ascending order from three lists
- Combinations
- Command-line arguments
- Comments
- Common list elements
- Common sorted list
- Compare a list of strings
- Compare length of two strings
- Conditional structures
- Conjugate a Latin verb
- Conway's Game of Life
- Coprimes
- Copy a string
- Count in octal
- Count occurrences of a substring
- Create a file
- Create a two-dimensional array at runtime
- Create an HTML table
- CSV data manipulation
- Currying
- Cycle detection
D
- Damm algorithm
- Days between dates
- Delete a file
- Detect division by zero
- Determine if a string has all the same characters
- Determine if a string has all unique characters
- Determine if a string is collapsible
- Determine if a string is numeric
- Digit fifth powers
- Digital root
- Disarium numbers
- Distinct power numbers
- Dot product
- Dragon curve
E
F
- Factorial
- Factors of an integer
- Fibonacci n-step number sequences
- Fibonacci sequence
- File input/output
- Filter
- Find first missing positive
- Find limit of recursion
- First-class functions
- FizzBuzz
- Flatten a list
- Forward difference
- Four sides of square
- Fractran
- Function composition
- Function definition
- Fusc sequence
G
H
I
L
- Lah numbers
- Langton's ant
- Largest five adjacent number
- Largest proper divisor of n
- Last list item
- Leap year
- Least common multiple
- Letter frequency
- Levenshtein distance
- Literals/Integer
- Logical operations
- Longest common subsequence
- Longest string challenge
- Longest substrings without repeating characters
- Look-and-say sequence
- Loops/Downward for
- Loops/Infinite
- Loops/While
- Luhn test of credit card numbers
M
- Magic squares of odd order
- Map range
- Matrix multiplication
- Matrix transposition
- Matrix with two diagonals
- Matrix-exponentiation operator
- McNuggets problem
- Miller–Rabin primality test
- Minimum number of cells after, before, above and below NxN squares
- Mosaic matrix
- Multifactorial
- Multiplication tables
- Munchausen numbers
- Munching squares
- Mutual recursion