Thu Aug 6 16:44:38 CEST 2009
Lists vs. applications
Currently the implementation doesn't distinguish between applications
and lists. The CEK machine doesn't deal with `constructors' which are
essentially non-evaluated functions.
I don't really know how this is done in practice. Let's just wrap
code in a syntax object for now.
This seems to work. There are now two kinds of terms: non-reduced
terms are SYNTAX while reduced terms are anything else.
Anyways.. It works, but it's probably a bit unorthodox. This can't
represent syntax as values. The real solution would be to represent
special forms, applications, variables references and quotes as
This will have to do for now.