home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.prolog
- Path: sparky!uunet!pipex!warwick!bham!news.cs.bham.ac.uk!axs
- From: axs@cs.bham.ac.uk (Aaron Sloman)
- Subject: Re: Wanted: production system/coroutiner
- Message-ID: <Bu5L4w.GtL@cs.bham.ac.uk>
- Sender: news@cs.bham.ac.uk
- Nntp-Posting-Host: fattie
- Organization: School of Computer Science, University of Birmingham, UK
- References: <1992Aug25.202004.8511@vax.oxford.ac.uk> <275@ininx.UUCP> <1992Sep5.183756.8683@vax.oxford.ac.uk>
- Date: Sun, 6 Sep 1992 10:58:07 GMT
- Lines: 34
-
- popx@vax.oxford.ac.uk writes:
-
- > Date: 5 Sep 92 17:37:56 GMT
- > Organization: Oxford University VAX 6620
-
- > I want my meta-interpreter to be capable of co-routining _large_
- > programs (animal "brains", containing production systems, planners,
- > etc), so time and space efficiency is important.
-
- It is possible that someone has said this already, but if you don't
- insist on portability you can use the "lightweight process"
- mechanism in Poplog, which works with prolog, I believe. For details
- see the online Poplog file
-
- REF PROCESS
-
- which describes consproc, runproc, suspend, resume. LIB TPARSE,
- described in HELP TPARSE illustrautes the use of the mechanism in a
- simple top down parser written in Pop-11 that finds all parses by
- backtracking.
-
- For information on using the mechanism with Prolog see the prolog
- help file
- PLOGHELP PROCESSES
-
- You may need help from someone who has already done this, e.g. one
- of the Sussex Poplog people.
-
- Aaron
- --
- Aaron Sloman, School of Computer Science,
- The University of Birmingham, B15 2TT, England
- EMAIL A.Sloman@cs.bham.ac.uk
- Phone: +44-(0)21-414-3711 Fax: +44-(0)21-414-4281
-