Path: utzoo!attcan!uunet!ginosko!husc6!spdcc!ima!esegue!compilers-sender
From: phh%ecs.southampton.ac.uk@NSFNET-RELAY.AC.UK (Pieter Hartel)
Newsgroups: comp.compilers
Subject: Re: Graph reduction, recursion and the Y combinator
Message-ID: <1989Sep30.160009.917@esegue.segue.boston.ma.us>
Date: 30 Sep 89 16:00:09 GMT
Sender: compilers-sender@esegue.segue.boston.ma.us
Reply-To: Pieter Hartel 
Organization: Compilers Central
Lines: 17
Approved: compilers@esegue.segue.boston.ma.us

In the paper Statistics on graph reduction of SASL programs (Software
Practice and Experience vol 18 no 3, 1988, pp 239-253) we report on
experiments with the cyclic and the non cyclic implementation of the Y
combinator. We found that if some program transformations are applied,
even with non-cyclic Y, the performance may be reasonable (a difference
of some 10% between cyclic and non cyclic Y). Some more information is
in chapter 4 of my PhD thesis (Performance analysis of Storage
Management in Combinator graph reduction, 1988). All our results pertain
to Tuner's method of combinator graph reduction and a benchmark of small
and medium size programs.

Pieter Hartel, Dept of Electr. and Comp. Sci, Univ. of Southampton, SO9 5HN, UK.

-- 
Send compilers articles to compilers@esegue.segue.boston.ma.us
{spdcc | ima | lotus}!esegue.  Meta-mail to compilers-request@esegue.
Please send responses to the author of the message, not the poster.