Re:The Roots of Lisp (2002) [pdf]
by tromp on Monday September 22, 2014 @01:33PM
(#8351525)
The paper concludes that a "remarkably elegant model of computation" can be made using just 7 primitive operators,
which allows for defining a self-interpreter.
In fact, 0 primitive operators suffice, as the ability to
denote functions (Section 2) gives us the Turing complete lambda calculus.
A self-interpreter for a version of lambda calculus denoted in binary fits in under 26 bytes, as shown on http://www.cwi.nl/~tromp/cl/cl.html
In fact, 0 primitive operators suffice, as the ability to denote functions (Section 2) gives us the Turing complete lambda calculus.
A self-interpreter for a version of lambda calculus denoted in binary fits in under 26 bytes, as shown on http://www.cwi.nl/~tromp/cl/cl.html