HDTenEightyP/NetNews huggingface dataset:
From: saunders@math.udel.EDU (Dave Saunders)
Subject: Re: C, but with lisp syntax
Organization: The Internet
Date: Wed, 15 Apr 1992 20:48:53 GMT

   >Imagine ANSI C, but with lisp syntax and lisp macros.
   >I.e. a lisp dialect that translates directly to C and
   >needs no implicit runtime library.  Sort of like the
   >ratfor idea, but lisp->c instead of c->fortran.
   >
   >If I have to program in C because my program has to run
   >on several architectures and it has to be really small
   >and fast, at least I could have decent syntax and macros.
   >Now add some sugar to this, like cond which returns a
   >value instead of switch which doesn't, etc. ...
   >
   >Anyone have such a thing?
   >
   > --dave yost

Sounds like you want lisp syntax 
- it doesn't have any (that's the beauty of it) - 
and C data structures and memory management 
- it doesn't have any (thats why you can get small and fast) -  
so to have both is easy.  In lisp syntax, it's

              ()

My appologies in advance for this flip remark, please minimize the return
flames.

-dave saunders

Newsgroups: comp.lang.scheme.c
From: cph@martigny.ai.mit.EDU ("Chris Hanson")
Subject: Problems with 7.1.3 on HP9000/3xx
Organization: The Internet
Date: Thu, 9 Apr 1992 12:46:08 GMT

   Date: 11 Feb 92 21:25:18 GMT
   From: ruf@dolores.Stanford.EDU (Erik Ruf)
   Organization: Computer Systems Laboratory, Stanford University
   Newsgroups: comp.lang.scheme.c
   Sender: info-cscheme-request@altdorf.ai.mit.edu

   I just installed the files on hp400.tar.Z (from altdorf) on my Bobcat
   (HP9000/360) system under HPUX 7.0, and am having problems.  It dies
   with an illegal instruction trap (SIGILL) while trying to load the
   runtime.com band.

   Has anyone else had this problem?  Perhaps the compiled band was built
   on a 68040 machine?  Or is it that we're running HPUX 7.0, while the
   distribution wants 7.0.5?  Any help would be appreciated.  I suppose I
   could rebuild the entire compiler and compiled runtime using the
   interpreter and the .psb files, but that could take days on a 360!

   thanks,
   Erik

The distributed binaries require 7.0.5 because they use a system call
that is not available in earlier releases.

Since that system call is only needed for 68040 machines, you can work
around the problem by rebuilding the executables from the sources.  It
will be compiled without reference to the system call, and should work
fine on your machine.
From: yost@adobe.COM (David Yost)
Newsgroups: comp.lang.scheme.c
Subject: C, but with lisp syntax
Date: 14 Apr 92 18:16:31 GMT
Reply-To: yost@adobe.COM
Organization: Adobe Systems Incorporated

Imagine ANSI C, but with lisp syntax and lisp macros.
I.e. a lisp dialect that translates directly to C and
needs no implicit runtime library.  Sort of like the
ratfor idea, but lisp->c instead of c->fortran.

If I have to program in C because my program has to run
on several architectures and it has to be really small
and fast, at least I could have decent syntax and macros.
Now add some sugar to this, like cond which returns a
value instead of switch which doesn't, etc. ...

Anyone have such a thing?

 --dave yost
From: gorzalka@cs.uni-bonn.de (Werner Gorzalka)
Newsgroups: comp.lang.scheme.c
Subject: ATARI-SCM1c13, ready-to-run, available anywhere ?
Date: 15 Apr 92 10:52:14 GMT
Organization: The Internet

I am looking for a ready-to-run-version, commercially or not,
 for Atari Mega St 1MB,
 especially the    scm1c13
           with    slib1b4


                    Thanks for information,   Werner Gorzalka
From: KARCZMA@FRCAEN51.BITNET
Newsgroups: comp.lang.scheme.c
Subject: installation of 7.1.3
Date: 6 Apr 92 12:38:45 GMT
Organization: The Internet
X-Unparsable-Date: 6 APR 92 13: 02:07.98-GMT

Hi!

(I would rather say: Lo!)

I am trying to install MIT Scheme 7.1.3 on a SUN4 (Sparc).
Some problems.

After having imported the sources from altdorf.ai.mit.edu:archive/scheme-7.1
(src.tar.Z) I compiled them.
Knowing that for some time I won't have the compiler I desactivated the
HAS_COMPILER_SUPPORT option, and...

it turned out that the include file ansidecl.h used in cmpint.c is not loaded
and EXFUN is unknown.

The word C_UTILITY (empty) is declared also under #ifdef  has compiler support.

The same problem in fasload, or rather in the file cmpgc.h:

   #define REFERENCE_LINKAGE_KIND       0x010000
   #define ASSIGNMENT_LINKAGE_KIND      0x020000

are never executed if you don't want the compiler. Of course, it was easy
to correct.

I added to the compilation options where to find the X Windows include
files (this information should be placed somewhere in the configuration
file, this is not super-standard...)

and finally I got the executable scheme.

Could you tell me what now?
I have ONLY the sources. NO RUNTIME support something.bin (nor .com). I couldn't
find any file named psb.tar. Scheme refuses to load without either -band or
-fasl option; I have no -utab file either.

Shall I find somewhere scheme 7.0 and try to install the portable binaries
under a new version, or would you suggest something more elegant?
Thank you, and may the current-continuation be with you.

  Jerzy Karczmarczuk   KARCZMA@FRCAEN51.bitnet
  Laboratoire d'Informatique
  Universite de Caen
  Caen, Basse Normandie, France
From: meyer@fernuni-hagen.de (Bernd Meyer)
Newsgroups: comp.lang.scheme.c
Subject: Re: C, but with lisp syntax
Summary: scheme to c compiler
Date: 15 Apr 92 09:27:05 GMT

In article <1992Apr14.181631.180@adobe.com>, yost@adobe.COM (David Yost) writes:
> Imagine ANSI C, but with lisp syntax and lisp macros.
> I.e. a lisp dialect that translates directly to C and
> needs no implicit runtime library.  Sort of like the
> ratfor idea, but lisp->c instead of c->fortran.
> Anyone have such a thing?

dave,

there is a scheme-to-c compiler available via anon ftp. i enclose a posting
about it but it might be out of date.

bernd


------------> cut here <-----------

Scheme-to-C
-----------

This is a fairly unusual version, in that it takes Scheme code, and
compiles it into C code which can then be compiled by your normal C
compiler. Obviously, this means that it is as good as your C compiler,
in some senses (and also that it produces stand-alone executables,
rather than needing a seperate run-time system. If I ever want to
develop applications using Scheme, this could be a real plus).

The implementation supports a number of extensions, including macros (I
get the impression that macros are available in some form in most
implementations...) and facilities for calling external (ie, C)
routines.

Porting requires a small amount of assembler, for call/cc, but the rest
is fairly portable C.

Availability:

	gatekeeper.dec.com
		directory /pub/DEC/Scheme-to-C
	        files
			README
		        23feb90.tar.Z (older version)
		        28sep90.tar.Z (later version)


------------> cut here <-----------

-- 
Bernd Meyer, LG Praktische Informatik IV, FernUniversitaet Hagen, D-5800 Hagen
Bahnhofstrasse 46/48, FRG, Phone: +49 2331 181677,    ** db6ag@db0hag **
meyer@fernuni-hagen.de     or    meyer@dhafeu61.bitnet 
s=meyer; ou=vax1; ou=informatik; p=fernuni-hagen; a=dbp; c=de
From: KARCZMA@FRCAEN51.BITNET
Newsgroups: comp.lang.scheme.c
Subject: Scheme 7.1.3
Date: 7 Apr 92 15:56:44 GMT
Article-I.D.: bloom-be.9204071556.AA14728
Organization: The Internet
X-Unparsable-Date: 7 APR 92 17: 41:50.53-GMT

Could somebody help me, please...
This is my second attempt.

I am trying to install scheme dist-7.1.3 on SUN4. (No compiler)
Despite the information in the README file at altdorf etc. where all the
distribution package is available
  THERE IS NO psb.tar file.

No binaries to boot the boot!
I tried to Scode the .scm files in runtime/ using the scheme 7.0.
Some binaries generated (and some not).
No .bin file is read by the microcode of 7.1.3 (different subversion).

Has anybody the portable binaries for the 7.1.3 version?

Jerzy Karczmarczuk,
Lab. d'Informatique, Universite de Caen, France
KARCZMA@FRCAEN51  (EARN)
Newsgroups: comp.lang.scheme
From: carbra@sirius.bethel.EDU (Carlson)
Subject: SCHEME
Organization: The Internet
Date: Fri, 10 Apr 1992 14:13:00 GMT


My name is Brad Carlson.  I am a junior Computer Science major ar Bethel College
in St. Paul, MN.  I was looking for a scheme compiler a couple of days ago and
was told about the compiler on your system.  However, what I need to find is a
compiler that will work on the Sun Sparc architecture (not Sun 3) with SunOS 
4.1.  Do you know of any such creature?  Any help would be greatly appreciated.
Thanks.

Brad Carlson
Bethel College
e-mail:  carbra@sirius.bethel.edu
From: hopkins@coulin.turing.ac.uk (Don Hopkins)
Newsgroups: comp.lang.scheme
Subject: deriving quines
Date: 7 Apr 92 01:36:39 GMT
Reply-To: hopkins@uk.ac.turing
Organization: The Turing Institute, Glasgow, Scotland.

A grad student friend of mine once showed me a technique for deriving a quine
(a self reproducing program, that when evaluated, returns itself) in a sufficiently
powerful language, like Scheme or Lisp. 

The classic Lisp (or Scheme) quine is:

(lambda (x)
  (list x (list (quote quote) x))
  (quote
    (lambda (x)
      (list x (list (quote quote) x)))))

Does anybody know of this technique? It totally blew my mind, but I can't remember
the name (somebody or other's theorem of something like that...) all I can remember
is that it had something to do with using a function that took another function as 
an argument, but not actually calling that function, but passing it to another
function, that did something to it, and returned a quine, somehow. Totally magic,
but it worked!

The amazing thing is that it worked for any language whose functions are data. 
I tried it with PostScript and I got it to work, but I've looked around my files and I
can't find it. 

	-Don

PS: the BASIC program:
10 LIST
isn't the kind of program I'm talking about. (Basic isn't powerful enough, anyway.)
Newsgroups: comp.lang.scheme
From: c60a-tf@congo.Berkeley.EDU (Matt Wright)
Subject: Re: deriving quines
Organization: University of California, at Berkeley
Date: Wed, 15 Apr 1992 05:30:29 GMT

In article <1992Apr7.013639.20954@turing.ac.uk> hopkins@uk.ac.turing writes:
->A grad student friend of mine once showed me a technique for deriving a quine
->(a self reproducing program, that when evaluated, returns itself) in a sufficiently
->powerful language, like Scheme or Lisp. 
->
-> [...]
->PS: the BASIC program:
->10 LIST
->isn't the kind of program I'm talking about. (Basic isn't powerful enough,
->anyway.)

Actually, I dimly recall seeing a BASIC program that could print itself, I'm
sorry to say.  That's about the only thing BASIC is powerful enough for,
though, IMHO.  :-) Not to mention that it was 20 or 30 disgusting lines
long; nothing like the incredibly cool ((lambda (lambda) ...)) version.
(Although it won't really work, since LAMBDA is a keyword and can't be a
variable name.  But it's certainly elegant!)

-Matt
From: c60a-tf@congo.Berkeley.EDU (Matt Wright)
Newsgroups: comp.lang.scheme
Subject: Re: Neato Scheme programming problem
Date: 16 Apr 92 16:33:31 GMT
Article-I.D.: pasteur.1992Apr16.163331.29491
Organization: University of California, at Berkeley

bh@anarres.CS.Berkeley.EDU (Brian Harvey) writes:
>sdlee@iuvax.cs.indiana.edu (Shinnder Lee) writes:
>>(define cxr-name
>>  (lambda (f)
>>    (fluid-let
>>      ((car (lambda (x) (cons "A" x)))
>>       (cdr (lambda (x) (cons "D" x)))
>>       (caar (lambda (x) (cons "AA" x)))
>>       [...]
>>       (cddddr (lambda (x) (cons "DDDD" x))))
>>      (display (apply string-append (cons "C" (f (list "R"))))))))
>
>I admit, I hadn't thought of using fluid-let.
Well, it seems like a kludge to me.  What if your Scheme comes with
predefined synonyms for CAR and CDR, e.g. your initialization file contains

(define HEAD CAR)

or something?  (Like for SICP-style streams.) Fluid-let will let you catch
it if you look up a *name* like CADAR, but not if you invoke the same
procedure by a different name.  Still, though, it's neat; I hadn't thought
of using FLUID-LET either and it does have a sort of "so there" appeal.  :-)

>This is fun -- everyone's coming up with solutions different from mine.
>Do we have an archive of neat programming problems online somewhere?

Hear hear!

-Matt
Newsgroups: comp.lang.scheme
From: Pete Harlan <harlan@copper.ucs.indiana.edu>
Subject: Re: MacScheme Folks. Anyone home???
Organization: Indiana University
Date: Thu, 16 Apr 1992 00:41:15 -0500

pnm@goanna.cs.rmit.oz.au (Paul Big-Ears Menon) writes:
|  A few weeks back, I tried contacting LightShip SW, the
|  authors of MacScheme.  I called them on 415 694 7799.
|  Every time I called, I got an answering machine.  Fine,
|  I left a message for them to contact me (phone or fax).
|  No result.  It appears to be Lightship, the machine says
|  so.

The phone number's correct; I talked with them today and asked about
the new version that was supposed to be released today (April 15th).
The new word is late summer.

The new product will be R4RS, and will be 32-bit clean and support
apple events.  The compiler is being rewritten from scratch for the
32-bit-ness, and that's what's causing the delay.

The user interface won't change (groan).  I didn't find out about
upgrade pricing.

I hope this helps; I wish the news were better...

--Pete Harlan
  harlan@copper.ucs.indiana.edu
Newsgroups: comp.lang.scheme,comp.lang.smalltalk,comp.sys.next.misc
From: millerta@ucsu.Colorado.EDU (MILLER TIMOTHY A)
Subject: Survey on future of Object Oriented Programming
Organization: University of Colorado, Boulder
Date: Sat, 11 Apr 1992 17:49:05 GMT

Hi Guys:

I'm doing a Delphi survey on the future of the Object paradigm.
Please respond now, if you want to be included in this survey.
I will be sending out the same questions for a second round in two
days or when I have fifty responses. The second round consists of
the same questions, but it includes the average response and the
range of responses.

Please answer the following questions by responding with a specific
year (max 2050). You may answer these questions by editing this
message or appending the message with the question number
and response.

1) When will there be a  Object CASE tool that gains wide acceptance?

2) What year do you see OO Analysis techniques standardized?

3) What year do your see OO Design techniques standardized?

4) When will you be able to buy useful Objects "off the shelf" for custom
applications?

5A) When will Object Systems account for 30% of the applications being used?
5B) When will Object Systems account for 50% of the applications being used?
5C) When will Object Systems account for 80% of the applications being used?

6A) When do you expect that a background in Object Systems will be a
requirement for 30% of new hires for programming?
6B) When do you expect that a background in Object Systems will be a
requirement for 50% of new hires for programming?
6C) When do you expect that a background in Object Systems will be a
requirement for 80% of new hires for programming?

7) What OO language do you think will dominate by the end of this decade?


Sorry if this when out several times. There were several bugs some of
which are still not resolved.

Please reply to "timothy@eddie.rmnug.org".

Thanks

Tim
From: bh@anarres.CS.Berkeley.EDU (Brian Harvey)
Newsgroups: comp.lang.scheme
Subject: Re: Permutations function need
Date: 15 Apr 1992 14:38:56 GMT
Organization: University of California at Berkeley
NNTP-Posting-Host: anarres.cs.berkeley.edu

I'm under the impression that the proper netiquette for people who post
their homework problems is to offer a hint rather than a solution.  So
here's a hint:

The set of all the permutations of (a b c d) can be divided into two
subsets, namely the ones that start with "a" and the ones that don't.
The ones that start with "a" continue with some permutation of (b c d).
So try to find something along the lines of

(append (prepend (car letters) (perms (cdr letters))) (others ...))

Newsgroups: comp.lang.scheme
From: simong@mundil.cs.mu.OZ.AU (Simon Alexander GREGORY)
Subject: Help with reader
Summary: Need help with reader
Organization: Computer Science, University of Melbourne, Australia
Date: Sun, 12 Apr 1992 01:17:00 GMT

Hello, I have to write a program to read in commas in written text.
However the scheme reader sees this a "quasiquotes".  How do I
read in a ,?
From: ok@goanna.cs.rmit.oz.au (Richard A. O'Keefe)
Newsgroups: comp.lang.scheme
Subject: Re: Help with reader
Date: 13 Apr 92 05:10:59 GMT
Organization: Comp Sci, RMIT, Melbourne, Australia

In article <9210311.6361@mulga.cs.mu.OZ.AU>, simong@mundil.cs.mu.OZ.AU (Simon Alexander GREGORY) writes:
> Hello, I have to write a program to read in commas in written text.
> However the scheme reader sees this a "quasiquotes".  How do I
> read in a ,?

The Scheme standard and the Revised^n Reports on Scheme provide no
way of configuring "read".  This is one of many differences between
Scheme and Common Lisp.  The simplest thing to do is just to use
"read" and then eliminate the 'unquote' forms yourself (, turns into
unquote, not quasiquote).

Example:

(define (unquasi x)
    (if (pair? x)
	(if (and (pair? (car x))
		 (pair? (cdar x))
		 (null? (cddar x))
		 (memq (caar x) '(unquote unquote-splicing quasiquote)))
	    (cons (case (caar x)
			((unquote) (string->symbol ","))
			((unquote-splicing) (string->symbol ",@"))
			((quasiquote) (string->symbol "`")))
		(cons (unquasi (cadar x)) (unquasi (cdr x)))
	    (cons (unquasi (car x)) (unquasi (cdr x))))
	x))

Another approach is to write your own version of (read) and modify that
to your heart's content.  I have just E-mailed a version of read written
in Scheme to simong@mundil.cs.mu.OZ.AU; when I've added a few more
comments and packaged it a bit better I'll send it to nexus.

Of course, a lot depends on what you want to _do_ with ",".
If, for example, you want to read text, such as bibliography entries,
(read) is not likely to be helpful.  
-- 
I am writing a book on debugging aimed at 1st & 2nd year CS students using
C/Modula/Pascal-like languages.  Please send suggestions (other than "you
_must_ cite "C Traps and Pitfalls") to ok@goanna.cs.rmit.oz.au
Newsgroups: comp.lang.scheme
From: iqbal@seas.gwu.edu (Iqbal Qazi)
Subject: Anyone got checkers in scheme?
Originator: iqbal@seas.gwu.edu
Organization: George Washington University
Date: Fri, 10 Apr 1992 16:40:38 GMT


I'm looking for the game of checkers written in scheme.  Anyone know
where I can get one?  I tried a number of ftp sites.  You would think
that checkers would be an ideal game for an AI language?

Thanks,
-- 
~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^^~^|^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~^~
Iqbal Qazi                         | "BUGS:  Rejects any file with the string
Internet-> iqbal@sparko.gwu.edu    | 'IBM' in it.  This is considered a
(or even-> Bitnet:  wq956c@gwuvm)  | feature by some."  - dvips man page 
Newsgroups: comp.human-factors
From: sguerlai@magnus.acs.ohio-state.edu (Stephanie A Guerlain)
Subject: Proposed student column article
Organization: The Ohio State University
Date: Tue, 14 Apr 1992 02:08:43 GMT


A few months ago, I posted a message soliciting advice about whether to get
a PhD or stick with a Master's and get a job.

I'd like to thank everyone (I got over 40 responses!) for their thoughtful and informative advice.  

Besides getting responses from people in industry, I got quite a few 
responses from students who were in the same state of indecision as me and
wanted to hear what kind of replies I had gotten.  Therefore, I thought
this might make a good article for the HFS Bulletin student column (yes, that
was me who just posted soliciting submissions).  

Of course, I would not include anyone's names in the article, but I wanted to
let all of you know that I will be preparing such an article.  If you sent me
advice way back when and specifically do not wante it included, please send
me a note.  Otherwise, I will pick and choose bits from the responses I 
and try to prepare a coherent and informative article.  

Thanks,

Stephanie Guerlain
Cognitive Systems Engineering Lab
The Ohio State University

sguerlai@magnus.acs.ohio-state.edu

Newsgroups: comp.human-factors
From: schaffer@cpsc.ucalgary.ca (Doug Schaffer)
Subject: Re: cost of poor usability metrics
Organization: U. of Calgary Computer Science
Date: Sat, 4 Apr 92 17:22:11 GMT

In article <48993@athertn.Atherton.COM> mcgregor@atherton.com writes:
>I've been thinking about profiling usage during customer usability tests, and
>keeping a ratio of code accessed by users during tests and total code written.
>100% coverage would represent a very usable and desirable set of features, and
>products with coverages near 0% represent low degrees of usability and
>desirability in the feature sets.

I think you should be careful of using a strict formula like coverage to
define a software product's usability and desirability.  Many packages
contain features for various conditions. Some conditions occur frequently
and some rarely.  A "simple" software package that has very few specialized
functions may have a high coverage score, simply because few things can be
done with it, and those that can are done easily.  A package that has lots
of functions that are still very useful and easy to use, but simply aren't
needed that often would have a lower coverage score.

Also, unless the tests are long term studies, many advanced features may not
be used and so they would appear "less desirable", even though, when you
really need to do that particular thing, the "more desirable" package could
not let you do it.

I think your idea deserves looking into, and I would recommend combining this
coverage metric with a number of other evaluation techniques.  I'd like to
see your results.

Doug Schaffer, University of Calgary, schaffer@cpsc.ucalgary.ca

Newsgroups: comp.human-factors
From: sguerlai@magnus.acs.ohio-state.edu (Stephanie A Guerlain)
Subject: HFS Student mailing list
Organization: The Ohio State University
Date: Thu, 16 Apr 1992 21:36:16 GMT


I'm considering starting a mailing list (e-mail, that is) for students 
interested in human factors.  The purpose of this list would be to keep
students abreast of issues specific to them and allow interchange of
ideas and discussion of research topics, etc.  

Any students interested in being included in such a list should send their
e-mail address to me: sguerlai@magnus.acs.ohio-state.edu.  

If there is enough response, I might consider trying to start a newsgroup
instead (like this one).  

Stephanie Guerlain
CSEL