Newsgroups: comp.lang.scheme
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!oitnews.harvard.edu!purdue!haven.umd.edu!news.umbc.edu!eff!news.duke.edu!news.mathworks.com!tank.news.pipex.net!pipex!uknet!newsfeed.ed.ac.uk!edcogsci!jeff
From: jeff@cogsci.ed.ac.uk (Jeff Dalton)
Subject: Re: Is Garbage Collection faster?
Message-ID: <DGI23o.vr@cogsci.ed.ac.uk>
Organization: Centre for Cognitive Science, Edinburgh, UK
References: <44uskp$4g6@news.inc.net> <450m7f$77h@camelot.ccs.neu.edu> 	<DFzHB6.654@cogsci.ed.ac.uk> <KANDERSO.95Oct7105511@lager.bbn.com> <45h1g6$g37@news.parc.xerox.com>
Date: Sun, 15 Oct 1995 17:04:05 GMT
Lines: 11

boehm@parc.xerox.com (Hans Boehm) writes:

>4) Many C compilers are also quite good at tail recursion elimination.
>Claiming this as an advantage of Scheme/Lisp is at best only partially
>correct.

Are they good at it in general, or only for (say) self-calls?

Can anyone here say what gcc does?

-- jeff
