diff options
Diffstat (limited to 'docs/wiki_src/coding/compilation.md')
| -rw-r--r-- | docs/wiki_src/coding/compilation.md | 23 |
1 files changed, 12 insertions, 11 deletions
diff --git a/docs/wiki_src/coding/compilation.md b/docs/wiki_src/coding/compilation.md index 9863c21..330bc9f 100644 --- a/docs/wiki_src/coding/compilation.md +++ b/docs/wiki_src/coding/compilation.md @@ -1,6 +1,6 @@ # Compilation -Bruijn can be compiled to John Tromp’s binary lambda calculus (BLC). +Bruijn can be compiled to John Tromp's binary lambda calculus (BLC). BLC uses the following encoding: @@ -12,26 +12,27 @@ BLC uses the following encoding: There are two modes of compilation: -- **Bitwise** compiles to BLC and encodes every bit as 1 bit and pads - the last remaining byte: `bruijn -b path` -- **ASCII** compiles to BLC and encodes every bit as 1 ASCII character - (`'0'`/`'1'`): `bruijn -B path` +- **Bitwise** compiles to BLC and encodes every bit as 1 bit and pads + the last remaining byte: `bruijn -b path` +- **ASCII** compiles to BLC and encodes every bit as 1 ASCII character + (`'0'`/`'1'`): `bruijn -B path` ## Compilation overhead Typical compilation to BLC results in much redundant code, since every used function gets substituted and translated separately. In -`((+3) + (+4) + (+3))`, for example, `add` gets compiled to BLC two -times, resulting in a redundant overhead of around 3500 bits. +`((+3) + (+4) + (+3))`{.bruijn}, for example, `add`{.bruijn} gets +compiled to BLC two times, resulting in a redundant overhead of around +3500 bits. This is because BLC was never intended for compilation of normal programs, but mainly as an academic encoding model. This also means that -it’s quite good for writing very expressive and minimal programs -(i.e. obfuscated code golfing, see [John Tromp’s +it's quite good for writing very expressive and minimal programs +(i.e. obfuscated code golfing, see [John Tromp's IOCCC](https://ioccc.org/2012/tromp/hint.html)). -Most programs, however, won’t be golfed and can result in rather large -compiled programs. While there’s not really any practical need for +Most programs, however, won't be golfed and can result in rather large +compiled programs. While there's not really any practical need for compilation aside from golfing, you could still use the [BLoC](https://github.com/marvinborner/bloc) project to optimize redundant terms. |