Article View: comp.lang.prolog
Article #369Re: Turbo Prolog (was Re: logic programs -> procedural lang?)
From: Bradley L. Richards
Date: Sat, 30 Sep 1989 22:21
Date: Sat, 30 Sep 1989 22:21
12 lines
1132 bytes
1132 bytes
>Can someone enlighten or remind me of what so terrible a thing which Borland >Can someone enlighten or remind me of what so terrible a thing which Borland >has done in Turbo Prolog?? I am sure this has been discussed sometime ago, The primary problem (from my view) is that programs cannot assert and retract program clauses. The typing can be a problem if you aren't used to it, but in the end is probably a good feature. But without the ability for a program to change its universe, a whole class of logic programs goes out the window. brad
Technical Details
Message-ID:
<880@gamera.cs.utexas.edu>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!watmath!iuvax!mailrus!uwm.edu!cs.utexas.edu!bradleyReferences:
<27335@shemp.CS.UCLA.EDU> <869@gamera.cs.utexas.edu> <10822@eerie.acsu.Buffalo.EDU> <2181@munnari.oz.au> <1989Sep29.144838.16225@jarvis.csri.toronto.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!watmath!iuvax!mailrus!uwm.edu!cs.utexas.edu!bradley From: bradley@cs.utexas.edu (Bradley L. Richards) Newsgroups: comp.lang.prolog Subject: Re: Turbo Prolog (was Re: logic programs -> procedural lang?) Keywords: Prolog, typing, compiler efficiency Message-ID: <880@gamera.cs.utexas.edu> Date: 30 Sep 89 22:21:22 GMT References: <27335@shemp.CS.UCLA.EDU> <869@gamera.cs.utexas.edu> <10822@eerie.acsu.Buffalo.EDU> <2181@munnari.oz.au> <1989Sep29.144838.16225@jarvis.csri.toronto.edu> Organization: U. Texas CS Dept., Austin, Texas Lines: 12