[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Combinators & Compilation

In article <4232@brahma.cs.hw.ac.uk> greg@cs.hw.ac.uk (Greg Michaelson) writes:
>Indeed, is there any evidence that graph reduction will ever be as time/space
>efficient as traditional compilation techniques for functional languages
>on Von Neumann architectures?

Surely graph reduction *is* the traditional technique.  What did you have
in mind?
--
Richard Kennaway          SYS, University of East Anglia, Norwich, U.K.
Internet:  jrk@sys.uea.ac.uk		uucp:  ...mcvax!ukc!uea-sys!jrk