Path: utzoo!dciem!nrcaer!sce!ulysses!garym From: garym@ulysses.UUCP (Gary Murphy) Newsgroups: comp.lang.prolog Subject: Re: logic programs -> procedural lang? Keywords: Logic Programming Compilers (Prolog) Message-ID: <7152@ulysses.UUCP> Date: 26 Sep 89 15:13:04 GMT References: <27335@shemp.CS.UCLA.EDU> <869@gamera.cs.utexas.edu> <1989Sep25.182448.2441@indetech.com> Reply-To: garym@cognos.UUCP (Gary Murphy) Organization: Cognos Inc., Ottawa, Canada Lines: 16 There is one alternative half-way between a compiled and an interpreted form. In SB-Prolog, the source files are 'compiled' to a bytestream of instructions for the Warren Abstract Machine (WAM), which allows SBP to store compact, pre-compiled and dynamically loaded predicates. Although not as fast as a true compiler, it performs much better than a straight interpreter. There is yet another alternative: wasn't there a posting a while ago gloating over a prolog-based cpu? That's the one _I_ want! :-) -- Gary Murphy - Cognos Incorporated - (613) 738-1338 x5537 3755 Riverside Dr - P.O. Box 9707 - Ottawa Ont - CANADA K1G 3N3 e-mail: decvax!utzoo!dciem!nrcaer!cognos!garym Cosmic Irreversibility: 1 pot T -> 1 pot P, 1 pot P /-> 1 pot T