FunC: A Functional Compressor

FunC compresses a tree by a λ-term that evaluates to the tree. For example, a term a(a(a(a(a(a(a(a(a(a(a(a(a(a(a(a c))))))))))))))), which contains 16-time occurrences of a, is compressed into a λ-term (λf. (f f) f a c) (λs.λz.s (s z)). You can try FunC by writing a tree in the following text area and press the ”Compress“ button.

Optimize by: , #iterations: , #Search Depth: ,