HDTenEightyP/NetNews huggingface dataset:
From: ayers@landshark.micro.umn.edu (Tim Ayers)
Subject: CLX grapher wanted
Organization: University of Minnesota
Date: Tue, 28 Jul 1992 13:22:34 GMT

Does anyone know of any Public Domain Lisp code that lays
out nodes in a directed acyclic graph?  It would be preferable
if it was implemented in clx, but any reasonably generic piece
of code will do.

We have psgraph and are hoping to find something more oriented toward
screen graphics.

Thank you very much,
Tim Ayers
From: barmar@think.com (Barry Margolin)
Newsgroups: comp.lang.lisp
Subject: Xlisp -> comp.lang.lisp.x
Date: 30 Jul 1992 05:52:00 GMT
Organization: Thinking Machines Corporation, Cambridge MA, USA
Distribution: world
NNTP-Posting-Host: gandalf.think.com


There have been several questions recently about Xlisp here.  I think
you're likely to find comp.lang.lisp.x to be a better place to get Xlisp
questions answered.
-- 
Barry Margolin
System Manager, Thinking Machines Corp.

barmar@think.com          {uunet,harvard}!think!barmar
From: barmar@think.com (Barry Margolin)
Newsgroups: comp.lang.lisp
Subject: Re: local macro definitions
Date: 27 Jul 1992 19:22:39 GMT
Organization: Thinking Machines Corporation, Cambridge MA, USA
Distribution: comp.lang.lisp
NNTP-Posting-Host: telecaster.think.com

In article <4133@inca.comlab.ox.ac.uk> gordon@robots.oxford.ac.uk (Gordon Buxton) writes:
>3. Bind each of the slot names to a macro (macrolet ... ?) that then
>gets expanded to (val self '<slot-name>) upon execution.

If I understand you, this seems like the right thing.  The name of the
special form is SYMBOL-MACROLET, and it was invented for use by CLOS for
pretty much the same thing you're doing with your frames (e.g.
WITH-ACCESSORS and WITH-SLOTS expand into SYMBOL-MACROLET forms).

>-- This is the one I like best, but there are two problems:
>   a) The user-code function call is already constructed using the
>      backquote - I'd have to expand macros within this.

This shouldn't be necessary.  It's hard to say for sure, but the right
macro and symbol-macro expansions should all occur automatically.

>   b) I don't know how to do it, or if it is possible

(symbol-macrolet ((<slot-1> (val self '<slot-1>))
		  (<slot-2> (val self '<slot-2>))
		  ...)
  <code that references <slot-N> as variables>)

See CLtL2 for more details.
-- 
Barry Margolin
System Manager, Thinking Machines Corp.

barmar@think.com          {uunet,harvard}!think!barmar
From: barmar@think.com (Barry Margolin)
Newsgroups: comp.lang.lisp
Subject: Re: converting from strings to ___
Date: 22 Jul 1992 21:05:00 GMT
Organization: Thinking Machines Corporation, Cambridge MA, USA
NNTP-Posting-Host: telecaster.think.com

In article <1992Jul22.194639.10131@cs.brown.edu> map@cs.brown.edu (Mike Perkowitz) writes:
>what it really seems like i
>need to be able to do is just "remove the quotes" from the string and turn it
>into a symbol or something.

Sounds like you need to use PARSE-INTEGER, INTERN, or READ-FROM-STRING,
depending on the context.
-- 
Barry Margolin
System Manager, Thinking Machines Corp.

barmar@think.com          {uunet,harvard}!think!barmar
Newsgroups: comp.lang.lisp
From: gumby@Cygnus.COM (David V. Henkel-Wallace)
Subject: Why name your objects? (was Re: creating LISP ...)
	<7011@skye.ed.ac.uk> <dfs.712009536@ro>
Organization: Cygnus Support, Palo Alto, California
Date: 27 Jul 92 05:18:11

   Date: Fri, 24 Jul 1992 20:25:36 GMT
   From: dfs@doe.carleton.ca (David F. Skoll)

   I'm working on a large system where that was done, and it does seem a
   waste.  However, I've found one good reason for doing it that way -
   when objects contain pointers to other objects, it's a bit of a hassle
   to write the database to disk in a nice readable way.  If the pointers
   simply name the objects, it's very easy to write the database to disk.
   Also, it's easy to re-create the database when reading it back from
   disk.

unless you have a very small database, or need to be able to read it
into many lisps, you probably won't want the time it takes to go
through the reader and the printer.  Instead you want to make a
compiled file.
Newsgroups: comp.lang.lisp,uiuc.lisp
From: jmrg9881@uxa.cso.uiuc.edu (Jon Reid)
Subject: Want to prepend colon to symbol
Organization: University of Illinois at Urbana
Date: Thu, 23 Jul 1992 13:47:22 GMT

Can anyone think of a way to prepend a colon to a symbol, i.e., convert foo
to :foo ?  I want to use this in a macro.

(format nil ":~a" 'foo) yields ":foo", a string.  If I could convert this
string back to a symbol, I'd be a happy camper.

Please respond by e-mail as I do not subscribe to this group.

-- Jon Reid  (j-reid@uiuc.edu)
Newsgroups: comp.lang.lisp
From: map@cs.brown.edu (Mike Perkowitz)
Subject: clm & unexpected error message
Keywords: lisp clm motif
Organization: Brown Computer Science Dept.
Date: Fri, 24 Jul 1992 17:00:19 GMT


okay. i'm back, this time with a real problem.

I am working on an application using clm and need some help 
tracking down the following error:

	>>Error: unexpected message: (0)
         
	XTK::RECEIVE-CALLBACK-OR-EVENT:
   	Keyword arg 2 (ALLOW-CONFIRMATION): T
   	Keyword arg 3 (CALLED-FROM-MAIN-LOOP): NIL

which is then followed immediately by the following message
when aborting to the lisp top level:

	>>Error: xt-send-command failed
         
	XTK::TOOLKIT-SEND-COMMAND:
   	Required arg 0 (CODE): 29
   	Required arg 1 (SERIAL): 104
   	Required arg 2 (LIST-OF-ARGS): NIL

The application is a simulator which has one main window which serves
as the control panel, and several auxiliary windows which are based
on transient-shell widgets. The simulator processing code is called 
from the clm event loop by way of a timer callback. The simulation can
then be started and stopped by enabling or disabling the timer.

As far as I can tell, the above referenced error occurs when 
"xtk:quit-application" is called and ONLY when the timer has NOT been 
activated and no timer callbacks have been made. If the timer fires even
just once, all is well. The code within the timer callback appears to be
irrelevent.

Are there any known bugs with clm or motif that might be responsible?
What is the connection with the timer?

Any suggestions or comments will be appreciated.

please post or email sts@cs.brown.edu

----------------------------------------------------------------
     No statement made in a signature file is ever correct.
          Mike Perkowitz              map@cs.brown.edu
----------------------------------------------------------------
From: bill@dewey.edsci.wisc.edu (Bill Roth)
Newsgroups: comp.lang.lisp.franz
Subject: Wierd Error message
Date: 31 Jul 92 19:43:02 GMT
Reply-To: bill@dewey.edsci.wisc.edu
Organization: Physical Sciences Lab, UW-Madison


OK. I'm a rookie. 

Now that I have that said, I keep getting an error message:

0: prompt for a new function, instead of `|TeqA|'.

When I attampt to load a simple ops5 program. What does this mean.  
There is no TeqA function, so I can only assume that it is some  
bizarre notation. What is it?

br
Newsgroups: comp.lang.lisp.franz
From: bill@dewey.edsci.wisc.edu (Bill Roth)
Subject: OPS5
Reply-To: bill@dewey.edsci.wisc.edu
Organization: Physical Sciences Lab, UW-Madison
Date: Fri, 31 Jul 92 17:56:55 GMT

Has anyone gotten the OPS5 ,the one that comes with ACL,  to work?

Bill Roth
From: yedidya@bimacs.BITNET (Yedidya Israel)
Newsgroups: comp.lang.lisp
Subject: SUMMAY: Common Lisp on unix machines
Date: 29 Jul 92 13:27:09 GMT
Organization: Math department, Bar-Ilan University, Ramat-Gan, ISRAEL


Thanks everyone for replying to my query about free cl for unix.

     Shaul Markovitch
     Philip Chu-Summer
     Simon Leinen
     Steven Miale
     Doug <ddyer@afit.af.mil>

and others.

Akcl and cmu-cl is the answer.
--
Israel Yedidya,         Phone:  972-3-5318682 or 972-3-5318407/8
System Administrator,   Fax:    972-3-5353325
Math & CS Department,   Email:  yedidya@bimacs.cs.biu.ac.il
Bar-Ilan University,    Bitnet: yedidya@bimacs
Ramat-Gan, ISRAEL.      Uucp:   ...!uunet!pucc.princeton.edu!bimacs!yedidya
If someone proves there is no God, I'll stop being religious!
Newsgroups: comp.lang.lisp
From: stephen@groucho.csd.uu.se (Stephen Cooper)
Subject: Good book for teaching Functional Programming & Lisp
Organization: UDAC, Uppsala, Sweden
Date: Fri, 24 Jul 1992 10:48:13 GMT

Hello!

  I've written this once, but it didn't seem to get out on the net, so here I go
again.

  I'll be teaching a course in functional programming this autumn, and am looking
for a good course book.

  The current course litterature is Peter Henderson's _Functional Programming,
Application and Implementation_, but the students can hardly afford the book or
justify the price.  Considering that this course is worth only 5 credits (approx
one fourth of a semester) and that not even half of the chapters are covered in
the course, $125 is too expensive.

  I personally am born and raised on Allen's _Anatomy of Lisp_, and think that it
is unsurpassed, but it too costs more than $100  and I can't use even half.
 
  The course covers basically only functional programming and abstract data
structures, and uses Common Lisp.  Please mail me suggestions about other books
(or even books to stay away from) and I will post a summary, if there is an
interest.  A lisp-like syntax is preferred, but not neccessary.
-- 
----------------------------------------------------------------------------
Stephen Cooper				+46-(0)18-18 10 73 (voice)
Computing Science Dept.			+46-(0)18-52 12 70 (fax)
Uppsala University, Sweden		stephen@csd.uu.se
This line is intentionally left blank.
Newsgroups: comp.lang.lisp
From: iscleekk@nuscc.nus.sg (LEE KOK KIONG JAMES)
Subject: Installing KCL
Organization: National University of Singapore
Date: Thu, 23 Jul 1992 06:36:54 GMT

I tried to install Kyoto Common Lisp on a Sun Sparcstation IPX running
Sun OS 4.2.1 but encountered a few problems when making the object
directory.  I set the MACHINE variable in the makefile in the object 
directory to SUN4 but it did not work for all the files.  For certain
source files, the compilation succeeded when I set the MACHINE variable 
to SUN3.  

In addition, the building of char_table.o from sun_chtab.s also failed.
The error messages gave me the impression that the assembly code in
sun_chtab.s is not recognized.

Please help!!!  Please reply by email.

Newsgroups: comp.lang.lisp
From: ppc1@cec1.wustl.edu (Peter Pui Tak Chiu)
Subject: Simplification
Organization: Washington University, St. Louis Mo.
Date: Sat, 25 Jul 1992 11:54:10 GMT


hi everyone,

i have a real naive question:

        how to do symbolic simplification using scheme, lisp or anything...?

what i mean is symbolic simplification like MATHEMATICA.

here are some examples:

          (* a (+ b (/ c a))) ==> (+ (* a b) c)
          (+ (* a b) (* a c)) ==> (* a (+ b c))

these are just very simple cases and are intended to explain what i mean...
i want to know a way to find the "simplest form" of any algebric expression.
not only those which are as simple as the above.

can anyone tell me how to do it or refer me to some books that talk about it?

thanks in advance

peter

Newsgroups: comp.lang.lisp
From: dfs@doe.carleton.ca (David F. Skoll)
Subject: Why name your objects? (was Re: creating LISP ...)
Organization: Dept. of Electronics, Carleton University
Date: Fri, 24 Jul 1992 20:25:36 GMT

In <7011@skye.ed.ac.uk> jeff@aiai.ed.ac.uk (Jeff Dalton) writes:

>This puzzles me too.  I've seen it again and again in AI programs
>such as planners and schedulers, and from time to time I've asked
>the authors why they do it. [create symbols for each instance of
> a data structure - dfs]

>Sometimes they think it's necessary to have an extra level of
>indirection, but whenever I've pressed them on it (so far), it's
>turned out that they aren't actually using the extra indirection
>in any interesting way.

I'm working on a large system where that was done, and it does seem a
waste.  However, I've found one good reason for doing it that way -
when objects contain pointers to other objects, it's a bit of a hassle
to write the database to disk in a nice readable way.  If the pointers
simply name the objects, it's very easy to write the database to disk.
Also, it's easy to re-create the database when reading it back from
disk.

--
David F. Skoll
Newsgroups: comp.lang.lisp
From: wwinston@athena.mit.edu (R. Whitney Winston)
Subject: Re: Want macro to produce 3 function calls
Organization: Massachusetts Institute of Technology
Date: Mon, 27 Jul 1992 18:01:28 GMT

In article <Bs1zz1.E89@news.cso.uiuc.edu>, jmrg9881@uxa.cso.uiuc.edu (Jon Reid) writes:
|> OK, this LISP beginner needs more help.  Here's what I'm trying to do:
|> 
|> There are 3 functions I call whose parameters are closely related.  I'm
|> trying to write a single macro to produce the 3 function calls.
|> 
|> How can I do this?  Every macro I've seen evaluates to *one* list.
|> 
|> -- Jon Reid  (j-reid@uiuc.edu)

You're right, a macro is expanded to one list and then it is eval'd.
You can make 3 function calls as follows:

(defmacro three-calls (one two three)
	`(progn (print ,one)
		(print ,two)
		,three))

>(three-calls '1 '2 '3)
1
2
3
>

---------
>>whitney
<wwinston@athena.mit.edu>
<wwinston@speckle.ncsl.nist.gov>
Newsgroups: comp.lang.lisp,comp.lang.clos,comp.object
From: cer@Franz.COM (Chris Richardson)
Subject: Call for Papers: OOPSLA 92 CLOS workshop
Organization: Franz Inc., Berkeley, CA
Date: Tue, 28 Jul 1992 03:58:31 GMT


			1992 OOPSLA CLOS Workshop

In conjunction with the OOPSLA '92 conference being held in Vancouver,
British Columbia, Canada, on October 18 - 22 1992, a workshop will
be held on the subject of CLOS, the Common Lisp Object System.

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

This workshop aims to bring together users and implementors of CLOS, the
Common Lisp Object System, to discuss the current state of CLOS and future
directions. The workshop will provide a forum for users to exchange their
ideas and experiences and to provide feedback to the implementors.

The workshop will include the following sessions: applications,
implementation techniques, program development tools and future directions.
Also planned is a vendor panel enabling users to communicate what is
important to the vendors and vendors to outline future directions.

If you wish to participate in the workshop please submit a short (2-3 page)
paper on a relevant topic.  Papers that describe how the more interesting
features of CLOS, such as generic functions, method combination, dynamic
class and method redefinition and the metaobject procotol were utilized in
the application or supported by the development environment are especially
welcome.

Please submit position papers by August 15th.

For more information please contact me at the address below.
--
-----
Chris Richardson, Franz Inc.	1995 University Avenue, Suite 275         
cer@Franz.COM (internet)	Berkeley, CA  94704                       
uunet!franz!cer (uucp)		Phone: (510) 548-3600; FAX: (510) 548-8253
From: yedidya@bimacs.BITNET (Yedidya Israel)
Newsgroups: comp.lang.lisp
Subject: Common Lisp on unix machines
Date: 23 Jul 92 18:01:12 GMT
Organization: Math department, Bar-Ilan University, Ramat-Gan, ISRAEL


Hello net.

We are looking for PD Common Lisp for unix machines (SunOS, Ultrix)
I saw there are some (ops5, kcl, akcl etc) which of them is the
newest, which of them is the best ?

Need also graphics environment.

Since I am not subscribed to list list, please email and I'll
summarize.
--
Israel Yedidya,         Phone:  972-3-5318682 or 972-3-5318407/8
System Administrator,   Fax:    972-3-5353325
Math & CS Department,   Email:  yedidya@bimacs.cs.biu.ac.il
Bar-Ilan University,    Bitnet: yedidya@bimacs
Ramat-Gan, ISRAEL.      Uucp:   ...!uunet!pucc.princeton.edu!bimacs!yedidya
If someone proves there is no God, I'll stop being religious!
From: phil@Xenon.Stanford.EDU (Phil Stubblefield)
Subject: Re: Help with EVAL-WHEN
Organization: Computer Science Department, Stanford University.
Date: Tue, 28 Jul 1992 18:32:37 GMT

In article <1992Jul28.120934.9306@cs.yale.edu> loosemore-sandra@CS.YALE.EDU
 (Sandra Loosemore) writes:
>The problem is that the code nested inside the UNLESS is not at 
>top-level.  EVAL-WHEN can cause compile-time evaluation only when
>it appears at top-level, so the inner EVAL-WHEN in your code doesn't
>do anything useful.  Defining forms such as DEFCONSTANT also have
>no compile-time effect unless they appear at top-level.

Sandra,

I think my confusion stems from a misunderstanding of X3J13 action #50, or
DEFINING-MACROS-NON-TOP-LEVEL:ALLOW, if you don't remember off the top of
your head.  :)  I had interpreted the various CLtL/2 references to this vote
to mean that these defining forms would work exactly the same in non-
top-level contexts.  Rereading the top paragraph on p. 84 helped to clarify
that the real issue behind this vote is that the various defining forms
must capture the current lexical environment correctly, although it is
still the case that "certain compile-time side effects of these defining
forms are performed only when the defining forms occur at top level."

>A better way to do this kind of conditionalization would be something
>like this:
>
>(eval-when (:compile-toplevel :load-toplevel)
>  (if (fboundp 'foo) (pushnew :foo-feature *features*)))
>
>#-:foo-feature
>(progn
>  ; code to define your own foo goes here.
>  )
>
>Notice that PROGN does pass "top-level-ness" on to its subforms.
>
>-Sandra

Thanks much!
-- 

Phil Stubblefield                                        (415) 325-7165
Rockwell Palo Alto Laboratory                    phil@rpal.rockwell.com
From: sampson@nosc.mil (Charles H. Sampson)
Newsgroups: comp.lang.ada
Subject: Re: initialization of vars when declared.
Date: 24 Jul 92 17:38:25 GMT
Organization: Computer Sciences Corporation

In article <EMERY.92Jul21093521@Dr_No.mitre.org> emery@Dr_No.mitre.org (David Emery) writes:
>a_variable : array (1..3) of integer := (1,2,3);
>				dave
>(p.s.  many people consider this declaration, which is an anonymous
> array type, to be bad style.  One problem is that the following
> declarations are of two different types:
>	X : array (1..3) of integer;
>	Y : array (1..3) of integer;
> and therefore you can't say "X := Y;")

     True, but as I've said before, there are common occurrences in program-
ming where you know that you're never going to want to say X := Y, or at
least the probability of ever wanting to say it is insignificant.  For
these, the type declaration to give the never-to-be-used type a name is
unnecessary clutter.

				Charlie
Newsgroups: comp.lang.ada,comp.os.msdos.programmer
From: arny@cbnewsl.cb.att.com (arny.b.engelson)
Subject: Passing data from extended mode to real mode programs
Organization: AT&T Bell Laboratories
Date: Mon, 27 Jul 1992 19:59:41 GMT
Followup-To: poster

We are developing some code in (Meridian) Ada that has to run in
extended mode on MS-DOS.  It also has to pass 50K chunks of data to some
COTS software written in C which runs in real mode.  Just how exactly
do we do this?  Specifically, how do we allocate and pass the address of
a data buffer from the extended mode program which is then accessible by
the real mode program?

If you know anything that can help, pleae forward to

  att!homxc!arny  or  a.b.engelson@att.com

Thanks.
Newsgroups: comp.lang.ada
From: mccall@mksol.dseg.ti.com (fred j mccall 575-3539)
Subject: Re: Review of "Ada & C++: A Business Case Analysis
Organization: Texas Instruments Inc
Distribution: usa
Date: Thu, 30 Jul 1992 15:51:45 GMT

In <1992Jul28.213215.25806@fcom.cc.utah.edu> val@news.ccutah.edu (Val Kartchner) writes:

>jonesm@nic.cerf.net (Matthew Jones) writes:
>: Recently I got a copy of:
>: Overiew of U.S. Air Force Report
>: Ada and C++: A Business Case Analysis
>: Form G75-1191
>: AdaCPLUS.HLP
>: 
>: This paper supposedly compares Ada and C++ and of course find Ada
>: to be superior. I found this paper to be filled with errors and
>: very questionable opinion. Here are a few comments

>Here are a few more comments:

>3. Did you notice in the summary that C++ does better in compile-time and
>run-time speed, but Ada is better for real-time?  Aren't run-time speed and
>real-time performance the same thing?  I wonder what other glaring errors
>were made in the reports that didn't make it through to the summary.

No, they aren't the same thing at all.  I wonder what other glaring
errors made it into your evaluations of various languages to arrive at
whatever it is you prefer to use.

>Oh, and before anyone thinks that I'm a C++ bigot let me tell you: I've never
>used C++, but I use Ada at work.  I'd rather not use Ada.

So, what would you prefer to use, and why?

-- 
"Insisting on perfect safety is for people who don't have the balls to live
 in the real world."   -- Mary Shafer, NASA Ames Dryden
------------------------------------------------------------------------------
Fred.McCall@dseg.ti.com - I don't speak for others and they don't speak for me.
From: gt1827a@prism.gatech.EDU (david daniell)
Newsgroups: comp.lang.ada
Subject: Alsys Ada to Turbo Pascal 6.0 Interface?
Date: 21 Jul 92 20:56:27 GMT
Organization: Georgia Institute of Technology

I hope this is not a FAQ -- it's my first experience with this newsgroup . . .

As part of a project that I will be working on in the near future, there
will be a need to interface new Alsys Ada routines to an old Turbo Pascal 6.0
program shell.  The Turbo Pascal shell will act as a user interface to the 
Ada code.  

I am using Alsys Ada Software Development Environment for FirstAda, version
4.4.2.  I am aware that Turbo Pascal does not strongly support mixed-language
programming.  Alsys Ada supports interface calls to Assembler and Microsoft C.
I have considered building a "bridge" between Ada and Pascal using C (such as
Turbo C, which is -- I hope -- compatible with the Microsoft implementation).

Any advice would be greatly appreciated.
Organization: Penn State University
Date: Tue, 28 Jul 1992 15:22:38 EDT
From: Jack W. Sharer <J0S@psuvm.psu.edu>
Newsgroups: comp.lang.ada
Subject: Re: Serial interrupt handler in Meridian Ada on PC?
 <Bruyt1.F0F@immd4.informatik.uni-erlangen.de> <PAT.92Jul27074448@summit.opus>
 <Bs24Is.2Ks@immd4.informatik.uni-erlangen.de>

In article <Bs24Is.2Ks@immd4.informatik.uni-erlangen.de>,
mskuhn@immd4.informatik.uni-erlangen.de (Markus Kuhn) says:
>
>pat@summit.opus (pat gioannini) writes:
>
>>I am wondering how well these drivers work with Ada tasking.
>
>BTW: You find some FOSSIL drivers (e.g. BNU, X00, ...) in
>portal/pc/modem/fossil/:ftp.uni-erlangen.de.
>
>>If the interrupt handler is written in assembly or C or whatever and does
>>not understand Ada tasking you are left with polling the serial driver
>>for a character available.
>
>The perfect solution: The interrupt handler triggers an interrupt after
>e.g. 64 bytes have been received of after a 0.1sec timeout, or ...
>
I would seem like the appropriate FOSSIL hooks are in place.  I would
install a small routine on the timer interrupt hook to peek at the
input buffer.  When a complete incoming message was available, I would
invoke an Ada interrupt routine installed with the FOSSIL "7E" layered
application.  The interrupt routine would read the message and initiate
down stream processing.   I might want to code the timer interrupt
routine in assembler if speed was important.

BTW: Which of the two FOSSIL packages would you use? BNU or X00?