blob: 71303b62e088a6d1756d45218c79bdeba51d4d99 (
plain) (
blame)
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
|
<!DOCTYPE html>
<html>
<head>
<meta charset="UTF-8" />
<meta name="viewport" content="width=device-width" />
<link rel="stylesheet" href="style.css" type="text/css" media="all">
<title>bruijn</title>
</head>
<body>
<div class="header">
<img src="res/logo.png" />
<h1>bruijn</h1>
</div>
<div class="example">
<pre class="code">
<span class="def">pow</span> <span class="term">[<span class="symbol">…!!…</span> (<span class="symbol">iterate</span> (<span class="symbol">…⋅…</span> 0) <span class="ternary">(+1)</span>)]</span>
<span class="def">…**…</span> <span class="symbol">pow</span>
<span class="com">:test</span> <span class="test">(<span class="term"><span class="ternary">(+2)</span> <span class="mixfix">**</span> <span class="ternary">(+3)</span> <span class="mixfix">=?</span> <span class="ternary">(+8)</span></span>)</span> <span class="test">(<span class="symbol">true</span>)</span></pre>
<p>
Functional language based on pure bruijn-indexed lambda calculus.
</p>
</div>
<div class="bar small">
<b>Hint</b>: Click on anything you don't understand.
</div>
<div class="example">
<p>
Lambdas all the way down.<br>
No primitive functions.
</p>
<pre class="code">
<span class="repl">></span> <span class="ternary">(+5)</span>
<span class="term">[[[[2 (2 (1 3))]]]]</span>
<span class="repl">></span> <span class="char">'a'</span>
<span class="term">[[[1 (0 (0 (0 (0 (1 (1 (0 2)))))))]]]</span>
<span class="repl">></span> <span class="symbol">add</span>
<span class="term">[[(([([[1 0 [[0]]]] ((((0 [[(((0...</span></pre>
</div>
<div class="example">
<pre class="code">
<span class="repl">></span> <span class="com">:time</span> <span class="symbol">factorial</span> <span class="ternary">(+30)</span>
<span class="time">0.15 seconds</span></pre>
<p>
Efficient call-by-need reduction using abstract machines.
</p>
</div>
<div class="example">
<p>
Substantial standard library.<br>
<a href="std/">Docs</a>
</p>
<pre class="code">
<span class="repl">></span> <span class="mixfix">∏</span> <span class="ternary">(+1)</span> <span class="mixfix">→</span> <span class="ternary">(+3)</span> <span class="mixfix">|</span> <span class="symbol">++‣</span>
<span class="repl">></span> <span class="symbol">number!</span> <span class="mixfix"><$></span> <span class="left-app">(</span><span class="symbol">lines</span> <span class="string">"42\n25"</span><span class="right-app">)</span>
<span class="repl">></span> <span class="term"><span class="symbol">sum</span> (<span class="symbol">take</span> <span class="ternary">(+3)</span> (<span class="symbol">repeat</span> <span class="ternary">(+4)</span>))</span>
<span class="repl">></span> <span class="binary">(+10b)</span> <span class="mixfix">⋀!</span> <span class="binary">(+12b)</span></pre>
</div>
<div class="example">
<pre class="code">
$ echo "main [0]" > echo.bruijn
$ bruijn -b echo.bruijn > echo
$ wc -c echo
2 echo
$ echo "hello world!" | bruijn -e echo
hello world!</pre>
<p>
Compilation to Tromp's binary lambda calculus.<br>
Support for byte and ASCII encoding.
</p>
</div>
<div class="bar big">
Learn more: <a href="https://github.com/marvinborner/bruijn">GitHub</a>
</div>
<div class="instructions">
<h1>Installation</h1>
<pre class="code">
$ git clone https://github.com/marvinborner/bruijn.git && cd bruijn
$ <span class="stack">stack</span> run # for playing around
$ <span class="stack">stack</span> install
$ bruijn</pre>
</div>
<div class="instructions">
<h1>Broogle</h1>
<pre class="code">
$ ./broogle.sh -f add
<span class="def">add</span> ⧗ Unary → Unary → Unary
also known as <span class="def">…+…</span>
in std/Number/Unary.bruijn:35
# adds two unary numbers
...</pre>
</div>
<div class="instructions">
<h1>Syntax highlighting</h1>
<ol>
<li>Use vim and vim-plug</li>
<li>Add "Plug 'marvinborner/bruijn', { 'rtp': 'editors/vim' }" to your .vimrc</li>
<li>Run :PlugInstall</li>
</ol>
Learn more: <a href="https://github.com/marvinborner/bruijn/tree/main/editors">GitHub</a>
</div>
<div class="instructions">
<h1>Why?</h1>
<ul>
<li>Compiled binary lambda calculus is incredibly expressive and tiny. Read the articles by <a href="https://justine.lol/lambda/#why">Justine</a> and <a href="https://tromp.github.io/cl/cl.html">Tromp</a>.</li>
<li>Exploring different encodings of data as function abstractions is fascinating.</li>
<li>Pure lambda calculus can be very beautiful. You will understand if you try to have some fun with it.</li>
<li>I don't like naming parameters of functions. Using bruijn indices is a universal reference independent of the function and can actually help readability if you're familiar enough.</li>
<li>Really, <a href="https://justforfunnoreally.dev/">just for fun</a>.</li>
</ul>
</div>
<div class="instructions">
<h1>Articles</h1>
<ul>
<!-- feel free to add your own -->
<li><a href="https://text.marvinborner.de/2023-04-06-01.html">The bruijn programming language</a></li>
<li><a href="https://text.marvinborner.de/2023-04-07-01.html">Data structures in pure lambda calculus</a></li>
</ul>
</div>
<div class="bar big">
Standard library: <a href="std/">Docs</a>
</div>
<script src="script.js" charset="utf-8"></script>
</body>
</html>
|
