Category:Bruijn
This programming language may be used to instruct a computer to perform a task.
| Official website |
|---|
| Execution method: | Interpreted |
|---|---|
| See Also: |
|
Bruijn is a functional programming language based on pure lambda calculus. It uses De Bruijn indices instead of named variables and square brackets for abstractions. Like pure lambda calculus, bruijn can be compiled to Binary Lambda Calculus. Unlike pure lambda calculus, you can define named substitution rules. Bruijn has a large standard library of such definitions.
Bruijn does not have primitive functions or data types. Every function (including add, map, mul, etc.) is implemented in bruijn itself. Numbers, strings, or chars are syntactic sugar for data encoded as closed terms/abstractions.
Documentation can be found at https://bruijn.marvinborner.de/wiki/.
Pages in category "Bruijn"
The following 37 pages are in this category, out of 37 total.