Shortest Universal Turing Machine Implementation

Discussion of Common Lisp

Re: Shortest Universal Turing Machine Implementation

Postby methusala » Wed Nov 04, 2009 8:35 am

That's an interesting link, here's another one I found: ... ssues.html

Set and Let aren't needed to write programs in a pure functional style. Some lispers like pg like that type of approach. Lambda is already part of the eval function defined above, the eval function is the key thing that creates a lisp out of those primitives. With eval you can pass functions as arguments, recurse, and write a macro system. After this first lisp interpreter was made, a combination approach of mixed compiling and interpreting was later invented.
Posts: 35
Joined: Fri Oct 03, 2008 6:35 pm


Return to Common Lisp

Who is online

Users browsing this forum: Google [Bot] and 5 guests