Article View: comp.lang.prolog
Article #910Re: Bogus! (was Re: Proof that Prolog can be faster than C)
From: Vinod Grover
Date: Thu, 14 Jun 1990 01:09
Date: Thu, 14 Jun 1990 01:09
11 lines
1026 bytes
1026 bytes
In article <37011@ucbvax.BERKELEY.EDU> vanroy@pisces (Peter Van Roy) writes: >Please do not jump to conclusions. The Prolog implementation does *NOT* save >intermediate results from tak(a,b,c). It is doing *ALL* recursive calls. >(I wish the compiler were intelligent enough to do what you say it does :-). >The speed is due to straightforward compiler optimization. By the way, the Could you tell us what optimization is being performed that is lacking in C? Thanks Vinod Grover
Technical Details
Message-ID:
<137235@sun.Eng.Sun.COM>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sun-barr!newstop!sun!brahmand.Eng.Sun.COM!groverReferences:
<36986@ucbvax.BERKELEY.EDU> <1990Jun12.212525.25551@iwarp.intel.com> <37011@ucbvax.BERKELEY.EDU>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sun-barr!newstop!sun!brahmand.Eng.Sun.COM!grover From: grover@brahmand.Eng.Sun.COM (Vinod Grover) Newsgroups: comp.lang.prolog Subject: Re: Bogus! (was Re: Proof that Prolog can be faster than C) Message-ID: <137235@sun.Eng.Sun.COM> Date: 14 Jun 90 01:09:27 GMT References: <36986@ucbvax.BERKELEY.EDU> <1990Jun12.212525.25551@iwarp.intel.com> <37011@ucbvax.BERKELEY.EDU> Sender: news@sun.Eng.Sun.COM Organization: Sun Microsystems, Mt. View, Ca. Lines: 11