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

Re: Combinators & Compilation

To: scheme@mc.lcs.mit.edu
Subject: Re: Combinators & Compilation
From: Greg Michaelson <mcsun!ukc!edcastle!hwcs!greg@uunet.uu.net>
Date: Tue ,30 Jan 90 07:30:36 EDT
Organization: Computer Science, Heriot-Watt U., Scotland
References: <387CZXC@cs.swarthmore.edu>
Sender: scheme-request@mc.lcs.mit.edu

 From article <387CZXC@cs.swarthmore.edu>, by taylor@cs.swarthmore.edu (Brian Taylor):
> I'd also appreciate references to any particularly valuable articles in the
> literature providing a theoretical justification for the use of graph 
> reduction in the interpretation of combinatory logic and lambda calculus.

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?

Follow-Ups:
- Re: Combinators & Compilation
  - From: Richard Kennaway CMP RA <mcsun!ukc!sys.uea!jrk@uunet.uu.net>

References:
- Combinators & Compilation
  - From: Brian Taylor <cbmvax!vu-vlsi!swatsun!taylor@rutgers.edu>

Prev by Date: Extend-syntax sources
Next by Date: Scheme in Forth?
Previous by thread: Combinators & Compilation
Next by thread: Re: Combinators & Compilation
Index(es):
- Date
- Thread