Fast switching..
Lionello Lunesu
lionello at lunesu.remove.com
Wed Jun 11 19:56:33 PDT 2008
"Regan Heath" <regan at netmail.co.nz> wrote in message
news:g2o13n$1oka$1 at digitalmars.com...
> Hi all,
>
> I've been AWOL from this NG for a while but recently a friend of mine sent
> me a link to this:
> http://blogs.msdn.com/jomo_fisher/archive/2007/03/28/fast-switching-with-linq.aspx
Isn't the internet great? I started on that page (interesting read) and a
few clicks later I ended up at
http://www.cs.cmu.edu/~rwh/theses/okasaki.pdf
"Purely Functional Data Structures", it's a paper from 1996! Some quotes:
"[S]trict languages can describe worst-case data structures, but not
amortized ones, and lazy languages can describe amortized data structures,
but not worst-case
ones. To be able to describe both kinds of data structures, we need a
programming language
that supports both evaluation orders."
"Functional programmers have long debated the relative
merits of strict and lazy evaluation. This thesis shows that both are
algorithmically im-
portant and suggests that the ideal functional language should seamlessly
integrate both."
More information about the Digitalmars-d
mailing list