blob: c1abc8aac319270f331613969788f7f579631a13 (
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
|
# IO
Bruijn supports a variant of John Tromp's monadic IO[^1].
Every program's `main`{.bruijn} function has an additional abstraction
that gets applied with a lazy list of input bytes. These bytes are
encoded as the syntactic sugar encoding of binary numbers, which can be
manipulated with [`std/Number/Binary`](/std/Number_Binary.bruijn.html).
You can use [`std/Monad`](/std/Monad.bruijn.html) to interact with the
input monadically, or simply use [`std/List`](/std/List.bruijn.html)
operations to work with the input as a normal list.
See [data structures](data-structures.md) to learn more about lists and
numbers.
If you want your main function to ignore the input, just add an
additional (unbound) abstraction to your definition.
## Example
``` bruijn
:import std/List .
# reverse the input list
main [<~>0]
```
``` bash
$ printf "tacocat" | bruijn reverse.bruijn
tacocat
```
[^1]: [Tromp, John. "Functional Bits: Lambda Calculus based Algorithmic
Information Theory." (2023).](https://tromp.github.io/cl/LC.pdf)
|
