Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!ukc!icdoc!qmw-cs!mmh
From: mmh@cs.qmw.ac.uk (Matthew Huntbach)
Newsgroups: comp.lang.prolog
Subject: Re: Demons in Prolog
Message-ID: <3127@sequent.cs.qmw.ac.uk>
Date: 5 Dec 90 15:59:27 GMT
References: <4716@mahendo.Jpl.Nasa.Gov>
Organization: Computer Science Dept, QMW, University of London, UK.
Lines: 18
Summary:
Expires:
Sender:
Followup-To:
Distribution:
Keywords:

In article <4716@mahendo.Jpl.Nasa.Gov> alan@nereid.jpl.nasa.gov (Alan Quan) writes:
>
>I need to find out if it's possible to implement demons in Prolog in an
>efficient manner.
>
>I'd like to use such a technique for a real-time application so it has
>to be relatively fast--- any comments you can provide on suitability of
>Prolog for real-time environments (Prolog alone or Prolog in conjuction
>with C) will be of considerable interest.
>
I think the concurrent logic languages would be much more
suitable for what you are doing than Prolog. I don't think
Prolog's backtracking mechanism fits in well with real time
programming. Demons are really an example of concurrent
procedures, so a concurrent language is likely to give you a
better implementation than a sequential one.

Matthew Huntbach


Brought to you by Super Global Mega Corp .com