HDTenEightyP/NetNews huggingface dataset:
From: Tim Larkin <tsl1@cornell.edu>
Subject: Re: remove
X-Xxdate: Mon, 23 Nov 92 16: 14:46 GMT
Nntp-Posting-User: tsl1@cornell.edu
Organization: Cornell University
X-Useragent: Nuntius v1.1.1d7
Date: Mon, 23 Nov 1992 16:10:22 GMT

In article <HALTRAET.92Nov20091121@monsun.si.no> Hallvard Tr{tteberg,
haltraet@monsun.si.no writes:
>It shouldn't be difficult to write one that kept the biggest unchanged
>tail of the original list, returning the whole unmodified list if it
>didn't contain the first argument.

On the other hand, Common Lisp, the Manual, states that "the result [of 
remove] is a copy of the input sequence." If you return part of the 
original list, then you change the contract of the function. Sometimes 
one uses remove and requires a totally new list. One must be careful 
about "efficiency".

Tim Larkin
Federal Nutrition Laboratory
Tower Road
Ithaca, New York
tsl1@cornell.edu
607-255-7008
From: barmar@think.com (Barry Margolin)
Newsgroups: comp.lang.lisp
Subject: Re: Evaluating in given environment?
Date: 23 Nov 1992 03:49:15 GMT
Organization: Thinking Machines Corporation, Cambridge MA, USA
Distribution: usa
NNTP-Posting-Host: gandalf.think.com

In article <1992Nov23.025931.27024@beaver.cs.washington.edu> cthomas@cs.washington.edu (Christopher Thomas) writes:
>Problem: I have a macro that takes a form as an argument, and the expansion
>passes that form to a function.  I want the function to evaluate the form,
>but in the lexical environment of the macro expansion.  

You should package it up into a lambda expression, and use the FUNCTION
special form to capture the lexical environment.

>  (defmacro eval-it (form &environment env)
>    `(function-eval-it ',form ',env))

(defmacro eval-it (form)
  `(function-eval-it #'(lambda () (progn ,form))))

(defun function-eval-it (funarg)
  (funcall funarg))

>  (defun function-eval-it (form &rest env)
>    (evalhook form nil nil env))

FYI, that should be "&optional env", shouldn't it?  That isn't even
guaranteed to work for your purposes, since &environment only captures the
macro environment, not the full lexical environment (e.g. variable bindings
aren't necessarily there).
-- 
Barry Margolin
System Manager, Thinking Machines Corp.

barmar@think.com          {uunet,harvard}!think!barmar
From: JJH113@psuvm.psu.edu (Your Puerto Rican neighbor!)
Newsgroups: comp.lang.lisp
Subject: Chess \
Date: 18 Nov 92 18:15:14 GMT
Organization: Penn State University

I need computer chess algorithms (using LISP if possible), if someone
can help me, (maybe references...) please let me know.
Thanks.
Jose.
Xref: sparky comp.lang.lisp:2903 comp.lang.scheme:2607
From: barmar@think.com (Barry Margolin)
Newsgroups: comp.lang.lisp,comp.lang.scheme
Subject: Re: Quote syntax
Date: 18 Nov 1992 09:04:51 GMT
Organization: Thinking Machines Corporation, Cambridge MA, USA
NNTP-Posting-Host: gandalf.think.com

Brian Harvey gave a good explanation of the justification for the Lisp
quoting style.  I just thought I'd mention that MDL, a derivative of Lisp,
did do something like what Michael Werts suggested.  In MDL there was a
separate data type called "form", used for invoking functions, macros, and
special forms.  Its syntax was <operator args>.  List notation, on the
other hand, was (elements), and were literals.  The list accessor functions
also accepted forms, and there were conversion functions for converting
lists to forms and vice versa.

Symbols were also self evaluating (to answer the question at the end of
Brian's posting).  There were special forms to access the local and global
value of a symbol, and reader macros ("." and ",", respectively) to
simplify the use of them.

Thus, the Lisp form (list a *a* 'b '(1 2 3)) would be <list .a ,*a* b (1 2
3)> in MDL.

This is all from ancient memory, so I may have some of the details wrong.
-- 
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: Help: apply for macros ???
Date: 19 Nov 1992 21:17:51 GMT
Organization: Thinking Machines Corporation, Cambridge MA, USA
NNTP-Posting-Host: telecaster.think.com

In article <2610@bigfoot.first.gmd.de> wolf@prosun.first.gmd.de (Wolfgang Koehler) writes:
>Does there exist a similiar solution if "f" is a macro ???

Since macros are source-to-source transformations, this generally doesn't
make sense to do.  If you wrote a function as a macro simply to speed it
up, you should use an inline function rather than a macro.

But if you really want to do it, you could write something kludgey like:

(defun g (&rest args)
  (eval `(f ,@args)))

Note that if the macro expansion results in any of its arguments being
evaluted, they'll be evaluated twice: once as part of the call to G and
later when the macroexpansion of F is executed.

Note: I'm *not* advocating this code, I think it's gross.  But if you have
a macro without a functional counterpart, you sometimes need to do it.
-- 
Barry Margolin
System Manager, Thinking Machines Corp.

barmar@think.com          {uunet,harvard}!think!barmar
Newsgroups: comp.lang.lisp.franz,comp.lang.fortran,comp.lang.pascal,comp.lang.c++
From: r3atm@vax1.cc.uakron.edu (Abeselom T Maasho 3460-457-801.)
Subject: Scoping features and Extent 
Summary: need explanations 
Organization: The University of Akron, Akron, Ohio
Distribution: usa
Date: Wed, 18 Nov 1992 05:32:16 GMT

Hello,
  I am in great need of understanding the scoping and extent of the
languages (pascal, lisp, and fortran).  If anyone can email me with
explanation of how this feature is handled and what goes on to make it
work, it would mean a lot to me since I am supposed to right a paper on
it for my class (2nd yr).  Please not that I am not just interested in
the syntax but additional explanation.
  I hope you will help me out, as best you can as I am desparate.
  Thanking you in advance

Abew

r3atm@vax1.cc.uakron.edu
r3atm@vm1.cc.uakron.edu
  
Newsgroups: comp.lang.lisp,comp.sys.hp
From: nenaas@ulrik.uio.no (Nils-Eivind Naas)
Subject: Re: AKCL on HP snake
Organization: University of Oslo, Norway
Date: Fri, 20 Nov 1992 09:18:02 GMT

In article <1992Nov19.121303.16918@infodev.cam.ac.uk> gt@cl.cam.ac.uk (Graham Titmus) writes:

   Xref: nntp.uio.no comp.lang.lisp:5557 comp.sys.hp:19116
   Newsgroups: comp.lang.lisp,comp.sys.hp
Path: nntp.uio.no!nuug!aun.uninett.no!sunic!mcsun!uunet!pipex!pavo.csi.cam.ac.uk!gt
   From: gt@cl.cam.ac.uk (Graham Titmus)
   Keywords: HP 710 AKCL 
   Sender: news@infodev.cam.ac.uk (USENET news)
   Nntp-Posting-Host: tiger.cl.cam.ac.uk
   Organization: U of Cambridge Computer Lab, UK
   Date: Thu, 19 Nov 1992 12:13:03 GMT
   Lines: 6

   Has anyone managed to get AKCL working on an HP9000/710?  I can get it to build with either cc
   or gcc but it will not compile and load user programs.  It managed to compile and build itself
   perfectly happily though?  Is there something I have forgotten to set up for compile-file that
   just gets done right by the makefiles?

   BTW I picked up AKCL 1-615 and build that.

I cannot say anything about the 710, but the HP-specific version at the
Liverpool archive certainly compiled and executed correctly
with the standard compiler on my 720 (8.05), allowing me to build a
moderately sized application.

I did not do anything particular; I just followed the steps in the
documentation supplied (and I am no programmer, just an ordinary user).

Many other programs in the Liverpool archives do NOT compile with the
standard compiler, but this Lisp system presented no problems for me.

Nils-Eivind Naas, ISAF, Oslo
Newsgroups: comp.lang.lisp
From: dvorak@iam.unibe.ch (Jiri Dvorak)
Subject: LispView, anyone? 
Reply-To: dvorak@iam.unibe.ch
Organization: Dept. of Computer Science, University of Berne, Switzerland
Date: Tue, 17 Nov 1992 12:56:25 GMT

Has the LispView UI vanished from the Lisp users community? As there's almost
no discussion about it here, one can get the impression that it has been dropped
by application developers. 

My problem is: I have an application using LispView that I'd like to use for a
longer-term project. Can I expect the ftp-able source of LispView 1.1 to run in 
the next release of Lucid Lisp on Suns? 
Are there experiences with compiling/running LispView on other
Lisps (Allegro, CMU, ..)? Or should I just drop LispView and rewrite the UI code
using another package?

Thanks,

Jiri Dvorak                    dvorak@iam.unibe.ch
Institute of Computer Science    
University of Berne
Switzerland
From: konstan@saturn.cs.umn.edu (Joe Konstan)
Newsgroups: comp.lang.lisp
Subject: Re: Elegant control structure wanted
Date: 19 Nov 92 18:23:42 GMT
Article-I.D.: news2.1992Nov19.182342.17095
Organization: Department of Computer Science, University of Minnesota

In article <98373@netnews.upenn.edu>, zaidel@muzungu.cis.upenn.edu (Martin J. Zaidel) is trying to modify
|> (defun node-equal (node1 node2)
|>    (and (slot1-equal slot1 slot2)
|> 	(slot2-equal slot1 slot2)
|> 	(slot3-equal slot1 slot2)))
to add format statements to show which slot triggered the inequality.

It seems to me that you have two choices, each of which could add a
bit of elegance.  First, if you are willing to modify slot-1-equal, ..., 
I would suggest putting the format in there (possibly controlled by
an optional parameter):

	(defun slot1-equal (x y &optional (fmt? nil))
          ...)

If this is inappropriate, then I'd go back to basics and use cond.  Recall
that format always returns nil (except for (format nil ...), p 581 CLtL2), so:

	(defun node-equal (node1 node2)
          (cond ((not (slot1-equal node1 node2)) (format t "Slot 1"))
                ((not (slot2-equal node1 node2)) (format t "Slot 2"))
                (t t)))

Another choice to consider is not using format at all, but instead trying one
of the following:

1.  Use values to return multiple values--namely t or nil and when nil the
    slot that failed.

2.  Write the inverse

	(defun difference (node1 node2)
	....

    so that it returns nil when they are equal and the slot name when they 
    aren't.


Joe Konstan
konstan@cs.umn.edu
From: SWM@stony-brook.scrc.symbolics.com (Scott McKay)
Newsgroups: comp.lang.lisp
Subject: Re: CLIM 1.0 source for displaying bitmapped images in a window?
Date: 19 Nov 92 16:31:38 GMT
Organization: LCS news/mail gateway
X-Unparseable-Date: Thu


    Date: Tue, 17 Nov 1992 12:53 EST
    From: Brad Myers <bam+@cs.cmu.edu>

    In article <22897@venera.isi.edu> jas@ISI.EDU (Jeff Sullivan) writes:
    >
    >It would seem like such an obvious thing, yet CLIM 1 can't do it.
    >Does anyone have some code that does do it?  I've heard that you can
    >hack the INK to work...
    >
    >jas
    >--

    Of course, the Garnet toolkit directly supports both black and white 
    bitmaps, and color Pixmaps.

CLIM 1.1 supports abstract pixmap-y things called patterns.  You create
them using MAKE-PATTERN, and can draw them by using them as the ink
argument to any of the drawing functions.

CLIM 2.0 supports pixmaps, color maps (which we call palettes), and
"layered colors" (which give access to color cells and planes).

Pixmaps are different from patterns because patterns are fully
device-independent, whereas pixmaps are device-dependent.  For example,
you can copy bits in and out of a pixmap, but you can't do that with a
pattern.  On the other hand, patterns are portable -- they can be
"saved" and reused on other display devices, etc.
Newsgroups: comp.lang.lisp,comp.lang.lisp.mcl
From: bam+@cs.cmu.edu (Brad Myers)
Newsgroups: comp.lang.lisp
Subject: Re: CLIM 1.0 source for displaying bitmapped images in a window?
Date: 17 Nov 92 17:53:08 GMT
Article-I.D.: cs.BxvGCp.Mq6.2
Distribution: comp
Organization: School of Computer Science, Carnegie Mellon

In article <22897@venera.isi.edu> jas@ISI.EDU (Jeff Sullivan) writes:
>
>It would seem like such an obvious thing, yet CLIM 1 can't do it.
>Does anyone have some code that does do it?  I've heard that you can
>hack the INK to work...
>
>jas
>--

Of course, the Garnet toolkit directly supports both black and white 
bitmaps, and color Pixmaps.

Brad Myers
garnet@a.gp.cs.cmu.edu
Newsgroups: comp.lang.ada,comp.object
From: weide@elephant.cis.ohio-state.edu (Bruce Weide)
Subject: Re: OOD, Ada, and Inheritance
Organization: The Ohio State University Dept. of Computer and Info. Science
Date: Tue, 17 Nov 1992 20:37:50 GMT

In article <1992Nov16.150904.6822@ruby.comlab.ox.ac.uk>
Adolfo.Socorro@prg.oxford.ac.uk (Adolfo Socorro) writes (quoting me):

>>...  In fact, it seems Ada could be extended with (direct
>>language support for) multiple implementations, e.g., by permitting
>>separate naming of package specs and bodies and a way of binding them
>>together at instantiation time.  See a paper by M. Sitaraman in Proc.
>>ICCL, Apr 1992, for some ideas on how this could be done.  
>
>This work is much more older, dating back to the specification language Clear
>and more recently to the language LIL. See
>
>  @ARTICLE{Goguen:computer86,
>    AUTHOR  = "Goguen, Joseph",
>    TITLE   = "Reusing and Interconnecting Software Components",
>    JOURNAL = "Computer",
>    MONTH   = "February",
>    YEAR    = 1986,
>    VOLUME  = 19,
>    NUMBER  = 2,
>    PAGES   = "16-28"}
>

Just to clarify, I wasn't contending that the paper I mentioned
contains the first reference to multiple implementations!  Of course
this is not a new idea.  What that paper contains, however, is a
specific proposal for how to include support for multiple
implementations in Ada, with fairly minor changes.
    -Bruce

Newsgroups: comp.lang.ada
From: tne@world.std.com (Thomas N Erickson)
Subject: Re: OS/2 compatible Ada
Keywords: OS/2, Ada
Organization: The World Public Access UNIX, Brookline, MA
Date: Fri, 20 Nov 1992 05:10:17 GMT

christy@melair.UUCP (Chris Tyson) writes:

>Hi, 

>This may be a FAQ, but I haven't seen discussion on it before.
>I'm looking for an OS/2 compatible Ada.  If anyone knows of one 
>I'd appreciate the info.

We at Alsys have an OS/2 Ada.  It has been on the market for a couple of
years, so it is quote robust.  Please call Scott Dorman (617)270-0030 for
more information.



-- 
Tom Erickson
Alsys
tne@world.std.com
Newsgroups: comp.lang.ada
From: mfeldman@seas.gwu.edu (Michael Feldman)
Subject: Re: Ada/Ed: a PC-XT (8088) version?
Organization: George Washington University
Date: Fri, 20 Nov 1992 21:49:35 GMT

In article <1992Nov12.234910.29569@coe.montana.edu> uesu03@giac1.oscs.montana.edu (Lou Glassy) writes:
>A question for those of you who've used Ada/Ed.  Is it possible
>to compile the sources for Ada/Ed to run on an 8088-based PC (not
>386) ?  Have you tried to do this?
No, but the original was built ona 286 about 5-6 years ago. Given the
memory limitations, it was useless. I think that is why NYU left it on
the shelf. Speed wasn't the worst thing, it was RAM.

Don't even think about it.
>
>I know Ada/Ed is not exactly zippy on the 20-Mhz 386's we have here,
>so obviously it would run even more slowly on an XT-class machine...
>but a NEC-V20-powered Grid laptop is what I have at home, so I'm wondering...
If I were you, I'd invest $99.00 in a Meridian compiler, which will
indeed run on your machine. I've run it on XT's with 640k. It's slow but
usable. Call 800-221-2522; ask for the education person.
>
Cheers -

Mike
------------------------------------------------------------------------
Michael B. Feldman
co-chair, SIGAda Education Committee

Professor, Dept. of Electrical Engineering and Computer Science
School of Engineering and Applied Science
The George Washington University
Washington, DC 20052 USA
(202) 994-5253 (voice)
(202) 994-5296 (fax)
mfeldman@seas.gwu.edu (Internet)

"Americans wants the fruits of patience -- and they want them now."
------------------------------------------------------------------------
Newsgroups: comp.lang.ada
From: dawe@nobeltech.se (Daniel Wengelin)
Subject: Re: Outputting quote marks
Organization: NobelTech AB
Date: Mon, 23 Nov 1992 19:58:07 GMT

In article <1992Nov22.170456@lglsun.epfl.ch> nebbe@lglsun.epfl.ch (Robb Nebbe) writes:
>In article <1992Nov22.124601.4138@nobeltech.se>, dawe@nobeltech.se (Daniel Wengelin) writes:
>|> In article <By13E7.4q5@plato.ds.boeing.com> rosen@plato.ds.boeing.com (Robert Rosen) writes:
>|> >I need to use Text_IO to output a string consisting of three
>|> >consecutive quote marks (""").  How can I do it?  Trying 
>|> >
>|> >  Text_IO.Put_Line (""""");
>|> >
>|> >produces a compilation error.
>|> >
>|> >Bob Rosen
>|> >Boeing
>|> >rosen@goofy.ds.boeing.com
>|> >206-773-2852
>|> 
>|> 
>|> Try Put_Line(%"""%); It works fine on my Rat, and is much more 
>|> readable than a large number of quotation characters (LRM 2.10).
>
>If you read LRM 2.10 a little closer you will see that %"""% should be
>illegal for any Ada compiler LRM 2.10(4) However you are right about it
>being much more readable and it probably should be legal.
>
>Robb Nebbe                     nebbe@lglsun.epfl.ch




How true, how true. I am beginning to realize that the Rational is
sometimes more user-friendly than I deserve, which may definitely
cause these results when replying in a "only read LRM if test fails"-
mode.

The Rational behaviour does however raise a question. What the Rat
does is to reformat the (%"""%) into the valid ("""""") (hope I got
that one right) automatically. I never saw it happen when I tried
it out.

Is this a strictly legal behaviour of an APSE? If I enter
PUT(%"""%); and compile, I would expect LRM2.10(4) to
require an error, but instead the APSE silently changes
my source to something legal. Any LRM-lawyer has a comment?


                     Daniel


----------------------------------------------------------------
!    with Standard_Disclaimer;                                 !
----------------------------------------------------------------
!    Daniel Wengelin               ! E-mail: dawe@nobeltech.se !
!    Systems analysis and design   ! Phone : +46 8 58084000    !
!    NobelTech Systems             ! Fax   : +46 8 58081542    !
!    Naval Systems Division        ! Mail  : S-17588 Jarfalla  !
!                                  !         SWEDEN            !
----------------------------------------------------------------
! NobelTech: Winner of the -92 Ada Industry Leadership Award   !
----------------------------------------------------------------
Newsgroups: comp.lang.ada
From: dawe@nobeltech.se (Daniel Wengelin)
Subject: Texas Instruments TMS320C3201 
Organization: NobelTech AB
Distribution: comp.lang.ada
Date: Sun, 15 Nov 1992 18:09:24 GMT


I am promoting the use of Ada in all aspects of our business, and I'm
need of some more ammo:

Does anyone know if there is an Ada compiler for the TI TMS320C3201 ??
Maybe Tartan...., but I don't know. Help humbly requested.



                 Daniel.


----------------------------------------------------------------
!    with Standard_Disclaimer;                                 !
----------------------------------------------------------------
!    Daniel Wengelin               ! E-mail: dawe@nobeltech.se !
!    Systems analysis and design   ! Phone : +46 8 58084000    !
!    NobelTech Systems             ! Fax   : +46 8 58081542    !
!    Naval Systems Division        ! Mail  : S-17588 Jarfalla  !
!                                  !         SWEDEN            !
----------------------------------------------------------------
! NobelTech: Winner of the -92 Ada Industry Leadership Award   !
----------------------------------------------------------------
Newsgroups: comp.lang.ada,comp.object
From: weide@elephant.cis.ohio-state.edu (Bruce Weide)
Subject: Re: OOD, Ada, and Inheritance
Organization: The Ohio State University Dept. of Computer and Info. Science
Date: Fri, 20 Nov 1992 15:26:25 GMT

In article <1992Nov13.224508.18746@beaver.cs.washington.edu>
chambers@cs.washington.edu writes (the only response so far to my
request for "good" examples of the need for dynamic selection among
multiple implementations of the same abstraction):
>
>In my implementation of the Self compiler, I use "run-time selection
>among different implementation" to good effect in several data
>structures.  One of the simplest is a collection of parse tree classes
>(in C++), each for a different kind of language construct.  Simulating
>this in Ada would require tagged variant records or something, without
>behavior attached to each variant.  A more complex data structure is a
>control flow graph, with different classes for each kind of CFG node
>(e.g. add, branch, merge).  All CFG nodes support a common protocol,
>but with widely-varying implementations.  No node knows what kind of
>node is its successor or predecessor, only its interface.
>

Craig, I don't really understand this example very well as an
illustration of the problem at hand.  Perhaps by "multiple
implementations" we mean two different things?  I'm thinking of an
interface as defining a SINGLE abstract behavior -- not just method
name and parameter profile, but also a specification of that behavior
in implementation-neutral terms.  Any such behavior might have more
than one possible implementation.

It sounds like you might be thinking of multiple SIMILAR BUT NOT
IDENTICAL abstract behaviors, and considering them to be different
"implementations" of the same "protocol."  Is this a correct
assumption?

Cheers,
    -Bruce
From: pendell@ceti.csustan.edu (Brian Pendell)
Newsgroups: comp.lang.ada
Subject: Dynamic Tasking in ADA.
Summary: Attempting to write a linked list of tasks in ADA.
Date: 16 Nov 92 19:19:41 GMT
Followup-To: same
Distribution: na
Organization: CSU Stanislaus

I am attempting to write a number of tasks for an ADA program. However,
the number of necessary tasks is not known at compile time. Thus, I
must use a dynamic data structure to hold the tasks. Since  I do not
believe ADA allows dynamic arrays, I have decided on a doubly-linked list
of tasks as a close approximation. 

Now, I must do the following:
    1. declare and elaborate the task type.
    2. Instantiate my generic list package for this task type. 
    3. write the  task body.

Previously, I had elaborated the task type, then instantiated the list 
package, then written the task body. The ada compiler I am using did not
understand this, telling me that my package instantiation occurred too late
in the source code. 

My next solution was to declare the task type, then instantiate the package
for the type, then elaborate the task type and the task body. The result
is that I cannot pass an "accept" to my tasks .. the compiler tells me
that this is an illegal operation on an incomplete type. 

I'm stuck. How am I going to 
A. build a task and 
B. Instantiate my linked list package so I can have a linked list of tasks?

Any help would be GREATLY appreciated. 

Thanks, 
	-- Brian Pendell (pendell@ceti.csustan.edu)
From: news@fedfil.UUCP (news)
Newsgroups: comp.lang.ada
Subject: Re: More Ashamedness of Ada - this time OBJECT WORLD
Date: 16 Nov 92 00:14:11 GMT
Organization: HTE

In article <1992Nov11.142808.17224@aber.ac.uk>, btk@aber.ac.uk (Benjamin Thomas Ketteridge) writes:
 
^every day. I would prefer to use the Alsys Ada compiler, but that is no longer
^supported by our local support team :-( the DEC Ada compile-time messages are
^very good, but it suffers from C-like run-time error-messages (this is not
^surprising since the main program of DEC Ada programs is actually in C!)

You wouldn't expect them to write anything that complex in a goof language
like Ada, would you?

-- 
Ted Holden
HTE

Newsgroups: comp.lang.ada