1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
# Bruijn
A purely academic programming language based on lambda calculus and De
Bruijn indices written in Haskell.
## Features
- De Bruijn indices\[0\] eliminate the complexity of α-equivalence and
α-conversion
- Unique bracket-style representation for lambda abstractions enables
improved human-readability and faster syntactic perception
- Balanced ternary allows negative numbers while having a reasonably
compact representation, operator and time complexity (in comparison
to unary/binary church numerals)\[1\]
- Highly space-efficient compilation to binary lambda calculus
(BLC)\[2\]\[3\] additionally to normal interpretation and REPL
- Recursion can be implemented using combinators such as Y or ω
- Included standard library featuring many useful functions
(`std.bruijn`)
## Basics
### De Bruijn indices
De Bruijn indices\[0\] replace the concept of variables in lambda
calculus. The index basically represents the abstraction layer you want
to reference beginning at 0 with the innermost layer.
For example, λx.x becomes λ0 because x referenced the first abstraction
layer. Furthermore, λx.λy.xy becomes λλ10 and so forth.
You can read more about De Bruijn indices on
[Wikipedia](https://en.wikipedia.org/wiki/De_Bruijn_index).
### Syntax
In general the syntax is pretty similar to the previously presented
normal lambda calculus syntax with De Bruijn indices.
You can use any function that you’ve previously defined. You can also
overwrite previously defined functions. The environment gets interpreted
from down to top.
The following are the main syntax specifications in the (minorly
extended) [Backus-Naur
form](https://en.wikipedia.org/wiki/Backus%E2%80%93Naur_form). Spaces
are optional but allowed.
<identifier> ::= [a-ω,A-Ω,_][a-ω,A-Ω,0-9,?,!,',_]*
<abstraction> ::= "[" <expression> "]"
<numeral> ::= ("+" | "-")[0-9]+
<bruijn> ::= [0-9]
<singleton> ::= <bruijn> | <numeral> | <abstraction> | "(" <application> ")" | <identifier>
<application> ::= <singleton> <singleton>
<expression> ::= <application> | <singleton>
<test> ::= ":test " <expression> = <expression>
<import> ::= ":import " <path>
<comment> ::= "# " <letter>*
The following are the differences in syntax between REPL and file:
**For files**:
The execution of a file begins at the `main` function. Its existence is
mandatory.
<print> ::= ":print " <expression>
<definition> ::= <identifier> <expression>
<line> ::= <definition> | <print> | <comment> | <import> | <test> | "\n"
**For REPL**:
<definition> ::= <identifier> = <expression>
<line> ::= <definition> | <expression> | <comment> | <import> | <test> | "\n"
### Standard library
You may want to use the included standard library to reach your
program’s full potential. It includes many common combinators as well as
functions for numerical, boolean and IO operations and much more.
You can import it from `std.bruijn` using `:import std`.
### Examples
Plain execution
# equivalent of λx.x
id [0]
# equivalent of (λx.x) (λx.λy.x) = λx.λy.x
:test id [[1]] = [[1]]
# endless loop using omega combinator
om [0 0]
nom om
main om nom
Using standard library
:import std
# equivalent of (λx.x) (λx.λy.x) = λx.λy.x
outer id [[1]]
:test outer = [[1]]
# pairs
me [[[1]]]
you [[[2]]]
love pair me you
:test fst love = me
:test snd love = you
# boolean
main not (or (and false true) true)
:test main = [0]
### Compilation to BLC
You can compile bruijn to John Tromp’s BLC\[2\]\[3\]. Only the used
functions actually get compiled in order to achieve a minimal binary
size.
BLC uses the following encoding:
| term | lambda | bruijn | BLC |
|:-------------|:-------|:-------|:-----------------|
| abstraction | λM | \[M\] | 00M |
| application | MN | MN | 01MN |
| bruijn index | i | i | 1<sup>i+1</sup>0 |
## Installation
You first need to install Haskell and Haskell Stack using the guidelines
of your operating system.
Using Haskell Stack, run `stack run -- [args]` to play around and use
`stack install` to install bruijn into your path.
## REPL config
You can configure the REPL by editing the `config` file. `stack install`
or `stack run` will move the file into a data directory.
More options can be found
[here](https://github.com/judah/haskeline/wiki/UserPreferences).
## Usage
Please read the usage information in the executable by using the `-h`
argument.
## References
- \[0\] De Bruijn, Nicolaas Govert. “Lambda calculus notation with
nameless dummies, a tool for automatic formula manipulation, with
application to the Church-Rosser theorem.” Indagationes Mathematicae
(Proceedings). Vol. 75. No. 5. North-Holland, 1972.
- \[1\] Mogensen, Torben. “An investigation of compact and efficient
number representations in the pure lambda calculus.” International
Andrei Ershov Memorial Conference on Perspectives of System
Informatics. Springer, Berlin, Heidelberg, 2001.
- \[2\] Tromp, John. “Binary lambda calculus and combinatory logic.”
Randomness and Complexity, from Leibniz to Chaitin. 2007. 237-260.
- \[3\] Tromp, John. “Functional Bits: Lambda Calculus based
Algorithmic Information Theory.” (2022).
|
