000100011010000100000101010110110000010110110011010 Equivalent to the term \\\(\(0 0) \(\\(0 1 \\0 1 1) (0 0))).
Since BLC has no graphical output, this solution assumes a screen as defined in this blog post.
The term has no normal form and generates an infinitely detailed Sierpinski triangle. Rendered using lambda-screen which stops after a finite amount of reductions:
000100011010000100000101010110110000010110110011010 Equivalent to the term \\((0 0) \(\\(0 1 \\0 1 1) (0 0))).
Since BLC has no graphical output, this solution assumes a screen as defined in this blog post.
The term has no normal form and generates an infinitely detailed Sierpinski triangle. Rendered using lambda-screen which stops after a finite amount of reductions:
000100011010000100000101010110110000010110110011010 Equivalent to the term \(\(0 0) \(\\(0 1 \\0 1 1) (0 0))).
Since BLC has no graphical output, this solution assumes a screen as defined in this blog post.
The term has no normal form and generates an infinitely detailed Sierpinski triangle. Rendered using lambda-screen which stops after a finite amount of reductions:
000100011010000100000101010110110000010110110011010 Equivalent to the term \\((0 0) \(\\(0 1 \\0 1 1) (0 0))).
Since BLC has no graphical output, this solution assumes a screen as defined in this blog post.
The term has no normal form and generates an infinitely detailed Sierpinski triangle. Rendered using lambda-screen which stops after a finite amount of reductions: