[Date Prev] [Date Next] [Thread Prev] [Thread Next] Date Index Thread Index Search archive:
Date:Mon Mar 9 18:08:38 1993 
Subject:McPOPLOG 
From:Aaron Sloman 
Volume-ID:930309.01 

I received the following message from Jonathan Cunningham, who does
not have access to net news. So with his permission I am posting it.


From jlc%bmtech.uucp@uknet.ac.uk Tue Mar  9 15:14:10 1993
Date: Tue, 9 Mar 93 14:08:13 GMT
From: jlc@bmtech.uucp (Jonathan Cunningham)
Subject: McPOPLOG


Some guy at McMaster University (in Canada) has implemented something
he calls "McPOPLOG". I've just read a paper on it.

    "The author of this paper has developed and implemented a completely
     new version of POPLOG ...."

    "Section 2 of the paper describes the fundamental differences
     between Sussex POPLOG and McPOPLOG, ..."

    "Our version is about two to three times faster."

    "... and is commercially much cheaper."

No, it's not a spoof. Are you frightened?

Actually, it's quite a small system (he quotes 75kB vs. 650kB for Sussex
Poplog) and the pop syntax is closer to pop-2 than pop-11. Implemented
in C and runs on VAXen and 68000 processor machines.

No doubt you will all tell me that you know all about it, but in case
you don't the full reference is:

    "AI Multilanguage System McPOPLOG: The Power of Communication
     Between its Subsystems", I Bruha, The Computer Journal,
     Vol 35, No 6, 1992

Regards,
Jonathan
-- 
Aaron Sloman,
School of Computer Science, The University of Birmingham, B15 2TT, England
EMAIL   A.Sloman@cs.bham.ac.uk  OR A.Sloman@bham.ac.uk
Phone: +44-(0)21-414-3711       Fax:   +44-(0)21-414-4281