Article View: comp.lang.prolog
Article #916Re: Bogus! (was Re: Proof that Prolog can be faster than C)
From: Richard A. O'Keefe
Date: Fri, 15 Jun 1990 09:17
Date: Fri, 15 Jun 1990 09:17
13 lines
1292 bytes
1292 bytes
In article <1990Jun14.145424.29053@csrd.uiuc.edu>, sehr@sp20.csrd.uiuc.edu (David C. Sehr) writes: > Pardon my impertinence, Dr. O'Keefe, but how does goal caching make > an implementation no longer ``a Prolog implementation''? It seems to > me that whatever implementation observes the externally observable ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ > language semantics is ``a Prolog implementation''. Precisely. Goal caching does *NOT* preserve the externally observable language semantics. (That's why extension tables in SB Prolog have to be declared as such.) -- "A 7th class of programs, correct in every way, is believed to exist by a few computer scientists. However, no example could be found to include here."
Technical Details
Message-ID:
<3265@goanna.cs.rmit.oz.au>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!mailrus!cs.utexas.edu!tut.cis.ohio-state.edu!snorkelwacker!apple!uokmax!munnari.oz.au!goanna!okReferences:
<36986@ucbvax.BERKELEY.EDU> <1990Jun12.212525.25551@iwarp.intel.com> <1990Jun14.145424.29053@csrd.uiuc.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!mailrus!cs.utexas.edu!tut.cis.ohio-state.edu!snorkelwacker!apple!uokmax!munnari.oz.au!goanna!ok From: ok@goanna.cs.rmit.oz.au (Richard A. O'Keefe) Newsgroups: comp.lang.prolog Subject: Re: Bogus! (was Re: Proof that Prolog can be faster than C) Message-ID: <3265@goanna.cs.rmit.oz.au> Date: 15 Jun 90 09:17:23 GMT References: <36986@ucbvax.BERKELEY.EDU> <1990Jun12.212525.25551@iwarp.intel.com> <1990Jun14.145424.29053@csrd.uiuc.edu> Organization: Comp Sci, RMIT, Melbourne, Australia Lines: 13