Binary Lambda Calculus
Binary lambda calculus (BLC) is a minimal Turing-complete programming language represented in bits or bytes. It allows for input and output, distinguishing it from similar binary languages. The syntax and operational commands of BLC enable complex computations using a sequence of bits.
- ▪BLC is capable of input and output, unlike Binary combinatory logic.
- ▪The program syntax consists of sequences of bits read from left to right.
- ▪BLC can implement SKI combinator calculus and operates on streams of bits.
Opening excerpt (first ~120 words) tap to expand
Binary lambda calculus (BLC) is an extremely small Turing-complete language which can be represented as a series of bits or bytes. Unlike Binary combinatory logic, another binary language with a similar acronym, it is capable of input and output. Contents 1 BLC Syntax 2 Basic Program Information 3 SKI combinator calculus 4 BLC8 5 Programs (BLC) 5.1 self-interpreter 5.2 prime number sieve 5.3 Brainfuck interpreter 5.4 Universal Turing Machine 6 Programs (BLC8) 6.1 self-interpreter 7 Computational Class 8 See Also 9 External Resources BLC Syntax The BLC program is a sequence of bits read left to right. The following commands are defined. Feel free to change how the commands are explained if you think it's too confusing.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Esolangs.
Discussion
0 commentsMore from Esolangs
