Article View: comp.lang.prolog
Article #337Re: logic programs -> procedural lang?
From: Bradley L. Richards
Date: Fri, 22 Sep 1989 19:49
Date: Fri, 22 Sep 1989 19:49
8 lines
785 bytes
785 bytes
As far as I'm aware, little work *has* been done in this area (although Borland's highly successful Turbo Prolog is compiled to machine code). One big reason, at least with Prolog, that little work has been done is that you almost inevitably sacrifice one of the most important and distinctive features of the language when you compile it: the ability to have a program change its universe while running (assert/retract). Brad
Technical Details
Message-ID:
<869@gamera.cs.utexas.edu>Path:
arc1-ca.pugleaf.net!utzoo!attcan!uunet!cs.utexas.edu!bradleyReferences:
<27335@shemp.CS.UCLA.EDU>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!cs.utexas.edu!bradley From: bradley@cs.utexas.edu (Bradley L. Richards) Newsgroups: comp.lang.prolog Subject: Re: logic programs -> procedural lang? Message-ID: <869@gamera.cs.utexas.edu> Date: 22 Sep 89 19:49:52 GMT References: <27335@shemp.CS.UCLA.EDU> Organization: U. Texas CS Dept., Austin, Texas Lines: 8