HDTenEightyP/NetNews huggingface dataset:
From: alan@geg.mot.com (Alan Newman)
Subject: Re: A simple logic problem.
Xdisclaimer: Speaking for myself.
Organization: Motorola (Scottsdale, Arizona)
Date: 27 Jul 92 08:28:25


Paul Tarau writes about the "MUSIC MEN" logic problem and solution:

> ... 
> As is, it takes exactly the same time in emulated Sicstus 2.1
> and in BinProlog (140ms on a Sparc IPC). I would be curious to know 
> how much it takes on faster Prologs ...
>
> Paul Tarau
> tarau@info.umoncton.ca

I ran Paul's solution unmodified on ALS Prolog running on a Motorola
Delta computer with a 20 MHz 88K processor.  The times were consistantly
1 or 2 clock ticks (1/60 sec.), i.e., 17 or 33 msec.

Alan Newman
From: dc@dcs.qmw.ac.uk (Daniel Cohen)
Newsgroups: comp.lang.prolog
Subject: Re: Prolog-WIMP interfacing principles
Date: 22 Jul 92 11:28:00 GMT
Organization: Computer Science Dept, QMW, University of London

In <3545@keele.keele.ac.uk> csa09@seq1.keele.ac.uk (Paul Singleton) writes:

>Please can anyone with experience or insight suggest some principles
>for interfacing Prolog programs to WIMP interfaces, i.e. buttons, sliders,
>menus, dialog boxes and all that stuff.  I avoid asserting and retracting
>global state, and try to contain side-effects, and I can't see how to
>employ WIMP features without compromising this style.  Well, I can, but ...


How about using streams? The connection to the server is a (pair of)
stream(s) down which the program sends commands like
new_window(.....,S) where S will be used as a stream to send commands
to the new window created. In particular, dialog boxes might be built
by creating a window as above and then sending commands like
new_slider(.....,SS) down the stream to the window (S). Each input
object will have one of its arguments a stream with which it can send
messages back to the Prolog program. Of course, you'll need some sort
of parallelism (would co-routining be enough?) or else have to write
some horrible polling system to deal with the messages sent back from
input devices.

You'll have guessed I'm used to using a concurrent logic language - the
Strand X-Windows interface works this way. The nice thing about such an
interface is that the only implicit state information and side-effects
are in the X server - the program itself remains clean, with all access
to the WIMP system working via the streams. A procedure cannot access
the WIMP system without being given access to one of the WIMP streams
and no changes need be made to the Prolog database.

I have a Strand-Ingres interface that works in the same way - all state
is hidden from client programs. Although the interface doesn't fit
relation databases into the logic programming model as neatly as some
Prolog database interfaces do, it does seem to be a lot cleaner.

Daniel Cohen              Department of Computer Science 
Email: dc@dcs.qmw.ac.uk   Queen Mary and Westfield College
Tel: +44 71 975 5245/4/9  Mile End Road, London E1 4NS, UK
Fax: +44 81 980 6533      ******* Hit the North!!! *******
Newsgroups: comp.lang.prolog
From: ad@munta.cs.mu.OZ.AU (Andrew Davison)
Subject: LP Newsletter Submissions
Originator: ad@munta.cs.mu.OZ.AU
Organization: Department of Computer Sci, University of Melbourne
Date: Fri, 24 Jul 1992 01:43:28 GMT


Logic Programming Newsletter - SUBMISSIONS 
------------------------------------------

Issue 5/3 of the Newsletter is just back from the printers
and if you're a member of the Association of Logic Programming
(ALP) you should be receiving a copy in the next few weeks.

Never one to take a rest, I'm starting to gather contributions
for the next issue.

We'll print almost anything relevant to LP. For instance,
news on new products, abstracts, short notes on 
research (1-2 pages), your views on some aspect of LP,
trip reports, announcements of workshops,
conferences, meetings, etc.


The submission deadline is September 18th
                           --------------

Contributions are welcome by email, floppy disk (MAC or PC - please
include an ASCII version) or by mail for shorter contributions.
By ASCII, I mean plain text files - not LaTex please. 

Preference is STRONGLY given to material received via email or 
on disc - it saves a lot of retyping.

My address is :

	Andrew Davison
	ALP Newsletter Editor
	Dept. of Computer Science
	University of Melbourne
        Parkville
        Melbourne, Victoria 3052
        AUSTRALIA

Email:   ad@cs.mu.oz.au
Fax:	+61 3 348 1184
Phone:	+61 3 344 7207 / 5230
Telex:   AA 35185


Thanks,
    Andrew


P.S.
I've received a number of messages asking about the ALP, and how
to join. The best person to contact about these matters is :

        Cheryl Anderson
        ALP Administrative Secretary
        Dept. of Computing
        Imperial College
        180 Queen's Gate
        London, SW7 2BZ, UK

Email:   csa@doc.ic.ac.uk
Fax:    +44 71 589 1552
Phone:  +44 71 589 5111 x5011


Newsgroups: comp.lang.prolog
From: news@ern.doe.ernet.in
Subject: Test Posting
Organization: Department of electronics, New Delhi, India
Date: Fri, 24 Jul 1992 05:19:31 GMT

Sorry for test posting in this group.

Newsgroups: comp.lang.prolog
From: srinivas@ern.doe.ernet.in (Mr SRINIVAS)
Subject: prolog based expert system shell
Organization: Department of electronics, New Delhi, India
Date: Mon, 27 Jul 1992 03:58:07 GMT



CAN ANYONE PROVIDE ME THE INFORMATION ON COMMERCIALLY AVAILABLE
PROLOG BASED EXPERT SYSTEM SHELLS?


SRINIVAS PAVULURI
SCIENTIST/ENGINEER "SC"
NATIONAL INFORMATICS CENTRE
LODHI ROAD
NEW DELHI-3
INDIA

srinivas@vikram.ernet.in
From: wingo@apple.com (Tony Wingo)
Newsgroups: comp.lang.prolog
Subject: Re: Prolog for Mac
Date: 28 Jul 92 15:46:06 GMT
Followup-To: comp.lang.prolog,comp.sys.mac.programmer,comp.sys.mac.wanted,comp.sys.mac.misc
Organization: Apple Computer

In article <1992Jul27.215747.4560@gtephx.UUCP>, zeranguek@gtephx.UUCP (Karl
Zerangue) wrote:
> 
> Does anyone know of a Prolog interpreter for the Macintosh?
> 
Check out Open Prolog, available from 
   grattan.cd.tcd.ie

Last I checked it was in the directory tce/mac.

-tony

>>usual disclaimer<<
Newsgroups: comp.lang.prolog
From: tim@giaeb.cc.monash.edu.au (Tim Roberts)
Subject: ELIZA for PDProlog2 ?
Organization: Monash University, Melb., Australia.
Date: Tue, 28 Jul 1992 23:40:39 GMT

Can anyone tell me where to find a copy of ELIZA for PDProlog-2 ?

TIM ROBERTS
tim@giaeb.cc.monash.edu.au


Newsgroups: comp.lang.prolog
From: matsc@sics.se (Mats Carlsson)
Subject: Re: Unsafe variables
Organization: Swedish Institute of Computer Science, Kista
Date: Tue, 28 Jul 1992 07:25:01 GMT

In article <1992Jul27.065551.3053@cs.kuleuven.ac.be> bimbart@cs.kuleuven.ac.be (Bart Demoen) writes:

   [...]

   Two more remarks: I want to make a link with BinProlog (by the way, the
   relation between BinProlog and BIMProlog as not the same as between Nu-Prolog
   and Mu-Prolog !) or a continuation based implementation of Prolog:
   continuations on the heap actually means also environments on the heap, so that
   it in fact puts uninitialized 'permanent' variables on the heap. Still, it trails as
   much as a WAM implementation with unsafe variables. And it is difficult to get rid
   of the extra dereference every time the variable is accessed.

I don't know how other WAM based Prologs do it, but in SICStus Prolog,
the compiler ensures that all permanent variables are initialized at
the first 'call' instruction of every clause.  The variables are initialized
by 'put_variable' if they are not otherwise initialized already.

This is done to prevent there from being random bit patterns in the
permanent variables in the event of a garbage collection.  Some other
changes to the instruction set are also necessary to prevent similar
trouble in the event of garbage collection after backtracking.

I don't have any figures, but I suspect that variables created by this
mechanism would significantly contribute to the heap growth if one
gets rid of unsafe variables.
--
Mats Carlsson
SICS, PO Box 1263, S-164 28  KISTA, Sweden    Internet: matsc@sics.se
Tel: +46 8 7521543     Ttx: 812 6154 7010 SICS     Fax: +46 8 7517230
Newsgroups: comp.lang.prolog
From: vanroy@prl.dec.com (Peter Van Roy)
Subject: Re: Term comparisons w/ variables (and GC)
Organization: Digital Equipment Corporation - Paris Research Laboratory
Date: Tue, 21 Jul 1992 07:56:34 GMT

In article <1992Jul20.174202.12993@cs.sfu.ca>, gregory@cs.sfu.ca (Gregory Sidebottom) writes:
> In article <1992Jul20.083703.18058@prl.dec.com> vanroy@prl.dec.com (Peter Van Roy) writes:
> 
>    In article <1992Jul17.152828.3861@cs.kuleuven.ac.be>, bimbart@cs.kuleuven.ac.be (Bart Demoen) writes:
>    > 
>    > The implementation of ProLog by BIM has no "unsafe" variables
> 
>    Aquarius Prolog does not have unsafe variables either.
> 
> I am curious, what does it mean for a Prolog to not have unsafe
> variables.  Does this mean the compiler never uses the put_variable
> instruction?  Is a different instruction used in certain cases?  What
> about unsafe variables nested in structures?  Do 'safe' Prologs use
> more heap space?  Can somebody please clarify this for me?
> 
> Greg

Consider the two main stacks in a typical Prolog implementation: the local
stack (or "stack") which I will assume contains both environments and choice
points, and the global stack (or "heap") which contains all compound terms.

In Aquarius, the only kinds of pointers allowed are from the stack to the
heap and from the heap to the heap.  In other words, there are no pointers
from the stack to the stack, and therefore no unbound variables on the stack.
It is only these variables that are sometimes "unsafe", i.e. that have to be
moved to the heap (or "globalized") to avoid pointing to a deallocated piece
of stack.

Peter
From: zeranguek@gtephx.UUCP (Karl Zerangue)
Subject: Prolog for Mac
Keywords: Prolog Macintosh programming
Organization: gte
Date: Mon, 27 Jul 1992 21:57:47 GMT

Does anyone know of a Prolog interpreter for the Macintosh?

Thanks in advance!
From: marco@CompSci.Bristol.AC.UK (M. Lawrenz)
Newsgroups: comp.lang.prolog
Subject: Re: Literature on parallel LP
Date: 28 Jul 92 14:43:08 GMT
Organization: Dept of Computer Science, University of Bristol, UK.

oliver@adt.uni-paderborn.de (Oliver Jack) writes:
: 
: Could someone point me at a survey of prarallel Logic Programming,
: or could someone give me some hints on actual papers, books on this field.
: I'm also interested in literature about *testing* parallel Logic Programs,
: regardless of the model used (AND, OR parallelism, GHC etc.).
: 
: Thanks in advance,
: 
: 	Oliver Jack

Tom Conlon and Steve Gregory :

Programming in PARLOG

An introduction of the parallel logic programming language PARLOG.


marco
Newsgroups: comp.lang.prolog
From: roland@sics.se (Roland Karlsson)
Subject: Re: A Destructive Myth
Organization: Swedish Institute of Computer Science, Kista
Date: Tue, 28 Jul 1992 09:00:04 GMT


Hello Richard,

It is a sad fact that most decisions concerning what techniques and
machines to use are based on myths.  This is true in many areas: cars,
measuring instruments, computers, editors, programming languages, news
readers, ...  You name it.  Some people cannot accept anything that is
not called object oriented, some laugh at FORTRAN, and some just love
smalltalk.  I knew a guy who never wrote a program in another language
than APL.  None of those opinions are based on facts.  But people use
them for their decisions nevertheless.  It is very difficult to kill
myths using facts.  If you really want people to use Prolog, then you
must create some positive myths.  Then it is going to be used
"everywhere".  Even where it is not the most adequate tool.



--
Roland Karlsson             SICS, PO Box 1263, S-164 28 KISTA, SWEDEN
Internet: roland@sics.se    Tel: +46 8 752 15 40          Fax: +46 8 751 72 30
Telex: 812 6154 7011 SICS   Ttx: 2401-812 6154 7011=SICS
From: srinivas@ern.doe.ernet.in (Mr SRINIVAS)
Subject: FORMS BASED UDMS AND LOGIC PROGRAMS
Organization: Department of electronics, New Delhi, India
Date: Thu, 30 Jul 1992 09:20:09 GMT


HOW TO FIT A USER DIALOGUE MANAGEMENT SYSTEM BASED ON FORMS INTO
A PROLOG PROGRAM?

CAN ANYONE PROVIDE ME THE POINTERS ON THE ABOVE TOPIC.

I HAVE SEEN ONLY ONE PAPER ON THIS TOPIC AUTHORED BY
V.MILOSEVIC(IMPERIAL COLLEGE,UK).

"FORMS AND DIALOGUE MANAGEMENT FOR INTERACTIVE LOGIC PROGRAMS"
          BY  V.MILOSEVIC



Mr. SRINIVAS PAVULURI
SCIENTIST/ENGINEER "SC"
ARTIFICIAL INTELLIGENCE DIVISION
NATIONAL INFORMATICS CENTRE
A BLOCK,CGO COMPLEX,
LODHI ROAD,
NEW DELHI-110003
INDIA

srinivas@vikram.ernet.in
From: ok@goanna.cs.rmit.oz.au (Richard A. O'Keefe)
Newsgroups: comp.lang.prolog
Subject: Re: term comparisons with variables
Date: 28 Jul 92 03:34:40 GMT
Organization: Comp Sci, RMIT, Melbourne, Australia

In article <270@ininx.UUCP>, jkreznar@ininx.UUCP (John E. Kreznar) writes:
> What's a good way to represent sets of (possibly non-ground) terms in a setting
> where terms are regarded as identical if they are variants of one another?

> But if variable-name correspondence between terms in the set _is_ important, as
> for example if it's a set of atoms within a clause, this device will not work.
> For example, the equivalence of the sets
> 		{p(X, a), p(Y, b)} and
> 		{p(U, b), p(V, a)}
> does not seem to be easily detectable.

A lot of Prolog coding problems are eased by using redundant representations.
For this particular problem, the thing that springs to mind is representing
each term by a _pair_ of terms, one the grounded version of the other.  So
a set of terms might be stored as a list of Ground-Original pairs, sorted
on Ground.  That would give us
	[p('$VAR'(0),a)-p(X,a), p('$VAR'(0),b)-p(Y,b)]
	[p('$VAR'(0),a)-p(V,a), p('$VAR'(0),b)-p(U,b)]
for which equivalence _is_ easily detectable.

Of course, as variables become instantiated, the Ground versions become
inappropriate, so it would be best to compute the Ground versions just
before using them.
-- 
You can lie with statistics ... but not to a statistician.
From: ucjtrjf@ucl.ac.uk (Jonny Farringdon)
Newsgroups: comp.lang.prolog
Subject: Re: Prolog for SUN
Date: 31 Jul 92 17:00:35 GMT
Organization: Bloomsbury Computing Consortium

kuehn@dfki.uni-kl.de (Otto Kuehn) writes:

>Hi netters,
>   we are lookiung for a PROLOG to run on SUN - Sparcstations. Important
>features would be: support for designing a graphical user interface,
>support for object-oriented programming, and support for  modules.

>  We heard about Quintus-Prolog, IF-Prolog, and APL-Prolog. What are
>your experiences with these? Which Prolog would you suggest?

>Thanks,

>Otto Kuehn.


Use   SICStus     v.cheap!  v.fast (compiles sun code)  v.good  ;-)

jonny.    ucjtrjf@ucl.ac.uk
Newsgroups: comp.lang.prolog
From: andi@mips.complang.tuwien.ac.at (Andi Krall)
Subject: Re: Term comparisons w/ variables
Keywords: unsafe variables
Organization: Technical University Vienna
Date: Tue, 21 Jul 1992 12:27:20 GMT

Tim Lindholm writes

>Bart Demoen writes:

>> The implementation of ProLog by BIM has no "unsafe" variables (this wasn't true
>> in 1984, otherwise there wouldn't have been the need to invent the trick). It
>> was the idea of Herman Crauwels (no longer at BIM) to get rid of them. Some
>> people claim that not having "unsafe" variables, is a bad idea. Anybody
>> interested in discussing this in this news group ?

>Quintus has (and likes) unsafe variables.  Years ago as a study for release
>3.0 I modified a QP system to get rid of unsafe variables (by immediately
>globalizing them -- I hope that's what we are talking about!).  The system
>also recorded stack "high water marks", the maximum size of the stacks for
>a given run.  We expected to see additional global stack required, and were interested in >getting some estimates of how much more would be used.

>We were quite surprised that on a range of examples (compiling code, running
>our test suite, running CHAT-80 and various other tests) that global stack 
>usage increased substantially, by 50-100% across the majority of examples we tested.  This >increase also caused runtime penalties due to increased stack shifting and GC.

>This seemed so unacceptable that we didn't even bother to tune the system to
>measure what performance increase we might expect.  Bart, do you have any estimate of the >performance BIM gained (and Quintus gave up) by abandoning
>unsafe variables?

Since about three years the VAM (Vienna Abstract Machine) stores unbound variables
on the global Stack. In the optimized version the stack size grow by about 15%
(4.44% to 26.40% depending on the benchmark (small benchmarks, prolog compiler,
meta interpreter, theorem prover)). The optimized version eliminates the creation
of unbound variables for builtin predicates like for the result of is. If the bips
creates unbound variables too the stack size grows by additional 36% (1.37 to 94%).

Storing unbound variables on the global stack was a great win for the VAM. The
optional trail test was simplified (only one comparison). The last call optimization
speeded up due to the elimination of checking the stack frame for unbound variables
and self references. The number of unbound variables is smaller in the VAM than in
the WAM (Warren Abstract Machine). So the grow of stack sizes can not compared
directly.

-- Andi
-- 
Andreas Krall, andi@mips.complang.tuwien.ac.at
+431 58801/4477  fax +431 5057838
Technische Univ. Wien, Inst.f. Computersprachen E185/1
Argentinierstr.8/4, A-1040 Wien Austria
Newsgroups: comp.lang.prolog
From: cleary@cpsc.ucalgary.ca (John Cleary)
Subject: Information about compatible Prolog's on Unix and PC's?
Organization: U. of Calgary Computer Science
Date: Wed, 22 Jul 92 02:06:35 GMT

I am posting this for someone else. Please reply directly to the address at the
end of the post.
John Cleary cleary@cpsc,ucalgary.ca

>>   Re: Looking for PC version of Prolog for student use ...
>>
>>   This seems like a FAQ, but I need to ask!
>>
>>   We are looking for a good, public domain (freely distributable), prolog
>>   for use in CS classes.  We want something that looks the same in the
>>   lab (UNIX), and at home (PC). We have two candidates, which we have
>>   inherited from UNIX - UNSW prolog, and CProlog.
>>
>>   UNSW ports easily to a PC, but has limited debugging support,
>>   limited stack space, and is non-standard in several ways.
>>   C-Prolog is much more solid, but we have not yet found a PC version.
>>
>>   Before we invest more time in doing it ourself, we wondered how others
>>   have addressed this need.  Specifically,
>>    1) has anyone ported C-Prolog to PCs ?
>>    2) has anyone upgraded unsw prolog?
>>    3) other alternatives?
>>
>>   Please reply directly, I will summarize if there is interest.
>>
>>   Thank you,
>>   Gregory Guthrie
>>   --
>>   **--  Greg Guthrie     MIU Computer Science Department        (515)472-1125
>>   **    Internet:: guthrie@miu.edu
>>   **--  UUCP::     guthrie@miucsv.UUCP     ...uunet!miucsv!guthrie
Newsgroups: comp.lang.prolog
From: lukose@cm.deakin.OZ.AU (Dickson Lukose)
Newsgroups: comp.lang.prolog
Subject: Prolog on transputers
Date: 29 Jul 92 03:49:25 GMT
Organization: Deakin University, Geelong, Australia


I am looking for a Prolog that is designed to run on transputers.

Any pointers will be most appreciated.

Dickson Lukose
Dept. of Comp & Maths
Deakin University, Aust. 3217

lukose@deakin.oz.au


Newsgroups: comp.lang.prolog
From: andrew@IFComputer.de (Andrew Verden)
Subject: Re: Literature on parallel LP
Date: Wed, 29 Jul 92 07:44:28 GMT
Organization: InterFace Computer GmbH, Munich, Germany


Implementations of Distributed Prolog

Kacsuk and Wise

Wiley series in parallel computing.

published June 1992.

ISBN 0471931160


        Dr. Andrew Verden,

        InterFace Computer GmbH,        email:  andrew@IFComputer.de
        Garmischer Str. 4,	        Tel:    (0 89) 5 10 86-36
        D-8000 Munchen 2,               Fax:    (0 89) 5 10 86-28
	GERMANY.
From: baechtel@iccgcc.decnet.ab.com
Newsgroups: comp.lang.prolog
Subject: Where can I found X-Prolog?
Date: 22 Jul 92 07:58:54 EST


	Does anyone know where I can get more information about
Quintus X-Prolog? It sounds like a real nice version of Prolog
with an X-interface.

	
Newsgroups: comp.lang.prolog
From: yossi@cbnews.cb.att.com (yossi.a.nygate)
Subject: IF/Prolog
Organization: AT&T
Date: Mon, 27 Jul 1992 21:16:24 GMT

Hi,

As anyone out there had any experience with IF/prolog with respect
to support, performance, reliability, etc. We are thinking
of developing an application within AT&T and are trying
to choose between IF/prolog and Quintus prolog. 

I would really appreciate anyone's first or second hand knowledge
of these two products.

	Thanks

	Yossi

-- 

----------------------------------

     Yossi Nygate (att!cblph!yossi)
From: csa09@seq1.keele.ac.uk (Paul Singleton)
Newsgroups: comp.lang.prolog
Subject: Prolog-WIMP interfacing principles
Date: 21 Jul 92 17:20:53 GMT
Organization: University of Keele, England

Please can anyone with experience or insight suggest some principles
for interfacing Prolog programs to WIMP interfaces, i.e. buttons, sliders,
menus, dialog boxes and all that stuff.  I avoid asserting and retracting
global state, and try to contain side-effects, and I can't see how to
employ WIMP features without compromising this style.  Well, I can, but ...
----
  __   __    Paul Singleton (Mr)           JANET: paul@uk.ac.keele.cs
 |__) (__    Computer Science Dept.        other: paul@cs.keele.ac.uk
 |  .  __).  Keele University, Newcastle,    tel: +44 (0)782 621111 x7355
             Staffs ST5 5BG, ENGLAND         fax: +44 (0)782 713082
Newsgroups: comp.lang.prolog
From: mgv@cs.scarolina.edu (Marco Valtorta)
Subject: Re: Richard O'Keefe's Lament
Keywords: prolog industry pigheadedness
Organization: USC  Department of Computer Science
Date: 28 Jul 92 17:49:09 GMT

reintjes@infonode.ingr.com (Peter Reintjes) writes:

>If Yuval Lirov is listening,  perhaps he can help you
>out with the diagnostic systems he worked on at AT&T?

Just in case someone did not know, here is Yural Lirov's
current address:
Dr. Yural Lirov
Salomon Technology Services, Inc.
745 Route 3
Rutheford, New Jersey 07070, U.S.A.
tel. (1)(201)896-4367
fax (1)(201)804-7670
internet: yol@swampthing.sbi.com


>            - Peter Reintjes        pbr@quine.sofla.ingr.com


Marco Valtorta, Assistant Professor	usenet: ...!ncrcae!usceast!mgv
Department of Computer Science	internet: mgv@usceast.cs.scarolina.edu
University of South Carolina	tel.: (1)(803)777-4641
Columbia, SC 29208		tlx: 805038 USC
U.S.A.				fax: (1)(803)777-3767
usenet from Europe: ...!mcvax!uunet!ncrlnk!ncrcae!usceast!mgv
Newsgroups: comp.lang.prolog
From: vmm@bruny.cc.utas.edu.au (Vishv Malhotra)
Subject: Is there a Prolog to C convertor in public domain?
Organization: University of Tasmania, Australia.
Date: Fri, 24 Jul 1992 01:09:21 GMT

Is there a Prolog to C convertor in public domain?

If there is one, how can I get a copy of it?

Thanks.

Vishv
Newsgroups: comp.lang.prolog,comp.sys.mac.programmer,comp.sys.mac.wanted,comp.sys.mac
From: perm@csd.uu.se (Per Mildner)
Subject: Re: Prolog for Mac
Organization: Computing Science Dept.,Uppsala University, Sweden
Date: Tue, 28 Jul 1992 17:32:55 GMT


We have ported our Prolog interpreter/compiler to the Mac. It was
available on info-mac but has been removed. It is still available on
some mirror sites. It is also available by anonymous ftp to
ftp.csd.uu.se (directory /pub/Tricia/Mac/) where there is one extra
version for use with 68000 processors (e.g., Classics).


It is a WAM based vanilla prolog with no fancy Mac specific stuff
except ADSP stream support. The ADSP support have been used to
implement fancy user interfaces for expert systems using SuperCard.

Any questions should go to tricia-request@csd.uu.se (This includes
requests for the source code).
Regards,
--
Per Mildner			perm@CSD.UU.SE
Computing Science Dept.		tel: +46 18181049
Uppsala University, Sweden	fax: +46 18521270