elvm VS AIT

ELVM lacks a lot of features, but serve the purpose of simplifying the creation of new frontends.

How does it work? Is it translating the C source code of the 8cc C compiler to lambda calculus?

So like C -> ELVM IR -> lambda calculus?

https://github.com/shinh/elvm

If so, it seems like 8cc is doing most of the heavy lifting

Interested parties should also check out awka (https://github.com/noyesno/awka) and ELVM (which can compile C into awk or sed, among various other things) (https://github.com/shinh/elvm)

Oh yeah, there's a compiler that can compile C to sed.

Would be interesting to have some small C program such as info-zip compiled to bf via ELVM [1] and do a speed comparison.

https://github.com/shinh/elvm

A C compiler that can output Malbolge (among many other esolangs) can be found at https://github.com/shinh/elvm - dunno if it has any relation to this work.

Note that the Malbolge (or rather LMAO/HeLL) backend was added back in July 2019, so I'm not so sure about their claim that "It's as of 2020 and 2021, the most advanced, usable Malbolge program ever created."

You are looking for ELVM: https://github.com/shinh/elvm/

It is described in https://github.com/tromp/AIT/blob/master/fast_growing_and_co...

A = λxλyλz. x z (y (λ_.z)), which is encoded as bit 0 (left branch), while bit 1 (right branch) encodes prefix application.

[1] https://github.com/tromp/AIT/blob/master/ait/allA.lam

I expect so, as the author is familiar with my tools [1] for doing these optimizations.

[1] https://github.com/tromp/AIT

Haskell is not far from being a layer of syntactic sugar on top of the lambda calculus.

For an example of a non-trivial program, see this binary lambda calculus self-interpreter: https://github.com/tromp/AIT/blob/master/uni.lam

While Goodstein sequences do get really long quite fast, they're not that easy to code. This [1] binary lambda calculus program may be the shortest possible, but still takes 351 bits. Meanwhile, in a mere 215 bits, we can encode a Laver table [2] program that potentially grows so much faster than Goodstein, that it's not even provable in ZFC [3].

[1] https://github.com/tromp/AIT/blob/master/goodstein.lam

[2] https://github.com/tromp/AIT/blob/master/laver.lam

[3] https://codegolf.stackexchange.com/questions/79620/laver-tab...