HDTenEightyP/NetNews huggingface dataset:
From: sl@wimsey.bc.ca (Stuart Lynne)
Subject: Re: LOGO has saved the day :>
Organization: Wimsey 
Date: Wed, 19 Aug 1992 20:31:18 GMT

In article <Bt70w8.G1n@hq.crad.dnd.ca> newsome@hq.crad.dnd.ca (Brent G. Newsome) writes:
>
>	to computers.  When I was in Grade 7, we had the first
>	full fledged computer lab and course in Ontario.  We were
>	using Commodore 64's.  And rightly or wrongly Logo was 

Hmmm.. I went to high school in Windsor in the late sixties. We had our
own computer (IBM 1403) and two years of computer science courses at
the grade ten and eleven level. I guess that's not quite the same as
a computer lab, but it was definitely a fully fledged computer course.
Quite uptodate for it's time, Fortran II and everything :-)


-- 
Stuart Lynne <sl@wimsey.bc.ca> ....................... UNIX Facsimile Software
Wimsey Information Technologies ................... moderator biz.sco.binaries
uucp login:nuucp passwd:nuucp .................. ftp.wimsey.bc.ca:~ftp/ls-lR.Z
PD Software for SCO UNIX .................. ftp.wimsey.bc.ca:~ftp/pub/wimseypd
Newsgroups: comp.lang.logo
From: trier@odin.ins.cwru.edu (Stephen C. Trier)
Subject: Object Logo (was Re: Logo is based on 1960s...)
Organization: Case Western Reserve University, Cleveland, OH (USA)
Date: Sun, 16 Aug 92 17:34:17 GMT

In article <1992Aug5.143104.16220@newshost.lanl.gov> gam@beta.lanl.gov (Gim Mark) writes:
>Object Logo allows you to use traditionally "pure" Logo, if that's
>what you want.  It offers in addition a systematic and complete
>object-oriented version of Logo.

Could you describe how Object Logo extends the language?  I'm curious just
how it integrates object-oriented programming into Logo.  Does it come up
with some sort of class abstraction, or does it deal directly with the
objects themselves?

-- 
Stephen Trier                      "I am not a lawyer, though I play one
Network Services Engineering        on the net."
CWRU IRIS/INS/Telecom                  Chris Torek, torek@horse.ee.lbl.gov
trier@ins.cwru.edu
From: bg@dymaxion.ns.ca
Newsgroups: comp.lang.logo
Subject: Re: LOGO has saved the day :>
Date: 19 Aug 92 20:02:38 GMT
Organization: Dymaxion Research Limited, NS, Canada

In article <168489C6A.SDENARO@vm.poly.edu>, SDENARO@vm.poly.edu writes:
>
> Why is everyone Pascal bashing?
>  

Pascal has fallen out of favor for various reasons, none of which have
anything to do with its suitability as a teaching tool.  I learned
a great deal of what I know about structured programming by programming
in Pascal.  However, since then, I have only once had to go anywhere
near Pascal for a real project, and that was only to patch someone
else's code.  This is probably typical.  Pascal is not considered to
be a "serious" language anymore, just like BASIC.

I believe that more can be learned about programming by becoming multi-lingual
than by focusing on one language.  Pascal is as good a next step from Logo as
any other.  The student can take what can be learned from Pascal about
programming and use it to shape what has already been learned from Logo.  Each
additional language learned augments what the student already knows.

The choice of Pascal over any other language as a starting language is a
personal one.  Not everyone may benefit from the Pascal experience as much as I
did.  Some people would rather go learn C or assembler because they are closer
to the machine.  Some people would rather learn Visual BASIC or ProGraph
because they are visually oriented.  And so on.  There is no objectively
correct next step.  So don't take other people's word for it.  They will fight
for whatever language turns their crank.  If it is possible, give the student a
broad overview of languages by allowing them to work on projects with those who
already are competent in each language and let them choose their personal
favourite to focus in on.  This, after all, is more in keeping with the Logo
philosophy of learning.

Ben.
---
Ben Armstrong, Software Development                  bus: (902)422-1973
Dymaxion Research Ltd.,                              fax: (902)421-1267
Halifax, Nova Scotia, Canada B3J 1R2            Internet: bg@dymaxion.ns.ca
Newsgroups: comp.lang.logo
From: bh@anarres.CS.Berkeley.EDU (Brian Harvey)
Newsgroups: comp.lang.logo
Subject: Re: LOGO has saved the day :>
Date: 20 Aug 92 05:19:35 GMT
Organization: University of California at Berkeley
NNTP-Posting-Host: anarres.cs.berkeley.edu

SDENARO@vm.poly.edu writes:
>>#  I will start him on Pascal in a year or two.
>The only options I have seen are Pascal and BASIC. [...]

I think Ken's point was that Logo itself is a perfectly good vehicle for
advanced study.  We Logo people tend to go berserk when someone talks
about what a great introduction Logo is, and then just assumes that the
goal is to move on to something else.  People who learn Pascal first
don't seem to feel that way about Pascal!

I want to make two different points about this:

1.  Aside from the particular languages involved, I think many kids have
the idea that learning computer science means learning a dozen programming
languages.  You can, indeed, get some valuable insights from studying how
and why various languages differ, but I think that for a beginner it's
better to get some depth in one language; beginners aren't ready for a
comparative languages study and instead often learn a lot of details
superficially.

2.  The same qualities that make Logo both easy and powerful for a beginner
also make it both easy and powerful for a more advanced learner.  These
qualities include automatic garbage collection, list processing, freedom
from type declarations and array sizing, a uniform evaluation model (everything
is a procedure), and dynamic scope.  As a pedagogic tool I wrote a Pascal
compiler in Logo (it's in the third volume of my _Computer Science Logo Style_)
and it was enormously easier than the reverse would be.  I'd hesitate to write
a Logo interpreter in Pascal under any circumstances, and I certainly wouldn't
expect to use the resulting program as an object of study for children.

As for "Pascal bashing," the point isn't really how good or bad Pascal is
on some absolute scale, but rather that Pascal represents a coherent point
of view about the nature of computer programming in general that's really
strongly opposed to that represented by Logo.  When you speak of moving
from Logo to Pascal as if that were a simple progression, rather than a
dramatic shift of perspective, it's disconcerting.

(Should I elaborate on that?  If you have access to _The Computing Teacher_
you can read my article "Symbolic Programming vs. the A.P. Curriculum" in
vol 18 no 5, Feb 1991.  Or I could post it or mail it if you like.)
From: brent@ssd.csd.harris.com (Brent Benson)
Newsgroups: comp.lang.logo
Subject: Re: LOGO has saved the day :>
Date: 19 Aug 92 21:13:17 GMT
	<168489C6A.SDENARO@vm.poly.edu>
Organization: Harris Computer Systems

SDENARO@vm.poly.edu writes:
>
> I have never heard of scheme or Oberon. I don't like LISP or BASIC.
> And, lest we forget, this is for an 11 year old. LISP is not easy. I
> have yet to meet an 11 year old AI researcher.

(Pardon this digression from pure Logo discussion.)  

Nonsense.  Lisp is easy to learn.  A person can learn a small and
useful subset of most Lisp dialects (e.g., Scheme) in an hour or two.
I'm talking about non-programmers.  The primary advantage is Lisp's
lack of syntax.  Everything's an atom or a list.  The rules for
evaluation are simple.  Most Lisps provide an interactive environment
where getting useful feedback is easy.

> I think Pascal is a nice language. It is easy to learn; and, if
> nothing else, It show that everyone must put up with stupid rules in
> order to get a job done.

These statements seem contradictory to me.  Pascal isn't that easy to
learn because "everyone must put up with stupid rules in order to get
the job done" (IMHO).  Many institutions of higher learning have
realized this and are switching to Scheme as the first programming
language taught to incoming students.

--
Brent Benson                     brent@ssd.csd.harris.com
Systems Software Development
Harris Computer Systems
From: davidg@oracorp.com (David Guaspari)
Newsgroups: comp.lang.logo
Subject: FAQ?
Date: 19 Aug 92 16:25:45 GMT
Article-I.D.: oracorp.1992Aug19.162545.411
Distribution: usa
Organization: ORA Corporation, Ithaca, New York

Is there an FAQ for this newsgroup?  I'm looking for general
information about Logo implementations (on IBM PC clones) and
about texts, instruction manuals, etc.
Newsgroups: comp.lang.logo
From: newsome@hq.crad.dnd.ca (Brent G. Newsome)
Subject: Re: LOGO has saved the day :>
Organization: Chief, Research & Development, National Defence
Date: Tue, 18 Aug 1992 19:02:31 GMT

In article <16846BBA1.SDENARO@vm.poly.edu> SDENARO@vm.poly.edu writes:
>After playing with LOGO for ten minutes to show him what to do,
>I left. I figured LOGO and "Flight" are better than "Kill-Fest II".
> 
>His mother has since told me that he spends 2 or 3 hours a day writing
>programs, His mother bought a book on logo. He is looking forward to the
>start o school so he can show his teachers what he can do.
> 
>I will start him on Pascal in a year or two.
> 
>The thing about the computer that he is drawn to is that it will
>to listen to him for as long as he is willing to listen to him.
> 
>I do not think logo is to old. I demand more money be put into
>languages for kids. It may turn them on to the use of computers,
>not just for programing, but to there use in other fields.
> 

	I agree with you Logo is a good tool to introduce children
	to computers.  When I was in Grade 7, we had the first
	full fledged computer lab and course in Ontario.  We were
	using Commodore 64's.  And rightly or wrongly Logo was 
	a big part of one of the programming topic.  Out of my
	class I know several people who were motivated to
	go on in computer studies of some sort.  Other students
	were quick to catch on and Logo probably was a neat and
	fun way to introduce them to being able to tell the computer
	what to do.

	Like anything, Logo is just a tool, it all depends on how
	and in what situation it is applied. 

	Brent
	newsome@drdcs.slate.crad.dnd.ca
From: pereira@alice.att.com (Fernando Pereira)
Newsgroups: comp.lang.prolog
Subject: Re: transitive and symetric relations
Date: 13 Aug 92 00:15:51 GMT
Article-I.D.: alice.23435
Reply-To: pereira@alice.UUCP ()
Distribution: comp.lang.prolog
Organization: AT&T, Bell Labs

In article <SWK.92Aug10220513@seymour.mlb.semi.harris.com> swk@seymour.mlb.semi.harris.com (Song W. Koh) writes:
>[...]  I am having trouble describing transitive and
>symetric relations without stack overflows.  Things like:
>
>distance(X,Y,D) :- distance(Y,X,D).
>
>and
>
>distance(X,Z,D) :- distance(X,Y,D1), distance(Y,Z,D2), D is D1 + D2.
>
As some other posters have noted, if you see Prolog as a *programming
language* with a particular operational semantics, the looping is
not surprising. Compare for instance the C function

int distance(x, y)
Point *x, *y;
{
   return distance(y, x);
}

It will surely loop and very possibly run out of stack (unless the
C compiler is clever enough do do some sort of last-call optimization).

Problems of the kind you describe, which involve computing closures of
relations, are best processed with a bottom-up or memoizing execution method
rather than the top-down execution method built into Prolog. These
methods avoid looping by goals already attempted and conclusions already
reached to avoid retrying them. These methods can be simulated in Prolog by
using assert judiciously. My book

@book(Pereira+Shieber:Prolog,
	Author={Fernando C. N. Pereira and Stuart M. Shieber},
	Key={Pereira and Shieber},
	Title={Prolog and Natural-Language Analysis},
	Publisher={Center for the Study of Language and Information},
	Number={10},
	Address={Stanford, California},
	Series={CSLI Lecture Notes},
	Year={1985},
	Note={Distributed by Chicago University Press}
)

discusses some of those methods, althout it might be nice to have
a tutorial introduction to them in a more general stetting (Is there
one?)

Alternatively, for particular relations you can keep track of points/nodes
already visited with an extra argument in the relevant predicates of
your program (some other posting also referred to this technique).

Fernando Pereira
2D-447, AT&T Bell Laboratories
600 Mountain Ave, PO Box 636
Murray Hill, NJ 07974-0636
pereira@research.att.com
From: stott@bop.cs.ucla.edu (Dr D Stott Parker)
Newsgroups: comp.lang.prolog
Subject: single_var_warnings
Date: 19 Aug 92 18:15:51 GMT
Organization: University of California, Los Angeles

Regarding singleton variable warnings in SICStus Prolog,
there is actually a flag that can be used to suppress them:

	 (44) > sicstus0.7
	SICStus 0.7 #1: Fri Oct 25 09:12:35 PDT 1991
	| ?- prolog_flag(single_var_warnings,X,X).

	X = on ? 

	yes
	| ?- [user].      
	| test(X).   
	{Warning: [X] - singleton variables in test/1 in lines 10-11}
	| {user consulted, 0 msec 340 bytes}

	yes
	| ?- prolog_flag(single_var_warnings,_,off).

	yes
	| ?- [user].
	| test(X).
	| {user consulted, 0 msec 48 bytes}

	yes
	| ?- 

However, I think most Prolog programmers would strongly recommend leaving
it on.   A very large percentage of typing and simple logic errors in
Prolog programs are detected with these warnings; one will usually
save time by following the single-variable style discipline.

D. Stott Parker  (stott@cs.ucla.edu)  UCLA Computer Science Dept.
+1 (213) 825-6871, 825-1322 secy.     3532 Boelter Hall
+1 (213) 825-2273 FAX                 Los Angeles, CA 90024-1596  USA
-- 
D. Stott Parker  (stott@cs.ucla.edu)  UCLA Computer Science Dept.
+1 (213) 825-6871, 825-1322 secy.     3532 Boelter Hall
+1 (213) 825-2273 FAX                 Los Angeles, CA 90024-1596  USA
From: ken@aiai.ed.ac.uk (Ken Johnson)
Newsgroups: comp.lang.prolog
Subject: Re: transitive and symetric relations
Date: 14 Aug 92 10:21:09 GMT
Followup-To: comp.lang.prolog
Organization: Bugs-R-Us


In article <1992Aug13.111745.17980@odin.diku.dk> torbenm@diku.dk (Torben
AEgidius Mogensen) writes:

#  A correct formulation of the transitive clause is
#
#  distance(X,Z,D) :-
#	distance_fact(X,Y,D1),
#	distance(Y,Z,D2),
#	D is D1 + D2.

This may loop indefinitely.  For instance, suppose you invoked it with

         ?- distance(london,paris,X).

when `paris' was not mentioned in any distance fact.

-- Ken "old lag" Johnson


-- 
////  Advice to dieters:          ////  Ken Johnson, A I Applications Institute
////    Never eat more than       ////       80 South Bridge, EDINBURGH EH1 1HN
////    you can carry.            ////                 E-mail ken@aiai.ed.ac.uk
////               -- Miss Piggy  ////     phone 031-650 2756  fax 031-650 6513
Newsgroups: comp.lang.prolog
From: byu@csri.toronto.edu (Benjamin Yu)
Subject: Re: another SBPROLOG Question.
Organization: CSRI, University of Toronto
Date: 14 Aug 92 12:19:08 GMT

Isn't there a shell script somewhere that sets the environment variable
SBPDIR, VERSION, MEMORY, SIMPATH?  What you need is:

set SBPDIR=~/SBProlog
set VERSION='Version 3.0'
set MEMORY=1000000
setenv SIMPATH $SBPDIR/lib:$SBPDIR/modlib:$SBPDIR/cmplib:
$SBPDIR/sim/sbprolog -m $MEMORY $SBPDIR/modlib/\$readloop

Benjamin Yu
From: vagelis@aifh.ed.ac.uk (Vagelis Vassiliadis)
Newsgroups: comp.lang.prolog
Subject: SICStus prolog "call_residue/2"
Date: 18 Aug 92 00:28:39 GMT
Reply-To: vagelis@aifh.ed.ac.uk (Vagelis Vassiliadis)
Organization: Dept of AI, University of Edinburgh, Scotland

I'm working with SICStus v2.1 and use the "call_residue/2" 
coroutining primitive. This primitive though, has an unpredictable 
behaviour in that it returns frozen goals in an order completely random 
and irrelevant to the order that these goals froze.

Could anyone explain how this primitive sorts the frozen goals.
(if it does sort them ).

----------------------
Vassiliadis Vagelis
vagelis@aisb.ed.ac.uk
----------------------
From: imai@icot.or.jp (Imai Akira)
Newsgroups: comp.lang.prolog
Subject: Re: Knights Tour
Date: 14 Aug 92 05:50:17 GMT
Organization: Institute for New Generation Computer Technology, Tokyo, Japan


> If anyone knows of any repositories of source code to solve these
> sorts of problems (Knights Tour, N-Queens problem, etc.) I would
> appreciate any tips. I enjoy these sorts of problems so anyone
> who knows of interesting variations on the Knight's Tour or
> N-Queens problem etc. I would like to hear about them. 

Please consult Dr. Evan Tick of University of Oregon. (His E-mail
address is "tick@cs.uoregon.edu"). He has source codes of both
Knights Tour and N-Queens problem with different algorithms.

You can get them via anonymous FTP.

---
Akira IMAI (imai@icot.or.jp)
Institute for New Generation Computer Technology (ICOT), Japan
Newsgroups: comp.lang.prolog
From: matsc@sics.se (Mats Carlsson)
Subject: Re: SICStus Prolog singleton warnings slow down while consulting a file
Organization: Swedish Institute of Computer Science, Kista
Date: Mon, 17 Aug 1992 22:17:14 GMT

In article <1992Aug17.172126.19111@watson.ibm.com> rah@ybrig.zurich.ibm.com (Ralf Hauser) writes:

   [...]

   Does anybody know, how to suppress these warnings or to
   maintain the same expressivity of code without creating those
   "singleton variables".

To suppress the warnings, simply do:

| ?- prolog_flag(single_var_warnings, _, off).

Regards, Mats.

PS.  Your return address, "rah@ybrig.zurich.ibm.com", does not work.
DS.
--
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
From: gdb0@ns1.cc.lehigh.edu (GLENN BLANK)
Newsgroups: comp.lang.prolog
Subject: Pipes or sockets in Prolog?
Date: 18 Aug 92 18:58:59 GMT
Organization: Lehigh University

I would like to set up interprocess communcication, under Unix,
between a C program and a Quintus Prolog program.  Currently, the
C program is writing Prolog-style lists to a file which the Prolog
program subsequently reads.  Communicating through a named pipe
or a socket would be more seamless and efficient, but I don't know
how to get a Quintus Prolog program to interact with pipes or sockets.
Any ideas out there?
From: palmm@csc2.essex.ac.uk (Palmer M J)
Newsgroups: comp.lang.prolog
Subject: Re: SICStus Prolog singleton warnings slow down while consulting a file
Keywords: singleton
Date: 18 Aug 92 16:09:01 GMT
Reply-To: palmm@essex.ac.uk (Palmer M J)
Organization: University of Essex, Colchester, UK

In article <1992Aug17.172126.19111@watson.ibm.com> rah@ybrig.zurich.ibm.com (Ralf Hauser) writes:
>
>Does anybody know, how to suppress these warnings or to
>maintain the same expressivity of code without creating those
>"singleton variables".

Some systems (e.g. Qunitus Prolog) allow you to use the form _VarName. 
This is still an anonymous variable but with a name. You might like to try
this.

Mike.
Newsgroups: comp.lang.prolog
Subject: Re: Logix for SUN OS 4.1.1 or SOLARIS 2.0?
From: eitan@wiscon.weizmann.ac.il (Shternbaum Eitan)
Date: Thu, 13 Aug 1992 05:39:38 GMT
Organization: Weizmann Institute of Science, Computation Center.
Originator: eitan@pashosh.wisdom.weizmann.ac.il


contact bill@wisdom.weizmann.ac.il [Bill Silverman] He's one of the Key reserchers
who had developed this sofware.

Eitan Shterenbaum
Newsgroups: comp.lang.prolog
From: okp@cs.tu-berlin.de (Oli Paulus)
Subject: graph-utilities needed
Organization: Technical University of Berlin, Germany
Date: Thu, 13 Aug 1992 12:32:14 GMT

Hello,

I'writing a program for my thesis and ran into a graph-problem.

Given a directed graph that may contain arbitrary cycles, represented
as a list of From-To node tuples, I need to perform two tasks:

- remove all redundant links from the graph

- detect all cycles and 'shrink' them into a single node

Shrinking means that all the nodes in the cycle will be removed
and a shrinknode will be inserted into the graph, which will be
connected to all nodes that had a link to any of the cycle's nodes
before (Was that precise enough?).

I'm using quintus prolog (the predicates I need are not in the
library), but solutions in any other dialect will do.

I'd greatly appreciate any hints, implementations, pointers to
literature, newsgroups, ftp-sites or whatsoever you think I could use.


Thanks for helping,  OliKai
Newsgroups: comp.lang.prolog
From: marti@nugget.inf.ethz.ch (Robert Marti)
Subject: Re: transitive and symetric relations
Organization: Dept. Informatik, Swiss Federal Institute of Technology (ETH), Zurich, CH
Date: Fri, 14 Aug 1992 16:29:19 GMT

In article <7199@skye.ed.ac.uk>, ken@aiai.ed.ac.uk (Ken Johnson) writes:
|> In article <1992Aug13.111745.17980@odin.diku.dk> torbenm@diku.dk (Torben
|> AEgidius Mogensen) writes:
|> #  A correct formulation of the transitive clause is
|> #
|> #  distance(X,Z,D) :-
|> #	distance_fact(X,Y,D1),
|> #	distance(Y,Z,D2),
|> #	D is D1 + D2.
|> This may loop indefinitely.

Agreed.


|> For instance, suppose you invoked it with
|>          ?- distance(london,paris,X).
|> when `paris' was not mentioned in any distance fact.

Hardly, as seen below.  (Note that since there is no distance_fact
in the program, your precondition is fulfilled.  Also, the dynamic
declaration may not be necessary in your flavor of Prolog.)

----- Begin Included Transscript -----
  mint[254]: prolog
  SICStus 2.1 #5: Tue May 12 12:04:21 MET DST 1992
  | ?- [user].
  | :- dynamic distance_fact/3.
  | distance(X,Z,D) :-
       distance_fact(X,Y,D1),
       distance(Y,Z,D2),
       D is D1 + D2.
  | {user consulted, 40 msec 672 bytes}

  yes
  | ?- distance(london,paris,X).

  no
  | ?- ^D
------ End Included Transscript ------

However, the goal  ?- distance(london,paris,X)  leads to an infinite
loop in Prolog if you can deduce both the facts
  distance_fact(london,paris,_)
and
  distance_fact(paris,london,_)
from your program.

-- 
Robert Marti                    |  Phone:    +41 1 254 72 60
Informationssysteme             |  FAX:      +41 1 262 39 73
ETH-Zentrum                     |  E-Mail:   marti@inf.ethz.ch
CH-8092 Zurich, Switzerland     |
Newsgroups: comp.lang.prolog
From: jonas@quintus.com (Jonas Almgren)
Subject: Re: SICStus Prolog singleton warnings slow down while consulting a file
Organization: Quintus Corporation
Date: Wed, 19 Aug 1992 19:15:46 GMT

It's probably a bad idea to completely switch off singleton warnings.
You'll definitely have to pay a price in uncaught bugs as you keep on
with the development of your program.

I'm not sure about SICStus, but in Quintus Prolog, it's enough to
use '_' (underscore) as the first character in the variable name,
and no singleton warning will be given for that variable. Personally,
I think it's good programming style to use such variable names for
singeltons, whenever it isn't clear from the context why the singleton
can be ignored. As Ralf points out, just a '_' doesn't make the code more
readable.
Newsgroups: comp.lang.prolog
From: kubali@athena.mit.edu (Volkan C Kubali)
Subject: Constraint Handling in Prolog?
Keywords: Prolog, constraints, planning
Organization: Massachusetts Institute of Technology
Date: Thu, 20 Aug 1992 16:51:01 GMT

	Could anyone suggest a source of information about constraint
handling systems in Prolog? The ones relevant to planning/scheduling
problems would especially be useful.
Newsgroups: comp.lang.prolog
From: mmarx@Csli.Stanford.EDU (Matthew Marx)
Subject: Re: BinProlog 1.39
Organization: Stanford University CSLI
Distribution: comp.lang.prolog
Date: Sat, 22 Aug 1992 22:29:40 GMT

In <1992Aug22.022633.1540@IRO.UMontreal.CA> tarau@IRO.UMontreal.CA (Paul Tarau) writes:

>A new version (1.39) of BinProlog for SPARC, SUN3, NEXT and 386/486 is
>now available.

Is there a Macintosh version available? Any ftp-able Mac prolog interpreter?


> 139.103.16.2 (clement.info.umoncton.ca) in the directory BinProlog. 

-- 
Matt Marx       mmarx@csli.stanford.edu           
"Too many hands on my time..." -- Peart


Newsgroups: comp.lang.prolog