HDTenEightyP/NetNews huggingface dataset:
From: v104n55k@ubvmsb.cc.buffalo.edu (David I Schwartz)
Newsgroups: comp.lang.prolog
Subject: Re: Retract static clauses, can't ?
Date: 11 Nov 92 21:11:00 GMT
Organization: University at Buffalo
News-Software: VAX/VMS VNEWS 1.41

> In article <92316.113830U37956@uicvm.uic.edu>, U37956@uicvm.uic.edu writes...
> >Using Sicstus2.1 Prolog, I want to retract some facts (or clauses) which
> >were loaded from a file.
> >   Suppose in  mfile, there are facts:
> >          johnlikes(mary).
> >          marylikes(tom).
> > 
> >After starting prolog, i load the facts in the following way:
> >   |- ? [Omfile].
> > 
> >When I try to remove a fact, such as:
> >   |- ? retract((marylikes(tom))).
> > 
> >I got error message which says static terms can't be retracted.
> > 
> >How can i retract the facts and how can i made the facts dynamic ?
> > 
> >Could anyone tell me?
> > 
> >Thanks in advance.

You can try abolish (ie, abolish(marylikes/1) ) but it is rather extreme.

Dave
Newsgroups: comp.lang.prolog
From: bedford@asterix.gaul.csd.uwo.ca (Darryl Bedford)
Subject: send us your prolog programs
Reply-To: bedford@asterix.gaul.csd.uwo.ca (Darryl Bedford)
Organization: University of Western Ontario
Date: Fri, 6 Nov 1992 14:26:02 GMT
Followup-To: comp.lang.prolog
Keywords: prolog programs


WANTED:  prolog programs of all types.  

I would especially be interested in programs of an unreadable
nature or even very unique problems that are difficult to solve
in Prolog.

We are currently working on a variant of Prolog and I require more
test programs to use and modify.  

You may e-mail them to me  (bedford@gaul.csd.uwo.ca)

Thanks in advance for your help!

Darryl Bedford
Undergraduate, Computer Science
University of Western Ontario
London, Ontario, Canada
From: dg@dgupta.hpl.hp.com (Dipankar Gupta)
Newsgroups: comp.lang.prolog
Subject: Re: collapsing lists to tree
Date: 5 Nov 92 10:50:00 GMT
Organization: Hewlett-Packard Laboratories, Bristol, UK


   I wish to collapse a list of lists into a tree by recursively factoring
   out common initial elements, e.g.

       [ [ a, b, l, e],
	 [ a, b, o],
	 [ a, b, o, r, t],
	 ...

   into

     - a - b - l - e - []
	     \
	       o - []
		 \
		   r - t - []

   Is there an established name for this latter data structure?  Is there
   published code for creating it?

Rule #1 for Algorithms: Look up Knuth.

In this particular case:
Knuth, D. E. The Art of Computer Programming
Vol 3 Sorting & Searching
pp 481-489

The data-structure you're talking about is called a ``Trie''.
For a neato application, have a look at the TeX source code...

Cheers,
Dipankar Gupta
HP Labs Bristol UK
dg@hplb.hpl.hp.com
--
--
Newsgroups: comp.lang.prolog
From: fromherz@parc.xerox.com (Markus Fromherz)
Subject: Re: Prolog 1000
Organization: Xerox PARC
Date:  5 Nov 92 05:34:34 GMT

brady@cs.tcd.ie (Michael Brady) writes:

>draxler@next6.cis.uni-muenchen.de (Christoph Draxler) wrote:
>> 
>> I recall a very nice information retrieval system called PSI by 
>> Markus Fromherz, a stand-alone Prolog implementation for the Mac, which
>> could be used for this...

>Excuse my ignorance about this. Is PSI a genuine 'double clickable' Mac
>application? Or is it a Prolog program which must be loaded into a Prolog
>system and executed?

Doesn't seem to be obvious, does it? Imagine asking that question about a C
program. - Note that I am not saying that PSI is ideal for the Prolog 1000
database, especially because it might exclude users of other platforms.
(PSI can export in many formats, though, including Prolog-readable text.)

Still, using the publicity, from the ReadMe file of PSI (pronounced "psee"):

PSI is a handy system for the management and retrieval of your
personal data, be it addresses, CD collections, or bibliographic
references. It is intended for the non-commercial user. It may not
be as full-fledged as some data-base systems, but has some features
that you won't find in most commercial systems. Also, you may find
it easier to set up and faster to use. (Try the sample sessions!)
PSI is useful for a broad range of data. Indexing with descriptors
makes searching for the data you need fast, and the interface to
other data-base formats (import and export) is quite powerful.

PSI has been written in LPA MacProlog and is a "genuine 'double clickable'
Mac application". PSI runs on all Macs with System 6 or 7 in 1MB of main
memory. As LPA MacProlog isn't yet 32-bit clean, PSI isn't either. Exten-
sive documentation and some examples are included.

PSI is available by anonymous ftp from sumex-aim.stanford.edu, directory
info-mac/app, file psi-23.hqx. It was also available on a recent Nautilus
CD-ROM (if you happened to get it) and will be on the first Info-Mac CD-
ROM.

(End-of-commercial)

Markus Fromherz
<fromherz@parc.xerox.com>
Newsgroups: comp.lang.prolog
From: dsmith@chaos.cs.brandeis.edu (Donald A. Smith)
Subject: Looking for roomate for JICSLP (Thurs, Fri nights)
Organization: Brandeis University
Date: Sun, 8 Nov 1992 23:24:38 GMT

I'm looking for a place to stay (preferably at the Ramada Renaissance
Tech World) on Thursday, Nov. 12 and Friday, Nov 13 in D.C. during the 
JICSLP conference.   Anyone looking for a roommate (non-smoker)?

    Don Smith
Newsgroups: comp.lang.prolog
From: frans@kiwi.uia.ac.be (Francois Staes)
Subject: Profiling of Prolog programs
Reply-To: frans@kiwi.uia.ac.be
Organization: U.I.A.
Date: Thu, 12 Nov 1992 16:10:20 GMT

Can anybody point me to references concerning the profiling of Prolog programs ?
I know of the article of M.M. Gorlick and C.F. Kesselman, but I wonder whether
there has been any other work done on this subject.

Francois Staes
University of Antwerp
Antwerp, Belgium
Email: frans@kiwi.uia.ac.be



Xref: sparky comp.lang.prolog:2051 comp.object:4185
From: yac@doc.ic.ac.uk (Yannis Cosmadopoulos)
Newsgroups: comp.lang.prolog,comp.object
Subject: Re: IC-Prolog (was Object-Oriented Prolog)
Date: 10 Nov 92 12:04:14 GMT
Organization: Imperial College, London, U.K.
NNTP-Posting-Host: sophia.doc.ic.ac.uk


In article <9231512.8233@mulga.cs.mu.OZ.AU>, lee@munta.cs.mu.OZ.AU (Lee Naish) writes:
> >It's in the directory computing/programming/languages/prolog/icprolog.
> >There is MacProlog source in a further subdirectory, lo, or you can grab the
> >icprolog distribution, pd-ICP-0.90.tar.Z, which includes an icprolog version
> >of L&O.
> 
> I take it this is not the IC-Prolog of Clark and McCabe from the dim &
> distant past.  Can anyone give a quick summary of the new system - what
> features is has etc.
> 
> >    michael lawley (lawley@cit.gu.EDU.AU).        The Unicycling Postgrad
> 
>     lee naish (lee@cs.mu.OZ.AU)			The Unicycling Senior Lecturer
> 
> 
IC Prolog ][ is a new prolog with the following added features
1) Multi threading - allows multiple prolog threads to be run concurrently.
2) Parlog - the system includes a parlog component. Prolog threads and parlog can
   comunicate through pipes. The parlog sub system is not included in the public
   domain version as there is a small fee for this.
3) Communication primitives - the system includes TCP primitives for inter process
    communication
4) Mailboxes - a high level communication system allowing multiple
   senders/receivers of data.

There was a paper presented at Keele describing some features of the language
which should hopefuly apear in the proceedings:
``I.C Prolog ][: a Language for Implementing Multi-Agent Systems'',
Yannis Cosmadopoulos and Damian Chu
in {\em  Tutorial and Workshop on Cooperating Knowledge Based Systems
September 23-25, 1992, Keele University}

For further information contact
	yac@doc.ic.ac.uk
	dac@doc.ic.ac.uk

Yannis
Newsgroups: comp.lang.prolog
From: lee@munta.cs.mu.OZ.AU (Lee Naish)
Subject: Re: collapsing lists to tree
Organization: Department of Computer Sci, University of Melbourne
Date: Wed, 11 Nov 1992 07:04:22 GMT

In article <7869@skye.ed.ac.uk> ken@aiai.ed.ac.uk (Ken Johnson) writes:
>
>In article <Bx5CFy.I6F@gabriel.keele.ac.uk> csa09@keele.ac.uk (Paul
>Singleton) writes:
>
>#  I wish to collapse a list of lists into a tree by recursively factoring
>#  out common initial elements
>
>The following code will do it.

>I think it is worth documenting the following restrictions: (a) it is
>not bidirectional, (b) it does not enforce a canonical form of Tree, so
>that Trees which contain the same information may compare as unequal,
>(c) variables in Lists will be spuriously instantiated.  (Challenge:
>Write a bi-directional version without using var/1).

Trivial if you have NU-Prolog.  Replace the unsound negation (\+) by a
sound version, declare the predicates pure, run the code through ``nac''
to automatically produce some control information and presto, out pops a
reversible version!  Takes less than a minute and virtually no thinking.

% the following code has been nac'ed
% 
% procedure collapse/2 is locally deterministic.

?- pure collapse/2.
?- collapse(A, B) when A or B.
collapse([], []).
collapse([[]|A], [[]|B]) :-
	collapse(A, B).
collapse([[A|B]|C], [[A|D]|E]) :-
	group(A, [[A|B]|C], F, G),
	collapse(F, D),
	collapse(G, E).

?- pure group/4.
?- group(A, B, C, D) when (B or C) and (B or D).
group(A, [], [], []).
group(A, [[A|B]|C], [B|D], E) :-
	group(A, C, D, E).
group(A, [[B|C]|D], E, [[B|C]|F]) :-
	A ~= B,
	group(A, D, E, F).

	lee
From: tusveld@ictser.UUCP (Fred Tusveld)
Newsgroups: comp.lang.prolog
Subject: Fuzzy predicates anyone?
Date: 10 Nov 92 08:51:37 GMT


Hello,

for an application I would like to use some fuzzy predicates. Does anyone have some simple predicate definitions that make use of standard Prolog arithmetic, 
and that can be used to illustrate use of fuzzy values in Prolog?

Thanks in advance.



Fred Tusveld
ICT Automatisering Deventer BV - Aerospace Department
tel. +31 5700 33888
fax. +31 5700 21362
Keulenstraat 7
P.O. Box 701
7400 AS Deventer
The Netherlands
email :
tusveld@ict.nl
Newsgroups: comp.lang.prolog
From: mbrown@trentu.ca (MARTIN A. BROWN)
Subject: History of Prolog?
News-Software: VAX/VMS VNEWS 1.41    
Organization: Trent University Computer Services Department
Date: Wed, 11 Nov 1992 03:09:00 GMT


Hello:

	I am intending to do a research analysis of the Prolog Language, 
including an account of the history and rationale.

	Does anyone know of references or periodicals which describes 
the specific circumstances responsible for the establishment of the Prolog 
language.

	NOTE:  Most general Programming Language texts do not cover Prolog, 
and I have not found Prolog Texts that adequately discuss this topic.

Thanks in Advance,

- Martin.
From: asp@cislabs.pitt.edu (Anandeep Pannu)
Newsgroups: comp.lang.prolog
Subject: Clarifications on Warplan
Date: 13 Nov 92 23:11:36 GMT
Organization: University of Pittsburgh

Hi there

I am a TA for a course in AI Programming at the University of Pittsburgh.
We are (for the first time may I add) teaching the people Prolog in this
course. We will be using Sicstus Prolog 0.7.

One of the assignments concerns modifying the WARPLAN code that is in 

  Readings in planning, edited by James Allen, James Hendler and Austin Tate,
  ISBN 1-55860-130-9, Morgan Kaufmann, 1990

The code I copied is from the paper "Extract for APIC Studies in Data 
Processing" by D H D Warren (pp 140-153). The code there is very clear 
but I am having diffculty deciding what one of the built in predicates does .
This is the "check" predicate which is shown on line 61 and 78 of the program.
Could anybody tell me what this is about ? 

And if you know where I can get the report

Warren DHD (1974) "WARPLAN : A system for Generating Plans", Dept. of 
Computational Logic Memo 76, Artificial Intelligence, Edinburgh University.

in an ftp-able format.

If someone has a Prolog implementation of WARPLAN that he/she could part with
could you e-mail it to me ?

Of course my Prof wanted this yesterday !!

Anandeep Pannu
Newsgroups: comp.lang.prolog
From: zyang@eeserv.ee.umanitoba.ca (Zhengguang Yang)
Subject: Re: pointers needed on list processing
Keywords: sub sum, nested list
Organization: University of Manitoba, Winnipeg, Canada
Date: Mon, 9 Nov 1992 21:52:15 GMT

zyang@ccu.umanitoba.ca (Z. Yang) writes:

>Hi, netters,

>I am new in prolog and have some difficulty in list processing. What I want to
>do is write a predicate, ie. called 'subsum', which does following,

>?- subsum([L1,L2,...],NewList).
>NewList = [Sum_of_L1,Sum_of_L2,...]

>where L1, L2 etc. are lists themselves(could be nested).

>Any pointers will be appreciated.
>Thanks in advance to all kind souls.

>-zgy

I kind of figured it out(see following) by calling some pre-defined
predicates. Still not satisfied, though. Can it be done in a simplier way??
Or, is there a written predicate out there doing the same thing?

Any better ideas appreciated.
Thanks.

-zgy

--- predicate 'subsum' begins -----
% consider a list of lists LL = [L1,L2,...]. obtain the list of 
% individual listsums, ie. LLS = [L1sum,L2sum,...]

subsum([],[]).				% boundary condition
subsum([L1|Rest],LLS):-
	flatten(L1,FlatL1),		% flatten L1
	listsum(FlatL1,L1sum),		% sum of L1: L1sum
	subsum(Rest,LLS1),		% sums of L2, L3, ...
	add(L1sum,LLS1,LLS).		% add L1sum in front of [L2sum,...]

flatten([Head|Tail],FlatList):-		% flatten a list
        flatten(Head,FlatHead),
        flatten(Tail,FlatTail),
        concat(FlatHead,FlatTail,FlatList),
        !.
flatten([],[]).
flatten(X,[X]).

concat([],L,L).				% concatenate two lists into one
concat([X|L1],L2,[X|L3]):-
        concat(L1,L2,L3).

listsum([],0).				% sum of all entries in a list
listsum([H|T],Sum):-
        listsum(T,Sum1),
        Sum is H + Sum1.

add(X,L,[X|L]).				% add an element in front of list L
From: lee@munta.cs.mu.OZ.AU (Lee Naish)
Subject: IC-Prolog (was Object-Oriented Prolog)
Organization: Department of Computer Sci, University of Melbourne
Date: Tue, 10 Nov 1992 01:14:12 GMT

>It's in the directory computing/programming/languages/prolog/icprolog.
>There is MacProlog source in a further subdirectory, lo, or you can grab the
>icprolog distribution, pd-ICP-0.90.tar.Z, which includes an icprolog version
>of L&O.

I take it this is not the IC-Prolog of Clark and McCabe from the dim &
distant past.  Can anyone give a quick summary of the new system - what
features is has etc.

>    michael lawley (lawley@cit.gu.EDU.AU).        The Unicycling Postgrad

    lee naish (lee@cs.mu.OZ.AU)			The Unicycling Senior Lecturer


Newsgroups: comp.lang.prolog
From: bergmann@uklirb.informatik.uni-kl.de (Bergmann Ralph Dfki/KIWi)
Subject: X-Window interface for (SWI) prolog
Organization: University of Kaiserslautern, Germany
Distribution: world 
Date: Wed, 11 Nov 1992 11:13:12 GMT

Does anybody knows about an X-interface for prolog, especially
for SWI-prolog. I have heard something about the "xwip" package.
From where can I get such a package.
Thank you,
    Ralph Bergmann
    University of Kaiserslautern, Germany
    Email: bergmann@informatik.uni-kl.de
From: isler@gradient.cis.upenn.edu (Sylvia Isler)
Newsgroups: comp.lang.prolog
Subject: Producing a newline character with the write predicate
Date: 6 Nov 92 19:37:49 GMT
Organization: University of Pennsylvania


I am using c-prolog and I would like to produce some output followed
by a newline character so that my output does not run in one
continuous line.

Can some one tell me how this is done using the write predicate or any
other output predicate in c-prolog?


Thanks,
Sylvia Isler
isler@gradient.cis.upenn.edu
Newsgroups: comp.lang.prolog
From: moser@Informatik.TU-Muenchen.DE (Max Moser)
Subject: Unification with Occur-Check in Quintus-Prolog
Originator: moser@sunjessen6.informatik.tu-muenchen.de
Organization: Technische Universitaet Muenchen, Germany
Date: Thu, 5 Nov 1992 11:32:03 GMT


Hi there,
I've got a small problem. For an efficient prototype of a kind of
theorem prover I need correct unification, i.e. unification WITH occur-check.
In Quintus-Prolog there are a lot of libraries including one with a
correct unification. Unfortunately it is written in Prolog and therefore
as slow as the rest of my program.

So my question is: can anybody out there tell me about a correct unification
procedure written in C which can be linked with a Quintus-Prolog program?
How can I get it?
Or do you know whether it is possible at all and how to do it?

Thanks a lot for any response,
	Max.
-- 

_______________________________________________________________________________
 Max Moser		 	    	 Forschungsgruppe KI - Intellektik
 Institut f"ur Informatik		 Lehrstuhl f"ur Rechnerarchitektur
 Technische Universit"at M"unchen
 Postfach 20 24 20		    		Tel.: +49-89/521096
 Arcisstr. 21					Fax.: +49-89/526502
 D-8000 M"unchen 2	     	     Email: moser@informatik.tu-muenchen.de
_______________________________________________________________________________
From: ojuarez@mtecv2.mty.itesm.mx (Octavio Juarez Espinosa)
Newsgroups: comp.lang.prolog
Subject: Looking FTP for eqlog
Summary: FTP eqlog
Keywords: Help
Date: 11 Nov 92 03:29:09 GMT
Organization: I.T.E.S.M. Campus Monterrey



Hi,

I'll appreciate if send me some information about Eqlog.

I am very interested in to practice with this language.
Thanks in advance.
Sincerely,

Octavio Juarez

-- 
Octavio Juarez Espinosa
Gabriel Valerio 1134 
Saltillo, Coahuila    CP 25000
Mexico  email ojuarez@mtecv2.mty.itesm.mx
From: matsc@sics.se (Mats Carlsson)
Newsgroups: comp.lang.prolog
Subject: Call For Workshop Proposals - ICLP'93
Date: 5 Nov 92 10:17:24 GMT
Distribution: comp
Organization: Swedish Institute of Computer Science, Kista


				   
		CALL FOR WORKSHOP PROPOSALS - ICLP'93
				   
	 TENTH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING
		      POST-CONFERENCE WORKSHOPS
				   
			  Budapest, Hungary
			   June 24-25, 1993
				   
	  Sponsored by the Association of Logic Programming

The 1993 International Conference on Logic Programming will be held on
June 21-24, 1993, in Budapest, Hungary.  Post-conference workshops are
planned to be held on June 24-25.

Proposals are invited for the Workshop Program.  Participants will meet
informally to discuss selected technical issues in an atmosphere which
fosters the active exchange of ideas.

The format of the workshop will be determined by the organizer
proposing the workshop, but ample time will be allowed for general
discussion.  Workshops will vary in length, but the optimal duration
will be a half day or a full day.  The facilities allow up to 30
attendees per workshop.

Proposals for workshops may be on any topic related to logic
programming, should be between one and two pages in length, and should
include:

    o A description of the workshop, identifying the specific
      technical issues.

    o A discussion of the relevance of the workshop.

    o The estimated number of attendees.

    o The name, postal address, phone and fax numbers, and email
      address of the workshop organizer.

    o A proposed schedule for organizing the workshop, and a
      preliminary agenda.

Workshop organizers will be responsible for:

    o Producing a "Call for Participation" in the workshop.

    o Reviewing requests to participate in the workshop and selecting
      participants.

    o Scheduling the workshop.


Proposals should be submitted by December 1, 1992.  
Notification will be sent by December 31, 1992.

Submit proposals and inquiries to:

Mats Carlsson
SICS
PO Box 1263
S-164 28  KISTA, Sweden
Phone:	+46-8-7521543
Fax:	+46-8-7517230
Email:	matsc@sics.se
--
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: thomas@sics.se (Thomas Sj|land)
Subject: Re: Difference Lists (was: Rotation, or something...)
Organization: Swedish Institute of Computer Science, Kista
	<1992Oct22.104351.9700@vax.oxford.ac.uk>
Date: Wed, 11 Nov 1992 10:57:10 GMT


>I don't agree at all that "Prolog supports polymorphism and data
>abstraction better than many languages." In this respect, it's no better
>than Fortran.

Maybe so, maybe not. The confusion surrounding diff-structures often comes 
from misunderstandings about the semantics of LP. In order to use such beasts
as diff-lists one should:

1) avoid using unification for anything but argument transfer of terms
   with a "user-defined" "type".
2) define a (possibly unlogical) predicate 'diff_equal(X,Y)' for the
representations used.
3) Keep in mind that Prolog unification knows of no equality theory but the 
simplest one, that of the Herbrand universe. 

or
4) Possibly use Harald Soendergaards tools, when available.

Prolog gives nice possibilities to define "datatypes", i.e. user
defined representations with their own equality theory, in a much
cleaner way than FORTRAN, where you would have to define a function
procedure like BOOLEAN EQUAL(X,Y) where X and Y should be coded names
for diff-structures (how this is done without pointers and structures
cannot be considered elegant by any standard...).


--
(Alf) Thomas Sjoeland
SICS, PO Box 1263, S-164 28 KISTA, SWEDEN
Tel: +46 8 752 15 42  Fax: +46 8 751 72 30  Tel home: +46 8 80 44 08
Internet: thomas@sics.se (or the older alf@sics.se)
......
From: hinkle@cs.uiuc.edu (Bob Hinkle)
Newsgroups: comp.lang.smalltalk
Subject: Re: Q: Data watchpoints
Date: 5 Nov 92 05:06:05 GMT
Distribution: usa
Organization: University of Illinois at Urbana-Champaign

In <17854@autodesk.COM> grantb@Autodesk.COM (Grant Blaha) writes:

>Is there any general way to implement data watchpoints for 
>debugging?  

>The technique I have been using is placing halts in all the methods 
>that reference a particular instance variable.  But there a 
>gadzillions of methods to edit.  In addition, stepping through all 
>the halt methods of all the instances when I'm really looking for a 
>particular instance is going to drive me nuts soon. 

First, I agree with another poster that you should use access methods to
get at your instance variables, so you have a convenient way to
watch the use and/or changing of particular variables.  In addition,
I'm working on a project right now that will make things even easier.
It's based on light-weight classes, which allow you to alter the
behavior of a particular object, rather than all objects in a class.
That way, if you have one OrderedCollection (say) whose state you're
interested in, you can set breakpoints for it only.  Finally, the
project includes a way to breakpoint a method without physically
adding the "self halt" and (just as conveniently) without changing
the source, so it won't be reflected in changes.log.  If you're
interested, I can email you my solution when I get done.  (I'm also
hoping to get it published in *The Smalltalk Report*, so you may
see it there someday, too.)

                                 Bob Hinkle
Comments: Gated by NETNEWS@AUVM.AMERICAN.EDU
X-Envelope-to: SMALK@FINHUTC.BITNET
Newsgroups: comp.lang.smalltalk
Date:         Wed, 11 Nov 1992 19:27:49 EDT
From:         Jose Fernando Tepedino Martins <jftm@DI.UFPE.BR>
Subject: Re: A question on ST/V

Yong,

   In Smalltalk/V for Windows, at least in version 1.1, to
insert an item under &File menu in the Transcript window you
should edit the following instance method in class
TextWindow:

         addMenuItem:

   But this is not enough! You should also execute

            Notifier reinitialize

which will close all ST/V windows and open a new transcript
(be careful to save any unsaved work which may possibly be lost).

   Any related doubts, please send me a mail.

       Jose Fernando Tepedino
       (e-mail: jftm@di.ufpe.br)
       Departamento de Informatica
       Universidade Federal de Pernambuco
       Recife      Brazil
Newsgroups: comp.lang.smalltalk