Lazy evaluation alternative

[Kevin S. Millikin]

>>>>> "Chris" == Chris Clearwater <chris@sharkzone.com> writes:

    Chris> But also, this brings me to another idea!  Data structures
    Chris> should be built from lambdas and CPS!  For example, a list
    Chris> of integers: 1 : 2 : 3

    Chris> list = \c -> c 1 (\c -> c 2 nil)

How about just:

cons hd tl = \ c -> c hd tl

then we could write the usual accessors:

head xs = xs (\ hd tl -> hd)
tail xs = xs (\ hd tl -> tl)

This is a very, very old idea.
-- 
Kevin S. Millikin      Architecture Technology Corporation
Research Scientist     Specialists in Computer Architecture
(952)829-5864 x. 162   http://www.atcorp.com